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-165286025500650.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 ShieldPPPt-PT-030B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025500650
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 788K
-rw-r--r-- 1 mcc users 6.4K Apr 29 13:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 29 13:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 29 13:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 29 13:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:55 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 569K 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 ShieldPPPt-PT-030B-CTLFireability-00
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-01
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-02
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-03
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-04
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-05
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-06
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-07
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-08
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-09
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-10
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-11
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-12
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-13
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-14
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1653025534815

Running Version 202205111006
[2022-05-20 05:45:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -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 05:45:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 05:45:36] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2022-05-20 05:45:36] [INFO ] Transformed 2343 places.
[2022-05-20 05:45:36] [INFO ] Transformed 2133 transitions.
[2022-05-20 05:45:36] [INFO ] Found NUPN structural information;
[2022-05-20 05:45:36] [INFO ] Parsed PT model containing 2343 places and 2133 transitions in 340 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Support contains 132 out of 2343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2343/2343 places, 2133/2133 transitions.
Discarding 303 places :
Symmetric choice reduction at 0 with 303 rule applications. Total rules 303 place count 2040 transition count 1830
Iterating global reduction 0 with 303 rules applied. Total rules applied 606 place count 2040 transition count 1830
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 607 place count 2039 transition count 1829
Iterating global reduction 0 with 1 rules applied. Total rules applied 608 place count 2039 transition count 1829
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 609 place count 2038 transition count 1828
Iterating global reduction 0 with 1 rules applied. Total rules applied 610 place count 2038 transition count 1828
Applied a total of 610 rules in 980 ms. Remains 2038 /2343 variables (removed 305) and now considering 1828/2133 (removed 305) transitions.
// Phase 1: matrix 1828 rows 2038 cols
[2022-05-20 05:45:38] [INFO ] Computed 331 place invariants in 631 ms
[2022-05-20 05:45:38] [INFO ] Implicit Places using invariants in 1412 ms returned []
// Phase 1: matrix 1828 rows 2038 cols
[2022-05-20 05:45:38] [INFO ] Computed 331 place invariants in 8 ms
[2022-05-20 05:45:40] [INFO ] Implicit Places using invariants and state equation in 1611 ms returned []
Implicit Place search using SMT with State Equation took 3050 ms to find 0 implicit places.
// Phase 1: matrix 1828 rows 2038 cols
[2022-05-20 05:45:40] [INFO ] Computed 331 place invariants in 7 ms
[2022-05-20 05:45:41] [INFO ] Dead Transitions using invariants and state equation in 924 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2038/2343 places, 1828/2133 transitions.
Finished structural reductions, in 1 iterations. Remains : 2038/2343 places, 1828/2133 transitions.
Support contains 132 out of 2038 places after structural reductions.
[2022-05-20 05:45:41] [INFO ] Flatten gal took : 135 ms
[2022-05-20 05:45:41] [INFO ] Flatten gal took : 80 ms
[2022-05-20 05:45:41] [INFO ] Input system was already deterministic with 1828 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 683 ms. (steps per millisecond=14 ) properties (out of 83) seen :30
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 53) seen :0
Running SMT prover for 53 properties.
// Phase 1: matrix 1828 rows 2038 cols
[2022-05-20 05:45:42] [INFO ] Computed 331 place invariants in 8 ms
[2022-05-20 05:45:45] [INFO ] [Real]Absence check using 331 positive place invariants in 94 ms returned sat
[2022-05-20 05:45:45] [INFO ] After 2833ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:53
[2022-05-20 05:45:47] [INFO ] [Nat]Absence check using 331 positive place invariants in 109 ms returned sat
[2022-05-20 05:45:54] [INFO ] After 4731ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :52
[2022-05-20 05:45:54] [INFO ] Deduced a trap composed of 40 places in 308 ms of which 9 ms to minimize.
[2022-05-20 05:45:54] [INFO ] Deduced a trap composed of 27 places in 312 ms of which 2 ms to minimize.
[2022-05-20 05:45:55] [INFO ] Deduced a trap composed of 24 places in 298 ms of which 1 ms to minimize.
[2022-05-20 05:45:55] [INFO ] Deduced a trap composed of 22 places in 295 ms of which 2 ms to minimize.
[2022-05-20 05:45:55] [INFO ] Deduced a trap composed of 39 places in 268 ms of which 1 ms to minimize.
[2022-05-20 05:45:56] [INFO ] Deduced a trap composed of 36 places in 276 ms of which 1 ms to minimize.
[2022-05-20 05:45:56] [INFO ] Deduced a trap composed of 23 places in 261 ms of which 1 ms to minimize.
[2022-05-20 05:45:56] [INFO ] Deduced a trap composed of 38 places in 251 ms of which 1 ms to minimize.
[2022-05-20 05:45:57] [INFO ] Deduced a trap composed of 36 places in 254 ms of which 0 ms to minimize.
[2022-05-20 05:45:57] [INFO ] Deduced a trap composed of 26 places in 225 ms of which 0 ms to minimize.
[2022-05-20 05:45:57] [INFO ] Deduced a trap composed of 39 places in 233 ms of which 1 ms to minimize.
[2022-05-20 05:45:58] [INFO ] Deduced a trap composed of 34 places in 215 ms of which 1 ms to minimize.
[2022-05-20 05:45:58] [INFO ] Deduced a trap composed of 34 places in 229 ms of which 1 ms to minimize.
[2022-05-20 05:45:58] [INFO ] Deduced a trap composed of 41 places in 217 ms of which 1 ms to minimize.
[2022-05-20 05:45:58] [INFO ] Deduced a trap composed of 21 places in 205 ms of which 1 ms to minimize.
[2022-05-20 05:45:59] [INFO ] Deduced a trap composed of 31 places in 197 ms of which 0 ms to minimize.
[2022-05-20 05:45:59] [INFO ] Deduced a trap composed of 32 places in 198 ms of which 1 ms to minimize.
[2022-05-20 05:45:59] [INFO ] Deduced a trap composed of 44 places in 189 ms of which 0 ms to minimize.
[2022-05-20 05:45:59] [INFO ] Deduced a trap composed of 34 places in 191 ms of which 1 ms to minimize.
[2022-05-20 05:46:00] [INFO ] Deduced a trap composed of 35 places in 182 ms of which 0 ms to minimize.
[2022-05-20 05:46:00] [INFO ] Deduced a trap composed of 37 places in 176 ms of which 1 ms to minimize.
[2022-05-20 05:46:00] [INFO ] Deduced a trap composed of 35 places in 171 ms of which 1 ms to minimize.
[2022-05-20 05:46:00] [INFO ] Deduced a trap composed of 34 places in 173 ms of which 0 ms to minimize.
[2022-05-20 05:46:01] [INFO ] Deduced a trap composed of 33 places in 171 ms of which 0 ms to minimize.
[2022-05-20 05:46:01] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 7180 ms
[2022-05-20 05:46:01] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 1 ms to minimize.
[2022-05-20 05:46:02] [INFO ] Deduced a trap composed of 37 places in 176 ms of which 0 ms to minimize.
[2022-05-20 05:46:02] [INFO ] Deduced a trap composed of 30 places in 166 ms of which 1 ms to minimize.
[2022-05-20 05:46:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 770 ms
[2022-05-20 05:46:02] [INFO ] Deduced a trap composed of 35 places in 240 ms of which 0 ms to minimize.
[2022-05-20 05:46:03] [INFO ] Deduced a trap composed of 43 places in 243 ms of which 1 ms to minimize.
[2022-05-20 05:46:03] [INFO ] Deduced a trap composed of 42 places in 244 ms of which 1 ms to minimize.
[2022-05-20 05:46:03] [INFO ] Deduced a trap composed of 49 places in 240 ms of which 0 ms to minimize.
[2022-05-20 05:46:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1312 ms
[2022-05-20 05:46:04] [INFO ] Deduced a trap composed of 35 places in 232 ms of which 1 ms to minimize.
[2022-05-20 05:46:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 369 ms
[2022-05-20 05:46:04] [INFO ] Deduced a trap composed of 26 places in 221 ms of which 0 ms to minimize.
[2022-05-20 05:46:04] [INFO ] Deduced a trap composed of 24 places in 217 ms of which 2 ms to minimize.
[2022-05-20 05:46:05] [INFO ] Deduced a trap composed of 17 places in 196 ms of which 0 ms to minimize.
[2022-05-20 05:46:05] [INFO ] Deduced a trap composed of 31 places in 206 ms of which 1 ms to minimize.
[2022-05-20 05:46:05] [INFO ] Deduced a trap composed of 29 places in 212 ms of which 1 ms to minimize.
[2022-05-20 05:46:05] [INFO ] Deduced a trap composed of 22 places in 196 ms of which 0 ms to minimize.
[2022-05-20 05:46:06] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1719 ms
[2022-05-20 05:46:06] [INFO ] Deduced a trap composed of 27 places in 198 ms of which 1 ms to minimize.
[2022-05-20 05:46:06] [INFO ] Deduced a trap composed of 32 places in 198 ms of which 1 ms to minimize.
[2022-05-20 05:46:06] [INFO ] Deduced a trap composed of 31 places in 194 ms of which 1 ms to minimize.
[2022-05-20 05:46:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 861 ms
[2022-05-20 05:46:07] [INFO ] Deduced a trap composed of 40 places in 298 ms of which 1 ms to minimize.
[2022-05-20 05:46:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 437 ms
[2022-05-20 05:46:08] [INFO ] Deduced a trap composed of 34 places in 529 ms of which 1 ms to minimize.
[2022-05-20 05:46:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 670 ms
[2022-05-20 05:46:08] [INFO ] Deduced a trap composed of 50 places in 506 ms of which 1 ms to minimize.
[2022-05-20 05:46:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 645 ms
[2022-05-20 05:46:09] [INFO ] Deduced a trap composed of 32 places in 459 ms of which 2 ms to minimize.
[2022-05-20 05:46:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 596 ms
[2022-05-20 05:46:10] [INFO ] Deduced a trap composed of 31 places in 263 ms of which 1 ms to minimize.
[2022-05-20 05:46:10] [INFO ] Deduced a trap composed of 42 places in 264 ms of which 1 ms to minimize.
[2022-05-20 05:46:10] [INFO ] Deduced a trap composed of 34 places in 260 ms of which 1 ms to minimize.
[2022-05-20 05:46:11] [INFO ] Deduced a trap composed of 16 places in 867 ms of which 3 ms to minimize.
[2022-05-20 05:46:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 05:46:11] [INFO ] After 25885ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:53
Fused 53 Parikh solutions to 51 different solutions.
Parikh walk visited 0 properties in 2557 ms.
Support contains 80 out of 2038 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2038/2038 places, 1828/1828 transitions.
Drop transitions removed 378 transitions
Trivial Post-agglo rules discarded 378 transitions
Performed 378 trivial Post agglomeration. Transition count delta: 378
Iterating post reduction 0 with 378 rules applied. Total rules applied 378 place count 2038 transition count 1450
Reduce places removed 378 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 1 with 393 rules applied. Total rules applied 771 place count 1660 transition count 1435
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 786 place count 1645 transition count 1435
Performed 210 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 210 Pre rules applied. Total rules applied 786 place count 1645 transition count 1225
Deduced a syphon composed of 210 places in 2 ms
Reduce places removed 210 places and 0 transitions.
Iterating global reduction 3 with 420 rules applied. Total rules applied 1206 place count 1435 transition count 1225
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1212 place count 1429 transition count 1219
Iterating global reduction 3 with 6 rules applied. Total rules applied 1218 place count 1429 transition count 1219
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1218 place count 1429 transition count 1216
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1224 place count 1426 transition count 1216
Performed 494 Post agglomeration using F-continuation condition.Transition count delta: 494
Deduced a syphon composed of 494 places in 1 ms
Reduce places removed 494 places and 0 transitions.
Iterating global reduction 3 with 988 rules applied. Total rules applied 2212 place count 932 transition count 722
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2213 place count 932 transition count 721
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2215 place count 931 transition count 720
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 67 places in 2 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 4 with 134 rules applied. Total rules applied 2349 place count 864 transition count 720
Free-agglomeration rule applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 2357 place count 864 transition count 712
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 2365 place count 856 transition count 712
Partial Free-agglomeration rule applied 82 times.
Drop transitions removed 82 transitions
Iterating global reduction 5 with 82 rules applied. Total rules applied 2447 place count 856 transition count 712
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2448 place count 855 transition count 711
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2449 place count 854 transition count 711
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 2449 place count 854 transition count 709
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 2453 place count 852 transition count 709
Applied a total of 2453 rules in 592 ms. Remains 852 /2038 variables (removed 1186) and now considering 709/1828 (removed 1119) transitions.
Finished structural reductions, in 1 iterations. Remains : 852/2038 places, 709/1828 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 52) seen :21
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Running SMT prover for 31 properties.
// Phase 1: matrix 709 rows 852 cols
[2022-05-20 05:46:15] [INFO ] Computed 330 place invariants in 3 ms
[2022-05-20 05:46:16] [INFO ] After 509ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:31
[2022-05-20 05:46:16] [INFO ] [Nat]Absence check using 330 positive place invariants in 51 ms returned sat
[2022-05-20 05:46:18] [INFO ] After 1202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :31
[2022-05-20 05:46:18] [INFO ] State equation strengthened by 135 read => feed constraints.
[2022-05-20 05:46:19] [INFO ] After 1390ms SMT Verify possible using 135 Read/Feed constraints in natural domain returned unsat :0 sat :31
[2022-05-20 05:46:19] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 1 ms to minimize.
[2022-05-20 05:46:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2022-05-20 05:46:20] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 1 ms to minimize.
[2022-05-20 05:46:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2022-05-20 05:46:20] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 0 ms to minimize.
[2022-05-20 05:46:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2022-05-20 05:46:20] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 1 ms to minimize.
[2022-05-20 05:46:20] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2022-05-20 05:46:21] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 0 ms to minimize.
[2022-05-20 05:46:21] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 4 ms to minimize.
[2022-05-20 05:46:21] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2022-05-20 05:46:21] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 1 ms to minimize.
[2022-05-20 05:46:21] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 747 ms
[2022-05-20 05:46:21] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
[2022-05-20 05:46:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2022-05-20 05:46:21] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 1 ms to minimize.
[2022-05-20 05:46:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2022-05-20 05:46:22] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 1 ms to minimize.
[2022-05-20 05:46:22] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 1 ms to minimize.
[2022-05-20 05:46:22] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2022-05-20 05:46:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 379 ms
[2022-05-20 05:46:22] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 0 ms to minimize.
[2022-05-20 05:46:22] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2022-05-20 05:46:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 280 ms
[2022-05-20 05:46:23] [INFO ] Deduced a trap composed of 5 places in 240 ms of which 1 ms to minimize.
[2022-05-20 05:46:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 304 ms
[2022-05-20 05:46:23] [INFO ] After 5745ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :31
Attempting to minimize the solution found.
Minimization took 1452 ms.
[2022-05-20 05:46:25] [INFO ] After 9329ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :31
Parikh walk visited 1 properties in 506 ms.
Support contains 45 out of 852 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 852/852 places, 709/709 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 852 transition count 702
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 845 transition count 702
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 14 place count 845 transition count 690
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 38 place count 833 transition count 690
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 832 transition count 689
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 832 transition count 689
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 74 place count 815 transition count 672
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 88 place count 808 transition count 672
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 808 transition count 671
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 90 place count 807 transition count 671
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 807 transition count 671
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 94 place count 804 transition count 668
Applied a total of 94 rules in 144 ms. Remains 804 /852 variables (removed 48) and now considering 668/709 (removed 41) transitions.
Finished structural reductions, in 1 iterations. Remains : 804/852 places, 668/709 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 429 ms. (steps per millisecond=23 ) properties (out of 30) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Interrupted probabilistic random walk after 86512 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 86512 steps, saw 59454 distinct states, run finished after 3002 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 28 properties.
// Phase 1: matrix 668 rows 804 cols
[2022-05-20 05:46:29] [INFO ] Computed 330 place invariants in 2 ms
[2022-05-20 05:46:30] [INFO ] After 436ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:28
[2022-05-20 05:46:30] [INFO ] [Nat]Absence check using 330 positive place invariants in 47 ms returned sat
[2022-05-20 05:46:31] [INFO ] After 1025ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :28
[2022-05-20 05:46:31] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-20 05:46:32] [INFO ] After 767ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :28
[2022-05-20 05:46:32] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
[2022-05-20 05:46:32] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 2 ms to minimize.
[2022-05-20 05:46:33] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 0 ms to minimize.
[2022-05-20 05:46:33] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 0 ms to minimize.
[2022-05-20 05:46:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 472 ms
[2022-05-20 05:46:34] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 1 ms to minimize.
[2022-05-20 05:46:34] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2022-05-20 05:46:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 264 ms
[2022-05-20 05:46:34] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 1 ms to minimize.
[2022-05-20 05:46:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2022-05-20 05:46:34] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 1 ms to minimize.
[2022-05-20 05:46:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2022-05-20 05:46:34] [INFO ] After 3011ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :28
Attempting to minimize the solution found.
Minimization took 799 ms.
[2022-05-20 05:46:35] [INFO ] After 5634ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :28
Parikh walk visited 0 properties in 313 ms.
Support contains 42 out of 804 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 804/804 places, 668/668 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 804 transition count 667
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 803 transition count 667
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 803 transition count 667
Applied a total of 3 rules in 41 ms. Remains 803 /804 variables (removed 1) and now considering 667/668 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 803/804 places, 667/668 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 28) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Running SMT prover for 25 properties.
// Phase 1: matrix 667 rows 803 cols
[2022-05-20 05:46:36] [INFO ] Computed 330 place invariants in 2 ms
[2022-05-20 05:46:36] [INFO ] After 379ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:25
[2022-05-20 05:46:37] [INFO ] [Nat]Absence check using 330 positive place invariants in 45 ms returned sat
[2022-05-20 05:46:38] [INFO ] After 919ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :25
[2022-05-20 05:46:38] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-20 05:46:39] [INFO ] After 721ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :25
[2022-05-20 05:46:39] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 0 ms to minimize.
[2022-05-20 05:46:39] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 0 ms to minimize.
[2022-05-20 05:46:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 235 ms
[2022-05-20 05:46:39] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 0 ms to minimize.
[2022-05-20 05:46:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2022-05-20 05:46:39] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
[2022-05-20 05:46:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2022-05-20 05:46:40] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 0 ms to minimize.
[2022-05-20 05:46:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2022-05-20 05:46:40] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 0 ms to minimize.
[2022-05-20 05:46:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2022-05-20 05:46:40] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 0 ms to minimize.
[2022-05-20 05:46:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2022-05-20 05:46:41] [INFO ] After 2588ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :25
Attempting to minimize the solution found.
Minimization took 707 ms.
[2022-05-20 05:46:41] [INFO ] After 4948ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :25
Fused 25 Parikh solutions to 23 different solutions.
Parikh walk visited 0 properties in 406 ms.
Support contains 37 out of 803 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 803/803 places, 667/667 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 803 transition count 665
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 801 transition count 665
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 12 place count 797 transition count 661
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 797 transition count 660
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 796 transition count 660
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 796 transition count 660
Applied a total of 15 rules in 59 ms. Remains 796 /803 variables (removed 7) and now considering 660/667 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 796/803 places, 660/667 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 457 ms. (steps per millisecond=21 ) properties (out of 25) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Interrupted probabilistic random walk after 100628 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 100628 steps, saw 69189 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 24 properties.
// Phase 1: matrix 660 rows 796 cols
[2022-05-20 05:46:45] [INFO ] Computed 330 place invariants in 5 ms
[2022-05-20 05:46:46] [INFO ] After 373ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2022-05-20 05:46:46] [INFO ] [Nat]Absence check using 330 positive place invariants in 46 ms returned sat
[2022-05-20 05:46:47] [INFO ] After 897ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2022-05-20 05:46:47] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-20 05:46:48] [INFO ] After 690ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2022-05-20 05:46:48] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 0 ms to minimize.
[2022-05-20 05:46:48] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 0 ms to minimize.
[2022-05-20 05:46:48] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 0 ms to minimize.
[2022-05-20 05:46:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 365 ms
[2022-05-20 05:46:49] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 0 ms to minimize.
[2022-05-20 05:46:49] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 0 ms to minimize.
[2022-05-20 05:46:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 228 ms
[2022-05-20 05:46:49] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 0 ms to minimize.
[2022-05-20 05:46:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2022-05-20 05:46:50] [INFO ] After 2445ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 699 ms.
[2022-05-20 05:46:51] [INFO ] After 4740ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Fused 24 Parikh solutions to 21 different solutions.
Parikh walk visited 0 properties in 426 ms.
Support contains 35 out of 796 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 796/796 places, 660/660 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 796 transition count 659
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 795 transition count 659
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 795 transition count 659
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 794 transition count 658
Applied a total of 4 rules in 60 ms. Remains 794 /796 variables (removed 2) and now considering 658/660 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 794/796 places, 658/660 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Interrupted probabilistic random walk after 112809 steps, run timeout after 3003 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 112809 steps, saw 77292 distinct states, run finished after 3004 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 24 properties.
// Phase 1: matrix 658 rows 794 cols
[2022-05-20 05:46:55] [INFO ] Computed 330 place invariants in 6 ms
[2022-05-20 05:46:55] [INFO ] After 375ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2022-05-20 05:46:55] [INFO ] [Nat]Absence check using 330 positive place invariants in 44 ms returned sat
[2022-05-20 05:46:57] [INFO ] After 862ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2022-05-20 05:46:57] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-20 05:46:57] [INFO ] After 670ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2022-05-20 05:46:57] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 0 ms to minimize.
[2022-05-20 05:46:58] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 0 ms to minimize.
[2022-05-20 05:46:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 231 ms
[2022-05-20 05:46:58] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 1 ms to minimize.
[2022-05-20 05:46:58] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 0 ms to minimize.
[2022-05-20 05:46:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 241 ms
[2022-05-20 05:46:58] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
[2022-05-20 05:46:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2022-05-20 05:46:59] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 0 ms to minimize.
[2022-05-20 05:46:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2022-05-20 05:46:59] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 1 ms to minimize.
[2022-05-20 05:46:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2022-05-20 05:46:59] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2022-05-20 05:46:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2022-05-20 05:46:59] [INFO ] After 2615ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 675 ms.
[2022-05-20 05:47:00] [INFO ] After 4848ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Fused 24 Parikh solutions to 22 different solutions.
Parikh walk visited 0 properties in 342 ms.
Support contains 35 out of 794 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 794/794 places, 658/658 transitions.
Applied a total of 0 rules in 16 ms. Remains 794 /794 variables (removed 0) and now considering 658/658 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 794/794 places, 658/658 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 794/794 places, 658/658 transitions.
Applied a total of 0 rules in 14 ms. Remains 794 /794 variables (removed 0) and now considering 658/658 (removed 0) transitions.
// Phase 1: matrix 658 rows 794 cols
[2022-05-20 05:47:00] [INFO ] Computed 330 place invariants in 4 ms
[2022-05-20 05:47:01] [INFO ] Implicit Places using invariants in 391 ms returned [777, 781]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 393 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 792/794 places, 658/658 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 790 transition count 656
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 790 transition count 656
Applied a total of 4 rules in 24 ms. Remains 790 /792 variables (removed 2) and now considering 656/658 (removed 2) transitions.
// Phase 1: matrix 656 rows 790 cols
[2022-05-20 05:47:01] [INFO ] Computed 328 place invariants in 5 ms
[2022-05-20 05:47:01] [INFO ] Implicit Places using invariants in 375 ms returned []
// Phase 1: matrix 656 rows 790 cols
[2022-05-20 05:47:01] [INFO ] Computed 328 place invariants in 1 ms
[2022-05-20 05:47:01] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-20 05:47:02] [INFO ] Implicit Places using invariants and state equation in 791 ms returned []
Implicit Place search using SMT with State Equation took 1167 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 790/794 places, 656/658 transitions.
Finished structural reductions, in 2 iterations. Remains : 790/794 places, 656/658 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 24) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 22) seen :0
Interrupted probabilistic random walk after 93238 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 93238 steps, saw 65348 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 22 properties.
// Phase 1: matrix 656 rows 790 cols
[2022-05-20 05:47:05] [INFO ] Computed 328 place invariants in 1 ms
[2022-05-20 05:47:06] [INFO ] After 357ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2022-05-20 05:47:06] [INFO ] [Nat]Absence check using 328 positive place invariants in 46 ms returned sat
[2022-05-20 05:47:07] [INFO ] After 835ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :22
[2022-05-20 05:47:07] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-20 05:47:08] [INFO ] After 614ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :22
[2022-05-20 05:47:08] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 0 ms to minimize.
[2022-05-20 05:47:08] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 0 ms to minimize.
[2022-05-20 05:47:08] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 0 ms to minimize.
[2022-05-20 05:47:08] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 0 ms to minimize.
[2022-05-20 05:47:08] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 0 ms to minimize.
[2022-05-20 05:47:08] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2022-05-20 05:47:08] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 553 ms
[2022-05-20 05:47:09] [INFO ] After 2154ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :22
Attempting to minimize the solution found.
Minimization took 599 ms.
[2022-05-20 05:47:10] [INFO ] After 4271ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :22
Fused 22 Parikh solutions to 19 different solutions.
Parikh walk visited 0 properties in 416 ms.
Support contains 32 out of 790 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 790/790 places, 656/656 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 790 transition count 655
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 789 transition count 655
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 789 transition count 654
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 788 transition count 654
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 787 transition count 653
Applied a total of 6 rules in 29 ms. Remains 787 /790 variables (removed 3) and now considering 653/656 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 787/790 places, 653/656 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Interrupted probabilistic random walk after 99410 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 99410 steps, saw 87992 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 22 properties.
// Phase 1: matrix 653 rows 787 cols
[2022-05-20 05:47:14] [INFO ] Computed 328 place invariants in 2 ms
[2022-05-20 05:47:14] [INFO ] After 344ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2022-05-20 05:47:15] [INFO ] [Nat]Absence check using 328 positive place invariants in 41 ms returned sat
[2022-05-20 05:47:16] [INFO ] After 827ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :22
[2022-05-20 05:47:16] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-20 05:47:16] [INFO ] After 617ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :22
[2022-05-20 05:47:17] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2022-05-20 05:47:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2022-05-20 05:47:17] [INFO ] After 1720ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :22
Attempting to minimize the solution found.
Minimization took 610 ms.
[2022-05-20 05:47:18] [INFO ] After 3788ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :22
Parikh walk visited 0 properties in 398 ms.
Support contains 32 out of 787 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 787/787 places, 653/653 transitions.
Applied a total of 0 rules in 13 ms. Remains 787 /787 variables (removed 0) and now considering 653/653 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 787/787 places, 653/653 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 787/787 places, 653/653 transitions.
Applied a total of 0 rules in 13 ms. Remains 787 /787 variables (removed 0) and now considering 653/653 (removed 0) transitions.
// Phase 1: matrix 653 rows 787 cols
[2022-05-20 05:47:18] [INFO ] Computed 328 place invariants in 3 ms
[2022-05-20 05:47:19] [INFO ] Implicit Places using invariants in 386 ms returned []
// Phase 1: matrix 653 rows 787 cols
[2022-05-20 05:47:19] [INFO ] Computed 328 place invariants in 2 ms
[2022-05-20 05:47:19] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-20 05:47:20] [INFO ] Implicit Places using invariants and state equation in 778 ms returned []
Implicit Place search using SMT with State Equation took 1165 ms to find 0 implicit places.
[2022-05-20 05:47:20] [INFO ] Redundant transitions in 39 ms returned []
// Phase 1: matrix 653 rows 787 cols
[2022-05-20 05:47:20] [INFO ] Computed 328 place invariants in 5 ms
[2022-05-20 05:47:20] [INFO ] Dead Transitions using invariants and state equation in 327 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 787/787 places, 653/653 transitions.
Partial Free-agglomeration rule applied 150 times.
Drop transitions removed 150 transitions
Iterating global reduction 0 with 150 rules applied. Total rules applied 150 place count 787 transition count 653
Applied a total of 150 rules in 28 ms. Remains 787 /787 variables (removed 0) and now considering 653/653 (removed 0) transitions.
Running SMT prover for 22 properties.
// Phase 1: matrix 653 rows 787 cols
[2022-05-20 05:47:20] [INFO ] Computed 328 place invariants in 4 ms
[2022-05-20 05:47:20] [INFO ] After 349ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2022-05-20 05:47:21] [INFO ] [Nat]Absence check using 328 positive place invariants in 46 ms returned sat
[2022-05-20 05:47:22] [INFO ] After 837ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :22
[2022-05-20 05:47:22] [INFO ] State equation strengthened by 136 read => feed constraints.
[2022-05-20 05:47:23] [INFO ] After 823ms SMT Verify possible using 136 Read/Feed constraints in natural domain returned unsat :0 sat :22
[2022-05-20 05:47:23] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2022-05-20 05:47:23] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 0 ms to minimize.
[2022-05-20 05:47:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 292 ms
[2022-05-20 05:47:23] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 1 ms to minimize.
[2022-05-20 05:47:23] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 0 ms to minimize.
[2022-05-20 05:47:23] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 0 ms to minimize.
[2022-05-20 05:47:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 458 ms
[2022-05-20 05:47:24] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 0 ms to minimize.
[2022-05-20 05:47:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2022-05-20 05:47:24] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 1 ms to minimize.
[2022-05-20 05:47:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2022-05-20 05:47:24] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 0 ms to minimize.
[2022-05-20 05:47:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2022-05-20 05:47:25] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 1 ms to minimize.
[2022-05-20 05:47:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2022-05-20 05:47:25] [INFO ] After 3196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :22
Attempting to minimize the solution found.
Minimization took 732 ms.
[2022-05-20 05:47:26] [INFO ] After 5412ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :22
[2022-05-20 05:47:26] [INFO ] Flatten gal took : 40 ms
[2022-05-20 05:47:26] [INFO ] Flatten gal took : 36 ms
[2022-05-20 05:47:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8640422661706830018.gal : 23 ms
[2022-05-20 05:47:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10380136471701744788.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms7444007071611987533;'/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/ReachabilityCardinality8640422661706830018.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10380136471701744788.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/ReachabilityCardinality10380136471701744788.prop.
SDD proceeding with computation,22 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,22 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,22 properties remain. new max is 16
SDD size :4 after 8
SDD proceeding with computation,22 properties remain. new max is 32
SDD size :8 after 16
SDD proceeding with computation,22 properties remain. new max is 64
SDD size :16 after 32
SDD proceeding with computation,22 properties remain. new max is 128
SDD size :32 after 576
Reachability property AtomicPropp81 is true.
Reachability property AtomicPropp79 is true.
Reachability property AtomicPropp66 is true.
Reachability property AtomicPropp42 is true.
Reachability property AtomicPropp31 is true.
Reachability property AtomicPropp28 is true.
Reachability property AtomicPropp23 is true.
Reachability property AtomicPropp8 is true.
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :576 after 15357
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :15357 after 17049
Reachability property AtomicPropp40 is true.
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :17049 after 61388
Reachability property AtomicPropp10 is true.
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :61388 after 1.4353e+06
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :1.4353e+06 after 3.64626e+06
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :3.64626e+06 after 2.91403e+07
SDD proceeding with computation,12 properties remain. new max is 2048
SDD size :2.91403e+07 after 6.64845e+07
SDD proceeding with computation,12 properties remain. new max is 4096
SDD size :6.64845e+07 after 1.64175e+10
SDD proceeding with computation,12 properties remain. new max is 8192
SDD size :1.64175e+10 after 4.83958e+10
SDD proceeding with computation,12 properties remain. new max is 16384
SDD size :4.83958e+10 after 1.39189e+14
Reachability property AtomicPropp34 is true.
SDD proceeding with computation,11 properties remain. new max is 16384
SDD size :1.39189e+14 after 2.15309e+21
Reachability property AtomicPropp53 is true.
SDD proceeding with computation,10 properties remain. new max is 16384
SDD size :2.15309e+21 after 5.88457e+23
Reachability property AtomicPropp68 is true.
SDD proceeding with computation,9 properties remain. new max is 16384
SDD size :5.88457e+23 after 2.46475e+26
SDD proceeding with computation,9 properties remain. new max is 32768
SDD size :2.46475e+26 after 2.60998e+27
Reachability property AtomicPropp71 is true.
Reachability property AtomicPropp67 is true.
Reachability property AtomicPropp26 is true.
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :2.60998e+27 after 6.23794e+33
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :6.23794e+33 after 4.82222e+35
Detected timeout of ITS tools.
[2022-05-20 05:47:41] [INFO ] Flatten gal took : 33 ms
[2022-05-20 05:47:41] [INFO ] Applying decomposition
[2022-05-20 05:47:41] [INFO ] Flatten gal took : 30 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/graph14112796815254914116.txt' '-o' '/tmp/graph14112796815254914116.bin' '-w' '/tmp/graph14112796815254914116.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14112796815254914116.bin' '-l' '-1' '-v' '-w' '/tmp/graph14112796815254914116.weights' '-q' '0' '-e' '0.001'
[2022-05-20 05:47:41] [INFO ] Decomposing Gal with order
[2022-05-20 05:47:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 05:47:41] [INFO ] Removed a total of 171 redundant transitions.
[2022-05-20 05:47:41] [INFO ] Flatten gal took : 88 ms
[2022-05-20 05:47:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 95 labels/synchronizations in 14 ms.
[2022-05-20 05:47:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9562760441090131729.gal : 12 ms
[2022-05-20 05:47:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15483079397017260497.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms7444007071611987533;'/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/ReachabilityCardinality9562760441090131729.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15483079397017260497.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/ReachabilityCardinality15483079397017260497.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :4 after 4
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :4 after 32
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :32 after 32
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :32 after 4608
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :6.45323e+08 after 1.22069e+15
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17877711929510775294
[2022-05-20 05:47:57] [INFO ] Built C files in 280ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17877711929510775294
Running compilation step : cd /tmp/ltsmin17877711929510775294;'/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 1151 ms.
Running link step : cd /tmp/ltsmin17877711929510775294;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin17877711929510775294;'/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' 'AtomicPropp17==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2022-05-20 05:48:12] [INFO ] Flatten gal took : 57 ms
[2022-05-20 05:48:12] [INFO ] Flatten gal took : 51 ms
[2022-05-20 05:48:12] [INFO ] Input system was already deterministic with 1828 transitions.
Computed a total of 481 stabilizing places and 481 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 2038/2038 places, 1828/1828 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 2014 transition count 1804
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 2014 transition count 1804
Applied a total of 48 rules in 187 ms. Remains 2014 /2038 variables (removed 24) and now considering 1804/1828 (removed 24) transitions.
// Phase 1: matrix 1804 rows 2014 cols
[2022-05-20 05:48:12] [INFO ] Computed 331 place invariants in 9 ms
[2022-05-20 05:48:13] [INFO ] Implicit Places using invariants in 570 ms returned []
// Phase 1: matrix 1804 rows 2014 cols
[2022-05-20 05:48:13] [INFO ] Computed 331 place invariants in 10 ms
[2022-05-20 05:48:14] [INFO ] Implicit Places using invariants and state equation in 1682 ms returned []
Implicit Place search using SMT with State Equation took 2255 ms to find 0 implicit places.
// Phase 1: matrix 1804 rows 2014 cols
[2022-05-20 05:48:14] [INFO ] Computed 331 place invariants in 5 ms
[2022-05-20 05:48:15] [INFO ] Dead Transitions using invariants and state equation in 913 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2014/2038 places, 1804/1828 transitions.
Finished structural reductions, in 1 iterations. Remains : 2014/2038 places, 1804/1828 transitions.
[2022-05-20 05:48:15] [INFO ] Flatten gal took : 44 ms
[2022-05-20 05:48:15] [INFO ] Flatten gal took : 45 ms
[2022-05-20 05:48:15] [INFO ] Input system was already deterministic with 1804 transitions.
[2022-05-20 05:48:15] [INFO ] Flatten gal took : 42 ms
[2022-05-20 05:48:15] [INFO ] Flatten gal took : 62 ms
[2022-05-20 05:48:15] [INFO ] Time to serialize gal into /tmp/CTLFireability6367390177841121189.gal : 9 ms
[2022-05-20 05:48:16] [INFO ] Time to serialize properties into /tmp/CTLFireability17947273161946945785.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6367390177841121189.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17947273161946945785.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-20 05:48:46] [INFO ] Flatten gal took : 43 ms
[2022-05-20 05:48:46] [INFO ] Applying decomposition
[2022-05-20 05:48:46] [INFO ] Flatten gal took : 41 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/graph15192268545098942027.txt' '-o' '/tmp/graph15192268545098942027.bin' '-w' '/tmp/graph15192268545098942027.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15192268545098942027.bin' '-l' '-1' '-v' '-w' '/tmp/graph15192268545098942027.weights' '-q' '0' '-e' '0.001'
[2022-05-20 05:48:46] [INFO ] Decomposing Gal with order
[2022-05-20 05:48:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 05:48:46] [INFO ] Removed a total of 298 redundant transitions.
[2022-05-20 05:48:46] [INFO ] Flatten gal took : 93 ms
[2022-05-20 05:48:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 21 ms.
[2022-05-20 05:48:46] [INFO ] Time to serialize gal into /tmp/CTLFireability8765714350740298955.gal : 33 ms
[2022-05-20 05:48:46] [INFO ] Time to serialize properties into /tmp/CTLFireability9746090107614860974.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8765714350740298955.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9746090107614860974.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 2038/2038 places, 1828/1828 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 2012 transition count 1802
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 2012 transition count 1802
Applied a total of 52 rules in 202 ms. Remains 2012 /2038 variables (removed 26) and now considering 1802/1828 (removed 26) transitions.
// Phase 1: matrix 1802 rows 2012 cols
[2022-05-20 05:49:16] [INFO ] Computed 331 place invariants in 10 ms
[2022-05-20 05:49:17] [INFO ] Implicit Places using invariants in 573 ms returned []
// Phase 1: matrix 1802 rows 2012 cols
[2022-05-20 05:49:17] [INFO ] Computed 331 place invariants in 4 ms
[2022-05-20 05:49:19] [INFO ] Implicit Places using invariants and state equation in 1587 ms returned []
Implicit Place search using SMT with State Equation took 2162 ms to find 0 implicit places.
// Phase 1: matrix 1802 rows 2012 cols
[2022-05-20 05:49:19] [INFO ] Computed 331 place invariants in 5 ms
[2022-05-20 05:49:20] [INFO ] Dead Transitions using invariants and state equation in 900 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2012/2038 places, 1802/1828 transitions.
Finished structural reductions, in 1 iterations. Remains : 2012/2038 places, 1802/1828 transitions.
[2022-05-20 05:49:20] [INFO ] Flatten gal took : 37 ms
[2022-05-20 05:49:20] [INFO ] Flatten gal took : 38 ms
[2022-05-20 05:49:20] [INFO ] Input system was already deterministic with 1802 transitions.
[2022-05-20 05:49:20] [INFO ] Flatten gal took : 38 ms
[2022-05-20 05:49:20] [INFO ] Flatten gal took : 38 ms
[2022-05-20 05:49:20] [INFO ] Time to serialize gal into /tmp/CTLFireability4382860947998530371.gal : 7 ms
[2022-05-20 05:49:20] [INFO ] Time to serialize properties into /tmp/CTLFireability1270316964610493311.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4382860947998530371.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1270316964610493311.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-20 05:49:50] [INFO ] Flatten gal took : 37 ms
[2022-05-20 05:49:50] [INFO ] Applying decomposition
[2022-05-20 05:49:50] [INFO ] Flatten gal took : 37 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/graph10038539458978500963.txt' '-o' '/tmp/graph10038539458978500963.bin' '-w' '/tmp/graph10038539458978500963.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10038539458978500963.bin' '-l' '-1' '-v' '-w' '/tmp/graph10038539458978500963.weights' '-q' '0' '-e' '0.001'
[2022-05-20 05:49:50] [INFO ] Decomposing Gal with order
[2022-05-20 05:49:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 05:49:50] [INFO ] Removed a total of 299 redundant transitions.
[2022-05-20 05:49:50] [INFO ] Flatten gal took : 72 ms
[2022-05-20 05:49:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2022-05-20 05:49:50] [INFO ] Time to serialize gal into /tmp/CTLFireability14561656130680585424.gal : 11 ms
[2022-05-20 05:49:50] [INFO ] Time to serialize properties into /tmp/CTLFireability14250979372290125427.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14561656130680585424.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14250979372290125427.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 2038/2038 places, 1828/1828 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 2013 transition count 1803
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 2013 transition count 1803
Applied a total of 50 rules in 181 ms. Remains 2013 /2038 variables (removed 25) and now considering 1803/1828 (removed 25) transitions.
// Phase 1: matrix 1803 rows 2013 cols
[2022-05-20 05:50:21] [INFO ] Computed 331 place invariants in 13 ms
[2022-05-20 05:50:21] [INFO ] Implicit Places using invariants in 612 ms returned []
// Phase 1: matrix 1803 rows 2013 cols
[2022-05-20 05:50:21] [INFO ] Computed 331 place invariants in 4 ms
[2022-05-20 05:50:23] [INFO ] Implicit Places using invariants and state equation in 1598 ms returned []
Implicit Place search using SMT with State Equation took 2211 ms to find 0 implicit places.
// Phase 1: matrix 1803 rows 2013 cols
[2022-05-20 05:50:23] [INFO ] Computed 331 place invariants in 8 ms
[2022-05-20 05:50:24] [INFO ] Dead Transitions using invariants and state equation in 919 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2013/2038 places, 1803/1828 transitions.
Finished structural reductions, in 1 iterations. Remains : 2013/2038 places, 1803/1828 transitions.
[2022-05-20 05:50:24] [INFO ] Flatten gal took : 36 ms
[2022-05-20 05:50:24] [INFO ] Flatten gal took : 48 ms
[2022-05-20 05:50:24] [INFO ] Input system was already deterministic with 1803 transitions.
[2022-05-20 05:50:24] [INFO ] Flatten gal took : 38 ms
[2022-05-20 05:50:24] [INFO ] Flatten gal took : 37 ms
[2022-05-20 05:50:24] [INFO ] Time to serialize gal into /tmp/CTLFireability16734355291807815209.gal : 4 ms
[2022-05-20 05:50:24] [INFO ] Time to serialize properties into /tmp/CTLFireability14511809303747059239.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16734355291807815209.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14511809303747059239.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-20 05:50:54] [INFO ] Flatten gal took : 38 ms
[2022-05-20 05:50:54] [INFO ] Applying decomposition
[2022-05-20 05:50:54] [INFO ] Flatten gal took : 46 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/graph2385789808563706868.txt' '-o' '/tmp/graph2385789808563706868.bin' '-w' '/tmp/graph2385789808563706868.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2385789808563706868.bin' '-l' '-1' '-v' '-w' '/tmp/graph2385789808563706868.weights' '-q' '0' '-e' '0.001'
[2022-05-20 05:50:54] [INFO ] Decomposing Gal with order
[2022-05-20 05:50:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 05:50:54] [INFO ] Removed a total of 298 redundant transitions.
[2022-05-20 05:50:54] [INFO ] Flatten gal took : 73 ms
[2022-05-20 05:50:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 23 ms.
[2022-05-20 05:50:54] [INFO ] Time to serialize gal into /tmp/CTLFireability2675163803987384090.gal : 12 ms
[2022-05-20 05:50:55] [INFO ] Time to serialize properties into /tmp/CTLFireability17946087162124713810.ctl : 297 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2675163803987384090.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17946087162124713810.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 2038/2038 places, 1828/1828 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 430 transitions
Trivial Post-agglo rules discarded 430 transitions
Performed 430 trivial Post agglomeration. Transition count delta: 430
Iterating post reduction 0 with 430 rules applied. Total rules applied 430 place count 2037 transition count 1397
Reduce places removed 430 places and 0 transitions.
Iterating post reduction 1 with 430 rules applied. Total rules applied 860 place count 1607 transition count 1397
Performed 222 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 222 Pre rules applied. Total rules applied 860 place count 1607 transition count 1175
Deduced a syphon composed of 222 places in 1 ms
Reduce places removed 222 places and 0 transitions.
Iterating global reduction 2 with 444 rules applied. Total rules applied 1304 place count 1385 transition count 1175
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1318 place count 1371 transition count 1161
Iterating global reduction 2 with 14 rules applied. Total rules applied 1332 place count 1371 transition count 1161
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 1332 place count 1371 transition count 1152
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 1350 place count 1362 transition count 1152
Performed 487 Post agglomeration using F-continuation condition.Transition count delta: 487
Deduced a syphon composed of 487 places in 1 ms
Reduce places removed 487 places and 0 transitions.
Iterating global reduction 2 with 974 rules applied. Total rules applied 2324 place count 875 transition count 665
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2325 place count 875 transition count 664
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2327 place count 874 transition count 663
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2329 place count 872 transition count 661
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2330 place count 871 transition count 661
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2330 place count 871 transition count 659
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2334 place count 869 transition count 659
Applied a total of 2334 rules in 354 ms. Remains 869 /2038 variables (removed 1169) and now considering 659/1828 (removed 1169) transitions.
// Phase 1: matrix 659 rows 869 cols
[2022-05-20 05:51:25] [INFO ] Computed 330 place invariants in 4 ms
[2022-05-20 05:51:26] [INFO ] Implicit Places using invariants in 388 ms returned [849, 853]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 390 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 867/2038 places, 659/1828 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 865 transition count 657
Applied a total of 4 rules in 33 ms. Remains 865 /867 variables (removed 2) and now considering 657/659 (removed 2) transitions.
// Phase 1: matrix 657 rows 865 cols
[2022-05-20 05:51:26] [INFO ] Computed 328 place invariants in 3 ms
[2022-05-20 05:51:26] [INFO ] Implicit Places using invariants in 372 ms returned []
// Phase 1: matrix 657 rows 865 cols
[2022-05-20 05:51:26] [INFO ] Computed 328 place invariants in 1 ms
[2022-05-20 05:51:27] [INFO ] Implicit Places using invariants and state equation in 645 ms returned []
Implicit Place search using SMT with State Equation took 1019 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 865/2038 places, 657/1828 transitions.
Finished structural reductions, in 2 iterations. Remains : 865/2038 places, 657/1828 transitions.
[2022-05-20 05:51:27] [INFO ] Flatten gal took : 17 ms
[2022-05-20 05:51:27] [INFO ] Flatten gal took : 18 ms
[2022-05-20 05:51:27] [INFO ] Input system was already deterministic with 657 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 298350 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :{}
Probabilistic random walk after 298350 steps, saw 212862 distinct states, run finished after 3001 ms. (steps per millisecond=99 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 657 rows 865 cols
[2022-05-20 05:51:30] [INFO ] Computed 328 place invariants in 3 ms
[2022-05-20 05:51:30] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 05:51:30] [INFO ] [Nat]Absence check using 328 positive place invariants in 40 ms returned sat
[2022-05-20 05:51:30] [INFO ] After 245ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 05:51:30] [INFO ] After 287ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2022-05-20 05:51:30] [INFO ] After 461ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 212 ms.
Support contains 3 out of 865 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 865/865 places, 657/657 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 60 place count 835 transition count 627
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 0 with 176 rules applied. Total rules applied 236 place count 747 transition count 627
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 237 place count 747 transition count 626
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 238 place count 746 transition count 626
Applied a total of 238 rules in 57 ms. Remains 746 /865 variables (removed 119) and now considering 626/657 (removed 31) transitions.
Finished structural reductions, in 1 iterations. Remains : 746/865 places, 626/657 transitions.
Finished random walk after 288279 steps, including 0 resets, run visited all 1 properties in 1537 ms. (steps per millisecond=187 )
FORMULA ShieldPPPt-PT-030B-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 2038/2038 places, 1828/1828 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 2012 transition count 1802
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 2012 transition count 1802
Applied a total of 52 rules in 174 ms. Remains 2012 /2038 variables (removed 26) and now considering 1802/1828 (removed 26) transitions.
// Phase 1: matrix 1802 rows 2012 cols
[2022-05-20 05:51:32] [INFO ] Computed 331 place invariants in 4 ms
[2022-05-20 05:51:33] [INFO ] Implicit Places using invariants in 587 ms returned []
// Phase 1: matrix 1802 rows 2012 cols
[2022-05-20 05:51:33] [INFO ] Computed 331 place invariants in 4 ms
[2022-05-20 05:51:35] [INFO ] Implicit Places using invariants and state equation in 1588 ms returned []
Implicit Place search using SMT with State Equation took 2179 ms to find 0 implicit places.
// Phase 1: matrix 1802 rows 2012 cols
[2022-05-20 05:51:35] [INFO ] Computed 331 place invariants in 7 ms
[2022-05-20 05:51:35] [INFO ] Dead Transitions using invariants and state equation in 970 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2012/2038 places, 1802/1828 transitions.
Finished structural reductions, in 1 iterations. Remains : 2012/2038 places, 1802/1828 transitions.
[2022-05-20 05:51:36] [INFO ] Flatten gal took : 39 ms
[2022-05-20 05:51:36] [INFO ] Flatten gal took : 41 ms
[2022-05-20 05:51:36] [INFO ] Input system was already deterministic with 1802 transitions.
[2022-05-20 05:51:36] [INFO ] Flatten gal took : 41 ms
[2022-05-20 05:51:36] [INFO ] Flatten gal took : 41 ms
[2022-05-20 05:51:36] [INFO ] Time to serialize gal into /tmp/CTLFireability1714208818490206571.gal : 4 ms
[2022-05-20 05:51:36] [INFO ] Time to serialize properties into /tmp/CTLFireability14241335893086990463.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1714208818490206571.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14241335893086990463.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-20 05:52:06] [INFO ] Flatten gal took : 41 ms
[2022-05-20 05:52:06] [INFO ] Applying decomposition
[2022-05-20 05:52:06] [INFO ] Flatten gal took : 38 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/graph7671378456986089661.txt' '-o' '/tmp/graph7671378456986089661.bin' '-w' '/tmp/graph7671378456986089661.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7671378456986089661.bin' '-l' '-1' '-v' '-w' '/tmp/graph7671378456986089661.weights' '-q' '0' '-e' '0.001'
[2022-05-20 05:52:06] [INFO ] Decomposing Gal with order
[2022-05-20 05:52:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 05:52:06] [INFO ] Removed a total of 298 redundant transitions.
[2022-05-20 05:52:06] [INFO ] Flatten gal took : 69 ms
[2022-05-20 05:52:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2022-05-20 05:52:06] [INFO ] Time to serialize gal into /tmp/CTLFireability16093996306308061837.gal : 11 ms
[2022-05-20 05:52:06] [INFO ] Time to serialize properties into /tmp/CTLFireability1061926951216049994.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16093996306308061837.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1061926951216049994.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 2038/2038 places, 1828/1828 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 2013 transition count 1803
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 2013 transition count 1803
Applied a total of 50 rules in 182 ms. Remains 2013 /2038 variables (removed 25) and now considering 1803/1828 (removed 25) transitions.
// Phase 1: matrix 1803 rows 2013 cols
[2022-05-20 05:52:37] [INFO ] Computed 331 place invariants in 7 ms
[2022-05-20 05:52:37] [INFO ] Implicit Places using invariants in 541 ms returned []
// Phase 1: matrix 1803 rows 2013 cols
[2022-05-20 05:52:37] [INFO ] Computed 331 place invariants in 4 ms
[2022-05-20 05:52:39] [INFO ] Implicit Places using invariants and state equation in 1506 ms returned []
Implicit Place search using SMT with State Equation took 2049 ms to find 0 implicit places.
// Phase 1: matrix 1803 rows 2013 cols
[2022-05-20 05:52:39] [INFO ] Computed 331 place invariants in 5 ms
[2022-05-20 05:52:39] [INFO ] Dead Transitions using invariants and state equation in 908 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2013/2038 places, 1803/1828 transitions.
Finished structural reductions, in 1 iterations. Remains : 2013/2038 places, 1803/1828 transitions.
[2022-05-20 05:52:39] [INFO ] Flatten gal took : 40 ms
[2022-05-20 05:52:40] [INFO ] Flatten gal took : 38 ms
[2022-05-20 05:52:40] [INFO ] Input system was already deterministic with 1803 transitions.
[2022-05-20 05:52:40] [INFO ] Flatten gal took : 37 ms
[2022-05-20 05:52:40] [INFO ] Flatten gal took : 50 ms
[2022-05-20 05:52:40] [INFO ] Time to serialize gal into /tmp/CTLFireability6886140434191646350.gal : 4 ms
[2022-05-20 05:52:40] [INFO ] Time to serialize properties into /tmp/CTLFireability7882173284503206877.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6886140434191646350.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7882173284503206877.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-20 05:53:10] [INFO ] Flatten gal took : 41 ms
[2022-05-20 05:53:10] [INFO ] Applying decomposition
[2022-05-20 05:53:10] [INFO ] Flatten gal took : 37 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/graph18124468042775555806.txt' '-o' '/tmp/graph18124468042775555806.bin' '-w' '/tmp/graph18124468042775555806.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18124468042775555806.bin' '-l' '-1' '-v' '-w' '/tmp/graph18124468042775555806.weights' '-q' '0' '-e' '0.001'
[2022-05-20 05:53:10] [INFO ] Decomposing Gal with order
[2022-05-20 05:53:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 05:53:10] [INFO ] Removed a total of 293 redundant transitions.
[2022-05-20 05:53:10] [INFO ] Flatten gal took : 83 ms
[2022-05-20 05:53:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2022-05-20 05:53:10] [INFO ] Time to serialize gal into /tmp/CTLFireability1972294880666606666.gal : 9 ms
[2022-05-20 05:53:10] [INFO ] Time to serialize properties into /tmp/CTLFireability1606513462197031397.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1972294880666606666.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1606513462197031397.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 2038/2038 places, 1828/1828 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 432 transitions
Trivial Post-agglo rules discarded 432 transitions
Performed 432 trivial Post agglomeration. Transition count delta: 432
Iterating post reduction 0 with 432 rules applied. Total rules applied 432 place count 2037 transition count 1395
Reduce places removed 432 places and 0 transitions.
Iterating post reduction 1 with 432 rules applied. Total rules applied 864 place count 1605 transition count 1395
Performed 221 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 221 Pre rules applied. Total rules applied 864 place count 1605 transition count 1174
Deduced a syphon composed of 221 places in 1 ms
Reduce places removed 221 places and 0 transitions.
Iterating global reduction 2 with 442 rules applied. Total rules applied 1306 place count 1384 transition count 1174
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1319 place count 1371 transition count 1161
Iterating global reduction 2 with 13 rules applied. Total rules applied 1332 place count 1371 transition count 1161
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 1332 place count 1371 transition count 1152
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 1350 place count 1362 transition count 1152
Performed 488 Post agglomeration using F-continuation condition.Transition count delta: 488
Deduced a syphon composed of 488 places in 1 ms
Reduce places removed 488 places and 0 transitions.
Iterating global reduction 2 with 976 rules applied. Total rules applied 2326 place count 874 transition count 664
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2327 place count 874 transition count 663
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2329 place count 873 transition count 662
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2331 place count 871 transition count 660
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2332 place count 870 transition count 660
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2332 place count 870 transition count 658
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2336 place count 868 transition count 658
Applied a total of 2336 rules in 259 ms. Remains 868 /2038 variables (removed 1170) and now considering 658/1828 (removed 1170) transitions.
// Phase 1: matrix 658 rows 868 cols
[2022-05-20 05:53:41] [INFO ] Computed 330 place invariants in 3 ms
[2022-05-20 05:53:41] [INFO ] Implicit Places using invariants in 340 ms returned [848, 852]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 341 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 866/2038 places, 658/1828 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 864 transition count 656
Applied a total of 4 rules in 31 ms. Remains 864 /866 variables (removed 2) and now considering 656/658 (removed 2) transitions.
// Phase 1: matrix 656 rows 864 cols
[2022-05-20 05:53:41] [INFO ] Computed 328 place invariants in 2 ms
[2022-05-20 05:53:41] [INFO ] Implicit Places using invariants in 349 ms returned []
// Phase 1: matrix 656 rows 864 cols
[2022-05-20 05:53:41] [INFO ] Computed 328 place invariants in 1 ms
[2022-05-20 05:53:42] [INFO ] Implicit Places using invariants and state equation in 632 ms returned []
Implicit Place search using SMT with State Equation took 982 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 864/2038 places, 656/1828 transitions.
Finished structural reductions, in 2 iterations. Remains : 864/2038 places, 656/1828 transitions.
[2022-05-20 05:53:42] [INFO ] Flatten gal took : 17 ms
[2022-05-20 05:53:42] [INFO ] Flatten gal took : 18 ms
[2022-05-20 05:53:42] [INFO ] Input system was already deterministic with 656 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 289676 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 289676 steps, saw 213655 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 656 rows 864 cols
[2022-05-20 05:53:45] [INFO ] Computed 328 place invariants in 1 ms
[2022-05-20 05:53:45] [INFO ] [Real]Absence check using 328 positive place invariants in 43 ms returned sat
[2022-05-20 05:53:45] [INFO ] After 394ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 05:53:46] [INFO ] [Nat]Absence check using 328 positive place invariants in 42 ms returned sat
[2022-05-20 05:53:46] [INFO ] After 247ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 05:53:46] [INFO ] After 294ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2022-05-20 05:53:46] [INFO ] After 467ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 207 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=69 )
FORMULA ShieldPPPt-PT-030B-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 2 ms.
Starting structural reductions in LTL mode, iteration 0 : 2038/2038 places, 1828/1828 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 2011 transition count 1801
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 2011 transition count 1801
Applied a total of 54 rules in 172 ms. Remains 2011 /2038 variables (removed 27) and now considering 1801/1828 (removed 27) transitions.
// Phase 1: matrix 1801 rows 2011 cols
[2022-05-20 05:53:46] [INFO ] Computed 331 place invariants in 9 ms
[2022-05-20 05:53:47] [INFO ] Implicit Places using invariants in 546 ms returned []
// Phase 1: matrix 1801 rows 2011 cols
[2022-05-20 05:53:47] [INFO ] Computed 331 place invariants in 4 ms
[2022-05-20 05:53:48] [INFO ] Implicit Places using invariants and state equation in 1615 ms returned []
Implicit Place search using SMT with State Equation took 2163 ms to find 0 implicit places.
// Phase 1: matrix 1801 rows 2011 cols
[2022-05-20 05:53:48] [INFO ] Computed 331 place invariants in 8 ms
[2022-05-20 05:53:49] [INFO ] Dead Transitions using invariants and state equation in 916 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2011/2038 places, 1801/1828 transitions.
Finished structural reductions, in 1 iterations. Remains : 2011/2038 places, 1801/1828 transitions.
[2022-05-20 05:53:49] [INFO ] Flatten gal took : 35 ms
[2022-05-20 05:53:49] [INFO ] Flatten gal took : 37 ms
[2022-05-20 05:53:49] [INFO ] Input system was already deterministic with 1801 transitions.
[2022-05-20 05:53:49] [INFO ] Flatten gal took : 37 ms
[2022-05-20 05:53:49] [INFO ] Flatten gal took : 37 ms
[2022-05-20 05:53:49] [INFO ] Time to serialize gal into /tmp/CTLFireability10639603639335399560.gal : 4 ms
[2022-05-20 05:53:49] [INFO ] Time to serialize properties into /tmp/CTLFireability17857210195767889211.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10639603639335399560.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17857210195767889211.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-20 05:54:19] [INFO ] Flatten gal took : 38 ms
[2022-05-20 05:54:19] [INFO ] Applying decomposition
[2022-05-20 05:54:20] [INFO ] Flatten gal took : 44 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/graph6316090099464498774.txt' '-o' '/tmp/graph6316090099464498774.bin' '-w' '/tmp/graph6316090099464498774.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6316090099464498774.bin' '-l' '-1' '-v' '-w' '/tmp/graph6316090099464498774.weights' '-q' '0' '-e' '0.001'
[2022-05-20 05:54:20] [INFO ] Decomposing Gal with order
[2022-05-20 05:54:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 05:54:20] [INFO ] Removed a total of 300 redundant transitions.
[2022-05-20 05:54:20] [INFO ] Flatten gal took : 73 ms
[2022-05-20 05:54:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-05-20 05:54:20] [INFO ] Time to serialize gal into /tmp/CTLFireability18121469440321410501.gal : 9 ms
[2022-05-20 05:54:20] [INFO ] Time to serialize properties into /tmp/CTLFireability18333487353919902599.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18121469440321410501.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18333487353919902599.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 2038/2038 places, 1828/1828 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 2011 transition count 1801
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 2011 transition count 1801
Applied a total of 54 rules in 179 ms. Remains 2011 /2038 variables (removed 27) and now considering 1801/1828 (removed 27) transitions.
// Phase 1: matrix 1801 rows 2011 cols
[2022-05-20 05:54:50] [INFO ] Computed 331 place invariants in 7 ms
[2022-05-20 05:54:51] [INFO ] Implicit Places using invariants in 537 ms returned []
// Phase 1: matrix 1801 rows 2011 cols
[2022-05-20 05:54:51] [INFO ] Computed 331 place invariants in 4 ms
[2022-05-20 05:54:52] [INFO ] Implicit Places using invariants and state equation in 1600 ms returned []
Implicit Place search using SMT with State Equation took 2138 ms to find 0 implicit places.
// Phase 1: matrix 1801 rows 2011 cols
[2022-05-20 05:54:52] [INFO ] Computed 331 place invariants in 3 ms
[2022-05-20 05:54:53] [INFO ] Dead Transitions using invariants and state equation in 887 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2011/2038 places, 1801/1828 transitions.
Finished structural reductions, in 1 iterations. Remains : 2011/2038 places, 1801/1828 transitions.
[2022-05-20 05:54:53] [INFO ] Flatten gal took : 42 ms
[2022-05-20 05:54:53] [INFO ] Flatten gal took : 37 ms
[2022-05-20 05:54:53] [INFO ] Input system was already deterministic with 1801 transitions.
[2022-05-20 05:54:53] [INFO ] Flatten gal took : 44 ms
[2022-05-20 05:54:53] [INFO ] Flatten gal took : 38 ms
[2022-05-20 05:54:53] [INFO ] Time to serialize gal into /tmp/CTLFireability422118760163862068.gal : 4 ms
[2022-05-20 05:54:53] [INFO ] Time to serialize properties into /tmp/CTLFireability15351969156448955465.ctl : 30 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability422118760163862068.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15351969156448955465.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-20 05:55:23] [INFO ] Flatten gal took : 37 ms
[2022-05-20 05:55:23] [INFO ] Applying decomposition
[2022-05-20 05:55:24] [INFO ] Flatten gal took : 36 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/graph13206123227555882223.txt' '-o' '/tmp/graph13206123227555882223.bin' '-w' '/tmp/graph13206123227555882223.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13206123227555882223.bin' '-l' '-1' '-v' '-w' '/tmp/graph13206123227555882223.weights' '-q' '0' '-e' '0.001'
[2022-05-20 05:55:24] [INFO ] Decomposing Gal with order
[2022-05-20 05:55:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 05:55:24] [INFO ] Removed a total of 303 redundant transitions.
[2022-05-20 05:55:24] [INFO ] Flatten gal took : 64 ms
[2022-05-20 05:55:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-20 05:55:25] [INFO ] Time to serialize gal into /tmp/CTLFireability16848727459422559362.gal : 1426 ms
[2022-05-20 05:55:25] [INFO ] Time to serialize properties into /tmp/CTLFireability14113499143592378869.ctl : 2 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16848727459422559362.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14113499143592378869.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 2038/2038 places, 1828/1828 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 2013 transition count 1803
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 2013 transition count 1803
Applied a total of 50 rules in 182 ms. Remains 2013 /2038 variables (removed 25) and now considering 1803/1828 (removed 25) transitions.
// Phase 1: matrix 1803 rows 2013 cols
[2022-05-20 05:55:55] [INFO ] Computed 331 place invariants in 8 ms
[2022-05-20 05:55:56] [INFO ] Implicit Places using invariants in 545 ms returned []
// Phase 1: matrix 1803 rows 2013 cols
[2022-05-20 05:55:56] [INFO ] Computed 331 place invariants in 8 ms
[2022-05-20 05:55:58] [INFO ] Implicit Places using invariants and state equation in 1604 ms returned []
Implicit Place search using SMT with State Equation took 2152 ms to find 0 implicit places.
// Phase 1: matrix 1803 rows 2013 cols
[2022-05-20 05:55:58] [INFO ] Computed 331 place invariants in 8 ms
[2022-05-20 05:55:59] [INFO ] Dead Transitions using invariants and state equation in 934 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2013/2038 places, 1803/1828 transitions.
Finished structural reductions, in 1 iterations. Remains : 2013/2038 places, 1803/1828 transitions.
[2022-05-20 05:55:59] [INFO ] Flatten gal took : 45 ms
[2022-05-20 05:55:59] [INFO ] Flatten gal took : 37 ms
[2022-05-20 05:55:59] [INFO ] Input system was already deterministic with 1803 transitions.
[2022-05-20 05:55:59] [INFO ] Flatten gal took : 37 ms
[2022-05-20 05:55:59] [INFO ] Flatten gal took : 36 ms
[2022-05-20 05:55:59] [INFO ] Time to serialize gal into /tmp/CTLFireability8465918136493753856.gal : 5 ms
[2022-05-20 05:55:59] [INFO ] Time to serialize properties into /tmp/CTLFireability5170500408404158622.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8465918136493753856.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5170500408404158622.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-20 05:56:29] [INFO ] Flatten gal took : 37 ms
[2022-05-20 05:56:29] [INFO ] Applying decomposition
[2022-05-20 05:56:29] [INFO ] Flatten gal took : 36 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/graph10152775725348500675.txt' '-o' '/tmp/graph10152775725348500675.bin' '-w' '/tmp/graph10152775725348500675.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10152775725348500675.bin' '-l' '-1' '-v' '-w' '/tmp/graph10152775725348500675.weights' '-q' '0' '-e' '0.001'
[2022-05-20 05:56:29] [INFO ] Decomposing Gal with order
[2022-05-20 05:56:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 05:56:29] [INFO ] Removed a total of 300 redundant transitions.
[2022-05-20 05:56:29] [INFO ] Flatten gal took : 74 ms
[2022-05-20 05:56:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-05-20 05:56:29] [INFO ] Time to serialize gal into /tmp/CTLFireability11322530429560119353.gal : 8 ms
[2022-05-20 05:56:29] [INFO ] Time to serialize properties into /tmp/CTLFireability13376529369169334607.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11322530429560119353.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13376529369169334607.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 2038/2038 places, 1828/1828 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 426 transitions
Trivial Post-agglo rules discarded 426 transitions
Performed 426 trivial Post agglomeration. Transition count delta: 426
Iterating post reduction 0 with 426 rules applied. Total rules applied 426 place count 2037 transition count 1401
Reduce places removed 426 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 428 rules applied. Total rules applied 854 place count 1611 transition count 1399
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 856 place count 1609 transition count 1399
Performed 220 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 220 Pre rules applied. Total rules applied 856 place count 1609 transition count 1179
Deduced a syphon composed of 220 places in 2 ms
Reduce places removed 220 places and 0 transitions.
Iterating global reduction 3 with 440 rules applied. Total rules applied 1296 place count 1389 transition count 1179
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1308 place count 1377 transition count 1167
Iterating global reduction 3 with 12 rules applied. Total rules applied 1320 place count 1377 transition count 1167
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 1320 place count 1377 transition count 1158
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 1338 place count 1368 transition count 1158
Performed 486 Post agglomeration using F-continuation condition.Transition count delta: 486
Deduced a syphon composed of 486 places in 1 ms
Reduce places removed 486 places and 0 transitions.
Iterating global reduction 3 with 972 rules applied. Total rules applied 2310 place count 882 transition count 672
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2311 place count 882 transition count 671
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2313 place count 881 transition count 670
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2315 place count 879 transition count 668
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2316 place count 878 transition count 668
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2316 place count 878 transition count 666
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2320 place count 876 transition count 666
Applied a total of 2320 rules in 293 ms. Remains 876 /2038 variables (removed 1162) and now considering 666/1828 (removed 1162) transitions.
// Phase 1: matrix 666 rows 876 cols
[2022-05-20 05:57:00] [INFO ] Computed 330 place invariants in 2 ms
[2022-05-20 05:57:00] [INFO ] Implicit Places using invariants in 345 ms returned [856, 860]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 349 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 874/2038 places, 666/1828 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 872 transition count 664
Applied a total of 4 rules in 35 ms. Remains 872 /874 variables (removed 2) and now considering 664/666 (removed 2) transitions.
// Phase 1: matrix 664 rows 872 cols
[2022-05-20 05:57:00] [INFO ] Computed 328 place invariants in 1 ms
[2022-05-20 05:57:00] [INFO ] Implicit Places using invariants in 340 ms returned []
// Phase 1: matrix 664 rows 872 cols
[2022-05-20 05:57:00] [INFO ] Computed 328 place invariants in 1 ms
[2022-05-20 05:57:01] [INFO ] Implicit Places using invariants and state equation in 649 ms returned []
Implicit Place search using SMT with State Equation took 991 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 872/2038 places, 664/1828 transitions.
Finished structural reductions, in 2 iterations. Remains : 872/2038 places, 664/1828 transitions.
[2022-05-20 05:57:01] [INFO ] Flatten gal took : 17 ms
[2022-05-20 05:57:01] [INFO ] Flatten gal took : 18 ms
[2022-05-20 05:57:01] [INFO ] Input system was already deterministic with 664 transitions.
[2022-05-20 05:57:01] [INFO ] Flatten gal took : 16 ms
[2022-05-20 05:57:01] [INFO ] Flatten gal took : 16 ms
[2022-05-20 05:57:01] [INFO ] Time to serialize gal into /tmp/CTLFireability4527372710050221930.gal : 2 ms
[2022-05-20 05:57:01] [INFO ] Time to serialize properties into /tmp/CTLFireability13148943265553876766.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4527372710050221930.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13148943265553876766.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.07426e+129,2.89507,100380,2,2250,5,374549,6,0,4153,649033,0


