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-165286025900859.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 ShieldRVs-PT-050B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025900859
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 840K
-rw-r--r-- 1 mcc users 6.5K Apr 30 06:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 30 06:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 30 06:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 30 06:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 08:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:59 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 625K 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 ShieldRVs-PT-050B-LTLCardinality-00
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-01
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-02
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-03
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-04
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-05
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-06
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-07
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-08
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-09
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-10
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-11
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-12
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-13
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-14
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653065197110

Running Version 202205111006
[2022-05-20 16:46:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 16:46:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 16:46:38] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2022-05-20 16:46:38] [INFO ] Transformed 2003 places.
[2022-05-20 16:46:38] [INFO ] Transformed 2253 transitions.
[2022-05-20 16:46:38] [INFO ] Found NUPN structural information;
[2022-05-20 16:46:38] [INFO ] Parsed PT model containing 2003 places and 2253 transitions in 316 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldRVs-PT-050B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 2003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2003/2003 places, 2253/2253 transitions.
Discarding 339 places :
Symmetric choice reduction at 0 with 339 rule applications. Total rules 339 place count 1664 transition count 1914
Iterating global reduction 0 with 339 rules applied. Total rules applied 678 place count 1664 transition count 1914
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 679 place count 1663 transition count 1913
Iterating global reduction 0 with 1 rules applied. Total rules applied 680 place count 1663 transition count 1913
Applied a total of 680 rules in 459 ms. Remains 1663 /2003 variables (removed 340) and now considering 1913/2253 (removed 340) transitions.
// Phase 1: matrix 1913 rows 1663 cols
[2022-05-20 16:46:39] [INFO ] Computed 201 place invariants in 26 ms
[2022-05-20 16:46:39] [INFO ] Implicit Places using invariants in 679 ms returned []
// Phase 1: matrix 1913 rows 1663 cols
[2022-05-20 16:46:39] [INFO ] Computed 201 place invariants in 9 ms
[2022-05-20 16:46:41] [INFO ] Implicit Places using invariants and state equation in 1844 ms returned []
Implicit Place search using SMT with State Equation took 2550 ms to find 0 implicit places.
// Phase 1: matrix 1913 rows 1663 cols
[2022-05-20 16:46:41] [INFO ] Computed 201 place invariants in 12 ms
[2022-05-20 16:46:42] [INFO ] Dead Transitions using invariants and state equation in 962 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1663/2003 places, 1913/2253 transitions.
Finished structural reductions, in 1 iterations. Remains : 1663/2003 places, 1913/2253 transitions.
Support contains 33 out of 1663 places after structural reductions.
[2022-05-20 16:46:43] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-20 16:46:43] [INFO ] Flatten gal took : 200 ms
FORMULA ShieldRVs-PT-050B-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 16:46:43] [INFO ] Flatten gal took : 113 ms
[2022-05-20 16:46:43] [INFO ] Input system was already deterministic with 1913 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 503 ms. (steps per millisecond=19 ) properties (out of 21) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1913 rows 1663 cols
[2022-05-20 16:46:44] [INFO ] Computed 201 place invariants in 7 ms
[2022-05-20 16:46:44] [INFO ] After 423ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-20 16:46:45] [INFO ] [Nat]Absence check using 201 positive place invariants in 70 ms returned sat
[2022-05-20 16:46:46] [INFO ] After 975ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :3
[2022-05-20 16:46:46] [INFO ] Deduced a trap composed of 31 places in 304 ms of which 5 ms to minimize.
[2022-05-20 16:46:46] [INFO ] Deduced a trap composed of 24 places in 332 ms of which 2 ms to minimize.
[2022-05-20 16:46:47] [INFO ] Deduced a trap composed of 47 places in 280 ms of which 2 ms to minimize.
[2022-05-20 16:46:47] [INFO ] Deduced a trap composed of 33 places in 328 ms of which 2 ms to minimize.
[2022-05-20 16:46:48] [INFO ] Deduced a trap composed of 28 places in 297 ms of which 1 ms to minimize.
[2022-05-20 16:46:48] [INFO ] Deduced a trap composed of 35 places in 238 ms of which 1 ms to minimize.
[2022-05-20 16:46:48] [INFO ] Deduced a trap composed of 18 places in 209 ms of which 1 ms to minimize.
[2022-05-20 16:46:48] [INFO ] Deduced a trap composed of 26 places in 230 ms of which 1 ms to minimize.
[2022-05-20 16:46:49] [INFO ] Deduced a trap composed of 41 places in 207 ms of which 0 ms to minimize.
[2022-05-20 16:46:49] [INFO ] Deduced a trap composed of 66 places in 186 ms of which 1 ms to minimize.
[2022-05-20 16:46:49] [INFO ] Deduced a trap composed of 50 places in 163 ms of which 1 ms to minimize.
[2022-05-20 16:46:49] [INFO ] Deduced a trap composed of 70 places in 173 ms of which 0 ms to minimize.
[2022-05-20 16:46:50] [INFO ] Deduced a trap composed of 69 places in 159 ms of which 1 ms to minimize.
[2022-05-20 16:46:50] [INFO ] Deduced a trap composed of 67 places in 184 ms of which 0 ms to minimize.
[2022-05-20 16:46:50] [INFO ] Deduced a trap composed of 55 places in 158 ms of which 0 ms to minimize.
[2022-05-20 16:46:50] [INFO ] Deduced a trap composed of 64 places in 145 ms of which 1 ms to minimize.
[2022-05-20 16:46:51] [INFO ] Deduced a trap composed of 54 places in 240 ms of which 1 ms to minimize.
[2022-05-20 16:46:51] [INFO ] Deduced a trap composed of 38 places in 233 ms of which 0 ms to minimize.
[2022-05-20 16:46:51] [INFO ] Deduced a trap composed of 66 places in 151 ms of which 1 ms to minimize.
[2022-05-20 16:46:51] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 5571 ms
[2022-05-20 16:46:52] [INFO ] Deduced a trap composed of 23 places in 231 ms of which 0 ms to minimize.
[2022-05-20 16:46:52] [INFO ] Deduced a trap composed of 32 places in 224 ms of which 0 ms to minimize.
[2022-05-20 16:46:52] [INFO ] Deduced a trap composed of 34 places in 170 ms of which 1 ms to minimize.
[2022-05-20 16:46:52] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 1 ms to minimize.
[2022-05-20 16:46:53] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 0 ms to minimize.
[2022-05-20 16:46:53] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 0 ms to minimize.
[2022-05-20 16:46:53] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 0 ms to minimize.
[2022-05-20 16:46:53] [INFO ] Deduced a trap composed of 35 places in 147 ms of which 1 ms to minimize.
[2022-05-20 16:46:53] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 0 ms to minimize.
[2022-05-20 16:46:54] [INFO ] Deduced a trap composed of 52 places in 155 ms of which 0 ms to minimize.
[2022-05-20 16:46:54] [INFO ] Deduced a trap composed of 53 places in 144 ms of which 0 ms to minimize.
[2022-05-20 16:46:54] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2615 ms
[2022-05-20 16:46:54] [INFO ] Deduced a trap composed of 50 places in 153 ms of which 1 ms to minimize.
[2022-05-20 16:46:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 282 ms
[2022-05-20 16:46:54] [INFO ] After 9655ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :3
Attempting to minimize the solution found.
Minimization took 195 ms.
[2022-05-20 16:46:54] [INFO ] After 10401ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :3
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 157 ms.
Support contains 4 out of 1663 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1663/1663 places, 1913/1913 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 1663 transition count 1713
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 1463 transition count 1713
Performed 249 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 249 Pre rules applied. Total rules applied 400 place count 1463 transition count 1464
Deduced a syphon composed of 249 places in 2 ms
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 2 with 498 rules applied. Total rules applied 898 place count 1214 transition count 1464
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 906 place count 1206 transition count 1456
Iterating global reduction 2 with 8 rules applied. Total rules applied 914 place count 1206 transition count 1456
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 914 place count 1206 transition count 1455
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 916 place count 1205 transition count 1455
Performed 498 Post agglomeration using F-continuation condition.Transition count delta: 498
Deduced a syphon composed of 498 places in 4 ms
Reduce places removed 498 places and 0 transitions.
Iterating global reduction 2 with 996 rules applied. Total rules applied 1912 place count 707 transition count 957
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 102 times.
Drop transitions removed 102 transitions
Iterating global reduction 2 with 102 rules applied. Total rules applied 2014 place count 707 transition count 957
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2015 place count 706 transition count 956
Applied a total of 2015 rules in 400 ms. Remains 706 /1663 variables (removed 957) and now considering 956/1913 (removed 957) transitions.
Finished structural reductions, in 1 iterations. Remains : 706/1663 places, 956/1913 transitions.
Finished random walk after 4866 steps, including 8 resets, run visited all 3 properties in 63 ms. (steps per millisecond=77 )
FORMULA ShieldRVs-PT-050B-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 8 simplifications.
FORMULA ShieldRVs-PT-050B-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 402 stabilizing places and 402 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))||(X(p1)&&X(p2))))'
Support contains 4 out of 1663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1663/1663 places, 1913/1913 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1653 transition count 1903
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1653 transition count 1903
Applied a total of 20 rules in 289 ms. Remains 1653 /1663 variables (removed 10) and now considering 1903/1913 (removed 10) transitions.
// Phase 1: matrix 1903 rows 1653 cols
[2022-05-20 16:46:56] [INFO ] Computed 201 place invariants in 11 ms
[2022-05-20 16:46:56] [INFO ] Implicit Places using invariants in 456 ms returned []
// Phase 1: matrix 1903 rows 1653 cols
[2022-05-20 16:46:56] [INFO ] Computed 201 place invariants in 8 ms
[2022-05-20 16:46:58] [INFO ] Implicit Places using invariants and state equation in 1767 ms returned []
Implicit Place search using SMT with State Equation took 2226 ms to find 0 implicit places.
// Phase 1: matrix 1903 rows 1653 cols
[2022-05-20 16:46:58] [INFO ] Computed 201 place invariants in 9 ms
[2022-05-20 16:46:59] [INFO ] Dead Transitions using invariants and state equation in 925 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1653/1663 places, 1903/1913 transitions.
Finished structural reductions, in 1 iterations. Remains : 1653/1663 places, 1903/1913 transitions.
Stuttering acceptance computed with spot in 258 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s301 0) (EQ s1641 1)), p1:(OR (EQ s1379 0) (EQ s271 1)), p2:(OR (EQ s1641 0) (EQ s301 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1103 ms.
Product exploration explored 100000 steps with 50000 reset in 971 ms.
Computed a total of 400 stabilizing places and 400 stable transitions
Computed a total of 400 stabilizing places and 400 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))
Knowledge based reduction with 5 factoid took 107 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldRVs-PT-050B-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-050B-LTLCardinality-00 finished in 5979 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 1663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1663/1663 places, 1913/1913 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 1662 transition count 1712
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 1462 transition count 1712
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 400 place count 1462 transition count 1462
Deduced a syphon composed of 250 places in 3 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 900 place count 1212 transition count 1462
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 910 place count 1202 transition count 1452
Iterating global reduction 2 with 10 rules applied. Total rules applied 920 place count 1202 transition count 1452
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 920 place count 1202 transition count 1451
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 922 place count 1201 transition count 1451
Performed 493 Post agglomeration using F-continuation condition.Transition count delta: 493
Deduced a syphon composed of 493 places in 1 ms
Reduce places removed 493 places and 0 transitions.
Iterating global reduction 2 with 986 rules applied. Total rules applied 1908 place count 708 transition count 958
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1910 place count 706 transition count 956
Applied a total of 1910 rules in 342 ms. Remains 706 /1663 variables (removed 957) and now considering 956/1913 (removed 957) transitions.
// Phase 1: matrix 956 rows 706 cols
[2022-05-20 16:47:02] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 16:47:02] [INFO ] Implicit Places using invariants in 279 ms returned []
// Phase 1: matrix 956 rows 706 cols
[2022-05-20 16:47:02] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:47:03] [INFO ] Implicit Places using invariants and state equation in 694 ms returned []
Implicit Place search using SMT with State Equation took 978 ms to find 0 implicit places.
[2022-05-20 16:47:03] [INFO ] Redundant transitions in 203 ms returned [955]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 955 rows 706 cols
[2022-05-20 16:47:03] [INFO ] Computed 201 place invariants in 3 ms
[2022-05-20 16:47:03] [INFO ] Dead Transitions using invariants and state equation in 400 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 706/1663 places, 955/1913 transitions.
Applied a total of 0 rules in 27 ms. Remains 706 /706 variables (removed 0) and now considering 955/955 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 706/1663 places, 955/1913 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s686 0) (EQ s61 1) (OR (EQ s1 0) (EQ s1 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 4958 steps with 368 reset in 36 ms.
FORMULA ShieldRVs-PT-050B-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLCardinality-02 finished in 2050 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(G(p0)))))'
Support contains 2 out of 1663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1663/1663 places, 1913/1913 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1652 transition count 1902
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1652 transition count 1902
Applied a total of 22 rules in 114 ms. Remains 1652 /1663 variables (removed 11) and now considering 1902/1913 (removed 11) transitions.
// Phase 1: matrix 1902 rows 1652 cols
[2022-05-20 16:47:04] [INFO ] Computed 201 place invariants in 19 ms
[2022-05-20 16:47:04] [INFO ] Implicit Places using invariants in 451 ms returned []
// Phase 1: matrix 1902 rows 1652 cols
[2022-05-20 16:47:04] [INFO ] Computed 201 place invariants in 8 ms
[2022-05-20 16:47:06] [INFO ] Implicit Places using invariants and state equation in 1824 ms returned []
Implicit Place search using SMT with State Equation took 2277 ms to find 0 implicit places.
// Phase 1: matrix 1902 rows 1652 cols
[2022-05-20 16:47:06] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 16:47:07] [INFO ] Dead Transitions using invariants and state equation in 969 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1652/1663 places, 1902/1913 transitions.
Finished structural reductions, in 1 iterations. Remains : 1652/1663 places, 1902/1913 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s761 0) (EQ s1522 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 517 steps with 0 reset in 5 ms.
FORMULA ShieldRVs-PT-050B-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLCardinality-10 finished in 3524 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1663/1663 places, 1913/1913 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1652 transition count 1902
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1652 transition count 1902
Applied a total of 22 rules in 119 ms. Remains 1652 /1663 variables (removed 11) and now considering 1902/1913 (removed 11) transitions.
// Phase 1: matrix 1902 rows 1652 cols
[2022-05-20 16:47:07] [INFO ] Computed 201 place invariants in 10 ms
[2022-05-20 16:47:08] [INFO ] Implicit Places using invariants in 463 ms returned []
// Phase 1: matrix 1902 rows 1652 cols
[2022-05-20 16:47:08] [INFO ] Computed 201 place invariants in 6 ms
[2022-05-20 16:47:09] [INFO ] Implicit Places using invariants and state equation in 1841 ms returned []
Implicit Place search using SMT with State Equation took 2309 ms to find 0 implicit places.
// Phase 1: matrix 1902 rows 1652 cols
[2022-05-20 16:47:09] [INFO ] Computed 201 place invariants in 13 ms
[2022-05-20 16:47:10] [INFO ] Dead Transitions using invariants and state equation in 952 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1652/1663 places, 1902/1913 transitions.
Finished structural reductions, in 1 iterations. Remains : 1652/1663 places, 1902/1913 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s157 0) (EQ s1451 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1896 steps with 0 reset in 17 ms.
FORMULA ShieldRVs-PT-050B-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLCardinality-12 finished in 3529 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(X((X(F(p0))&&p1))))&&G(F(p2))))'
Support contains 6 out of 1663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1663/1663 places, 1913/1913 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1654 transition count 1904
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1654 transition count 1904
Applied a total of 18 rules in 116 ms. Remains 1654 /1663 variables (removed 9) and now considering 1904/1913 (removed 9) transitions.
// Phase 1: matrix 1904 rows 1654 cols
[2022-05-20 16:47:11] [INFO ] Computed 201 place invariants in 12 ms
[2022-05-20 16:47:11] [INFO ] Implicit Places using invariants in 447 ms returned []
// Phase 1: matrix 1904 rows 1654 cols
[2022-05-20 16:47:11] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 16:47:13] [INFO ] Implicit Places using invariants and state equation in 2095 ms returned []
Implicit Place search using SMT with State Equation took 2544 ms to find 0 implicit places.
// Phase 1: matrix 1904 rows 1654 cols
[2022-05-20 16:47:13] [INFO ] Computed 201 place invariants in 9 ms
[2022-05-20 16:47:14] [INFO ] Dead Transitions using invariants and state equation in 944 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1654/1663 places, 1904/1913 transitions.
Finished structural reductions, in 1 iterations. Remains : 1654/1663 places, 1904/1913 transitions.
Stuttering acceptance computed with spot in 1339 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 5}, { cond=p1, acceptance={} source=2 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}, { cond=p1, acceptance={0} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(OR (EQ s794 0) (EQ s831 1)), p1:(OR (EQ s331 0) (EQ s316 1)), p0:(AND (EQ s833 0) (EQ s1215 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]]
Stuttering criterion allowed to conclude after 3814 steps with 2 reset in 20 ms.
FORMULA ShieldRVs-PT-050B-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLCardinality-14 finished in 5000 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((p0 U (X(X(!p1)) U (G(p2)&&X(p3)))))))'
Support contains 7 out of 1663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1663/1663 places, 1913/1913 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1655 transition count 1905
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1655 transition count 1905
Applied a total of 16 rules in 115 ms. Remains 1655 /1663 variables (removed 8) and now considering 1905/1913 (removed 8) transitions.
// Phase 1: matrix 1905 rows 1655 cols
[2022-05-20 16:47:16] [INFO ] Computed 201 place invariants in 14 ms
[2022-05-20 16:47:16] [INFO ] Implicit Places using invariants in 447 ms returned []
// Phase 1: matrix 1905 rows 1655 cols
[2022-05-20 16:47:16] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 16:47:18] [INFO ] Implicit Places using invariants and state equation in 1748 ms returned []
Implicit Place search using SMT with State Equation took 2198 ms to find 0 implicit places.
// Phase 1: matrix 1905 rows 1655 cols
[2022-05-20 16:47:18] [INFO ] Computed 201 place invariants in 14 ms
[2022-05-20 16:47:19] [INFO ] Dead Transitions using invariants and state equation in 910 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1655/1663 places, 1905/1913 transitions.
Finished structural reductions, in 1 iterations. Remains : 1655/1663 places, 1905/1913 transitions.
Stuttering acceptance computed with spot in 1041 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3) p1), (OR (NOT p2) (NOT p3)), (NOT p2), (NOT p3), (NOT p2), (NOT p3), p1, true, (AND (NOT p2) p1), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-050B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(AND p2 p0), acceptance={} source=1 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 4}, { cond=p2, acceptance={0} source=2 dest: 5}, { cond=true, acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND p2 p0), acceptance={} source=3 dest: 6}, { cond=(AND p2 p0), acceptance={0} source=3 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 8}, { cond=p2, acceptance={} source=4 dest: 10}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=5 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={0} source=5 dest: 5}, { cond=(AND p2 (NOT p3)), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=6 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND p2 p0), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p3)), acceptance={0} source=7 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p3)), acceptance={} source=7 dest: 4}, { cond=(AND p2 (NOT p0) (NOT p3)), acceptance={} source=7 dest: 5}, { cond=(AND p2 p0 (NOT p3)), acceptance={} source=7 dest: 6}, { cond=(AND p2 p0 (NOT p3)), acceptance={0} source=7 dest: 7}], [{ cond=p1, acceptance={} source=8 dest: 9}], [{ cond=true, acceptance={0} source=9 dest: 9}], [{ cond=(AND (NOT p2) p1), acceptance={} source=10 dest: 9}, { cond=(AND p2 p1), acceptance={} source=10 dest: 11}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=11 dest: 9}, { cond=(AND p2 (NOT p1)), acceptance={} source=11 dest: 11}]], initial=0, aps=[p2:(OR (EQ s1569 0) (EQ s937 1)), p0:(NEQ s957 1), p3:(OR (EQ s402 0) (EQ s1524 1)), p1:(OR (EQ s230 0) (EQ s182 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, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25011 reset in 602 ms.
Product exploration explored 100000 steps with 24943 reset in 557 ms.
Computed a total of 399 stabilizing places and 399 stable transitions
Computed a total of 399 stabilizing places and 399 stable transitions
Knowledge obtained : [(AND p2 p0 p3 p1), (X (AND p2 p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 (NOT p0)))), true, (X (X (NOT (AND (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p2)), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 978 ms. Reduced automaton from 12 states, 41 edges and 4 AP to 12 states, 41 edges and 4 AP.
Stuttering acceptance computed with spot in 526 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3) p1), (OR (NOT p2) (NOT p3)), (NOT p2), (NOT p3), (NOT p2), (NOT p3), p1, true, (AND (NOT p2) p1), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 16) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1905 rows 1655 cols
[2022-05-20 16:47:23] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 16:47:23] [INFO ] After 346ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-20 16:47:24] [INFO ] [Nat]Absence check using 201 positive place invariants in 70 ms returned sat
[2022-05-20 16:47:25] [INFO ] After 1092ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-20 16:47:25] [INFO ] Deduced a trap composed of 23 places in 338 ms of which 1 ms to minimize.
[2022-05-20 16:47:26] [INFO ] Deduced a trap composed of 16 places in 330 ms of which 2 ms to minimize.
[2022-05-20 16:47:26] [INFO ] Deduced a trap composed of 32 places in 316 ms of which 2 ms to minimize.
[2022-05-20 16:47:27] [INFO ] Deduced a trap composed of 22 places in 337 ms of which 0 ms to minimize.
[2022-05-20 16:47:27] [INFO ] Deduced a trap composed of 25 places in 331 ms of which 1 ms to minimize.
[2022-05-20 16:47:27] [INFO ] Deduced a trap composed of 30 places in 318 ms of which 1 ms to minimize.
[2022-05-20 16:47:28] [INFO ] Deduced a trap composed of 25 places in 317 ms of which 1 ms to minimize.
[2022-05-20 16:47:28] [INFO ] Deduced a trap composed of 27 places in 320 ms of which 9 ms to minimize.
[2022-05-20 16:47:28] [INFO ] Deduced a trap composed of 28 places in 307 ms of which 0 ms to minimize.
[2022-05-20 16:47:29] [INFO ] Deduced a trap composed of 38 places in 299 ms of which 1 ms to minimize.
[2022-05-20 16:47:29] [INFO ] Deduced a trap composed of 32 places in 274 ms of which 1 ms to minimize.
[2022-05-20 16:47:29] [INFO ] Deduced a trap composed of 25 places in 279 ms of which 1 ms to minimize.
[2022-05-20 16:47:30] [INFO ] Deduced a trap composed of 41 places in 257 ms of which 0 ms to minimize.
[2022-05-20 16:47:30] [INFO ] Deduced a trap composed of 35 places in 258 ms of which 1 ms to minimize.
[2022-05-20 16:47:30] [INFO ] Deduced a trap composed of 45 places in 251 ms of which 0 ms to minimize.
[2022-05-20 16:47:31] [INFO ] Deduced a trap composed of 42 places in 269 ms of which 1 ms to minimize.
[2022-05-20 16:47:31] [INFO ] Deduced a trap composed of 49 places in 247 ms of which 1 ms to minimize.
[2022-05-20 16:47:31] [INFO ] Deduced a trap composed of 56 places in 233 ms of which 0 ms to minimize.
[2022-05-20 16:47:32] [INFO ] Deduced a trap composed of 35 places in 236 ms of which 2 ms to minimize.
[2022-05-20 16:47:32] [INFO ] Deduced a trap composed of 49 places in 232 ms of which 1 ms to minimize.
[2022-05-20 16:47:32] [INFO ] Deduced a trap composed of 42 places in 229 ms of which 1 ms to minimize.
[2022-05-20 16:47:33] [INFO ] Deduced a trap composed of 39 places in 220 ms of which 1 ms to minimize.
[2022-05-20 16:47:33] [INFO ] Deduced a trap composed of 47 places in 202 ms of which 0 ms to minimize.
[2022-05-20 16:47:33] [INFO ] Deduced a trap composed of 48 places in 224 ms of which 1 ms to minimize.
[2022-05-20 16:47:33] [INFO ] Deduced a trap composed of 52 places in 234 ms of which 3 ms to minimize.
[2022-05-20 16:47:34] [INFO ] Deduced a trap composed of 59 places in 177 ms of which 1 ms to minimize.
[2022-05-20 16:47:34] [INFO ] Deduced a trap composed of 62 places in 176 ms of which 1 ms to minimize.
[2022-05-20 16:47:34] [INFO ] Deduced a trap composed of 64 places in 170 ms of which 0 ms to minimize.
[2022-05-20 16:47:34] [INFO ] Deduced a trap composed of 73 places in 168 ms of which 0 ms to minimize.
[2022-05-20 16:47:35] [INFO ] Deduced a trap composed of 65 places in 179 ms of which 1 ms to minimize.
[2022-05-20 16:47:35] [INFO ] Deduced a trap composed of 63 places in 160 ms of which 1 ms to minimize.
[2022-05-20 16:47:35] [INFO ] Deduced a trap composed of 59 places in 168 ms of which 0 ms to minimize.
[2022-05-20 16:47:35] [INFO ] Deduced a trap composed of 53 places in 153 ms of which 0 ms to minimize.
[2022-05-20 16:47:35] [INFO ] Deduced a trap composed of 59 places in 150 ms of which 1 ms to minimize.
[2022-05-20 16:47:36] [INFO ] Deduced a trap composed of 62 places in 172 ms of which 1 ms to minimize.
[2022-05-20 16:47:36] [INFO ] Deduced a trap composed of 74 places in 169 ms of which 6 ms to minimize.
[2022-05-20 16:47:36] [INFO ] Deduced a trap composed of 76 places in 161 ms of which 0 ms to minimize.
[2022-05-20 16:47:36] [INFO ] Deduced a trap composed of 65 places in 155 ms of which 0 ms to minimize.
[2022-05-20 16:47:37] [INFO ] Deduced a trap composed of 58 places in 137 ms of which 1 ms to minimize.
[2022-05-20 16:47:37] [INFO ] Deduced a trap composed of 67 places in 147 ms of which 0 ms to minimize.
[2022-05-20 16:47:37] [INFO ] Deduced a trap composed of 77 places in 144 ms of which 1 ms to minimize.
[2022-05-20 16:47:37] [INFO ] Deduced a trap composed of 69 places in 133 ms of which 0 ms to minimize.
[2022-05-20 16:47:37] [INFO ] Deduced a trap composed of 80 places in 140 ms of which 0 ms to minimize.
[2022-05-20 16:47:38] [INFO ] Deduced a trap composed of 66 places in 139 ms of which 1 ms to minimize.
[2022-05-20 16:47:38] [INFO ] Deduced a trap composed of 67 places in 133 ms of which 0 ms to minimize.
[2022-05-20 16:47:38] [INFO ] Deduced a trap composed of 76 places in 141 ms of which 0 ms to minimize.
[2022-05-20 16:47:38] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 13072 ms
[2022-05-20 16:47:39] [INFO ] Deduced a trap composed of 52 places in 174 ms of which 1 ms to minimize.
[2022-05-20 16:47:39] [INFO ] Deduced a trap composed of 39 places in 167 ms of which 1 ms to minimize.
[2022-05-20 16:47:39] [INFO ] Deduced a trap composed of 68 places in 170 ms of which 1 ms to minimize.
[2022-05-20 16:47:39] [INFO ] Deduced a trap composed of 44 places in 167 ms of which 0 ms to minimize.
[2022-05-20 16:47:39] [INFO ] Deduced a trap composed of 59 places in 169 ms of which 0 ms to minimize.
[2022-05-20 16:47:40] [INFO ] Deduced a trap composed of 54 places in 187 ms of which 10 ms to minimize.
[2022-05-20 16:47:40] [INFO ] Deduced a trap composed of 42 places in 173 ms of which 1 ms to minimize.
[2022-05-20 16:47:40] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 0 ms to minimize.
[2022-05-20 16:47:40] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 0 ms to minimize.
[2022-05-20 16:47:41] [INFO ] Deduced a trap composed of 47 places in 149 ms of which 1 ms to minimize.
[2022-05-20 16:47:41] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 0 ms to minimize.
[2022-05-20 16:47:41] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2593 ms
[2022-05-20 16:47:41] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 0 ms to minimize.
[2022-05-20 16:47:41] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 1 ms to minimize.
[2022-05-20 16:47:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 418 ms
[2022-05-20 16:47:42] [INFO ] Deduced a trap composed of 68 places in 116 ms of which 0 ms to minimize.
[2022-05-20 16:47:42] [INFO ] Deduced a trap composed of 68 places in 117 ms of which 0 ms to minimize.
[2022-05-20 16:47:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 442 ms
[2022-05-20 16:47:42] [INFO ] After 18074ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 456 ms.
[2022-05-20 16:47:42] [INFO ] After 19057ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 475 ms.
Support contains 7 out of 1655 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1655/1655 places, 1905/1905 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 1655 transition count 1705
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 1455 transition count 1705
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 400 place count 1455 transition count 1455
Deduced a syphon composed of 250 places in 2 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 900 place count 1205 transition count 1455
Performed 497 Post agglomeration using F-continuation condition.Transition count delta: 497
Deduced a syphon composed of 497 places in 1 ms
Reduce places removed 497 places and 0 transitions.
Iterating global reduction 2 with 994 rules applied. Total rules applied 1894 place count 708 transition count 958
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 101 times.
Drop transitions removed 101 transitions
Iterating global reduction 2 with 101 rules applied. Total rules applied 1995 place count 708 transition count 958
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1996 place count 707 transition count 957
Applied a total of 1996 rules in 246 ms. Remains 707 /1655 variables (removed 948) and now considering 957/1905 (removed 948) transitions.
Finished structural reductions, in 1 iterations. Remains : 707/1655 places, 957/1905 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 361 ms. (steps per millisecond=27 ) 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 :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 957 rows 707 cols
[2022-05-20 16:47:44] [INFO ] Computed 201 place invariants in 7 ms
[2022-05-20 16:47:44] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 16:47:44] [INFO ] [Nat]Absence check using 201 positive place invariants in 31 ms returned sat
[2022-05-20 16:47:44] [INFO ] After 382ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 16:47:44] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:47:45] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2022-05-20 16:47:45] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 0 ms to minimize.
[2022-05-20 16:47:45] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 0 ms to minimize.
[2022-05-20 16:47:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 374 ms
[2022-05-20 16:47:45] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2022-05-20 16:47:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2022-05-20 16:47:45] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 0 ms to minimize.
[2022-05-20 16:47:45] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2022-05-20 16:47:45] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2022-05-20 16:47:45] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2022-05-20 16:47:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 362 ms
[2022-05-20 16:47:45] [INFO ] After 1341ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 108 ms.
[2022-05-20 16:47:45] [INFO ] After 1617ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 42 ms.
Support contains 7 out of 707 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 707/707 places, 957/957 transitions.
Applied a total of 0 rules in 24 ms. Remains 707 /707 variables (removed 0) and now considering 957/957 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 707/707 places, 957/957 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 156488 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 156488 steps, saw 41543 distinct states, run finished after 3002 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 957 rows 707 cols
[2022-05-20 16:47:49] [INFO ] Computed 201 place invariants in 10 ms
[2022-05-20 16:47:49] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 16:47:49] [INFO ] [Nat]Absence check using 201 positive place invariants in 30 ms returned sat
[2022-05-20 16:47:50] [INFO ] After 400ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 16:47:50] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2022-05-20 16:47:50] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 0 ms to minimize.
[2022-05-20 16:47:50] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2022-05-20 16:47:50] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 0 ms to minimize.
[2022-05-20 16:47:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 397 ms
[2022-05-20 16:47:50] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2022-05-20 16:47:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2022-05-20 16:47:50] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2022-05-20 16:47:50] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2022-05-20 16:47:50] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2022-05-20 16:47:50] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2022-05-20 16:47:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 334 ms
[2022-05-20 16:47:51] [INFO ] After 1350ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 99 ms.
[2022-05-20 16:47:51] [INFO ] After 1617ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 30 ms.
Support contains 7 out of 707 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 707/707 places, 957/957 transitions.
Applied a total of 0 rules in 25 ms. Remains 707 /707 variables (removed 0) and now considering 957/957 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 707/707 places, 957/957 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 707/707 places, 957/957 transitions.
Applied a total of 0 rules in 25 ms. Remains 707 /707 variables (removed 0) and now considering 957/957 (removed 0) transitions.
// Phase 1: matrix 957 rows 707 cols
[2022-05-20 16:47:51] [INFO ] Computed 201 place invariants in 8 ms
[2022-05-20 16:47:51] [INFO ] Implicit Places using invariants in 292 ms returned []
// Phase 1: matrix 957 rows 707 cols
[2022-05-20 16:47:51] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:47:52] [INFO ] Implicit Places using invariants and state equation in 746 ms returned []
Implicit Place search using SMT with State Equation took 1039 ms to find 0 implicit places.
[2022-05-20 16:47:52] [INFO ] Redundant transitions in 71 ms returned []
// Phase 1: matrix 957 rows 707 cols
[2022-05-20 16:47:52] [INFO ] Computed 201 place invariants in 3 ms
[2022-05-20 16:47:52] [INFO ] Dead Transitions using invariants and state equation in 401 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 707/707 places, 957/957 transitions.
Applied a total of 0 rules in 23 ms. Remains 707 /707 variables (removed 0) and now considering 957/957 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 957 rows 707 cols
[2022-05-20 16:47:52] [INFO ] Computed 201 place invariants in 4 ms
[2022-05-20 16:47:52] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 16:47:53] [INFO ] [Nat]Absence check using 201 positive place invariants in 28 ms returned sat
[2022-05-20 16:47:53] [INFO ] After 376ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 16:47:53] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2022-05-20 16:47:53] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2022-05-20 16:47:53] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
[2022-05-20 16:47:53] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 0 ms to minimize.
[2022-05-20 16:47:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 351 ms
[2022-05-20 16:47:53] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2022-05-20 16:47:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2022-05-20 16:47:54] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 0 ms to minimize.
[2022-05-20 16:47:54] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2022-05-20 16:47:54] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2022-05-20 16:47:54] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
[2022-05-20 16:47:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 358 ms
[2022-05-20 16:47:54] [INFO ] After 1297ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 100 ms.
[2022-05-20 16:47:54] [INFO ] After 1568ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2022-05-20 16:47:54] [INFO ] Flatten gal took : 54 ms
[2022-05-20 16:47:54] [INFO ] Flatten gal took : 41 ms
[2022-05-20 16:47:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5624537237066279672.gal : 20 ms
[2022-05-20 16:47:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10894367167164638253.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms11527592517014302427;'/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/ReachabilityCardinality5624537237066279672.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10894367167164638253.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/ReachabilityCardinality10894367167164638253.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :3 after 27
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :27 after 75
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :75 after 177
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :177 after 372
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :372 after 787
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :787 after 8418
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :8418 after 161531
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :161531 after 5.39708e+06
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :5.39708e+06 after 4.47848e+08
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :4.47848e+08 after 4.59625e+10
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :4.59625e+10 after 3.9433e+12
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :3.9433e+12 after 6.31538e+14
SDD proceeding with computation,3 properties remain. new max is 65536
SDD size :6.31538e+14 after 4.0591e+18
Detected timeout of ITS tools.
[2022-05-20 16:48:09] [INFO ] Flatten gal took : 37 ms
[2022-05-20 16:48:09] [INFO ] Applying decomposition
[2022-05-20 16:48:09] [INFO ] Flatten gal took : 71 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/graph5837318709405150971.txt' '-o' '/tmp/graph5837318709405150971.bin' '-w' '/tmp/graph5837318709405150971.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5837318709405150971.bin' '-l' '-1' '-v' '-w' '/tmp/graph5837318709405150971.weights' '-q' '0' '-e' '0.001'
[2022-05-20 16:48:10] [INFO ] Decomposing Gal with order
[2022-05-20 16:48:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 16:48:10] [INFO ] Removed a total of 1094 redundant transitions.
[2022-05-20 16:48:11] [INFO ] Flatten gal took : 738 ms
[2022-05-20 16:48:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 1087 labels/synchronizations in 77 ms.
[2022-05-20 16:48:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3297584626543995306.gal : 37 ms
[2022-05-20 16:48:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15410774432430608293.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms11527592517014302427;'/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/ReachabilityCardinality3297584626543995306.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15410774432430608293.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...299
Loading property file /tmp/ReachabilityCardinality15410774432430608293.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :3 after 3
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :3 after 3
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :3312 after 7.19178e+15
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13728495602521240142
[2022-05-20 16:48:26] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13728495602521240142
Running compilation step : cd /tmp/ltsmin13728495602521240142;'/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 1904 ms.
Running link step : cd /tmp/ltsmin13728495602521240142;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin13728495602521240142;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf7==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND p2 p0 p3 p1), (X (AND p2 p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 (NOT p0)))), true, (X (X (NOT (AND (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p2)), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p3) p0 (NOT p2))), (F (AND (NOT p1) p2)), (F (NOT p2)), (F (NOT (AND p0 p2))), (F (NOT (AND p1 p2))), (F (AND (NOT p3) p2)), (F (AND p1 (NOT p2))), (F (AND (NOT p3) (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) p2)), (F (AND p0 (NOT p2))), (F (NOT p1)), (F (AND (NOT p3) p0 p2))]
Knowledge based reduction with 17 factoid took 1259 ms. Reduced automaton from 12 states, 41 edges and 4 AP to 12 states, 41 edges and 4 AP.
Stuttering acceptance computed with spot in 493 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3) p1), (OR (NOT p2) (NOT p3)), (NOT p2), (NOT p3), (NOT p2), (NOT p3), p1, true, (AND (NOT p2) p1), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 514 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3) p1), (OR (NOT p2) (NOT p3)), (NOT p2), (NOT p3), (NOT p2), (NOT p3), p1, true, (AND (NOT p2) p1), (AND (NOT p2) (NOT p1))]
Support contains 7 out of 1655 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1655/1655 places, 1905/1905 transitions.
Applied a total of 0 rules in 68 ms. Remains 1655 /1655 variables (removed 0) and now considering 1905/1905 (removed 0) transitions.
// Phase 1: matrix 1905 rows 1655 cols
[2022-05-20 16:48:43] [INFO ] Computed 201 place invariants in 8 ms
[2022-05-20 16:48:44] [INFO ] Implicit Places using invariants in 451 ms returned []
// Phase 1: matrix 1905 rows 1655 cols
[2022-05-20 16:48:44] [INFO ] Computed 201 place invariants in 5 ms
[2022-05-20 16:48:46] [INFO ] Implicit Places using invariants and state equation in 1762 ms returned []
Implicit Place search using SMT with State Equation took 2219 ms to find 0 implicit places.
// Phase 1: matrix 1905 rows 1655 cols
[2022-05-20 16:48:46] [INFO ] Computed 201 place invariants in 6 ms
[2022-05-20 16:48:47] [INFO ] Dead Transitions using invariants and state equation in 990 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1655/1655 places, 1905/1905 transitions.
Computed a total of 399 stabilizing places and 399 stable transitions
Computed a total of 399 stabilizing places and 399 stable transitions
Knowledge obtained : [(AND p0 p2 p3 p1), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 p2)), true, (X (X (NOT (AND (NOT p3) (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p3) p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 901 ms. Reduced automaton from 12 states, 41 edges and 4 AP to 12 states, 41 edges and 4 AP.
Stuttering acceptance computed with spot in 524 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3) p1), (OR (NOT p2) (NOT p3)), (NOT p2), (NOT p3), (NOT p2), (NOT p3), p1, true, (AND (NOT p2) p1), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 430 ms. (steps per millisecond=23 ) properties (out of 16) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 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 1905 rows 1655 cols
[2022-05-20 16:48:49] [INFO ] Computed 201 place invariants in 4 ms
[2022-05-20 16:48:49] [INFO ] [Real]Absence check using 201 positive place invariants in 70 ms returned sat
[2022-05-20 16:48:49] [INFO ] After 476ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-20 16:48:50] [INFO ] [Nat]Absence check using 201 positive place invariants in 70 ms returned sat
[2022-05-20 16:48:51] [INFO ] After 1205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-20 16:48:51] [INFO ] Deduced a trap composed of 32 places in 324 ms of which 1 ms to minimize.
[2022-05-20 16:48:52] [INFO ] Deduced a trap composed of 21 places in 317 ms of which 0 ms to minimize.
[2022-05-20 16:48:52] [INFO ] Deduced a trap composed of 27 places in 307 ms of which 1 ms to minimize.
[2022-05-20 16:48:53] [INFO ] Deduced a trap composed of 44 places in 321 ms of which 1 ms to minimize.
[2022-05-20 16:48:53] [INFO ] Deduced a trap composed of 18 places in 275 ms of which 1 ms to minimize.
[2022-05-20 16:48:53] [INFO ] Deduced a trap composed of 40 places in 301 ms of which 1 ms to minimize.
[2022-05-20 16:48:54] [INFO ] Deduced a trap composed of 23 places in 267 ms of which 1 ms to minimize.
[2022-05-20 16:48:54] [INFO ] Deduced a trap composed of 38 places in 284 ms of which 1 ms to minimize.
[2022-05-20 16:48:54] [INFO ] Deduced a trap composed of 28 places in 254 ms of which 0 ms to minimize.
[2022-05-20 16:48:55] [INFO ] Deduced a trap composed of 36 places in 252 ms of which 1 ms to minimize.
[2022-05-20 16:48:55] [INFO ] Deduced a trap composed of 49 places in 250 ms of which 0 ms to minimize.
[2022-05-20 16:48:55] [INFO ] Deduced a trap composed of 65 places in 265 ms of which 0 ms to minimize.
[2022-05-20 16:48:56] [INFO ] Deduced a trap composed of 60 places in 242 ms of which 0 ms to minimize.
[2022-05-20 16:48:56] [INFO ] Deduced a trap composed of 21 places in 266 ms of which 1 ms to minimize.
[2022-05-20 16:48:56] [INFO ] Deduced a trap composed of 32 places in 269 ms of which 0 ms to minimize.
[2022-05-20 16:48:57] [INFO ] Deduced a trap composed of 24 places in 272 ms of which 1 ms to minimize.
[2022-05-20 16:48:57] [INFO ] Deduced a trap composed of 19 places in 268 ms of which 1 ms to minimize.
[2022-05-20 16:48:57] [INFO ] Deduced a trap composed of 29 places in 259 ms of which 1 ms to minimize.
[2022-05-20 16:48:58] [INFO ] Deduced a trap composed of 42 places in 249 ms of which 1 ms to minimize.
[2022-05-20 16:48:58] [INFO ] Deduced a trap composed of 46 places in 235 ms of which 1 ms to minimize.
[2022-05-20 16:48:58] [INFO ] Deduced a trap composed of 26 places in 223 ms of which 1 ms to minimize.
[2022-05-20 16:48:58] [INFO ] Deduced a trap composed of 36 places in 213 ms of which 1 ms to minimize.
[2022-05-20 16:48:59] [INFO ] Deduced a trap composed of 53 places in 202 ms of which 1 ms to minimize.
[2022-05-20 16:48:59] [INFO ] Deduced a trap composed of 47 places in 196 ms of which 0 ms to minimize.
[2022-05-20 16:48:59] [INFO ] Deduced a trap composed of 26 places in 206 ms of which 0 ms to minimize.
[2022-05-20 16:49:00] [INFO ] Deduced a trap composed of 42 places in 176 ms of which 1 ms to minimize.
[2022-05-20 16:49:00] [INFO ] Deduced a trap composed of 55 places in 186 ms of which 1 ms to minimize.
[2022-05-20 16:49:00] [INFO ] Deduced a trap composed of 56 places in 184 ms of which 1 ms to minimize.
[2022-05-20 16:49:00] [INFO ] Deduced a trap composed of 47 places in 174 ms of which 0 ms to minimize.
[2022-05-20 16:49:00] [INFO ] Deduced a trap composed of 43 places in 162 ms of which 0 ms to minimize.
[2022-05-20 16:49:01] [INFO ] Deduced a trap composed of 48 places in 170 ms of which 0 ms to minimize.
[2022-05-20 16:49:01] [INFO ] Deduced a trap composed of 65 places in 160 ms of which 1 ms to minimize.
[2022-05-20 16:49:01] [INFO ] Deduced a trap composed of 35 places in 168 ms of which 0 ms to minimize.
[2022-05-20 16:49:01] [INFO ] Deduced a trap composed of 57 places in 146 ms of which 0 ms to minimize.
[2022-05-20 16:49:02] [INFO ] Deduced a trap composed of 41 places in 216 ms of which 0 ms to minimize.
[2022-05-20 16:49:02] [INFO ] Deduced a trap composed of 35 places in 210 ms of which 1 ms to minimize.
[2022-05-20 16:49:02] [INFO ] Deduced a trap composed of 64 places in 194 ms of which 3 ms to minimize.
[2022-05-20 16:49:02] [INFO ] Deduced a trap composed of 58 places in 200 ms of which 0 ms to minimize.
[2022-05-20 16:49:03] [INFO ] Deduced a trap composed of 68 places in 202 ms of which 1 ms to minimize.
[2022-05-20 16:49:03] [INFO ] Deduced a trap composed of 66 places in 189 ms of which 0 ms to minimize.
[2022-05-20 16:49:03] [INFO ] Deduced a trap composed of 65 places in 194 ms of which 0 ms to minimize.
[2022-05-20 16:49:03] [INFO ] Deduced a trap composed of 71 places in 182 ms of which 0 ms to minimize.
[2022-05-20 16:49:04] [INFO ] Deduced a trap composed of 61 places in 172 ms of which 0 ms to minimize.
[2022-05-20 16:49:04] [INFO ] Deduced a trap composed of 64 places in 172 ms of which 1 ms to minimize.
[2022-05-20 16:49:04] [INFO ] Deduced a trap composed of 45 places in 174 ms of which 1 ms to minimize.
[2022-05-20 16:49:04] [INFO ] Deduced a trap composed of 49 places in 173 ms of which 1 ms to minimize.
[2022-05-20 16:49:05] [INFO ] Deduced a trap composed of 70 places in 170 ms of which 0 ms to minimize.
[2022-05-20 16:49:05] [INFO ] Deduced a trap composed of 77 places in 171 ms of which 0 ms to minimize.
[2022-05-20 16:49:05] [INFO ] Deduced a trap composed of 62 places in 184 ms of which 1 ms to minimize.
[2022-05-20 16:49:05] [INFO ] Deduced a trap composed of 72 places in 175 ms of which 1 ms to minimize.
[2022-05-20 16:49:05] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 14344 ms
[2022-05-20 16:49:06] [INFO ] Deduced a trap composed of 42 places in 202 ms of which 0 ms to minimize.
[2022-05-20 16:49:06] [INFO ] Deduced a trap composed of 42 places in 203 ms of which 1 ms to minimize.
[2022-05-20 16:49:06] [INFO ] Deduced a trap composed of 37 places in 186 ms of which 0 ms to minimize.
[2022-05-20 16:49:07] [INFO ] Deduced a trap composed of 34 places in 182 ms of which 1 ms to minimize.
[2022-05-20 16:49:07] [INFO ] Deduced a trap composed of 52 places in 206 ms of which 1 ms to minimize.
[2022-05-20 16:49:07] [INFO ] Deduced a trap composed of 39 places in 227 ms of which 0 ms to minimize.
[2022-05-20 16:49:08] [INFO ] Deduced a trap composed of 25 places in 224 ms of which 1 ms to minimize.
[2022-05-20 16:49:08] [INFO ] Deduced a trap composed of 51 places in 211 ms of which 1 ms to minimize.
[2022-05-20 16:49:08] [INFO ] Deduced a trap composed of 50 places in 216 ms of which 0 ms to minimize.
[2022-05-20 16:49:08] [INFO ] Deduced a trap composed of 40 places in 160 ms of which 1 ms to minimize.
[2022-05-20 16:49:09] [INFO ] Deduced a trap composed of 62 places in 172 ms of which 1 ms to minimize.
[2022-05-20 16:49:09] [INFO ] Deduced a trap composed of 49 places in 159 ms of which 0 ms to minimize.
[2022-05-20 16:49:09] [INFO ] Deduced a trap composed of 59 places in 159 ms of which 0 ms to minimize.
[2022-05-20 16:49:09] [INFO ] Deduced a trap composed of 53 places in 167 ms of which 1 ms to minimize.
[2022-05-20 16:49:10] [INFO ] Deduced a trap composed of 67 places in 170 ms of which 0 ms to minimize.
[2022-05-20 16:49:10] [INFO ] Deduced a trap composed of 67 places in 134 ms of which 1 ms to minimize.
[2022-05-20 16:49:10] [INFO ] Deduced a trap composed of 78 places in 142 ms of which 1 ms to minimize.
[2022-05-20 16:49:10] [INFO ] Deduced a trap composed of 77 places in 142 ms of which 0 ms to minimize.
[2022-05-20 16:49:10] [INFO ] Deduced a trap composed of 78 places in 155 ms of which 1 ms to minimize.
[2022-05-20 16:49:11] [INFO ] Deduced a trap composed of 80 places in 124 ms of which 0 ms to minimize.
[2022-05-20 16:49:11] [INFO ] Deduced a trap composed of 71 places in 133 ms of which 0 ms to minimize.
[2022-05-20 16:49:11] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 5146 ms
[2022-05-20 16:49:11] [INFO ] Deduced a trap composed of 40 places in 161 ms of which 1 ms to minimize.
[2022-05-20 16:49:11] [INFO ] Deduced a trap composed of 40 places in 178 ms of which 0 ms to minimize.
[2022-05-20 16:49:12] [INFO ] Deduced a trap composed of 55 places in 162 ms of which 0 ms to minimize.
[2022-05-20 16:49:12] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 1 ms to minimize.
[2022-05-20 16:49:12] [INFO ] Deduced a trap composed of 30 places in 158 ms of which 0 ms to minimize.
[2022-05-20 16:49:12] [INFO ] Deduced a trap composed of 54 places in 161 ms of which 1 ms to minimize.
[2022-05-20 16:49:12] [INFO ] Deduced a trap composed of 43 places in 160 ms of which 1 ms to minimize.
[2022-05-20 16:49:13] [INFO ] Deduced a trap composed of 36 places in 154 ms of which 1 ms to minimize.
[2022-05-20 16:49:13] [INFO ] Deduced a trap composed of 51 places in 146 ms of which 0 ms to minimize.
[2022-05-20 16:49:13] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 0 ms to minimize.
[2022-05-20 16:49:13] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 1 ms to minimize.
[2022-05-20 16:49:13] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2460 ms
[2022-05-20 16:49:14] [INFO ] Deduced a trap composed of 45 places in 165 ms of which 1 ms to minimize.
[2022-05-20 16:49:14] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 1 ms to minimize.
[2022-05-20 16:49:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 484 ms
[2022-05-20 16:49:14] [INFO ] Deduced a trap composed of 20 places in 242 ms of which 1 ms to minimize.
[2022-05-20 16:49:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 16:49:14] [INFO ] After 25087ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 289 ms.
Support contains 7 out of 1655 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1655/1655 places, 1905/1905 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 1655 transition count 1705
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 1455 transition count 1705
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 400 place count 1455 transition count 1455
Deduced a syphon composed of 250 places in 2 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 900 place count 1205 transition count 1455
Performed 497 Post agglomeration using F-continuation condition.Transition count delta: 497
Deduced a syphon composed of 497 places in 1 ms
Reduce places removed 497 places and 0 transitions.
Iterating global reduction 2 with 994 rules applied. Total rules applied 1894 place count 708 transition count 958
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 101 times.
Drop transitions removed 101 transitions
Iterating global reduction 2 with 101 rules applied. Total rules applied 1995 place count 708 transition count 958
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1996 place count 707 transition count 957
Applied a total of 1996 rules in 222 ms. Remains 707 /1655 variables (removed 948) and now considering 957/1905 (removed 948) transitions.
Finished structural reductions, in 1 iterations. Remains : 707/1655 places, 957/1905 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 957 rows 707 cols
[2022-05-20 16:49:15] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:49:16] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 16:49:16] [INFO ] [Nat]Absence check using 201 positive place invariants in 27 ms returned sat
[2022-05-20 16:49:16] [INFO ] After 501ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 16:49:16] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
[2022-05-20 16:49:16] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 0 ms to minimize.
[2022-05-20 16:49:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 190 ms
[2022-05-20 16:49:16] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2022-05-20 16:49:17] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 0 ms to minimize.
[2022-05-20 16:49:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 204 ms
[2022-05-20 16:49:17] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2022-05-20 16:49:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2022-05-20 16:49:17] [INFO ] After 1056ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 98 ms.
[2022-05-20 16:49:17] [INFO ] After 1320ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 41 ms.
Support contains 7 out of 707 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 707/707 places, 957/957 transitions.
Applied a total of 0 rules in 22 ms. Remains 707 /707 variables (removed 0) and now considering 957/957 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 707/707 places, 957/957 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 156427 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 156427 steps, saw 41529 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 957 rows 707 cols
[2022-05-20 16:49:20] [INFO ] Computed 201 place invariants in 3 ms
[2022-05-20 16:49:20] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 16:49:21] [INFO ] [Nat]Absence check using 201 positive place invariants in 24 ms returned sat
[2022-05-20 16:49:21] [INFO ] After 377ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 16:49:21] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 0 ms to minimize.
[2022-05-20 16:49:21] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2022-05-20 16:49:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 176 ms
[2022-05-20 16:49:21] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2022-05-20 16:49:21] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
[2022-05-20 16:49:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 182 ms
[2022-05-20 16:49:21] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2022-05-20 16:49:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2022-05-20 16:49:21] [INFO ] After 912ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 93 ms.
[2022-05-20 16:49:22] [INFO ] After 1194ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 46 ms.
Support contains 7 out of 707 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 707/707 places, 957/957 transitions.
Applied a total of 0 rules in 21 ms. Remains 707 /707 variables (removed 0) and now considering 957/957 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 707/707 places, 957/957 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 707/707 places, 957/957 transitions.
Applied a total of 0 rules in 21 ms. Remains 707 /707 variables (removed 0) and now considering 957/957 (removed 0) transitions.
// Phase 1: matrix 957 rows 707 cols
[2022-05-20 16:49:22] [INFO ] Computed 201 place invariants in 4 ms
[2022-05-20 16:49:22] [INFO ] Implicit Places using invariants in 360 ms returned []
// Phase 1: matrix 957 rows 707 cols
[2022-05-20 16:49:22] [INFO ] Computed 201 place invariants in 2 ms
[2022-05-20 16:49:23] [INFO ] Implicit Places using invariants and state equation in 728 ms returned []
Implicit Place search using SMT with State Equation took 1134 ms to find 0 implicit places.
[2022-05-20 16:49:23] [INFO ] Redundant transitions in 74 ms returned []
// Phase 1: matrix 957 rows 707 cols
[2022-05-20 16:49:23] [INFO ] Computed 201 place invariants in 6 ms
[2022-05-20 16:49:23] [INFO ] Dead Transitions using invariants and state equation in 391 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 707/707 places, 957/957 transitions.
Applied a total of 0 rules in 25 ms. Remains 707 /707 variables (removed 0) and now considering 957/957 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 957 rows 707 cols
[2022-05-20 16:49:23] [INFO ] Computed 201 place invariants in 4 ms
[2022-05-20 16:49:23] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 16:49:24] [INFO ] [Nat]Absence check using 201 positive place invariants in 25 ms returned sat
[2022-05-20 16:49:24] [INFO ] After 348ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 16:49:24] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2022-05-20 16:49:24] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 0 ms to minimize.
[2022-05-20 16:49:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 219 ms
[2022-05-20 16:49:24] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 0 ms to minimize.
[2022-05-20 16:49:24] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2022-05-20 16:49:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 197 ms
[2022-05-20 16:49:25] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2022-05-20 16:49:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2022-05-20 16:49:25] [INFO ] After 932ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 103 ms.
[2022-05-20 16:49:25] [INFO ] After 1194ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2022-05-20 16:49:25] [INFO ] Flatten gal took : 36 ms
[2022-05-20 16:49:25] [INFO ] Flatten gal took : 33 ms
[2022-05-20 16:49:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1832513972153120994.gal : 6 ms
[2022-05-20 16:49:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4018800873192855197.prop : 437 ms
Invoking ITS tools like this :cd /tmp/redAtoms9656446909764736914;'/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/ReachabilityCardinality1832513972153120994.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4018800873192855197.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...319
Loading property file /tmp/ReachabilityCardinality4018800873192855197.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :3 after 27
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :27 after 75
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :75 after 177
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :177 after 372
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :372 after 787
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :787 after 8418
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :8418 after 161531
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :161531 after 5.39708e+06
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :5.39708e+06 after 4.47848e+08
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :4.47848e+08 after 4.59625e+10
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :4.59625e+10 after 3.9433e+12
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :3.9433e+12 after 6.31538e+14
SDD proceeding with computation,3 properties remain. new max is 65536
SDD size :6.31538e+14 after 4.0591e+18
Detected timeout of ITS tools.
[2022-05-20 16:49:40] [INFO ] Flatten gal took : 46 ms
[2022-05-20 16:49:40] [INFO ] Applying decomposition
[2022-05-20 16:49:40] [INFO ] Flatten gal took : 65 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/graph14492884151271944441.txt' '-o' '/tmp/graph14492884151271944441.bin' '-w' '/tmp/graph14492884151271944441.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14492884151271944441.bin' '-l' '-1' '-v' '-w' '/tmp/graph14492884151271944441.weights' '-q' '0' '-e' '0.001'
[2022-05-20 16:49:41] [INFO ] Decomposing Gal with order
[2022-05-20 16:49:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 16:49:41] [INFO ] Removed a total of 1106 redundant transitions.
[2022-05-20 16:49:41] [INFO ] Flatten gal took : 81 ms
[2022-05-20 16:49:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 1147 labels/synchronizations in 16 ms.
[2022-05-20 16:49:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2346785554400109829.gal : 5 ms
[2022-05-20 16:49:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7300143560608619653.prop : 247 ms
Invoking ITS tools like this :cd /tmp/redAtoms9656446909764736914;'/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/ReachabilityCardinality2346785554400109829.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7300143560608619653.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/ReachabilityCardinality7300143560608619653.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :3 after 3
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :3 after 3
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :3 after 3
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :3 after 3
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7051255581022349574
[2022-05-20 16:49:56] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7051255581022349574
Running compilation step : cd /tmp/ltsmin7051255581022349574;'/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 1732 ms.
Running link step : cd /tmp/ltsmin7051255581022349574;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin7051255581022349574;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf7==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND p0 p2 p3 p1), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 p2)), true, (X (X (NOT (AND (NOT p3) (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p3) p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p0 (NOT p2)))))]
False Knowledge obtained : [(F (AND p0 (NOT p2) (NOT p3))), (F (AND p2 (NOT p1))), (F (NOT p2)), (F (NOT (AND p0 p2))), (F (NOT (AND p2 p1))), (F (AND p2 (NOT p3))), (F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p3))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) p2)), (F (AND p0 (NOT p2))), (F (NOT p1)), (F (AND p0 p2 (NOT p3)))]
Knowledge based reduction with 17 factoid took 1121 ms. Reduced automaton from 12 states, 41 edges and 4 AP to 12 states, 41 edges and 4 AP.
Stuttering acceptance computed with spot in 521 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3) p1), (OR (NOT p2) (NOT p3)), (NOT p2), (NOT p3), (NOT p2), (NOT p3), p1, true, (AND (NOT p2) p1), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 500 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3) p1), (OR (NOT p2) (NOT p3)), (NOT p2), (NOT p3), (NOT p2), (NOT p3), p1, true, (AND (NOT p2) p1), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 776 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3) p1), (OR (NOT p2) (NOT p3)), (NOT p2), (NOT p3), (NOT p2), (NOT p3), p1, true, (AND (NOT p2) p1), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 24907 reset in 551 ms.
Product exploration explored 100000 steps with 24907 reset in 555 ms.
Applying partial POR strategy [false, false, false, false, false, false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 495 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3) p1), (OR (NOT p2) (NOT p3)), (NOT p2), (NOT p3), (NOT p2), (NOT p3), p1, true, (AND (NOT p2) p1), (AND (NOT p2) (NOT p1))]
Support contains 7 out of 1655 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1655/1655 places, 1905/1905 transitions.
Performed 199 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 1655 transition count 1905
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 101 Pre rules applied. Total rules applied 199 place count 1655 transition count 1955
Deduced a syphon composed of 300 places in 3 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 300 place count 1655 transition count 1955
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 301 place count 1654 transition count 1954
Deduced a syphon composed of 299 places in 3 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 302 place count 1654 transition count 1954
Performed 647 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 946 places in 2 ms
Iterating global reduction 1 with 647 rules applied. Total rules applied 949 place count 1654 transition count 1954
Renaming transitions due to excessive name length > 1024 char.
Discarding 349 places :
Symmetric choice reduction at 1 with 349 rule applications. Total rules 1298 place count 1305 transition count 1605
Deduced a syphon composed of 597 places in 2 ms
Iterating global reduction 1 with 349 rules applied. Total rules applied 1647 place count 1305 transition count 1605
Deduced a syphon composed of 597 places in 2 ms
Applied a total of 1647 rules in 682 ms. Remains 1305 /1655 variables (removed 350) and now considering 1605/1905 (removed 300) transitions.
[2022-05-20 16:50:17] [INFO ] Redundant transitions in 192 ms returned [1604]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1604 rows 1305 cols
[2022-05-20 16:50:17] [INFO ] Computed 201 place invariants in 11 ms
[2022-05-20 16:50:18] [INFO ] Dead Transitions using invariants and state equation in 804 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1305/1655 places, 1604/1905 transitions.
Deduced a syphon composed of 597 places in 2 ms
Applied a total of 0 rules in 53 ms. Remains 1305 /1305 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1305/1655 places, 1604/1905 transitions.
Product exploration explored 100000 steps with 24924 reset in 601 ms.
Product exploration explored 100000 steps with 25029 reset in 594 ms.
Built C files in :
/tmp/ltsmin3616354947531001076
[2022-05-20 16:50:19] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3616354947531001076
Running compilation step : cd /tmp/ltsmin3616354947531001076;'/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/ltsmin3616354947531001076;'/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/ltsmin3616354947531001076;'/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 1655 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1655/1655 places, 1905/1905 transitions.
Applied a total of 0 rules in 69 ms. Remains 1655 /1655 variables (removed 0) and now considering 1905/1905 (removed 0) transitions.
// Phase 1: matrix 1905 rows 1655 cols
[2022-05-20 16:50:22] [INFO ] Computed 201 place invariants in 9 ms
[2022-05-20 16:50:23] [INFO ] Implicit Places using invariants in 404 ms returned []
// Phase 1: matrix 1905 rows 1655 cols
[2022-05-20 16:50:23] [INFO ] Computed 201 place invariants in 4 ms
[2022-05-20 16:50:24] [INFO ] Implicit Places using invariants and state equation in 1727 ms returned []
Implicit Place search using SMT with State Equation took 2132 ms to find 0 implicit places.
// Phase 1: matrix 1905 rows 1655 cols
[2022-05-20 16:50:24] [INFO ] Computed 201 place invariants in 13 ms
[2022-05-20 16:50:25] [INFO ] Dead Transitions using invariants and state equation in 943 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1655/1655 places, 1905/1905 transitions.
Built C files in :
/tmp/ltsmin8448086782518697150
[2022-05-20 16:50:25] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8448086782518697150
Running compilation step : cd /tmp/ltsmin8448086782518697150;'/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/ltsmin8448086782518697150;'/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/ltsmin8448086782518697150;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 16:50:28] [INFO ] Flatten gal took : 68 ms
[2022-05-20 16:50:28] [INFO ] Flatten gal took : 59 ms
[2022-05-20 16:50:28] [INFO ] Time to serialize gal into /tmp/LTL10562130812636114258.gal : 12 ms
[2022-05-20 16:50:28] [INFO ] Time to serialize properties into /tmp/LTL1249902099748349571.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/LTL10562130812636114258.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1249902099748349571.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/LTL1056213...267
Read 1 LTL properties
Checking formula 0 : !((G(X(("(p1152!=1)")U((X(X(!("((p268==0)||(p210==1))"))))U((G("((p1896==0)||(p1129==1))"))&&(X("((p478==0)||(p1842==1))"))))))))
Formula 0 simplified : !GX("(p1152!=1)" U (XX!"((p268==0)||(p210==1))" U (G"((p1896==0)||(p1129==1))" & X"((p478==0)||(p1842==1))")))
Detected timeout of ITS tools.
[2022-05-20 16:50:44] [INFO ] Flatten gal took : 57 ms
[2022-05-20 16:50:44] [INFO ] Applying decomposition
[2022-05-20 16:50:44] [INFO ] Flatten gal took : 55 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/graph2446004471772814097.txt' '-o' '/tmp/graph2446004471772814097.bin' '-w' '/tmp/graph2446004471772814097.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2446004471772814097.bin' '-l' '-1' '-v' '-w' '/tmp/graph2446004471772814097.weights' '-q' '0' '-e' '0.001'
[2022-05-20 16:50:44] [INFO ] Decomposing Gal with order
[2022-05-20 16:50:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 16:50:44] [INFO ] Removed a total of 1791 redundant transitions.
[2022-05-20 16:50:44] [INFO ] Flatten gal took : 108 ms
[2022-05-20 16:50:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2022-05-20 16:50:44] [INFO ] Time to serialize gal into /tmp/LTL10511727629203782749.gal : 12 ms
[2022-05-20 16:50:44] [INFO ] Time to serialize properties into /tmp/LTL17390839850872729488.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/LTL10511727629203782749.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17390839850872729488.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/LTL1051172...247
Read 1 LTL properties
Checking formula 0 : !((G(X(("(i12.u364.p1152!=1)")U((X(X(!("((i1.i1.i1.u92.p268==0)||(i1.i0.i2.u73.p210==1))"))))U((G("((i20.u592.p1896==0)||(i11.u356.p11...220
Formula 0 simplified : !GX("(i12.u364.p1152!=1)" U (XX!"((i1.i1.i1.u92.p268==0)||(i1.i0.i2.u73.p210==1))" U (G"((i20.u592.p1896==0)||(i11.u356.p1129==1))" ...203
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1828020918051431227
[2022-05-20 16:50:59] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1828020918051431227
Running compilation step : cd /tmp/ltsmin1828020918051431227;'/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/ltsmin1828020918051431227;'/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/ltsmin1828020918051431227;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldRVs-PT-050B-LTLCardinality-15 finished in 226829 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((p0 U (X(X(!p1)) U (G(p2)&&X(p3)))))))'
[2022-05-20 16:51:04] [INFO ] Flatten gal took : 51 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11661877219625129031
[2022-05-20 16:51:04] [INFO ] Too many transitions (1913) to apply POR reductions. Disabling POR matrices.
[2022-05-20 16:51:04] [INFO ] Applying decomposition
[2022-05-20 16:51:04] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11661877219625129031
Running compilation step : cd /tmp/ltsmin11661877219625129031;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-20 16:51:04] [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/graph16236382457197481965.txt' '-o' '/tmp/graph16236382457197481965.bin' '-w' '/tmp/graph16236382457197481965.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16236382457197481965.bin' '-l' '-1' '-v' '-w' '/tmp/graph16236382457197481965.weights' '-q' '0' '-e' '0.001'
[2022-05-20 16:51:04] [INFO ] Decomposing Gal with order
[2022-05-20 16:51:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 16:51:04] [INFO ] Removed a total of 1791 redundant transitions.
[2022-05-20 16:51:04] [INFO ] Flatten gal took : 114 ms
[2022-05-20 16:51:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2022-05-20 16:51:04] [INFO ] Time to serialize gal into /tmp/LTLCardinality12714660311115444819.gal : 10 ms
[2022-05-20 16:51:04] [INFO ] Time to serialize properties into /tmp/LTLCardinality8482357076209984150.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/LTLCardinality12714660311115444819.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8482357076209984150.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...268
Read 1 LTL properties
Checking formula 0 : !((G(X(("(i12.i1.i2.u361.p1152!=1)")U((X(X(!("((i2.u89.p268==0)||(i1.u70.p210==1))"))))U((G("((i20.u589.p1896==0)||(i12.i0.i0.u353.p11...226
Formula 0 simplified : !GX("(i12.i1.i2.u361.p1152!=1)" U (XX!"((i2.u89.p268==0)||(i1.u70.p210==1))" U (G"((i20.u589.p1896==0)||(i12.i0.i0.u353.p1129==1))" ...209
Compilation finished in 4174 ms.
Running link step : cd /tmp/ltsmin11661877219625129031;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin11661877219625129031;'/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 (X(X(!(LTLAPp1==true))) U ([]((LTLAPp2==true))&&X((LTLAPp3==true)))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-20 17:12:37] [INFO ] Applying decomposition
[2022-05-20 17:12:38] [INFO ] Flatten gal took : 636 ms
[2022-05-20 17:12:38] [INFO ] Decomposing Gal with order
[2022-05-20 17:12:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 17:12:40] [INFO ] Removed a total of 1047 redundant transitions.
[2022-05-20 17:12:40] [INFO ] Flatten gal took : 662 ms
[2022-05-20 17:12:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 1592 labels/synchronizations in 219 ms.
[2022-05-20 17:12:41] [INFO ] Time to serialize gal into /tmp/LTLCardinality15132133802777600076.gal : 79 ms
[2022-05-20 17:12:41] [INFO ] Time to serialize properties into /tmp/LTLCardinality9686658462397898066.ltl : 15 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/LTLCardinality15132133802777600076.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9686658462397898066.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...268
Read 1 LTL properties
Checking formula 0 : !((G(X(("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u250.p1152!=1)")U((X(X(!("((i0.i0.i0.i0.i0.i0.i0.i0....754
Formula 0 simplified : !GX("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u250.p1152!=1)" U (XX!"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0...737
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.015: LTL layer: formula: [](X(((LTLAPp0==true) U (X(X(!(LTLAPp1==true))) U ([]((LTLAPp2==true))&&X((LTLAPp3==true)))))))
pins2lts-mc-linux64( 4/ 8), 0.016: "[](X(((LTLAPp0==true) U (X(X(!(LTLAPp1==true))) U ([]((LTLAPp2==true))&&X((LTLAPp3==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.017: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.040: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.041: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.044: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.044: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.677: There are 1918 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.677: State length is 1664, there are 1954 groups
pins2lts-mc-linux64( 0/ 8), 0.677: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.677: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.677: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.677: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 1.346: [Blue] ~61 levels ~960 states ~6760 transitions
pins2lts-mc-linux64( 3/ 8), 1.879: [Blue] ~122 levels ~1920 states ~31864 transitions
pins2lts-mc-linux64( 3/ 8), 2.301: [Blue] ~242 levels ~3840 states ~68760 transitions
pins2lts-mc-linux64( 3/ 8), 3.127: [Blue] ~482 levels ~7680 states ~163672 transitions
pins2lts-mc-linux64( 3/ 8), 4.441: [Blue] ~962 levels ~15360 states ~305576 transitions
pins2lts-mc-linux64( 3/ 8), 6.354: [Blue] ~2213 levels ~30720 states ~462600 transitions
pins2lts-mc-linux64( 1/ 8), 9.755: [Blue] ~2244 levels ~61440 states ~605312 transitions
pins2lts-mc-linux64( 0/ 8), 16.703: [Blue] ~2155 levels ~122880 states ~825024 transitions
pins2lts-mc-linux64( 0/ 8), 32.500: [Blue] ~2155 levels ~245760 states ~1496384 transitions
pins2lts-mc-linux64( 2/ 8), 58.968: [Blue] ~2292 levels ~491520 states ~3157880 transitions
pins2lts-mc-linux64( 0/ 8), 112.187: [Blue] ~2155 levels ~983040 states ~6139424 transitions
pins2lts-mc-linux64( 2/ 8), 218.978: [Blue] ~2292 levels ~1966080 states ~12482560 transitions
pins2lts-mc-linux64( 0/ 8), 433.038: [Blue] ~2155 levels ~3932160 states ~26615664 transitions
pins2lts-mc-linux64( 0/ 8), 858.700: [Blue] ~2172 levels ~7864320 states ~53185328 transitions
pins2lts-mc-linux64( 0/ 8), 1810.899: [Blue] ~2172 levels ~15728640 states ~117531840 transitions
pins2lts-mc-linux64( 4/ 8), 2298.487: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 2298.577:
pins2lts-mc-linux64( 0/ 8), 2298.578: Explored 19905385 states 155521373 transitions, fanout: 7.813
pins2lts-mc-linux64( 0/ 8), 2298.579: Total exploration time 2297.880 sec (2297.800 sec minimum, 2297.839 sec on average)
pins2lts-mc-linux64( 0/ 8), 2298.579: States per second: 8662, Transitions per second: 67680
pins2lts-mc-linux64( 0/ 8), 2298.579:
pins2lts-mc-linux64( 0/ 8), 2298.579: State space has 20369947 states, 9040 are accepting
pins2lts-mc-linux64( 0/ 8), 2298.579: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 2298.579: blue states: 19905385 (97.72%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 2298.579: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 2298.579: all-red states: 1251038 (6.14%), bogus 6 (0.00%)
pins2lts-mc-linux64( 0/ 8), 2298.580:
pins2lts-mc-linux64( 0/ 8), 2298.580: Total memory used for local state coloring: 0.3MB
pins2lts-mc-linux64( 0/ 8), 2298.580:
pins2lts-mc-linux64( 0/ 8), 2298.580: Queue width: 8B, total height: 17495, memory: 0.13MB
pins2lts-mc-linux64( 0/ 8), 2298.580: Tree memory: 411.4MB, 21.2 B/state, compr.: 0.3%
pins2lts-mc-linux64( 0/ 8), 2298.580: Tree fill ratio (roots/leafs): 15.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 2298.582: Stored 1949 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 2298.592: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 2298.593: Est. total memory use: 411.5MB (~1024.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11661877219625129031;'/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 (X(X(!(LTLAPp1==true))) U ([]((LTLAPp2==true))&&X((LTLAPp3==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11661877219625129031;'/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 (X(X(!(LTLAPp1==true))) U ([]((LTLAPp2==true))&&X((LTLAPp3==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)
Detected timeout of ITS tools.
[2022-05-20 17:34:10] [INFO ] Flatten gal took : 223 ms
[2022-05-20 17:34:11] [INFO ] Input system was already deterministic with 1913 transitions.
[2022-05-20 17:34:11] [INFO ] Transformed 1663 places.
[2022-05-20 17:34:11] [INFO ] Transformed 1913 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-20 17:34:12] [INFO ] Time to serialize gal into /tmp/LTLCardinality9814707033916935842.gal : 5 ms
[2022-05-20 17:34:12] [INFO ] Time to serialize properties into /tmp/LTLCardinality18423896628956420969.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/LTLCardinality9814707033916935842.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality18423896628956420969.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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/LTLCardina...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(X(("(p1152!=1)")U((X(X(!("((p268==0)||(p210==1))"))))U((G("((p1896==0)||(p1129==1))"))&&(X("((p478==0)||(p1842==1))"))))))))
Formula 0 simplified : !GX("(p1152!=1)" U (XX!"((p268==0)||(p210==1))" U (G"((p1896==0)||(p1129==1))" & X"((p478==0)||(p1842==1))")))

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldRVs-PT-050B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286025900859"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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