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-165286024800148.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 ShieldIIPs-PT-050A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286024800148
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 8.8K Apr 29 15:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 29 15:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 29 15:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 15: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.8K May 9 08:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:49 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 426K 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 ShieldIIPs-PT-050A-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-050A-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-050A-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-050A-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-050A-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-050A-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-050A-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-050A-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-050A-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-050A-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-050A-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-050A-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-050A-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-050A-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-050A-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-050A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652941512100

Running Version 202205111006
[2022-05-19 06:25:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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-19 06:25:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 06:25:13] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2022-05-19 06:25:13] [INFO ] Transformed 1253 places.
[2022-05-19 06:25:13] [INFO ] Transformed 1203 transitions.
[2022-05-19 06:25:13] [INFO ] Found NUPN structural information;
[2022-05-19 06:25:13] [INFO ] Parsed PT model containing 1253 places and 1203 transitions in 277 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldIIPs-PT-050A-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-050A-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-050A-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 65 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 101 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2022-05-19 06:25:13] [INFO ] Computed 451 place invariants in 32 ms
[2022-05-19 06:25:14] [INFO ] Implicit Places using invariants in 1111 ms returned []
// Phase 1: matrix 1203 rows 1253 cols
[2022-05-19 06:25:14] [INFO ] Computed 451 place invariants in 6 ms
[2022-05-19 06:25:16] [INFO ] Implicit Places using invariants and state equation in 1407 ms returned []
Implicit Place search using SMT with State Equation took 2544 ms to find 0 implicit places.
// Phase 1: matrix 1203 rows 1253 cols
[2022-05-19 06:25:16] [INFO ] Computed 451 place invariants in 5 ms
[2022-05-19 06:25:16] [INFO ] Dead Transitions using invariants and state equation in 663 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1253/1253 places, 1203/1203 transitions.
Support contains 65 out of 1253 places after structural reductions.
[2022-05-19 06:25:17] [INFO ] Flatten gal took : 210 ms
[2022-05-19 06:25:17] [INFO ] Flatten gal took : 106 ms
[2022-05-19 06:25:17] [INFO ] Input system was already deterministic with 1203 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 33) seen :32
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1203 rows 1253 cols
[2022-05-19 06:25:18] [INFO ] Computed 451 place invariants in 9 ms
[2022-05-19 06:25:18] [INFO ] [Real]Absence check using 451 positive place invariants in 75 ms returned sat
[2022-05-19 06:25:19] [INFO ] After 840ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 06:25:20] [INFO ] [Nat]Absence check using 451 positive place invariants in 80 ms returned sat
[2022-05-19 06:25:21] [INFO ] After 1078ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 06:25:22] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 3 ms to minimize.
[2022-05-19 06:25:22] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2022-05-19 06:25:23] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 1 ms to minimize.
[2022-05-19 06:25:23] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2022-05-19 06:25:23] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2022-05-19 06:25:23] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 0 ms to minimize.
[2022-05-19 06:25:23] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2022-05-19 06:25:23] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2022-05-19 06:25:23] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2022-05-19 06:25:23] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1145 ms
[2022-05-19 06:25:23] [INFO ] After 3396ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1112 ms.
[2022-05-19 06:25:24] [INFO ] After 5767ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 58 ms.
Support contains 5 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Partial Free-agglomeration rule applied 347 times.
Drop transitions removed 347 transitions
Iterating global reduction 0 with 347 rules applied. Total rules applied 351 place count 1251 transition count 1201
Applied a total of 351 rules in 467 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 1251/1253 places, 1201/1203 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 226238 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :{}
Probabilistic random walk after 226238 steps, saw 217799 distinct states, run finished after 3002 ms. (steps per millisecond=75 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1201 rows 1251 cols
[2022-05-19 06:25:28] [INFO ] Computed 451 place invariants in 62 ms
[2022-05-19 06:25:28] [INFO ] [Real]Absence check using 450 positive place invariants in 66 ms returned sat
[2022-05-19 06:25:28] [INFO ] [Real]Absence check using 450 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 06:25:29] [INFO ] After 799ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 06:25:29] [INFO ] [Nat]Absence check using 450 positive place invariants in 66 ms returned sat
[2022-05-19 06:25:29] [INFO ] [Nat]Absence check using 450 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-19 06:25:32] [INFO ] After 2389ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 06:25:32] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 06:25:32] [INFO ] After 102ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 06:25:32] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 1 ms to minimize.
[2022-05-19 06:25:32] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2022-05-19 06:25:32] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2022-05-19 06:25:32] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 0 ms to minimize.
[2022-05-19 06:25:32] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2022-05-19 06:25:33] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2022-05-19 06:25:33] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2022-05-19 06:25:33] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 0 ms to minimize.
[2022-05-19 06:25:33] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2022-05-19 06:25:33] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2022-05-19 06:25:33] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2022-05-19 06:25:33] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2022-05-19 06:25:33] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2022-05-19 06:25:33] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1625 ms
[2022-05-19 06:25:33] [INFO ] After 1787ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 607 ms.
[2022-05-19 06:25:34] [INFO ] After 5041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 117 ms.
Support contains 5 out of 1251 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1251/1251 places, 1201/1201 transitions.
Applied a total of 0 rules in 65 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1251/1251 places, 1201/1201 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1251/1251 places, 1201/1201 transitions.
Applied a total of 0 rules in 45 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
// Phase 1: matrix 1201 rows 1251 cols
[2022-05-19 06:25:34] [INFO ] Computed 451 place invariants in 47 ms
[2022-05-19 06:25:35] [INFO ] Implicit Places using invariants in 832 ms returned [1237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 835 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1250/1251 places, 1201/1201 transitions.
Applied a total of 0 rules in 31 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1250/1251 places, 1201/1201 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 246072 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 246072 steps, saw 236610 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1201 rows 1250 cols
[2022-05-19 06:25:38] [INFO ] Computed 450 place invariants in 14 ms
[2022-05-19 06:25:39] [INFO ] [Real]Absence check using 449 positive place invariants in 69 ms returned sat
[2022-05-19 06:25:39] [INFO ] [Real]Absence check using 449 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 06:25:39] [INFO ] After 803ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 06:25:39] [INFO ] [Nat]Absence check using 449 positive place invariants in 72 ms returned sat
[2022-05-19 06:25:39] [INFO ] [Nat]Absence check using 449 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-19 06:25:44] [INFO ] After 4945ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 06:25:46] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 0 ms to minimize.
[2022-05-19 06:25:46] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 0 ms to minimize.
[2022-05-19 06:25:46] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 1 ms to minimize.
[2022-05-19 06:25:46] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 0 ms to minimize.
[2022-05-19 06:25:46] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 1 ms to minimize.
[2022-05-19 06:25:47] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
[2022-05-19 06:25:47] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2022-05-19 06:25:47] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 0 ms to minimize.
[2022-05-19 06:25:47] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 0 ms to minimize.
[2022-05-19 06:25:47] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 0 ms to minimize.
[2022-05-19 06:25:47] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 1 ms to minimize.
[2022-05-19 06:25:47] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2022-05-19 06:25:48] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2022-05-19 06:25:48] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2022-05-19 06:25:48] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2255 ms
[2022-05-19 06:25:48] [INFO ] After 8398ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1051 ms.
[2022-05-19 06:25:49] [INFO ] After 9717ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 42 ms.
Support contains 5 out of 1250 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 43 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1250/1250 places, 1201/1201 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 34 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
// Phase 1: matrix 1201 rows 1250 cols
[2022-05-19 06:25:49] [INFO ] Computed 450 place invariants in 16 ms
[2022-05-19 06:25:50] [INFO ] Implicit Places using invariants in 765 ms returned []
// Phase 1: matrix 1201 rows 1250 cols
[2022-05-19 06:25:50] [INFO ] Computed 450 place invariants in 7 ms
[2022-05-19 06:25:52] [INFO ] Implicit Places using invariants and state equation in 1851 ms returned []
Implicit Place search using SMT with State Equation took 2617 ms to find 0 implicit places.
[2022-05-19 06:25:52] [INFO ] Redundant transitions in 138 ms returned []
// Phase 1: matrix 1201 rows 1250 cols
[2022-05-19 06:25:52] [INFO ] Computed 450 place invariants in 16 ms
[2022-05-19 06:25:52] [INFO ] Dead Transitions using invariants and state equation in 697 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 27 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1201 rows 1250 cols
[2022-05-19 06:25:52] [INFO ] Computed 450 place invariants in 9 ms
[2022-05-19 06:25:53] [INFO ] [Real]Absence check using 449 positive place invariants in 69 ms returned sat
[2022-05-19 06:25:53] [INFO ] [Real]Absence check using 449 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-19 06:25:53] [INFO ] After 827ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 06:25:54] [INFO ] [Nat]Absence check using 449 positive place invariants in 71 ms returned sat
[2022-05-19 06:25:54] [INFO ] [Nat]Absence check using 449 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 06:25:59] [INFO ] After 5200ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 06:26:00] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 1 ms to minimize.
[2022-05-19 06:26:00] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 1 ms to minimize.
[2022-05-19 06:26:01] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 1 ms to minimize.
[2022-05-19 06:26:01] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 1 ms to minimize.
[2022-05-19 06:26:01] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 0 ms to minimize.
[2022-05-19 06:26:01] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 1 ms to minimize.
[2022-05-19 06:26:01] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
[2022-05-19 06:26:01] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 0 ms to minimize.
[2022-05-19 06:26:02] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 1 ms to minimize.
[2022-05-19 06:26:02] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 0 ms to minimize.
[2022-05-19 06:26:02] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 1 ms to minimize.
[2022-05-19 06:26:02] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2022-05-19 06:26:02] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2022-05-19 06:26:02] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2022-05-19 06:26:02] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2266 ms
[2022-05-19 06:26:02] [INFO ] After 8686ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1088 ms.
[2022-05-19 06:26:03] [INFO ] After 10052ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-19 06:26:03] [INFO ] Flatten gal took : 88 ms
[2022-05-19 06:26:04] [INFO ] Flatten gal took : 77 ms
[2022-05-19 06:26:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1337585286798201939.gal : 35 ms
[2022-05-19 06:26:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17864586713552220362.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms16961336471626782633;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1337585286798201939.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17864586713552220362.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality17864586713552220362.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :3 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 138
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :138 after 697
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :697 after 10085
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :10085 after 22439
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :22439 after 229566
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :229566 after 2.06682e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.06682e+07 after 7.17941e+07
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :7.17941e+07 after 6.73226e+09
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :6.73226e+09 after 1.24015e+11
Detected timeout of ITS tools.
[2022-05-19 06:26:19] [INFO ] Flatten gal took : 68 ms
[2022-05-19 06:26:19] [INFO ] Applying decomposition
[2022-05-19 06:26:19] [INFO ] Flatten gal took : 68 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/graph7971532416221116277.txt' '-o' '/tmp/graph7971532416221116277.bin' '-w' '/tmp/graph7971532416221116277.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7971532416221116277.bin' '-l' '-1' '-v' '-w' '/tmp/graph7971532416221116277.weights' '-q' '0' '-e' '0.001'
[2022-05-19 06:26:19] [INFO ] Decomposing Gal with order
[2022-05-19 06:26:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 06:26:19] [INFO ] Removed a total of 945 redundant transitions.
[2022-05-19 06:26:19] [INFO ] Flatten gal took : 163 ms
[2022-05-19 06:26:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 1262 labels/synchronizations in 129 ms.
[2022-05-19 06:26:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2861134112127363933.gal : 17 ms
[2022-05-19 06:26:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6840156418716703022.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms16961336471626782633;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2861134112127363933.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6840156418716703022.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityCardinality6840156418716703022.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 8
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :8 after 8
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :8 after 8
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :8 after 8
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16208943625035057651
[2022-05-19 06:26:35] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16208943625035057651
Running compilation step : cd /tmp/ltsmin16208943625035057651;'/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/ltsmin16208943625035057651;'/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/ltsmin16208943625035057651;'/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)
FORMULA ShieldIIPs-PT-050A-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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((!(!F(X(!F(p0))) U G(p1))&&p2)))'
Support contains 5 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 99 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
// Phase 1: matrix 1201 rows 1251 cols
[2022-05-19 06:26:38] [INFO ] Computed 451 place invariants in 3 ms
[2022-05-19 06:26:39] [INFO ] Implicit Places using invariants in 626 ms returned [1237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 627 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1253 places, 1201/1203 transitions.
Applied a total of 0 rules in 32 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1250/1253 places, 1201/1203 transitions.
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p2) p1), (AND p1 p0), p1, (AND p1 p0)]
Running random walk in product with property : ShieldIIPs-PT-050A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}, { cond=(AND p2 p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (EQ s306 0) (EQ s317 0)), p1:(EQ s1121 1), p0:(AND (EQ s964 1) (EQ s985 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 44 reset in 922 ms.
Product exploration explored 100000 steps with 43 reset in 1076 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 p2 (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p2 p1))), (X p2), (X (NOT p1)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 503 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 106 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Finished random walk after 8165 steps, including 3 resets, run visited all 2 properties in 86 ms. (steps per millisecond=94 )
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p2 p1))), (X p2), (X (NOT p1)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND p0 p1)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 11 factoid took 425 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 119 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 113 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Support contains 3 out of 1250 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 40 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
// Phase 1: matrix 1201 rows 1250 cols
[2022-05-19 06:26:43] [INFO ] Computed 450 place invariants in 6 ms
[2022-05-19 06:26:43] [INFO ] Implicit Places using invariants in 623 ms returned []
// Phase 1: matrix 1201 rows 1250 cols
[2022-05-19 06:26:43] [INFO ] Computed 450 place invariants in 8 ms
[2022-05-19 06:26:45] [INFO ] Implicit Places using invariants and state equation in 1433 ms returned []
Implicit Place search using SMT with State Equation took 2057 ms to find 0 implicit places.
[2022-05-19 06:26:45] [INFO ] Redundant transitions in 238 ms returned [1195]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1200 rows 1250 cols
[2022-05-19 06:26:45] [INFO ] Computed 450 place invariants in 8 ms
[2022-05-19 06:26:45] [INFO ] Dead Transitions using invariants and state equation in 665 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1250 places, 1200/1201 transitions.
Applied a total of 0 rules in 27 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1250/1250 places, 1200/1201 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 (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 176 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 107 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1200 rows 1250 cols
[2022-05-19 06:26:46] [INFO ] Computed 450 place invariants in 8 ms
[2022-05-19 06:26:46] [INFO ] [Real]Absence check using 450 positive place invariants in 70 ms returned sat
[2022-05-19 06:26:47] [INFO ] After 791ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 06:26:47] [INFO ] [Nat]Absence check using 450 positive place invariants in 70 ms returned sat
[2022-05-19 06:26:48] [INFO ] After 936ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 06:26:49] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 0 ms to minimize.
[2022-05-19 06:26:49] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2022-05-19 06:26:49] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 0 ms to minimize.
[2022-05-19 06:26:49] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2022-05-19 06:26:49] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2022-05-19 06:26:49] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2022-05-19 06:26:50] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2022-05-19 06:26:50] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2022-05-19 06:26:50] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2022-05-19 06:26:50] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2022-05-19 06:26:50] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2022-05-19 06:26:50] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1221 ms
[2022-05-19 06:26:50] [INFO ] After 2961ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 140 ms.
[2022-05-19 06:26:50] [INFO ] After 3373ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 59 ms.
Support contains 3 out of 1250 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1250/1250 places, 1200/1200 transitions.
Partial Free-agglomeration rule applied 345 times.
Drop transitions removed 345 transitions
Iterating global reduction 0 with 345 rules applied. Total rules applied 345 place count 1250 transition count 1200
Applied a total of 345 rules in 51 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1250/1250 places, 1200/1200 transitions.
Finished random walk after 688 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=98 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 212 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 92 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 117 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 106 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 44 reset in 873 ms.
Product exploration explored 100000 steps with 44 reset in 1008 ms.
Built C files in :
/tmp/ltsmin3274288520784566007
[2022-05-19 06:26:53] [INFO ] Computing symmetric may disable matrix : 1200 transitions.
[2022-05-19 06:26:53] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 06:26:53] [INFO ] Computing symmetric may enable matrix : 1200 transitions.
[2022-05-19 06:26:53] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 06:26:53] [INFO ] Computing Do-Not-Accords matrix : 1200 transitions.
[2022-05-19 06:26:54] [INFO ] Computation of Completed DNA matrix. took 36 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 06:26:54] [INFO ] Built C files in 202ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3274288520784566007
Running compilation step : cd /tmp/ltsmin3274288520784566007;'/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/ltsmin3274288520784566007;'/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/ltsmin3274288520784566007;'/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 3 out of 1250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1250/1250 places, 1200/1200 transitions.
Applied a total of 0 rules in 31 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
// Phase 1: matrix 1200 rows 1250 cols
[2022-05-19 06:26:57] [INFO ] Computed 450 place invariants in 16 ms
[2022-05-19 06:26:57] [INFO ] Implicit Places using invariants in 636 ms returned []
// Phase 1: matrix 1200 rows 1250 cols
[2022-05-19 06:26:57] [INFO ] Computed 450 place invariants in 6 ms
[2022-05-19 06:26:59] [INFO ] Implicit Places using invariants and state equation in 1413 ms returned []
Implicit Place search using SMT with State Equation took 2050 ms to find 0 implicit places.
[2022-05-19 06:26:59] [INFO ] Redundant transitions in 116 ms returned []
// Phase 1: matrix 1200 rows 1250 cols
[2022-05-19 06:26:59] [INFO ] Computed 450 place invariants in 3 ms
[2022-05-19 06:26:59] [INFO ] Dead Transitions using invariants and state equation in 654 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1250/1250 places, 1200/1200 transitions.
Built C files in :
/tmp/ltsmin10321921436156752321
[2022-05-19 06:26:59] [INFO ] Computing symmetric may disable matrix : 1200 transitions.
[2022-05-19 06:26:59] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 06:26:59] [INFO ] Computing symmetric may enable matrix : 1200 transitions.
[2022-05-19 06:26:59] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 06:27:00] [INFO ] Computing Do-Not-Accords matrix : 1200 transitions.
[2022-05-19 06:27:00] [INFO ] Computation of Completed DNA matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 06:27:00] [INFO ] Built C files in 180ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10321921436156752321
Running compilation step : cd /tmp/ltsmin10321921436156752321;'/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/ltsmin10321921436156752321;'/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/ltsmin10321921436156752321;'/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-19 06:27:03] [INFO ] Flatten gal took : 70 ms
[2022-05-19 06:27:03] [INFO ] Flatten gal took : 67 ms
[2022-05-19 06:27:03] [INFO ] Time to serialize gal into /tmp/LTL2492167864248585960.gal : 11 ms
[2022-05-19 06:27:03] [INFO ] Time to serialize properties into /tmp/LTL745553018862206849.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/LTL2492167864248585960.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL745553018862206849.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/LTL2492167...265
Read 1 LTL properties
Checking formula 0 : !((F((!((!(F(X(!(F("((p964==1)&&(p985==1))"))))))U(G("(p1121==1)"))))&&("((p306==0)||(p317==0))"))))
Formula 0 simplified : !F("((p306==0)||(p317==0))" & !(!FX!F"((p964==1)&&(p985==1))" U G"(p1121==1)"))
Detected timeout of ITS tools.
[2022-05-19 06:27:18] [INFO ] Flatten gal took : 66 ms
[2022-05-19 06:27:18] [INFO ] Applying decomposition
[2022-05-19 06:27:18] [INFO ] Flatten gal took : 73 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/graph14055373804886252371.txt' '-o' '/tmp/graph14055373804886252371.bin' '-w' '/tmp/graph14055373804886252371.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14055373804886252371.bin' '-l' '-1' '-v' '-w' '/tmp/graph14055373804886252371.weights' '-q' '0' '-e' '0.001'
[2022-05-19 06:27:18] [INFO ] Decomposing Gal with order
[2022-05-19 06:27:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 06:27:18] [INFO ] Removed a total of 795 redundant transitions.
[2022-05-19 06:27:18] [INFO ] Flatten gal took : 86 ms
[2022-05-19 06:27:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 748 labels/synchronizations in 117 ms.
[2022-05-19 06:27:18] [INFO ] Time to serialize gal into /tmp/LTL3129037637206852468.gal : 14 ms
[2022-05-19 06:27:18] [INFO ] Time to serialize properties into /tmp/LTL13477445208985296360.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/LTL3129037637206852468.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13477445208985296360.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/LTL3129037...246
Read 1 LTL properties
Checking formula 0 : !((F((!((!(F(X(!(F("((i21.u348.p964==1)&&(i22.i0.i1.u355.p985==1))"))))))U(G("(i25.i0.i1.u404.p1121==1)"))))&&("((i7.i0.i1.u110.p306==...188
Formula 0 simplified : !F("((i7.i0.i1.u110.p306==0)||(i7.i0.i1.u114.p317==0))" & !(!FX!F"((i21.u348.p964==1)&&(i22.i0.i1.u355.p985==1))" U G"(i25.i0.i1.u40...169
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9752827704022476193
[2022-05-19 06:27:34] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9752827704022476193
Running compilation step : cd /tmp/ltsmin9752827704022476193;'/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'
Compilation finished in 2261 ms.
Running link step : cd /tmp/ltsmin9752827704022476193;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin9752827704022476193;'/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(!<>((LTLAPp0==true)))) U []((LTLAPp1==true)))&&(LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-050A-LTLFireability-01 finished in 70674 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1252 transition count 1201
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1250 transition count 1201
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 1249 transition count 1200
Applied a total of 5 rules in 61 ms. Remains 1249 /1253 variables (removed 4) and now considering 1200/1203 (removed 3) transitions.
// Phase 1: matrix 1200 rows 1249 cols
[2022-05-19 06:27:49] [INFO ] Computed 450 place invariants in 4 ms
[2022-05-19 06:27:49] [INFO ] Implicit Places using invariants in 619 ms returned []
// Phase 1: matrix 1200 rows 1249 cols
[2022-05-19 06:27:49] [INFO ] Computed 450 place invariants in 2 ms
[2022-05-19 06:27:51] [INFO ] Implicit Places using invariants and state equation in 1366 ms returned []
Implicit Place search using SMT with State Equation took 1987 ms to find 0 implicit places.
[2022-05-19 06:27:51] [INFO ] Redundant transitions in 111 ms returned [1194]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1199 rows 1249 cols
[2022-05-19 06:27:51] [INFO ] Computed 450 place invariants in 6 ms
[2022-05-19 06:27:51] [INFO ] Dead Transitions using invariants and state equation in 639 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1249/1253 places, 1199/1203 transitions.
Applied a total of 0 rules in 25 ms. Remains 1249 /1249 variables (removed 0) and now considering 1199/1199 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1249/1253 places, 1199/1203 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-050A-LTLFireability-02 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:(NEQ s1039 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 276 reset in 766 ms.
Product exploration explored 100000 steps with 289 reset in 975 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 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 69 ms :[(NOT p0), (NOT p0)]
Finished random walk after 291 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=97 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 110 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 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 1249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1249/1249 places, 1199/1199 transitions.
Applied a total of 0 rules in 23 ms. Remains 1249 /1249 variables (removed 0) and now considering 1199/1199 (removed 0) transitions.
// Phase 1: matrix 1199 rows 1249 cols
[2022-05-19 06:27:54] [INFO ] Computed 450 place invariants in 5 ms
[2022-05-19 06:27:54] [INFO ] Implicit Places using invariants in 600 ms returned []
// Phase 1: matrix 1199 rows 1249 cols
[2022-05-19 06:27:54] [INFO ] Computed 450 place invariants in 6 ms
[2022-05-19 06:27:56] [INFO ] Implicit Places using invariants and state equation in 1377 ms returned []
Implicit Place search using SMT with State Equation took 1978 ms to find 0 implicit places.
[2022-05-19 06:27:56] [INFO ] Redundant transitions in 121 ms returned []
// Phase 1: matrix 1199 rows 1249 cols
[2022-05-19 06:27:56] [INFO ] Computed 450 place invariants in 2 ms
[2022-05-19 06:27:57] [INFO ] Dead Transitions using invariants and state equation in 633 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1249/1249 places, 1199/1199 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 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 54 ms :[(NOT p0), (NOT p0)]
Finished random walk after 279 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=93 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 136 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 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 272 reset in 787 ms.
Product exploration explored 100000 steps with 265 reset in 948 ms.
Built C files in :
/tmp/ltsmin10261953236386193787
[2022-05-19 06:27:59] [INFO ] Computing symmetric may disable matrix : 1199 transitions.
[2022-05-19 06:27:59] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 06:27:59] [INFO ] Computing symmetric may enable matrix : 1199 transitions.
[2022-05-19 06:27:59] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 06:27:59] [INFO ] Computing Do-Not-Accords matrix : 1199 transitions.
[2022-05-19 06:27:59] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 06:27:59] [INFO ] Built C files in 137ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10261953236386193787
Running compilation step : cd /tmp/ltsmin10261953236386193787;'/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/ltsmin10261953236386193787;'/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/ltsmin10261953236386193787;'/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 1 out of 1249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1249/1249 places, 1199/1199 transitions.
Applied a total of 0 rules in 32 ms. Remains 1249 /1249 variables (removed 0) and now considering 1199/1199 (removed 0) transitions.
// Phase 1: matrix 1199 rows 1249 cols
[2022-05-19 06:28:02] [INFO ] Computed 450 place invariants in 6 ms
[2022-05-19 06:28:03] [INFO ] Implicit Places using invariants in 615 ms returned []
// Phase 1: matrix 1199 rows 1249 cols
[2022-05-19 06:28:03] [INFO ] Computed 450 place invariants in 2 ms
[2022-05-19 06:28:04] [INFO ] Implicit Places using invariants and state equation in 1388 ms returned []
Implicit Place search using SMT with State Equation took 2004 ms to find 0 implicit places.
[2022-05-19 06:28:04] [INFO ] Redundant transitions in 110 ms returned []
// Phase 1: matrix 1199 rows 1249 cols
[2022-05-19 06:28:04] [INFO ] Computed 450 place invariants in 5 ms
[2022-05-19 06:28:05] [INFO ] Dead Transitions using invariants and state equation in 647 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1249/1249 places, 1199/1199 transitions.
Built C files in :
/tmp/ltsmin11611068430841301299
[2022-05-19 06:28:05] [INFO ] Computing symmetric may disable matrix : 1199 transitions.
[2022-05-19 06:28:05] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 06:28:05] [INFO ] Computing symmetric may enable matrix : 1199 transitions.
[2022-05-19 06:28:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 06:28:05] [INFO ] Computing Do-Not-Accords matrix : 1199 transitions.
[2022-05-19 06:28:05] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 06:28:05] [INFO ] Built C files in 137ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11611068430841301299
Running compilation step : cd /tmp/ltsmin11611068430841301299;'/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/ltsmin11611068430841301299;'/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/ltsmin11611068430841301299;'/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-19 06:28:08] [INFO ] Flatten gal took : 42 ms
[2022-05-19 06:28:08] [INFO ] Flatten gal took : 43 ms
[2022-05-19 06:28:08] [INFO ] Time to serialize gal into /tmp/LTL15660571718140867522.gal : 5 ms
[2022-05-19 06:28:08] [INFO ] Time to serialize properties into /tmp/LTL10535973327386877245.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/LTL15660571718140867522.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10535973327386877245.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/LTL1566057...268
Read 1 LTL properties
Checking formula 0 : !((G(F("(p1040==0)"))))
Formula 0 simplified : !GF"(p1040==0)"
Detected timeout of ITS tools.
[2022-05-19 06:28:23] [INFO ] Flatten gal took : 44 ms
[2022-05-19 06:28:23] [INFO ] Applying decomposition
[2022-05-19 06:28:23] [INFO ] Flatten gal took : 42 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/graph12727754015515921736.txt' '-o' '/tmp/graph12727754015515921736.bin' '-w' '/tmp/graph12727754015515921736.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12727754015515921736.bin' '-l' '-1' '-v' '-w' '/tmp/graph12727754015515921736.weights' '-q' '0' '-e' '0.001'
[2022-05-19 06:28:23] [INFO ] Decomposing Gal with order
[2022-05-19 06:28:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 06:28:23] [INFO ] Removed a total of 795 redundant transitions.
[2022-05-19 06:28:23] [INFO ] Flatten gal took : 68 ms
[2022-05-19 06:28:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 596 labels/synchronizations in 7 ms.
[2022-05-19 06:28:24] [INFO ] Time to serialize gal into /tmp/LTL16702878951337957783.gal : 7 ms
[2022-05-19 06:28:24] [INFO ] Time to serialize properties into /tmp/LTL2832979558039138203.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/LTL16702878951337957783.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2832979558039138203.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/LTL1670287...246
Read 1 LTL properties
Checking formula 0 : !((G(F("(i23.u375.p1040==0)"))))
Formula 0 simplified : !GF"(i23.u375.p1040==0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1687023728166407936
[2022-05-19 06:28:39] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1687023728166407936
Running compilation step : cd /tmp/ltsmin1687023728166407936;'/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'
Compilation finished in 2388 ms.
Running link step : cd /tmp/ltsmin1687023728166407936;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin1687023728166407936;'/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)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-050A-LTLFireability-02 finished in 65002 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 57 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
// Phase 1: matrix 1201 rows 1251 cols
[2022-05-19 06:28:54] [INFO ] Computed 451 place invariants in 7 ms
[2022-05-19 06:28:54] [INFO ] Implicit Places using invariants in 616 ms returned [1237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 617 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1253 places, 1201/1203 transitions.
Applied a total of 0 rules in 25 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1250/1253 places, 1201/1203 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-050A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s278 1) (EQ s299 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 2514 steps with 0 reset in 23 ms.
FORMULA ShieldIIPs-PT-050A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050A-LTLFireability-03 finished in 779 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(!(F(p0) U G(p1))))||(X(p2)&&p3))))'
Support contains 8 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 21 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2022-05-19 06:28:54] [INFO ] Computed 451 place invariants in 6 ms
[2022-05-19 06:28:55] [INFO ] Implicit Places using invariants in 641 ms returned []
// Phase 1: matrix 1203 rows 1253 cols
[2022-05-19 06:28:55] [INFO ] Computed 451 place invariants in 3 ms
[2022-05-19 06:28:57] [INFO ] Implicit Places using invariants and state equation in 1445 ms returned []
Implicit Place search using SMT with State Equation took 2088 ms to find 0 implicit places.
// Phase 1: matrix 1203 rows 1253 cols
[2022-05-19 06:28:57] [INFO ] Computed 451 place invariants in 3 ms
[2022-05-19 06:28:57] [INFO ] Dead Transitions using invariants and state equation in 652 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1253/1253 places, 1203/1203 transitions.
Stuttering acceptance computed with spot in 390 ms :[(OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-050A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=p3, acceptance={} source=0 dest: 2}], [{ cond=(NOT p3), acceptance={} source=1 dest: 3}, { cond=p3, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p3 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p3) p0), acceptance={} source=3 dest: 3}, { cond=(AND p3 p0), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p3) p1), acceptance={} source=3 dest: 6}, { cond=(AND p3 (NOT p0)), acceptance={} source=3 dest: 7}, { cond=(AND p3 p1), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=4 dest: 3}, { cond=(AND p3 (NOT p2) p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=4 dest: 6}, { cond=(AND p3 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 7}, { cond=(AND p3 (NOT p2) p1), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p3) p0), acceptance={} source=5 dest: 3}, { cond=(AND p3 p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p3) p0 p1), acceptance={} source=5 dest: 6}, { cond=(AND p3 (NOT p0)), acceptance={} source=5 dest: 7}, { cond=(AND p3 p0 p1), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p3) p1), acceptance={0} source=6 dest: 6}, { cond=(AND p3 p1), acceptance={0} source=6 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=7 dest: 3}, { cond=(AND p3 (NOT p2) p0), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p0 p1), acceptance={} source=7 dest: 6}, { cond=(AND p3 (NOT p2) (NOT p0)), acceptance={} source=7 dest: 7}, { cond=(AND p3 (NOT p2) p0 p1), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2) p1), acceptance={0} source=8 dest: 6}, { cond=(AND p3 (NOT p2) p1), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p3:(EQ s991 1), p2:(OR (EQ s581 0) (EQ s591 0)), p0:(AND (EQ s386 1) (EQ s392 1) (EQ s402 1)), p1:(AND (EQ s1114 1) (EQ s1135 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 116 reset in 860 ms.
Product exploration explored 100000 steps with 104 reset in 1028 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 (NOT p3) p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT p3)), (X (NOT (AND p3 (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND p3 (NOT p2) p0)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND p3 p1)))), (X (X (NOT (AND p3 (NOT p2) p1)))), (X (X (NOT (AND p3 p0)))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND p3 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 778 ms. Reduced automaton from 9 states, 34 edges and 4 AP to 8 states, 30 edges and 4 AP.
Stuttering acceptance computed with spot in 371 ms :[(OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 1203 rows 1253 cols
[2022-05-19 06:29:02] [INFO ] Computed 451 place invariants in 7 ms
[2022-05-19 06:29:02] [INFO ] [Real]Absence check using 451 positive place invariants in 71 ms returned sat
[2022-05-19 06:29:04] [INFO ] After 2091ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-05-19 06:29:04] [INFO ] [Nat]Absence check using 451 positive place invariants in 72 ms returned sat
[2022-05-19 06:29:11] [INFO ] After 6009ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2022-05-19 06:29:11] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2022-05-19 06:29:11] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2022-05-19 06:29:11] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2022-05-19 06:29:11] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2022-05-19 06:29:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 450 ms
[2022-05-19 06:29:12] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2022-05-19 06:29:12] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 0 ms to minimize.
[2022-05-19 06:29:12] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2022-05-19 06:29:12] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2022-05-19 06:29:12] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2022-05-19 06:29:12] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2022-05-19 06:29:13] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2022-05-19 06:29:13] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2022-05-19 06:29:13] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 880 ms
[2022-05-19 06:29:13] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 0 ms to minimize.
[2022-05-19 06:29:13] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2022-05-19 06:29:13] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2022-05-19 06:29:13] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2022-05-19 06:29:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 477 ms
[2022-05-19 06:29:14] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2022-05-19 06:29:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2022-05-19 06:29:14] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 0 ms to minimize.
[2022-05-19 06:29:14] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2022-05-19 06:29:14] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2022-05-19 06:29:15] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2022-05-19 06:29:15] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 0 ms to minimize.
[2022-05-19 06:29:15] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 0 ms to minimize.
[2022-05-19 06:29:15] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 0 ms to minimize.
[2022-05-19 06:29:15] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
[2022-05-19 06:29:15] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2022-05-19 06:29:15] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2022-05-19 06:29:15] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2022-05-19 06:29:15] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2022-05-19 06:29:16] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2022-05-19 06:29:16] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1593 ms
[2022-05-19 06:29:17] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2022-05-19 06:29:17] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2022-05-19 06:29:17] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 0 ms to minimize.
[2022-05-19 06:29:17] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2022-05-19 06:29:17] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2022-05-19 06:29:17] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2022-05-19 06:29:17] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 779 ms
[2022-05-19 06:29:18] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2022-05-19 06:29:18] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 0 ms to minimize.
[2022-05-19 06:29:18] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 1 ms to minimize.
[2022-05-19 06:29:18] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 0 ms to minimize.
[2022-05-19 06:29:18] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 0 ms to minimize.
[2022-05-19 06:29:18] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 0 ms to minimize.
[2022-05-19 06:29:19] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 0 ms to minimize.
[2022-05-19 06:29:19] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2022-05-19 06:29:19] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2022-05-19 06:29:19] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2022-05-19 06:29:19] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2022-05-19 06:29:19] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 0 ms to minimize.
[2022-05-19 06:29:19] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 0 ms to minimize.
[2022-05-19 06:29:19] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2022-05-19 06:29:19] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2022-05-19 06:29:20] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2022-05-19 06:29:20] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2022-05-19 06:29:20] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2022-05-19 06:29:20] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2171 ms
[2022-05-19 06:29:20] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2022-05-19 06:29:20] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 0 ms to minimize.
[2022-05-19 06:29:20] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2022-05-19 06:29:20] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2022-05-19 06:29:20] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2022-05-19 06:29:21] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2022-05-19 06:29:21] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 780 ms
[2022-05-19 06:29:21] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2022-05-19 06:29:21] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2022-05-19 06:29:21] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2022-05-19 06:29:21] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2022-05-19 06:29:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 444 ms
[2022-05-19 06:29:21] [INFO ] After 16794ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 2607 ms.
[2022-05-19 06:29:24] [INFO ] After 20060ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 1 properties in 2099 ms.
Support contains 8 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Partial Free-agglomeration rule applied 344 times.
Drop transitions removed 344 transitions
Iterating global reduction 0 with 344 rules applied. Total rules applied 348 place count 1251 transition count 1201
Applied a total of 348 rules in 75 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 1251/1253 places, 1201/1203 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1201 rows 1251 cols
[2022-05-19 06:29:27] [INFO ] Computed 451 place invariants in 13 ms
[2022-05-19 06:29:27] [INFO ] [Real]Absence check using 447 positive place invariants in 71 ms returned sat
[2022-05-19 06:29:27] [INFO ] [Real]Absence check using 447 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-19 06:29:29] [INFO ] After 1614ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-19 06:29:29] [INFO ] [Nat]Absence check using 447 positive place invariants in 69 ms returned sat
[2022-05-19 06:29:29] [INFO ] [Nat]Absence check using 447 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-19 06:29:33] [INFO ] After 3591ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-19 06:29:33] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 06:29:35] [INFO ] After 1793ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-05-19 06:29:35] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 0 ms to minimize.
[2022-05-19 06:29:35] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 0 ms to minimize.
[2022-05-19 06:29:35] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 0 ms to minimize.
[2022-05-19 06:29:35] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 1 ms to minimize.
[2022-05-19 06:29:35] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2022-05-19 06:29:36] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2022-05-19 06:29:36] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 0 ms to minimize.
[2022-05-19 06:29:36] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2022-05-19 06:29:36] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2022-05-19 06:29:36] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2022-05-19 06:29:36] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 2 ms to minimize.
[2022-05-19 06:29:36] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2022-05-19 06:29:36] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1743 ms
[2022-05-19 06:29:37] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2022-05-19 06:29:37] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 0 ms to minimize.
[2022-05-19 06:29:37] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 0 ms to minimize.
[2022-05-19 06:29:37] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 0 ms to minimize.
[2022-05-19 06:29:37] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 0 ms to minimize.
[2022-05-19 06:29:38] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 0 ms to minimize.
[2022-05-19 06:29:38] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2022-05-19 06:29:38] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2022-05-19 06:29:38] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2022-05-19 06:29:38] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2022-05-19 06:29:38] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2022-05-19 06:29:38] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1524 ms
[2022-05-19 06:29:38] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2022-05-19 06:29:39] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2022-05-19 06:29:39] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2022-05-19 06:29:39] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2022-05-19 06:29:39] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 0 ms to minimize.
[2022-05-19 06:29:39] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2022-05-19 06:29:39] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2022-05-19 06:29:39] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2022-05-19 06:29:39] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2022-05-19 06:29:39] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2022-05-19 06:29:40] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1174 ms
[2022-05-19 06:29:40] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 0 ms to minimize.
[2022-05-19 06:29:40] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 0 ms to minimize.
[2022-05-19 06:29:40] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 0 ms to minimize.
[2022-05-19 06:29:40] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2022-05-19 06:29:40] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2022-05-19 06:29:40] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
[2022-05-19 06:29:41] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 0 ms to minimize.
[2022-05-19 06:29:41] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2022-05-19 06:29:41] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2022-05-19 06:29:41] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2022-05-19 06:29:41] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2022-05-19 06:29:41] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1161 ms
[2022-05-19 06:29:43] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 0 ms to minimize.
[2022-05-19 06:29:43] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 1 ms to minimize.
[2022-05-19 06:29:43] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 0 ms to minimize.
[2022-05-19 06:29:44] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 1 ms to minimize.
[2022-05-19 06:29:44] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 1 ms to minimize.
[2022-05-19 06:29:44] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 0 ms to minimize.
[2022-05-19 06:29:44] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 1 ms to minimize.
[2022-05-19 06:29:44] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 0 ms to minimize.
[2022-05-19 06:29:45] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 1 ms to minimize.
[2022-05-19 06:29:45] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 1 ms to minimize.
[2022-05-19 06:29:45] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 1 ms to minimize.
[2022-05-19 06:29:45] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 0 ms to minimize.
[2022-05-19 06:29:45] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 0 ms to minimize.
[2022-05-19 06:29:46] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 0 ms to minimize.
[2022-05-19 06:29:46] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 0 ms to minimize.
[2022-05-19 06:29:46] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 0 ms to minimize.
[2022-05-19 06:29:47] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 1 ms to minimize.
[2022-05-19 06:29:47] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 1 ms to minimize.
[2022-05-19 06:29:48] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
[2022-05-19 06:29:48] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
[2022-05-19 06:29:48] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 0 ms to minimize.
[2022-05-19 06:29:48] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2022-05-19 06:29:48] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 1 ms to minimize.
[2022-05-19 06:29:48] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 0 ms to minimize.
[2022-05-19 06:29:49] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 1 ms to minimize.
[2022-05-19 06:29:49] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 1 ms to minimize.
[2022-05-19 06:29:49] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 0 ms to minimize.
[2022-05-19 06:29:49] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2022-05-19 06:29:49] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 0 ms to minimize.
[2022-05-19 06:29:49] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2022-05-19 06:29:49] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2022-05-19 06:29:50] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2022-05-19 06:29:50] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2022-05-19 06:29:50] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2022-05-19 06:29:50] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2022-05-19 06:29:50] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2022-05-19 06:29:50] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2022-05-19 06:29:50] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 7366 ms
[2022-05-19 06:29:51] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2022-05-19 06:29:51] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
[2022-05-19 06:29:51] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 0 ms to minimize.
[2022-05-19 06:29:51] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2022-05-19 06:29:51] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2022-05-19 06:29:51] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2022-05-19 06:29:51] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 695 ms
[2022-05-19 06:29:52] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2022-05-19 06:29:52] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 1 ms to minimize.
[2022-05-19 06:29:52] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2022-05-19 06:29:52] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2022-05-19 06:29:53] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 0 ms to minimize.
[2022-05-19 06:29:53] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
[2022-05-19 06:29:53] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 0 ms to minimize.
[2022-05-19 06:29:53] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 0 ms to minimize.
[2022-05-19 06:29:53] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 0 ms to minimize.
[2022-05-19 06:29:53] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1410 ms
[2022-05-19 06:29:54] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 0 ms to minimize.
[2022-05-19 06:29:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 06:29:54] [INFO ] After 25063ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 1088 ms.
Support contains 8 out of 1251 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1251/1251 places, 1201/1201 transitions.
Applied a total of 0 rules in 23 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1251/1251 places, 1201/1201 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 122177 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 122177 steps, saw 117938 distinct states, run finished after 3002 ms. (steps per millisecond=40 ) properties seen :2
Running SMT prover for 6 properties.
// Phase 1: matrix 1201 rows 1251 cols
[2022-05-19 06:29:59] [INFO ] Computed 451 place invariants in 6 ms
[2022-05-19 06:29:59] [INFO ] [Real]Absence check using 447 positive place invariants in 70 ms returned sat
[2022-05-19 06:29:59] [INFO ] [Real]Absence check using 447 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-19 06:30:00] [INFO ] After 1392ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-19 06:30:00] [INFO ] [Nat]Absence check using 447 positive place invariants in 68 ms returned sat
[2022-05-19 06:30:00] [INFO ] [Nat]Absence check using 447 positive and 4 generalized place invariants in 2 ms returned sat
[2022-05-19 06:30:06] [INFO ] After 5116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-19 06:30:06] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 06:30:08] [INFO ] After 2478ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-19 06:30:08] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 0 ms to minimize.
[2022-05-19 06:30:08] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 1 ms to minimize.
[2022-05-19 06:30:09] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2022-05-19 06:30:09] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2022-05-19 06:30:09] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2022-05-19 06:30:09] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2022-05-19 06:30:09] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2022-05-19 06:30:09] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2022-05-19 06:30:10] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2022-05-19 06:30:10] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2022-05-19 06:30:10] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2022-05-19 06:30:10] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2022-05-19 06:30:10] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2022-05-19 06:30:11] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 1 ms to minimize.
[2022-05-19 06:30:11] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 0 ms to minimize.
[2022-05-19 06:30:11] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 1 ms to minimize.
[2022-05-19 06:30:12] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 1 ms to minimize.
[2022-05-19 06:30:12] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 0 ms to minimize.
[2022-05-19 06:30:12] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 1 ms to minimize.
[2022-05-19 06:30:12] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 0 ms to minimize.
[2022-05-19 06:30:12] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 1 ms to minimize.
[2022-05-19 06:30:13] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 0 ms to minimize.
[2022-05-19 06:30:13] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 1 ms to minimize.
[2022-05-19 06:30:13] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 1 ms to minimize.
[2022-05-19 06:30:13] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 1 ms to minimize.
[2022-05-19 06:30:13] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 0 ms to minimize.
[2022-05-19 06:30:14] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 1 ms to minimize.
[2022-05-19 06:30:14] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 2 ms to minimize.
[2022-05-19 06:30:14] [INFO ] Trap strengthening procedure interrupted after too many repetitions 5604 ms
[2022-05-19 06:30:14] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 5604 ms
[2022-05-19 06:30:14] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 0 ms to minimize.
[2022-05-19 06:30:14] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 0 ms to minimize.
[2022-05-19 06:30:15] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 0 ms to minimize.
[2022-05-19 06:30:15] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 0 ms to minimize.
[2022-05-19 06:30:15] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2022-05-19 06:30:15] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2022-05-19 06:30:15] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
[2022-05-19 06:30:15] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2022-05-19 06:30:15] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2022-05-19 06:30:15] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2022-05-19 06:30:15] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 0 ms to minimize.
[2022-05-19 06:30:16] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 0 ms to minimize.
[2022-05-19 06:30:16] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 0 ms to minimize.
[2022-05-19 06:30:16] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 0 ms to minimize.
[2022-05-19 06:30:16] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2022-05-19 06:30:16] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2022-05-19 06:30:16] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2022-05-19 06:30:16] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2022-05-19 06:30:16] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2022-05-19 06:30:16] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2022-05-19 06:30:16] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2062 ms
[2022-05-19 06:30:18] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 0 ms to minimize.
[2022-05-19 06:30:18] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
[2022-05-19 06:30:18] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
[2022-05-19 06:30:18] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 0 ms to minimize.
[2022-05-19 06:30:18] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2022-05-19 06:30:19] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 0 ms to minimize.
[2022-05-19 06:30:19] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 0 ms to minimize.
[2022-05-19 06:30:19] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 0 ms to minimize.
[2022-05-19 06:30:19] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 0 ms to minimize.
[2022-05-19 06:30:19] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 0 ms to minimize.
[2022-05-19 06:30:19] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2022-05-19 06:30:19] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2022-05-19 06:30:19] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1804 ms
[2022-05-19 06:30:20] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2022-05-19 06:30:20] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2022-05-19 06:30:20] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2022-05-19 06:30:20] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 0 ms to minimize.
[2022-05-19 06:30:20] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2022-05-19 06:30:20] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 0 ms to minimize.
[2022-05-19 06:30:20] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 798 ms
[2022-05-19 06:30:22] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 0 ms to minimize.
[2022-05-19 06:30:23] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2022-05-19 06:30:23] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2022-05-19 06:30:23] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 0 ms to minimize.
[2022-05-19 06:30:24] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 0 ms to minimize.
[2022-05-19 06:30:24] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2022-05-19 06:30:24] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2022-05-19 06:30:24] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2022-05-19 06:30:24] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2022-05-19 06:30:24] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2022-05-19 06:30:24] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2712 ms
[2022-05-19 06:30:25] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2022-05-19 06:30:25] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2022-05-19 06:30:25] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2022-05-19 06:30:25] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2022-05-19 06:30:25] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 0 ms to minimize.
[2022-05-19 06:30:25] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 06:30:25] [INFO ] After 25051ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 978 ms.
Support contains 8 out of 1251 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1251/1251 places, 1201/1201 transitions.
Applied a total of 0 rules in 23 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1251/1251 places, 1201/1201 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 129087 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 129087 steps, saw 124690 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1201 rows 1251 cols
[2022-05-19 06:30:30] [INFO ] Computed 451 place invariants in 6 ms
[2022-05-19 06:30:30] [INFO ] [Real]Absence check using 447 positive place invariants in 69 ms returned sat
[2022-05-19 06:30:30] [INFO ] [Real]Absence check using 447 positive and 4 generalized place invariants in 0 ms returned sat
[2022-05-19 06:30:31] [INFO ] After 1399ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-19 06:30:31] [INFO ] [Nat]Absence check using 447 positive place invariants in 68 ms returned sat
[2022-05-19 06:30:31] [INFO ] [Nat]Absence check using 447 positive and 4 generalized place invariants in 0 ms returned sat
[2022-05-19 06:30:37] [INFO ] After 5082ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-19 06:30:37] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 06:30:39] [INFO ] After 2516ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-19 06:30:39] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 0 ms to minimize.
[2022-05-19 06:30:40] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 0 ms to minimize.
[2022-05-19 06:30:40] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 0 ms to minimize.
[2022-05-19 06:30:40] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
[2022-05-19 06:30:40] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2022-05-19 06:30:40] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2022-05-19 06:30:40] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2022-05-19 06:30:40] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2022-05-19 06:30:41] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2022-05-19 06:30:41] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2022-05-19 06:30:41] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2022-05-19 06:30:41] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2022-05-19 06:30:41] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2022-05-19 06:30:42] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 1 ms to minimize.
[2022-05-19 06:30:42] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 0 ms to minimize.
[2022-05-19 06:30:42] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 1 ms to minimize.
[2022-05-19 06:30:43] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 0 ms to minimize.
[2022-05-19 06:30:43] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 1 ms to minimize.
[2022-05-19 06:30:43] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 1 ms to minimize.
[2022-05-19 06:30:43] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 0 ms to minimize.
[2022-05-19 06:30:44] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 0 ms to minimize.
[2022-05-19 06:30:44] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 0 ms to minimize.
[2022-05-19 06:30:44] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 1 ms to minimize.
[2022-05-19 06:30:44] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 0 ms to minimize.
[2022-05-19 06:30:44] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 0 ms to minimize.
[2022-05-19 06:30:44] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 0 ms to minimize.
[2022-05-19 06:30:45] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 0 ms to minimize.
[2022-05-19 06:30:45] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 1 ms to minimize.
[2022-05-19 06:30:45] [INFO ] Trap strengthening procedure interrupted after too many repetitions 5507 ms
[2022-05-19 06:30:45] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 5508 ms
[2022-05-19 06:30:45] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 0 ms to minimize.
[2022-05-19 06:30:45] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 0 ms to minimize.
[2022-05-19 06:30:46] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 0 ms to minimize.
[2022-05-19 06:30:46] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2022-05-19 06:30:46] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 0 ms to minimize.
[2022-05-19 06:30:46] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 0 ms to minimize.
[2022-05-19 06:30:46] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2022-05-19 06:30:46] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 0 ms to minimize.
[2022-05-19 06:30:46] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2022-05-19 06:30:46] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2022-05-19 06:30:46] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 0 ms to minimize.
[2022-05-19 06:30:47] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2022-05-19 06:30:47] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 0 ms to minimize.
[2022-05-19 06:30:47] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2022-05-19 06:30:47] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2022-05-19 06:30:47] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2022-05-19 06:30:47] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2022-05-19 06:30:47] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2022-05-19 06:30:47] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2022-05-19 06:30:47] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2022-05-19 06:30:47] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2023 ms
[2022-05-19 06:30:49] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 1 ms to minimize.
[2022-05-19 06:30:49] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 1 ms to minimize.
[2022-05-19 06:30:49] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 0 ms to minimize.
[2022-05-19 06:30:49] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 1 ms to minimize.
[2022-05-19 06:30:49] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2022-05-19 06:30:50] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 0 ms to minimize.
[2022-05-19 06:30:50] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 0 ms to minimize.
[2022-05-19 06:30:50] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 0 ms to minimize.
[2022-05-19 06:30:50] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 0 ms to minimize.
[2022-05-19 06:30:50] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 0 ms to minimize.
[2022-05-19 06:30:50] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2022-05-19 06:30:50] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2022-05-19 06:30:50] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1787 ms
[2022-05-19 06:30:51] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2022-05-19 06:30:51] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2022-05-19 06:30:51] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2022-05-19 06:30:51] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 0 ms to minimize.
[2022-05-19 06:30:51] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2022-05-19 06:30:51] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
[2022-05-19 06:30:51] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 776 ms
[2022-05-19 06:30:53] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 0 ms to minimize.
[2022-05-19 06:30:54] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2022-05-19 06:30:54] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2022-05-19 06:30:55] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2022-05-19 06:30:55] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2022-05-19 06:30:55] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 0 ms to minimize.
[2022-05-19 06:30:55] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2022-05-19 06:30:55] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2022-05-19 06:30:55] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2022-05-19 06:30:55] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2022-05-19 06:30:55] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2738 ms
[2022-05-19 06:30:56] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 0 ms to minimize.
[2022-05-19 06:30:56] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2022-05-19 06:30:56] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2022-05-19 06:30:56] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2022-05-19 06:30:56] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2022-05-19 06:30:56] [INFO ] Trap strengthening (SAT) tested/added 5/5 trap constraints in 612 ms
[2022-05-19 06:30:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 06:30:56] [INFO ] After 25012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 837 ms.
Support contains 8 out of 1251 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1251/1251 places, 1201/1201 transitions.
Applied a total of 0 rules in 23 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1251/1251 places, 1201/1201 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1251/1251 places, 1201/1201 transitions.
Applied a total of 0 rules in 22 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
// Phase 1: matrix 1201 rows 1251 cols
[2022-05-19 06:30:57] [INFO ] Computed 451 place invariants in 8 ms
[2022-05-19 06:30:58] [INFO ] Implicit Places using invariants in 793 ms returned [1237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 794 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1250/1251 places, 1201/1201 transitions.
Applied a total of 0 rules in 23 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1250/1251 places, 1201/1201 transitions.
Knowledge obtained : [(AND (NOT p3) p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT p3)), (X (NOT (AND p3 (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND p3 (NOT p2) p0)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND p3 p1)))), (X (X (NOT (AND p3 (NOT p2) p1)))), (X (X (NOT (AND p3 p0)))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND p3 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) p3)), (F (AND (NOT p3) p1)), (F (AND p0 (NOT p2) (NOT p3))), (F (AND p3 p1)), (F (AND p0 (NOT p3) p1)), (F (AND p0 (NOT p3))), (F (NOT (AND (NOT p0) (NOT p3)))), (F (AND p0 p3)), (F (AND (NOT p0) (NOT p2) (NOT p3))), (F (AND (NOT p2) (NOT p3) p1))]
Knowledge based reduction with 16 factoid took 1063 ms. Reduced automaton from 8 states, 30 edges and 4 AP to 8 states, 30 edges and 4 AP.
Stuttering acceptance computed with spot in 330 ms :[(OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 366 ms :[(OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2))]
Support contains 8 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 15 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2022-05-19 06:31:00] [INFO ] Computed 451 place invariants in 4 ms
[2022-05-19 06:31:00] [INFO ] Implicit Places using invariants in 622 ms returned []
// Phase 1: matrix 1203 rows 1253 cols
[2022-05-19 06:31:00] [INFO ] Computed 451 place invariants in 2 ms
[2022-05-19 06:31:02] [INFO ] Implicit Places using invariants and state equation in 1430 ms returned []
Implicit Place search using SMT with State Equation took 2053 ms to find 0 implicit places.
// Phase 1: matrix 1203 rows 1253 cols
[2022-05-19 06:31:02] [INFO ] Computed 451 place invariants in 3 ms
[2022-05-19 06:31:02] [INFO ] Dead Transitions using invariants and state equation in 653 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1253/1253 places, 1203/1203 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 (NOT p0) (NOT p3) (NOT p1) p2), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 p3)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND p3 p1)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p3) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 337 ms. Reduced automaton from 8 states, 30 edges and 4 AP to 8 states, 30 edges and 4 AP.
Stuttering acceptance computed with spot in 321 ms :[(OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 286 ms. (steps per millisecond=34 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 1203 rows 1253 cols
[2022-05-19 06:31:04] [INFO ] Computed 451 place invariants in 3 ms
[2022-05-19 06:31:04] [INFO ] [Real]Absence check using 451 positive place invariants in 65 ms returned sat
[2022-05-19 06:31:06] [INFO ] After 1951ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-05-19 06:31:06] [INFO ] [Nat]Absence check using 451 positive place invariants in 69 ms returned sat
[2022-05-19 06:31:12] [INFO ] After 5546ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2022-05-19 06:31:13] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 0 ms to minimize.
[2022-05-19 06:31:13] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2022-05-19 06:31:13] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2022-05-19 06:31:13] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2022-05-19 06:31:13] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2022-05-19 06:31:13] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2022-05-19 06:31:13] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2022-05-19 06:31:13] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 754 ms
[2022-05-19 06:31:14] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2022-05-19 06:31:14] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 0 ms to minimize.
[2022-05-19 06:31:14] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2022-05-19 06:31:15] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 0 ms to minimize.
[2022-05-19 06:31:15] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 0 ms to minimize.
[2022-05-19 06:31:15] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2022-05-19 06:31:15] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2022-05-19 06:31:15] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2022-05-19 06:31:15] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2022-05-19 06:31:15] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2022-05-19 06:31:16] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2022-05-19 06:31:16] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2022-05-19 06:31:16] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1843 ms
[2022-05-19 06:31:16] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
[2022-05-19 06:31:17] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2022-05-19 06:31:17] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
[2022-05-19 06:31:17] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2022-05-19 06:31:17] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2022-05-19 06:31:18] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2022-05-19 06:31:18] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2022-05-19 06:31:18] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2022-05-19 06:31:18] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1831 ms
[2022-05-19 06:31:18] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2022-05-19 06:31:19] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 0 ms to minimize.
[2022-05-19 06:31:20] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2022-05-19 06:31:20] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2022-05-19 06:31:20] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2022-05-19 06:31:20] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2022-05-19 06:31:20] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1736 ms
[2022-05-19 06:31:21] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2022-05-19 06:31:21] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2022-05-19 06:31:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 251 ms
[2022-05-19 06:31:22] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2022-05-19 06:31:22] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 0 ms to minimize.
[2022-05-19 06:31:22] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 0 ms to minimize.
[2022-05-19 06:31:22] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 0 ms to minimize.
[2022-05-19 06:31:22] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2022-05-19 06:31:22] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2022-05-19 06:31:22] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2022-05-19 06:31:22] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2022-05-19 06:31:23] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2022-05-19 06:31:23] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2022-05-19 06:31:23] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2022-05-19 06:31:23] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2022-05-19 06:31:23] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1393 ms
[2022-05-19 06:31:23] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2022-05-19 06:31:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2022-05-19 06:31:23] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2022-05-19 06:31:23] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2022-05-19 06:31:24] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2022-05-19 06:31:24] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2022-05-19 06:31:24] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2022-05-19 06:31:24] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2022-05-19 06:31:24] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 673 ms
[2022-05-19 06:31:24] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2022-05-19 06:31:24] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2022-05-19 06:31:24] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2022-05-19 06:31:24] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2022-05-19 06:31:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 478 ms
[2022-05-19 06:31:25] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2022-05-19 06:31:25] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2022-05-19 06:31:25] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2022-05-19 06:31:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 385 ms
[2022-05-19 06:31:25] [INFO ] After 18502ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 4204 ms.
[2022-05-19 06:31:29] [INFO ] After 23385ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 1786 ms.
Support contains 8 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Partial Free-agglomeration rule applied 344 times.
Drop transitions removed 344 transitions
Iterating global reduction 0 with 344 rules applied. Total rules applied 348 place count 1251 transition count 1201
Applied a total of 348 rules in 73 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 1251/1253 places, 1201/1203 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 278 ms. (steps per millisecond=35 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1201 rows 1251 cols
[2022-05-19 06:31:32] [INFO ] Computed 451 place invariants in 6 ms
[2022-05-19 06:31:32] [INFO ] [Real]Absence check using 447 positive place invariants in 72 ms returned sat
[2022-05-19 06:31:32] [INFO ] [Real]Absence check using 447 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-19 06:31:34] [INFO ] After 1657ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-19 06:31:34] [INFO ] [Nat]Absence check using 447 positive place invariants in 69 ms returned sat
[2022-05-19 06:31:34] [INFO ] [Nat]Absence check using 447 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-19 06:31:40] [INFO ] After 6112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-19 06:31:40] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 06:31:42] [INFO ] After 1738ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-05-19 06:31:42] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 0 ms to minimize.
[2022-05-19 06:31:42] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2022-05-19 06:31:43] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 1 ms to minimize.
[2022-05-19 06:31:43] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
[2022-05-19 06:31:43] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 0 ms to minimize.
[2022-05-19 06:31:43] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 0 ms to minimize.
[2022-05-19 06:31:43] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 0 ms to minimize.
[2022-05-19 06:31:43] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2022-05-19 06:31:44] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2022-05-19 06:31:44] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 0 ms to minimize.
[2022-05-19 06:31:44] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 0 ms to minimize.
[2022-05-19 06:31:44] [INFO ] Deduced a trap composed of 9 places in 213 ms of which 0 ms to minimize.
[2022-05-19 06:31:45] [INFO ] Deduced a trap composed of 9 places in 201 ms of which 0 ms to minimize.
[2022-05-19 06:31:45] [INFO ] Deduced a trap composed of 9 places in 199 ms of which 1 ms to minimize.
[2022-05-19 06:31:45] [INFO ] Deduced a trap composed of 8 places in 203 ms of which 1 ms to minimize.
[2022-05-19 06:31:45] [INFO ] Deduced a trap composed of 9 places in 197 ms of which 1 ms to minimize.
[2022-05-19 06:31:46] [INFO ] Deduced a trap composed of 9 places in 179 ms of which 1 ms to minimize.
[2022-05-19 06:31:46] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 0 ms to minimize.
[2022-05-19 06:31:46] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 0 ms to minimize.
[2022-05-19 06:31:46] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 0 ms to minimize.
[2022-05-19 06:31:46] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 0 ms to minimize.
[2022-05-19 06:31:47] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 0 ms to minimize.
[2022-05-19 06:31:47] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 0 ms to minimize.
[2022-05-19 06:31:47] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 0 ms to minimize.
[2022-05-19 06:31:47] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 1 ms to minimize.
[2022-05-19 06:31:47] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 1 ms to minimize.
[2022-05-19 06:31:47] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 0 ms to minimize.
[2022-05-19 06:31:48] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2022-05-19 06:31:48] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 0 ms to minimize.
[2022-05-19 06:31:48] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2022-05-19 06:31:48] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 0 ms to minimize.
[2022-05-19 06:31:48] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 0 ms to minimize.
[2022-05-19 06:31:48] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2022-05-19 06:31:48] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2022-05-19 06:31:48] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2022-05-19 06:31:49] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2022-05-19 06:31:49] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2022-05-19 06:31:49] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2022-05-19 06:31:49] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2022-05-19 06:31:49] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 6766 ms
[2022-05-19 06:31:49] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2022-05-19 06:31:49] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2022-05-19 06:31:49] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 0 ms to minimize.
[2022-05-19 06:31:50] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2022-05-19 06:31:50] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2022-05-19 06:31:50] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2022-05-19 06:31:50] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2022-05-19 06:31:50] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2022-05-19 06:31:50] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2022-05-19 06:31:50] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1039 ms
[2022-05-19 06:31:50] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
[2022-05-19 06:31:50] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
[2022-05-19 06:31:51] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2022-05-19 06:31:51] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2022-05-19 06:31:51] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 0 ms to minimize.
[2022-05-19 06:31:51] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2022-05-19 06:31:51] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2022-05-19 06:31:51] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2022-05-19 06:31:51] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2022-05-19 06:31:51] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2022-05-19 06:31:51] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 985 ms
[2022-05-19 06:31:52] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 0 ms to minimize.
[2022-05-19 06:31:52] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 5 ms to minimize.
[2022-05-19 06:31:52] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2022-05-19 06:31:52] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2022-05-19 06:31:52] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 0 ms to minimize.
[2022-05-19 06:31:52] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2022-05-19 06:31:52] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2022-05-19 06:31:53] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2022-05-19 06:31:53] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2022-05-19 06:31:53] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2022-05-19 06:31:53] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2022-05-19 06:31:53] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1512 ms
[2022-05-19 06:31:55] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 0 ms to minimize.
[2022-05-19 06:31:56] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
[2022-05-19 06:31:56] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2022-05-19 06:31:56] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2022-05-19 06:31:56] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2022-05-19 06:31:56] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2022-05-19 06:31:56] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2022-05-19 06:31:56] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2022-05-19 06:31:56] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1912 ms
[2022-05-19 06:31:57] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2022-05-19 06:31:57] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2022-05-19 06:31:57] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2022-05-19 06:31:57] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 0 ms to minimize.
[2022-05-19 06:31:57] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2022-05-19 06:31:57] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2022-05-19 06:31:58] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 0 ms to minimize.
[2022-05-19 06:31:58] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 0 ms to minimize.
[2022-05-19 06:31:58] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2022-05-19 06:31:58] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2022-05-19 06:31:58] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1279 ms
[2022-05-19 06:31:59] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 0 ms to minimize.
[2022-05-19 06:31:59] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 133 ms
[2022-05-19 06:31:59] [INFO ] After 18343ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-19 06:31:59] [INFO ] After 25012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 1313 ms.
Support contains 8 out of 1251 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1251/1251 places, 1201/1201 transitions.
Applied a total of 0 rules in 22 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1251/1251 places, 1201/1201 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1201 rows 1251 cols
[2022-05-19 06:32:01] [INFO ] Computed 451 place invariants in 6 ms
[2022-05-19 06:32:01] [INFO ] [Real]Absence check using 447 positive place invariants in 71 ms returned sat
[2022-05-19 06:32:01] [INFO ] [Real]Absence check using 447 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-19 06:32:02] [INFO ] After 1504ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-19 06:32:03] [INFO ] [Nat]Absence check using 447 positive place invariants in 70 ms returned sat
[2022-05-19 06:32:03] [INFO ] [Nat]Absence check using 447 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-19 06:32:06] [INFO ] After 3175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-19 06:32:06] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 06:32:09] [INFO ] After 3251ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2022-05-19 06:32:10] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 0 ms to minimize.
[2022-05-19 06:32:10] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 1 ms to minimize.
[2022-05-19 06:32:10] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 1 ms to minimize.
[2022-05-19 06:32:11] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2022-05-19 06:32:11] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 0 ms to minimize.
[2022-05-19 06:32:11] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2022-05-19 06:32:11] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2022-05-19 06:32:11] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2022-05-19 06:32:11] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2022-05-19 06:32:11] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2022-05-19 06:32:11] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2022-05-19 06:32:12] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 0 ms to minimize.
[2022-05-19 06:32:12] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 0 ms to minimize.
[2022-05-19 06:32:12] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2022-05-19 06:32:12] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2022-05-19 06:32:12] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2022-05-19 06:32:12] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2022-05-19 06:32:12] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2022-05-19 06:32:13] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2022-05-19 06:32:13] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2022-05-19 06:32:13] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2022-05-19 06:32:13] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2022-05-19 06:32:13] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2022-05-19 06:32:13] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2022-05-19 06:32:13] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2022-05-19 06:32:13] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2022-05-19 06:32:13] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2022-05-19 06:32:13] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 3554 ms
[2022-05-19 06:32:14] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 1 ms to minimize.
[2022-05-19 06:32:14] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
[2022-05-19 06:32:14] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2022-05-19 06:32:15] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 0 ms to minimize.
[2022-05-19 06:32:15] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 0 ms to minimize.
[2022-05-19 06:32:15] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2022-05-19 06:32:15] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2022-05-19 06:32:15] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2022-05-19 06:32:15] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2022-05-19 06:32:15] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2022-05-19 06:32:15] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2022-05-19 06:32:15] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1438 ms
[2022-05-19 06:32:16] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2022-05-19 06:32:16] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2022-05-19 06:32:16] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2022-05-19 06:32:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 287 ms
[2022-05-19 06:32:17] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 1 ms to minimize.
[2022-05-19 06:32:17] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 1 ms to minimize.
[2022-05-19 06:32:17] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 0 ms to minimize.
[2022-05-19 06:32:17] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2022-05-19 06:32:17] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 0 ms to minimize.
[2022-05-19 06:32:17] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 0 ms to minimize.
[2022-05-19 06:32:18] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2022-05-19 06:32:18] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 0 ms to minimize.
[2022-05-19 06:32:18] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2022-05-19 06:32:18] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2022-05-19 06:32:18] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2022-05-19 06:32:18] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
[2022-05-19 06:32:18] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2022-05-19 06:32:18] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2022-05-19 06:32:18] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2005 ms
[2022-05-19 06:32:19] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 0 ms to minimize.
[2022-05-19 06:32:19] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2022-05-19 06:32:19] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2022-05-19 06:32:19] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2022-05-19 06:32:19] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2022-05-19 06:32:20] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 0 ms to minimize.
[2022-05-19 06:32:20] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 0 ms to minimize.
[2022-05-19 06:32:20] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2022-05-19 06:32:20] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 0 ms to minimize.
[2022-05-19 06:32:21] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2022-05-19 06:32:21] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2022-05-19 06:32:21] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2022-05-19 06:32:21] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 0 ms to minimize.
[2022-05-19 06:32:21] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 0 ms to minimize.
[2022-05-19 06:32:21] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2022-05-19 06:32:21] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2022-05-19 06:32:21] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2838 ms
[2022-05-19 06:32:22] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2022-05-19 06:32:22] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2022-05-19 06:32:22] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2022-05-19 06:32:22] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2022-05-19 06:32:22] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2022-05-19 06:32:22] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2022-05-19 06:32:22] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 713 ms
[2022-05-19 06:32:23] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2022-05-19 06:32:23] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2022-05-19 06:32:23] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 0 ms to minimize.
[2022-05-19 06:32:23] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2022-05-19 06:32:24] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 0 ms to minimize.
[2022-05-19 06:32:24] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 0 ms to minimize.
[2022-05-19 06:32:24] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 0 ms to minimize.
[2022-05-19 06:32:24] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 0 ms to minimize.
[2022-05-19 06:32:24] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 0 ms to minimize.
[2022-05-19 06:32:24] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 0 ms to minimize.
[2022-05-19 06:32:24] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2022-05-19 06:32:25] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2022-05-19 06:32:25] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2022-05-19 06:32:25] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 0 ms to minimize.
[2022-05-19 06:32:25] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2022-05-19 06:32:25] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
[2022-05-19 06:32:25] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2022-05-19 06:32:25] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2022-05-19 06:32:25] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2022-05-19 06:32:25] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2022-05-19 06:32:25] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2022-05-19 06:32:26] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2022-05-19 06:32:26] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2022-05-19 06:32:27] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2022-05-19 06:32:27] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2022-05-19 06:32:27] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2022-05-19 06:32:27] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2022-05-19 06:32:27] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 4111 ms
[2022-05-19 06:32:27] [INFO ] After 21041ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 291 ms.
[2022-05-19 06:32:27] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 886 ms.
Support contains 8 out of 1251 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1251/1251 places, 1201/1201 transitions.
Applied a total of 0 rules in 22 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1251/1251 places, 1201/1201 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1201 rows 1251 cols
[2022-05-19 06:32:29] [INFO ] Computed 451 place invariants in 6 ms
[2022-05-19 06:32:29] [INFO ] [Real]Absence check using 447 positive place invariants in 70 ms returned sat
[2022-05-19 06:32:29] [INFO ] [Real]Absence check using 447 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-19 06:32:30] [INFO ] After 1378ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-19 06:32:30] [INFO ] [Nat]Absence check using 447 positive place invariants in 70 ms returned sat
[2022-05-19 06:32:30] [INFO ] [Nat]Absence check using 447 positive and 4 generalized place invariants in 0 ms returned sat
[2022-05-19 06:32:35] [INFO ] After 3960ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-19 06:32:35] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 06:32:39] [INFO ] After 4438ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-19 06:32:40] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 0 ms to minimize.
[2022-05-19 06:32:40] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 0 ms to minimize.
[2022-05-19 06:32:40] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 0 ms to minimize.
[2022-05-19 06:32:40] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 0 ms to minimize.
[2022-05-19 06:32:40] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 0 ms to minimize.
[2022-05-19 06:32:40] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 0 ms to minimize.
[2022-05-19 06:32:41] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 1 ms to minimize.
[2022-05-19 06:32:41] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 0 ms to minimize.
[2022-05-19 06:32:41] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 1 ms to minimize.
[2022-05-19 06:32:41] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 0 ms to minimize.
[2022-05-19 06:32:41] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 1 ms to minimize.
[2022-05-19 06:32:41] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 0 ms to minimize.
[2022-05-19 06:32:42] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 0 ms to minimize.
[2022-05-19 06:32:42] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2022-05-19 06:32:42] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 0 ms to minimize.
[2022-05-19 06:32:42] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2022-05-19 06:32:42] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2022-05-19 06:32:42] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2022-05-19 06:32:42] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 0 ms to minimize.
[2022-05-19 06:32:42] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2022-05-19 06:32:42] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2022-05-19 06:32:43] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 0 ms to minimize.
[2022-05-19 06:32:43] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 1 ms to minimize.
[2022-05-19 06:32:43] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 0 ms to minimize.
[2022-05-19 06:32:43] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
[2022-05-19 06:32:43] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 0 ms to minimize.
[2022-05-19 06:32:44] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 0 ms to minimize.
[2022-05-19 06:32:44] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2022-05-19 06:32:44] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2022-05-19 06:32:44] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 0 ms to minimize.
[2022-05-19 06:32:44] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 0 ms to minimize.
[2022-05-19 06:32:44] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2022-05-19 06:32:44] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2022-05-19 06:32:44] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 5039 ms
[2022-05-19 06:32:45] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2022-05-19 06:32:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2022-05-19 06:32:45] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2022-05-19 06:32:45] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2022-05-19 06:32:45] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2022-05-19 06:32:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 334 ms
[2022-05-19 06:32:46] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 0 ms to minimize.
[2022-05-19 06:32:46] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2022-05-19 06:32:47] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 0 ms to minimize.
[2022-05-19 06:32:47] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2022-05-19 06:32:47] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2022-05-19 06:32:47] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2022-05-19 06:32:47] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2022-05-19 06:32:48] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 0 ms to minimize.
[2022-05-19 06:32:48] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2022-05-19 06:32:48] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2022-05-19 06:32:48] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 0 ms to minimize.
[2022-05-19 06:32:48] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2022-05-19 06:32:48] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2022-05-19 06:32:48] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2022-05-19 06:32:48] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2022-05-19 06:32:48] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2022-05-19 06:32:49] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2022-05-19 06:32:49] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2022-05-19 06:32:49] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2493 ms
[2022-05-19 06:32:50] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 1 ms to minimize.
[2022-05-19 06:32:50] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 0 ms to minimize.
[2022-05-19 06:32:51] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 0 ms to minimize.
[2022-05-19 06:32:51] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 0 ms to minimize.
[2022-05-19 06:32:51] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 0 ms to minimize.
[2022-05-19 06:32:51] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 1 ms to minimize.
[2022-05-19 06:32:51] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 1 ms to minimize.
[2022-05-19 06:32:51] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2022-05-19 06:32:52] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 0 ms to minimize.
[2022-05-19 06:32:52] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 1 ms to minimize.
[2022-05-19 06:32:52] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2022-05-19 06:32:52] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 0 ms to minimize.
[2022-05-19 06:32:52] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 0 ms to minimize.
[2022-05-19 06:32:52] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 0 ms to minimize.
[2022-05-19 06:32:52] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
[2022-05-19 06:32:53] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2933 ms
[2022-05-19 06:32:53] [INFO ] After 18044ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2555 ms.
[2022-05-19 06:32:55] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 769 ms.
Support contains 8 out of 1251 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1251/1251 places, 1201/1201 transitions.
Applied a total of 0 rules in 22 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1251/1251 places, 1201/1201 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p1) p2), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 p3)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND p3 p1)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p3) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p3)), (F (AND p1 (NOT p3))), (F (AND p0 (NOT p2) (NOT p3))), (F (AND p1 p3)), (F (AND p0 p1 (NOT p3))), (F (AND p0 (NOT p3))), (F (NOT (AND (NOT p0) (NOT p3)))), (F (AND (NOT p0) (NOT p2) (NOT p3))), (F (AND (NOT p0) (NOT p2) p3)), (F (AND (NOT p2) p1 (NOT p3)))]
Knowledge based reduction with 7 factoid took 570 ms. Reduced automaton from 8 states, 30 edges and 4 AP to 8 states, 30 edges and 4 AP.
Stuttering acceptance computed with spot in 359 ms :[(OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 334 ms :[(OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 357 ms :[(OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 111 reset in 860 ms.
Product exploration explored 100000 steps with 104 reset in 1023 ms.
Built C files in :
/tmp/ltsmin16487528116209948246
[2022-05-19 06:33:00] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16487528116209948246
Running compilation step : cd /tmp/ltsmin16487528116209948246;'/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'
Compilation finished in 2280 ms.
Running link step : cd /tmp/ltsmin16487528116209948246;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin16487528116209948246;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2637134060293532669.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 23 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2022-05-19 06:33:15] [INFO ] Computed 451 place invariants in 5 ms
[2022-05-19 06:33:15] [INFO ] Implicit Places using invariants in 621 ms returned []
// Phase 1: matrix 1203 rows 1253 cols
[2022-05-19 06:33:15] [INFO ] Computed 451 place invariants in 2 ms
[2022-05-19 06:33:17] [INFO ] Implicit Places using invariants and state equation in 1376 ms returned []
Implicit Place search using SMT with State Equation took 1998 ms to find 0 implicit places.
// Phase 1: matrix 1203 rows 1253 cols
[2022-05-19 06:33:17] [INFO ] Computed 451 place invariants in 7 ms
[2022-05-19 06:33:17] [INFO ] Dead Transitions using invariants and state equation in 649 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1253/1253 places, 1203/1203 transitions.
Built C files in :
/tmp/ltsmin18290025492087832692
[2022-05-19 06:33:17] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18290025492087832692
Running compilation step : cd /tmp/ltsmin18290025492087832692;'/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'
Compilation finished in 2212 ms.
Running link step : cd /tmp/ltsmin18290025492087832692;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin18290025492087832692;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3089724910076244856.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 06:33:33] [INFO ] Flatten gal took : 55 ms
[2022-05-19 06:33:33] [INFO ] Flatten gal took : 54 ms
[2022-05-19 06:33:33] [INFO ] Time to serialize gal into /tmp/LTL6390219557404685705.gal : 4 ms
[2022-05-19 06:33:33] [INFO ] Time to serialize properties into /tmp/LTL6687973708185461594.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/LTL6390219557404685705.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6687973708185461594.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/LTL6390219...266
Read 1 LTL properties
Checking formula 0 : !((F((X(X(!((F("(((p386==1)&&(p392==1))&&(p402==1))"))U(G("((p1114==1)&&(p1135==1))"))))))||((X("((p581==0)||(p591==0))"))&&("(p991==1...162
Formula 0 simplified : !F(XX!(F"(((p386==1)&&(p392==1))&&(p402==1))" U G"((p1114==1)&&(p1135==1))") | ("(p991==1)" & X"((p581==0)||(p591==0))"))
Detected timeout of ITS tools.
[2022-05-19 06:33:48] [INFO ] Flatten gal took : 54 ms
[2022-05-19 06:33:48] [INFO ] Applying decomposition
[2022-05-19 06:33:48] [INFO ] Flatten gal took : 54 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/graph15245863730134553179.txt' '-o' '/tmp/graph15245863730134553179.bin' '-w' '/tmp/graph15245863730134553179.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15245863730134553179.bin' '-l' '-1' '-v' '-w' '/tmp/graph15245863730134553179.weights' '-q' '0' '-e' '0.001'
[2022-05-19 06:33:48] [INFO ] Decomposing Gal with order
[2022-05-19 06:33:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 06:33:48] [INFO ] Removed a total of 800 redundant transitions.
[2022-05-19 06:33:48] [INFO ] Flatten gal took : 88 ms
[2022-05-19 06:33:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 740 labels/synchronizations in 55 ms.
[2022-05-19 06:33:48] [INFO ] Time to serialize gal into /tmp/LTL15910515505100529920.gal : 8 ms
[2022-05-19 06:33:48] [INFO ] Time to serialize properties into /tmp/LTL6649493808258082468.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/LTL15910515505100529920.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6649493808258082468.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/LTL1591051...246
Read 1 LTL properties
Checking formula 0 : !((F((X(X(!((F("(((i8.i1.i0.u139.p386==1)&&(i8.i1.i0.u141.p392==1))&&(i8.i1.i0.u144.p402==1))"))U(G("((i25.i0.i0.u402.p1114==1)&&(i25....279
Formula 0 simplified : !F(XX!(F"(((i8.i1.i0.u139.p386==1)&&(i8.i1.i0.u141.p392==1))&&(i8.i1.i0.u144.p402==1))" U G"((i25.i0.i0.u402.p1114==1)&&(i25.i1.i0.u...261
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5118093783277648213
[2022-05-19 06:34:03] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5118093783277648213
Running compilation step : cd /tmp/ltsmin5118093783277648213;'/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'
Compilation finished in 2216 ms.
Running link step : cd /tmp/ltsmin5118093783277648213;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin5118093783277648213;'/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(X(!(<>((LTLAPp0==true)) U []((LTLAPp1==true)))))||(X((LTLAPp2==true))&&(LTLAPp3==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-050A-LTLFireability-05 finished in 323817 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(G(p0)||p1) U p2))'
Support contains 8 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 53 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
// Phase 1: matrix 1201 rows 1251 cols
[2022-05-19 06:34:18] [INFO ] Computed 451 place invariants in 6 ms
[2022-05-19 06:34:19] [INFO ] Implicit Places using invariants in 629 ms returned [1237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 630 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1253 places, 1201/1203 transitions.
Applied a total of 0 rules in 23 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1250/1253 places, 1201/1203 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p2), true, p0]
Running random walk in product with property : ShieldIIPs-PT-050A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(OR (AND (EQ s886 1) (EQ s890 1) (EQ s902 1)) (AND (EQ s639 1) (EQ s660 1) (EQ s1182 1) (EQ s1184 1))), p1:(AND (EQ s886 1) (EQ s890 1) (EQ s902 1)), p...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 101 reset in 844 ms.
Product exploration explored 100000 steps with 101 reset in 1028 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 (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT p0)), (X (X (AND (NOT p2) (NOT p1)))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 350 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 88 ms :[(NOT p2), true, p0]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1201 rows 1250 cols
[2022-05-19 06:34:22] [INFO ] Computed 450 place invariants in 6 ms
[2022-05-19 06:34:22] [INFO ] After 173ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT p0)), (X (X (AND (NOT p2) (NOT p1)))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT p0))), (G (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p1) (NOT p2) p0))]
Knowledge based reduction with 11 factoid took 673 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 66 ms :[(NOT p2), p0]
Stuttering acceptance computed with spot in 69 ms :[(NOT p2), p0]
// Phase 1: matrix 1201 rows 1250 cols
[2022-05-19 06:34:23] [INFO ] Computed 450 place invariants in 3 ms
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT p0)), (X (X (AND (NOT p2) (NOT p1)))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT p0))), (G (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p1) (NOT p2) p0)), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 11 factoid took 225 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 1 states, 1 edges and 0 AP.
FORMULA ShieldIIPs-PT-050A-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-050A-LTLFireability-07 finished in 5475 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((((G(p3)&&p2)||p4)&&p1))&&p0)))'
Support contains 7 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 16 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2022-05-19 06:34:24] [INFO ] Computed 451 place invariants in 5 ms
[2022-05-19 06:34:24] [INFO ] Implicit Places using invariants in 636 ms returned []
// Phase 1: matrix 1203 rows 1253 cols
[2022-05-19 06:34:24] [INFO ] Computed 451 place invariants in 2 ms
[2022-05-19 06:34:26] [INFO ] Implicit Places using invariants and state equation in 1482 ms returned []
Implicit Place search using SMT with State Equation took 2119 ms to find 0 implicit places.
// Phase 1: matrix 1203 rows 1253 cols
[2022-05-19 06:34:26] [INFO ] Computed 451 place invariants in 2 ms
[2022-05-19 06:34:27] [INFO ] Dead Transitions using invariants and state equation in 667 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1253/1253 places, 1203/1203 transitions.
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p4)) (AND (NOT p3) (NOT p4))), (OR (NOT p1) (AND (NOT p2) (NOT p4)) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p3) (NOT p4)))]
Running random walk in product with property : ShieldIIPs-PT-050A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p4) (NOT p2)) (AND (NOT p0) (NOT p4) (NOT p3))), acceptance={0} source=1 dest: 0}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p4) (NOT p2)) (AND p0 (NOT p4) (NOT p3))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p4) p2 p3), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1 (NOT p4) p2 p3), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p3), acceptance={} source=2 dest: 2}, { cond=(AND p0 p3), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p4) (NOT p3))), acceptance={0} source=3 dest: 0}, { cond=(OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p4) (NOT p3))), acceptance={0} source=3 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p4) p3)), acceptance={} source=3 dest: 2}, { cond=(OR (AND p0 (NOT p1) p3) (AND p0 (NOT p4) p3)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s537 1) (EQ s570 1)), p1:(AND (EQ s1205 1) (EQ s1218 1)), p4:(AND (EQ s688 1) (EQ s696 1) (EQ s700 1)), p2:(AND (EQ s1205 1) (EQ s1218 1)), p3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2561 steps with 0 reset in 23 ms.
FORMULA ShieldIIPs-PT-050A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050A-LTLFireability-08 finished in 3110 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&X(p1)))'
Support contains 5 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 21 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2022-05-19 06:34:27] [INFO ] Computed 451 place invariants in 6 ms
[2022-05-19 06:34:27] [INFO ] Implicit Places using invariants in 634 ms returned []
// Phase 1: matrix 1203 rows 1253 cols
[2022-05-19 06:34:27] [INFO ] Computed 451 place invariants in 8 ms
[2022-05-19 06:34:29] [INFO ] Implicit Places using invariants and state equation in 1441 ms returned []
Implicit Place search using SMT with State Equation took 2075 ms to find 0 implicit places.
// Phase 1: matrix 1203 rows 1253 cols
[2022-05-19 06:34:29] [INFO ] Computed 451 place invariants in 7 ms
[2022-05-19 06:34:30] [INFO ] Dead Transitions using invariants and state equation in 657 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1253/1253 places, 1203/1203 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-050A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(OR (EQ s213 0) (EQ s223 0) (EQ s225 0)), p1:(AND (EQ s1062 1) (EQ s1095 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-050A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050A-LTLFireability-09 finished in 2871 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U p1))||(G(p2)&&F(p3))))'
Support contains 5 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 23 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2022-05-19 06:34:30] [INFO ] Computed 451 place invariants in 5 ms
[2022-05-19 06:34:30] [INFO ] Implicit Places using invariants in 620 ms returned []
// Phase 1: matrix 1203 rows 1253 cols
[2022-05-19 06:34:30] [INFO ] Computed 451 place invariants in 2 ms
[2022-05-19 06:34:32] [INFO ] Implicit Places using invariants and state equation in 1447 ms returned []
Implicit Place search using SMT with State Equation took 2067 ms to find 0 implicit places.
// Phase 1: matrix 1203 rows 1253 cols
[2022-05-19 06:34:32] [INFO ] Computed 451 place invariants in 2 ms
[2022-05-19 06:34:32] [INFO ] Dead Transitions using invariants and state equation in 652 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1253/1253 places, 1203/1203 transitions.
Stuttering acceptance computed with spot in 233 ms :[true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-050A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p2 (NOT p3) (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p3 (NOT p1) p0), acceptance={0} source=1 dest: 2}, { cond=(AND p2 p3 (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 3}, { cond=(AND p2 (NOT p3) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 5}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 6}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND p2 p3), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 0}, { cond=(AND p2 p3), acceptance={0} source=5 dest: 3}, { cond=(AND p2 (NOT p3)), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 6}]], initial=4, aps=[p2:(EQ s266 0), p1:(EQ s266 1), p0:(AND (EQ s1204 1) (EQ s1219 1)), p3:(OR (EQ s582 0) (EQ s584 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2124 steps with 0 reset in 25 ms.
FORMULA ShieldIIPs-PT-050A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050A-LTLFireability-11 finished in 3027 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F((X(p1)||p0))))'
Support contains 7 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 22 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2022-05-19 06:34:33] [INFO ] Computed 451 place invariants in 6 ms
[2022-05-19 06:34:33] [INFO ] Implicit Places using invariants in 613 ms returned []
// Phase 1: matrix 1203 rows 1253 cols
[2022-05-19 06:34:33] [INFO ] Computed 451 place invariants in 2 ms
[2022-05-19 06:34:35] [INFO ] Implicit Places using invariants and state equation in 1478 ms returned []
Implicit Place search using SMT with State Equation took 2092 ms to find 0 implicit places.
// Phase 1: matrix 1203 rows 1253 cols
[2022-05-19 06:34:35] [INFO ] Computed 451 place invariants in 6 ms
[2022-05-19 06:34:35] [INFO ] Dead Transitions using invariants and state equation in 657 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1253/1253 places, 1203/1203 transitions.
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-050A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s57 1) (EQ s59 1)) (AND (EQ s513 1) (EQ s523 1) (EQ s527 1))), p1:(OR (AND (EQ s513 1) (EQ s523 1) (EQ s527 1)) (AND (EQ s808 1) (EQ s822 ...], 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 105 reset in 832 ms.
Product exploration explored 100000 steps with 105 reset in 1014 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 (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 492 ms. Reduced automaton from 2 states, 2 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 24 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 972 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=108 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 23 ms :[(AND (NOT p0) (NOT p1))]
// Phase 1: matrix 1203 rows 1253 cols
[2022-05-19 06:34:38] [INFO ] Computed 451 place invariants in 6 ms
[2022-05-19 06:34:39] [INFO ] [Real]Absence check using 451 positive place invariants in 352 ms returned sat
[2022-05-19 06:34:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 06:34:43] [INFO ] [Real]Absence check using state equation in 3172 ms returned sat
[2022-05-19 06:34:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 06:34:44] [INFO ] [Nat]Absence check using 451 positive place invariants in 271 ms returned sat
[2022-05-19 06:34:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 06:34:47] [INFO ] [Nat]Absence check using state equation in 2934 ms returned sat
[2022-05-19 06:34:47] [INFO ] Computed and/alt/rep : 1104/3823/1104 causal constraints (skipped 98 transitions) in 67 ms.
[2022-05-19 06:34:58] [INFO ] Added : 525 causal constraints over 105 iterations in 10538 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 7 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 53 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
// Phase 1: matrix 1201 rows 1251 cols
[2022-05-19 06:34:58] [INFO ] Computed 451 place invariants in 5 ms
[2022-05-19 06:34:58] [INFO ] Implicit Places using invariants in 608 ms returned [1237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 609 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1253 places, 1201/1203 transitions.
Applied a total of 0 rules in 23 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1250/1253 places, 1201/1203 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 (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 775 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=110 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 191 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
// Phase 1: matrix 1201 rows 1250 cols
[2022-05-19 06:34:59] [INFO ] Computed 450 place invariants in 6 ms
[2022-05-19 06:35:00] [INFO ] [Real]Absence check using 450 positive place invariants in 351 ms returned sat
[2022-05-19 06:35:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 06:35:04] [INFO ] [Real]Absence check using state equation in 3961 ms returned sat
[2022-05-19 06:35:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 06:35:05] [INFO ] [Nat]Absence check using 450 positive place invariants in 248 ms returned sat
[2022-05-19 06:35:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 06:35:08] [INFO ] [Nat]Absence check using state equation in 3141 ms returned sat
[2022-05-19 06:35:08] [INFO ] Computed and/alt/rep : 1102/3821/1102 causal constraints (skipped 98 transitions) in 75 ms.
[2022-05-19 06:35:19] [INFO ] Added : 530 causal constraints over 106 iterations in 10702 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 105 reset in 811 ms.
Product exploration explored 100000 steps with 107 reset in 992 ms.
Built C files in :
/tmp/ltsmin10528955822876090737
[2022-05-19 06:35:21] [INFO ] Computing symmetric may disable matrix : 1201 transitions.
[2022-05-19 06:35:21] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 06:35:21] [INFO ] Computing symmetric may enable matrix : 1201 transitions.
[2022-05-19 06:35:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 06:35:21] [INFO ] Computing Do-Not-Accords matrix : 1201 transitions.
[2022-05-19 06:35:21] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 06:35:21] [INFO ] Built C files in 128ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10528955822876090737
Running compilation step : cd /tmp/ltsmin10528955822876090737;'/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/ltsmin10528955822876090737;'/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/ltsmin10528955822876090737;'/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 7 out of 1250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 29 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
// Phase 1: matrix 1201 rows 1250 cols
[2022-05-19 06:35:24] [INFO ] Computed 450 place invariants in 7 ms
[2022-05-19 06:35:25] [INFO ] Implicit Places using invariants in 612 ms returned []
// Phase 1: matrix 1201 rows 1250 cols
[2022-05-19 06:35:25] [INFO ] Computed 450 place invariants in 4 ms
[2022-05-19 06:35:26] [INFO ] Implicit Places using invariants and state equation in 1417 ms returned []
Implicit Place search using SMT with State Equation took 2029 ms to find 0 implicit places.
[2022-05-19 06:35:26] [INFO ] Redundant transitions in 111 ms returned [1195]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1200 rows 1250 cols
[2022-05-19 06:35:26] [INFO ] Computed 450 place invariants in 8 ms
[2022-05-19 06:35:27] [INFO ] Dead Transitions using invariants and state equation in 657 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1250 places, 1200/1201 transitions.
Applied a total of 0 rules in 23 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1250/1250 places, 1200/1201 transitions.
Built C files in :
/tmp/ltsmin12505700949512187862
[2022-05-19 06:35:28] [INFO ] Computing symmetric may disable matrix : 1200 transitions.
[2022-05-19 06:35:28] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 06:35:28] [INFO ] Computing symmetric may enable matrix : 1200 transitions.
[2022-05-19 06:35:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 06:35:28] [INFO ] Computing Do-Not-Accords matrix : 1200 transitions.
[2022-05-19 06:35:28] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 06:35:28] [INFO ] Built C files in 133ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12505700949512187862
Running compilation step : cd /tmp/ltsmin12505700949512187862;'/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/ltsmin12505700949512187862;'/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/ltsmin12505700949512187862;'/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-19 06:35:31] [INFO ] Flatten gal took : 56 ms
[2022-05-19 06:35:31] [INFO ] Flatten gal took : 57 ms
[2022-05-19 06:35:31] [INFO ] Time to serialize gal into /tmp/LTL5553947914386515051.gal : 4 ms
[2022-05-19 06:35:31] [INFO ] Time to serialize properties into /tmp/LTL10063171532658390270.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/LTL5553947914386515051.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10063171532658390270.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/LTL5553947...267
Read 1 LTL properties
Checking formula 0 : !((F(F(((X("((((p513==1)&&(p523==1))&&(p527==1))||((p808==1)&&(p822==1)))"))||("((p57==1)&&(p59==1))"))||("(((p513==1)&&(p523==1))&&(p...169
Formula 0 simplified : !F("(((p513==1)&&(p523==1))&&(p527==1))" | "((p57==1)&&(p59==1))" | X"((((p513==1)&&(p523==1))&&(p527==1))||((p808==1)&&(p822==1)))"...156
Detected timeout of ITS tools.
[2022-05-19 06:35:46] [INFO ] Flatten gal took : 52 ms
[2022-05-19 06:35:46] [INFO ] Applying decomposition
[2022-05-19 06:35:46] [INFO ] Flatten gal took : 53 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/graph8428346240770291186.txt' '-o' '/tmp/graph8428346240770291186.bin' '-w' '/tmp/graph8428346240770291186.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8428346240770291186.bin' '-l' '-1' '-v' '-w' '/tmp/graph8428346240770291186.weights' '-q' '0' '-e' '0.001'
[2022-05-19 06:35:46] [INFO ] Decomposing Gal with order
[2022-05-19 06:35:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 06:35:47] [INFO ] Removed a total of 797 redundant transitions.
[2022-05-19 06:35:47] [INFO ] Flatten gal took : 87 ms
[2022-05-19 06:35:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 33 ms.
[2022-05-19 06:35:47] [INFO ] Time to serialize gal into /tmp/LTL14141311180951672130.gal : 9 ms
[2022-05-19 06:35:47] [INFO ] Time to serialize properties into /tmp/LTL3779431933088863718.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/LTL14141311180951672130.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3779431933088863718.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/LTL1414131...246
Read 1 LTL properties
Checking formula 0 : !((F(F(((X("((((i11.u185.p513==1)&&(i11.u188.p523==1))&&(i11.u189.p527==1))||((i17.u291.p808==1)&&(i17.u296.p822==1)))"))||("((i1.i1.u...261
Formula 0 simplified : !F("(((i11.u185.p513==1)&&(i11.u188.p523==1))&&(i11.u189.p527==1))" | "((i1.i1.u20.p57==1)&&(i1.i1.u21.p59==1))" | X"((((i11.u185.p5...248
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16975821657242077987
[2022-05-19 06:36:02] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16975821657242077987
Running compilation step : cd /tmp/ltsmin16975821657242077987;'/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'
Compilation finished in 2203 ms.
Running link step : cd /tmp/ltsmin16975821657242077987;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin16975821657242077987;'/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((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-050A-LTLFireability-12 finished in 104058 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(p0)||(!p1 U X(p2))))))'
Support contains 6 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 19 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2022-05-19 06:36:17] [INFO ] Computed 451 place invariants in 9 ms
[2022-05-19 06:36:17] [INFO ] Implicit Places using invariants in 625 ms returned []
// Phase 1: matrix 1203 rows 1253 cols
[2022-05-19 06:36:17] [INFO ] Computed 451 place invariants in 6 ms
[2022-05-19 06:36:19] [INFO ] Implicit Places using invariants and state equation in 1441 ms returned []
Implicit Place search using SMT with State Equation took 2066 ms to find 0 implicit places.
// Phase 1: matrix 1203 rows 1253 cols
[2022-05-19 06:36:19] [INFO ] Computed 451 place invariants in 6 ms
[2022-05-19 06:36:20] [INFO ] Dead Transitions using invariants and state equation in 658 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1253/1253 places, 1203/1203 transitions.
Stuttering acceptance computed with spot in 1229 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true]
Running random walk in product with property : ShieldIIPs-PT-050A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={} source=4 dest: 6}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s1138 1) (EQ s1148 1) (EQ s1152 1)), p0:(OR (EQ s1138 0) (EQ s1148 0) (EQ s1152 0)), p2:(AND (EQ s1238 1) (EQ s1246 1) (EQ s1252 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][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24988 reset in 2226 ms.
Product exploration explored 100000 steps with 25018 reset in 2352 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 (NOT p1) p0 (NOT p2)), (X (NOT p1)), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 344 ms. Reduced automaton from 7 states, 11 edges and 3 AP to 7 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 557 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1203 rows 1253 cols
[2022-05-19 06:36:26] [INFO ] Computed 451 place invariants in 5 ms
[2022-05-19 06:36:27] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p1)), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F p2), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2))), (F p1), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 8 factoid took 410 ms. Reduced automaton from 7 states, 11 edges and 3 AP to 6 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 173 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 186 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 6 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 20 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2022-05-19 06:36:27] [INFO ] Computed 451 place invariants in 3 ms
[2022-05-19 06:36:28] [INFO ] Implicit Places using invariants in 601 ms returned []
// Phase 1: matrix 1203 rows 1253 cols
[2022-05-19 06:36:28] [INFO ] Computed 451 place invariants in 6 ms
[2022-05-19 06:36:29] [INFO ] Implicit Places using invariants and state equation in 1439 ms returned []
Implicit Place search using SMT with State Equation took 2041 ms to find 0 implicit places.
// Phase 1: matrix 1203 rows 1253 cols
[2022-05-19 06:36:29] [INFO ] Computed 451 place invariants in 2 ms
[2022-05-19 06:36:30] [INFO ] Dead Transitions using invariants and state equation in 681 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1253/1253 places, 1203/1203 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 p0 (NOT p2) (NOT p1)), (X (NOT p1)), (X (X (NOT (OR (AND p0 p1) (AND p1 p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (OR (AND p0 (NOT p1)) (AND (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 183 ms. Reduced automaton from 6 states, 13 edges and 3 AP to 6 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 2555 steps, including 1 resets, run visited all 6 properties in 28 ms. (steps per millisecond=91 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p1)), (X (X (NOT (OR (AND p0 p1) (AND p1 p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (OR (AND p0 (NOT p1)) (AND (NOT p1) p2))))]
False Knowledge obtained : [(F (OR (AND p0 p1) (AND p1 p2))), (F (AND (NOT p0) (NOT p2))), (F (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))), (F p2), (F (AND (NOT p1) p2)), (F (AND p1 p2))]
Knowledge based reduction with 5 factoid took 388 ms. Reduced automaton from 6 states, 12 edges and 3 AP to 6 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 204 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Entered a terminal (fully accepting) state of product in 53 steps with 0 reset in 2 ms.
FORMULA ShieldIIPs-PT-050A-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050A-LTLFireability-13 finished in 14771 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||X(F(p1))))'
Support contains 6 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 19 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2022-05-19 06:36:32] [INFO ] Computed 451 place invariants in 2 ms
[2022-05-19 06:36:32] [INFO ] Implicit Places using invariants in 624 ms returned []
// Phase 1: matrix 1203 rows 1253 cols
[2022-05-19 06:36:32] [INFO ] Computed 451 place invariants in 3 ms
[2022-05-19 06:36:34] [INFO ] Implicit Places using invariants and state equation in 1456 ms returned []
Implicit Place search using SMT with State Equation took 2080 ms to find 0 implicit places.
// Phase 1: matrix 1203 rows 1253 cols
[2022-05-19 06:36:34] [INFO ] Computed 451 place invariants in 2 ms
[2022-05-19 06:36:34] [INFO ] Dead Transitions using invariants and state equation in 645 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1253/1253 places, 1203/1203 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-050A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(AND (OR (EQ s1088 0) (EQ s1098 0) (EQ s1100 0) (AND (EQ s679 1) (EQ s694 1))) (EQ s621 1)), p0:(AND (EQ s1088 1) (EQ s1098 1) (EQ s1100 1) (EQ s679 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 5057 steps with 2 reset in 50 ms.
FORMULA ShieldIIPs-PT-050A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050A-LTLFireability-14 finished in 2908 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(G(p0))||p1))))'
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 50 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
// Phase 1: matrix 1201 rows 1251 cols
[2022-05-19 06:36:35] [INFO ] Computed 451 place invariants in 6 ms
[2022-05-19 06:36:35] [INFO ] Implicit Places using invariants in 624 ms returned [1237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 625 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1253 places, 1201/1203 transitions.
Applied a total of 0 rules in 23 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1250/1253 places, 1201/1203 transitions.
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-050A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (AND (EQ s653 1) (EQ s674 1)) (AND (EQ s1182 1) (EQ s1184 1))) (OR (EQ s1182 0) (EQ s1184 0))), p1:(AND (EQ s1182 1) (EQ s1184 1))], nbAcceptance=2, 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 2470 steps with 0 reset in 36 ms.
FORMULA ShieldIIPs-PT-050A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050A-LTLFireability-15 finished in 907 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((!(!F(X(!F(p0))) U G(p1))&&p2)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(!(F(p0) U G(p1))))||(X(p2)&&p3))))'
Found a CL insensitive property : ShieldIIPs-PT-050A-LTLFireability-05
Stuttering acceptance computed with spot in 382 ms :[(OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2))]
Support contains 8 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 53 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
// Phase 1: matrix 1201 rows 1251 cols
[2022-05-19 06:36:36] [INFO ] Computed 451 place invariants in 6 ms
[2022-05-19 06:36:37] [INFO ] Implicit Places using invariants in 626 ms returned [1237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 627 ms to find 1 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 1250/1253 places, 1201/1203 transitions.
Applied a total of 0 rules in 23 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1250/1253 places, 1201/1203 transitions.
Running random walk in product with property : ShieldIIPs-PT-050A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=p3, acceptance={} source=0 dest: 2}], [{ cond=(NOT p3), acceptance={} source=1 dest: 3}, { cond=p3, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p3 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p3) p0), acceptance={} source=3 dest: 3}, { cond=(AND p3 p0), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p3) p1), acceptance={} source=3 dest: 6}, { cond=(AND p3 (NOT p0)), acceptance={} source=3 dest: 7}, { cond=(AND p3 p1), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=4 dest: 3}, { cond=(AND p3 (NOT p2) p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=4 dest: 6}, { cond=(AND p3 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 7}, { cond=(AND p3 (NOT p2) p1), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p3) p0), acceptance={} source=5 dest: 3}, { cond=(AND p3 p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p3) p0 p1), acceptance={} source=5 dest: 6}, { cond=(AND p3 (NOT p0)), acceptance={} source=5 dest: 7}, { cond=(AND p3 p0 p1), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p3) p1), acceptance={0} source=6 dest: 6}, { cond=(AND p3 p1), acceptance={0} source=6 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=7 dest: 3}, { cond=(AND p3 (NOT p2) p0), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p0 p1), acceptance={} source=7 dest: 6}, { cond=(AND p3 (NOT p2) (NOT p0)), acceptance={} source=7 dest: 7}, { cond=(AND p3 (NOT p2) p0 p1), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2) p1), acceptance={0} source=8 dest: 6}, { cond=(AND p3 (NOT p2) p1), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p3:(EQ s991 1), p2:(OR (EQ s581 0) (EQ s591 0)), p0:(AND (EQ s386 1) (EQ s392 1) (EQ s402 1)), p1:(AND (EQ s1114 1) (EQ s1135 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 105 reset in 839 ms.
Product exploration explored 100000 steps with 119 reset in 1017 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 (NOT p3) p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT p3)), (X (NOT (AND p3 (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND p3 (NOT p2) p0)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND p3 p1)))), (X (X (NOT (AND p3 (NOT p2) p1)))), (X (X (NOT (AND p3 p0)))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND p3 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 692 ms. Reduced automaton from 9 states, 34 edges and 4 AP to 8 states, 30 edges and 4 AP.
Stuttering acceptance computed with spot in 345 ms :[(OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 1201 rows 1250 cols
[2022-05-19 06:36:41] [INFO ] Computed 450 place invariants in 2 ms
[2022-05-19 06:36:41] [INFO ] [Real]Absence check using 450 positive place invariants in 69 ms returned sat
[2022-05-19 06:36:43] [INFO ] After 2132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-05-19 06:36:43] [INFO ] [Nat]Absence check using 450 positive place invariants in 69 ms returned sat
[2022-05-19 06:36:48] [INFO ] After 4631ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2022-05-19 06:36:48] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2022-05-19 06:36:48] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 0 ms to minimize.
[2022-05-19 06:36:49] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 0 ms to minimize.
[2022-05-19 06:36:49] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 0 ms to minimize.
[2022-05-19 06:36:49] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2022-05-19 06:36:49] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2022-05-19 06:36:49] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2022-05-19 06:36:49] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2022-05-19 06:36:49] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2022-05-19 06:36:49] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 0 ms to minimize.
[2022-05-19 06:36:49] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
[2022-05-19 06:36:50] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2022-05-19 06:36:50] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 0 ms to minimize.
[2022-05-19 06:36:50] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 0 ms to minimize.
[2022-05-19 06:36:50] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 0 ms to minimize.
[2022-05-19 06:36:50] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1849 ms
[2022-05-19 06:36:51] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 1 ms to minimize.
[2022-05-19 06:36:51] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 1 ms to minimize.
[2022-05-19 06:36:51] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 0 ms to minimize.
[2022-05-19 06:36:51] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 0 ms to minimize.
[2022-05-19 06:36:51] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 0 ms to minimize.
[2022-05-19 06:36:51] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2022-05-19 06:36:51] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 0 ms to minimize.
[2022-05-19 06:36:52] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 0 ms to minimize.
[2022-05-19 06:36:52] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2022-05-19 06:36:52] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2022-05-19 06:36:52] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2022-05-19 06:36:52] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2022-05-19 06:36:52] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2022-05-19 06:36:52] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2022-05-19 06:36:52] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2022-05-19 06:36:52] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2022-05-19 06:36:52] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2022-05-19 06:36:53] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2096 ms
[2022-05-19 06:36:53] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2022-05-19 06:36:53] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2022-05-19 06:36:53] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2022-05-19 06:36:53] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2022-05-19 06:36:53] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2022-05-19 06:36:53] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2022-05-19 06:36:53] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2022-05-19 06:36:53] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2022-05-19 06:36:54] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2022-05-19 06:36:54] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 914 ms
[2022-05-19 06:36:54] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2022-05-19 06:36:54] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2022-05-19 06:36:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 312 ms
[2022-05-19 06:36:55] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 0 ms to minimize.
[2022-05-19 06:36:55] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2022-05-19 06:36:55] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2022-05-19 06:36:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 307 ms
[2022-05-19 06:36:55] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2022-05-19 06:36:56] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2022-05-19 06:36:56] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2022-05-19 06:36:56] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2022-05-19 06:36:56] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2022-05-19 06:36:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 541 ms
[2022-05-19 06:36:56] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2022-05-19 06:36:57] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2022-05-19 06:36:57] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2022-05-19 06:36:57] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2022-05-19 06:36:57] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2022-05-19 06:36:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 548 ms
[2022-05-19 06:36:58] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2022-05-19 06:36:58] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2022-05-19 06:36:58] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 0 ms to minimize.
[2022-05-19 06:36:58] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 0 ms to minimize.
[2022-05-19 06:36:58] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 0 ms to minimize.
[2022-05-19 06:36:59] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2022-05-19 06:36:59] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2022-05-19 06:36:59] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2022-05-19 06:36:59] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2022-05-19 06:36:59] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2022-05-19 06:36:59] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2022-05-19 06:36:59] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1329 ms
[2022-05-19 06:37:00] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 0 ms to minimize.
[2022-05-19 06:37:00] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 0 ms to minimize.
[2022-05-19 06:37:00] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2022-05-19 06:37:00] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2022-05-19 06:37:00] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2022-05-19 06:37:00] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2022-05-19 06:37:00] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2022-05-19 06:37:01] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
[2022-05-19 06:37:01] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 973 ms
[2022-05-19 06:37:01] [INFO ] After 17319ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 2053 ms.
[2022-05-19 06:37:03] [INFO ] After 20025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 1741 ms.
Support contains 8 out of 1250 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Partial Free-agglomeration rule applied 344 times.
Drop transitions removed 344 transitions
Iterating global reduction 0 with 344 rules applied. Total rules applied 344 place count 1250 transition count 1201
Applied a total of 344 rules in 44 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1250/1250 places, 1201/1201 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 271 ms. (steps per millisecond=36 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 124271 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{0=1, 1=1, 6=1}
Probabilistic random walk after 124271 steps, saw 119989 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :3
Running SMT prover for 7 properties.
// Phase 1: matrix 1201 rows 1250 cols
[2022-05-19 06:37:08] [INFO ] Computed 450 place invariants in 6 ms
[2022-05-19 06:37:09] [INFO ] [Real]Absence check using 446 positive place invariants in 68 ms returned sat
[2022-05-19 06:37:09] [INFO ] [Real]Absence check using 446 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-19 06:37:10] [INFO ] After 1625ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-19 06:37:10] [INFO ] [Nat]Absence check using 446 positive place invariants in 68 ms returned sat
[2022-05-19 06:37:10] [INFO ] [Nat]Absence check using 446 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-19 06:37:22] [INFO ] After 11512ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-19 06:37:22] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 0 ms to minimize.
[2022-05-19 06:37:22] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
[2022-05-19 06:37:23] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 0 ms to minimize.
[2022-05-19 06:37:23] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2022-05-19 06:37:23] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2022-05-19 06:37:23] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 0 ms to minimize.
[2022-05-19 06:37:23] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2022-05-19 06:37:23] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
[2022-05-19 06:37:23] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2022-05-19 06:37:24] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2022-05-19 06:37:24] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1402 ms
[2022-05-19 06:37:25] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2022-05-19 06:37:25] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 0 ms to minimize.
[2022-05-19 06:37:25] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 0 ms to minimize.
[2022-05-19 06:37:25] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2022-05-19 06:37:25] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2022-05-19 06:37:25] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2022-05-19 06:37:25] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 0 ms to minimize.
[2022-05-19 06:37:26] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 0 ms to minimize.
[2022-05-19 06:37:26] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2022-05-19 06:37:26] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2022-05-19 06:37:26] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2022-05-19 06:37:26] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2022-05-19 06:37:26] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1574 ms
[2022-05-19 06:37:26] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2022-05-19 06:37:26] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2022-05-19 06:37:26] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2022-05-19 06:37:26] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2022-05-19 06:37:26] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2022-05-19 06:37:27] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2022-05-19 06:37:27] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2022-05-19 06:37:27] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2022-05-19 06:37:27] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 682 ms
[2022-05-19 06:37:27] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 0 ms to minimize.
[2022-05-19 06:37:28] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 0 ms to minimize.
[2022-05-19 06:37:28] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 0 ms to minimize.
[2022-05-19 06:37:28] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 0 ms to minimize.
[2022-05-19 06:37:28] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 1 ms to minimize.
[2022-05-19 06:37:28] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 0 ms to minimize.
[2022-05-19 06:37:29] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 1 ms to minimize.
[2022-05-19 06:37:29] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 0 ms to minimize.
[2022-05-19 06:37:29] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 0 ms to minimize.
[2022-05-19 06:37:29] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 1 ms to minimize.
[2022-05-19 06:37:29] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 0 ms to minimize.
[2022-05-19 06:37:30] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 0 ms to minimize.
[2022-05-19 06:37:30] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 0 ms to minimize.
[2022-05-19 06:37:30] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 0 ms to minimize.
[2022-05-19 06:37:30] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 1 ms to minimize.
[2022-05-19 06:37:30] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 0 ms to minimize.
[2022-05-19 06:37:30] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 0 ms to minimize.
[2022-05-19 06:37:31] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2022-05-19 06:37:31] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2022-05-19 06:37:31] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2022-05-19 06:37:31] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2022-05-19 06:37:31] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2022-05-19 06:37:31] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2022-05-19 06:37:31] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2022-05-19 06:37:31] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 4009 ms
[2022-05-19 06:37:33] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2022-05-19 06:37:33] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2022-05-19 06:37:33] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 0 ms to minimize.
[2022-05-19 06:37:33] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2022-05-19 06:37:34] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2022-05-19 06:37:34] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2022-05-19 06:37:34] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2022-05-19 06:37:34] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2022-05-19 06:37:34] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2022-05-19 06:37:34] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1436 ms
[2022-05-19 06:37:35] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 1 ms to minimize.
[2022-05-19 06:37:35] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2022-05-19 06:37:35] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2022-05-19 06:37:35] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2022-05-19 06:37:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 06:37:35] [INFO ] After 25055ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 677 ms.
Support contains 8 out of 1250 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 21 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1250/1250 places, 1201/1201 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1201 rows 1250 cols
[2022-05-19 06:37:36] [INFO ] Computed 450 place invariants in 5 ms
[2022-05-19 06:37:37] [INFO ] [Real]Absence check using 446 positive place invariants in 69 ms returned sat
[2022-05-19 06:37:37] [INFO ] [Real]Absence check using 446 positive and 4 generalized place invariants in 2 ms returned sat
[2022-05-19 06:37:38] [INFO ] After 1447ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-19 06:37:38] [INFO ] [Nat]Absence check using 446 positive place invariants in 65 ms returned sat
[2022-05-19 06:37:38] [INFO ] [Nat]Absence check using 446 positive and 4 generalized place invariants in 0 ms returned sat
[2022-05-19 06:37:42] [INFO ] After 3748ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-19 06:37:45] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 1 ms to minimize.
[2022-05-19 06:37:46] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 0 ms to minimize.
[2022-05-19 06:37:46] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 1 ms to minimize.
[2022-05-19 06:37:46] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 1 ms to minimize.
[2022-05-19 06:37:46] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 1 ms to minimize.
[2022-05-19 06:37:46] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 1 ms to minimize.
[2022-05-19 06:37:47] [INFO ] Deduced a trap composed of 9 places in 165 ms of which 0 ms to minimize.
[2022-05-19 06:37:47] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 0 ms to minimize.
[2022-05-19 06:37:47] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 0 ms to minimize.
[2022-05-19 06:37:47] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 1 ms to minimize.
[2022-05-19 06:37:48] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 0 ms to minimize.
[2022-05-19 06:37:48] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 0 ms to minimize.
[2022-05-19 06:37:48] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 1 ms to minimize.
[2022-05-19 06:37:48] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 0 ms to minimize.
[2022-05-19 06:37:48] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 1 ms to minimize.
[2022-05-19 06:37:48] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2022-05-19 06:37:48] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 0 ms to minimize.
[2022-05-19 06:37:49] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2022-05-19 06:37:49] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2022-05-19 06:37:49] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 0 ms to minimize.
[2022-05-19 06:37:49] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2022-05-19 06:37:49] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2022-05-19 06:37:49] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2022-05-19 06:37:49] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2022-05-19 06:37:49] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2022-05-19 06:37:50] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2022-05-19 06:37:50] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2022-05-19 06:37:50] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2022-05-19 06:37:50] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 4585 ms
[2022-05-19 06:37:50] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 0 ms to minimize.
[2022-05-19 06:37:50] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 0 ms to minimize.
[2022-05-19 06:37:51] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 0 ms to minimize.
[2022-05-19 06:37:51] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
[2022-05-19 06:37:51] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
[2022-05-19 06:37:51] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 0 ms to minimize.
[2022-05-19 06:37:51] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 0 ms to minimize.
[2022-05-19 06:37:51] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 0 ms to minimize.
[2022-05-19 06:37:51] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2022-05-19 06:37:51] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 1 ms to minimize.
[2022-05-19 06:37:51] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 0 ms to minimize.
[2022-05-19 06:37:52] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 0 ms to minimize.
[2022-05-19 06:37:52] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 0 ms to minimize.
[2022-05-19 06:37:52] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 0 ms to minimize.
[2022-05-19 06:37:52] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 0 ms to minimize.
[2022-05-19 06:37:52] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 0 ms to minimize.
[2022-05-19 06:37:52] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2022-05-19 06:37:52] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2022-05-19 06:37:52] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 0 ms to minimize.
[2022-05-19 06:37:52] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2022-05-19 06:37:53] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2022-05-19 06:37:53] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2022-05-19 06:37:53] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 2490 ms
[2022-05-19 06:37:53] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 0 ms to minimize.
[2022-05-19 06:37:53] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 0 ms to minimize.
[2022-05-19 06:37:53] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2022-05-19 06:37:53] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2022-05-19 06:37:54] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2022-05-19 06:37:54] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2022-05-19 06:37:54] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2022-05-19 06:37:54] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2022-05-19 06:37:54] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1018 ms
[2022-05-19 06:37:55] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 0 ms to minimize.
[2022-05-19 06:37:55] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2022-05-19 06:37:55] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2022-05-19 06:37:55] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2022-05-19 06:37:55] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2022-05-19 06:37:55] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 0 ms to minimize.
[2022-05-19 06:37:55] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2022-05-19 06:37:55] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 907 ms
[2022-05-19 06:37:56] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2022-05-19 06:37:56] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2022-05-19 06:37:56] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2022-05-19 06:37:56] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 0 ms to minimize.
[2022-05-19 06:37:56] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 1 ms to minimize.
[2022-05-19 06:37:56] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2022-05-19 06:37:57] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2022-05-19 06:37:57] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
[2022-05-19 06:37:57] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2022-05-19 06:37:57] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2022-05-19 06:37:57] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 0 ms to minimize.
[2022-05-19 06:37:57] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 0 ms to minimize.
[2022-05-19 06:37:57] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2022-05-19 06:37:58] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 1 ms to minimize.
[2022-05-19 06:37:58] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 0 ms to minimize.
[2022-05-19 06:37:58] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 0 ms to minimize.
[2022-05-19 06:37:58] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2022-05-19 06:37:58] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2022-05-19 06:37:59] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 0 ms to minimize.
[2022-05-19 06:37:59] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 1 ms to minimize.
[2022-05-19 06:37:59] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 0 ms to minimize.
[2022-05-19 06:38:00] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 0 ms to minimize.
[2022-05-19 06:38:00] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 0 ms to minimize.
[2022-05-19 06:38:00] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2022-05-19 06:38:00] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2022-05-19 06:38:00] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2022-05-19 06:38:00] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2022-05-19 06:38:01] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2022-05-19 06:38:01] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2022-05-19 06:38:01] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2022-05-19 06:38:01] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2022-05-19 06:38:01] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 5358 ms
[2022-05-19 06:38:01] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 1 ms to minimize.
[2022-05-19 06:38:02] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 0 ms to minimize.
[2022-05-19 06:38:02] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 0 ms to minimize.
[2022-05-19 06:38:02] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2022-05-19 06:38:02] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2022-05-19 06:38:02] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2022-05-19 06:38:02] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2022-05-19 06:38:02] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2022-05-19 06:38:02] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2022-05-19 06:38:02] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2022-05-19 06:38:03] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2022-05-19 06:38:03] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1432 ms
[2022-05-19 06:38:03] [INFO ] After 24254ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 303 ms.
[2022-05-19 06:38:03] [INFO ] After 25010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 668 ms.
Support contains 8 out of 1250 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 22 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1250/1250 places, 1201/1201 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 129005 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 129005 steps, saw 124613 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1201 rows 1250 cols
[2022-05-19 06:38:07] [INFO ] Computed 450 place invariants in 6 ms
[2022-05-19 06:38:08] [INFO ] [Real]Absence check using 446 positive place invariants in 71 ms returned sat
[2022-05-19 06:38:08] [INFO ] [Real]Absence check using 446 positive and 4 generalized place invariants in 0 ms returned sat
[2022-05-19 06:38:09] [INFO ] After 1460ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-19 06:38:09] [INFO ] [Nat]Absence check using 446 positive place invariants in 69 ms returned sat
[2022-05-19 06:38:09] [INFO ] [Nat]Absence check using 446 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-19 06:38:13] [INFO ] After 3843ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-19 06:38:16] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 0 ms to minimize.
[2022-05-19 06:38:17] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 0 ms to minimize.
[2022-05-19 06:38:17] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 1 ms to minimize.
[2022-05-19 06:38:17] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 0 ms to minimize.
[2022-05-19 06:38:17] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 0 ms to minimize.
[2022-05-19 06:38:18] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 1 ms to minimize.
[2022-05-19 06:38:18] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 0 ms to minimize.
[2022-05-19 06:38:18] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 0 ms to minimize.
[2022-05-19 06:38:18] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 0 ms to minimize.
[2022-05-19 06:38:18] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 1 ms to minimize.
[2022-05-19 06:38:19] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 1 ms to minimize.
[2022-05-19 06:38:19] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 1 ms to minimize.
[2022-05-19 06:38:19] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 0 ms to minimize.
[2022-05-19 06:38:19] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 0 ms to minimize.
[2022-05-19 06:38:19] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 0 ms to minimize.
[2022-05-19 06:38:19] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2022-05-19 06:38:20] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 1 ms to minimize.
[2022-05-19 06:38:20] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2022-05-19 06:38:20] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 0 ms to minimize.
[2022-05-19 06:38:20] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 0 ms to minimize.
[2022-05-19 06:38:20] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2022-05-19 06:38:20] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2022-05-19 06:38:20] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2022-05-19 06:38:20] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2022-05-19 06:38:21] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2022-05-19 06:38:21] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2022-05-19 06:38:21] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2022-05-19 06:38:21] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2022-05-19 06:38:21] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 4662 ms
[2022-05-19 06:38:21] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
[2022-05-19 06:38:21] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 0 ms to minimize.
[2022-05-19 06:38:22] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 1 ms to minimize.
[2022-05-19 06:38:22] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 0 ms to minimize.
[2022-05-19 06:38:22] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
[2022-05-19 06:38:22] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 1 ms to minimize.
[2022-05-19 06:38:22] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2022-05-19 06:38:22] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2022-05-19 06:38:22] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
[2022-05-19 06:38:22] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 0 ms to minimize.
[2022-05-19 06:38:23] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
[2022-05-19 06:38:23] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 0 ms to minimize.
[2022-05-19 06:38:23] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 0 ms to minimize.
[2022-05-19 06:38:23] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2022-05-19 06:38:23] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 0 ms to minimize.
[2022-05-19 06:38:23] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 0 ms to minimize.
[2022-05-19 06:38:23] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2022-05-19 06:38:23] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2022-05-19 06:38:23] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 0 ms to minimize.
[2022-05-19 06:38:24] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2022-05-19 06:38:24] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2022-05-19 06:38:24] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2022-05-19 06:38:24] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 2524 ms
[2022-05-19 06:38:24] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
[2022-05-19 06:38:24] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 0 ms to minimize.
[2022-05-19 06:38:24] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2022-05-19 06:38:25] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2022-05-19 06:38:25] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2022-05-19 06:38:25] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2022-05-19 06:38:25] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2022-05-19 06:38:25] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2022-05-19 06:38:25] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1000 ms
[2022-05-19 06:38:26] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2022-05-19 06:38:26] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2022-05-19 06:38:26] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2022-05-19 06:38:26] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2022-05-19 06:38:26] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2022-05-19 06:38:26] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 0 ms to minimize.
[2022-05-19 06:38:26] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2022-05-19 06:38:27] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 917 ms
[2022-05-19 06:38:27] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2022-05-19 06:38:27] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 0 ms to minimize.
[2022-05-19 06:38:27] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2022-05-19 06:38:27] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 0 ms to minimize.
[2022-05-19 06:38:27] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 0 ms to minimize.
[2022-05-19 06:38:28] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2022-05-19 06:38:28] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2022-05-19 06:38:28] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2022-05-19 06:38:28] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2022-05-19 06:38:28] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2022-05-19 06:38:28] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 0 ms to minimize.
[2022-05-19 06:38:28] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
[2022-05-19 06:38:29] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2022-05-19 06:38:29] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 1 ms to minimize.
[2022-05-19 06:38:29] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2022-05-19 06:38:29] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2022-05-19 06:38:29] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 0 ms to minimize.
[2022-05-19 06:38:30] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2022-05-19 06:38:30] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2022-05-19 06:38:31] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 1 ms to minimize.
[2022-05-19 06:38:31] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 1 ms to minimize.
[2022-05-19 06:38:31] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
[2022-05-19 06:38:31] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2022-05-19 06:38:31] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 0 ms to minimize.
[2022-05-19 06:38:31] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2022-05-19 06:38:31] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2022-05-19 06:38:32] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2022-05-19 06:38:32] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2022-05-19 06:38:32] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2022-05-19 06:38:32] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2022-05-19 06:38:32] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2022-05-19 06:38:32] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 5459 ms
[2022-05-19 06:38:33] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 0 ms to minimize.
[2022-05-19 06:38:33] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
[2022-05-19 06:38:33] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 0 ms to minimize.
[2022-05-19 06:38:33] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2022-05-19 06:38:33] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2022-05-19 06:38:33] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2022-05-19 06:38:33] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2022-05-19 06:38:33] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2022-05-19 06:38:34] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2022-05-19 06:38:34] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2022-05-19 06:38:34] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2022-05-19 06:38:34] [INFO ] Deduced a trap composed of 3 places in 614 ms of which 1 ms to minimize.
[2022-05-19 06:38:34] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 06:38:34] [INFO ] After 25625ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 622 ms.
Support contains 8 out of 1250 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 21 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1250/1250 places, 1201/1201 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 22 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
// Phase 1: matrix 1201 rows 1250 cols
[2022-05-19 06:38:35] [INFO ] Computed 450 place invariants in 13 ms
[2022-05-19 06:38:36] [INFO ] Implicit Places using invariants in 772 ms returned []
// Phase 1: matrix 1201 rows 1250 cols
[2022-05-19 06:38:36] [INFO ] Computed 450 place invariants in 6 ms
[2022-05-19 06:38:38] [INFO ] Implicit Places using invariants and state equation in 1823 ms returned []
Implicit Place search using SMT with State Equation took 2595 ms to find 0 implicit places.
[2022-05-19 06:38:38] [INFO ] Redundant transitions in 22 ms returned []
// Phase 1: matrix 1201 rows 1250 cols
[2022-05-19 06:38:38] [INFO ] Computed 450 place invariants in 12 ms
[2022-05-19 06:38:38] [INFO ] Dead Transitions using invariants and state equation in 685 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1250/1250 places, 1201/1201 transitions.
Knowledge obtained : [(AND (NOT p3) p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT p3)), (X (NOT (AND p3 (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND p3 (NOT p2) p0)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND p3 p1)))), (X (X (NOT (AND p3 (NOT p2) p1)))), (X (X (NOT (AND p3 p0)))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND p3 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) p3)), (F (AND (NOT p3) p1)), (F (AND p0 (NOT p2) (NOT p3))), (F (AND p3 p1)), (F (AND p0 (NOT p3) p1)), (F (AND p0 (NOT p3))), (F (NOT (AND (NOT p0) (NOT p3)))), (F (AND p0 p3)), (F (AND (NOT p0) (NOT p2) (NOT p3))), (F (AND (NOT p2) (NOT p3) p1))]
Knowledge based reduction with 16 factoid took 1053 ms. Reduced automaton from 8 states, 30 edges and 4 AP to 8 states, 30 edges and 4 AP.
Stuttering acceptance computed with spot in 343 ms :[(OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 376 ms :[(OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2))]
Support contains 8 out of 1250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 20 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
// Phase 1: matrix 1201 rows 1250 cols
[2022-05-19 06:38:40] [INFO ] Computed 450 place invariants in 5 ms
[2022-05-19 06:38:41] [INFO ] Implicit Places using invariants in 615 ms returned []
// Phase 1: matrix 1201 rows 1250 cols
[2022-05-19 06:38:41] [INFO ] Computed 450 place invariants in 5 ms
[2022-05-19 06:38:42] [INFO ] Implicit Places using invariants and state equation in 1473 ms returned []
Implicit Place search using SMT with State Equation took 2090 ms to find 0 implicit places.
// Phase 1: matrix 1201 rows 1250 cols
[2022-05-19 06:38:42] [INFO ] Computed 450 place invariants in 6 ms
[2022-05-19 06:38:43] [INFO ] Dead Transitions using invariants and state equation in 652 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1250/1250 places, 1201/1201 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 (NOT p0) (NOT p3) (NOT p1) p2), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 p3)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND p3 p1)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p3) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 644 ms. Reduced automaton from 8 states, 30 edges and 4 AP to 8 states, 30 edges and 4 AP.
Stuttering acceptance computed with spot in 365 ms :[(OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 334 ms. (steps per millisecond=29 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 1201 rows 1250 cols
[2022-05-19 06:38:45] [INFO ] Computed 450 place invariants in 5 ms
[2022-05-19 06:38:46] [INFO ] [Real]Absence check using 450 positive place invariants in 68 ms returned sat
[2022-05-19 06:38:47] [INFO ] After 2040ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-05-19 06:38:48] [INFO ] [Nat]Absence check using 450 positive place invariants in 68 ms returned sat
[2022-05-19 06:38:53] [INFO ] After 5178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2022-05-19 06:38:54] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 0 ms to minimize.
[2022-05-19 06:38:54] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2022-05-19 06:38:54] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 0 ms to minimize.
[2022-05-19 06:38:54] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2022-05-19 06:38:55] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2022-05-19 06:38:55] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 0 ms to minimize.
[2022-05-19 06:38:55] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2022-05-19 06:38:55] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2022-05-19 06:38:55] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2022-05-19 06:38:55] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2022-05-19 06:38:55] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2022-05-19 06:38:55] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1409 ms
[2022-05-19 06:38:56] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 0 ms to minimize.
[2022-05-19 06:38:56] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2022-05-19 06:38:56] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2022-05-19 06:38:57] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 0 ms to minimize.
[2022-05-19 06:38:57] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 0 ms to minimize.
[2022-05-19 06:38:57] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 0 ms to minimize.
[2022-05-19 06:38:57] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 0 ms to minimize.
[2022-05-19 06:38:57] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 0 ms to minimize.
[2022-05-19 06:38:57] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 0 ms to minimize.
[2022-05-19 06:38:57] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 0 ms to minimize.
[2022-05-19 06:38:57] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2022-05-19 06:38:58] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2022-05-19 06:38:58] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2022-05-19 06:38:58] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1676 ms
[2022-05-19 06:38:58] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2022-05-19 06:38:58] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2022-05-19 06:38:58] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2022-05-19 06:38:58] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2022-05-19 06:38:58] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2022-05-19 06:38:58] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2022-05-19 06:38:58] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 600 ms
[2022-05-19 06:38:59] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 0 ms to minimize.
[2022-05-19 06:38:59] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2022-05-19 06:38:59] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2022-05-19 06:39:00] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2022-05-19 06:39:00] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2022-05-19 06:39:00] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2022-05-19 06:39:00] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2022-05-19 06:39:00] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2022-05-19 06:39:00] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2022-05-19 06:39:00] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 974 ms
[2022-05-19 06:39:00] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2022-05-19 06:39:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2022-05-19 06:39:01] [INFO ] After 12817ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 2239 ms.
[2022-05-19 06:39:03] [INFO ] After 15693ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 1860 ms.
Support contains 8 out of 1250 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Partial Free-agglomeration rule applied 344 times.
Drop transitions removed 344 transitions
Iterating global reduction 0 with 344 rules applied. Total rules applied 344 place count 1250 transition count 1201
Applied a total of 344 rules in 43 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1250/1250 places, 1201/1201 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1201 rows 1250 cols
[2022-05-19 06:39:05] [INFO ] Computed 450 place invariants in 6 ms
[2022-05-19 06:39:06] [INFO ] [Real]Absence check using 446 positive place invariants in 66 ms returned sat
[2022-05-19 06:39:06] [INFO ] [Real]Absence check using 446 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-19 06:39:07] [INFO ] After 1552ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-19 06:39:07] [INFO ] [Nat]Absence check using 446 positive place invariants in 68 ms returned sat
[2022-05-19 06:39:07] [INFO ] [Nat]Absence check using 446 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-19 06:39:15] [INFO ] After 7357ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-19 06:39:15] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 1 ms to minimize.
[2022-05-19 06:39:15] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 0 ms to minimize.
[2022-05-19 06:39:16] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 1 ms to minimize.
[2022-05-19 06:39:16] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 1 ms to minimize.
[2022-05-19 06:39:16] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 0 ms to minimize.
[2022-05-19 06:39:16] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 0 ms to minimize.
[2022-05-19 06:39:16] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 1 ms to minimize.
[2022-05-19 06:39:17] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 0 ms to minimize.
[2022-05-19 06:39:17] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2022-05-19 06:39:17] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 0 ms to minimize.
[2022-05-19 06:39:17] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2022-05-19 06:39:17] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 0 ms to minimize.
[2022-05-19 06:39:17] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2022-05-19 06:39:17] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2309 ms
[2022-05-19 06:39:18] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 0 ms to minimize.
[2022-05-19 06:39:18] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2022-05-19 06:39:18] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2022-05-19 06:39:18] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2022-05-19 06:39:18] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2022-05-19 06:39:18] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2022-05-19 06:39:19] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2022-05-19 06:39:19] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2022-05-19 06:39:19] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2022-05-19 06:39:19] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2022-05-19 06:39:19] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2022-05-19 06:39:19] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2022-05-19 06:39:19] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1363 ms
[2022-05-19 06:39:20] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 1 ms to minimize.
[2022-05-19 06:39:20] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 1 ms to minimize.
[2022-05-19 06:39:20] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 0 ms to minimize.
[2022-05-19 06:39:20] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2022-05-19 06:39:20] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2022-05-19 06:39:20] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2022-05-19 06:39:21] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2022-05-19 06:39:21] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 0 ms to minimize.
[2022-05-19 06:39:21] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2022-05-19 06:39:21] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2022-05-19 06:39:21] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2022-05-19 06:39:21] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2022-05-19 06:39:21] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2022-05-19 06:39:22] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2022-05-19 06:39:22] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2022-05-19 06:39:22] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2022-05-19 06:39:22] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2022-05-19 06:39:22] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2386 ms
[2022-05-19 06:39:22] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 0 ms to minimize.
[2022-05-19 06:39:23] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 0 ms to minimize.
[2022-05-19 06:39:23] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 0 ms to minimize.
[2022-05-19 06:39:23] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2022-05-19 06:39:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 589 ms
[2022-05-19 06:39:24] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 1 ms to minimize.
[2022-05-19 06:39:24] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2022-05-19 06:39:24] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2022-05-19 06:39:24] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 0 ms to minimize.
[2022-05-19 06:39:24] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2022-05-19 06:39:25] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
[2022-05-19 06:39:25] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2022-05-19 06:39:25] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2022-05-19 06:39:25] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2022-05-19 06:39:25] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2022-05-19 06:39:25] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2022-05-19 06:39:25] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2022-05-19 06:39:26] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2022-05-19 06:39:26] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2022-05-19 06:39:26] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2022-05-19 06:39:26] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2022-05-19 06:39:26] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2022-05-19 06:39:26] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2459 ms
[2022-05-19 06:39:26] [INFO ] After 18569ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 3882 ms.
[2022-05-19 06:39:30] [INFO ] After 22955ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 804 ms.
Support contains 8 out of 1250 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 22 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1250/1250 places, 1201/1201 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 127266 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{0=1}
Probabilistic random walk after 127266 steps, saw 122915 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :1
Running SMT prover for 6 properties.
// Phase 1: matrix 1201 rows 1250 cols
[2022-05-19 06:39:35] [INFO ] Computed 450 place invariants in 6 ms
[2022-05-19 06:39:35] [INFO ] [Real]Absence check using 446 positive place invariants in 69 ms returned sat
[2022-05-19 06:39:35] [INFO ] [Real]Absence check using 446 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-19 06:39:36] [INFO ] After 1445ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-19 06:39:36] [INFO ] [Nat]Absence check using 446 positive place invariants in 69 ms returned sat
[2022-05-19 06:39:36] [INFO ] [Nat]Absence check using 446 positive and 4 generalized place invariants in 0 ms returned sat
[2022-05-19 06:39:40] [INFO ] After 3727ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-19 06:39:40] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 0 ms to minimize.
[2022-05-19 06:39:41] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 0 ms to minimize.
[2022-05-19 06:39:41] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2022-05-19 06:39:41] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 1 ms to minimize.
[2022-05-19 06:39:41] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2022-05-19 06:39:41] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 0 ms to minimize.
[2022-05-19 06:39:41] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 0 ms to minimize.
[2022-05-19 06:39:41] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
[2022-05-19 06:39:41] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2022-05-19 06:39:42] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2022-05-19 06:39:42] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2022-05-19 06:39:42] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1461 ms
[2022-05-19 06:39:42] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2022-05-19 06:39:42] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2022-05-19 06:39:42] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2022-05-19 06:39:42] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2022-05-19 06:39:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 411 ms
[2022-05-19 06:39:43] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2022-05-19 06:39:43] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2022-05-19 06:39:43] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2022-05-19 06:39:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 546 ms
[2022-05-19 06:39:43] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2022-05-19 06:39:44] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 0 ms to minimize.
[2022-05-19 06:39:44] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2022-05-19 06:39:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 395 ms
[2022-05-19 06:39:44] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 0 ms to minimize.
[2022-05-19 06:39:45] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 0 ms to minimize.
[2022-05-19 06:39:45] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 1 ms to minimize.
[2022-05-19 06:39:45] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 0 ms to minimize.
[2022-05-19 06:39:45] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2022-05-19 06:39:45] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2022-05-19 06:39:45] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2022-05-19 06:39:46] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2022-05-19 06:39:46] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2022-05-19 06:39:46] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 0 ms to minimize.
[2022-05-19 06:39:46] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 0 ms to minimize.
[2022-05-19 06:39:46] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2022-05-19 06:39:46] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2022-05-19 06:39:46] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2022-05-19 06:39:47] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 0 ms to minimize.
[2022-05-19 06:39:47] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2022-05-19 06:39:47] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2544 ms
[2022-05-19 06:39:47] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 0 ms to minimize.
[2022-05-19 06:39:47] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 0 ms to minimize.
[2022-05-19 06:39:48] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 0 ms to minimize.
[2022-05-19 06:39:48] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 1 ms to minimize.
[2022-05-19 06:39:48] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 1 ms to minimize.
[2022-05-19 06:39:48] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 0 ms to minimize.
[2022-05-19 06:39:48] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2022-05-19 06:39:48] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2022-05-19 06:39:49] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 0 ms to minimize.
[2022-05-19 06:39:49] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 0 ms to minimize.
[2022-05-19 06:39:49] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2022-05-19 06:39:49] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2022-05-19 06:39:49] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 1 ms to minimize.
[2022-05-19 06:39:49] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 0 ms to minimize.
[2022-05-19 06:39:50] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 1 ms to minimize.
[2022-05-19 06:39:50] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 0 ms to minimize.
[2022-05-19 06:39:50] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 0 ms to minimize.
[2022-05-19 06:39:50] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 1 ms to minimize.
[2022-05-19 06:39:50] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 0 ms to minimize.
[2022-05-19 06:39:51] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 1 ms to minimize.
[2022-05-19 06:39:51] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 0 ms to minimize.
[2022-05-19 06:39:51] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 0 ms to minimize.
[2022-05-19 06:39:51] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 0 ms to minimize.
[2022-05-19 06:39:51] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 1 ms to minimize.
[2022-05-19 06:39:52] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 1 ms to minimize.
[2022-05-19 06:39:52] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 1 ms to minimize.
[2022-05-19 06:39:52] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 0 ms to minimize.
[2022-05-19 06:39:52] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2022-05-19 06:39:52] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2022-05-19 06:39:52] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2022-05-19 06:39:52] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2022-05-19 06:39:52] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2022-05-19 06:39:52] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 5506 ms
[2022-05-19 06:39:53] [INFO ] After 16052ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 6090 ms.
[2022-05-19 06:39:59] [INFO ] After 22602ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 643 ms.
Support contains 8 out of 1250 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 21 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1250/1250 places, 1201/1201 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 130987 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 130987 steps, saw 126547 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1201 rows 1250 cols
[2022-05-19 06:40:03] [INFO ] Computed 450 place invariants in 6 ms
[2022-05-19 06:40:03] [INFO ] [Real]Absence check using 446 positive place invariants in 69 ms returned sat
[2022-05-19 06:40:03] [INFO ] [Real]Absence check using 446 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-19 06:40:04] [INFO ] After 1451ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-19 06:40:05] [INFO ] [Nat]Absence check using 446 positive place invariants in 68 ms returned sat
[2022-05-19 06:40:05] [INFO ] [Nat]Absence check using 446 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-19 06:40:09] [INFO ] After 3724ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-19 06:40:09] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 1 ms to minimize.
[2022-05-19 06:40:09] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2022-05-19 06:40:09] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 0 ms to minimize.
[2022-05-19 06:40:09] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 0 ms to minimize.
[2022-05-19 06:40:09] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2022-05-19 06:40:09] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 0 ms to minimize.
[2022-05-19 06:40:10] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 0 ms to minimize.
[2022-05-19 06:40:10] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2022-05-19 06:40:10] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2022-05-19 06:40:10] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2022-05-19 06:40:10] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2022-05-19 06:40:10] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1459 ms
[2022-05-19 06:40:10] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 0 ms to minimize.
[2022-05-19 06:40:10] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2022-05-19 06:40:11] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2022-05-19 06:40:11] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2022-05-19 06:40:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 396 ms
[2022-05-19 06:40:11] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2022-05-19 06:40:11] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2022-05-19 06:40:11] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2022-05-19 06:40:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 549 ms
[2022-05-19 06:40:12] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2022-05-19 06:40:12] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 0 ms to minimize.
[2022-05-19 06:40:12] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2022-05-19 06:40:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 377 ms
[2022-05-19 06:40:13] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 0 ms to minimize.
[2022-05-19 06:40:13] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 0 ms to minimize.
[2022-05-19 06:40:13] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
[2022-05-19 06:40:13] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 1 ms to minimize.
[2022-05-19 06:40:13] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 0 ms to minimize.
[2022-05-19 06:40:14] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2022-05-19 06:40:14] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 0 ms to minimize.
[2022-05-19 06:40:14] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2022-05-19 06:40:14] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2022-05-19 06:40:14] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 0 ms to minimize.
[2022-05-19 06:40:14] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2022-05-19 06:40:14] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 0 ms to minimize.
[2022-05-19 06:40:15] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2022-05-19 06:40:15] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2022-05-19 06:40:15] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 0 ms to minimize.
[2022-05-19 06:40:15] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2022-05-19 06:40:15] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2461 ms
[2022-05-19 06:40:15] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 1 ms to minimize.
[2022-05-19 06:40:16] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 1 ms to minimize.
[2022-05-19 06:40:16] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 1 ms to minimize.
[2022-05-19 06:40:16] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 1 ms to minimize.
[2022-05-19 06:40:16] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 0 ms to minimize.
[2022-05-19 06:40:16] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 1 ms to minimize.
[2022-05-19 06:40:16] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2022-05-19 06:40:17] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2022-05-19 06:40:17] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 0 ms to minimize.
[2022-05-19 06:40:17] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 0 ms to minimize.
[2022-05-19 06:40:17] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2022-05-19 06:40:17] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2022-05-19 06:40:17] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 0 ms to minimize.
[2022-05-19 06:40:18] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 1 ms to minimize.
[2022-05-19 06:40:18] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 1 ms to minimize.
[2022-05-19 06:40:18] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 0 ms to minimize.
[2022-05-19 06:40:18] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 0 ms to minimize.
[2022-05-19 06:40:18] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 0 ms to minimize.
[2022-05-19 06:40:19] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 0 ms to minimize.
[2022-05-19 06:40:19] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 0 ms to minimize.
[2022-05-19 06:40:19] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 0 ms to minimize.
[2022-05-19 06:40:19] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 0 ms to minimize.
[2022-05-19 06:40:19] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 1 ms to minimize.
[2022-05-19 06:40:20] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2022-05-19 06:40:20] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 0 ms to minimize.
[2022-05-19 06:40:20] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 0 ms to minimize.
[2022-05-19 06:40:20] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 0 ms to minimize.
[2022-05-19 06:40:20] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2022-05-19 06:40:20] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2022-05-19 06:40:20] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2022-05-19 06:40:21] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2022-05-19 06:40:21] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2022-05-19 06:40:21] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 5450 ms
[2022-05-19 06:40:21] [INFO ] After 15855ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 5835 ms.
[2022-05-19 06:40:27] [INFO ] After 22147ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 512 ms.
Support contains 8 out of 1250 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 22 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1250/1250 places, 1201/1201 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 22 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
// Phase 1: matrix 1201 rows 1250 cols
[2022-05-19 06:40:27] [INFO ] Computed 450 place invariants in 8 ms
[2022-05-19 06:40:28] [INFO ] Implicit Places using invariants in 788 ms returned []
// Phase 1: matrix 1201 rows 1250 cols
[2022-05-19 06:40:28] [INFO ] Computed 450 place invariants in 8 ms
[2022-05-19 06:40:30] [INFO ] Implicit Places using invariants and state equation in 1766 ms returned []
Implicit Place search using SMT with State Equation took 2557 ms to find 0 implicit places.
[2022-05-19 06:40:30] [INFO ] Redundant transitions in 21 ms returned []
// Phase 1: matrix 1201 rows 1250 cols
[2022-05-19 06:40:30] [INFO ] Computed 450 place invariants in 12 ms
[2022-05-19 06:40:30] [INFO ] Dead Transitions using invariants and state equation in 692 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1250/1250 places, 1201/1201 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p1) p2), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 p3)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND p3 p1)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p3) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p3)), (F (AND p1 (NOT p3))), (F (AND p0 (NOT p2) (NOT p3))), (F (AND p0 p1 (NOT p3))), (F (AND p1 p3)), (F (AND p0 (NOT p3))), (F (NOT (AND (NOT p0) (NOT p3)))), (F (AND p0 p3)), (F (AND (NOT p0) (NOT p2) (NOT p3))), (F (AND (NOT p2) p1 (NOT p3)))]
Knowledge based reduction with 7 factoid took 545 ms. Reduced automaton from 8 states, 30 edges and 4 AP to 8 states, 30 edges and 4 AP.
Stuttering acceptance computed with spot in 320 ms :[(OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 361 ms :[(OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 366 ms :[(OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 116 reset in 848 ms.
Product exploration explored 100000 steps with 100 reset in 1020 ms.
Built C files in :
/tmp/ltsmin8486583613619795529
[2022-05-19 06:40:34] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8486583613619795529
Running compilation step : cd /tmp/ltsmin8486583613619795529;'/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'
Compilation finished in 2240 ms.
Running link step : cd /tmp/ltsmin8486583613619795529;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin8486583613619795529;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8850301624689106547.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 1250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 24 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
// Phase 1: matrix 1201 rows 1250 cols
[2022-05-19 06:40:49] [INFO ] Computed 450 place invariants in 3 ms
[2022-05-19 06:40:50] [INFO ] Implicit Places using invariants in 606 ms returned []
// Phase 1: matrix 1201 rows 1250 cols
[2022-05-19 06:40:50] [INFO ] Computed 450 place invariants in 3 ms
[2022-05-19 06:40:51] [INFO ] Implicit Places using invariants and state equation in 1445 ms returned []
Implicit Place search using SMT with State Equation took 2053 ms to find 0 implicit places.
// Phase 1: matrix 1201 rows 1250 cols
[2022-05-19 06:40:51] [INFO ] Computed 450 place invariants in 2 ms
[2022-05-19 06:40:52] [INFO ] Dead Transitions using invariants and state equation in 650 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1250/1250 places, 1201/1201 transitions.
Built C files in :
/tmp/ltsmin15522960182689403282
[2022-05-19 06:40:52] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15522960182689403282
Running compilation step : cd /tmp/ltsmin15522960182689403282;'/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'
Compilation finished in 2179 ms.
Running link step : cd /tmp/ltsmin15522960182689403282;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin15522960182689403282;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17452339909020601604.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 06:41:07] [INFO ] Flatten gal took : 56 ms
[2022-05-19 06:41:07] [INFO ] Flatten gal took : 57 ms
[2022-05-19 06:41:07] [INFO ] Time to serialize gal into /tmp/LTL15435763993220830036.gal : 4 ms
[2022-05-19 06:41:07] [INFO ] Time to serialize properties into /tmp/LTL807641648792254542.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/LTL15435763993220830036.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL807641648792254542.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/LTL1543576...266
Read 1 LTL properties
Checking formula 0 : !((F((X(X(!((F("(((p386==1)&&(p392==1))&&(p402==1))"))U(G("((p1114==1)&&(p1135==1))"))))))||((X("((p581==0)||(p591==0))"))&&("(p991==1...162
Formula 0 simplified : !F(XX!(F"(((p386==1)&&(p392==1))&&(p402==1))" U G"((p1114==1)&&(p1135==1))") | ("(p991==1)" & X"((p581==0)||(p591==0))"))
Detected timeout of ITS tools.
[2022-05-19 06:41:22] [INFO ] Flatten gal took : 59 ms
[2022-05-19 06:41:22] [INFO ] Applying decomposition
[2022-05-19 06:41:22] [INFO ] Flatten gal took : 56 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/graph5456324660210969583.txt' '-o' '/tmp/graph5456324660210969583.bin' '-w' '/tmp/graph5456324660210969583.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5456324660210969583.bin' '-l' '-1' '-v' '-w' '/tmp/graph5456324660210969583.weights' '-q' '0' '-e' '0.001'
[2022-05-19 06:41:22] [INFO ] Decomposing Gal with order
[2022-05-19 06:41:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 06:41:22] [INFO ] Removed a total of 797 redundant transitions.
[2022-05-19 06:41:22] [INFO ] Flatten gal took : 71 ms
[2022-05-19 06:41:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 724 labels/synchronizations in 53 ms.
[2022-05-19 06:41:22] [INFO ] Time to serialize gal into /tmp/LTL38296896750639567.gal : 10 ms
[2022-05-19 06:41:22] [INFO ] Time to serialize properties into /tmp/LTL11340150370620787203.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/LTL38296896750639567.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11340150370620787203.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/LTL3829689...244
Read 1 LTL properties
Checking formula 0 : !((F((X(X(!((F("(((i9.i1.i1.u139.p386==1)&&(i9.i1.i1.u141.p392==1))&&(i9.i1.i1.u144.p402==1))"))U(G("((i26.u402.p1114==1)&&(i27.i0.i1....273
Formula 0 simplified : !F(XX!(F"(((i9.i1.i1.u139.p386==1)&&(i9.i1.i1.u141.p392==1))&&(i9.i1.i1.u144.p402==1))" U G"((i26.u402.p1114==1)&&(i27.i0.i1.u409.p1...255
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2794751965791643811
[2022-05-19 06:41:38] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2794751965791643811
Running compilation step : cd /tmp/ltsmin2794751965791643811;'/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'
Compilation finished in 2246 ms.
Running link step : cd /tmp/ltsmin2794751965791643811;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin2794751965791643811;'/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(X(!(<>((LTLAPp0==true)) U []((LTLAPp1==true)))))||(X((LTLAPp2==true))&&(LTLAPp3==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-050A-LTLFireability-05 finished in 317076 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F((X(p1)||p0))))'
Found a CL insensitive property : ShieldIIPs-PT-050A-LTLFireability-12
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 7 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 50 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
// Phase 1: matrix 1201 rows 1251 cols
[2022-05-19 06:41:53] [INFO ] Computed 451 place invariants in 6 ms
[2022-05-19 06:41:53] [INFO ] Implicit Places using invariants in 645 ms returned [1237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 646 ms to find 1 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 1250/1253 places, 1201/1203 transitions.
Applied a total of 0 rules in 22 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1250/1253 places, 1201/1203 transitions.
Running random walk in product with property : ShieldIIPs-PT-050A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s57 1) (EQ s59 1)) (AND (EQ s513 1) (EQ s523 1) (EQ s527 1))), p1:(OR (AND (EQ s513 1) (EQ s523 1) (EQ s527 1)) (AND (EQ s808 1) (EQ s822 ...], 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 107 reset in 818 ms.
Product exploration explored 100000 steps with 106 reset in 1001 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 (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 2 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 937 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=104 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
// Phase 1: matrix 1201 rows 1250 cols
[2022-05-19 06:41:56] [INFO ] Computed 450 place invariants in 3 ms
[2022-05-19 06:41:57] [INFO ] [Real]Absence check using 450 positive place invariants in 367 ms returned sat
[2022-05-19 06:41:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 06:42:01] [INFO ] [Real]Absence check using state equation in 4220 ms returned sat
[2022-05-19 06:42:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 06:42:02] [INFO ] [Nat]Absence check using 450 positive place invariants in 267 ms returned sat
[2022-05-19 06:42:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 06:42:06] [INFO ] [Nat]Absence check using state equation in 3383 ms returned sat
[2022-05-19 06:42:06] [INFO ] Computed and/alt/rep : 1102/3821/1102 causal constraints (skipped 98 transitions) in 63 ms.
[2022-05-19 06:42:16] [INFO ] Added : 515 causal constraints over 103 iterations in 10410 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 7 out of 1250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 26 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
// Phase 1: matrix 1201 rows 1250 cols
[2022-05-19 06:42:16] [INFO ] Computed 450 place invariants in 6 ms
[2022-05-19 06:42:17] [INFO ] Implicit Places using invariants in 633 ms returned []
// Phase 1: matrix 1201 rows 1250 cols
[2022-05-19 06:42:17] [INFO ] Computed 450 place invariants in 2 ms
[2022-05-19 06:42:18] [INFO ] Implicit Places using invariants and state equation in 1457 ms returned []
Implicit Place search using SMT with State Equation took 2090 ms to find 0 implicit places.
[2022-05-19 06:42:18] [INFO ] Redundant transitions in 119 ms returned [1195]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1200 rows 1250 cols
[2022-05-19 06:42:18] [INFO ] Computed 450 place invariants in 2 ms
[2022-05-19 06:42:19] [INFO ] Dead Transitions using invariants and state equation in 657 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1250 places, 1200/1201 transitions.
Applied a total of 0 rules in 23 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1250/1250 places, 1200/1201 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 (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 1103 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=100 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
// Phase 1: matrix 1200 rows 1250 cols
[2022-05-19 06:42:20] [INFO ] Computed 450 place invariants in 2 ms
[2022-05-19 06:42:21] [INFO ] [Real]Absence check using 450 positive place invariants in 337 ms returned sat
[2022-05-19 06:42:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 06:42:25] [INFO ] [Real]Absence check using state equation in 3823 ms returned sat
[2022-05-19 06:42:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 06:42:26] [INFO ] [Nat]Absence check using 450 positive place invariants in 273 ms returned sat
[2022-05-19 06:42:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 06:42:29] [INFO ] [Nat]Absence check using state equation in 3011 ms returned sat
[2022-05-19 06:42:29] [INFO ] Computed and/alt/rep : 1102/3826/1102 causal constraints (skipped 97 transitions) in 62 ms.
[2022-05-19 06:42:40] [INFO ] Added : 495 causal constraints over 99 iterations in 10804 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 109 reset in 803 ms.
Product exploration explored 100000 steps with 106 reset in 981 ms.
Built C files in :
/tmp/ltsmin3921467047893378311
[2022-05-19 06:42:42] [INFO ] Computing symmetric may disable matrix : 1200 transitions.
[2022-05-19 06:42:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 06:42:42] [INFO ] Computing symmetric may enable matrix : 1200 transitions.
[2022-05-19 06:42:42] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 06:42:42] [INFO ] Computing Do-Not-Accords matrix : 1200 transitions.
[2022-05-19 06:42:42] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 06:42:42] [INFO ] Built C files in 124ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3921467047893378311
Running compilation step : cd /tmp/ltsmin3921467047893378311;'/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/ltsmin3921467047893378311;'/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/ltsmin3921467047893378311;'/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 7 out of 1250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1250/1250 places, 1200/1200 transitions.
Applied a total of 0 rules in 40 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
// Phase 1: matrix 1200 rows 1250 cols
[2022-05-19 06:42:45] [INFO ] Computed 450 place invariants in 5 ms
[2022-05-19 06:42:45] [INFO ] Implicit Places using invariants in 626 ms returned []
// Phase 1: matrix 1200 rows 1250 cols
[2022-05-19 06:42:45] [INFO ] Computed 450 place invariants in 2 ms
[2022-05-19 06:42:47] [INFO ] Implicit Places using invariants and state equation in 1488 ms returned []
Implicit Place search using SMT with State Equation took 2116 ms to find 0 implicit places.
[2022-05-19 06:42:47] [INFO ] Redundant transitions in 112 ms returned []
// Phase 1: matrix 1200 rows 1250 cols
[2022-05-19 06:42:47] [INFO ] Computed 450 place invariants in 5 ms
[2022-05-19 06:42:48] [INFO ] Dead Transitions using invariants and state equation in 681 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1250/1250 places, 1200/1200 transitions.
Built C files in :
/tmp/ltsmin2748661544924133131
[2022-05-19 06:42:48] [INFO ] Computing symmetric may disable matrix : 1200 transitions.
[2022-05-19 06:42:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 06:42:48] [INFO ] Computing symmetric may enable matrix : 1200 transitions.
[2022-05-19 06:42:48] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 06:42:48] [INFO ] Computing Do-Not-Accords matrix : 1200 transitions.
[2022-05-19 06:42:48] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 06:42:48] [INFO ] Built C files in 129ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2748661544924133131
Running compilation step : cd /tmp/ltsmin2748661544924133131;'/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/ltsmin2748661544924133131;'/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/ltsmin2748661544924133131;'/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-19 06:42:51] [INFO ] Flatten gal took : 54 ms
[2022-05-19 06:42:51] [INFO ] Flatten gal took : 54 ms
[2022-05-19 06:42:51] [INFO ] Time to serialize gal into /tmp/LTL3201014647436283961.gal : 4 ms
[2022-05-19 06:42:51] [INFO ] Time to serialize properties into /tmp/LTL5273506145817367846.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/LTL3201014647436283961.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5273506145817367846.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/LTL3201014...266
Read 1 LTL properties
Checking formula 0 : !((F(F(((X("((((p513==1)&&(p523==1))&&(p527==1))||((p808==1)&&(p822==1)))"))||("((p57==1)&&(p59==1))"))||("(((p513==1)&&(p523==1))&&(p...169
Formula 0 simplified : !F("(((p513==1)&&(p523==1))&&(p527==1))" | "((p57==1)&&(p59==1))" | X"((((p513==1)&&(p523==1))&&(p527==1))||((p808==1)&&(p822==1)))"...156
Detected timeout of ITS tools.
[2022-05-19 06:43:06] [INFO ] Flatten gal took : 55 ms
[2022-05-19 06:43:06] [INFO ] Applying decomposition
[2022-05-19 06:43:06] [INFO ] Flatten gal took : 53 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/graph3759190814670015253.txt' '-o' '/tmp/graph3759190814670015253.bin' '-w' '/tmp/graph3759190814670015253.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3759190814670015253.bin' '-l' '-1' '-v' '-w' '/tmp/graph3759190814670015253.weights' '-q' '0' '-e' '0.001'
[2022-05-19 06:43:06] [INFO ] Decomposing Gal with order
[2022-05-19 06:43:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 06:43:06] [INFO ] Removed a total of 795 redundant transitions.
[2022-05-19 06:43:06] [INFO ] Flatten gal took : 67 ms
[2022-05-19 06:43:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 748 labels/synchronizations in 54 ms.
[2022-05-19 06:43:06] [INFO ] Time to serialize gal into /tmp/LTL11201569302043812449.gal : 9 ms
[2022-05-19 06:43:06] [INFO ] Time to serialize properties into /tmp/LTL461686374721669548.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/LTL11201569302043812449.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL461686374721669548.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/LTL1120156...245
Read 1 LTL properties
Checking formula 0 : !((F(F(((X("((((i10.i1.i2.u185.p513==1)&&(i10.i1.i2.u188.p523==1))&&(i10.i1.i2.u189.p527==1))||((i18.i0.i1.u291.p808==1)&&(i18.i0.i1.u...315
Formula 0 simplified : !F("(((i10.i1.i2.u185.p513==1)&&(i10.i1.i2.u188.p523==1))&&(i10.i1.i2.u189.p527==1))" | "((i1.i1.i0.u20.p57==1)&&(i1.i1.i2.u21.p59==...302
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12945596528779616516
[2022-05-19 06:43:21] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12945596528779616516
Running compilation step : cd /tmp/ltsmin12945596528779616516;'/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'
Compilation finished in 2225 ms.
Running link step : cd /tmp/ltsmin12945596528779616516;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin12945596528779616516;'/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((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-050A-LTLFireability-12 finished in 103866 ms.
[2022-05-19 06:43:37] [INFO ] Flatten gal took : 56 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16858799297348185233
[2022-05-19 06:43:37] [INFO ] Computing symmetric may disable matrix : 1203 transitions.
[2022-05-19 06:43:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 06:43:37] [INFO ] Computing symmetric may enable matrix : 1203 transitions.
[2022-05-19 06:43:37] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 06:43:37] [INFO ] Applying decomposition
[2022-05-19 06:43:37] [INFO ] Flatten gal took : 53 ms
[2022-05-19 06:43:37] [INFO ] Computing Do-Not-Accords matrix : 1203 transitions.
[2022-05-19 06:43:37] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 06:43:37] [INFO ] Built C files in 135ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16858799297348185233
Running compilation step : cd /tmp/ltsmin16858799297348185233;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '180' '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'
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/graph17536317862685847944.txt' '-o' '/tmp/graph17536317862685847944.bin' '-w' '/tmp/graph17536317862685847944.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17536317862685847944.bin' '-l' '-1' '-v' '-w' '/tmp/graph17536317862685847944.weights' '-q' '0' '-e' '0.001'
[2022-05-19 06:43:37] [INFO ] Decomposing Gal with order
[2022-05-19 06:43:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 06:43:37] [INFO ] Removed a total of 800 redundant transitions.
[2022-05-19 06:43:37] [INFO ] Flatten gal took : 66 ms
[2022-05-19 06:43:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 744 labels/synchronizations in 54 ms.
[2022-05-19 06:43:37] [INFO ] Time to serialize gal into /tmp/LTLFireability15406741662349542331.gal : 9 ms
[2022-05-19 06:43:37] [INFO ] Time to serialize properties into /tmp/LTLFireability1664277943081639680.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/LTLFireability15406741662349542331.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1664277943081639680.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/LTLFireabi...268
Read 4 LTL properties
Checking formula 0 : !((F((!((!(F(X(!(F("((i19.i1.i1.u348.p964==1)&&(i20.u355.p985==1))"))))))U(G("(i23.u404.p1121==1)"))))&&("((i6.u110.p306==0)||(i6.u114...170
Formula 0 simplified : !F("((i6.u110.p306==0)||(i6.u114.p317==0))" & !(!FX!F"((i19.i1.i1.u348.p964==1)&&(i20.u355.p985==1))" U G"(i23.u404.p1121==1)"))
Compilation finished in 3785 ms.
Running link step : cd /tmp/ltsmin16858799297348185233;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin16858799297348185233;'/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(!<>((LTLAPp0==true)))) U []((LTLAPp1==true)))&&(LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin16858799297348185233;'/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(!<>((LTLAPp0==true)))) U []((LTLAPp1==true)))&&(LTLAPp2==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin16858799297348185233;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-19 07:09:45] [INFO ] Applying decomposition
[2022-05-19 07:09:46] [INFO ] Flatten gal took : 343 ms
[2022-05-19 07:09:46] [INFO ] Decomposing Gal with order
[2022-05-19 07:09:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 07:09:47] [INFO ] Removed a total of 850 redundant transitions.
[2022-05-19 07:09:47] [INFO ] Flatten gal took : 539 ms
[2022-05-19 07:09:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 282 ms.
[2022-05-19 07:09:47] [INFO ] Time to serialize gal into /tmp/LTLFireability16137015780394072338.gal : 56 ms
[2022-05-19 07:09:47] [INFO ] Time to serialize properties into /tmp/LTLFireability11605582247191164870.ltl : 10 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/LTLFireability16137015780394072338.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11605582247191164870.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/LTLFireabi...269
Read 4 LTL properties
Checking formula 0 : !((F((!((!(F(X(!(F("((u388.p964==1)&&(u396.p985==1))"))))))U(G("(u450.p1121==1)"))))&&("((i98.u124.p306==0)||(u128.p317==0))"))))
Formula 0 simplified : !F("((i98.u124.p306==0)||(u128.p317==0))" & !(!FX!F"((u388.p964==1)&&(u396.p985==1))" U G"(u450.p1121==1)"))
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin16858799297348185233;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin16858799297348185233;'/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(X(!(<>((LTLAPp4==true)) U []((LTLAPp5==true)))))||(X((LTLAPp6==true))&&(LTLAPp7==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.001: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.307: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.307: LTL layer: formula: <>((X(X(!(<>((LTLAPp4==true)) U []((LTLAPp5==true)))))||(X((LTLAPp6==true))&&(LTLAPp7==true))))
pins2lts-mc-linux64( 1/ 8), 0.308: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.315: "<>((X(X(!(<>((LTLAPp4==true)) U []((LTLAPp5==true)))))||(X((LTLAPp6==true))&&(LTLAPp7==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.317: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.319: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.319: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.321: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.334: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.350: buchi has 9 states
pins2lts-mc-linux64( 7/ 8), 0.351: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.362: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.389: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.530: DFS-FIFO for weak LTL, using special progress label 1214
pins2lts-mc-linux64( 0/ 8), 0.530: There are 1215 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.530: State length is 1254, there are 1237 groups
pins2lts-mc-linux64( 0/ 8), 0.530: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.530: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.530: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.530: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.634: ~1 levels ~960 states ~4120 transitions
pins2lts-mc-linux64( 7/ 8), 0.721: ~1 levels ~1920 states ~9104 transitions
pins2lts-mc-linux64( 7/ 8), 0.870: ~1 levels ~3840 states ~19560 transitions
pins2lts-mc-linux64( 7/ 8), 1.182: ~1 levels ~7680 states ~41640 transitions
pins2lts-mc-linux64( 7/ 8), 1.789: ~1 levels ~15360 states ~85856 transitions
pins2lts-mc-linux64( 7/ 8), 2.917: ~1 levels ~30720 states ~180776 transitions
pins2lts-mc-linux64( 7/ 8), 5.153: ~1 levels ~61440 states ~379312 transitions
pins2lts-mc-linux64( 4/ 8), 9.566: ~1 levels ~122880 states ~794112 transitions
pins2lts-mc-linux64( 4/ 8), 18.242: ~1 levels ~245760 states ~1663816 transitions
pins2lts-mc-linux64( 4/ 8), 35.277: ~1 levels ~491520 states ~3454304 transitions
pins2lts-mc-linux64( 2/ 8), 69.139: ~1 levels ~983040 states ~7321688 transitions
pins2lts-mc-linux64( 1/ 8), 136.566: ~1 levels ~1966080 states ~15288072 transitions
pins2lts-mc-linux64( 4/ 8), 274.339: ~1 levels ~3932160 states ~31851128 transitions
pins2lts-mc-linux64( 2/ 8), 425.329: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 425.436:
pins2lts-mc-linux64( 0/ 8), 425.436: mean standard work distribution: 0.7% (states) 1.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 425.436:
pins2lts-mc-linux64( 0/ 8), 425.436: Explored 5985884 states 50306984 transitions, fanout: 8.404
pins2lts-mc-linux64( 0/ 8), 425.436: Total exploration time 424.900 sec (424.800 sec minimum, 424.849 sec on average)
pins2lts-mc-linux64( 0/ 8), 425.436: States per second: 14088, Transitions per second: 118397
pins2lts-mc-linux64( 0/ 8), 425.436:
pins2lts-mc-linux64( 0/ 8), 425.436: Progress states detected: 10053214
pins2lts-mc-linux64( 0/ 8), 425.436: Redundant explorations: -40.4582
pins2lts-mc-linux64( 0/ 8), 425.436:
pins2lts-mc-linux64( 0/ 8), 425.436: Queue width: 8B, total height: 6972023, memory: 53.19MB
pins2lts-mc-linux64( 0/ 8), 425.436: Tree memory: 332.7MB, 34.7 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 425.436: Tree fill ratio (roots/leafs): 7.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 425.436: Stored 1230 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 425.436: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 425.436: Est. total memory use: 385.9MB (~1077.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16858799297348185233;'/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(X(!(<>((LTLAPp4==true)) U []((LTLAPp5==true)))))||(X((LTLAPp6==true))&&(LTLAPp7==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16858799297348185233;'/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(X(!(<>((LTLAPp4==true)) U []((LTLAPp5==true)))))||(X((LTLAPp6==true))&&(LTLAPp7==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)

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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="ShieldIIPs-PT-050A"
export BK_EXAMINATION="LTLFireability"
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 ShieldIIPs-PT-050A, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286024800148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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