About the Execution of ITS-Tools for ShieldPPPt-PT-020B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16222.880 | 3600000.00 | 2570928.00 | 765441.60 | F??????T???????F | normal |
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-165286025500634.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-020B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025500634
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 5.6K Apr 29 13:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Apr 29 13:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 29 13:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.9K May 9 08:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 9 08:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 13K 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 376K 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-020B-CTLFireability-00
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-01
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-02
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-03
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-04
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-05
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-06
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-07
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-08
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-09
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-10
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-11
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-12
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-13
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-14
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1653024042204
Running Version 202205111006
[2022-05-20 05:20:43] [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:20:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 05:20:43] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2022-05-20 05:20:43] [INFO ] Transformed 1563 places.
[2022-05-20 05:20:43] [INFO ] Transformed 1423 transitions.
[2022-05-20 05:20:43] [INFO ] Found NUPN structural information;
[2022-05-20 05:20:43] [INFO ] Parsed PT model containing 1563 places and 1423 transitions in 290 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 152 out of 1563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1563/1563 places, 1423/1423 transitions.
Discarding 192 places :
Symmetric choice reduction at 0 with 192 rule applications. Total rules 192 place count 1371 transition count 1231
Iterating global reduction 0 with 192 rules applied. Total rules applied 384 place count 1371 transition count 1231
Applied a total of 384 rules in 283 ms. Remains 1371 /1563 variables (removed 192) and now considering 1231/1423 (removed 192) transitions.
// Phase 1: matrix 1231 rows 1371 cols
[2022-05-20 05:20:44] [INFO ] Computed 221 place invariants in 28 ms
[2022-05-20 05:20:45] [INFO ] Implicit Places using invariants in 978 ms returned []
// Phase 1: matrix 1231 rows 1371 cols
[2022-05-20 05:20:45] [INFO ] Computed 221 place invariants in 23 ms
[2022-05-20 05:20:46] [INFO ] Implicit Places using invariants and state equation in 1422 ms returned []
Implicit Place search using SMT with State Equation took 2428 ms to find 0 implicit places.
// Phase 1: matrix 1231 rows 1371 cols
[2022-05-20 05:20:46] [INFO ] Computed 221 place invariants in 8 ms
[2022-05-20 05:20:47] [INFO ] Dead Transitions using invariants and state equation in 625 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1371/1563 places, 1231/1423 transitions.
Finished structural reductions, in 1 iterations. Remains : 1371/1563 places, 1231/1423 transitions.
Support contains 152 out of 1371 places after structural reductions.
[2022-05-20 05:20:47] [INFO ] Flatten gal took : 108 ms
[2022-05-20 05:20:47] [INFO ] Flatten gal took : 61 ms
[2022-05-20 05:20:48] [INFO ] Input system was already deterministic with 1231 transitions.
Support contains 146 out of 1371 places (down from 152) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 725 ms. (steps per millisecond=13 ) properties (out of 82) seen :51
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 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 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 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) 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 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 5 ms. (steps per millisecond=200 ) properties (out of 31) 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 31) 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 31) 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 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 4 ms. (steps per millisecond=250 ) properties (out of 31) 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 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 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 18 ms. (steps per millisecond=55 ) 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 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 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 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 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 5 ms. (steps per millisecond=200 ) 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 4 ms. (steps per millisecond=250 ) properties (out of 31) 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 31) 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 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 5 ms. (steps per millisecond=200 ) properties (out of 31) 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 31) seen :0
Running SMT prover for 31 properties.
// Phase 1: matrix 1231 rows 1371 cols
[2022-05-20 05:20:49] [INFO ] Computed 221 place invariants in 4 ms
[2022-05-20 05:20:50] [INFO ] [Real]Absence check using 221 positive place invariants in 58 ms returned sat
[2022-05-20 05:20:50] [INFO ] After 1514ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:31
[2022-05-20 05:20:51] [INFO ] [Nat]Absence check using 221 positive place invariants in 61 ms returned sat
[2022-05-20 05:20:54] [INFO ] After 2068ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :31
[2022-05-20 05:20:55] [INFO ] Deduced a trap composed of 20 places in 793 ms of which 5 ms to minimize.
[2022-05-20 05:20:55] [INFO ] Deduced a trap composed of 23 places in 243 ms of which 2 ms to minimize.
[2022-05-20 05:20:55] [INFO ] Deduced a trap composed of 26 places in 205 ms of which 1 ms to minimize.
[2022-05-20 05:20:55] [INFO ] Deduced a trap composed of 21 places in 206 ms of which 1 ms to minimize.
[2022-05-20 05:20:56] [INFO ] Deduced a trap composed of 20 places in 209 ms of which 1 ms to minimize.
[2022-05-20 05:20:56] [INFO ] Deduced a trap composed of 22 places in 197 ms of which 1 ms to minimize.
[2022-05-20 05:20:56] [INFO ] Deduced a trap composed of 18 places in 196 ms of which 1 ms to minimize.
[2022-05-20 05:20:56] [INFO ] Deduced a trap composed of 17 places in 190 ms of which 1 ms to minimize.
[2022-05-20 05:20:57] [INFO ] Deduced a trap composed of 34 places in 199 ms of which 0 ms to minimize.
[2022-05-20 05:20:57] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 0 ms to minimize.
[2022-05-20 05:20:57] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 0 ms to minimize.
[2022-05-20 05:20:57] [INFO ] Deduced a trap composed of 20 places in 172 ms of which 1 ms to minimize.
[2022-05-20 05:20:58] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 1 ms to minimize.
[2022-05-20 05:20:58] [INFO ] Deduced a trap composed of 25 places in 186 ms of which 1 ms to minimize.
[2022-05-20 05:20:58] [INFO ] Deduced a trap composed of 20 places in 162 ms of which 1 ms to minimize.
[2022-05-20 05:20:58] [INFO ] Deduced a trap composed of 17 places in 165 ms of which 0 ms to minimize.
[2022-05-20 05:20:58] [INFO ] Deduced a trap composed of 25 places in 165 ms of which 0 ms to minimize.
[2022-05-20 05:20:59] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 0 ms to minimize.
[2022-05-20 05:20:59] [INFO ] Deduced a trap composed of 28 places in 167 ms of which 1 ms to minimize.
[2022-05-20 05:20:59] [INFO ] Deduced a trap composed of 31 places in 164 ms of which 1 ms to minimize.
[2022-05-20 05:20:59] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 0 ms to minimize.
[2022-05-20 05:21:00] [INFO ] Deduced a trap composed of 24 places in 182 ms of which 1 ms to minimize.
[2022-05-20 05:21:00] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 1 ms to minimize.
[2022-05-20 05:21:00] [INFO ] Deduced a trap composed of 20 places in 185 ms of which 0 ms to minimize.
[2022-05-20 05:21:00] [INFO ] Deduced a trap composed of 18 places in 169 ms of which 0 ms to minimize.
[2022-05-20 05:21:00] [INFO ] Deduced a trap composed of 33 places in 163 ms of which 1 ms to minimize.
[2022-05-20 05:21:01] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 0 ms to minimize.
[2022-05-20 05:21:01] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 0 ms to minimize.
[2022-05-20 05:21:01] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 0 ms to minimize.
[2022-05-20 05:21:01] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 0 ms to minimize.
[2022-05-20 05:21:01] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 7381 ms
[2022-05-20 05:21:01] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 1 ms to minimize.
[2022-05-20 05:21:02] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 3 ms to minimize.
[2022-05-20 05:21:02] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 0 ms to minimize.
[2022-05-20 05:21:02] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 1 ms to minimize.
[2022-05-20 05:21:02] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 1 ms to minimize.
[2022-05-20 05:21:02] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 1 ms to minimize.
[2022-05-20 05:21:02] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1069 ms
[2022-05-20 05:21:03] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 0 ms to minimize.
[2022-05-20 05:21:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2022-05-20 05:21:03] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 0 ms to minimize.
[2022-05-20 05:21:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2022-05-20 05:21:04] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 1 ms to minimize.
[2022-05-20 05:21:04] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 1 ms to minimize.
[2022-05-20 05:21:04] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2022-05-20 05:21:04] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 1 ms to minimize.
[2022-05-20 05:21:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 577 ms
[2022-05-20 05:21:04] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 0 ms to minimize.
[2022-05-20 05:21:04] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 1 ms to minimize.
[2022-05-20 05:21:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 316 ms
[2022-05-20 05:21:05] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 0 ms to minimize.
[2022-05-20 05:21:05] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 1 ms to minimize.
[2022-05-20 05:21:05] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 0 ms to minimize.
[2022-05-20 05:21:05] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 0 ms to minimize.
[2022-05-20 05:21:05] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 0 ms to minimize.
[2022-05-20 05:21:05] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 1 ms to minimize.
[2022-05-20 05:21:05] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 871 ms
[2022-05-20 05:21:06] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2022-05-20 05:21:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2022-05-20 05:21:06] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 0 ms to minimize.
[2022-05-20 05:21:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2022-05-20 05:21:06] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 0 ms to minimize.
[2022-05-20 05:21:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2022-05-20 05:21:07] [INFO ] Deduced a trap composed of 48 places in 118 ms of which 0 ms to minimize.
[2022-05-20 05:21:07] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 1 ms to minimize.
[2022-05-20 05:21:07] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 3 ms to minimize.
[2022-05-20 05:21:07] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 1 ms to minimize.
[2022-05-20 05:21:07] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 1 ms to minimize.
[2022-05-20 05:21:07] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 906 ms
[2022-05-20 05:21:08] [INFO ] Deduced a trap composed of 46 places in 125 ms of which 0 ms to minimize.
[2022-05-20 05:21:08] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 1 ms to minimize.
[2022-05-20 05:21:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 387 ms
[2022-05-20 05:21:08] [INFO ] After 16640ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :31
Attempting to minimize the solution found.
Minimization took 1578 ms.
[2022-05-20 05:21:10] [INFO ] After 19891ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :31
Parikh walk visited 1 properties in 1560 ms.
Support contains 57 out of 1371 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1371/1371 places, 1231/1231 transitions.
Drop transitions removed 250 transitions
Trivial Post-agglo rules discarded 250 transitions
Performed 250 trivial Post agglomeration. Transition count delta: 250
Iterating post reduction 0 with 250 rules applied. Total rules applied 250 place count 1371 transition count 981
Reduce places removed 250 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 253 rules applied. Total rules applied 503 place count 1121 transition count 978
Reduce places removed 2 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 2 with 13 rules applied. Total rules applied 516 place count 1119 transition count 967
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 527 place count 1108 transition count 967
Performed 143 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 143 Pre rules applied. Total rules applied 527 place count 1108 transition count 824
Deduced a syphon composed of 143 places in 1 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 4 with 286 rules applied. Total rules applied 813 place count 965 transition count 824
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 828 place count 950 transition count 809
Iterating global reduction 4 with 15 rules applied. Total rules applied 843 place count 950 transition count 809
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 843 place count 950 transition count 800
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 861 place count 941 transition count 800
Performed 320 Post agglomeration using F-continuation condition.Transition count delta: 320
Deduced a syphon composed of 320 places in 2 ms
Reduce places removed 320 places and 0 transitions.
Iterating global reduction 4 with 640 rules applied. Total rules applied 1501 place count 621 transition count 480
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 1591 place count 576 transition count 480
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 1594 place count 576 transition count 477
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1597 place count 573 transition count 477
Partial Free-agglomeration rule applied 54 times.
Drop transitions removed 54 transitions
Iterating global reduction 5 with 54 rules applied. Total rules applied 1651 place count 573 transition count 477
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1652 place count 572 transition count 476
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1653 place count 571 transition count 476
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 1653 place count 571 transition count 474
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1657 place count 569 transition count 474
Applied a total of 1657 rules in 394 ms. Remains 569 /1371 variables (removed 802) and now considering 474/1231 (removed 757) transitions.
Finished structural reductions, in 1 iterations. Remains : 569/1371 places, 474/1231 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 30) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) seen :0
Running SMT prover for 23 properties.
// Phase 1: matrix 474 rows 569 cols
[2022-05-20 05:21:12] [INFO ] Computed 220 place invariants in 3 ms
[2022-05-20 05:21:13] [INFO ] [Real]Absence check using 220 positive place invariants in 29 ms returned sat
[2022-05-20 05:21:13] [INFO ] After 394ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2022-05-20 05:21:13] [INFO ] [Nat]Absence check using 220 positive place invariants in 35 ms returned sat
[2022-05-20 05:21:14] [INFO ] After 686ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2022-05-20 05:21:14] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-05-20 05:21:14] [INFO ] After 567ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :23
[2022-05-20 05:21:15] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2022-05-20 05:21:15] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 0 ms to minimize.
[2022-05-20 05:21:15] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 1 ms to minimize.
[2022-05-20 05:21:15] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
[2022-05-20 05:21:15] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2022-05-20 05:21:15] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 0 ms to minimize.
[2022-05-20 05:21:15] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 2 ms to minimize.
[2022-05-20 05:21:15] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 706 ms
[2022-05-20 05:21:15] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2022-05-20 05:21:16] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 0 ms to minimize.
[2022-05-20 05:21:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 204 ms
[2022-05-20 05:21:16] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 0 ms to minimize.
[2022-05-20 05:21:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2022-05-20 05:21:16] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 0 ms to minimize.
[2022-05-20 05:21:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2022-05-20 05:21:16] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2022-05-20 05:21:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2022-05-20 05:21:16] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 0 ms to minimize.
[2022-05-20 05:21:16] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 0 ms to minimize.
[2022-05-20 05:21:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 197 ms
[2022-05-20 05:21:17] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 1 ms to minimize.
[2022-05-20 05:21:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2022-05-20 05:21:17] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2022-05-20 05:21:17] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 0 ms to minimize.
[2022-05-20 05:21:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 250 ms
[2022-05-20 05:21:17] [INFO ] After 3163ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :23
Attempting to minimize the solution found.
Minimization took 708 ms.
[2022-05-20 05:21:18] [INFO ] After 5063ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :23
Parikh walk visited 0 properties in 179 ms.
Support contains 47 out of 569 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 569/569 places, 474/474 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 569 transition count 472
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 567 transition count 472
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 567 transition count 470
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 565 transition count 470
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 20 place count 559 transition count 464
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 556 transition count 464
Applied a total of 26 rules in 95 ms. Remains 556 /569 variables (removed 13) and now considering 464/474 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 556/569 places, 464/474 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) 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 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) seen :0
Interrupted probabilistic random walk after 131367 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 131367 steps, saw 109970 distinct states, run finished after 3004 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 23 properties.
// Phase 1: matrix 464 rows 556 cols
[2022-05-20 05:21:21] [INFO ] Computed 220 place invariants in 5 ms
[2022-05-20 05:21:22] [INFO ] [Real]Absence check using 220 positive place invariants in 54 ms returned sat
[2022-05-20 05:21:22] [INFO ] After 421ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2022-05-20 05:21:22] [INFO ] [Nat]Absence check using 220 positive place invariants in 31 ms returned sat
[2022-05-20 05:21:23] [INFO ] After 598ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2022-05-20 05:21:23] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-20 05:21:23] [INFO ] After 556ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :23
[2022-05-20 05:21:24] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
[2022-05-20 05:21:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2022-05-20 05:21:24] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 0 ms to minimize.
[2022-05-20 05:21:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2022-05-20 05:21:24] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 0 ms to minimize.
[2022-05-20 05:21:24] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 0 ms to minimize.
[2022-05-20 05:21:24] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 0 ms to minimize.
[2022-05-20 05:21:24] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2022-05-20 05:21:24] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2022-05-20 05:21:25] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 0 ms to minimize.
[2022-05-20 05:21:25] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 0 ms to minimize.
[2022-05-20 05:21:25] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2022-05-20 05:21:25] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2022-05-20 05:21:25] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2022-05-20 05:21:25] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1002 ms
[2022-05-20 05:21:25] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2022-05-20 05:21:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2022-05-20 05:21:25] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 0 ms to minimize.
[2022-05-20 05:21:25] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 0 ms to minimize.
[2022-05-20 05:21:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 190 ms
[2022-05-20 05:21:26] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 0 ms to minimize.
[2022-05-20 05:21:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2022-05-20 05:21:26] [INFO ] After 2892ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :23
Attempting to minimize the solution found.
Minimization took 541 ms.
[2022-05-20 05:21:26] [INFO ] After 4510ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :23
Fused 23 Parikh solutions to 22 different solutions.
Parikh walk visited 0 properties in 321 ms.
Support contains 47 out of 556 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 556/556 places, 464/464 transitions.
Applied a total of 0 rules in 14 ms. Remains 556 /556 variables (removed 0) and now considering 464/464 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 556/556 places, 464/464 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 556/556 places, 464/464 transitions.
Applied a total of 0 rules in 12 ms. Remains 556 /556 variables (removed 0) and now considering 464/464 (removed 0) transitions.
// Phase 1: matrix 464 rows 556 cols
[2022-05-20 05:21:27] [INFO ] Computed 220 place invariants in 2 ms
[2022-05-20 05:21:27] [INFO ] Implicit Places using invariants in 254 ms returned [539, 543]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 257 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 554/556 places, 464/464 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 552 transition count 462
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 552 transition count 462
Applied a total of 4 rules in 45 ms. Remains 552 /554 variables (removed 2) and now considering 462/464 (removed 2) transitions.
// Phase 1: matrix 462 rows 552 cols
[2022-05-20 05:21:27] [INFO ] Computed 218 place invariants in 3 ms
[2022-05-20 05:21:27] [INFO ] Implicit Places using invariants in 273 ms returned []
// Phase 1: matrix 462 rows 552 cols
[2022-05-20 05:21:27] [INFO ] Computed 218 place invariants in 2 ms
[2022-05-20 05:21:27] [INFO ] State equation strengthened by 48 read => feed constraints.
[2022-05-20 05:21:28] [INFO ] Implicit Places using invariants and state equation in 733 ms returned []
Implicit Place search using SMT with State Equation took 1010 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 552/556 places, 462/464 transitions.
Finished structural reductions, in 2 iterations. Remains : 552/556 places, 462/464 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 23) seen :0
Interrupted probabilistic random walk after 119411 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 119411 steps, saw 100151 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 23 properties.
// Phase 1: matrix 462 rows 552 cols
[2022-05-20 05:21:31] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:21:32] [INFO ] [Real]Absence check using 218 positive place invariants in 27 ms returned sat
[2022-05-20 05:21:32] [INFO ] After 395ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2022-05-20 05:21:32] [INFO ] [Nat]Absence check using 218 positive place invariants in 30 ms returned sat
[2022-05-20 05:21:33] [INFO ] After 654ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2022-05-20 05:21:33] [INFO ] State equation strengthened by 48 read => feed constraints.
[2022-05-20 05:21:34] [INFO ] After 568ms SMT Verify possible using 48 Read/Feed constraints in natural domain returned unsat :0 sat :23
[2022-05-20 05:21:34] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 0 ms to minimize.
[2022-05-20 05:21:34] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2022-05-20 05:21:34] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 0 ms to minimize.
[2022-05-20 05:21:34] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 0 ms to minimize.
[2022-05-20 05:21:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 343 ms
[2022-05-20 05:21:34] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 0 ms to minimize.
[2022-05-20 05:21:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2022-05-20 05:21:34] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 0 ms to minimize.
[2022-05-20 05:21:34] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2022-05-20 05:21:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 190 ms
[2022-05-20 05:21:34] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2022-05-20 05:21:34] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2022-05-20 05:21:35] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2022-05-20 05:21:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 267 ms
[2022-05-20 05:21:35] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 0 ms to minimize.
[2022-05-20 05:21:35] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
[2022-05-20 05:21:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 192 ms
[2022-05-20 05:21:35] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
[2022-05-20 05:21:35] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2022-05-20 05:21:35] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2022-05-20 05:21:35] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 2 ms to minimize.
[2022-05-20 05:21:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 364 ms
[2022-05-20 05:21:36] [INFO ] After 2706ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :23
Attempting to minimize the solution found.
Minimization took 574 ms.
[2022-05-20 05:21:36] [INFO ] After 4396ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :23
Parikh walk visited 0 properties in 354 ms.
Support contains 47 out of 552 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 552/552 places, 462/462 transitions.
Applied a total of 0 rules in 11 ms. Remains 552 /552 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 552/552 places, 462/462 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 552/552 places, 462/462 transitions.
Applied a total of 0 rules in 10 ms. Remains 552 /552 variables (removed 0) and now considering 462/462 (removed 0) transitions.
// Phase 1: matrix 462 rows 552 cols
[2022-05-20 05:21:37] [INFO ] Computed 218 place invariants in 2 ms
[2022-05-20 05:21:37] [INFO ] Implicit Places using invariants in 251 ms returned []
// Phase 1: matrix 462 rows 552 cols
[2022-05-20 05:21:37] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:21:37] [INFO ] State equation strengthened by 48 read => feed constraints.
[2022-05-20 05:21:38] [INFO ] Implicit Places using invariants and state equation in 738 ms returned []
Implicit Place search using SMT with State Equation took 990 ms to find 0 implicit places.
[2022-05-20 05:21:38] [INFO ] Redundant transitions in 32 ms returned []
// Phase 1: matrix 462 rows 552 cols
[2022-05-20 05:21:38] [INFO ] Computed 218 place invariants in 4 ms
[2022-05-20 05:21:38] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 552/552 places, 462/462 transitions.
Partial Free-agglomeration rule applied 92 times.
Drop transitions removed 92 transitions
Iterating global reduction 0 with 92 rules applied. Total rules applied 92 place count 552 transition count 462
Applied a total of 92 rules in 31 ms. Remains 552 /552 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Running SMT prover for 23 properties.
// Phase 1: matrix 462 rows 552 cols
[2022-05-20 05:21:38] [INFO ] Computed 218 place invariants in 4 ms
[2022-05-20 05:21:38] [INFO ] [Real]Absence check using 218 positive place invariants in 29 ms returned sat
[2022-05-20 05:21:38] [INFO ] After 370ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2022-05-20 05:21:39] [INFO ] [Nat]Absence check using 218 positive place invariants in 28 ms returned sat
[2022-05-20 05:21:39] [INFO ] After 576ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2022-05-20 05:21:39] [INFO ] State equation strengthened by 85 read => feed constraints.
[2022-05-20 05:21:40] [INFO ] After 712ms SMT Verify possible using 85 Read/Feed constraints in natural domain returned unsat :0 sat :23
[2022-05-20 05:21:40] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2022-05-20 05:21:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2022-05-20 05:21:40] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2022-05-20 05:21:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2022-05-20 05:21:41] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 0 ms to minimize.
[2022-05-20 05:21:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2022-05-20 05:21:41] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 0 ms to minimize.
[2022-05-20 05:21:41] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2022-05-20 05:21:41] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2022-05-20 05:21:41] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
[2022-05-20 05:21:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 337 ms
[2022-05-20 05:21:41] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2022-05-20 05:21:41] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2022-05-20 05:21:41] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2022-05-20 05:21:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 278 ms
[2022-05-20 05:21:41] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2022-05-20 05:21:42] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2022-05-20 05:21:42] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 0 ms to minimize.
[2022-05-20 05:21:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 286 ms
[2022-05-20 05:21:42] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2022-05-20 05:21:42] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 0 ms to minimize.
[2022-05-20 05:21:42] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2022-05-20 05:21:42] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 0 ms to minimize.
[2022-05-20 05:21:42] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 0 ms to minimize.
[2022-05-20 05:21:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 465 ms
[2022-05-20 05:21:42] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2022-05-20 05:21:42] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 0 ms to minimize.
[2022-05-20 05:21:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 188 ms
[2022-05-20 05:21:43] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2022-05-20 05:21:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2022-05-20 05:21:43] [INFO ] After 3433ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :23
Attempting to minimize the solution found.
Minimization took 641 ms.
[2022-05-20 05:21:43] [INFO ] After 5112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :23
[2022-05-20 05:21:43] [INFO ] Flatten gal took : 27 ms
[2022-05-20 05:21:44] [INFO ] Flatten gal took : 30 ms
[2022-05-20 05:21:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6496492519773327499.gal : 19 ms
[2022-05-20 05:21:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14218899058056128850.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms3914903424916272970;'/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/ReachabilityCardinality6496492519773327499.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14218899058056128850.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/ReachabilityCardinality14218899058056128850.prop.
SDD proceeding with computation,23 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,23 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,23 properties remain. new max is 16
SDD size :7 after 109
SDD proceeding with computation,23 properties remain. new max is 32
SDD size :109 after 325
SDD proceeding with computation,23 properties remain. new max is 64
SDD size :325 after 1297
SDD proceeding with computation,23 properties remain. new max is 128
SDD size :1297 after 23346
Reachability property AtomicPropp73 is true.
Reachability property AtomicPropp41 is true.
Reachability property AtomicPropp24 is true.
Reachability property AtomicPropp8 is true.
Reachability property AtomicPropp3 is true.
SDD proceeding with computation,18 properties remain. new max is 128
SDD size :23346 after 1.33745e+06
Reachability property AtomicPropp55 is true.
Reachability property AtomicPropp11 is true.
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :1.33745e+06 after 1.33823e+06
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :1.33823e+06 after 1.34036e+06
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :1.34036e+06 after 1.36476e+06
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :1.36476e+06 after 1.88701e+06
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :1.88701e+06 after 4.80433e+06
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :4.80433e+06 after 8.81738e+06
SDD proceeding with computation,16 properties remain. new max is 8192
SDD size :8.81738e+06 after 4.5931e+07
Reachability property AtomicPropp78 is true.
SDD proceeding with computation,15 properties remain. new max is 8192
SDD size :4.5931e+07 after 4.31696e+10
SDD proceeding with computation,15 properties remain. new max is 16384
SDD size :4.31696e+10 after 2.13687e+11
Reachability property AtomicPropp74 is true.
Reachability property AtomicPropp17 is true.
Reachability property AtomicPropp16 is true.
Reachability property AtomicPropp9 is true.
SDD proceeding with computation,11 properties remain. new max is 16384
SDD size :2.13687e+11 after 1.29306e+15
SDD proceeding with computation,11 properties remain. new max is 32768
SDD size :1.29306e+15 after 2.49434e+16
Reachability property AtomicPropp72 is true.
Reachability property AtomicPropp52 is true.
Reachability property AtomicPropp42 is true.
Reachability property AtomicPropp22 is true.
SDD proceeding with computation,7 properties remain. new max is 32768
SDD size :2.49434e+16 after 3.89857e+20
Detected timeout of ITS tools.
[2022-05-20 05:21:59] [INFO ] Flatten gal took : 27 ms
[2022-05-20 05:21:59] [INFO ] Applying decomposition
[2022-05-20 05:21:59] [INFO ] Flatten gal took : 23 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/graph7852927820147762087.txt' '-o' '/tmp/graph7852927820147762087.bin' '-w' '/tmp/graph7852927820147762087.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7852927820147762087.bin' '-l' '-1' '-v' '-w' '/tmp/graph7852927820147762087.weights' '-q' '0' '-e' '0.001'
[2022-05-20 05:21:59] [INFO ] Decomposing Gal with order
[2022-05-20 05:21:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 05:21:59] [INFO ] Removed a total of 126 redundant transitions.
[2022-05-20 05:21:59] [INFO ] Flatten gal took : 77 ms
[2022-05-20 05:21:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 20 ms.
[2022-05-20 05:21:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7569128693306492436.gal : 9 ms
[2022-05-20 05:21:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15413027949410733647.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms3914903424916272970;'/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/ReachabilityCardinality7569128693306492436.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15413027949410733647.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/ReachabilityCardinality15413027949410733647.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :7 after 7
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :7 after 7
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :7 after 109
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :109 after 1297
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :2.11795e+09 after 4.72724e+09
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :4.72724e+09 after 2.38955e+16
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1905590809784402274
[2022-05-20 05:22:14] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1905590809784402274
Running compilation step : cd /tmp/ltsmin1905590809784402274;'/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 932 ms.
Running link step : cd /tmp/ltsmin1905590809784402274;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin1905590809784402274;'/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' 'AtomicPropp0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 05:22:29] [INFO ] Flatten gal took : 52 ms
[2022-05-20 05:22:29] [INFO ] Flatten gal took : 51 ms
[2022-05-20 05:22:29] [INFO ] Input system was already deterministic with 1231 transitions.
Computed a total of 333 stabilizing places and 333 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 1371/1371 places, 1231/1231 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 289 transitions
Trivial Post-agglo rules discarded 289 transitions
Performed 289 trivial Post agglomeration. Transition count delta: 289
Iterating post reduction 0 with 289 rules applied. Total rules applied 289 place count 1370 transition count 941
Reduce places removed 289 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 292 rules applied. Total rules applied 581 place count 1081 transition count 938
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 584 place count 1079 transition count 937
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 585 place count 1078 transition count 937
Performed 145 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 145 Pre rules applied. Total rules applied 585 place count 1078 transition count 792
Deduced a syphon composed of 145 places in 1 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 4 with 290 rules applied. Total rules applied 875 place count 933 transition count 792
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 899 place count 909 transition count 768
Iterating global reduction 4 with 24 rules applied. Total rules applied 923 place count 909 transition count 768
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 17 Pre rules applied. Total rules applied 923 place count 909 transition count 751
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 957 place count 892 transition count 751
Performed 308 Post agglomeration using F-continuation condition.Transition count delta: 308
Deduced a syphon composed of 308 places in 1 ms
Reduce places removed 308 places and 0 transitions.
Iterating global reduction 4 with 616 rules applied. Total rules applied 1573 place count 584 transition count 443
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1575 place count 582 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1576 place count 581 transition count 441
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1576 place count 581 transition count 439
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 1580 place count 579 transition count 439
Applied a total of 1580 rules in 205 ms. Remains 579 /1371 variables (removed 792) and now considering 439/1231 (removed 792) transitions.
// Phase 1: matrix 439 rows 579 cols
[2022-05-20 05:22:30] [INFO ] Computed 220 place invariants in 2 ms
[2022-05-20 05:22:37] [INFO ] Implicit Places using invariants in 7400 ms returned [559, 563]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 7402 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 577/1371 places, 439/1231 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 575 transition count 437
Applied a total of 4 rules in 20 ms. Remains 575 /577 variables (removed 2) and now considering 437/439 (removed 2) transitions.
// Phase 1: matrix 437 rows 575 cols
[2022-05-20 05:22:37] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:22:37] [INFO ] Implicit Places using invariants in 269 ms returned []
// Phase 1: matrix 437 rows 575 cols
[2022-05-20 05:22:37] [INFO ] Computed 218 place invariants in 2 ms
[2022-05-20 05:22:38] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 733 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 575/1371 places, 437/1231 transitions.
Finished structural reductions, in 2 iterations. Remains : 575/1371 places, 437/1231 transitions.
[2022-05-20 05:22:38] [INFO ] Flatten gal took : 20 ms
[2022-05-20 05:22:38] [INFO ] Flatten gal took : 13 ms
[2022-05-20 05:22:38] [INFO ] Input system was already deterministic with 437 transitions.
[2022-05-20 05:22:38] [INFO ] Flatten gal took : 13 ms
[2022-05-20 05:22:38] [INFO ] Flatten gal took : 14 ms
[2022-05-20 05:22:38] [INFO ] Time to serialize gal into /tmp/CTLFireability4684778369561350368.gal : 2 ms
[2022-05-20 05:22:38] [INFO ] Time to serialize properties into /tmp/CTLFireability13814130609274623850.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/CTLFireability4684778369561350368.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13814130609274623850.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.52953e+85,2.37031,74896,2,1606,5,275422,6,0,2739,480834,0
Converting to forward existential form...Done !
original formula: AF(EG(AG(((p1243==1)&&(p754==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(E(TRUE U !(((p1243==1)&&(p754==1))))))))] = FALSE
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...776
(forward)formula 0,0,8.28798,202412,1,0,981,1.11558e+06,905,428,16871,1.04672e+06,888
FORMULA ShieldPPPt-PT-020B-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 1371/1371 places, 1231/1231 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 290 transitions
Trivial Post-agglo rules discarded 290 transitions
Performed 290 trivial Post agglomeration. Transition count delta: 290
Iterating post reduction 0 with 290 rules applied. Total rules applied 290 place count 1370 transition count 940
Reduce places removed 290 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 293 rules applied. Total rules applied 583 place count 1080 transition count 937
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 586 place count 1078 transition count 936
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 587 place count 1077 transition count 936
Performed 145 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 145 Pre rules applied. Total rules applied 587 place count 1077 transition count 791
Deduced a syphon composed of 145 places in 1 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 4 with 290 rules applied. Total rules applied 877 place count 932 transition count 791
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 899 place count 910 transition count 769
Iterating global reduction 4 with 22 rules applied. Total rules applied 921 place count 910 transition count 769
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 921 place count 910 transition count 753
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 953 place count 894 transition count 753
Performed 305 Post agglomeration using F-continuation condition.Transition count delta: 305
Deduced a syphon composed of 305 places in 0 ms
Reduce places removed 305 places and 0 transitions.
Iterating global reduction 4 with 610 rules applied. Total rules applied 1563 place count 589 transition count 448
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1564 place count 588 transition count 447
Applied a total of 1564 rules in 129 ms. Remains 588 /1371 variables (removed 783) and now considering 447/1231 (removed 784) transitions.
// Phase 1: matrix 447 rows 588 cols
[2022-05-20 05:22:46] [INFO ] Computed 221 place invariants in 2 ms
[2022-05-20 05:22:47] [INFO ] Implicit Places using invariants in 263 ms returned [577]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 265 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 587/1371 places, 447/1231 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 587 transition count 445
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 585 transition count 445
Applied a total of 4 rules in 14 ms. Remains 585 /587 variables (removed 2) and now considering 445/447 (removed 2) transitions.
// Phase 1: matrix 445 rows 585 cols
[2022-05-20 05:22:47] [INFO ] Computed 220 place invariants in 4 ms
[2022-05-20 05:22:47] [INFO ] Implicit Places using invariants in 261 ms returned [564, 568]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 264 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 583/1371 places, 445/1231 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 581 transition count 443
Applied a total of 4 rules in 18 ms. Remains 581 /583 variables (removed 2) and now considering 443/445 (removed 2) transitions.
// Phase 1: matrix 443 rows 581 cols
[2022-05-20 05:22:47] [INFO ] Computed 218 place invariants in 2 ms
[2022-05-20 05:22:47] [INFO ] Implicit Places using invariants in 234 ms returned []
// Phase 1: matrix 443 rows 581 cols
[2022-05-20 05:22:47] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:22:48] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 643 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 581/1371 places, 443/1231 transitions.
Finished structural reductions, in 3 iterations. Remains : 581/1371 places, 443/1231 transitions.
[2022-05-20 05:22:48] [INFO ] Flatten gal took : 14 ms
[2022-05-20 05:22:48] [INFO ] Flatten gal took : 14 ms
[2022-05-20 05:22:48] [INFO ] Input system was already deterministic with 443 transitions.
[2022-05-20 05:22:48] [INFO ] Flatten gal took : 14 ms
[2022-05-20 05:22:48] [INFO ] Flatten gal took : 14 ms
[2022-05-20 05:22:48] [INFO ] Time to serialize gal into /tmp/CTLFireability11469824500442803495.gal : 2 ms
[2022-05-20 05:22:48] [INFO ] Time to serialize properties into /tmp/CTLFireability14308543405237303638.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/CTLFireability11469824500442803495.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14308543405237303638.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.
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,3.92285e+85,2.08351,69220,2,2551,5,252457,6,0,2768,441786,0
Converting to forward existential form...Done !
original formula: EG((((p1275==0) + ((!(A((p316==1) U (p1552==1))) * (p1301==0)) * (p413==0))) + (((p1353==1)&&(p1373==1))&&((p360==0)||(p362==0)))))
=> equivalent forward existential formula: [FwdG(Init,(((p1275==0) + ((!(!((E(!((p1552==1)) U (!((p316==1)) * !((p1552==1)))) + EG(!((p1552==1)))))) * (p13...241
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...949
Detected timeout of ITS tools.
[2022-05-20 05:23:18] [INFO ] Flatten gal took : 15 ms
[2022-05-20 05:23:18] [INFO ] Applying decomposition
[2022-05-20 05:23:18] [INFO ] Flatten gal took : 20 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/graph14400353031080325626.txt' '-o' '/tmp/graph14400353031080325626.bin' '-w' '/tmp/graph14400353031080325626.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14400353031080325626.bin' '-l' '-1' '-v' '-w' '/tmp/graph14400353031080325626.weights' '-q' '0' '-e' '0.001'
[2022-05-20 05:23:18] [INFO ] Decomposing Gal with order
[2022-05-20 05:23:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 05:23:18] [INFO ] Removed a total of 58 redundant transitions.
[2022-05-20 05:23:18] [INFO ] Flatten gal took : 23 ms
[2022-05-20 05:23:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-20 05:23:18] [INFO ] Time to serialize gal into /tmp/CTLFireability10426853920802414987.gal : 5 ms
[2022-05-20 05:23:18] [INFO ] Time to serialize properties into /tmp/CTLFireability12731320869559038865.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/CTLFireability10426853920802414987.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12731320869559038865.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.
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,3.92285e+85,5.20154,178812,636,48,331954,240,664,1.15699e+06,55,1151,0
Converting to forward existential form...Done !
original formula: EG((((i18.u133.p1275==0) + ((!(A((i5.u31.p316==1) U (i21.u163.p1552==1))) * (i18.u136.p1301==0)) * (i6.u41.p413==0))) + (((i19.u142.p1353...222
=> equivalent forward existential formula: [FwdG(Init,(((i18.u133.p1275==0) + ((!(!((E(!((i21.u163.p1552==1)) U (!((i5.u31.p316==1)) * !((i21.u163.p1552==1...332
Reverse transition relation is NOT exact ! Due to transitions i0.u3.t1, i0.u8.t105, i0.u4.t2, i0.u7.t101, i0.u2.t0, i0.u6.t99, i0.u5.t95, i0.u11.t4, i1.u14...2142
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1371/1371 places, 1231/1231 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1343 transition count 1203
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1343 transition count 1203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 1342 transition count 1202
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 1342 transition count 1202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 1341 transition count 1201
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 1341 transition count 1201
Applied a total of 60 rules in 151 ms. Remains 1341 /1371 variables (removed 30) and now considering 1201/1231 (removed 30) transitions.
// Phase 1: matrix 1201 rows 1341 cols
[2022-05-20 05:23:48] [INFO ] Computed 221 place invariants in 9 ms
[2022-05-20 05:23:48] [INFO ] Implicit Places using invariants in 349 ms returned []
// Phase 1: matrix 1201 rows 1341 cols
[2022-05-20 05:23:48] [INFO ] Computed 221 place invariants in 3 ms
[2022-05-20 05:23:49] [INFO ] Implicit Places using invariants and state equation in 903 ms returned []
Implicit Place search using SMT with State Equation took 1253 ms to find 0 implicit places.
// Phase 1: matrix 1201 rows 1341 cols
[2022-05-20 05:23:49] [INFO ] Computed 221 place invariants in 3 ms
[2022-05-20 05:23:50] [INFO ] Dead Transitions using invariants and state equation in 553 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1341/1371 places, 1201/1231 transitions.
Finished structural reductions, in 1 iterations. Remains : 1341/1371 places, 1201/1231 transitions.
[2022-05-20 05:23:50] [INFO ] Flatten gal took : 26 ms
[2022-05-20 05:23:50] [INFO ] Flatten gal took : 26 ms
[2022-05-20 05:23:50] [INFO ] Input system was already deterministic with 1201 transitions.
[2022-05-20 05:23:50] [INFO ] Flatten gal took : 26 ms
[2022-05-20 05:23:50] [INFO ] Flatten gal took : 26 ms
[2022-05-20 05:23:50] [INFO ] Time to serialize gal into /tmp/CTLFireability3808889561286471654.gal : 3 ms
[2022-05-20 05:23:50] [INFO ] Time to serialize properties into /tmp/CTLFireability8257668175013923950.ctl : 56 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3808889561286471654.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8257668175013923950.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:24:20] [INFO ] Flatten gal took : 40 ms
[2022-05-20 05:24:20] [INFO ] Applying decomposition
[2022-05-20 05:24:20] [INFO ] Flatten gal took : 28 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/graph12501512129620756416.txt' '-o' '/tmp/graph12501512129620756416.bin' '-w' '/tmp/graph12501512129620756416.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12501512129620756416.bin' '-l' '-1' '-v' '-w' '/tmp/graph12501512129620756416.weights' '-q' '0' '-e' '0.001'
[2022-05-20 05:24:20] [INFO ] Decomposing Gal with order
[2022-05-20 05:24:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 05:24:20] [INFO ] Removed a total of 202 redundant transitions.
[2022-05-20 05:24:20] [INFO ] Flatten gal took : 60 ms
[2022-05-20 05:24:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-05-20 05:24:20] [INFO ] Time to serialize gal into /tmp/CTLFireability13806435626323788960.gal : 11 ms
[2022-05-20 05:24:20] [INFO ] Time to serialize properties into /tmp/CTLFireability8672037241076859815.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/CTLFireability13806435626323788960.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8672037241076859815.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 : 1371/1371 places, 1231/1231 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1348 transition count 1208
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1348 transition count 1208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 1347 transition count 1207
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 1347 transition count 1207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 1346 transition count 1206
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 1346 transition count 1206
Applied a total of 50 rules in 150 ms. Remains 1346 /1371 variables (removed 25) and now considering 1206/1231 (removed 25) transitions.
// Phase 1: matrix 1206 rows 1346 cols
[2022-05-20 05:24:51] [INFO ] Computed 221 place invariants in 9 ms
[2022-05-20 05:24:51] [INFO ] Implicit Places using invariants in 370 ms returned []
// Phase 1: matrix 1206 rows 1346 cols
[2022-05-20 05:24:51] [INFO ] Computed 221 place invariants in 3 ms
[2022-05-20 05:24:52] [INFO ] Implicit Places using invariants and state equation in 924 ms returned []
Implicit Place search using SMT with State Equation took 1294 ms to find 0 implicit places.
// Phase 1: matrix 1206 rows 1346 cols
[2022-05-20 05:24:52] [INFO ] Computed 221 place invariants in 4 ms
[2022-05-20 05:24:53] [INFO ] Dead Transitions using invariants and state equation in 559 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1346/1371 places, 1206/1231 transitions.
Finished structural reductions, in 1 iterations. Remains : 1346/1371 places, 1206/1231 transitions.
[2022-05-20 05:24:53] [INFO ] Flatten gal took : 25 ms
[2022-05-20 05:24:53] [INFO ] Flatten gal took : 26 ms
[2022-05-20 05:24:53] [INFO ] Input system was already deterministic with 1206 transitions.
[2022-05-20 05:24:53] [INFO ] Flatten gal took : 25 ms
[2022-05-20 05:24:53] [INFO ] Flatten gal took : 25 ms
[2022-05-20 05:24:53] [INFO ] Time to serialize gal into /tmp/CTLFireability9868203952121462390.gal : 3 ms
[2022-05-20 05:24:53] [INFO ] Time to serialize properties into /tmp/CTLFireability136955681620445526.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/CTLFireability9868203952121462390.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability136955681620445526.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...273
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-20 05:25:23] [INFO ] Flatten gal took : 29 ms
[2022-05-20 05:25:23] [INFO ] Applying decomposition
[2022-05-20 05:25:23] [INFO ] Flatten gal took : 26 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/graph11785305229077229268.txt' '-o' '/tmp/graph11785305229077229268.bin' '-w' '/tmp/graph11785305229077229268.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11785305229077229268.bin' '-l' '-1' '-v' '-w' '/tmp/graph11785305229077229268.weights' '-q' '0' '-e' '0.001'
[2022-05-20 05:25:23] [INFO ] Decomposing Gal with order
[2022-05-20 05:25:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 05:25:23] [INFO ] Removed a total of 199 redundant transitions.
[2022-05-20 05:25:23] [INFO ] Flatten gal took : 54 ms
[2022-05-20 05:25:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2022-05-20 05:25:23] [INFO ] Time to serialize gal into /tmp/CTLFireability9389090940974833591.gal : 8 ms
[2022-05-20 05:25:23] [INFO ] Time to serialize properties into /tmp/CTLFireability15758327528682528993.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/CTLFireability9389090940974833591.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15758327528682528993.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 : 1371/1371 places, 1231/1231 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 287 transitions
Trivial Post-agglo rules discarded 287 transitions
Performed 287 trivial Post agglomeration. Transition count delta: 287
Iterating post reduction 0 with 287 rules applied. Total rules applied 287 place count 1370 transition count 943
Reduce places removed 287 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 290 rules applied. Total rules applied 577 place count 1083 transition count 940
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 581 place count 1081 transition count 938
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 583 place count 1079 transition count 938
Performed 145 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 145 Pre rules applied. Total rules applied 583 place count 1079 transition count 793
Deduced a syphon composed of 145 places in 1 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 4 with 290 rules applied. Total rules applied 873 place count 934 transition count 793
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 897 place count 910 transition count 769
Iterating global reduction 4 with 24 rules applied. Total rules applied 921 place count 910 transition count 769
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 921 place count 910 transition count 754
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 951 place count 895 transition count 754
Performed 308 Post agglomeration using F-continuation condition.Transition count delta: 308
Deduced a syphon composed of 308 places in 0 ms
Reduce places removed 308 places and 0 transitions.
Iterating global reduction 4 with 616 rules applied. Total rules applied 1567 place count 587 transition count 446
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1569 place count 585 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1570 place count 584 transition count 444
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1570 place count 584 transition count 442
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 1574 place count 582 transition count 442
Applied a total of 1574 rules in 123 ms. Remains 582 /1371 variables (removed 789) and now considering 442/1231 (removed 789) transitions.
// Phase 1: matrix 442 rows 582 cols
[2022-05-20 05:25:53] [INFO ] Computed 220 place invariants in 15 ms
[2022-05-20 05:25:54] [INFO ] Implicit Places using invariants in 260 ms returned [562, 566]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 261 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 580/1371 places, 442/1231 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 578 transition count 440
Applied a total of 4 rules in 23 ms. Remains 578 /580 variables (removed 2) and now considering 440/442 (removed 2) transitions.
// Phase 1: matrix 440 rows 578 cols
[2022-05-20 05:25:54] [INFO ] Computed 218 place invariants in 3 ms
[2022-05-20 05:25:54] [INFO ] Implicit Places using invariants in 247 ms returned []
// Phase 1: matrix 440 rows 578 cols
[2022-05-20 05:25:54] [INFO ] Computed 218 place invariants in 3 ms
[2022-05-20 05:25:54] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 734 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 578/1371 places, 440/1231 transitions.
Finished structural reductions, in 2 iterations. Remains : 578/1371 places, 440/1231 transitions.
[2022-05-20 05:25:54] [INFO ] Flatten gal took : 12 ms
[2022-05-20 05:25:54] [INFO ] Flatten gal took : 12 ms
[2022-05-20 05:25:54] [INFO ] Input system was already deterministic with 440 transitions.
[2022-05-20 05:25:54] [INFO ] Flatten gal took : 12 ms
[2022-05-20 05:25:54] [INFO ] Flatten gal took : 12 ms
[2022-05-20 05:25:54] [INFO ] Time to serialize gal into /tmp/CTLFireability14560571037845729933.gal : 3 ms
[2022-05-20 05:25:54] [INFO ] Time to serialize properties into /tmp/CTLFireability5452452448185314288.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/CTLFireability14560571037845729933.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5452452448185314288.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,4.8945e+85,1.58846,56504,2,1053,5,203955,6,0,2755,349893,0
Converting to forward existential form...Done !
original formula: EF(AG((AF(((p353==1)&&(p355==1))) * (AF((p1316==1)) + (((p284==1)&&(p317==1))&&((p403==0)||(p203==0)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((!(EG(!(((p353==1)&&(p355==1))))) * (!(EG(!((p1316==1)))) + (((p284==1)&&(p317=...200
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 438/0/2
Detected timeout of ITS tools.
[2022-05-20 05:26:24] [INFO ] Flatten gal took : 16 ms
[2022-05-20 05:26:24] [INFO ] Applying decomposition
[2022-05-20 05:26:24] [INFO ] Flatten gal took : 12 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/graph3628676052388953381.txt' '-o' '/tmp/graph3628676052388953381.bin' '-w' '/tmp/graph3628676052388953381.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3628676052388953381.bin' '-l' '-1' '-v' '-w' '/tmp/graph3628676052388953381.weights' '-q' '0' '-e' '0.001'
[2022-05-20 05:26:24] [INFO ] Decomposing Gal with order
[2022-05-20 05:26:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 05:26:25] [INFO ] Removed a total of 60 redundant transitions.
[2022-05-20 05:26:25] [INFO ] Flatten gal took : 22 ms
[2022-05-20 05:26:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2022-05-20 05:26:25] [INFO ] Time to serialize gal into /tmp/CTLFireability18307926925013189644.gal : 2 ms
[2022-05-20 05:26:25] [INFO ] Time to serialize properties into /tmp/CTLFireability3255814027667457085.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/CTLFireability18307926925013189644.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3255814027667457085.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.
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,4.8945e+85,3.88156,127380,122,24,248794,258,648,746360,60,1403,0
Converting to forward existential form...Done !
original formula: EF(AG((AF(((i4.i0.i0.u36.p353==1)&&(i4.i0.i0.u36.p355==1))) * (AF((i17.u136.p1316==1)) + (((i3.u28.p284==1)&&(i3.u32.p317==1))&&((i4.i0.i...193
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((!(EG(!(((i4.i0.i0.u36.p353==1)&&(i4.i0.i0.u36.p355==1))))) * (!(EG(!((i17.u136...269
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1371/1371 places, 1231/1231 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1343 transition count 1203
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1343 transition count 1203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 1342 transition count 1202
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 1342 transition count 1202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 1341 transition count 1201
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 1341 transition count 1201
Applied a total of 60 rules in 154 ms. Remains 1341 /1371 variables (removed 30) and now considering 1201/1231 (removed 30) transitions.
// Phase 1: matrix 1201 rows 1341 cols
[2022-05-20 05:26:55] [INFO ] Computed 221 place invariants in 7 ms
[2022-05-20 05:26:55] [INFO ] Implicit Places using invariants in 353 ms returned []
// Phase 1: matrix 1201 rows 1341 cols
[2022-05-20 05:26:55] [INFO ] Computed 221 place invariants in 4 ms
[2022-05-20 05:26:56] [INFO ] Implicit Places using invariants and state equation in 936 ms returned []
Implicit Place search using SMT with State Equation took 1289 ms to find 0 implicit places.
// Phase 1: matrix 1201 rows 1341 cols
[2022-05-20 05:26:56] [INFO ] Computed 221 place invariants in 2 ms
[2022-05-20 05:26:57] [INFO ] Dead Transitions using invariants and state equation in 547 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1341/1371 places, 1201/1231 transitions.
Finished structural reductions, in 1 iterations. Remains : 1341/1371 places, 1201/1231 transitions.
[2022-05-20 05:26:57] [INFO ] Flatten gal took : 41 ms
[2022-05-20 05:26:57] [INFO ] Flatten gal took : 24 ms
[2022-05-20 05:26:57] [INFO ] Input system was already deterministic with 1201 transitions.
[2022-05-20 05:26:57] [INFO ] Flatten gal took : 25 ms
[2022-05-20 05:26:57] [INFO ] Flatten gal took : 25 ms
[2022-05-20 05:26:57] [INFO ] Time to serialize gal into /tmp/CTLFireability7142957729133365386.gal : 4 ms
[2022-05-20 05:26:57] [INFO ] Time to serialize properties into /tmp/CTLFireability3257826567998026083.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/CTLFireability7142957729133365386.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3257826567998026083.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:27:27] [INFO ] Flatten gal took : 25 ms
[2022-05-20 05:27:27] [INFO ] Applying decomposition
[2022-05-20 05:27:27] [INFO ] Flatten gal took : 25 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/graph7143579860286742354.txt' '-o' '/tmp/graph7143579860286742354.bin' '-w' '/tmp/graph7143579860286742354.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7143579860286742354.bin' '-l' '-1' '-v' '-w' '/tmp/graph7143579860286742354.weights' '-q' '0' '-e' '0.001'
[2022-05-20 05:27:27] [INFO ] Decomposing Gal with order
[2022-05-20 05:27:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 05:27:27] [INFO ] Removed a total of 203 redundant transitions.
[2022-05-20 05:27:27] [INFO ] Flatten gal took : 68 ms
[2022-05-20 05:27:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2022-05-20 05:27:27] [INFO ] Time to serialize gal into /tmp/CTLFireability12161920497930031370.gal : 7 ms
[2022-05-20 05:27:27] [INFO ] Time to serialize properties into /tmp/CTLFireability2987881535710943669.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/CTLFireability12161920497930031370.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2987881535710943669.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 : 1371/1371 places, 1231/1231 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 284 transitions
Trivial Post-agglo rules discarded 284 transitions
Performed 284 trivial Post agglomeration. Transition count delta: 284
Iterating post reduction 0 with 284 rules applied. Total rules applied 284 place count 1370 transition count 946
Reduce places removed 284 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 287 rules applied. Total rules applied 571 place count 1086 transition count 943
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 575 place count 1084 transition count 941
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 577 place count 1082 transition count 941
Performed 147 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 147 Pre rules applied. Total rules applied 577 place count 1082 transition count 794
Deduced a syphon composed of 147 places in 1 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 4 with 294 rules applied. Total rules applied 871 place count 935 transition count 794
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 894 place count 912 transition count 771
Iterating global reduction 4 with 23 rules applied. Total rules applied 917 place count 912 transition count 771
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 917 place count 912 transition count 756
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 947 place count 897 transition count 756
Performed 306 Post agglomeration using F-continuation condition.Transition count delta: 306
Deduced a syphon composed of 306 places in 0 ms
Reduce places removed 306 places and 0 transitions.
Iterating global reduction 4 with 612 rules applied. Total rules applied 1559 place count 591 transition count 450
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1561 place count 589 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1562 place count 588 transition count 448
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1562 place count 588 transition count 446
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 1566 place count 586 transition count 446
Applied a total of 1566 rules in 124 ms. Remains 586 /1371 variables (removed 785) and now considering 446/1231 (removed 785) transitions.
// Phase 1: matrix 446 rows 586 cols
[2022-05-20 05:27:57] [INFO ] Computed 220 place invariants in 1 ms
[2022-05-20 05:27:58] [INFO ] Implicit Places using invariants in 266 ms returned [564, 568]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 269 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 584/1371 places, 446/1231 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 582 transition count 444
Applied a total of 4 rules in 41 ms. Remains 582 /584 variables (removed 2) and now considering 444/446 (removed 2) transitions.
// Phase 1: matrix 444 rows 582 cols
[2022-05-20 05:27:58] [INFO ] Computed 218 place invariants in 0 ms
[2022-05-20 05:27:58] [INFO ] Implicit Places using invariants in 228 ms returned []
// Phase 1: matrix 444 rows 582 cols
[2022-05-20 05:27:58] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:27:58] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 582/1371 places, 444/1231 transitions.
Finished structural reductions, in 2 iterations. Remains : 582/1371 places, 444/1231 transitions.
[2022-05-20 05:27:58] [INFO ] Flatten gal took : 11 ms
[2022-05-20 05:27:58] [INFO ] Flatten gal took : 12 ms
[2022-05-20 05:27:58] [INFO ] Input system was already deterministic with 444 transitions.
[2022-05-20 05:27:58] [INFO ] Flatten gal took : 12 ms
[2022-05-20 05:27:58] [INFO ] Flatten gal took : 12 ms
[2022-05-20 05:27:58] [INFO ] Time to serialize gal into /tmp/CTLFireability17215074438996147101.gal : 1 ms
[2022-05-20 05:27:58] [INFO ] Time to serialize properties into /tmp/CTLFireability18437228449956266024.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/CTLFireability17215074438996147101.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18437228449956266024.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.
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,4.35097e+85,2.37418,77212,2,1554,5,281864,6,0,2773,494467,0
Converting to forward existential form...Done !
original formula: A(EF(((!(((AG((p320==1)) + A((p318==1) U (p1073==1))) * EG((p391==1)))) * (p1117==1)) * (p1164==1))) U (p1539==1))
=> equivalent forward existential formula: [((Init * !(EG(!((p1539==1))))) * !(E(!((p1539==1)) U (!(E(TRUE U ((!(((!(E(TRUE U !((p320==1)))) + !((E(!((p107...296
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t13, t58, t63, t64, t100, t104, t106, t110,...346
Detected timeout of ITS tools.
[2022-05-20 05:28:28] [INFO ] Flatten gal took : 16 ms
[2022-05-20 05:28:28] [INFO ] Applying decomposition
[2022-05-20 05:28:28] [INFO ] Flatten gal took : 12 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/graph7737604196631345551.txt' '-o' '/tmp/graph7737604196631345551.bin' '-w' '/tmp/graph7737604196631345551.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7737604196631345551.bin' '-l' '-1' '-v' '-w' '/tmp/graph7737604196631345551.weights' '-q' '0' '-e' '0.001'
[2022-05-20 05:28:28] [INFO ] Decomposing Gal with order
[2022-05-20 05:28:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 05:28:28] [INFO ] Removed a total of 59 redundant transitions.
[2022-05-20 05:28:28] [INFO ] Flatten gal took : 19 ms
[2022-05-20 05:28:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2022-05-20 05:28:28] [INFO ] Time to serialize gal into /tmp/CTLFireability11890260146560579586.gal : 2 ms
[2022-05-20 05:28:28] [INFO ] Time to serialize properties into /tmp/CTLFireability8678345366726062064.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/CTLFireability11890260146560579586.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8678345366726062064.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.
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,4.35097e+85,5.40844,172360,285,44,340675,236,648,984114,55,1090,0
Converting to forward existential form...Done !
original formula: A(EF(((!(((AG((i3.u33.p320==1)) + A((i3.u32.p318==1) U (i12.u111.p1073==1))) * EG((i4.u40.p391==1)))) * (i15.u116.p1117==1)) * (i15.u121....189
=> equivalent forward existential formula: [((Init * !(EG(!((i20.u161.p1539==1))))) * !(E(!((i20.u161.p1539==1)) U (!(E(TRUE U ((!(((!(E(TRUE U !((i3.u33.p...389
Reverse transition relation is NOT exact ! Due to transitions i0.u6.t104, i0.u3.t1, i0.u8.t110, i0.u2.t0, i0.u7.t106, i0.u5.t100, i0.u11.t4, i0.u4.t2, i0.u...566
Using saturation style SCC detection
Using saturation style SCC detection
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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1371/1371 places, 1231/1231 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 291 transitions
Trivial Post-agglo rules discarded 291 transitions
Performed 291 trivial Post agglomeration. Transition count delta: 291
Iterating post reduction 0 with 291 rules applied. Total rules applied 291 place count 1370 transition count 939
Reduce places removed 291 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 294 rules applied. Total rules applied 585 place count 1079 transition count 936
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 587 place count 1077 transition count 936
Performed 145 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 145 Pre rules applied. Total rules applied 587 place count 1077 transition count 791
Deduced a syphon composed of 145 places in 1 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 3 with 290 rules applied. Total rules applied 877 place count 932 transition count 791
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 901 place count 908 transition count 767
Iterating global reduction 3 with 24 rules applied. Total rules applied 925 place count 908 transition count 767
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 925 place count 908 transition count 750
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 959 place count 891 transition count 750
Performed 309 Post agglomeration using F-continuation condition.Transition count delta: 309
Deduced a syphon composed of 309 places in 0 ms
Reduce places removed 309 places and 0 transitions.
Iterating global reduction 3 with 618 rules applied. Total rules applied 1577 place count 582 transition count 441
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1579 place count 580 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1580 place count 579 transition count 439
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1580 place count 579 transition count 437
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1584 place count 577 transition count 437
Applied a total of 1584 rules in 104 ms. Remains 577 /1371 variables (removed 794) and now considering 437/1231 (removed 794) transitions.
// Phase 1: matrix 437 rows 577 cols
[2022-05-20 05:28:59] [INFO ] Computed 220 place invariants in 3 ms
[2022-05-20 05:28:59] [INFO ] Implicit Places using invariants in 232 ms returned [557, 561]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 235 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 575/1371 places, 437/1231 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 573 transition count 435
Applied a total of 4 rules in 16 ms. Remains 573 /575 variables (removed 2) and now considering 435/437 (removed 2) transitions.
// Phase 1: matrix 435 rows 573 cols
[2022-05-20 05:28:59] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:28:59] [INFO ] Implicit Places using invariants in 226 ms returned []
// Phase 1: matrix 435 rows 573 cols
[2022-05-20 05:28:59] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:29:00] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 633 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 573/1371 places, 435/1231 transitions.
Finished structural reductions, in 2 iterations. Remains : 573/1371 places, 435/1231 transitions.
[2022-05-20 05:29:00] [INFO ] Flatten gal took : 12 ms
[2022-05-20 05:29:00] [INFO ] Flatten gal took : 12 ms
[2022-05-20 05:29:00] [INFO ] Input system was already deterministic with 435 transitions.
Finished random walk after 1483 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=134 )
FORMULA ShieldPPPt-PT-020B-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 1371/1371 places, 1231/1231 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1343 transition count 1203
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1343 transition count 1203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 1342 transition count 1202
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 1342 transition count 1202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 1341 transition count 1201
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 1341 transition count 1201
Applied a total of 60 rules in 161 ms. Remains 1341 /1371 variables (removed 30) and now considering 1201/1231 (removed 30) transitions.
// Phase 1: matrix 1201 rows 1341 cols
[2022-05-20 05:29:00] [INFO ] Computed 221 place invariants in 5 ms
[2022-05-20 05:29:00] [INFO ] Implicit Places using invariants in 352 ms returned []
// Phase 1: matrix 1201 rows 1341 cols
[2022-05-20 05:29:00] [INFO ] Computed 221 place invariants in 2 ms
[2022-05-20 05:29:01] [INFO ] Implicit Places using invariants and state equation in 938 ms returned []
Implicit Place search using SMT with State Equation took 1298 ms to find 0 implicit places.
// Phase 1: matrix 1201 rows 1341 cols
[2022-05-20 05:29:01] [INFO ] Computed 221 place invariants in 3 ms
[2022-05-20 05:29:02] [INFO ] Dead Transitions using invariants and state equation in 562 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1341/1371 places, 1201/1231 transitions.
Finished structural reductions, in 1 iterations. Remains : 1341/1371 places, 1201/1231 transitions.
[2022-05-20 05:29:02] [INFO ] Flatten gal took : 25 ms
[2022-05-20 05:29:02] [INFO ] Flatten gal took : 26 ms
[2022-05-20 05:29:02] [INFO ] Input system was already deterministic with 1201 transitions.
[2022-05-20 05:29:02] [INFO ] Flatten gal took : 26 ms
[2022-05-20 05:29:02] [INFO ] Flatten gal took : 26 ms
[2022-05-20 05:29:02] [INFO ] Time to serialize gal into /tmp/CTLFireability12542518534103241510.gal : 3 ms
[2022-05-20 05:29:02] [INFO ] Time to serialize properties into /tmp/CTLFireability13937862644159431351.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/CTLFireability12542518534103241510.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13937862644159431351.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:29:32] [INFO ] Flatten gal took : 37 ms
[2022-05-20 05:29:32] [INFO ] Applying decomposition
[2022-05-20 05:29:32] [INFO ] Flatten gal took : 26 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/graph15514202507935830563.txt' '-o' '/tmp/graph15514202507935830563.bin' '-w' '/tmp/graph15514202507935830563.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15514202507935830563.bin' '-l' '-1' '-v' '-w' '/tmp/graph15514202507935830563.weights' '-q' '0' '-e' '0.001'
[2022-05-20 05:29:32] [INFO ] Decomposing Gal with order
[2022-05-20 05:29:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 05:29:32] [INFO ] Removed a total of 200 redundant transitions.
[2022-05-20 05:29:32] [INFO ] Flatten gal took : 45 ms
[2022-05-20 05:29:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-20 05:29:32] [INFO ] Time to serialize gal into /tmp/CTLFireability5042097436351659124.gal : 7 ms
[2022-05-20 05:29:32] [INFO ] Time to serialize properties into /tmp/CTLFireability6665758703900280406.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/CTLFireability5042097436351659124.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6665758703900280406.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 : 1371/1371 places, 1231/1231 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1349 transition count 1209
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1349 transition count 1209
Applied a total of 44 rules in 80 ms. Remains 1349 /1371 variables (removed 22) and now considering 1209/1231 (removed 22) transitions.
// Phase 1: matrix 1209 rows 1349 cols
[2022-05-20 05:30:02] [INFO ] Computed 221 place invariants in 8 ms
[2022-05-20 05:30:03] [INFO ] Implicit Places using invariants in 361 ms returned []
// Phase 1: matrix 1209 rows 1349 cols
[2022-05-20 05:30:03] [INFO ] Computed 221 place invariants in 3 ms
[2022-05-20 05:30:04] [INFO ] Implicit Places using invariants and state equation in 934 ms returned []
Implicit Place search using SMT with State Equation took 1296 ms to find 0 implicit places.
// Phase 1: matrix 1209 rows 1349 cols
[2022-05-20 05:30:04] [INFO ] Computed 221 place invariants in 3 ms
[2022-05-20 05:30:04] [INFO ] Dead Transitions using invariants and state equation in 572 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1349/1371 places, 1209/1231 transitions.
Finished structural reductions, in 1 iterations. Remains : 1349/1371 places, 1209/1231 transitions.
[2022-05-20 05:30:04] [INFO ] Flatten gal took : 24 ms
[2022-05-20 05:30:04] [INFO ] Flatten gal took : 25 ms
[2022-05-20 05:30:04] [INFO ] Input system was already deterministic with 1209 transitions.
[2022-05-20 05:30:04] [INFO ] Flatten gal took : 24 ms
[2022-05-20 05:30:04] [INFO ] Flatten gal took : 24 ms
[2022-05-20 05:30:04] [INFO ] Time to serialize gal into /tmp/CTLFireability11153487636243272551.gal : 3 ms
[2022-05-20 05:30:04] [INFO ] Time to serialize properties into /tmp/CTLFireability18227986929183425402.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/CTLFireability11153487636243272551.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18227986929183425402.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:30:34] [INFO ] Flatten gal took : 28 ms
[2022-05-20 05:30:34] [INFO ] Applying decomposition
[2022-05-20 05:30:34] [INFO ] Flatten gal took : 25 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/graph11041911685374575019.txt' '-o' '/tmp/graph11041911685374575019.bin' '-w' '/tmp/graph11041911685374575019.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11041911685374575019.bin' '-l' '-1' '-v' '-w' '/tmp/graph11041911685374575019.weights' '-q' '0' '-e' '0.001'
[2022-05-20 05:30:34] [INFO ] Decomposing Gal with order
[2022-05-20 05:30:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 05:30:35] [INFO ] Removed a total of 191 redundant transitions.
[2022-05-20 05:30:35] [INFO ] Flatten gal took : 47 ms
[2022-05-20 05:30:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-20 05:30:35] [INFO ] Time to serialize gal into /tmp/CTLFireability15783782949316510932.gal : 6 ms
[2022-05-20 05:30:35] [INFO ] Time to serialize properties into /tmp/CTLFireability11009131871773541059.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/CTLFireability15783782949316510932.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11009131871773541059.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 : 1371/1371 places, 1231/1231 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1347 transition count 1207
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1347 transition count 1207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 1346 transition count 1206
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 1346 transition count 1206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 1345 transition count 1205
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 1345 transition count 1205
Applied a total of 52 rules in 157 ms. Remains 1345 /1371 variables (removed 26) and now considering 1205/1231 (removed 26) transitions.
// Phase 1: matrix 1205 rows 1345 cols
[2022-05-20 05:31:05] [INFO ] Computed 221 place invariants in 7 ms
[2022-05-20 05:31:05] [INFO ] Implicit Places using invariants in 345 ms returned []
// Phase 1: matrix 1205 rows 1345 cols
[2022-05-20 05:31:05] [INFO ] Computed 221 place invariants in 3 ms
[2022-05-20 05:31:06] [INFO ] Implicit Places using invariants and state equation in 923 ms returned []
Implicit Place search using SMT with State Equation took 1281 ms to find 0 implicit places.
// Phase 1: matrix 1205 rows 1345 cols
[2022-05-20 05:31:06] [INFO ] Computed 221 place invariants in 3 ms
[2022-05-20 05:31:07] [INFO ] Dead Transitions using invariants and state equation in 538 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1345/1371 places, 1205/1231 transitions.
Finished structural reductions, in 1 iterations. Remains : 1345/1371 places, 1205/1231 transitions.
[2022-05-20 05:31:07] [INFO ] Flatten gal took : 23 ms
[2022-05-20 05:31:07] [INFO ] Flatten gal took : 25 ms
[2022-05-20 05:31:07] [INFO ] Input system was already deterministic with 1205 transitions.
[2022-05-20 05:31:07] [INFO ] Flatten gal took : 24 ms
[2022-05-20 05:31:07] [INFO ] Flatten gal took : 24 ms
[2022-05-20 05:31:07] [INFO ] Time to serialize gal into /tmp/CTLFireability3763937855710677639.gal : 2 ms
[2022-05-20 05:31:07] [INFO ] Time to serialize properties into /tmp/CTLFireability11894354002783968259.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/CTLFireability3763937855710677639.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11894354002783968259.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:31:37] [INFO ] Flatten gal took : 25 ms
[2022-05-20 05:31:37] [INFO ] Applying decomposition
[2022-05-20 05:31:37] [INFO ] Flatten gal took : 25 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/graph3969688805786321989.txt' '-o' '/tmp/graph3969688805786321989.bin' '-w' '/tmp/graph3969688805786321989.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3969688805786321989.bin' '-l' '-1' '-v' '-w' '/tmp/graph3969688805786321989.weights' '-q' '0' '-e' '0.001'
[2022-05-20 05:31:37] [INFO ] Decomposing Gal with order
[2022-05-20 05:31:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 05:31:37] [INFO ] Removed a total of 201 redundant transitions.
[2022-05-20 05:31:37] [INFO ] Flatten gal took : 44 ms
[2022-05-20 05:31:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-20 05:31:37] [INFO ] Time to serialize gal into /tmp/CTLFireability5907017495373007255.gal : 7 ms
[2022-05-20 05:31:37] [INFO ] Time to serialize properties into /tmp/CTLFireability9441298371300290114.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/CTLFireability5907017495373007255.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9441298371300290114.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 : 1371/1371 places, 1231/1231 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 286 transitions
Trivial Post-agglo rules discarded 286 transitions
Performed 286 trivial Post agglomeration. Transition count delta: 286
Iterating post reduction 0 with 286 rules applied. Total rules applied 286 place count 1370 transition count 944
Reduce places removed 286 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 289 rules applied. Total rules applied 575 place count 1084 transition count 941
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 578 place count 1082 transition count 940
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 579 place count 1081 transition count 940
Performed 144 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 144 Pre rules applied. Total rules applied 579 place count 1081 transition count 796
Deduced a syphon composed of 144 places in 1 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 4 with 288 rules applied. Total rules applied 867 place count 937 transition count 796
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 891 place count 913 transition count 772
Iterating global reduction 4 with 24 rules applied. Total rules applied 915 place count 913 transition count 772
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 17 Pre rules applied. Total rules applied 915 place count 913 transition count 755
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 949 place count 896 transition count 755
Performed 301 Post agglomeration using F-continuation condition.Transition count delta: 301
Deduced a syphon composed of 301 places in 0 ms
Reduce places removed 301 places and 0 transitions.
Iterating global reduction 4 with 602 rules applied. Total rules applied 1551 place count 595 transition count 454
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1553 place count 593 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1554 place count 592 transition count 452
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1554 place count 592 transition count 450
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 1558 place count 590 transition count 450
Applied a total of 1558 rules in 142 ms. Remains 590 /1371 variables (removed 781) and now considering 450/1231 (removed 781) transitions.
// Phase 1: matrix 450 rows 590 cols
[2022-05-20 05:32:07] [INFO ] Computed 220 place invariants in 2 ms
[2022-05-20 05:32:07] [INFO ] Implicit Places using invariants in 235 ms returned [570, 574]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 236 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 588/1371 places, 450/1231 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 586 transition count 448
Applied a total of 4 rules in 16 ms. Remains 586 /588 variables (removed 2) and now considering 448/450 (removed 2) transitions.
// Phase 1: matrix 448 rows 586 cols
[2022-05-20 05:32:07] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:32:08] [INFO ] Implicit Places using invariants in 231 ms returned []
// Phase 1: matrix 448 rows 586 cols
[2022-05-20 05:32:08] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:32:08] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 586/1371 places, 448/1231 transitions.
Finished structural reductions, in 2 iterations. Remains : 586/1371 places, 448/1231 transitions.
[2022-05-20 05:32:08] [INFO ] Flatten gal took : 11 ms
[2022-05-20 05:32:08] [INFO ] Flatten gal took : 12 ms
[2022-05-20 05:32:08] [INFO ] Input system was already deterministic with 448 transitions.
[2022-05-20 05:32:08] [INFO ] Flatten gal took : 12 ms
[2022-05-20 05:32:08] [INFO ] Flatten gal took : 12 ms
[2022-05-20 05:32:08] [INFO ] Time to serialize gal into /tmp/CTLFireability4535149943249827767.gal : 1 ms
[2022-05-20 05:32:08] [INFO ] Time to serialize properties into /tmp/CTLFireability11793525691812410739.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/CTLFireability4535149943249827767.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11793525691812410739.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,5.32526e+85,2.87333,98260,2,1546,5,363272,6,0,2791,650282,0
Converting to forward existential form...Done !
original formula: A((p721==1) U E(EF((p303==1)) U (!((AG((p984==1)) + AF((p178==1)))) * E((((p1352==1)&&(p25==1))||(p535!=1)) U ((p1385!=1)||((p960==1)&&(p...169
=> equivalent forward existential formula: [((Init * !(EG(!(E(E(TRUE U (p303==1)) U (!((!(E(TRUE U !((p984==1)))) + !(EG(!((p178==1)))))) * E((((p1352==1)&...590
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...558
Detected timeout of ITS tools.
[2022-05-20 05:32:38] [INFO ] Flatten gal took : 12 ms
[2022-05-20 05:32:38] [INFO ] Applying decomposition
[2022-05-20 05:32:38] [INFO ] Flatten gal took : 12 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/graph6219723412854426983.txt' '-o' '/tmp/graph6219723412854426983.bin' '-w' '/tmp/graph6219723412854426983.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6219723412854426983.bin' '-l' '-1' '-v' '-w' '/tmp/graph6219723412854426983.weights' '-q' '0' '-e' '0.001'
[2022-05-20 05:32:38] [INFO ] Decomposing Gal with order
[2022-05-20 05:32:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 05:32:38] [INFO ] Removed a total of 59 redundant transitions.
[2022-05-20 05:32:38] [INFO ] Flatten gal took : 17 ms
[2022-05-20 05:32:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-20 05:32:38] [INFO ] Time to serialize gal into /tmp/CTLFireability16722076601879233663.gal : 3 ms
[2022-05-20 05:32:38] [INFO ] Time to serialize properties into /tmp/CTLFireability1040622942893412077.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/CTLFireability16722076601879233663.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1040622942893412077.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.
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,5.32526e+85,18.2148,530904,295,30,957741,327,757,3.57351e+06,60,2023,0
Converting to forward existential form...Done !
original formula: A((i9.u75.p721==1) U E(EF((i2.u32.p303==1)) U (!((AG((i11.u106.p984==1)) + AF((i3.u18.p178==1)))) * E((((i17.u145.p1352==1)&&(i0.u1.p25==...248
=> equivalent forward existential formula: [((Init * !(EG(!(E(E(TRUE U (i2.u32.p303==1)) U (!((!(E(TRUE U !((i11.u106.p984==1)))) + !(EG(!((i3.u18.p178==1)...813
Reverse transition relation is NOT exact ! Due to transitions i0.t367, i0.u3.t0, i0.u4.t1, i0.u5.t2, i0.u6.t100, i0.u7.t104, i0.u8.t106, i0.u9.t110, i1.u13...1140
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1371/1371 places, 1231/1231 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1348 transition count 1208
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1348 transition count 1208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 1347 transition count 1207
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 1347 transition count 1207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 1346 transition count 1206
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 1346 transition count 1206
Applied a total of 50 rules in 152 ms. Remains 1346 /1371 variables (removed 25) and now considering 1206/1231 (removed 25) transitions.
// Phase 1: matrix 1206 rows 1346 cols
[2022-05-20 05:33:09] [INFO ] Computed 221 place invariants in 9 ms
[2022-05-20 05:33:09] [INFO ] Implicit Places using invariants in 362 ms returned []
// Phase 1: matrix 1206 rows 1346 cols
[2022-05-20 05:33:09] [INFO ] Computed 221 place invariants in 2 ms
[2022-05-20 05:33:10] [INFO ] Implicit Places using invariants and state equation in 935 ms returned []
Implicit Place search using SMT with State Equation took 1298 ms to find 0 implicit places.
// Phase 1: matrix 1206 rows 1346 cols
[2022-05-20 05:33:10] [INFO ] Computed 221 place invariants in 7 ms
[2022-05-20 05:33:10] [INFO ] Dead Transitions using invariants and state equation in 545 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1346/1371 places, 1206/1231 transitions.
Finished structural reductions, in 1 iterations. Remains : 1346/1371 places, 1206/1231 transitions.
[2022-05-20 05:33:10] [INFO ] Flatten gal took : 24 ms
[2022-05-20 05:33:10] [INFO ] Flatten gal took : 25 ms
[2022-05-20 05:33:10] [INFO ] Input system was already deterministic with 1206 transitions.
[2022-05-20 05:33:11] [INFO ] Flatten gal took : 24 ms
[2022-05-20 05:33:11] [INFO ] Flatten gal took : 25 ms
[2022-05-20 05:33:11] [INFO ] Time to serialize gal into /tmp/CTLFireability5978830989715744532.gal : 3 ms
[2022-05-20 05:33:11] [INFO ] Time to serialize properties into /tmp/CTLFireability16657609839411180007.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/CTLFireability5978830989715744532.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16657609839411180007.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:33:41] [INFO ] Flatten gal took : 26 ms
[2022-05-20 05:33:41] [INFO ] Applying decomposition
[2022-05-20 05:33:41] [INFO ] Flatten gal took : 25 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/graph14017800823401479893.txt' '-o' '/tmp/graph14017800823401479893.bin' '-w' '/tmp/graph14017800823401479893.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14017800823401479893.bin' '-l' '-1' '-v' '-w' '/tmp/graph14017800823401479893.weights' '-q' '0' '-e' '0.001'
[2022-05-20 05:33:41] [INFO ] Decomposing Gal with order
[2022-05-20 05:33:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 05:33:41] [INFO ] Removed a total of 201 redundant transitions.
[2022-05-20 05:33:41] [INFO ] Flatten gal took : 45 ms
[2022-05-20 05:33:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-20 05:33:41] [INFO ] Time to serialize gal into /tmp/CTLFireability10430731089604444940.gal : 6 ms
[2022-05-20 05:33:41] [INFO ] Time to serialize properties into /tmp/CTLFireability7161385877420828513.ctl : 68 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/CTLFireability10430731089604444940.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7161385877420828513.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 : 1371/1371 places, 1231/1231 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1346 transition count 1206
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1346 transition count 1206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 1345 transition count 1205
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 1345 transition count 1205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 1344 transition count 1204
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 1344 transition count 1204
Applied a total of 54 rules in 181 ms. Remains 1344 /1371 variables (removed 27) and now considering 1204/1231 (removed 27) transitions.
// Phase 1: matrix 1204 rows 1344 cols
[2022-05-20 05:34:11] [INFO ] Computed 221 place invariants in 6 ms
[2022-05-20 05:34:11] [INFO ] Implicit Places using invariants in 344 ms returned []
// Phase 1: matrix 1204 rows 1344 cols
[2022-05-20 05:34:11] [INFO ] Computed 221 place invariants in 4 ms
[2022-05-20 05:34:12] [INFO ] Implicit Places using invariants and state equation in 911 ms returned []
Implicit Place search using SMT with State Equation took 1256 ms to find 0 implicit places.
// Phase 1: matrix 1204 rows 1344 cols
[2022-05-20 05:34:12] [INFO ] Computed 221 place invariants in 3 ms
[2022-05-20 05:34:13] [INFO ] Dead Transitions using invariants and state equation in 566 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1344/1371 places, 1204/1231 transitions.
Finished structural reductions, in 1 iterations. Remains : 1344/1371 places, 1204/1231 transitions.
[2022-05-20 05:34:13] [INFO ] Flatten gal took : 24 ms
[2022-05-20 05:34:13] [INFO ] Flatten gal took : 25 ms
[2022-05-20 05:34:13] [INFO ] Input system was already deterministic with 1204 transitions.
[2022-05-20 05:34:13] [INFO ] Flatten gal took : 25 ms
[2022-05-20 05:34:13] [INFO ] Flatten gal took : 24 ms
[2022-05-20 05:34:13] [INFO ] Time to serialize gal into /tmp/CTLFireability1388850924042001656.gal : 3 ms
[2022-05-20 05:34:13] [INFO ] Time to serialize properties into /tmp/CTLFireability5459915096163368042.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/CTLFireability1388850924042001656.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5459915096163368042.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:34:43] [INFO ] Flatten gal took : 28 ms
[2022-05-20 05:34:43] [INFO ] Applying decomposition
[2022-05-20 05:34:43] [INFO ] Flatten gal took : 24 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/graph4424123029482788834.txt' '-o' '/tmp/graph4424123029482788834.bin' '-w' '/tmp/graph4424123029482788834.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4424123029482788834.bin' '-l' '-1' '-v' '-w' '/tmp/graph4424123029482788834.weights' '-q' '0' '-e' '0.001'
[2022-05-20 05:34:43] [INFO ] Decomposing Gal with order
[2022-05-20 05:34:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 05:34:43] [INFO ] Removed a total of 200 redundant transitions.
[2022-05-20 05:34:43] [INFO ] Flatten gal took : 44 ms
[2022-05-20 05:34:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-20 05:34:43] [INFO ] Time to serialize gal into /tmp/CTLFireability5975028113023510808.gal : 6 ms
[2022-05-20 05:34:43] [INFO ] Time to serialize properties into /tmp/CTLFireability18060456804339282064.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/CTLFireability5975028113023510808.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18060456804339282064.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 : 1371/1371 places, 1231/1231 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1344 transition count 1204
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1344 transition count 1204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 1343 transition count 1203
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 1343 transition count 1203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 1342 transition count 1202
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 1342 transition count 1202
Applied a total of 58 rules in 143 ms. Remains 1342 /1371 variables (removed 29) and now considering 1202/1231 (removed 29) transitions.
// Phase 1: matrix 1202 rows 1342 cols
[2022-05-20 05:35:14] [INFO ] Computed 221 place invariants in 8 ms
[2022-05-20 05:35:14] [INFO ] Implicit Places using invariants in 341 ms returned []
// Phase 1: matrix 1202 rows 1342 cols
[2022-05-20 05:35:14] [INFO ] Computed 221 place invariants in 3 ms
[2022-05-20 05:35:15] [INFO ] Implicit Places using invariants and state equation in 911 ms returned []
Implicit Place search using SMT with State Equation took 1252 ms to find 0 implicit places.
// Phase 1: matrix 1202 rows 1342 cols
[2022-05-20 05:35:15] [INFO ] Computed 221 place invariants in 3 ms
[2022-05-20 05:35:15] [INFO ] Dead Transitions using invariants and state equation in 537 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1342/1371 places, 1202/1231 transitions.
Finished structural reductions, in 1 iterations. Remains : 1342/1371 places, 1202/1231 transitions.
[2022-05-20 05:35:15] [INFO ] Flatten gal took : 24 ms
[2022-05-20 05:35:15] [INFO ] Flatten gal took : 55 ms
[2022-05-20 05:35:16] [INFO ] Input system was already deterministic with 1202 transitions.
[2022-05-20 05:35:16] [INFO ] Flatten gal took : 24 ms
[2022-05-20 05:35:16] [INFO ] Flatten gal took : 25 ms
[2022-05-20 05:35:16] [INFO ] Time to serialize gal into /tmp/CTLFireability1381689565342965719.gal : 3 ms
[2022-05-20 05:35:16] [INFO ] Time to serialize properties into /tmp/CTLFireability12200988787369391021.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/CTLFireability1381689565342965719.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12200988787369391021.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:35:46] [INFO ] Flatten gal took : 26 ms
[2022-05-20 05:35:46] [INFO ] Applying decomposition
[2022-05-20 05:35:46] [INFO ] Flatten gal took : 25 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/graph10280085849001344942.txt' '-o' '/tmp/graph10280085849001344942.bin' '-w' '/tmp/graph10280085849001344942.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10280085849001344942.bin' '-l' '-1' '-v' '-w' '/tmp/graph10280085849001344942.weights' '-q' '0' '-e' '0.001'
[2022-05-20 05:35:46] [INFO ] Decomposing Gal with order
[2022-05-20 05:35:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 05:35:46] [INFO ] Removed a total of 204 redundant transitions.
[2022-05-20 05:35:46] [INFO ] Flatten gal took : 43 ms
[2022-05-20 05:35:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-20 05:35:46] [INFO ] Time to serialize gal into /tmp/CTLFireability3160316014977409357.gal : 7 ms
[2022-05-20 05:35:46] [INFO ] Time to serialize properties into /tmp/CTLFireability802358846870213289.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/CTLFireability3160316014977409357.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability802358846870213289.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...252
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 : 1371/1371 places, 1231/1231 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 291 transitions
Trivial Post-agglo rules discarded 291 transitions
Performed 291 trivial Post agglomeration. Transition count delta: 291
Iterating post reduction 0 with 291 rules applied. Total rules applied 291 place count 1370 transition count 939
Reduce places removed 291 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 294 rules applied. Total rules applied 585 place count 1079 transition count 936
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 587 place count 1077 transition count 936
Performed 145 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 145 Pre rules applied. Total rules applied 587 place count 1077 transition count 791
Deduced a syphon composed of 145 places in 1 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 3 with 290 rules applied. Total rules applied 877 place count 932 transition count 791
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 900 place count 909 transition count 768
Iterating global reduction 3 with 23 rules applied. Total rules applied 923 place count 909 transition count 768
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 923 place count 909 transition count 752
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 955 place count 893 transition count 752
Performed 310 Post agglomeration using F-continuation condition.Transition count delta: 310
Deduced a syphon composed of 310 places in 0 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 3 with 620 rules applied. Total rules applied 1575 place count 583 transition count 442
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1577 place count 581 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1578 place count 580 transition count 440
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1578 place count 580 transition count 438
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 1582 place count 578 transition count 438
Applied a total of 1582 rules in 111 ms. Remains 578 /1371 variables (removed 793) and now considering 438/1231 (removed 793) transitions.
// Phase 1: matrix 438 rows 578 cols
[2022-05-20 05:36:16] [INFO ] Computed 220 place invariants in 2 ms
[2022-05-20 05:36:16] [INFO ] Implicit Places using invariants in 251 ms returned [558, 562]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 252 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 576/1371 places, 438/1231 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 574 transition count 436
Applied a total of 4 rules in 34 ms. Remains 574 /576 variables (removed 2) and now considering 436/438 (removed 2) transitions.
// Phase 1: matrix 436 rows 574 cols
[2022-05-20 05:36:16] [INFO ] Computed 218 place invariants in 0 ms
[2022-05-20 05:36:17] [INFO ] Implicit Places using invariants in 233 ms returned []
// Phase 1: matrix 436 rows 574 cols
[2022-05-20 05:36:17] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:36:17] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 574/1371 places, 436/1231 transitions.
Finished structural reductions, in 2 iterations. Remains : 574/1371 places, 436/1231 transitions.
[2022-05-20 05:36:17] [INFO ] Flatten gal took : 11 ms
[2022-05-20 05:36:17] [INFO ] Flatten gal took : 11 ms
[2022-05-20 05:36:17] [INFO ] Input system was already deterministic with 436 transitions.
[2022-05-20 05:36:17] [INFO ] Flatten gal took : 11 ms
[2022-05-20 05:36:17] [INFO ] Flatten gal took : 11 ms
[2022-05-20 05:36:17] [INFO ] Time to serialize gal into /tmp/CTLFireability10615355782844714620.gal : 1 ms
[2022-05-20 05:36:17] [INFO ] Time to serialize properties into /tmp/CTLFireability17009044352113827465.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/CTLFireability10615355782844714620.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17009044352113827465.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.
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,2.03937e+85,1.50964,55708,2,1045,5,201756,6,0,2735,347430,0
Converting to forward existential form...Done !
original formula: EF(AG(((p405==1)||((p572==1)&&(p613==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((p405==1)||((p572==1)&&(p613==1)))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,2.42432,58780,1,0,7,320507,15,1,12463,347430,5
FORMULA ShieldPPPt-PT-020B-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2022-05-20 05:36:20] [INFO ] Flatten gal took : 26 ms
[2022-05-20 05:36:20] [INFO ] Flatten gal took : 26 ms
[2022-05-20 05:36:20] [INFO ] Applying decomposition
[2022-05-20 05:36:20] [INFO ] Flatten gal took : 27 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/graph10968402528807423153.txt' '-o' '/tmp/graph10968402528807423153.bin' '-w' '/tmp/graph10968402528807423153.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10968402528807423153.bin' '-l' '-1' '-v' '-w' '/tmp/graph10968402528807423153.weights' '-q' '0' '-e' '0.001'
[2022-05-20 05:36:20] [INFO ] Decomposing Gal with order
[2022-05-20 05:36:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 05:36:20] [INFO ] Removed a total of 185 redundant transitions.
[2022-05-20 05:36:20] [INFO ] Flatten gal took : 45 ms
[2022-05-20 05:36:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-20 05:36:20] [INFO ] Time to serialize gal into /tmp/CTLFireability12287592315041785872.gal : 7 ms
[2022-05-20 05:36:20] [INFO ] Time to serialize properties into /tmp/CTLFireability5702720596688207874.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/CTLFireability12287592315041785872.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5702720596688207874.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 13 CTL formulae.
Detected timeout of ITS tools.
[2022-05-20 06:01:34] [INFO ] Applying decomposition
[2022-05-20 06:01:34] [INFO ] Flatten gal took : 234 ms
[2022-05-20 06:01:34] [INFO ] Decomposing Gal with order
[2022-05-20 06:01:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 06:01:35] [INFO ] Removed a total of 53 redundant transitions.
[2022-05-20 06:01:35] [INFO ] Flatten gal took : 313 ms
[2022-05-20 06:01:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 218 labels/synchronizations in 162 ms.
[2022-05-20 06:01:54] [INFO ] Time to serialize gal into /tmp/CTLFireability3220515147234098789.gal : 143 ms
[2022-05-20 06:01:54] [INFO ] Time to serialize properties into /tmp/CTLFireability2365468762251340321.ctl : 6 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/CTLFireability3220515147234098789.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2365468762251340321.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 13 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-020B"
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-020B, 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-165286025500634"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-020B.tgz
mv ShieldPPPt-PT-020B 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 '
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 ;