Converting to forward existential form...Done !
original formula: E(!(AF((AG(((p118==1)&&(p180==1))) * E((p952==1) U (p71==1))))) U !(EF(EG((((p1234==1)&&(p1535==1)) + EG((p1501==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,!(!(EG(!((!(E(TRUE U !(((p118==1)&&(p180==1))))) * E((p952==1) U (p71==1)))))))) * !(E(TRUE U EG((((...209
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...941
Detected timeout of ITS tools.
[2022-05-20 05:57:31] [INFO ] Flatten gal took : 29 ms
[2022-05-20 05:57:31] [INFO ] Applying decomposition
[2022-05-20 05:57:31] [INFO ] Flatten gal took : 18 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/graph8256147288410417629.txt' '-o' '/tmp/graph8256147288410417629.bin' '-w' '/tmp/graph8256147288410417629.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8256147288410417629.bin' '-l' '-1' '-v' '-w' '/tmp/graph8256147288410417629.weights' '-q' '0' '-e' '0.001'
[2022-05-20 05:57:31] [INFO ] Decomposing Gal with order
[2022-05-20 05:57:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 05:57:31] [INFO ] Removed a total of 90 redundant transitions.
[2022-05-20 05:57:31] [INFO ] Flatten gal took : 24 ms
[2022-05-20 05:57:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2022-05-20 05:57:31] [INFO ] Time to serialize gal into /tmp/CTLFireability4826075599540761982.gal : 3 ms
[2022-05-20 05:57:31] [INFO ] Time to serialize properties into /tmp/CTLFireability9837780961207540696.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4826075599540761982.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9837780961207540696.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.07426e+129,18.7444,535604,309,26,954870,209,1016,3.29914e+06,50,1116,0


Converting to forward existential form...Done !
original formula: E(!(AF((AG(((i1.u9.p118==1)&&(i1.u17.p180==1))) * E((i8.i1.i1.u97.p952==1) U (i0.u5.p71==1))))) U !(EF(EG((((i11.i0.i0.u127.p1234==1)&&(i...204
=> equivalent forward existential formula: [(FwdU(Init,!(!(EG(!((!(E(TRUE U !(((i1.u9.p118==1)&&(i1.u17.p180==1))))) * E((i8.i1.i1.u97.p952==1) U (i0.u5.p7...274
Reverse transition relation is NOT exact ! Due to transitions i0.u6.t154, i0.u3.t1, i0.u8.t160, i0.u2.t0, i0.u7.t156, i0.u5.t96, i0.u11.t4, i1.t94, i1.u9.t...2653
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 2038/2038 places, 1828/1828 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 424 transitions
Trivial Post-agglo rules discarded 424 transitions
Performed 424 trivial Post agglomeration. Transition count delta: 424
Iterating post reduction 0 with 424 rules applied. Total rules applied 424 place count 2037 transition count 1403
Reduce places removed 424 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 425 rules applied. Total rules applied 849 place count 1613 transition count 1402
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 850 place count 1612 transition count 1402
Performed 223 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 223 Pre rules applied. Total rules applied 850 place count 1612 transition count 1179
Deduced a syphon composed of 223 places in 1 ms
Reduce places removed 223 places and 0 transitions.
Iterating global reduction 3 with 446 rules applied. Total rules applied 1296 place count 1389 transition count 1179
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1307 place count 1378 transition count 1168
Iterating global reduction 3 with 11 rules applied. Total rules applied 1318 place count 1378 transition count 1168
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 1318 place count 1378 transition count 1161
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1332 place count 1371 transition count 1161
Performed 485 Post agglomeration using F-continuation condition.Transition count delta: 485
Deduced a syphon composed of 485 places in 1 ms
Reduce places removed 485 places and 0 transitions.
Iterating global reduction 3 with 970 rules applied. Total rules applied 2302 place count 886 transition count 676
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2303 place count 886 transition count 675
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2305 place count 885 transition count 674
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 2306 place count 885 transition count 674
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2308 place count 883 transition count 672
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2309 place count 882 transition count 672
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2309 place count 882 transition count 670
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2313 place count 880 transition count 670
Applied a total of 2313 rules in 273 ms. Remains 880 /2038 variables (removed 1158) and now considering 670/1828 (removed 1158) transitions.
// Phase 1: matrix 670 rows 880 cols
[2022-05-20 05:58:02] [INFO ] Computed 330 place invariants in 3 ms
[2022-05-20 05:58:02] [INFO ] Implicit Places using invariants in 396 ms returned [860, 864]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 410 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 878/2038 places, 670/1828 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 876 transition count 668
Applied a total of 4 rules in 30 ms. Remains 876 /878 variables (removed 2) and now considering 668/670 (removed 2) transitions.
// Phase 1: matrix 668 rows 876 cols
[2022-05-20 05:58:02] [INFO ] Computed 328 place invariants in 1 ms
[2022-05-20 05:58:02] [INFO ] Implicit Places using invariants in 370 ms returned []
// Phase 1: matrix 668 rows 876 cols
[2022-05-20 05:58:02] [INFO ] Computed 328 place invariants in 1 ms
[2022-05-20 05:58:03] [INFO ] Implicit Places using invariants and state equation in 660 ms returned []
Implicit Place search using SMT with State Equation took 1044 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 876/2038 places, 668/1828 transitions.
Finished structural reductions, in 2 iterations. Remains : 876/2038 places, 668/1828 transitions.
[2022-05-20 05:58:03] [INFO ] Flatten gal took : 16 ms
[2022-05-20 05:58:03] [INFO ] Flatten gal took : 18 ms
[2022-05-20 05:58:03] [INFO ] Input system was already deterministic with 668 transitions.
[2022-05-20 05:58:03] [INFO ] Flatten gal took : 17 ms
[2022-05-20 05:58:03] [INFO ] Flatten gal took : 18 ms
[2022-05-20 05:58:03] [INFO ] Time to serialize gal into /tmp/CTLFireability9479590166900050555.gal : 2 ms
[2022-05-20 05:58:03] [INFO ] Time to serialize properties into /tmp/CTLFireability17863187085210012935.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9479590166900050555.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17863187085210012935.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.02124e+129,4.82252,152052,2,2789,5,573623,6,0,4171,1.02013e+06,0


Converting to forward existential form...Done !
original formula: (EG((AF(((p804==0)||(p1796==1))) * ((EG((p1398==1)) * (((p1147==1)&&(p1206==1))||(p1178==1))) + A((p2080==1) U (p1684==1))))) + EG(((p424...193
=> equivalent forward existential formula: ([FwdG(Init,(!(EG(!(((p804==0)||(p1796==1))))) * ((EG((p1398==1)) * (((p1147==1)&&(p1206==1))||(p1178==1))) + !(...309
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...712
Detected timeout of ITS tools.
[2022-05-20 05:58:33] [INFO ] Flatten gal took : 20 ms
[2022-05-20 05:58:33] [INFO ] Applying decomposition
[2022-05-20 05:58:33] [INFO ] Flatten gal took : 18 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/graph268034652620480067.txt' '-o' '/tmp/graph268034652620480067.bin' '-w' '/tmp/graph268034652620480067.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph268034652620480067.bin' '-l' '-1' '-v' '-w' '/tmp/graph268034652620480067.weights' '-q' '0' '-e' '0.001'
[2022-05-20 05:58:33] [INFO ] Decomposing Gal with order
[2022-05-20 05:58:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 05:58:33] [INFO ] Removed a total of 89 redundant transitions.
[2022-05-20 05:58:33] [INFO ] Flatten gal took : 24 ms
[2022-05-20 05:58:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 4 ms.
[2022-05-20 05:58:33] [INFO ] Time to serialize gal into /tmp/CTLFireability12518007893843593844.gal : 3 ms
[2022-05-20 05:58:33] [INFO ] Time to serialize properties into /tmp/CTLFireability1365009936150647208.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12518007893843593844.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1365009936150647208.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 2038/2038 places, 1828/1828 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 2013 transition count 1803
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 2013 transition count 1803
Applied a total of 50 rules in 182 ms. Remains 2013 /2038 variables (removed 25) and now considering 1803/1828 (removed 25) transitions.
// Phase 1: matrix 1803 rows 2013 cols
[2022-05-20 05:59:04] [INFO ] Computed 331 place invariants in 6 ms
[2022-05-20 05:59:04] [INFO ] Implicit Places using invariants in 532 ms returned []
// Phase 1: matrix 1803 rows 2013 cols
[2022-05-20 05:59:04] [INFO ] Computed 331 place invariants in 4 ms
[2022-05-20 05:59:06] [INFO ] Implicit Places using invariants and state equation in 1579 ms returned []
Implicit Place search using SMT with State Equation took 2112 ms to find 0 implicit places.
// Phase 1: matrix 1803 rows 2013 cols
[2022-05-20 05:59:06] [INFO ] Computed 331 place invariants in 3 ms
[2022-05-20 05:59:07] [INFO ] Dead Transitions using invariants and state equation in 902 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2013/2038 places, 1803/1828 transitions.
Finished structural reductions, in 1 iterations. Remains : 2013/2038 places, 1803/1828 transitions.
[2022-05-20 05:59:07] [INFO ] Flatten gal took : 36 ms
[2022-05-20 05:59:07] [INFO ] Flatten gal took : 37 ms
[2022-05-20 05:59:07] [INFO ] Input system was already deterministic with 1803 transitions.
[2022-05-20 05:59:07] [INFO ] Flatten gal took : 60 ms
[2022-05-20 05:59:07] [INFO ] Flatten gal took : 37 ms
[2022-05-20 05:59:07] [INFO ] Time to serialize gal into /tmp/CTLFireability16094927057550762395.gal : 4 ms
[2022-05-20 05:59:07] [INFO ] Time to serialize properties into /tmp/CTLFireability7310339563253031794.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16094927057550762395.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7310339563253031794.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-20 05:59:37] [INFO ] Flatten gal took : 38 ms
[2022-05-20 05:59:37] [INFO ] Applying decomposition
[2022-05-20 05:59:37] [INFO ] Flatten gal took : 38 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/graph3389496439995342533.txt' '-o' '/tmp/graph3389496439995342533.bin' '-w' '/tmp/graph3389496439995342533.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3389496439995342533.bin' '-l' '-1' '-v' '-w' '/tmp/graph3389496439995342533.weights' '-q' '0' '-e' '0.001'
[2022-05-20 05:59:37] [INFO ] Decomposing Gal with order
[2022-05-20 05:59:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 05:59:37] [INFO ] Removed a total of 301 redundant transitions.
[2022-05-20 05:59:37] [INFO ] Flatten gal took : 62 ms
[2022-05-20 05:59:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-20 05:59:37] [INFO ] Time to serialize gal into /tmp/CTLFireability9896547722117685387.gal : 8 ms
[2022-05-20 05:59:37] [INFO ] Time to serialize properties into /tmp/CTLFireability2351205594331115136.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9896547722117685387.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2351205594331115136.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 2038/2038 places, 1828/1828 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 2012 transition count 1802
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 2012 transition count 1802
Applied a total of 52 rules in 178 ms. Remains 2012 /2038 variables (removed 26) and now considering 1802/1828 (removed 26) transitions.
// Phase 1: matrix 1802 rows 2012 cols
[2022-05-20 06:00:08] [INFO ] Computed 331 place invariants in 12 ms
[2022-05-20 06:00:08] [INFO ] Implicit Places using invariants in 564 ms returned []
// Phase 1: matrix 1802 rows 2012 cols
[2022-05-20 06:00:08] [INFO ] Computed 331 place invariants in 3 ms
[2022-05-20 06:00:10] [INFO ] Implicit Places using invariants and state equation in 1619 ms returned []
Implicit Place search using SMT with State Equation took 2183 ms to find 0 implicit places.
// Phase 1: matrix 1802 rows 2012 cols
[2022-05-20 06:00:10] [INFO ] Computed 331 place invariants in 4 ms
[2022-05-20 06:00:11] [INFO ] Dead Transitions using invariants and state equation in 912 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2012/2038 places, 1802/1828 transitions.
Finished structural reductions, in 1 iterations. Remains : 2012/2038 places, 1802/1828 transitions.
[2022-05-20 06:00:11] [INFO ] Flatten gal took : 36 ms
[2022-05-20 06:00:11] [INFO ] Flatten gal took : 38 ms
[2022-05-20 06:00:11] [INFO ] Input system was already deterministic with 1802 transitions.
[2022-05-20 06:00:11] [INFO ] Flatten gal took : 36 ms
[2022-05-20 06:00:11] [INFO ] Flatten gal took : 36 ms
[2022-05-20 06:00:11] [INFO ] Time to serialize gal into /tmp/CTLFireability4505671206120492738.gal : 4 ms
[2022-05-20 06:00:11] [INFO ] Time to serialize properties into /tmp/CTLFireability74265573659508177.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4505671206120492738.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability74265573659508177.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...272
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-20 06:00:41] [INFO ] Flatten gal took : 37 ms
[2022-05-20 06:00:41] [INFO ] Applying decomposition
[2022-05-20 06:00:41] [INFO ] Flatten gal took : 38 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/graph5259014670184040552.txt' '-o' '/tmp/graph5259014670184040552.bin' '-w' '/tmp/graph5259014670184040552.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5259014670184040552.bin' '-l' '-1' '-v' '-w' '/tmp/graph5259014670184040552.weights' '-q' '0' '-e' '0.001'
[2022-05-20 06:00:41] [INFO ] Decomposing Gal with order
[2022-05-20 06:00:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 06:00:41] [INFO ] Removed a total of 304 redundant transitions.
[2022-05-20 06:00:41] [INFO ] Flatten gal took : 63 ms
[2022-05-20 06:00:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-20 06:00:41] [INFO ] Time to serialize gal into /tmp/CTLFireability11904115087354406461.gal : 8 ms
[2022-05-20 06:00:41] [INFO ] Time to serialize properties into /tmp/CTLFireability1310425325854584844.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11904115087354406461.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1310425325854584844.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 2038/2038 places, 1828/1828 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 2012 transition count 1802
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 2012 transition count 1802
Applied a total of 52 rules in 176 ms. Remains 2012 /2038 variables (removed 26) and now considering 1802/1828 (removed 26) transitions.
// Phase 1: matrix 1802 rows 2012 cols
[2022-05-20 06:01:12] [INFO ] Computed 331 place invariants in 8 ms
[2022-05-20 06:01:12] [INFO ] Implicit Places using invariants in 555 ms returned []
// Phase 1: matrix 1802 rows 2012 cols
[2022-05-20 06:01:12] [INFO ] Computed 331 place invariants in 5 ms
[2022-05-20 06:01:14] [INFO ] Implicit Places using invariants and state equation in 1564 ms returned []
Implicit Place search using SMT with State Equation took 2119 ms to find 0 implicit places.
// Phase 1: matrix 1802 rows 2012 cols
[2022-05-20 06:01:14] [INFO ] Computed 331 place invariants in 4 ms
[2022-05-20 06:01:15] [INFO ] Dead Transitions using invariants and state equation in 899 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2012/2038 places, 1802/1828 transitions.
Finished structural reductions, in 1 iterations. Remains : 2012/2038 places, 1802/1828 transitions.
[2022-05-20 06:01:15] [INFO ] Flatten gal took : 41 ms
[2022-05-20 06:01:15] [INFO ] Flatten gal took : 37 ms
[2022-05-20 06:01:15] [INFO ] Input system was already deterministic with 1802 transitions.
[2022-05-20 06:01:15] [INFO ] Flatten gal took : 37 ms
[2022-05-20 06:01:15] [INFO ] Flatten gal took : 37 ms
[2022-05-20 06:01:15] [INFO ] Time to serialize gal into /tmp/CTLFireability11164253729543027000.gal : 4 ms
[2022-05-20 06:01:15] [INFO ] Time to serialize properties into /tmp/CTLFireability14505112387458930760.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11164253729543027000.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14505112387458930760.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-20 06:01:45] [INFO ] Flatten gal took : 56 ms
[2022-05-20 06:01:45] [INFO ] Applying decomposition
[2022-05-20 06:01:45] [INFO ] Flatten gal took : 36 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/graph8980406709161405296.txt' '-o' '/tmp/graph8980406709161405296.bin' '-w' '/tmp/graph8980406709161405296.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8980406709161405296.bin' '-l' '-1' '-v' '-w' '/tmp/graph8980406709161405296.weights' '-q' '0' '-e' '0.001'
[2022-05-20 06:01:45] [INFO ] Decomposing Gal with order
[2022-05-20 06:01:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 06:01:45] [INFO ] Removed a total of 298 redundant transitions.
[2022-05-20 06:01:45] [INFO ] Flatten gal took : 60 ms
[2022-05-20 06:01:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-20 06:01:45] [INFO ] Time to serialize gal into /tmp/CTLFireability7361602285622489357.gal : 7 ms
[2022-05-20 06:01:45] [INFO ] Time to serialize properties into /tmp/CTLFireability1790519973370367894.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7361602285622489357.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1790519973370367894.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 2038/2038 places, 1828/1828 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 2015 transition count 1805
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 2015 transition count 1805
Applied a total of 46 rules in 168 ms. Remains 2015 /2038 variables (removed 23) and now considering 1805/1828 (removed 23) transitions.
// Phase 1: matrix 1805 rows 2015 cols
[2022-05-20 06:02:15] [INFO ] Computed 331 place invariants in 4 ms
[2022-05-20 06:02:16] [INFO ] Implicit Places using invariants in 553 ms returned []
// Phase 1: matrix 1805 rows 2015 cols
[2022-05-20 06:02:16] [INFO ] Computed 331 place invariants in 9 ms
[2022-05-20 06:02:18] [INFO ] Implicit Places using invariants and state equation in 1624 ms returned []
Implicit Place search using SMT with State Equation took 2177 ms to find 0 implicit places.
// Phase 1: matrix 1805 rows 2015 cols
[2022-05-20 06:02:18] [INFO ] Computed 331 place invariants in 3 ms
[2022-05-20 06:02:19] [INFO ] Dead Transitions using invariants and state equation in 912 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2015/2038 places, 1805/1828 transitions.
Finished structural reductions, in 1 iterations. Remains : 2015/2038 places, 1805/1828 transitions.
[2022-05-20 06:02:19] [INFO ] Flatten gal took : 35 ms
[2022-05-20 06:02:19] [INFO ] Flatten gal took : 38 ms
[2022-05-20 06:02:19] [INFO ] Input system was already deterministic with 1805 transitions.
[2022-05-20 06:02:19] [INFO ] Flatten gal took : 36 ms
[2022-05-20 06:02:19] [INFO ] Flatten gal took : 36 ms
[2022-05-20 06:02:19] [INFO ] Time to serialize gal into /tmp/CTLFireability12156524850780461780.gal : 4 ms
[2022-05-20 06:02:19] [INFO ] Time to serialize properties into /tmp/CTLFireability9312883271745422453.ctl : 372 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12156524850780461780.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9312883271745422453.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-20 06:02:49] [INFO ] Flatten gal took : 37 ms
[2022-05-20 06:02:49] [INFO ] Applying decomposition
[2022-05-20 06:02:49] [INFO ] Flatten gal took : 36 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/graph14694901609466240338.txt' '-o' '/tmp/graph14694901609466240338.bin' '-w' '/tmp/graph14694901609466240338.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14694901609466240338.bin' '-l' '-1' '-v' '-w' '/tmp/graph14694901609466240338.weights' '-q' '0' '-e' '0.001'
[2022-05-20 06:02:49] [INFO ] Decomposing Gal with order
[2022-05-20 06:02:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 06:02:49] [INFO ] Removed a total of 301 redundant transitions.
[2022-05-20 06:02:50] [INFO ] Flatten gal took : 64 ms
[2022-05-20 06:02:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-20 06:02:50] [INFO ] Time to serialize gal into /tmp/CTLFireability17880176071959376712.gal : 8 ms
[2022-05-20 06:02:50] [INFO ] Time to serialize properties into /tmp/CTLFireability3145615926139832140.ctl : 497 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17880176071959376712.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3145615926139832140.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-20 06:03:20] [INFO ] Flatten gal took : 38 ms
[2022-05-20 06:03:20] [INFO ] Flatten gal took : 48 ms
[2022-05-20 06:03:20] [INFO ] Applying decomposition
[2022-05-20 06:03:20] [INFO ] Flatten gal took : 38 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/graph8090631606136347786.txt' '-o' '/tmp/graph8090631606136347786.bin' '-w' '/tmp/graph8090631606136347786.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8090631606136347786.bin' '-l' '-1' '-v' '-w' '/tmp/graph8090631606136347786.weights' '-q' '0' '-e' '0.001'
[2022-05-20 06:03:20] [INFO ] Decomposing Gal with order
[2022-05-20 06:03:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 06:03:21] [INFO ] Removed a total of 291 redundant transitions.
[2022-05-20 06:03:21] [INFO ] Flatten gal took : 64 ms
[2022-05-20 06:03:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-20 06:03:21] [INFO ] Time to serialize gal into /tmp/CTLFireability8750297184329104530.gal : 7 ms
[2022-05-20 06:03:21] [INFO ] Time to serialize properties into /tmp/CTLFireability7168617644967809627.ctl : 797 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8750297184329104530.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7168617644967809627.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 14 CTL formulae.
Detected timeout of ITS tools.
[2022-05-20 06:29:33] [INFO ] Applying decomposition
[2022-05-20 06:29:34] [INFO ] Flatten gal took : 220 ms
[2022-05-20 06:29:34] [INFO ] Decomposing Gal with order
[2022-05-20 06:29:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 06:29:35] [INFO ] Removed a total of 85 redundant transitions.
[2022-05-20 06:29:35] [INFO ] Flatten gal took : 351 ms
[2022-05-20 06:29:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 344 labels/synchronizations in 43 ms.
[2022-05-20 06:29:38] [INFO ] Time to serialize gal into /tmp/CTLFireability8456734302438146931.gal : 27 ms
[2022-05-20 06:29:38] [INFO ] Time to serialize properties into /tmp/CTLFireability1597918254034948531.ctl : 7 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8456734302438146931.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1597918254034948531.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 14 CTL formulae.

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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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="ShieldPPPt-PT-030B"
export BK_EXAMINATION="CTLFireability"
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 ShieldPPPt-PT-030B, examination is CTLFireability"
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-165286025500650"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-030B.tgz
mv ShieldPPPt-PT-030B execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;