Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r222-tall-165286025300515.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldPPPs-PT-100A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025300515
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.5K Apr 30 03:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 30 03:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 30 03:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 30 03:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 08:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 907K May 10 09:34 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 ShieldPPPs-PT-100A-LTLCardinality-00
FORMULA_NAME ShieldPPPs-PT-100A-LTLCardinality-01
FORMULA_NAME ShieldPPPs-PT-100A-LTLCardinality-02
FORMULA_NAME ShieldPPPs-PT-100A-LTLCardinality-03
FORMULA_NAME ShieldPPPs-PT-100A-LTLCardinality-04
FORMULA_NAME ShieldPPPs-PT-100A-LTLCardinality-05
FORMULA_NAME ShieldPPPs-PT-100A-LTLCardinality-06
FORMULA_NAME ShieldPPPs-PT-100A-LTLCardinality-07
FORMULA_NAME ShieldPPPs-PT-100A-LTLCardinality-08
FORMULA_NAME ShieldPPPs-PT-100A-LTLCardinality-09
FORMULA_NAME ShieldPPPs-PT-100A-LTLCardinality-10
FORMULA_NAME ShieldPPPs-PT-100A-LTLCardinality-11
FORMULA_NAME ShieldPPPs-PT-100A-LTLCardinality-12
FORMULA_NAME ShieldPPPs-PT-100A-LTLCardinality-13
FORMULA_NAME ShieldPPPs-PT-100A-LTLCardinality-14
FORMULA_NAME ShieldPPPs-PT-100A-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653009580469

Running Version 202205111006
[2022-05-20 01:19:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 01:19:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 01:19:42] [INFO ] Load time of PNML (sax parser for PT used): 210 ms
[2022-05-20 01:19:42] [INFO ] Transformed 3103 places.
[2022-05-20 01:19:42] [INFO ] Transformed 2603 transitions.
[2022-05-20 01:19:42] [INFO ] Found NUPN structural information;
[2022-05-20 01:19:42] [INFO ] Parsed PT model containing 3103 places and 2603 transitions in 414 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldPPPs-PT-100A-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100A-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100A-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100A-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100A-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100A-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 391 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:19:42] [INFO ] Computed 1101 place invariants in 43 ms
[2022-05-20 01:19:44] [INFO ] Implicit Places using invariants in 1893 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:19:44] [INFO ] Computed 1101 place invariants in 17 ms
[2022-05-20 01:19:46] [INFO ] Implicit Places using invariants and state equation in 1494 ms returned []
Implicit Place search using SMT with State Equation took 3414 ms to find 0 implicit places.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:19:46] [INFO ] Computed 1101 place invariants in 23 ms
[2022-05-20 01:19:47] [INFO ] Dead Transitions using invariants and state equation in 1435 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/3103 places, 2603/2603 transitions.
Support contains 31 out of 3103 places after structural reductions.
[2022-05-20 01:19:47] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-20 01:19:48] [INFO ] Flatten gal took : 342 ms
FORMULA ShieldPPPs-PT-100A-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 01:19:48] [INFO ] Flatten gal took : 202 ms
[2022-05-20 01:19:48] [INFO ] Input system was already deterministic with 2603 transitions.
Support contains 29 out of 3103 places (down from 31) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 671 ms. (steps per millisecond=14 ) properties (out of 15) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:19:50] [INFO ] Computed 1101 place invariants in 7 ms
[2022-05-20 01:19:51] [INFO ] [Real]Absence check using 1101 positive place invariants in 248 ms returned sat
[2022-05-20 01:19:54] [INFO ] After 3587ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-20 01:19:55] [INFO ] [Nat]Absence check using 1101 positive place invariants in 201 ms returned sat
[2022-05-20 01:19:57] [INFO ] After 2050ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-20 01:19:57] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 6 ms to minimize.
[2022-05-20 01:19:57] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 1 ms to minimize.
[2022-05-20 01:19:58] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 1 ms to minimize.
[2022-05-20 01:19:58] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
[2022-05-20 01:19:58] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2022-05-20 01:19:58] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2022-05-20 01:19:58] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2022-05-20 01:19:58] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 0 ms to minimize.
[2022-05-20 01:19:59] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 0 ms to minimize.
[2022-05-20 01:19:59] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2022-05-20 01:19:59] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2022-05-20 01:19:59] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 0 ms to minimize.
[2022-05-20 01:19:59] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 0 ms to minimize.
[2022-05-20 01:20:00] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 0 ms to minimize.
[2022-05-20 01:20:00] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 0 ms to minimize.
[2022-05-20 01:20:00] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 0 ms to minimize.
[2022-05-20 01:20:00] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 0 ms to minimize.
[2022-05-20 01:20:01] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
[2022-05-20 01:20:01] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 0 ms to minimize.
[2022-05-20 01:20:01] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 0 ms to minimize.
[2022-05-20 01:20:01] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3955 ms
[2022-05-20 01:20:02] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2022-05-20 01:20:02] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2022-05-20 01:20:02] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 0 ms to minimize.
[2022-05-20 01:20:02] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 1 ms to minimize.
[2022-05-20 01:20:03] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 0 ms to minimize.
[2022-05-20 01:20:03] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2022-05-20 01:20:03] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2022-05-20 01:20:03] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2022-05-20 01:20:03] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1634 ms
[2022-05-20 01:20:04] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2022-05-20 01:20:04] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 0 ms to minimize.
[2022-05-20 01:20:04] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 0 ms to minimize.
[2022-05-20 01:20:04] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 0 ms to minimize.
[2022-05-20 01:20:04] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 0 ms to minimize.
[2022-05-20 01:20:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 837 ms
[2022-05-20 01:20:06] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 4 ms to minimize.
[2022-05-20 01:20:06] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2022-05-20 01:20:06] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 0 ms to minimize.
[2022-05-20 01:20:06] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2022-05-20 01:20:06] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2022-05-20 01:20:06] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 787 ms
[2022-05-20 01:20:06] [INFO ] After 11395ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1580 ms.
[2022-05-20 01:20:08] [INFO ] After 14375ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 1600 ms.
Support contains 18 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 13 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Partial Free-agglomeration rule applied 888 times.
Drop transitions removed 888 transitions
Iterating global reduction 0 with 888 rules applied. Total rules applied 892 place count 3101 transition count 2601
Applied a total of 892 rules in 792 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3103 places, 2601/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 388 ms. (steps per millisecond=25 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 7) 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 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:20:12] [INFO ] Computed 1101 place invariants in 121 ms
[2022-05-20 01:20:13] [INFO ] [Real]Absence check using 1048 positive place invariants in 214 ms returned sat
[2022-05-20 01:20:13] [INFO ] [Real]Absence check using 1048 positive and 53 generalized place invariants in 20 ms returned sat
[2022-05-20 01:20:15] [INFO ] After 3443ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-20 01:20:16] [INFO ] [Nat]Absence check using 1048 positive place invariants in 209 ms returned sat
[2022-05-20 01:20:16] [INFO ] [Nat]Absence check using 1048 positive and 53 generalized place invariants in 11 ms returned sat
[2022-05-20 01:20:29] [INFO ] After 12455ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-20 01:20:33] [INFO ] Deduced a trap composed of 5 places in 271 ms of which 1 ms to minimize.
[2022-05-20 01:20:33] [INFO ] Deduced a trap composed of 6 places in 262 ms of which 1 ms to minimize.
[2022-05-20 01:20:34] [INFO ] Deduced a trap composed of 5 places in 237 ms of which 1 ms to minimize.
[2022-05-20 01:20:34] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 2 ms to minimize.
[2022-05-20 01:20:34] [INFO ] Deduced a trap composed of 5 places in 220 ms of which 1 ms to minimize.
[2022-05-20 01:20:34] [INFO ] Deduced a trap composed of 7 places in 225 ms of which 0 ms to minimize.
[2022-05-20 01:20:35] [INFO ] Deduced a trap composed of 9 places in 213 ms of which 0 ms to minimize.
[2022-05-20 01:20:35] [INFO ] Deduced a trap composed of 5 places in 220 ms of which 1 ms to minimize.
[2022-05-20 01:20:35] [INFO ] Deduced a trap composed of 7 places in 230 ms of which 0 ms to minimize.
[2022-05-20 01:20:36] [INFO ] Deduced a trap composed of 5 places in 213 ms of which 0 ms to minimize.
[2022-05-20 01:20:36] [INFO ] Deduced a trap composed of 6 places in 210 ms of which 1 ms to minimize.
[2022-05-20 01:20:36] [INFO ] Deduced a trap composed of 6 places in 210 ms of which 1 ms to minimize.
[2022-05-20 01:20:37] [INFO ] Deduced a trap composed of 5 places in 210 ms of which 1 ms to minimize.
[2022-05-20 01:20:37] [INFO ] Deduced a trap composed of 7 places in 205 ms of which 0 ms to minimize.
[2022-05-20 01:20:37] [INFO ] Deduced a trap composed of 5 places in 216 ms of which 0 ms to minimize.
[2022-05-20 01:20:38] [INFO ] Deduced a trap composed of 5 places in 200 ms of which 1 ms to minimize.
[2022-05-20 01:20:38] [INFO ] Deduced a trap composed of 5 places in 212 ms of which 10 ms to minimize.
[2022-05-20 01:20:38] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 0 ms to minimize.
[2022-05-20 01:20:38] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 1 ms to minimize.
[2022-05-20 01:20:39] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 1 ms to minimize.
[2022-05-20 01:20:39] [INFO ] Deduced a trap composed of 5 places in 189 ms of which 1 ms to minimize.
[2022-05-20 01:20:39] [INFO ] Deduced a trap composed of 5 places in 185 ms of which 0 ms to minimize.
[2022-05-20 01:20:40] [INFO ] Deduced a trap composed of 5 places in 181 ms of which 1 ms to minimize.
[2022-05-20 01:20:40] [INFO ] Deduced a trap composed of 7 places in 178 ms of which 0 ms to minimize.
[2022-05-20 01:20:40] [INFO ] Deduced a trap composed of 5 places in 206 ms of which 1 ms to minimize.
[2022-05-20 01:20:40] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 0 ms to minimize.
[2022-05-20 01:20:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 01:20:40] [INFO ] After 25202ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 2 properties in 2097 ms.
Support contains 12 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 3101 transition count 2601
Applied a total of 1 rules in 297 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 324 ms. (steps per millisecond=30 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 78630 steps, run timeout after 3004 ms. (steps per millisecond=26 ) properties seen :{3=1}
Probabilistic random walk after 78630 steps, saw 77801 distinct states, run finished after 3005 ms. (steps per millisecond=26 ) properties seen :1
Running SMT prover for 4 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:20:47] [INFO ] Computed 1101 place invariants in 35 ms
[2022-05-20 01:20:48] [INFO ] [Real]Absence check using 1048 positive place invariants in 204 ms returned sat
[2022-05-20 01:20:48] [INFO ] [Real]Absence check using 1048 positive and 53 generalized place invariants in 20 ms returned sat
[2022-05-20 01:20:50] [INFO ] After 3513ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-20 01:20:51] [INFO ] [Nat]Absence check using 1048 positive place invariants in 206 ms returned sat
[2022-05-20 01:20:51] [INFO ] [Nat]Absence check using 1048 positive and 53 generalized place invariants in 11 ms returned sat
[2022-05-20 01:21:15] [INFO ] After 24005ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 01:21:15] [INFO ] After 24017ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-20 01:21:15] [INFO ] After 25040ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 10 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 161 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 378 ms. (steps per millisecond=26 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 84668 steps, run timeout after 3014 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 84668 steps, saw 83812 distinct states, run finished after 3015 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:21:19] [INFO ] Computed 1101 place invariants in 38 ms
[2022-05-20 01:21:20] [INFO ] [Real]Absence check using 1048 positive place invariants in 207 ms returned sat
[2022-05-20 01:21:20] [INFO ] [Real]Absence check using 1048 positive and 53 generalized place invariants in 20 ms returned sat
[2022-05-20 01:21:23] [INFO ] After 3477ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-20 01:21:24] [INFO ] [Nat]Absence check using 1048 positive place invariants in 187 ms returned sat
[2022-05-20 01:21:24] [INFO ] [Nat]Absence check using 1048 positive and 53 generalized place invariants in 10 ms returned sat
[2022-05-20 01:21:48] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 10 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 166 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 136 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:21:48] [INFO ] Computed 1101 place invariants in 42 ms
[2022-05-20 01:21:50] [INFO ] Implicit Places using invariants in 1808 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:21:50] [INFO ] Computed 1101 place invariants in 30 ms
[2022-05-20 01:21:52] [INFO ] Implicit Places using invariants and state equation in 1792 ms returned []
Implicit Place search using SMT with State Equation took 3604 ms to find 0 implicit places.
[2022-05-20 01:21:52] [INFO ] Redundant transitions in 201 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:21:52] [INFO ] Computed 1101 place invariants in 30 ms
[2022-05-20 01:21:54] [INFO ] Dead Transitions using invariants and state equation in 1452 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(p0))))'
Support contains 2 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Applied a total of 4 rules in 279 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:21:54] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:21:56] [INFO ] Implicit Places using invariants in 1507 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:21:56] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 01:21:57] [INFO ] Implicit Places using invariants and state equation in 1527 ms returned []
Implicit Place search using SMT with State Equation took 3035 ms to find 0 implicit places.
[2022-05-20 01:21:57] [INFO ] Redundant transitions in 129 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:21:57] [INFO ] Computed 1101 place invariants in 9 ms
[2022-05-20 01:21:59] [INFO ] Dead Transitions using invariants and state equation in 1413 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3101/3103 places, 2601/2603 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3103 places, 2601/2603 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s1047 0) (EQ s656 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 6553 steps with 0 reset in 140 ms.
FORMULA ShieldPPPs-PT-100A-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100A-LTLCardinality-00 finished in 5266 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U G(X(p1))))'
Support contains 4 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 123 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:21:59] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 01:22:01] [INFO ] Implicit Places using invariants in 1483 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:22:01] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 01:22:02] [INFO ] Implicit Places using invariants and state equation in 1441 ms returned []
Implicit Place search using SMT with State Equation took 2926 ms to find 0 implicit places.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:22:02] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:22:03] [INFO ] Dead Transitions using invariants and state equation in 1401 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/3103 places, 2603/2603 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s2141 0) (EQ s1465 1)), p0:(OR (EQ s2053 0) (EQ s170 1))], nbAcceptance=1, 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 25073 reset in 4767 ms.
Product exploration explored 100000 steps with 25042 reset in 4992 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 240 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:22:14] [INFO ] Computed 1101 place invariants in 14 ms
[2022-05-20 01:22:15] [INFO ] [Real]Absence check using 1101 positive place invariants in 208 ms returned sat
[2022-05-20 01:22:17] [INFO ] After 2606ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 01:22:18] [INFO ] [Nat]Absence check using 1101 positive place invariants in 208 ms returned sat
[2022-05-20 01:22:39] [INFO ] After 20982ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 01:22:39] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 0 ms to minimize.
[2022-05-20 01:22:40] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
[2022-05-20 01:22:40] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 2 ms to minimize.
[2022-05-20 01:22:40] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 10 ms to minimize.
[2022-05-20 01:22:40] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 2 ms to minimize.
[2022-05-20 01:22:40] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2022-05-20 01:22:40] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2022-05-20 01:22:41] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1318 ms
[2022-05-20 01:22:41] [INFO ] After 22632ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 102 ms.
[2022-05-20 01:22:41] [INFO ] After 23572ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 193 ms.
Support contains 4 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Partial Free-agglomeration rule applied 895 times.
Drop transitions removed 895 transitions
Iterating global reduction 0 with 895 rules applied. Total rules applied 899 place count 3101 transition count 2601
Applied a total of 899 rules in 418 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3103 places, 2601/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 91551 steps, run timeout after 3005 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 91551 steps, saw 90667 distinct states, run finished after 3005 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:22:45] [INFO ] Computed 1101 place invariants in 36 ms
[2022-05-20 01:22:46] [INFO ] [Real]Absence check using 1046 positive place invariants in 196 ms returned sat
[2022-05-20 01:22:46] [INFO ] [Real]Absence check using 1046 positive and 55 generalized place invariants in 12 ms returned sat
[2022-05-20 01:22:48] [INFO ] After 2928ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 01:22:49] [INFO ] [Nat]Absence check using 1046 positive place invariants in 199 ms returned sat
[2022-05-20 01:22:49] [INFO ] [Nat]Absence check using 1046 positive and 55 generalized place invariants in 12 ms returned sat
[2022-05-20 01:23:13] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 140 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 181 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:23:13] [INFO ] Computed 1101 place invariants in 35 ms
[2022-05-20 01:23:15] [INFO ] Implicit Places using invariants in 1769 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:23:15] [INFO ] Computed 1101 place invariants in 43 ms
[2022-05-20 01:23:17] [INFO ] Implicit Places using invariants and state equation in 1774 ms returned []
Implicit Place search using SMT with State Equation took 3544 ms to find 0 implicit places.
[2022-05-20 01:23:17] [INFO ] Redundant transitions in 72 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:23:17] [INFO ] Computed 1101 place invariants in 36 ms
[2022-05-20 01:23:18] [INFO ] Dead Transitions using invariants and state equation in 1450 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 131 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:23:19] [INFO ] Computed 1101 place invariants in 36 ms
[2022-05-20 01:23:19] [INFO ] [Real]Absence check using 1046 positive place invariants in 199 ms returned sat
[2022-05-20 01:23:19] [INFO ] [Real]Absence check using 1046 positive and 55 generalized place invariants in 11 ms returned sat
[2022-05-20 01:23:21] [INFO ] After 2874ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 01:23:22] [INFO ] [Nat]Absence check using 1046 positive place invariants in 201 ms returned sat
[2022-05-20 01:23:22] [INFO ] [Nat]Absence check using 1046 positive and 55 generalized place invariants in 28 ms returned sat
[2022-05-20 01:23:51] [INFO ] After 29453ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 7 factoid took 261 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Support contains 4 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 121 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:23:52] [INFO ] Computed 1101 place invariants in 7 ms
[2022-05-20 01:23:53] [INFO ] Implicit Places using invariants in 1468 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:23:53] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 01:23:54] [INFO ] Implicit Places using invariants and state equation in 1433 ms returned []
Implicit Place search using SMT with State Equation took 2901 ms to find 0 implicit places.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:23:54] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:23:56] [INFO ] Dead Transitions using invariants and state equation in 1420 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/3103 places, 2603/2603 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 217 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:23:57] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 01:23:58] [INFO ] [Real]Absence check using 1101 positive place invariants in 211 ms returned sat
[2022-05-20 01:24:00] [INFO ] After 2596ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 01:24:00] [INFO ] [Nat]Absence check using 1101 positive place invariants in 212 ms returned sat
[2022-05-20 01:24:20] [INFO ] After 19683ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 01:24:20] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 0 ms to minimize.
[2022-05-20 01:24:21] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2022-05-20 01:24:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 390 ms
[2022-05-20 01:24:21] [INFO ] After 20441ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 113 ms.
[2022-05-20 01:24:21] [INFO ] After 21407ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 138 ms.
Support contains 4 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Partial Free-agglomeration rule applied 895 times.
Drop transitions removed 895 transitions
Iterating global reduction 0 with 895 rules applied. Total rules applied 899 place count 3101 transition count 2601
Applied a total of 899 rules in 390 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3103 places, 2601/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 100187 steps, run timeout after 3007 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 100187 steps, saw 99269 distinct states, run finished after 3007 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:24:25] [INFO ] Computed 1101 place invariants in 35 ms
[2022-05-20 01:24:26] [INFO ] [Real]Absence check using 1046 positive place invariants in 208 ms returned sat
[2022-05-20 01:24:26] [INFO ] [Real]Absence check using 1046 positive and 55 generalized place invariants in 12 ms returned sat
[2022-05-20 01:24:28] [INFO ] After 3027ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 01:24:29] [INFO ] [Nat]Absence check using 1046 positive place invariants in 203 ms returned sat
[2022-05-20 01:24:29] [INFO ] [Nat]Absence check using 1046 positive and 55 generalized place invariants in 11 ms returned sat
[2022-05-20 01:24:53] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 137 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 142 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:24:53] [INFO ] Computed 1101 place invariants in 29 ms
[2022-05-20 01:24:55] [INFO ] Implicit Places using invariants in 1769 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:24:55] [INFO ] Computed 1101 place invariants in 30 ms
[2022-05-20 01:24:57] [INFO ] Implicit Places using invariants and state equation in 1765 ms returned []
Implicit Place search using SMT with State Equation took 3535 ms to find 0 implicit places.
[2022-05-20 01:24:57] [INFO ] Redundant transitions in 72 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:24:57] [INFO ] Computed 1101 place invariants in 37 ms
[2022-05-20 01:24:59] [INFO ] Dead Transitions using invariants and state equation in 1450 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 128 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:24:59] [INFO ] Computed 1101 place invariants in 45 ms
[2022-05-20 01:24:59] [INFO ] [Real]Absence check using 1046 positive place invariants in 197 ms returned sat
[2022-05-20 01:24:59] [INFO ] [Real]Absence check using 1046 positive and 55 generalized place invariants in 11 ms returned sat
[2022-05-20 01:25:02] [INFO ] After 2945ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 01:25:02] [INFO ] [Nat]Absence check using 1046 positive place invariants in 205 ms returned sat
[2022-05-20 01:25:02] [INFO ] [Nat]Absence check using 1046 positive and 55 generalized place invariants in 12 ms returned sat
[2022-05-20 01:25:31] [INFO ] After 29249ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 7 factoid took 238 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 25039 reset in 4839 ms.
Product exploration explored 100000 steps with 25018 reset in 5067 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Support contains 4 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 10 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3103 transition count 2603
Deduced a syphon composed of 2 places in 10 ms
Applied a total of 2 rules in 564 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
[2022-05-20 01:25:42] [INFO ] Redundant transitions in 70 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:25:42] [INFO ] Computed 1101 place invariants in 10 ms
[2022-05-20 01:25:44] [INFO ] Dead Transitions using invariants and state equation in 1415 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3103/3103 places, 2603/2603 transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/3103 places, 2603/2603 transitions.
Product exploration timeout after 83130 steps with 20761 reset in 10001 ms.
Product exploration timeout after 82230 steps with 20458 reset in 10003 ms.
Built C files in :
/tmp/ltsmin8319632879616604231
[2022-05-20 01:26:04] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8319632879616604231
Running compilation step : cd /tmp/ltsmin8319632879616604231;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8319632879616604231;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8319632879616604231;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 165 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:26:07] [INFO ] Computed 1101 place invariants in 7 ms
[2022-05-20 01:26:09] [INFO ] Implicit Places using invariants in 1520 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:26:09] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 01:26:10] [INFO ] Implicit Places using invariants and state equation in 1514 ms returned []
Implicit Place search using SMT with State Equation took 3040 ms to find 0 implicit places.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:26:10] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:26:12] [INFO ] Dead Transitions using invariants and state equation in 1437 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/3103 places, 2603/2603 transitions.
Built C files in :
/tmp/ltsmin6887533644937212445
[2022-05-20 01:26:12] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6887533644937212445
Running compilation step : cd /tmp/ltsmin6887533644937212445;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6887533644937212445;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6887533644937212445;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 01:26:15] [INFO ] Flatten gal took : 166 ms
[2022-05-20 01:26:15] [INFO ] Flatten gal took : 163 ms
[2022-05-20 01:26:15] [INFO ] Time to serialize gal into /tmp/LTL13279787226312099126.gal : 32 ms
[2022-05-20 01:26:15] [INFO ] Time to serialize properties into /tmp/LTL5029829882877868187.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13279787226312099126.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5029829882877868187.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1327978...267
Read 1 LTL properties
Checking formula 0 : !(((G(F("((p2053==0)||(p170==1))")))U(G(X("((p2141==0)||(p1465==1))")))))
Formula 0 simplified : !(GF"((p2053==0)||(p170==1))" U GX"((p2141==0)||(p1465==1))")
Detected timeout of ITS tools.
[2022-05-20 01:26:31] [INFO ] Flatten gal took : 153 ms
[2022-05-20 01:26:31] [INFO ] Applying decomposition
[2022-05-20 01:26:31] [INFO ] Flatten gal took : 168 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14158375154525967541.txt' '-o' '/tmp/graph14158375154525967541.bin' '-w' '/tmp/graph14158375154525967541.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14158375154525967541.bin' '-l' '-1' '-v' '-w' '/tmp/graph14158375154525967541.weights' '-q' '0' '-e' '0.001'
[2022-05-20 01:26:31] [INFO ] Decomposing Gal with order
[2022-05-20 01:26:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 01:26:32] [INFO ] Removed a total of 600 redundant transitions.
[2022-05-20 01:26:32] [INFO ] Flatten gal took : 267 ms
[2022-05-20 01:26:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 1206 labels/synchronizations in 446 ms.
[2022-05-20 01:26:32] [INFO ] Time to serialize gal into /tmp/LTL13157472456590810140.gal : 72 ms
[2022-05-20 01:26:32] [INFO ] Time to serialize properties into /tmp/LTL16554759167876826353.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13157472456590810140.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16554759167876826353.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1315747...247
Read 1 LTL properties
Checking formula 0 : !(((G(F("((i38.i0.i0.u728.p2053==0)||(i2.i1.i1.u61.p170==1))")))U(G(X("((i39.i0.i1.u759.p2141==0)||(i28.i1.i1.u520.p1465==1))")))))
Formula 0 simplified : !(GF"((i38.i0.i0.u728.p2053==0)||(i2.i1.i1.u61.p170==1))" U GX"((i39.i0.i1.u759.p2141==0)||(i28.i1.i1.u520.p1465==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6772623798240870288
[2022-05-20 01:26:47] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6772623798240870288
Running compilation step : cd /tmp/ltsmin6772623798240870288;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6772623798240870288;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6772623798240870288;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldPPPs-PT-100A-LTLCardinality-01 finished in 291496 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(p0)))'
Support contains 2 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 132 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:26:51] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:26:52] [INFO ] Implicit Places using invariants in 1629 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:26:52] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:26:54] [INFO ] Implicit Places using invariants and state equation in 1492 ms returned []
Implicit Place search using SMT with State Equation took 3125 ms to find 0 implicit places.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:26:54] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:26:55] [INFO ] Dead Transitions using invariants and state equation in 1413 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/3103 places, 2603/2603 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s1219 0) (EQ s106 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 15 reset in 1711 ms.
Product exploration explored 100000 steps with 15 reset in 2055 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 224 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 87173 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 87173 steps, saw 78522 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:27:03] [INFO ] Computed 1101 place invariants in 9 ms
[2022-05-20 01:27:03] [INFO ] [Real]Absence check using 1101 positive place invariants in 230 ms returned sat
[2022-05-20 01:27:05] [INFO ] After 1464ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 01:27:05] [INFO ] Deduced a trap composed of 18 places in 176 ms of which 0 ms to minimize.
[2022-05-20 01:27:05] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 0 ms to minimize.
[2022-05-20 01:27:06] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 0 ms to minimize.
[2022-05-20 01:27:06] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 0 ms to minimize.
[2022-05-20 01:27:06] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 0 ms to minimize.
[2022-05-20 01:27:06] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 0 ms to minimize.
[2022-05-20 01:27:06] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 0 ms to minimize.
[2022-05-20 01:27:06] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 0 ms to minimize.
[2022-05-20 01:27:07] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1731 ms
[2022-05-20 01:27:07] [INFO ] After 3278ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 01:27:07] [INFO ] After 4038ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 01:27:07] [INFO ] [Nat]Absence check using 1101 positive place invariants in 207 ms returned sat
[2022-05-20 01:27:09] [INFO ] After 1364ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 01:27:09] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 0 ms to minimize.
[2022-05-20 01:27:09] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 1 ms to minimize.
[2022-05-20 01:27:09] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 1 ms to minimize.
[2022-05-20 01:27:09] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 0 ms to minimize.
[2022-05-20 01:27:10] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 1 ms to minimize.
[2022-05-20 01:27:10] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 0 ms to minimize.
[2022-05-20 01:27:10] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 0 ms to minimize.
[2022-05-20 01:27:10] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 0 ms to minimize.
[2022-05-20 01:27:10] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 0 ms to minimize.
[2022-05-20 01:27:11] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 0 ms to minimize.
[2022-05-20 01:27:11] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 1 ms to minimize.
[2022-05-20 01:27:11] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2022-05-20 01:27:11] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 0 ms to minimize.
[2022-05-20 01:27:11] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2022-05-20 01:27:11] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2022-05-20 01:27:11] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2837 ms
[2022-05-20 01:27:12] [INFO ] After 4275ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 99 ms.
[2022-05-20 01:27:12] [INFO ] After 5007ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 49 ms.
Support contains 2 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Partial Free-agglomeration rule applied 896 times.
Drop transitions removed 896 transitions
Iterating global reduction 0 with 896 rules applied. Total rules applied 900 place count 3101 transition count 2601
Applied a total of 900 rules in 423 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3103 places, 2601/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 145063 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 145063 steps, saw 143848 distinct states, run finished after 3004 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:27:15] [INFO ] Computed 1101 place invariants in 36 ms
[2022-05-20 01:27:16] [INFO ] [Real]Absence check using 1047 positive place invariants in 207 ms returned sat
[2022-05-20 01:27:16] [INFO ] [Real]Absence check using 1047 positive and 54 generalized place invariants in 11 ms returned sat
[2022-05-20 01:27:18] [INFO ] After 2236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 01:27:18] [INFO ] [Nat]Absence check using 1047 positive place invariants in 205 ms returned sat
[2022-05-20 01:27:18] [INFO ] [Nat]Absence check using 1047 positive and 54 generalized place invariants in 18 ms returned sat
[2022-05-20 01:27:33] [INFO ] After 15405ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 137 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 137 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:27:33] [INFO ] Computed 1101 place invariants in 34 ms
[2022-05-20 01:27:35] [INFO ] Implicit Places using invariants in 1795 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:27:35] [INFO ] Computed 1101 place invariants in 30 ms
[2022-05-20 01:27:37] [INFO ] Implicit Places using invariants and state equation in 1906 ms returned []
Implicit Place search using SMT with State Equation took 3705 ms to find 0 implicit places.
[2022-05-20 01:27:37] [INFO ] Redundant transitions in 77 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:27:37] [INFO ] Computed 1101 place invariants in 46 ms
[2022-05-20 01:27:39] [INFO ] Dead Transitions using invariants and state equation in 1561 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 145 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:27:39] [INFO ] Computed 1101 place invariants in 35 ms
[2022-05-20 01:27:40] [INFO ] [Real]Absence check using 1047 positive place invariants in 207 ms returned sat
[2022-05-20 01:27:40] [INFO ] [Real]Absence check using 1047 positive and 54 generalized place invariants in 11 ms returned sat
[2022-05-20 01:27:41] [INFO ] After 2130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 01:27:42] [INFO ] [Nat]Absence check using 1047 positive place invariants in 203 ms returned sat
[2022-05-20 01:27:42] [INFO ] [Nat]Absence check using 1047 positive and 54 generalized place invariants in 11 ms returned sat
[2022-05-20 01:27:56] [INFO ] After 15130ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:27:56] [INFO ] Computed 1101 place invariants in 8 ms
[2022-05-20 01:28:02] [INFO ] [Real]Absence check using 1101 positive place invariants in 1800 ms returned sat
[2022-05-20 01:28:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 01:28:11] [INFO ] [Real]Absence check using state equation in 9616 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Applied a total of 4 rules in 284 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:28:12] [INFO ] Computed 1101 place invariants in 13 ms
[2022-05-20 01:28:13] [INFO ] Implicit Places using invariants in 1446 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:28:13] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:28:15] [INFO ] Implicit Places using invariants and state equation in 1437 ms returned []
Implicit Place search using SMT with State Equation took 2887 ms to find 0 implicit places.
[2022-05-20 01:28:15] [INFO ] Redundant transitions in 68 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:28:15] [INFO ] Computed 1101 place invariants in 12 ms
[2022-05-20 01:28:16] [INFO ] Dead Transitions using invariants and state equation in 1449 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3101/3103 places, 2601/2603 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3103 places, 2601/2603 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 90418 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 90418 steps, saw 82104 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:28:20] [INFO ] Computed 1101 place invariants in 6 ms
[2022-05-20 01:28:20] [INFO ] [Real]Absence check using 1101 positive place invariants in 223 ms returned sat
[2022-05-20 01:28:22] [INFO ] After 1396ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 01:28:22] [INFO ] Deduced a trap composed of 11 places in 183 ms of which 1 ms to minimize.
[2022-05-20 01:28:22] [INFO ] Deduced a trap composed of 18 places in 184 ms of which 1 ms to minimize.
[2022-05-20 01:28:22] [INFO ] Deduced a trap composed of 18 places in 180 ms of which 0 ms to minimize.
[2022-05-20 01:28:23] [INFO ] Deduced a trap composed of 18 places in 170 ms of which 1 ms to minimize.
[2022-05-20 01:28:23] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 1 ms to minimize.
[2022-05-20 01:28:23] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 0 ms to minimize.
[2022-05-20 01:28:23] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 0 ms to minimize.
[2022-05-20 01:28:24] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 0 ms to minimize.
[2022-05-20 01:28:24] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 0 ms to minimize.
[2022-05-20 01:28:24] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2022-05-20 01:28:24] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 0 ms to minimize.
[2022-05-20 01:28:24] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2022-05-20 01:28:24] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2539 ms
[2022-05-20 01:28:24] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2539 ms
[2022-05-20 01:28:24] [INFO ] After 4011ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 01:28:24] [INFO ] After 4721ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 01:28:25] [INFO ] [Nat]Absence check using 1101 positive place invariants in 214 ms returned sat
[2022-05-20 01:28:26] [INFO ] After 1373ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 01:28:27] [INFO ] Deduced a trap composed of 18 places in 184 ms of which 0 ms to minimize.
[2022-05-20 01:28:27] [INFO ] Deduced a trap composed of 24 places in 183 ms of which 1 ms to minimize.
[2022-05-20 01:28:27] [INFO ] Deduced a trap composed of 29 places in 178 ms of which 0 ms to minimize.
[2022-05-20 01:28:27] [INFO ] Deduced a trap composed of 18 places in 175 ms of which 1 ms to minimize.
[2022-05-20 01:28:28] [INFO ] Deduced a trap composed of 18 places in 172 ms of which 1 ms to minimize.
[2022-05-20 01:28:28] [INFO ] Deduced a trap composed of 18 places in 169 ms of which 1 ms to minimize.
[2022-05-20 01:28:28] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 0 ms to minimize.
[2022-05-20 01:28:28] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 1 ms to minimize.
[2022-05-20 01:28:29] [INFO ] Deduced a trap composed of 18 places in 147 ms of which 1 ms to minimize.
[2022-05-20 01:28:29] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 0 ms to minimize.
[2022-05-20 01:28:29] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 0 ms to minimize.
[2022-05-20 01:28:29] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 0 ms to minimize.
[2022-05-20 01:28:29] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 1 ms to minimize.
[2022-05-20 01:28:30] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 0 ms to minimize.
[2022-05-20 01:28:30] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 0 ms to minimize.
[2022-05-20 01:28:30] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2022-05-20 01:28:30] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3759 ms
[2022-05-20 01:28:30] [INFO ] After 5202ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 97 ms.
[2022-05-20 01:28:30] [INFO ] After 5974ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 58 ms.
Support contains 2 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Partial Free-agglomeration rule applied 896 times.
Drop transitions removed 896 transitions
Iterating global reduction 0 with 896 rules applied. Total rules applied 896 place count 3101 transition count 2601
Applied a total of 896 rules in 266 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 133601 steps, run timeout after 3003 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 133601 steps, saw 132453 distinct states, run finished after 3003 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:28:34] [INFO ] Computed 1101 place invariants in 37 ms
[2022-05-20 01:28:35] [INFO ] [Real]Absence check using 1047 positive place invariants in 199 ms returned sat
[2022-05-20 01:28:35] [INFO ] [Real]Absence check using 1047 positive and 54 generalized place invariants in 11 ms returned sat
[2022-05-20 01:28:36] [INFO ] After 2155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 01:28:37] [INFO ] [Nat]Absence check using 1047 positive place invariants in 209 ms returned sat
[2022-05-20 01:28:37] [INFO ] [Nat]Absence check using 1047 positive and 54 generalized place invariants in 12 ms returned sat
[2022-05-20 01:28:51] [INFO ] After 15396ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 141 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 130 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:28:52] [INFO ] Computed 1101 place invariants in 34 ms
[2022-05-20 01:28:54] [INFO ] Implicit Places using invariants in 1805 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:28:54] [INFO ] Computed 1101 place invariants in 29 ms
[2022-05-20 01:28:55] [INFO ] Implicit Places using invariants and state equation in 1794 ms returned []
Implicit Place search using SMT with State Equation took 3606 ms to find 0 implicit places.
[2022-05-20 01:28:55] [INFO ] Redundant transitions in 73 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:28:55] [INFO ] Computed 1101 place invariants in 35 ms
[2022-05-20 01:28:57] [INFO ] Dead Transitions using invariants and state equation in 1452 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 132 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:28:57] [INFO ] Computed 1101 place invariants in 36 ms
[2022-05-20 01:28:58] [INFO ] [Real]Absence check using 1047 positive place invariants in 198 ms returned sat
[2022-05-20 01:28:58] [INFO ] [Real]Absence check using 1047 positive and 54 generalized place invariants in 12 ms returned sat
[2022-05-20 01:28:59] [INFO ] After 2085ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 01:29:00] [INFO ] [Nat]Absence check using 1047 positive place invariants in 200 ms returned sat
[2022-05-20 01:29:00] [INFO ] [Nat]Absence check using 1047 positive and 54 generalized place invariants in 11 ms returned sat
[2022-05-20 01:29:14] [INFO ] After 15199ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:29:15] [INFO ] Computed 1101 place invariants in 10 ms
[2022-05-20 01:29:20] [INFO ] [Real]Absence check using 1101 positive place invariants in 1747 ms returned sat
[2022-05-20 01:29:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 01:29:30] [INFO ] [Real]Absence check using state equation in 9688 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 15 reset in 1667 ms.
Product exploration explored 100000 steps with 15 reset in 2095 ms.
Built C files in :
/tmp/ltsmin10306804267749963884
[2022-05-20 01:29:33] [INFO ] Too many transitions (2601) to apply POR reductions. Disabling POR matrices.
[2022-05-20 01:29:33] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10306804267749963884
Running compilation step : cd /tmp/ltsmin10306804267749963884;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10306804267749963884;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10306804267749963884;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 135 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:29:37] [INFO ] Computed 1101 place invariants in 12 ms
[2022-05-20 01:29:38] [INFO ] Implicit Places using invariants in 1612 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:29:38] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 01:29:40] [INFO ] Implicit Places using invariants and state equation in 1456 ms returned []
Implicit Place search using SMT with State Equation took 3070 ms to find 0 implicit places.
[2022-05-20 01:29:40] [INFO ] Redundant transitions in 70 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:29:40] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:29:41] [INFO ] Dead Transitions using invariants and state equation in 1405 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Built C files in :
/tmp/ltsmin15740457329353288255
[2022-05-20 01:29:41] [INFO ] Too many transitions (2601) to apply POR reductions. Disabling POR matrices.
[2022-05-20 01:29:41] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15740457329353288255
Running compilation step : cd /tmp/ltsmin15740457329353288255;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15740457329353288255;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15740457329353288255;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 01:29:44] [INFO ] Flatten gal took : 150 ms
[2022-05-20 01:29:45] [INFO ] Flatten gal took : 156 ms
[2022-05-20 01:29:45] [INFO ] Time to serialize gal into /tmp/LTL9599251349016519833.gal : 11 ms
[2022-05-20 01:29:45] [INFO ] Time to serialize properties into /tmp/LTL1373846425318551418.ltl : 319 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9599251349016519833.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1373846425318551418.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9599251...266
Read 1 LTL properties
Checking formula 0 : !((F(X("((p1219==0)&&(p106==1))"))))
Formula 0 simplified : !FX"((p1219==0)&&(p106==1))"
Detected timeout of ITS tools.
[2022-05-20 01:30:00] [INFO ] Flatten gal took : 134 ms
[2022-05-20 01:30:00] [INFO ] Applying decomposition
[2022-05-20 01:30:00] [INFO ] Flatten gal took : 133 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5514370631554437284.txt' '-o' '/tmp/graph5514370631554437284.bin' '-w' '/tmp/graph5514370631554437284.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5514370631554437284.bin' '-l' '-1' '-v' '-w' '/tmp/graph5514370631554437284.weights' '-q' '0' '-e' '0.001'
[2022-05-20 01:30:00] [INFO ] Decomposing Gal with order
[2022-05-20 01:30:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 01:30:01] [INFO ] Removed a total of 600 redundant transitions.
[2022-05-20 01:30:01] [INFO ] Flatten gal took : 146 ms
[2022-05-20 01:30:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 1200 labels/synchronizations in 125 ms.
[2022-05-20 01:30:01] [INFO ] Time to serialize gal into /tmp/LTL15592515197203489232.gal : 26 ms
[2022-05-20 01:30:01] [INFO ] Time to serialize properties into /tmp/LTL14457291791560543462.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15592515197203489232.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14457291791560543462.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1559251...247
Read 1 LTL properties
Checking formula 0 : !((F(X("((i23.i1.i1.u433.p1219==0)&&(i2.u38.p106==1))"))))
Formula 0 simplified : !FX"((i23.i1.i1.u433.p1219==0)&&(i2.u38.p106==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12562855650209647377
[2022-05-20 01:30:16] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12562855650209647377
Running compilation step : cd /tmp/ltsmin12562855650209647377;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12562855650209647377;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12562855650209647377;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldPPPs-PT-100A-LTLCardinality-02 finished in 208744 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Applied a total of 4 rules in 265 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:30:19] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 01:30:21] [INFO ] Implicit Places using invariants in 1529 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:30:21] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:30:22] [INFO ] Implicit Places using invariants and state equation in 1477 ms returned []
Implicit Place search using SMT with State Equation took 3007 ms to find 0 implicit places.
[2022-05-20 01:30:23] [INFO ] Redundant transitions in 76 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:30:23] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 01:30:24] [INFO ] Dead Transitions using invariants and state equation in 1451 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3101/3103 places, 2601/2603 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3103 places, 2601/2603 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s60 0) (EQ s512 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 25362 steps with 3 reset in 435 ms.
FORMULA ShieldPPPs-PT-100A-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100A-LTLCardinality-04 finished in 5307 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(F(F(p1))))))'
Support contains 4 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 124 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:30:25] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 01:30:27] [INFO ] Implicit Places using invariants in 1449 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:30:27] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:30:28] [INFO ] Implicit Places using invariants and state equation in 1423 ms returned []
Implicit Place search using SMT with State Equation took 2876 ms to find 0 implicit places.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:30:28] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:30:30] [INFO ] Dead Transitions using invariants and state equation in 1381 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/3103 places, 2603/2603 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s1752 0) (EQ s2101 1)), p0:(AND (EQ s1876 0) (EQ s2216 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 8169 ms.
Product exploration explored 100000 steps with 50000 reset in 8368 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 9 factoid took 170 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldPPPs-PT-100A-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-100A-LTLCardinality-07 finished in 21896 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 124 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:30:47] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 01:30:48] [INFO ] Implicit Places using invariants in 1463 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:30:48] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:30:49] [INFO ] Implicit Places using invariants and state equation in 1442 ms returned []
Implicit Place search using SMT with State Equation took 2908 ms to find 0 implicit places.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:30:49] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:30:51] [INFO ] Dead Transitions using invariants and state equation in 1383 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/3103 places, 2603/2603 transitions.
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s668 0) (EQ s154 1) (EQ s1683 0) (EQ s277 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 6444 steps with 0 reset in 108 ms.
FORMULA ShieldPPPs-PT-100A-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100A-LTLCardinality-09 finished in 4622 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X(!(p0 U (!p1 U G(p2)))))&&G(X(p3)))))'
Support contains 5 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 124 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:30:51] [INFO ] Computed 1101 place invariants in 9 ms
[2022-05-20 01:30:53] [INFO ] Implicit Places using invariants in 1471 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:30:53] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:30:54] [INFO ] Implicit Places using invariants and state equation in 1480 ms returned []
Implicit Place search using SMT with State Equation took 2959 ms to find 0 implicit places.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:30:54] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 01:30:56] [INFO ] Dead Transitions using invariants and state equation in 1528 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/3103 places, 2603/2603 transitions.
Stuttering acceptance computed with spot in 318 ms :[(OR (NOT p3) p2), (OR (NOT p3) p2), (OR (NOT p3) p2), true, p2, p2, p2, (NOT p3)]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p3), acceptance={} source=2 dest: 3}, { cond=(AND p2 p3), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=2 dest: 5}, { cond=(AND p0 p3), acceptance={} source=2 dest: 6}, { cond=p3, acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={0} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={} source=5 dest: 5}], [{ cond=p2, acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(NOT p3), acceptance={} source=7 dest: 3}, { cond=p3, acceptance={} source=7 dest: 7}]], initial=0, aps=[p3:(AND (EQ s1072 0) (EQ s1381 1)), p2:(OR (EQ s1908 0) (EQ s1234 1)), p0:(EQ s2160 1), p1:(OR (EQ s1381 0) (EQ s1072 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, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-100A-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100A-LTLCardinality-13 finished in 4986 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Applied a total of 4 rules in 271 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:30:56] [INFO ] Computed 1101 place invariants in 8 ms
[2022-05-20 01:30:58] [INFO ] Implicit Places using invariants in 1544 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:30:58] [INFO ] Computed 1101 place invariants in 10 ms
[2022-05-20 01:30:59] [INFO ] Implicit Places using invariants and state equation in 1562 ms returned []
Implicit Place search using SMT with State Equation took 3107 ms to find 0 implicit places.
[2022-05-20 01:30:59] [INFO ] Redundant transitions in 71 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:30:59] [INFO ] Computed 1101 place invariants in 10 ms
[2022-05-20 01:31:01] [INFO ] Dead Transitions using invariants and state equation in 1491 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3101/3103 places, 2601/2603 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3103 places, 2601/2603 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s488 0) (EQ s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 15 reset in 1885 ms.
Product exploration explored 100000 steps with 15 reset in 2293 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 248 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 87945 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 87945 steps, saw 79861 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:31:09] [INFO ] Computed 1101 place invariants in 7 ms
[2022-05-20 01:31:10] [INFO ] [Real]Absence check using 1101 positive place invariants in 222 ms returned sat
[2022-05-20 01:31:11] [INFO ] After 1405ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 01:31:11] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 0 ms to minimize.
[2022-05-20 01:31:12] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 1 ms to minimize.
[2022-05-20 01:31:12] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 1 ms to minimize.
[2022-05-20 01:31:12] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 0 ms to minimize.
[2022-05-20 01:31:12] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 1 ms to minimize.
[2022-05-20 01:31:12] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 0 ms to minimize.
[2022-05-20 01:31:13] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 0 ms to minimize.
[2022-05-20 01:31:13] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 1 ms to minimize.
[2022-05-20 01:31:13] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 0 ms to minimize.
[2022-05-20 01:31:13] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2022-05-20 01:31:13] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1987 ms
[2022-05-20 01:31:13] [INFO ] After 3476ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 01:31:13] [INFO ] After 4211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 01:31:14] [INFO ] [Nat]Absence check using 1101 positive place invariants in 217 ms returned sat
[2022-05-20 01:31:15] [INFO ] After 1409ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 01:31:16] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 0 ms to minimize.
[2022-05-20 01:31:16] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 0 ms to minimize.
[2022-05-20 01:31:16] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 0 ms to minimize.
[2022-05-20 01:31:16] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 0 ms to minimize.
[2022-05-20 01:31:16] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 1 ms to minimize.
[2022-05-20 01:31:17] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 0 ms to minimize.
[2022-05-20 01:31:17] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 0 ms to minimize.
[2022-05-20 01:31:17] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 0 ms to minimize.
[2022-05-20 01:31:17] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 0 ms to minimize.
[2022-05-20 01:31:17] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2022-05-20 01:31:17] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2022-05-20 01:31:17] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 0 ms to minimize.
[2022-05-20 01:31:18] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2251 ms
[2022-05-20 01:31:18] [INFO ] After 3740ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 102 ms.
[2022-05-20 01:31:18] [INFO ] After 4582ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 43 ms.
Support contains 2 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Partial Free-agglomeration rule applied 897 times.
Drop transitions removed 897 transitions
Iterating global reduction 0 with 897 rules applied. Total rules applied 897 place count 3101 transition count 2601
Applied a total of 897 rules in 268 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 138187 steps, run timeout after 3004 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 138187 steps, saw 137011 distinct states, run finished after 3004 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:31:21] [INFO ] Computed 1101 place invariants in 39 ms
[2022-05-20 01:31:22] [INFO ] [Real]Absence check using 1046 positive place invariants in 205 ms returned sat
[2022-05-20 01:31:22] [INFO ] [Real]Absence check using 1046 positive and 55 generalized place invariants in 11 ms returned sat
[2022-05-20 01:31:24] [INFO ] After 2315ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 01:31:24] [INFO ] [Nat]Absence check using 1046 positive place invariants in 208 ms returned sat
[2022-05-20 01:31:24] [INFO ] [Nat]Absence check using 1046 positive and 55 generalized place invariants in 12 ms returned sat
[2022-05-20 01:31:26] [INFO ] After 1725ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 01:31:27] [INFO ] Deduced a trap composed of 5 places in 753 ms of which 1 ms to minimize.
[2022-05-20 01:31:28] [INFO ] Deduced a trap composed of 7 places in 492 ms of which 1 ms to minimize.
[2022-05-20 01:31:28] [INFO ] Deduced a trap composed of 5 places in 486 ms of which 1 ms to minimize.
[2022-05-20 01:31:37] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 11304 ms
[2022-05-20 01:31:37] [INFO ] After 13050ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-20 01:31:37] [INFO ] After 13806ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 241 ms.
Support contains 2 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 143 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 132 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:31:38] [INFO ] Computed 1101 place invariants in 37 ms
[2022-05-20 01:31:40] [INFO ] Implicit Places using invariants in 1776 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:31:40] [INFO ] Computed 1101 place invariants in 29 ms
[2022-05-20 01:31:42] [INFO ] Implicit Places using invariants and state equation in 1798 ms returned []
Implicit Place search using SMT with State Equation took 3575 ms to find 0 implicit places.
[2022-05-20 01:31:42] [INFO ] Redundant transitions in 71 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:31:42] [INFO ] Computed 1101 place invariants in 37 ms
[2022-05-20 01:31:43] [INFO ] Dead Transitions using invariants and state equation in 1444 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 132 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:31:43] [INFO ] Computed 1101 place invariants in 36 ms
[2022-05-20 01:31:44] [INFO ] [Real]Absence check using 1046 positive place invariants in 201 ms returned sat
[2022-05-20 01:31:44] [INFO ] [Real]Absence check using 1046 positive and 55 generalized place invariants in 11 ms returned sat
[2022-05-20 01:31:46] [INFO ] After 2209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 01:31:46] [INFO ] [Nat]Absence check using 1046 positive place invariants in 200 ms returned sat
[2022-05-20 01:31:46] [INFO ] [Nat]Absence check using 1046 positive and 55 generalized place invariants in 12 ms returned sat
[2022-05-20 01:31:48] [INFO ] After 1616ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 01:31:48] [INFO ] Deduced a trap composed of 5 places in 448 ms of which 1 ms to minimize.
[2022-05-20 01:31:49] [INFO ] Deduced a trap composed of 7 places in 485 ms of which 1 ms to minimize.
[2022-05-20 01:31:50] [INFO ] Deduced a trap composed of 5 places in 482 ms of which 1 ms to minimize.
[2022-05-20 01:31:59] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 10883 ms
[2022-05-20 01:31:59] [INFO ] After 12518ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-20 01:31:59] [INFO ] After 13199ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:31:59] [INFO ] Computed 1101 place invariants in 13 ms
[2022-05-20 01:32:05] [INFO ] [Real]Absence check using 1101 positive place invariants in 1859 ms returned sat
[2022-05-20 01:32:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 01:32:14] [INFO ] [Real]Absence check using state equation in 9448 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 155 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:32:14] [INFO ] Computed 1101 place invariants in 12 ms
[2022-05-20 01:32:16] [INFO ] Implicit Places using invariants in 1445 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:32:16] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:32:17] [INFO ] Implicit Places using invariants and state equation in 1445 ms returned []
Implicit Place search using SMT with State Equation took 2891 ms to find 0 implicit places.
[2022-05-20 01:32:17] [INFO ] Redundant transitions in 70 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:32:17] [INFO ] Computed 1101 place invariants in 10 ms
[2022-05-20 01:32:19] [INFO ] Dead Transitions using invariants and state equation in 1402 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 91329 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 91329 steps, saw 82925 distinct states, run finished after 3002 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:32:22] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 01:32:23] [INFO ] [Real]Absence check using 1101 positive place invariants in 209 ms returned sat
[2022-05-20 01:32:24] [INFO ] After 1341ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 01:32:24] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 0 ms to minimize.
[2022-05-20 01:32:24] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 0 ms to minimize.
[2022-05-20 01:32:25] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 0 ms to minimize.
[2022-05-20 01:32:25] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 0 ms to minimize.
[2022-05-20 01:32:25] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 0 ms to minimize.
[2022-05-20 01:32:25] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 0 ms to minimize.
[2022-05-20 01:32:25] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2022-05-20 01:32:26] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 0 ms to minimize.
[2022-05-20 01:32:26] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2022-05-20 01:32:26] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2022-05-20 01:32:26] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1922 ms
[2022-05-20 01:32:26] [INFO ] After 3338ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 01:32:26] [INFO ] After 4009ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 01:32:27] [INFO ] [Nat]Absence check using 1101 positive place invariants in 208 ms returned sat
[2022-05-20 01:32:28] [INFO ] After 1353ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 01:32:28] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 1 ms to minimize.
[2022-05-20 01:32:28] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 1 ms to minimize.
[2022-05-20 01:32:29] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 0 ms to minimize.
[2022-05-20 01:32:29] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 1 ms to minimize.
[2022-05-20 01:32:29] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 0 ms to minimize.
[2022-05-20 01:32:29] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 0 ms to minimize.
[2022-05-20 01:32:29] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 0 ms to minimize.
[2022-05-20 01:32:30] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 0 ms to minimize.
[2022-05-20 01:32:30] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2022-05-20 01:32:30] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2022-05-20 01:32:30] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2022-05-20 01:32:30] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2022-05-20 01:32:30] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2151 ms
[2022-05-20 01:32:30] [INFO ] After 3573ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 100 ms.
[2022-05-20 01:32:30] [INFO ] After 4329ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 42 ms.
Support contains 2 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Partial Free-agglomeration rule applied 897 times.
Drop transitions removed 897 transitions
Iterating global reduction 0 with 897 rules applied. Total rules applied 897 place count 3101 transition count 2601
Applied a total of 897 rules in 286 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 142529 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 142529 steps, saw 141328 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:32:34] [INFO ] Computed 1101 place invariants in 39 ms
[2022-05-20 01:32:35] [INFO ] [Real]Absence check using 1046 positive place invariants in 200 ms returned sat
[2022-05-20 01:32:35] [INFO ] [Real]Absence check using 1046 positive and 55 generalized place invariants in 29 ms returned sat
[2022-05-20 01:32:36] [INFO ] After 2243ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 01:32:37] [INFO ] [Nat]Absence check using 1046 positive place invariants in 199 ms returned sat
[2022-05-20 01:32:37] [INFO ] [Nat]Absence check using 1046 positive and 55 generalized place invariants in 11 ms returned sat
[2022-05-20 01:32:39] [INFO ] After 1656ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 01:32:39] [INFO ] Deduced a trap composed of 5 places in 453 ms of which 1 ms to minimize.
[2022-05-20 01:32:40] [INFO ] Deduced a trap composed of 7 places in 451 ms of which 1 ms to minimize.
[2022-05-20 01:32:40] [INFO ] Deduced a trap composed of 5 places in 435 ms of which 1 ms to minimize.
[2022-05-20 01:32:50] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 10926 ms
[2022-05-20 01:32:50] [INFO ] After 12600ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-20 01:32:50] [INFO ] After 13284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 243 ms.
Support contains 2 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 129 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 129 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:32:50] [INFO ] Computed 1101 place invariants in 37 ms
[2022-05-20 01:32:52] [INFO ] Implicit Places using invariants in 1811 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:32:52] [INFO ] Computed 1101 place invariants in 29 ms
[2022-05-20 01:32:54] [INFO ] Implicit Places using invariants and state equation in 1785 ms returned []
Implicit Place search using SMT with State Equation took 3597 ms to find 0 implicit places.
[2022-05-20 01:32:54] [INFO ] Redundant transitions in 73 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:32:54] [INFO ] Computed 1101 place invariants in 35 ms
[2022-05-20 01:32:55] [INFO ] Dead Transitions using invariants and state equation in 1427 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 133 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:32:55] [INFO ] Computed 1101 place invariants in 40 ms
[2022-05-20 01:32:56] [INFO ] [Real]Absence check using 1046 positive place invariants in 184 ms returned sat
[2022-05-20 01:32:56] [INFO ] [Real]Absence check using 1046 positive and 55 generalized place invariants in 11 ms returned sat
[2022-05-20 01:32:57] [INFO ] After 2126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 01:32:58] [INFO ] [Nat]Absence check using 1046 positive place invariants in 201 ms returned sat
[2022-05-20 01:32:58] [INFO ] [Nat]Absence check using 1046 positive and 55 generalized place invariants in 13 ms returned sat
[2022-05-20 01:33:00] [INFO ] After 1597ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 01:33:00] [INFO ] Deduced a trap composed of 5 places in 451 ms of which 1 ms to minimize.
[2022-05-20 01:33:01] [INFO ] Deduced a trap composed of 7 places in 451 ms of which 1 ms to minimize.
[2022-05-20 01:33:01] [INFO ] Deduced a trap composed of 5 places in 437 ms of which 1 ms to minimize.
[2022-05-20 01:33:11] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 10838 ms
[2022-05-20 01:33:11] [INFO ] After 12450ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-20 01:33:11] [INFO ] After 13124ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 177 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:33:11] [INFO ] Computed 1101 place invariants in 9 ms
[2022-05-20 01:33:16] [INFO ] [Real]Absence check using 1101 positive place invariants in 1814 ms returned sat
[2022-05-20 01:33:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 01:33:26] [INFO ] [Real]Absence check using state equation in 9658 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 15 reset in 1655 ms.
Stuttering criterion allowed to conclude after 77383 steps with 11 reset in 1598 ms.
FORMULA ShieldPPPs-PT-100A-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100A-LTLCardinality-14 finished in 153260 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F((G(X(p0))&&G(p1)))))'
Support contains 4 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3101 transition count 2601
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 3100 transition count 2600
Applied a total of 4 rules in 429 ms. Remains 3100 /3103 variables (removed 3) and now considering 2600/2603 (removed 3) transitions.
// Phase 1: matrix 2600 rows 3100 cols
[2022-05-20 01:33:30] [INFO ] Computed 1101 place invariants in 7 ms
[2022-05-20 01:33:31] [INFO ] Implicit Places using invariants in 1580 ms returned []
// Phase 1: matrix 2600 rows 3100 cols
[2022-05-20 01:33:31] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:33:33] [INFO ] Implicit Places using invariants and state equation in 1602 ms returned []
Implicit Place search using SMT with State Equation took 3186 ms to find 0 implicit places.
[2022-05-20 01:33:33] [INFO ] Redundant transitions in 74 ms returned []
// Phase 1: matrix 2600 rows 3100 cols
[2022-05-20 01:33:33] [INFO ] Computed 1101 place invariants in 7 ms
[2022-05-20 01:33:35] [INFO ] Dead Transitions using invariants and state equation in 1536 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3100/3103 places, 2600/2603 transitions.
Finished structural reductions, in 1 iterations. Remains : 3100/3103 places, 2600/2603 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0, 1} source=0 dest: 0}, { cond=p1, acceptance={1} source=0 dest: 1}, { cond=p1, acceptance={0, 1} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0, 1} source=1 dest: 0}, { cond=p1, acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={1} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (NEQ s3090 0) (NEQ s2886 1)), p0:(AND (NEQ s1947 0) (NEQ s1811 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 6300 steps with 0 reset in 124 ms.
FORMULA ShieldPPPs-PT-100A-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100A-LTLCardinality-15 finished in 5520 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U G(X(p1))))'
Found a SL insensitive property : ShieldPPPs-PT-100A-LTLCardinality-01
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Support contains 4 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Applied a total of 4 rules in 281 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:33:35] [INFO ] Computed 1101 place invariants in 12 ms
[2022-05-20 01:33:37] [INFO ] Implicit Places using invariants in 1597 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:33:37] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 01:33:38] [INFO ] Implicit Places using invariants and state equation in 1577 ms returned []
Implicit Place search using SMT with State Equation took 3174 ms to find 0 implicit places.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:33:38] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:33:40] [INFO ] Dead Transitions using invariants and state equation in 1511 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 3101/3103 places, 2601/2603 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3103 places, 2601/2603 transitions.
Running random walk in product with property : ShieldPPPs-PT-100A-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s2141 0) (EQ s1465 1)), p0:(OR (EQ s2053 0) (EQ s170 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25106 reset in 4940 ms.
Product exploration explored 100000 steps with 24956 reset in 5186 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 283 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:33:51] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 01:33:52] [INFO ] [Real]Absence check using 1101 positive place invariants in 211 ms returned sat
[2022-05-20 01:33:54] [INFO ] After 2691ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 01:33:55] [INFO ] [Nat]Absence check using 1101 positive place invariants in 224 ms returned sat
[2022-05-20 01:34:11] [INFO ] After 15959ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 01:34:12] [INFO ] After 16790ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7354 ms.
[2022-05-20 01:34:19] [INFO ] After 25014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 581 ms.
Support contains 4 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Partial Free-agglomeration rule applied 895 times.
Drop transitions removed 895 transitions
Iterating global reduction 0 with 895 rules applied. Total rules applied 895 place count 3101 transition count 2601
Applied a total of 895 rules in 272 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 102282 steps, run timeout after 3002 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 102282 steps, saw 101356 distinct states, run finished after 3004 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:34:23] [INFO ] Computed 1101 place invariants in 30 ms
[2022-05-20 01:34:24] [INFO ] [Real]Absence check using 1046 positive place invariants in 199 ms returned sat
[2022-05-20 01:34:24] [INFO ] [Real]Absence check using 1046 positive and 55 generalized place invariants in 11 ms returned sat
[2022-05-20 01:34:26] [INFO ] After 2991ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 01:34:27] [INFO ] [Nat]Absence check using 1046 positive place invariants in 204 ms returned sat
[2022-05-20 01:34:27] [INFO ] [Nat]Absence check using 1046 positive and 55 generalized place invariants in 11 ms returned sat
[2022-05-20 01:34:52] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 134 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 135 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:34:52] [INFO ] Computed 1101 place invariants in 40 ms
[2022-05-20 01:34:54] [INFO ] Implicit Places using invariants in 1784 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:34:54] [INFO ] Computed 1101 place invariants in 29 ms
[2022-05-20 01:34:55] [INFO ] Implicit Places using invariants and state equation in 1842 ms returned []
Implicit Place search using SMT with State Equation took 3627 ms to find 0 implicit places.
[2022-05-20 01:34:55] [INFO ] Redundant transitions in 71 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:34:56] [INFO ] Computed 1101 place invariants in 32 ms
[2022-05-20 01:34:57] [INFO ] Dead Transitions using invariants and state equation in 1476 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 135 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:34:57] [INFO ] Computed 1101 place invariants in 36 ms
[2022-05-20 01:34:58] [INFO ] [Real]Absence check using 1046 positive place invariants in 198 ms returned sat
[2022-05-20 01:34:58] [INFO ] [Real]Absence check using 1046 positive and 55 generalized place invariants in 12 ms returned sat
[2022-05-20 01:35:00] [INFO ] After 2943ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 01:35:01] [INFO ] [Nat]Absence check using 1046 positive place invariants in 200 ms returned sat
[2022-05-20 01:35:01] [INFO ] [Nat]Absence check using 1046 positive and 55 generalized place invariants in 11 ms returned sat
[2022-05-20 01:35:29] [INFO ] After 29217ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 7 factoid took 232 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Support contains 4 out of 3101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 124 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:35:30] [INFO ] Computed 1101 place invariants in 10 ms
[2022-05-20 01:35:31] [INFO ] Implicit Places using invariants in 1464 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:35:31] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:35:33] [INFO ] Implicit Places using invariants and state equation in 1440 ms returned []
Implicit Place search using SMT with State Equation took 2908 ms to find 0 implicit places.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:35:33] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:35:34] [INFO ] Dead Transitions using invariants and state equation in 1420 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 242 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 324 ms. (steps per millisecond=30 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:35:35] [INFO ] Computed 1101 place invariants in 22 ms
[2022-05-20 01:35:36] [INFO ] [Real]Absence check using 1101 positive place invariants in 214 ms returned sat
[2022-05-20 01:35:38] [INFO ] After 2615ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 01:35:39] [INFO ] [Nat]Absence check using 1101 positive place invariants in 209 ms returned sat
[2022-05-20 01:35:59] [INFO ] After 19753ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 01:35:59] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2022-05-20 01:36:00] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2022-05-20 01:36:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 367 ms
[2022-05-20 01:36:00] [INFO ] After 20845ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 111 ms.
[2022-05-20 01:36:00] [INFO ] After 21790ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 181 ms.
Support contains 4 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Partial Free-agglomeration rule applied 895 times.
Drop transitions removed 895 transitions
Iterating global reduction 0 with 895 rules applied. Total rules applied 895 place count 3101 transition count 2601
Applied a total of 895 rules in 273 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 90809 steps, run timeout after 3005 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 90809 steps, saw 89928 distinct states, run finished after 3005 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:36:04] [INFO ] Computed 1101 place invariants in 29 ms
[2022-05-20 01:36:05] [INFO ] [Real]Absence check using 1046 positive place invariants in 199 ms returned sat
[2022-05-20 01:36:05] [INFO ] [Real]Absence check using 1046 positive and 55 generalized place invariants in 14 ms returned sat
[2022-05-20 01:36:07] [INFO ] After 2931ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 01:36:08] [INFO ] [Nat]Absence check using 1046 positive place invariants in 200 ms returned sat
[2022-05-20 01:36:08] [INFO ] [Nat]Absence check using 1046 positive and 55 generalized place invariants in 14 ms returned sat
[2022-05-20 01:36:32] [INFO ] After 24165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 01:36:32] [INFO ] After 24167ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-20 01:36:32] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 258 ms.
Support contains 4 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 147 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 130 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:36:33] [INFO ] Computed 1101 place invariants in 35 ms
[2022-05-20 01:36:34] [INFO ] Implicit Places using invariants in 1831 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:36:34] [INFO ] Computed 1101 place invariants in 33 ms
[2022-05-20 01:36:36] [INFO ] Implicit Places using invariants and state equation in 1777 ms returned []
Implicit Place search using SMT with State Equation took 3609 ms to find 0 implicit places.
[2022-05-20 01:36:36] [INFO ] Redundant transitions in 72 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:36:36] [INFO ] Computed 1101 place invariants in 35 ms
[2022-05-20 01:36:38] [INFO ] Dead Transitions using invariants and state equation in 1478 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 132 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:36:38] [INFO ] Computed 1101 place invariants in 30 ms
[2022-05-20 01:36:39] [INFO ] [Real]Absence check using 1046 positive place invariants in 196 ms returned sat
[2022-05-20 01:36:39] [INFO ] [Real]Absence check using 1046 positive and 55 generalized place invariants in 11 ms returned sat
[2022-05-20 01:36:41] [INFO ] After 2913ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 01:36:41] [INFO ] [Nat]Absence check using 1046 positive place invariants in 199 ms returned sat
[2022-05-20 01:36:42] [INFO ] [Nat]Absence check using 1046 positive and 55 generalized place invariants in 18 ms returned sat
[2022-05-20 01:37:10] [INFO ] After 29503ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 7 factoid took 308 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 24991 reset in 4760 ms.
Product exploration explored 100000 steps with 25106 reset in 5041 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Support contains 4 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 139 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2022-05-20 01:37:21] [INFO ] Redundant transitions in 74 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:37:21] [INFO ] Computed 1101 place invariants in 12 ms
[2022-05-20 01:37:23] [INFO ] Dead Transitions using invariants and state equation in 1403 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Product exploration timeout after 83050 steps with 20696 reset in 10002 ms.
Product exploration timeout after 81000 steps with 20277 reset in 10001 ms.
Built C files in :
/tmp/ltsmin7826166762546431288
[2022-05-20 01:37:43] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7826166762546431288
Running compilation step : cd /tmp/ltsmin7826166762546431288;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7826166762546431288;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7826166762546431288;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 3101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 124 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:37:46] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:37:47] [INFO ] Implicit Places using invariants in 1505 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:37:47] [INFO ] Computed 1101 place invariants in 6 ms
[2022-05-20 01:37:49] [INFO ] Implicit Places using invariants and state equation in 1481 ms returned []
Implicit Place search using SMT with State Equation took 2988 ms to find 0 implicit places.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:37:49] [INFO ] Computed 1101 place invariants in 7 ms
[2022-05-20 01:37:50] [INFO ] Dead Transitions using invariants and state equation in 1419 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Built C files in :
/tmp/ltsmin11825340413945100318
[2022-05-20 01:37:50] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11825340413945100318
Running compilation step : cd /tmp/ltsmin11825340413945100318;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11825340413945100318;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11825340413945100318;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 01:37:54] [INFO ] Flatten gal took : 129 ms
[2022-05-20 01:37:54] [INFO ] Flatten gal took : 133 ms
[2022-05-20 01:37:54] [INFO ] Time to serialize gal into /tmp/LTL3476465174104185499.gal : 23 ms
[2022-05-20 01:37:54] [INFO ] Time to serialize properties into /tmp/LTL16576150229879659937.ltl : 56 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3476465174104185499.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16576150229879659937.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3476465...267
Read 1 LTL properties
Checking formula 0 : !(((G(F("((p2053==0)||(p170==1))")))U(G(X("((p2141==0)||(p1465==1))")))))
Formula 0 simplified : !(GF"((p2053==0)||(p170==1))" U GX"((p2141==0)||(p1465==1))")
Detected timeout of ITS tools.
[2022-05-20 01:38:09] [INFO ] Flatten gal took : 140 ms
[2022-05-20 01:38:09] [INFO ] Applying decomposition
[2022-05-20 01:38:09] [INFO ] Flatten gal took : 143 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12896937787041328589.txt' '-o' '/tmp/graph12896937787041328589.bin' '-w' '/tmp/graph12896937787041328589.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12896937787041328589.bin' '-l' '-1' '-v' '-w' '/tmp/graph12896937787041328589.weights' '-q' '0' '-e' '0.001'
[2022-05-20 01:38:09] [INFO ] Decomposing Gal with order
[2022-05-20 01:38:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 01:38:10] [INFO ] Removed a total of 600 redundant transitions.
[2022-05-20 01:38:10] [INFO ] Flatten gal took : 137 ms
[2022-05-20 01:38:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 1200 labels/synchronizations in 141 ms.
[2022-05-20 01:38:10] [INFO ] Time to serialize gal into /tmp/LTL876602451732895939.gal : 16 ms
[2022-05-20 01:38:10] [INFO ] Time to serialize properties into /tmp/LTL17571308493730012537.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL876602451732895939.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17571308493730012537.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8766024...245
Read 1 LTL properties
Checking formula 0 : !(((G(F("((i40.i1.i2.u728.p2053==0)||(i3.i0.i2.u61.p170==1))")))U(G(X("((i41.i1.i2.u759.p2141==0)||(i29.i1.i0.u520.p1465==1))")))))
Formula 0 simplified : !(GF"((i40.i1.i2.u728.p2053==0)||(i3.i0.i2.u61.p170==1))" U GX"((i41.i1.i2.u759.p2141==0)||(i29.i1.i0.u520.p1465==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18048377210541772141
[2022-05-20 01:38:25] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18048377210541772141
Running compilation step : cd /tmp/ltsmin18048377210541772141;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18048377210541772141;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18048377210541772141;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldPPPs-PT-100A-LTLCardinality-01 finished in 293125 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(p0)))'
Found a CL insensitive property : ShieldPPPs-PT-100A-LTLCardinality-02
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Applied a total of 4 rules in 257 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:38:28] [INFO ] Computed 1101 place invariants in 13 ms
[2022-05-20 01:38:30] [INFO ] Implicit Places using invariants in 1497 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:38:30] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 01:38:31] [INFO ] Implicit Places using invariants and state equation in 1480 ms returned []
Implicit Place search using SMT with State Equation took 2980 ms to find 0 implicit places.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:38:31] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:38:33] [INFO ] Dead Transitions using invariants and state equation in 1382 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 3101/3103 places, 2601/2603 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3103 places, 2601/2603 transitions.
Running random walk in product with property : ShieldPPPs-PT-100A-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s1219 0) (EQ s106 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 15 reset in 1650 ms.
Product exploration explored 100000 steps with 15 reset in 2047 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 94482 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 94482 steps, saw 85850 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:38:40] [INFO ] Computed 1101 place invariants in 10 ms
[2022-05-20 01:38:40] [INFO ] [Real]Absence check using 1101 positive place invariants in 216 ms returned sat
[2022-05-20 01:38:42] [INFO ] After 1334ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 01:38:42] [INFO ] Deduced a trap composed of 11 places in 179 ms of which 1 ms to minimize.
[2022-05-20 01:38:42] [INFO ] Deduced a trap composed of 18 places in 171 ms of which 1 ms to minimize.
[2022-05-20 01:38:43] [INFO ] Deduced a trap composed of 18 places in 172 ms of which 0 ms to minimize.
[2022-05-20 01:38:43] [INFO ] Deduced a trap composed of 18 places in 167 ms of which 1 ms to minimize.
[2022-05-20 01:38:43] [INFO ] Deduced a trap composed of 18 places in 147 ms of which 1 ms to minimize.
[2022-05-20 01:38:43] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 0 ms to minimize.
[2022-05-20 01:38:44] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 0 ms to minimize.
[2022-05-20 01:38:44] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 0 ms to minimize.
[2022-05-20 01:38:44] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 0 ms to minimize.
[2022-05-20 01:38:44] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 0 ms to minimize.
[2022-05-20 01:38:44] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 0 ms to minimize.
[2022-05-20 01:38:44] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2022-05-20 01:38:44] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2514 ms
[2022-05-20 01:38:44] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2514 ms
[2022-05-20 01:38:44] [INFO ] After 3922ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 01:38:44] [INFO ] After 4607ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 01:38:45] [INFO ] [Nat]Absence check using 1101 positive place invariants in 209 ms returned sat
[2022-05-20 01:38:46] [INFO ] After 1356ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 01:38:47] [INFO ] Deduced a trap composed of 18 places in 184 ms of which 1 ms to minimize.
[2022-05-20 01:38:47] [INFO ] Deduced a trap composed of 24 places in 173 ms of which 1 ms to minimize.
[2022-05-20 01:38:47] [INFO ] Deduced a trap composed of 29 places in 170 ms of which 1 ms to minimize.
[2022-05-20 01:38:48] [INFO ] Deduced a trap composed of 18 places in 173 ms of which 1 ms to minimize.
[2022-05-20 01:38:48] [INFO ] Deduced a trap composed of 18 places in 173 ms of which 1 ms to minimize.
[2022-05-20 01:38:48] [INFO ] Deduced a trap composed of 18 places in 168 ms of which 0 ms to minimize.
[2022-05-20 01:38:48] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 1 ms to minimize.
[2022-05-20 01:38:49] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 0 ms to minimize.
[2022-05-20 01:38:49] [INFO ] Deduced a trap composed of 18 places in 147 ms of which 1 ms to minimize.
[2022-05-20 01:38:49] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 0 ms to minimize.
[2022-05-20 01:38:49] [INFO ] Deduced a trap composed of 18 places in 141 ms of which 0 ms to minimize.
[2022-05-20 01:38:49] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 0 ms to minimize.
[2022-05-20 01:38:50] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 1 ms to minimize.
[2022-05-20 01:38:50] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 0 ms to minimize.
[2022-05-20 01:38:50] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2022-05-20 01:38:50] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2022-05-20 01:38:50] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3722 ms
[2022-05-20 01:38:50] [INFO ] After 5150ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 96 ms.
[2022-05-20 01:38:50] [INFO ] After 5917ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 53 ms.
Support contains 2 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Partial Free-agglomeration rule applied 896 times.
Drop transitions removed 896 transitions
Iterating global reduction 0 with 896 rules applied. Total rules applied 896 place count 3101 transition count 2601
Applied a total of 896 rules in 264 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 144149 steps, run timeout after 3003 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 144149 steps, saw 142939 distinct states, run finished after 3003 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:38:54] [INFO ] Computed 1101 place invariants in 36 ms
[2022-05-20 01:38:55] [INFO ] [Real]Absence check using 1047 positive place invariants in 207 ms returned sat
[2022-05-20 01:38:55] [INFO ] [Real]Absence check using 1047 positive and 54 generalized place invariants in 11 ms returned sat
[2022-05-20 01:38:56] [INFO ] After 2135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 01:38:57] [INFO ] [Nat]Absence check using 1047 positive place invariants in 198 ms returned sat
[2022-05-20 01:38:57] [INFO ] [Nat]Absence check using 1047 positive and 54 generalized place invariants in 11 ms returned sat
[2022-05-20 01:39:11] [INFO ] After 15352ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 132 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 134 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:39:12] [INFO ] Computed 1101 place invariants in 39 ms
[2022-05-20 01:39:14] [INFO ] Implicit Places using invariants in 1785 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:39:14] [INFO ] Computed 1101 place invariants in 30 ms
[2022-05-20 01:39:15] [INFO ] Implicit Places using invariants and state equation in 1819 ms returned []
Implicit Place search using SMT with State Equation took 3605 ms to find 0 implicit places.
[2022-05-20 01:39:15] [INFO ] Redundant transitions in 72 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:39:15] [INFO ] Computed 1101 place invariants in 36 ms
[2022-05-20 01:39:17] [INFO ] Dead Transitions using invariants and state equation in 1442 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 133 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:39:17] [INFO ] Computed 1101 place invariants in 36 ms
[2022-05-20 01:39:18] [INFO ] [Real]Absence check using 1047 positive place invariants in 197 ms returned sat
[2022-05-20 01:39:18] [INFO ] [Real]Absence check using 1047 positive and 54 generalized place invariants in 11 ms returned sat
[2022-05-20 01:39:19] [INFO ] After 2086ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 01:39:20] [INFO ] [Nat]Absence check using 1047 positive place invariants in 202 ms returned sat
[2022-05-20 01:39:20] [INFO ] [Nat]Absence check using 1047 positive and 54 generalized place invariants in 11 ms returned sat
[2022-05-20 01:39:34] [INFO ] After 15298ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:39:35] [INFO ] Computed 1101 place invariants in 12 ms
[2022-05-20 01:39:40] [INFO ] [Real]Absence check using 1101 positive place invariants in 1782 ms returned sat
[2022-05-20 01:39:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 01:39:50] [INFO ] [Real]Absence check using state equation in 9758 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 160 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:39:50] [INFO ] Computed 1101 place invariants in 12 ms
[2022-05-20 01:39:51] [INFO ] Implicit Places using invariants in 1458 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:39:51] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:39:53] [INFO ] Implicit Places using invariants and state equation in 1466 ms returned []
Implicit Place search using SMT with State Equation took 2926 ms to find 0 implicit places.
[2022-05-20 01:39:53] [INFO ] Redundant transitions in 68 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:39:53] [INFO ] Computed 1101 place invariants in 10 ms
[2022-05-20 01:39:54] [INFO ] Dead Transitions using invariants and state equation in 1411 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 146 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 90251 steps, run timeout after 3034 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 90251 steps, saw 81955 distinct states, run finished after 3035 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:39:58] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:39:58] [INFO ] [Real]Absence check using 1101 positive place invariants in 210 ms returned sat
[2022-05-20 01:40:00] [INFO ] After 1355ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 01:40:00] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 1 ms to minimize.
[2022-05-20 01:40:00] [INFO ] Deduced a trap composed of 18 places in 182 ms of which 1 ms to minimize.
[2022-05-20 01:40:01] [INFO ] Deduced a trap composed of 18 places in 170 ms of which 1 ms to minimize.
[2022-05-20 01:40:01] [INFO ] Deduced a trap composed of 18 places in 170 ms of which 0 ms to minimize.
[2022-05-20 01:40:01] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 1 ms to minimize.
[2022-05-20 01:40:01] [INFO ] Deduced a trap composed of 18 places in 160 ms of which 0 ms to minimize.
[2022-05-20 01:40:02] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 0 ms to minimize.
[2022-05-20 01:40:02] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 0 ms to minimize.
[2022-05-20 01:40:02] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2022-05-20 01:40:02] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2022-05-20 01:40:02] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2022-05-20 01:40:02] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2022-05-20 01:40:02] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2576 ms
[2022-05-20 01:40:02] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2576 ms
[2022-05-20 01:40:02] [INFO ] After 4004ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 01:40:02] [INFO ] After 4684ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 01:40:03] [INFO ] [Nat]Absence check using 1101 positive place invariants in 211 ms returned sat
[2022-05-20 01:40:05] [INFO ] After 1339ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 01:40:05] [INFO ] Deduced a trap composed of 18 places in 200 ms of which 0 ms to minimize.
[2022-05-20 01:40:05] [INFO ] Deduced a trap composed of 24 places in 175 ms of which 1 ms to minimize.
[2022-05-20 01:40:05] [INFO ] Deduced a trap composed of 29 places in 173 ms of which 1 ms to minimize.
[2022-05-20 01:40:06] [INFO ] Deduced a trap composed of 18 places in 173 ms of which 1 ms to minimize.
[2022-05-20 01:40:06] [INFO ] Deduced a trap composed of 18 places in 174 ms of which 1 ms to minimize.
[2022-05-20 01:40:06] [INFO ] Deduced a trap composed of 18 places in 172 ms of which 1 ms to minimize.
[2022-05-20 01:40:06] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 1 ms to minimize.
[2022-05-20 01:40:07] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 0 ms to minimize.
[2022-05-20 01:40:07] [INFO ] Deduced a trap composed of 18 places in 157 ms of which 1 ms to minimize.
[2022-05-20 01:40:07] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 0 ms to minimize.
[2022-05-20 01:40:07] [INFO ] Deduced a trap composed of 18 places in 145 ms of which 0 ms to minimize.
[2022-05-20 01:40:08] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 0 ms to minimize.
[2022-05-20 01:40:08] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 0 ms to minimize.
[2022-05-20 01:40:08] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 1 ms to minimize.
[2022-05-20 01:40:08] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 0 ms to minimize.
[2022-05-20 01:40:08] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2022-05-20 01:40:08] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3766 ms
[2022-05-20 01:40:08] [INFO ] After 5172ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 96 ms.
[2022-05-20 01:40:08] [INFO ] After 5939ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 53 ms.
Support contains 2 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Partial Free-agglomeration rule applied 896 times.
Drop transitions removed 896 transitions
Iterating global reduction 0 with 896 rules applied. Total rules applied 896 place count 3101 transition count 2601
Applied a total of 896 rules in 281 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 149771 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 149771 steps, saw 148530 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:40:12] [INFO ] Computed 1101 place invariants in 39 ms
[2022-05-20 01:40:13] [INFO ] [Real]Absence check using 1047 positive place invariants in 201 ms returned sat
[2022-05-20 01:40:13] [INFO ] [Real]Absence check using 1047 positive and 54 generalized place invariants in 14 ms returned sat
[2022-05-20 01:40:14] [INFO ] After 2123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 01:40:15] [INFO ] [Nat]Absence check using 1047 positive place invariants in 202 ms returned sat
[2022-05-20 01:40:15] [INFO ] [Nat]Absence check using 1047 positive and 54 generalized place invariants in 11 ms returned sat
[2022-05-20 01:40:30] [INFO ] After 15338ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 149 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 130 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:40:30] [INFO ] Computed 1101 place invariants in 34 ms
[2022-05-20 01:40:32] [INFO ] Implicit Places using invariants in 1775 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:40:32] [INFO ] Computed 1101 place invariants in 29 ms
[2022-05-20 01:40:33] [INFO ] Implicit Places using invariants and state equation in 1769 ms returned []
Implicit Place search using SMT with State Equation took 3547 ms to find 0 implicit places.
[2022-05-20 01:40:33] [INFO ] Redundant transitions in 72 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:40:33] [INFO ] Computed 1101 place invariants in 35 ms
[2022-05-20 01:40:35] [INFO ] Dead Transitions using invariants and state equation in 1434 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 129 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:40:35] [INFO ] Computed 1101 place invariants in 35 ms
[2022-05-20 01:40:36] [INFO ] [Real]Absence check using 1047 positive place invariants in 198 ms returned sat
[2022-05-20 01:40:36] [INFO ] [Real]Absence check using 1047 positive and 54 generalized place invariants in 13 ms returned sat
[2022-05-20 01:40:37] [INFO ] After 2092ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 01:40:38] [INFO ] [Nat]Absence check using 1047 positive place invariants in 199 ms returned sat
[2022-05-20 01:40:38] [INFO ] [Nat]Absence check using 1047 positive and 54 generalized place invariants in 11 ms returned sat
[2022-05-20 01:40:52] [INFO ] After 15313ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:40:53] [INFO ] Computed 1101 place invariants in 7 ms
[2022-05-20 01:40:58] [INFO ] [Real]Absence check using 1101 positive place invariants in 1837 ms returned sat
[2022-05-20 01:40:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 01:41:08] [INFO ] [Real]Absence check using state equation in 9604 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 15 reset in 1669 ms.
Product exploration explored 100000 steps with 15 reset in 2057 ms.
Built C files in :
/tmp/ltsmin10825143445800676089
[2022-05-20 01:41:12] [INFO ] Too many transitions (2601) to apply POR reductions. Disabling POR matrices.
[2022-05-20 01:41:12] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10825143445800676089
Running compilation step : cd /tmp/ltsmin10825143445800676089;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10825143445800676089;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10825143445800676089;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 135 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:41:15] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 01:41:17] [INFO ] Implicit Places using invariants in 1487 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:41:17] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 01:41:18] [INFO ] Implicit Places using invariants and state equation in 1477 ms returned []
Implicit Place search using SMT with State Equation took 2965 ms to find 0 implicit places.
[2022-05-20 01:41:18] [INFO ] Redundant transitions in 69 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:41:18] [INFO ] Computed 1101 place invariants in 6 ms
[2022-05-20 01:41:19] [INFO ] Dead Transitions using invariants and state equation in 1378 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Built C files in :
/tmp/ltsmin1984593240740332154
[2022-05-20 01:41:19] [INFO ] Too many transitions (2601) to apply POR reductions. Disabling POR matrices.
[2022-05-20 01:41:19] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1984593240740332154
Running compilation step : cd /tmp/ltsmin1984593240740332154;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1984593240740332154;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1984593240740332154;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 01:41:23] [INFO ] Flatten gal took : 131 ms
[2022-05-20 01:41:23] [INFO ] Flatten gal took : 134 ms
[2022-05-20 01:41:23] [INFO ] Time to serialize gal into /tmp/LTL14717157660595536758.gal : 8 ms
[2022-05-20 01:41:23] [INFO ] Time to serialize properties into /tmp/LTL2165174793414872081.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14717157660595536758.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2165174793414872081.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1471715...267
Read 1 LTL properties
Checking formula 0 : !((F(X("((p1219==0)&&(p106==1))"))))
Formula 0 simplified : !FX"((p1219==0)&&(p106==1))"
Detected timeout of ITS tools.
[2022-05-20 01:41:38] [INFO ] Flatten gal took : 131 ms
[2022-05-20 01:41:38] [INFO ] Applying decomposition
[2022-05-20 01:41:38] [INFO ] Flatten gal took : 134 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4919991742569308569.txt' '-o' '/tmp/graph4919991742569308569.bin' '-w' '/tmp/graph4919991742569308569.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4919991742569308569.bin' '-l' '-1' '-v' '-w' '/tmp/graph4919991742569308569.weights' '-q' '0' '-e' '0.001'
[2022-05-20 01:41:38] [INFO ] Decomposing Gal with order
[2022-05-20 01:41:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 01:41:39] [INFO ] Removed a total of 600 redundant transitions.
[2022-05-20 01:41:39] [INFO ] Flatten gal took : 130 ms
[2022-05-20 01:41:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 1200 labels/synchronizations in 121 ms.
[2022-05-20 01:41:39] [INFO ] Time to serialize gal into /tmp/LTL1256915968946163565.gal : 20 ms
[2022-05-20 01:41:39] [INFO ] Time to serialize properties into /tmp/LTL11652427192587037022.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1256915968946163565.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11652427192587037022.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1256915...246
Read 1 LTL properties
Checking formula 0 : !((F(X("((i23.i0.i0.u433.p1219==0)&&(i1.i1.i3.u38.p106==1))"))))
Formula 0 simplified : !FX"((i23.i0.i0.u433.p1219==0)&&(i1.i1.i3.u38.p106==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9942251995836944497
[2022-05-20 01:41:54] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9942251995836944497
Running compilation step : cd /tmp/ltsmin9942251995836944497;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9942251995836944497;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9942251995836944497;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldPPPs-PT-100A-LTLCardinality-02 finished in 209078 ms.
[2022-05-20 01:41:57] [INFO ] Flatten gal took : 162 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6364583085041883360
[2022-05-20 01:41:57] [INFO ] Too many transitions (2603) to apply POR reductions. Disabling POR matrices.
[2022-05-20 01:41:57] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6364583085041883360
[2022-05-20 01:41:57] [INFO ] Applying decomposition
Running compilation step : cd /tmp/ltsmin6364583085041883360;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-20 01:41:57] [INFO ] Flatten gal took : 132 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3288580719118750451.txt' '-o' '/tmp/graph3288580719118750451.bin' '-w' '/tmp/graph3288580719118750451.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3288580719118750451.bin' '-l' '-1' '-v' '-w' '/tmp/graph3288580719118750451.weights' '-q' '0' '-e' '0.001'
[2022-05-20 01:41:58] [INFO ] Decomposing Gal with order
[2022-05-20 01:41:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 01:41:58] [INFO ] Removed a total of 600 redundant transitions.
[2022-05-20 01:41:58] [INFO ] Flatten gal took : 132 ms
[2022-05-20 01:41:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 1204 labels/synchronizations in 214 ms.
[2022-05-20 01:41:58] [INFO ] Time to serialize gal into /tmp/LTLCardinality4145888335634654416.gal : 28 ms
[2022-05-20 01:41:58] [INFO ] Time to serialize properties into /tmp/LTLCardinality12631359525342556831.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality4145888335634654416.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12631359525342556831.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...268
Read 2 LTL properties
Checking formula 0 : !(((G(F("((i37.i1.i1.u728.p2053==0)||(i3.i0.i1.u61.p170==1))")))U(G(X("((i38.i1.i0.u759.p2141==0)||(i26.i1.i2.u520.p1465==1))")))))
Formula 0 simplified : !(GF"((i37.i1.i1.u728.p2053==0)||(i3.i0.i1.u61.p170==1))" U GX"((i38.i1.i0.u759.p2141==0)||(i26.i1.i2.u520.p1465==1))")
Compilation finished in 6246 ms.
Running link step : cd /tmp/ltsmin6364583085041883360;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin6364583085041883360;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](<>((LTLAPp0==true))) U [](X((LTLAPp1==true))))' '--buchi-type=spotba'
LTSmin run took 18349 ms.
FORMULA ShieldPPPs-PT-100A-LTLCardinality-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin6364583085041883360;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X((LTLAPp2==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-20 02:09:25] [INFO ] Applying decomposition
[2022-05-20 02:09:25] [INFO ] Flatten gal took : 509 ms
[2022-05-20 02:09:25] [INFO ] Decomposing Gal with order
[2022-05-20 02:09:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 02:09:27] [INFO ] Removed a total of 900 redundant transitions.
[2022-05-20 02:09:27] [INFO ] Flatten gal took : 495 ms
[2022-05-20 02:09:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 1200 labels/synchronizations in 743 ms.
[2022-05-20 02:09:28] [INFO ] Time to serialize gal into /tmp/LTLCardinality13170524242341541681.gal : 89 ms
[2022-05-20 02:09:28] [INFO ] Time to serialize properties into /tmp/LTLCardinality6239370830125380961.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13170524242341541681.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6239370830125380961.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...268
Read 1 LTL properties
Checking formula 0 : !((F(X("((i315.u1587.p1219==0)&&(i27.u50.p106==1))"))))
Formula 0 simplified : !FX"((i315.u1587.p1219==0)&&(i27.u50.p106==1))"
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin6364583085041883360;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X((LTLAPp2==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin6364583085041883360;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X((LTLAPp2==true)))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="ShieldPPPs-PT-100A"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is ShieldPPPs-PT-100A, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286025300515"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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