MCC'2022- Execution of r024-tall-165251918600474

About the Execution of ITS-Tools for BusinessProcesses-PT-20

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
16222.968	3600000.00	3076900.00	424145.10	???FT????T??????	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.r024-tall-165251918600474.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 BusinessProcesses-PT-20, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918600474
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 6.8K Apr 29 23:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 29 23:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 29 23:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 29 23:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 192K May 10 09:33 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 BusinessProcesses-PT-20-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-20-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1652639441671

Running Version 202205111006
[2022-05-15 18:30:42] [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-15 18:30:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 18:30:42] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2022-05-15 18:30:43] [INFO ] Transformed 782 places.
[2022-05-15 18:30:43] [INFO ] Transformed 697 transitions.
[2022-05-15 18:30:43] [INFO ] Found NUPN structural information;
[2022-05-15 18:30:43] [INFO ] Parsed PT model containing 782 places and 697 transitions in 221 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Deduced a syphon composed of 63 places in 14 ms
Reduce places removed 63 places and 59 transitions.
Support contains 129 out of 719 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 719/719 places, 638/638 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 705 transition count 638
Discarding 81 places :
Symmetric choice reduction at 1 with 81 rule applications. Total rules 95 place count 624 transition count 557
Iterating global reduction 1 with 81 rules applied. Total rules applied 176 place count 624 transition count 557
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 215 place count 585 transition count 518
Iterating global reduction 1 with 39 rules applied. Total rules applied 254 place count 585 transition count 518
Applied a total of 254 rules in 129 ms. Remains 585 /719 variables (removed 134) and now considering 518/638 (removed 120) transitions.
// Phase 1: matrix 518 rows 585 cols
[2022-05-15 18:30:43] [INFO ] Computed 107 place invariants in 23 ms
[2022-05-15 18:30:43] [INFO ] Implicit Places using invariants in 339 ms returned []
// Phase 1: matrix 518 rows 585 cols
[2022-05-15 18:30:43] [INFO ] Computed 107 place invariants in 11 ms
[2022-05-15 18:30:44] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 854 ms to find 0 implicit places.
// Phase 1: matrix 518 rows 585 cols
[2022-05-15 18:30:44] [INFO ] Computed 107 place invariants in 18 ms
[2022-05-15 18:30:44] [INFO ] Dead Transitions using invariants and state equation in 291 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 585/719 places, 518/638 transitions.
Finished structural reductions, in 1 iterations. Remains : 585/719 places, 518/638 transitions.
Support contains 129 out of 585 places after structural reductions.
[2022-05-15 18:30:44] [INFO ] Flatten gal took : 73 ms
[2022-05-15 18:30:44] [INFO ] Flatten gal took : 33 ms
[2022-05-15 18:30:44] [INFO ] Input system was already deterministic with 518 transitions.
Support contains 127 out of 585 places (down from 129) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 50 resets, run finished after 550 ms. (steps per millisecond=18 ) properties (out of 81) seen :42
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 39) 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 39) 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 39) 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 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 39) 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 39) 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 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 39) 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 39) 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 39) 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 39) 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 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 39) 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 39) 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 39) 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 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) seen :0
Running SMT prover for 39 properties.
// Phase 1: matrix 518 rows 585 cols
[2022-05-15 18:30:45] [INFO ] Computed 107 place invariants in 6 ms
[2022-05-15 18:30:46] [INFO ] [Real]Absence check using 64 positive place invariants in 24 ms returned sat
[2022-05-15 18:30:46] [INFO ] [Real]Absence check using 64 positive and 43 generalized place invariants in 11 ms returned sat
[2022-05-15 18:30:46] [INFO ] After 647ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:39
[2022-05-15 18:30:46] [INFO ] [Nat]Absence check using 64 positive place invariants in 33 ms returned sat
[2022-05-15 18:30:46] [INFO ] [Nat]Absence check using 64 positive and 43 generalized place invariants in 10 ms returned sat
[2022-05-15 18:30:48] [INFO ] After 1093ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :33
[2022-05-15 18:30:48] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 13 ms to minimize.
[2022-05-15 18:30:48] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 3 ms to minimize.
[2022-05-15 18:30:48] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 1 ms to minimize.
[2022-05-15 18:30:48] [INFO ] Deduced a trap composed of 20 places in 236 ms of which 2 ms to minimize.
[2022-05-15 18:30:49] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 1 ms to minimize.
[2022-05-15 18:30:49] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 0 ms to minimize.
[2022-05-15 18:30:49] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 1 ms to minimize.
[2022-05-15 18:30:49] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 1 ms to minimize.
[2022-05-15 18:30:49] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 0 ms to minimize.
[2022-05-15 18:30:49] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 0 ms to minimize.
[2022-05-15 18:30:49] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 0 ms to minimize.
[2022-05-15 18:30:49] [INFO ] Deduced a trap composed of 61 places in 52 ms of which 1 ms to minimize.
[2022-05-15 18:30:50] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 0 ms to minimize.
[2022-05-15 18:30:50] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 0 ms to minimize.
[2022-05-15 18:30:50] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1923 ms
[2022-05-15 18:30:50] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 1 ms to minimize.
[2022-05-15 18:30:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2022-05-15 18:30:50] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 1 ms to minimize.
[2022-05-15 18:30:50] [INFO ] Deduced a trap composed of 100 places in 140 ms of which 0 ms to minimize.
[2022-05-15 18:30:50] [INFO ] Deduced a trap composed of 97 places in 143 ms of which 0 ms to minimize.
[2022-05-15 18:30:51] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 1 ms to minimize.
[2022-05-15 18:30:51] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 1 ms to minimize.
[2022-05-15 18:30:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 796 ms
[2022-05-15 18:30:51] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 1 ms to minimize.
[2022-05-15 18:30:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2022-05-15 18:30:51] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 0 ms to minimize.
[2022-05-15 18:30:51] [INFO ] Deduced a trap composed of 44 places in 110 ms of which 1 ms to minimize.
[2022-05-15 18:30:51] [INFO ] Deduced a trap composed of 52 places in 101 ms of which 0 ms to minimize.
[2022-05-15 18:30:52] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 0 ms to minimize.
[2022-05-15 18:30:52] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 0 ms to minimize.
[2022-05-15 18:30:52] [INFO ] Deduced a trap composed of 55 places in 81 ms of which 0 ms to minimize.
[2022-05-15 18:30:52] [INFO ] Deduced a trap composed of 55 places in 86 ms of which 0 ms to minimize.
[2022-05-15 18:30:52] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 1 ms to minimize.
[2022-05-15 18:30:52] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 0 ms to minimize.
[2022-05-15 18:30:52] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1045 ms
[2022-05-15 18:30:52] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2022-05-15 18:30:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2022-05-15 18:30:53] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 0 ms to minimize.
[2022-05-15 18:30:53] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2022-05-15 18:30:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 170 ms
[2022-05-15 18:30:53] [INFO ] Deduced a trap composed of 109 places in 106 ms of which 1 ms to minimize.
[2022-05-15 18:30:53] [INFO ] Deduced a trap composed of 104 places in 103 ms of which 1 ms to minimize.
[2022-05-15 18:30:53] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 1 ms to minimize.
[2022-05-15 18:30:53] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 0 ms to minimize.
[2022-05-15 18:30:53] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 0 ms to minimize.
[2022-05-15 18:30:53] [INFO ] Deduced a trap composed of 50 places in 97 ms of which 0 ms to minimize.
[2022-05-15 18:30:54] [INFO ] Deduced a trap composed of 99 places in 118 ms of which 1 ms to minimize.
[2022-05-15 18:30:54] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 1 ms to minimize.
[2022-05-15 18:30:54] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 0 ms to minimize.
[2022-05-15 18:30:54] [INFO ] Deduced a trap composed of 100 places in 101 ms of which 0 ms to minimize.
[2022-05-15 18:30:54] [INFO ] Deduced a trap composed of 55 places in 113 ms of which 0 ms to minimize.
[2022-05-15 18:30:54] [INFO ] Deduced a trap composed of 117 places in 107 ms of which 3 ms to minimize.
[2022-05-15 18:30:54] [INFO ] Deduced a trap composed of 107 places in 97 ms of which 1 ms to minimize.
[2022-05-15 18:30:54] [INFO ] Deduced a trap composed of 105 places in 101 ms of which 0 ms to minimize.
[2022-05-15 18:30:55] [INFO ] Deduced a trap composed of 109 places in 99 ms of which 0 ms to minimize.
[2022-05-15 18:30:55] [INFO ] Deduced a trap composed of 63 places in 107 ms of which 0 ms to minimize.
[2022-05-15 18:30:55] [INFO ] Deduced a trap composed of 53 places in 109 ms of which 1 ms to minimize.
[2022-05-15 18:30:55] [INFO ] Deduced a trap composed of 50 places in 106 ms of which 0 ms to minimize.
[2022-05-15 18:30:55] [INFO ] Deduced a trap composed of 57 places in 104 ms of which 0 ms to minimize.
[2022-05-15 18:30:55] [INFO ] Deduced a trap composed of 104 places in 121 ms of which 0 ms to minimize.
[2022-05-15 18:30:55] [INFO ] Deduced a trap composed of 103 places in 112 ms of which 1 ms to minimize.
[2022-05-15 18:30:56] [INFO ] Deduced a trap composed of 104 places in 121 ms of which 1 ms to minimize.
[2022-05-15 18:30:56] [INFO ] Deduced a trap composed of 67 places in 114 ms of which 1 ms to minimize.
[2022-05-15 18:30:56] [INFO ] Deduced a trap composed of 49 places in 150 ms of which 2 ms to minimize.
[2022-05-15 18:30:56] [INFO ] Deduced a trap composed of 77 places in 129 ms of which 0 ms to minimize.
[2022-05-15 18:30:56] [INFO ] Deduced a trap composed of 114 places in 114 ms of which 0 ms to minimize.
[2022-05-15 18:30:56] [INFO ] Deduced a trap composed of 56 places in 108 ms of which 0 ms to minimize.
[2022-05-15 18:30:56] [INFO ] Deduced a trap composed of 50 places in 112 ms of which 1 ms to minimize.
[2022-05-15 18:30:57] [INFO ] Deduced a trap composed of 58 places in 114 ms of which 1 ms to minimize.
[2022-05-15 18:30:57] [INFO ] Deduced a trap composed of 120 places in 126 ms of which 1 ms to minimize.
[2022-05-15 18:30:57] [INFO ] Deduced a trap composed of 127 places in 127 ms of which 1 ms to minimize.
[2022-05-15 18:30:57] [INFO ] Deduced a trap composed of 109 places in 124 ms of which 1 ms to minimize.
[2022-05-15 18:30:57] [INFO ] Deduced a trap composed of 55 places in 122 ms of which 1 ms to minimize.
[2022-05-15 18:30:57] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 1 ms to minimize.
[2022-05-15 18:30:57] [INFO ] Deduced a trap composed of 109 places in 111 ms of which 4 ms to minimize.
[2022-05-15 18:30:58] [INFO ] Deduced a trap composed of 114 places in 115 ms of which 1 ms to minimize.
[2022-05-15 18:30:58] [INFO ] Deduced a trap composed of 113 places in 116 ms of which 1 ms to minimize.
[2022-05-15 18:30:58] [INFO ] Deduced a trap composed of 114 places in 115 ms of which 1 ms to minimize.
[2022-05-15 18:30:58] [INFO ] Deduced a trap composed of 103 places in 116 ms of which 1 ms to minimize.
[2022-05-15 18:30:58] [INFO ] Deduced a trap composed of 110 places in 105 ms of which 1 ms to minimize.
[2022-05-15 18:30:58] [INFO ] Deduced a trap composed of 108 places in 104 ms of which 0 ms to minimize.
[2022-05-15 18:30:58] [INFO ] Deduced a trap composed of 108 places in 116 ms of which 0 ms to minimize.
[2022-05-15 18:30:59] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 1 ms to minimize.
[2022-05-15 18:30:59] [INFO ] Deduced a trap composed of 106 places in 106 ms of which 0 ms to minimize.
[2022-05-15 18:30:59] [INFO ] Deduced a trap composed of 104 places in 108 ms of which 0 ms to minimize.
[2022-05-15 18:30:59] [INFO ] Deduced a trap composed of 107 places in 115 ms of which 1 ms to minimize.
[2022-05-15 18:30:59] [INFO ] Deduced a trap composed of 112 places in 129 ms of which 1 ms to minimize.
[2022-05-15 18:30:59] [INFO ] Deduced a trap composed of 105 places in 107 ms of which 0 ms to minimize.
[2022-05-15 18:30:59] [INFO ] Deduced a trap composed of 112 places in 106 ms of which 1 ms to minimize.
[2022-05-15 18:31:00] [INFO ] Deduced a trap composed of 110 places in 112 ms of which 0 ms to minimize.
[2022-05-15 18:31:00] [INFO ] Deduced a trap composed of 106 places in 116 ms of which 0 ms to minimize.
[2022-05-15 18:31:00] [INFO ] Deduced a trap composed of 109 places in 109 ms of which 0 ms to minimize.
[2022-05-15 18:31:00] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 0 ms to minimize.
[2022-05-15 18:31:00] [INFO ] Deduced a trap composed of 102 places in 110 ms of which 0 ms to minimize.
[2022-05-15 18:31:00] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 0 ms to minimize.
[2022-05-15 18:31:00] [INFO ] Deduced a trap composed of 109 places in 110 ms of which 1 ms to minimize.
[2022-05-15 18:31:01] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 0 ms to minimize.
[2022-05-15 18:31:01] [INFO ] Deduced a trap composed of 116 places in 104 ms of which 0 ms to minimize.
[2022-05-15 18:31:01] [INFO ] Deduced a trap composed of 103 places in 103 ms of which 0 ms to minimize.
[2022-05-15 18:31:01] [INFO ] Deduced a trap composed of 110 places in 102 ms of which 1 ms to minimize.
[2022-05-15 18:31:01] [INFO ] Deduced a trap composed of 106 places in 112 ms of which 1 ms to minimize.
[2022-05-15 18:31:01] [INFO ] Deduced a trap composed of 99 places in 119 ms of which 0 ms to minimize.
[2022-05-15 18:31:01] [INFO ] Deduced a trap composed of 105 places in 122 ms of which 0 ms to minimize.
[2022-05-15 18:31:01] [INFO ] Deduced a trap composed of 106 places in 115 ms of which 1 ms to minimize.
[2022-05-15 18:31:02] [INFO ] Deduced a trap composed of 110 places in 113 ms of which 1 ms to minimize.
[2022-05-15 18:31:02] [INFO ] Deduced a trap composed of 102 places in 114 ms of which 1 ms to minimize.
[2022-05-15 18:31:02] [INFO ] Deduced a trap composed of 114 places in 116 ms of which 0 ms to minimize.
[2022-05-15 18:31:02] [INFO ] Deduced a trap composed of 108 places in 103 ms of which 0 ms to minimize.
[2022-05-15 18:31:02] [INFO ] Deduced a trap composed of 119 places in 109 ms of which 1 ms to minimize.
[2022-05-15 18:31:02] [INFO ] Deduced a trap composed of 110 places in 114 ms of which 0 ms to minimize.
[2022-05-15 18:31:02] [INFO ] Deduced a trap composed of 110 places in 115 ms of which 1 ms to minimize.
[2022-05-15 18:31:03] [INFO ] Deduced a trap composed of 114 places in 108 ms of which 1 ms to minimize.
[2022-05-15 18:31:03] [INFO ] Deduced a trap composed of 110 places in 116 ms of which 0 ms to minimize.
[2022-05-15 18:31:03] [INFO ] Deduced a trap composed of 108 places in 106 ms of which 0 ms to minimize.
[2022-05-15 18:31:03] [INFO ] Deduced a trap composed of 116 places in 111 ms of which 1 ms to minimize.
[2022-05-15 18:31:03] [INFO ] Deduced a trap composed of 113 places in 107 ms of which 0 ms to minimize.
[2022-05-15 18:31:03] [INFO ] Deduced a trap composed of 109 places in 117 ms of which 0 ms to minimize.
[2022-05-15 18:31:03] [INFO ] Deduced a trap composed of 117 places in 112 ms of which 1 ms to minimize.
[2022-05-15 18:31:04] [INFO ] Deduced a trap composed of 118 places in 110 ms of which 0 ms to minimize.
[2022-05-15 18:31:04] [INFO ] Deduced a trap composed of 103 places in 127 ms of which 0 ms to minimize.
[2022-05-15 18:31:04] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 1 ms to minimize.
[2022-05-15 18:31:04] [INFO ] Deduced a trap composed of 107 places in 132 ms of which 1 ms to minimize.
[2022-05-15 18:31:04] [INFO ] Deduced a trap composed of 105 places in 109 ms of which 0 ms to minimize.
[2022-05-15 18:31:04] [INFO ] Deduced a trap composed of 107 places in 115 ms of which 1 ms to minimize.
[2022-05-15 18:31:05] [INFO ] Deduced a trap composed of 115 places in 109 ms of which 0 ms to minimize.
[2022-05-15 18:31:05] [INFO ] Deduced a trap composed of 108 places in 118 ms of which 0 ms to minimize.
[2022-05-15 18:31:05] [INFO ] Deduced a trap composed of 112 places in 112 ms of which 1 ms to minimize.
[2022-05-15 18:31:05] [INFO ] Deduced a trap composed of 116 places in 117 ms of which 1 ms to minimize.
[2022-05-15 18:31:05] [INFO ] Deduced a trap composed of 108 places in 109 ms of which 1 ms to minimize.
[2022-05-15 18:31:05] [INFO ] Deduced a trap composed of 124 places in 114 ms of which 1 ms to minimize.
[2022-05-15 18:31:05] [INFO ] Deduced a trap composed of 108 places in 112 ms of which 1 ms to minimize.
[2022-05-15 18:31:06] [INFO ] Deduced a trap composed of 107 places in 121 ms of which 0 ms to minimize.
[2022-05-15 18:31:06] [INFO ] Deduced a trap composed of 109 places in 117 ms of which 1 ms to minimize.
[2022-05-15 18:31:06] [INFO ] Deduced a trap composed of 111 places in 131 ms of which 0 ms to minimize.
[2022-05-15 18:31:06] [INFO ] Deduced a trap composed of 115 places in 122 ms of which 1 ms to minimize.
[2022-05-15 18:31:06] [INFO ] Deduced a trap composed of 117 places in 114 ms of which 0 ms to minimize.
[2022-05-15 18:31:06] [INFO ] Deduced a trap composed of 111 places in 114 ms of which 1 ms to minimize.
[2022-05-15 18:31:06] [INFO ] Deduced a trap composed of 116 places in 107 ms of which 1 ms to minimize.
[2022-05-15 18:31:07] [INFO ] Deduced a trap composed of 107 places in 102 ms of which 0 ms to minimize.
[2022-05-15 18:31:07] [INFO ] Deduced a trap composed of 111 places in 106 ms of which 0 ms to minimize.
[2022-05-15 18:31:07] [INFO ] Deduced a trap composed of 109 places in 104 ms of which 1 ms to minimize.
[2022-05-15 18:31:07] [INFO ] Deduced a trap composed of 107 places in 115 ms of which 1 ms to minimize.
[2022-05-15 18:31:07] [INFO ] Deduced a trap composed of 106 places in 118 ms of which 0 ms to minimize.
[2022-05-15 18:31:07] [INFO ] Deduced a trap composed of 105 places in 115 ms of which 0 ms to minimize.
[2022-05-15 18:31:07] [INFO ] Deduced a trap composed of 104 places in 126 ms of which 0 ms to minimize.
[2022-05-15 18:31:08] [INFO ] Deduced a trap composed of 111 places in 99 ms of which 0 ms to minimize.
[2022-05-15 18:31:08] [INFO ] Deduced a trap composed of 111 places in 104 ms of which 0 ms to minimize.
[2022-05-15 18:31:08] [INFO ] Deduced a trap composed of 110 places in 100 ms of which 1 ms to minimize.
[2022-05-15 18:31:08] [INFO ] Deduced a trap composed of 110 places in 110 ms of which 1 ms to minimize.
[2022-05-15 18:31:08] [INFO ] Deduced a trap composed of 106 places in 101 ms of which 0 ms to minimize.
[2022-05-15 18:31:08] [INFO ] Deduced a trap composed of 107 places in 106 ms of which 0 ms to minimize.
[2022-05-15 18:31:09] [INFO ] Deduced a trap composed of 104 places in 97 ms of which 0 ms to minimize.
[2022-05-15 18:31:09] [INFO ] Deduced a trap composed of 108 places in 99 ms of which 0 ms to minimize.
[2022-05-15 18:31:09] [INFO ] Deduced a trap composed of 108 places in 99 ms of which 0 ms to minimize.
[2022-05-15 18:31:09] [INFO ] Deduced a trap composed of 105 places in 134 ms of which 1 ms to minimize.
[2022-05-15 18:31:09] [INFO ] Deduced a trap composed of 107 places in 117 ms of which 0 ms to minimize.
[2022-05-15 18:31:09] [INFO ] Deduced a trap composed of 119 places in 112 ms of which 0 ms to minimize.
[2022-05-15 18:31:09] [INFO ] Deduced a trap composed of 107 places in 109 ms of which 1 ms to minimize.
[2022-05-15 18:31:10] [INFO ] Deduced a trap composed of 111 places in 106 ms of which 1 ms to minimize.
[2022-05-15 18:31:10] [INFO ] Deduced a trap composed of 104 places in 107 ms of which 0 ms to minimize.
[2022-05-15 18:31:10] [INFO ] Deduced a trap composed of 51 places in 107 ms of which 0 ms to minimize.
[2022-05-15 18:31:10] [INFO ] Deduced a trap composed of 104 places in 101 ms of which 1 ms to minimize.
[2022-05-15 18:31:10] [INFO ] Deduced a trap composed of 111 places in 104 ms of which 0 ms to minimize.
[2022-05-15 18:31:10] [INFO ] Deduced a trap composed of 109 places in 99 ms of which 0 ms to minimize.
[2022-05-15 18:31:10] [INFO ] Deduced a trap composed of 109 places in 108 ms of which 1 ms to minimize.
[2022-05-15 18:31:10] [INFO ] Deduced a trap composed of 107 places in 101 ms of which 1 ms to minimize.
[2022-05-15 18:31:11] [INFO ] Deduced a trap composed of 106 places in 105 ms of which 0 ms to minimize.
[2022-05-15 18:31:11] [INFO ] Deduced a trap composed of 118 places in 102 ms of which 0 ms to minimize.
[2022-05-15 18:31:11] [INFO ] Deduced a trap composed of 108 places in 103 ms of which 1 ms to minimize.
[2022-05-15 18:31:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-15 18:31:11] [INFO ] After 25117ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:39
Fused 39 Parikh solutions to 32 different solutions.
Parikh walk visited 5 properties in 400 ms.
Support contains 48 out of 585 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 585/585 places, 518/518 transitions.
Graph (complete) has 1262 edges and 585 vertex of which 579 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.6 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 579 transition count 448
Reduce places removed 64 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 71 rules applied. Total rules applied 136 place count 515 transition count 441
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 143 place count 508 transition count 441
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 98 Pre rules applied. Total rules applied 143 place count 508 transition count 343
Deduced a syphon composed of 98 places in 1 ms
Ensure Unique test removed 14 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 210 rules applied. Total rules applied 353 place count 396 transition count 343
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 371 place count 378 transition count 325
Iterating global reduction 3 with 18 rules applied. Total rules applied 389 place count 378 transition count 325
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 389 place count 378 transition count 323
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 393 place count 376 transition count 323
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 241 rules applied. Total rules applied 634 place count 255 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 635 place count 255 transition count 202
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
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 639 place count 253 transition count 209
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 646 place count 253 transition count 209
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 647 place count 252 transition count 208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 648 place count 251 transition count 208
Applied a total of 648 rules in 105 ms. Remains 251 /585 variables (removed 334) and now considering 208/518 (removed 310) transitions.
Finished structural reductions, in 1 iterations. Remains : 251/585 places, 208/518 transitions.
Incomplete random walk after 10000 steps, including 490 resets, run finished after 415 ms. (steps per millisecond=24 ) properties (out of 28) seen :9
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2022-05-15 18:31:12] [INFO ] Flow matrix only has 207 transitions (discarded 1 similar events)
// Phase 1: matrix 207 rows 251 cols
[2022-05-15 18:31:12] [INFO ] Computed 91 place invariants in 2 ms
[2022-05-15 18:31:12] [INFO ] [Real]Absence check using 63 positive place invariants in 10 ms returned sat
[2022-05-15 18:31:12] [INFO ] [Real]Absence check using 63 positive and 28 generalized place invariants in 7 ms returned sat
[2022-05-15 18:31:12] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2022-05-15 18:31:12] [INFO ] [Nat]Absence check using 63 positive place invariants in 9 ms returned sat
[2022-05-15 18:31:12] [INFO ] [Nat]Absence check using 63 positive and 28 generalized place invariants in 7 ms returned sat
[2022-05-15 18:31:13] [INFO ] After 216ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2022-05-15 18:31:13] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-15 18:31:13] [INFO ] After 199ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2022-05-15 18:31:13] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 0 ms to minimize.
[2022-05-15 18:31:13] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 1 ms to minimize.
[2022-05-15 18:31:13] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 0 ms to minimize.
[2022-05-15 18:31:13] [INFO ] Deduced a trap composed of 55 places in 51 ms of which 1 ms to minimize.
[2022-05-15 18:31:13] [INFO ] Deduced a trap composed of 61 places in 51 ms of which 0 ms to minimize.
[2022-05-15 18:31:13] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 1 ms to minimize.
[2022-05-15 18:31:13] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 0 ms to minimize.
[2022-05-15 18:31:13] [INFO ] Deduced a trap composed of 61 places in 65 ms of which 0 ms to minimize.
[2022-05-15 18:31:14] [INFO ] Deduced a trap composed of 54 places in 54 ms of which 0 ms to minimize.
[2022-05-15 18:31:14] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 0 ms to minimize.
[2022-05-15 18:31:14] [INFO ] Deduced a trap composed of 57 places in 57 ms of which 0 ms to minimize.
[2022-05-15 18:31:14] [INFO ] Deduced a trap composed of 55 places in 54 ms of which 1 ms to minimize.
[2022-05-15 18:31:14] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 859 ms
[2022-05-15 18:31:14] [INFO ] After 1393ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 193 ms.
[2022-05-15 18:31:14] [INFO ] After 2031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Fused 19 Parikh solutions to 18 different solutions.
Parikh walk visited 6 properties in 207 ms.
Support contains 16 out of 251 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 251/251 places, 208/208 transitions.
Graph (trivial) has 31 edges and 251 vertex of which 2 / 251 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 807 edges and 250 vertex of which 249 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 249 transition count 199
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 243 transition count 199
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 14 place count 243 transition count 187
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 42 place count 227 transition count 187
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 225 transition count 185
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 225 transition count 185
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 82 place count 206 transition count 168
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 206 transition count 166
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 204 transition count 166
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 204 transition count 166
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 88 place count 203 transition count 165
Applied a total of 88 rules in 50 ms. Remains 203 /251 variables (removed 48) and now considering 165/208 (removed 43) transitions.
Finished structural reductions, in 1 iterations. Remains : 203/251 places, 165/208 transitions.
Incomplete random walk after 10000 steps, including 398 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 13) seen :10
Incomplete Best-First random walk after 10000 steps, including 120 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 114 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2022-05-15 18:31:15] [INFO ] Flow matrix only has 164 transitions (discarded 1 similar events)
// Phase 1: matrix 164 rows 203 cols
[2022-05-15 18:31:15] [INFO ] Computed 85 place invariants in 4 ms
[2022-05-15 18:31:15] [INFO ] [Real]Absence check using 64 positive place invariants in 8 ms returned sat
[2022-05-15 18:31:15] [INFO ] [Real]Absence check using 64 positive and 21 generalized place invariants in 4 ms returned sat
[2022-05-15 18:31:15] [INFO ] After 53ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-05-15 18:31:15] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-15 18:31:15] [INFO ] After 10ms SMT Verify possible using 6 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 18:31:15] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 18:31:15] [INFO ] [Nat]Absence check using 64 positive place invariants in 7 ms returned sat
[2022-05-15 18:31:15] [INFO ] [Nat]Absence check using 64 positive and 21 generalized place invariants in 4 ms returned sat
[2022-05-15 18:31:15] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 18:31:15] [INFO ] After 16ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 18:31:15] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 0 ms to minimize.
[2022-05-15 18:31:15] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 0 ms to minimize.
[2022-05-15 18:31:15] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 1 ms to minimize.
[2022-05-15 18:31:15] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 0 ms to minimize.
[2022-05-15 18:31:15] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 0 ms to minimize.
[2022-05-15 18:31:15] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2022-05-15 18:31:15] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 411 ms
[2022-05-15 18:31:15] [INFO ] After 449ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 32 ms.
[2022-05-15 18:31:16] [INFO ] After 602ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 203 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 203/203 places, 165/165 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 203 transition count 162
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 200 transition count 162
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 6 place count 200 transition count 155
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 24 place count 189 transition count 155
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 188 transition count 154
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 188 transition count 154
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 39 place count 181 transition count 148
Applied a total of 39 rules in 19 ms. Remains 181 /203 variables (removed 22) and now considering 148/165 (removed 17) transitions.
Finished structural reductions, in 1 iterations. Remains : 181/203 places, 148/165 transitions.
Incomplete random walk after 10000 steps, including 497 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 158 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 152 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 552106 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :{}
Probabilistic random walk after 552106 steps, saw 164242 distinct states, run finished after 3002 ms. (steps per millisecond=183 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-15 18:31:19] [INFO ] Flow matrix only has 147 transitions (discarded 1 similar events)
// Phase 1: matrix 147 rows 181 cols
[2022-05-15 18:31:19] [INFO ] Computed 80 place invariants in 3 ms
[2022-05-15 18:31:19] [INFO ] [Real]Absence check using 64 positive place invariants in 9 ms returned sat
[2022-05-15 18:31:19] [INFO ] [Real]Absence check using 64 positive and 16 generalized place invariants in 3 ms returned sat
[2022-05-15 18:31:19] [INFO ] After 52ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-05-15 18:31:19] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-15 18:31:19] [INFO ] After 14ms SMT Verify possible using 7 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 18:31:19] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 18:31:19] [INFO ] [Nat]Absence check using 64 positive place invariants in 7 ms returned sat
[2022-05-15 18:31:19] [INFO ] [Nat]Absence check using 64 positive and 16 generalized place invariants in 3 ms returned sat
[2022-05-15 18:31:19] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 18:31:19] [INFO ] After 20ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 18:31:19] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2022-05-15 18:31:19] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2022-05-15 18:31:19] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 0 ms to minimize.
[2022-05-15 18:31:19] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 0 ms to minimize.
[2022-05-15 18:31:19] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 0 ms to minimize.
[2022-05-15 18:31:19] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 0 ms to minimize.
[2022-05-15 18:31:19] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 0 ms to minimize.
[2022-05-15 18:31:19] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 426 ms
[2022-05-15 18:31:19] [INFO ] After 466ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 19 ms.
[2022-05-15 18:31:19] [INFO ] After 590ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 181 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 181/181 places, 148/148 transitions.
Applied a total of 0 rules in 6 ms. Remains 181 /181 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 181/181 places, 148/148 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 181/181 places, 148/148 transitions.
Applied a total of 0 rules in 6 ms. Remains 181 /181 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2022-05-15 18:31:19] [INFO ] Flow matrix only has 147 transitions (discarded 1 similar events)
// Phase 1: matrix 147 rows 181 cols
[2022-05-15 18:31:19] [INFO ] Computed 80 place invariants in 3 ms
[2022-05-15 18:31:20] [INFO ] Implicit Places using invariants in 106 ms returned [39, 40, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 108 ms to find 15 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 166/181 places, 148/148 transitions.
Applied a total of 0 rules in 8 ms. Remains 166 /166 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 166/181 places, 148/148 transitions.
Finished random walk after 5930 steps, including 266 resets, run visited all 2 properties in 47 ms. (steps per millisecond=126 )
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
[2022-05-15 18:31:20] [INFO ] Flatten gal took : 28 ms
[2022-05-15 18:31:20] [INFO ] Flatten gal took : 27 ms
[2022-05-15 18:31:20] [INFO ] Input system was already deterministic with 518 transitions.
Support contains 110 out of 585 places (down from 114) after GAL structural reductions.
Computed a total of 513 stabilizing places and 456 stable transitions
Graph (complete) has 1262 edges and 585 vertex of which 578 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.17 ms
Starting structural reductions in LTL mode, iteration 0 : 585/585 places, 518/518 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 554 transition count 487
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 554 transition count 487
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 74 place count 542 transition count 475
Iterating global reduction 0 with 12 rules applied. Total rules applied 86 place count 542 transition count 475
Applied a total of 86 rules in 29 ms. Remains 542 /585 variables (removed 43) and now considering 475/518 (removed 43) transitions.
// Phase 1: matrix 475 rows 542 cols
[2022-05-15 18:31:20] [INFO ] Computed 107 place invariants in 5 ms
[2022-05-15 18:31:20] [INFO ] Implicit Places using invariants in 175 ms returned []
// Phase 1: matrix 475 rows 542 cols
[2022-05-15 18:31:20] [INFO ] Computed 107 place invariants in 3 ms
[2022-05-15 18:31:21] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 689 ms to find 0 implicit places.
// Phase 1: matrix 475 rows 542 cols
[2022-05-15 18:31:21] [INFO ] Computed 107 place invariants in 6 ms
[2022-05-15 18:31:21] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 542/585 places, 475/518 transitions.
Finished structural reductions, in 1 iterations. Remains : 542/585 places, 475/518 transitions.
[2022-05-15 18:31:21] [INFO ] Flatten gal took : 22 ms
[2022-05-15 18:31:21] [INFO ] Flatten gal took : 23 ms
[2022-05-15 18:31:21] [INFO ] Input system was already deterministic with 475 transitions.
[2022-05-15 18:31:21] [INFO ] Flatten gal took : 22 ms
[2022-05-15 18:31:21] [INFO ] Flatten gal took : 20 ms
[2022-05-15 18:31:21] [INFO ] Time to serialize gal into /tmp/CTLFireability282463219252350619.gal : 8 ms
[2022-05-15 18:31:21] [INFO ] Time to serialize properties into /tmp/CTLFireability9908215378344362793.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/CTLFireability282463219252350619.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9908215378344362793.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-15 18:31:51] [INFO ] Flatten gal took : 26 ms
[2022-05-15 18:31:51] [INFO ] Applying decomposition
[2022-05-15 18:31:51] [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/graph4084012086810456690.txt' '-o' '/tmp/graph4084012086810456690.bin' '-w' '/tmp/graph4084012086810456690.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4084012086810456690.bin' '-l' '-1' '-v' '-w' '/tmp/graph4084012086810456690.weights' '-q' '0' '-e' '0.001'
[2022-05-15 18:31:51] [INFO ] Decomposing Gal with order
[2022-05-15 18:31:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 18:31:51] [INFO ] Removed a total of 278 redundant transitions.
[2022-05-15 18:31:51] [INFO ] Flatten gal took : 77 ms
[2022-05-15 18:31:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 36 ms.
[2022-05-15 18:31:51] [INFO ] Time to serialize gal into /tmp/CTLFireability1324969231991573953.gal : 22 ms
[2022-05-15 18:31:51] [INFO ] Time to serialize properties into /tmp/CTLFireability17404550926084760267.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/CTLFireability1324969231991573953.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17404550926084760267.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 : 585/585 places, 518/518 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 555 transition count 488
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 555 transition count 488
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 73 place count 542 transition count 475
Iterating global reduction 0 with 13 rules applied. Total rules applied 86 place count 542 transition count 475
Applied a total of 86 rules in 29 ms. Remains 542 /585 variables (removed 43) and now considering 475/518 (removed 43) transitions.
// Phase 1: matrix 475 rows 542 cols
[2022-05-15 18:32:21] [INFO ] Computed 107 place invariants in 10 ms
[2022-05-15 18:32:22] [INFO ] Implicit Places using invariants in 219 ms returned []
// Phase 1: matrix 475 rows 542 cols
[2022-05-15 18:32:22] [INFO ] Computed 107 place invariants in 3 ms
[2022-05-15 18:32:22] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 685 ms to find 0 implicit places.
// Phase 1: matrix 475 rows 542 cols
[2022-05-15 18:32:22] [INFO ] Computed 107 place invariants in 10 ms
[2022-05-15 18:32:22] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 542/585 places, 475/518 transitions.
Finished structural reductions, in 1 iterations. Remains : 542/585 places, 475/518 transitions.
[2022-05-15 18:32:22] [INFO ] Flatten gal took : 19 ms
[2022-05-15 18:32:22] [INFO ] Flatten gal took : 23 ms
[2022-05-15 18:32:22] [INFO ] Input system was already deterministic with 475 transitions.
[2022-05-15 18:32:23] [INFO ] Flatten gal took : 27 ms
[2022-05-15 18:32:23] [INFO ] Flatten gal took : 15 ms
[2022-05-15 18:32:23] [INFO ] Time to serialize gal into /tmp/CTLFireability3116913547883313266.gal : 3 ms
[2022-05-15 18:32:23] [INFO ] Time to serialize properties into /tmp/CTLFireability1410620159329298294.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/CTLFireability3116913547883313266.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1410620159329298294.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-15 18:32:53] [INFO ] Flatten gal took : 14 ms
[2022-05-15 18:32:53] [INFO ] Applying decomposition
[2022-05-15 18:32:53] [INFO ] Flatten gal took : 14 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/graph2343879861001233172.txt' '-o' '/tmp/graph2343879861001233172.bin' '-w' '/tmp/graph2343879861001233172.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2343879861001233172.bin' '-l' '-1' '-v' '-w' '/tmp/graph2343879861001233172.weights' '-q' '0' '-e' '0.001'
[2022-05-15 18:32:53] [INFO ] Decomposing Gal with order
[2022-05-15 18:32:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 18:32:53] [INFO ] Removed a total of 279 redundant transitions.
[2022-05-15 18:32:53] [INFO ] Flatten gal took : 42 ms
[2022-05-15 18:32:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 11 ms.
[2022-05-15 18:32:53] [INFO ] Time to serialize gal into /tmp/CTLFireability4273938125119363061.gal : 10 ms
[2022-05-15 18:32:53] [INFO ] Time to serialize properties into /tmp/CTLFireability17659382618801908694.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/CTLFireability4273938125119363061.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17659382618801908694.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,3.51337e+34,5.83116,151416,6374,86,248030,968,1234,649713,63,2708,0

Converting to forward existential form...Done !
original formula: (EF(AX((i17.u151.p653==1))) * ((A((((EF((i3.i0.u19.p49==1)) + AG((i7.i2.u102.p332==1))) + (AF((i11.u100.p328==1)) + AG((i16.i0.u162.p663=...541
=> equivalent forward existential formula: ([(Init * !(E(TRUE U !(EX(!((i17.u151.p653==1)))))))] = FALSE * [(FwdU((Init * !((!((E(!(((i8.i1.u123.p409==1) +...860
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t205, t299, t360, t374, t376, t379, t381, t383, t385, t388, t393, t395, t401,...1516
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 585/585 places, 518/518 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 551 transition count 484
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 551 transition count 484
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 81 place count 538 transition count 471
Iterating global reduction 0 with 13 rules applied. Total rules applied 94 place count 538 transition count 471
Applied a total of 94 rules in 29 ms. Remains 538 /585 variables (removed 47) and now considering 471/518 (removed 47) transitions.
// Phase 1: matrix 471 rows 538 cols
[2022-05-15 18:33:23] [INFO ] Computed 107 place invariants in 3 ms
[2022-05-15 18:33:23] [INFO ] Implicit Places using invariants in 167 ms returned []
// Phase 1: matrix 471 rows 538 cols
[2022-05-15 18:33:23] [INFO ] Computed 107 place invariants in 3 ms
[2022-05-15 18:33:24] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 683 ms to find 0 implicit places.
// Phase 1: matrix 471 rows 538 cols
[2022-05-15 18:33:24] [INFO ] Computed 107 place invariants in 8 ms
[2022-05-15 18:33:24] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 538/585 places, 471/518 transitions.
Finished structural reductions, in 1 iterations. Remains : 538/585 places, 471/518 transitions.
[2022-05-15 18:33:24] [INFO ] Flatten gal took : 13 ms
[2022-05-15 18:33:24] [INFO ] Flatten gal took : 14 ms
[2022-05-15 18:33:24] [INFO ] Input system was already deterministic with 471 transitions.
[2022-05-15 18:33:24] [INFO ] Flatten gal took : 13 ms
[2022-05-15 18:33:24] [INFO ] Flatten gal took : 13 ms
[2022-05-15 18:33:24] [INFO ] Time to serialize gal into /tmp/CTLFireability3018213617254685097.gal : 2 ms
[2022-05-15 18:33:24] [INFO ] Time to serialize properties into /tmp/CTLFireability12503730297329811549.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/CTLFireability3018213617254685097.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12503730297329811549.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-15 18:33:54] [INFO ] Flatten gal took : 15 ms
[2022-05-15 18:33:54] [INFO ] Applying decomposition
[2022-05-15 18:33:54] [INFO ] Flatten gal took : 14 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/graph4466836302338378049.txt' '-o' '/tmp/graph4466836302338378049.bin' '-w' '/tmp/graph4466836302338378049.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4466836302338378049.bin' '-l' '-1' '-v' '-w' '/tmp/graph4466836302338378049.weights' '-q' '0' '-e' '0.001'
[2022-05-15 18:33:54] [INFO ] Decomposing Gal with order
[2022-05-15 18:33:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 18:33:54] [INFO ] Removed a total of 286 redundant transitions.
[2022-05-15 18:33:54] [INFO ] Flatten gal took : 49 ms
[2022-05-15 18:33:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 7 ms.
[2022-05-15 18:33:54] [INFO ] Time to serialize gal into /tmp/CTLFireability6287298817264098312.gal : 4 ms
[2022-05-15 18:33:54] [INFO ] Time to serialize properties into /tmp/CTLFireability10888112965726367828.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/CTLFireability6287298817264098312.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10888112965726367828.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 : 585/585 places, 518/518 transitions.
Graph (complete) has 1262 edges and 585 vertex of which 578 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.9 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 577 transition count 431
Reduce places removed 79 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 82 rules applied. Total rules applied 162 place count 498 transition count 428
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 165 place count 495 transition count 428
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 122 Pre rules applied. Total rules applied 165 place count 495 transition count 306
Deduced a syphon composed of 122 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 3 with 266 rules applied. Total rules applied 431 place count 351 transition count 306
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 460 place count 322 transition count 277
Ensure Unique test removed 1 places
Iterating global reduction 3 with 30 rules applied. Total rules applied 490 place count 321 transition count 277
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 490 place count 321 transition count 275
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 494 place count 319 transition count 275
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 3 with 247 rules applied. Total rules applied 741 place count 194 transition count 153
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 747 place count 194 transition count 153
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 748 place count 193 transition count 152
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 749 place count 192 transition count 152
Applied a total of 749 rules in 64 ms. Remains 192 /585 variables (removed 393) and now considering 152/518 (removed 366) transitions.
// Phase 1: matrix 152 rows 192 cols
[2022-05-15 18:34:24] [INFO ] Computed 80 place invariants in 1 ms
[2022-05-15 18:34:24] [INFO ] Implicit Places using invariants in 123 ms returned [56, 57, 58, 59, 60]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 123 ms to find 5 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 187/585 places, 152/518 transitions.
Applied a total of 0 rules in 5 ms. Remains 187 /187 variables (removed 0) and now considering 152/152 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 187/585 places, 152/518 transitions.
[2022-05-15 18:34:24] [INFO ] Flatten gal took : 7 ms
[2022-05-15 18:34:24] [INFO ] Flatten gal took : 7 ms
[2022-05-15 18:34:25] [INFO ] Input system was already deterministic with 152 transitions.
Finished random walk after 356 steps, including 17 resets, run visited all 1 properties in 2 ms. (steps per millisecond=178 )
FORMULA BusinessProcesses-PT-20-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 585/585 places, 518/518 transitions.
Graph (trivial) has 290 edges and 585 vertex of which 6 / 585 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1256 edges and 580 vertex of which 573 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 89 place count 572 transition count 417
Reduce places removed 87 places and 0 transitions.
Iterating post reduction 1 with 87 rules applied. Total rules applied 176 place count 485 transition count 417
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 176 place count 485 transition count 305
Deduced a syphon composed of 112 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 245 rules applied. Total rules applied 421 place count 352 transition count 305
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 449 place count 324 transition count 277
Ensure Unique test removed 1 places
Iterating global reduction 2 with 29 rules applied. Total rules applied 478 place count 323 transition count 277
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 478 place count 323 transition count 276
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 480 place count 322 transition count 276
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 261 rules applied. Total rules applied 741 place count 190 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 743 place count 189 transition count 146
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 744 place count 188 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 745 place count 187 transition count 145
Applied a total of 745 rules in 63 ms. Remains 187 /585 variables (removed 398) and now considering 145/518 (removed 373) transitions.
// Phase 1: matrix 145 rows 187 cols
[2022-05-15 18:34:25] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-15 18:34:25] [INFO ] Implicit Places using invariants in 158 ms returned [28, 29, 30, 31, 32, 37, 38, 42, 43, 44, 45, 46, 47, 48, 52, 53, 54, 55, 56, 57, 58, 59, 60, 154]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 159 ms to find 24 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 163/585 places, 145/518 transitions.
Applied a total of 0 rules in 4 ms. Remains 163 /163 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 163/585 places, 145/518 transitions.
[2022-05-15 18:34:25] [INFO ] Flatten gal took : 6 ms
[2022-05-15 18:34:25] [INFO ] Flatten gal took : 6 ms
[2022-05-15 18:34:25] [INFO ] Input system was already deterministic with 145 transitions.
[2022-05-15 18:34:25] [INFO ] Flatten gal took : 6 ms
[2022-05-15 18:34:25] [INFO ] Flatten gal took : 7 ms
[2022-05-15 18:34:25] [INFO ] Time to serialize gal into /tmp/CTLFireability3162786185712840694.gal : 1 ms
[2022-05-15 18:34:25] [INFO ] Time to serialize properties into /tmp/CTLFireability2526614750201477275.ctl : 91 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/CTLFireability3162786185712840694.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2526614750201477275.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.
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.14174e+11,0.510029,25484,2,4094,5,78978,6,0,796,103996,0

Converting to forward existential form...Done !
original formula: EF(((E((p250!=1) U (p535==1)) * (p64==1)) * ((p582==1)&&(p438==1))))
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * ((p582==1)&&(p438==1))) * (p64==1)),(p250!=1)) * (p535==1))] != FALSE
Hit Full ! (commute/partial/dont) 143/0/2
(forward)formula 0,1,0.549758,25808,1,0,13,78978,17,3,1513,103996,6
FORMULA BusinessProcesses-PT-20-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 585/585 places, 518/518 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 553 transition count 486
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 553 transition count 486
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 76 place count 541 transition count 474
Iterating global reduction 0 with 12 rules applied. Total rules applied 88 place count 541 transition count 474
Applied a total of 88 rules in 28 ms. Remains 541 /585 variables (removed 44) and now considering 474/518 (removed 44) transitions.
// Phase 1: matrix 474 rows 541 cols
[2022-05-15 18:34:25] [INFO ] Computed 107 place invariants in 9 ms
[2022-05-15 18:34:26] [INFO ] Implicit Places using invariants in 166 ms returned []
// Phase 1: matrix 474 rows 541 cols
[2022-05-15 18:34:26] [INFO ] Computed 107 place invariants in 6 ms
[2022-05-15 18:34:26] [INFO ] Implicit Places using invariants and state equation in 525 ms returned []
Implicit Place search using SMT with State Equation took 691 ms to find 0 implicit places.
// Phase 1: matrix 474 rows 541 cols
[2022-05-15 18:34:26] [INFO ] Computed 107 place invariants in 9 ms
[2022-05-15 18:34:26] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 541/585 places, 474/518 transitions.
Finished structural reductions, in 1 iterations. Remains : 541/585 places, 474/518 transitions.
[2022-05-15 18:34:26] [INFO ] Flatten gal took : 13 ms
[2022-05-15 18:34:26] [INFO ] Flatten gal took : 13 ms
[2022-05-15 18:34:26] [INFO ] Input system was already deterministic with 474 transitions.
[2022-05-15 18:34:26] [INFO ] Flatten gal took : 17 ms
[2022-05-15 18:34:26] [INFO ] Flatten gal took : 13 ms
[2022-05-15 18:34:26] [INFO ] Time to serialize gal into /tmp/CTLFireability6774540691540819630.gal : 2 ms
[2022-05-15 18:34:26] [INFO ] Time to serialize properties into /tmp/CTLFireability7135111899282253552.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/CTLFireability6774540691540819630.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7135111899282253552.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-15 18:34:57] [INFO ] Flatten gal took : 13 ms
[2022-05-15 18:34:57] [INFO ] Applying decomposition
[2022-05-15 18:34:57] [INFO ] Flatten gal took : 13 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/graph16266324534210318194.txt' '-o' '/tmp/graph16266324534210318194.bin' '-w' '/tmp/graph16266324534210318194.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16266324534210318194.bin' '-l' '-1' '-v' '-w' '/tmp/graph16266324534210318194.weights' '-q' '0' '-e' '0.001'
[2022-05-15 18:34:57] [INFO ] Decomposing Gal with order
[2022-05-15 18:34:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 18:34:57] [INFO ] Removed a total of 280 redundant transitions.
[2022-05-15 18:34:57] [INFO ] Flatten gal took : 31 ms
[2022-05-15 18:34:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 11 ms.
[2022-05-15 18:34:57] [INFO ] Time to serialize gal into /tmp/CTLFireability16623831513361867966.gal : 25 ms
[2022-05-15 18:34:57] [INFO ] Time to serialize properties into /tmp/CTLFireability1189825775491176805.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/CTLFireability16623831513361867966.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1189825775491176805.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 : 585/585 places, 518/518 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 552 transition count 485
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 552 transition count 485
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 79 place count 539 transition count 472
Iterating global reduction 0 with 13 rules applied. Total rules applied 92 place count 539 transition count 472
Applied a total of 92 rules in 45 ms. Remains 539 /585 variables (removed 46) and now considering 472/518 (removed 46) transitions.
// Phase 1: matrix 472 rows 539 cols
[2022-05-15 18:35:27] [INFO ] Computed 107 place invariants in 9 ms
[2022-05-15 18:35:27] [INFO ] Implicit Places using invariants in 173 ms returned []
// Phase 1: matrix 472 rows 539 cols
[2022-05-15 18:35:27] [INFO ] Computed 107 place invariants in 7 ms
[2022-05-15 18:35:27] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 677 ms to find 0 implicit places.
// Phase 1: matrix 472 rows 539 cols
[2022-05-15 18:35:27] [INFO ] Computed 107 place invariants in 6 ms
[2022-05-15 18:35:28] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 539/585 places, 472/518 transitions.
Finished structural reductions, in 1 iterations. Remains : 539/585 places, 472/518 transitions.
[2022-05-15 18:35:28] [INFO ] Flatten gal took : 13 ms
[2022-05-15 18:35:28] [INFO ] Flatten gal took : 12 ms
[2022-05-15 18:35:28] [INFO ] Input system was already deterministic with 472 transitions.
[2022-05-15 18:35:28] [INFO ] Flatten gal took : 12 ms
[2022-05-15 18:35:28] [INFO ] Flatten gal took : 13 ms
[2022-05-15 18:35:28] [INFO ] Time to serialize gal into /tmp/CTLFireability3843131793708800041.gal : 2 ms
[2022-05-15 18:35:28] [INFO ] Time to serialize properties into /tmp/CTLFireability11738950160662343393.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/CTLFireability3843131793708800041.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11738950160662343393.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-15 18:35:58] [INFO ] Flatten gal took : 12 ms
[2022-05-15 18:35:58] [INFO ] Applying decomposition
[2022-05-15 18:35:58] [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/graph16437348662167086194.txt' '-o' '/tmp/graph16437348662167086194.bin' '-w' '/tmp/graph16437348662167086194.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16437348662167086194.bin' '-l' '-1' '-v' '-w' '/tmp/graph16437348662167086194.weights' '-q' '0' '-e' '0.001'
[2022-05-15 18:35:58] [INFO ] Decomposing Gal with order
[2022-05-15 18:35:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 18:35:58] [INFO ] Removed a total of 276 redundant transitions.
[2022-05-15 18:35:58] [INFO ] Flatten gal took : 24 ms
[2022-05-15 18:35:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 8 ms.
[2022-05-15 18:35:58] [INFO ] Time to serialize gal into /tmp/CTLFireability16650351202887371884.gal : 13 ms
[2022-05-15 18:35:58] [INFO ] Time to serialize properties into /tmp/CTLFireability16080557496752851732.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/CTLFireability16650351202887371884.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16080557496752851732.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 : 585/585 places, 518/518 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 553 transition count 486
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 553 transition count 486
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 76 place count 541 transition count 474
Iterating global reduction 0 with 12 rules applied. Total rules applied 88 place count 541 transition count 474
Applied a total of 88 rules in 28 ms. Remains 541 /585 variables (removed 44) and now considering 474/518 (removed 44) transitions.
// Phase 1: matrix 474 rows 541 cols
[2022-05-15 18:36:28] [INFO ] Computed 107 place invariants in 3 ms
[2022-05-15 18:36:28] [INFO ] Implicit Places using invariants in 167 ms returned []
// Phase 1: matrix 474 rows 541 cols
[2022-05-15 18:36:28] [INFO ] Computed 107 place invariants in 3 ms
[2022-05-15 18:36:29] [INFO ] Implicit Places using invariants and state equation in 543 ms returned []
Implicit Place search using SMT with State Equation took 712 ms to find 0 implicit places.
// Phase 1: matrix 474 rows 541 cols
[2022-05-15 18:36:29] [INFO ] Computed 107 place invariants in 3 ms
[2022-05-15 18:36:29] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 541/585 places, 474/518 transitions.
Finished structural reductions, in 1 iterations. Remains : 541/585 places, 474/518 transitions.
[2022-05-15 18:36:29] [INFO ] Flatten gal took : 12 ms
[2022-05-15 18:36:29] [INFO ] Flatten gal took : 12 ms
[2022-05-15 18:36:29] [INFO ] Input system was already deterministic with 474 transitions.
[2022-05-15 18:36:29] [INFO ] Flatten gal took : 15 ms
[2022-05-15 18:36:29] [INFO ] Flatten gal took : 21 ms
[2022-05-15 18:36:29] [INFO ] Time to serialize gal into /tmp/CTLFireability7199882476599866925.gal : 2 ms
[2022-05-15 18:36:29] [INFO ] Time to serialize properties into /tmp/CTLFireability7083908843975587431.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/CTLFireability7199882476599866925.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7083908843975587431.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-15 18:36:59] [INFO ] Flatten gal took : 16 ms
[2022-05-15 18:36:59] [INFO ] Applying decomposition
[2022-05-15 18:36:59] [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/graph15050923497689291329.txt' '-o' '/tmp/graph15050923497689291329.bin' '-w' '/tmp/graph15050923497689291329.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15050923497689291329.bin' '-l' '-1' '-v' '-w' '/tmp/graph15050923497689291329.weights' '-q' '0' '-e' '0.001'
[2022-05-15 18:36:59] [INFO ] Decomposing Gal with order
[2022-05-15 18:36:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 18:36:59] [INFO ] Removed a total of 284 redundant transitions.
[2022-05-15 18:36:59] [INFO ] Flatten gal took : 23 ms
[2022-05-15 18:36:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 8 ms.
[2022-05-15 18:36:59] [INFO ] Time to serialize gal into /tmp/CTLFireability10567504635507291231.gal : 4 ms
[2022-05-15 18:36:59] [INFO ] Time to serialize properties into /tmp/CTLFireability7293962447733209297.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/CTLFireability10567504635507291231.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7293962447733209297.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 : 585/585 places, 518/518 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 554 transition count 487
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 554 transition count 487
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 74 place count 542 transition count 475
Iterating global reduction 0 with 12 rules applied. Total rules applied 86 place count 542 transition count 475
Applied a total of 86 rules in 32 ms. Remains 542 /585 variables (removed 43) and now considering 475/518 (removed 43) transitions.
// Phase 1: matrix 475 rows 542 cols
[2022-05-15 18:37:29] [INFO ] Computed 107 place invariants in 7 ms
[2022-05-15 18:37:30] [INFO ] Implicit Places using invariants in 179 ms returned []
// Phase 1: matrix 475 rows 542 cols
[2022-05-15 18:37:30] [INFO ] Computed 107 place invariants in 3 ms
[2022-05-15 18:37:30] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 691 ms to find 0 implicit places.
// Phase 1: matrix 475 rows 542 cols
[2022-05-15 18:37:30] [INFO ] Computed 107 place invariants in 2 ms
[2022-05-15 18:37:30] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 542/585 places, 475/518 transitions.
Finished structural reductions, in 1 iterations. Remains : 542/585 places, 475/518 transitions.
[2022-05-15 18:37:30] [INFO ] Flatten gal took : 11 ms
[2022-05-15 18:37:30] [INFO ] Flatten gal took : 13 ms
[2022-05-15 18:37:30] [INFO ] Input system was already deterministic with 475 transitions.
[2022-05-15 18:37:30] [INFO ] Flatten gal took : 11 ms
[2022-05-15 18:37:30] [INFO ] Flatten gal took : 12 ms
[2022-05-15 18:37:30] [INFO ] Time to serialize gal into /tmp/CTLFireability4695582136501470079.gal : 2 ms
[2022-05-15 18:37:30] [INFO ] Time to serialize properties into /tmp/CTLFireability16331475256071028956.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/CTLFireability4695582136501470079.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16331475256071028956.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-15 18:38:00] [INFO ] Flatten gal took : 17 ms
[2022-05-15 18:38:00] [INFO ] Applying decomposition
[2022-05-15 18:38:00] [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/graph10393515555621064877.txt' '-o' '/tmp/graph10393515555621064877.bin' '-w' '/tmp/graph10393515555621064877.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10393515555621064877.bin' '-l' '-1' '-v' '-w' '/tmp/graph10393515555621064877.weights' '-q' '0' '-e' '0.001'
[2022-05-15 18:38:00] [INFO ] Decomposing Gal with order
[2022-05-15 18:38:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 18:38:01] [INFO ] Removed a total of 279 redundant transitions.
[2022-05-15 18:38:01] [INFO ] Flatten gal took : 24 ms
[2022-05-15 18:38:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 3 ms.
[2022-05-15 18:38:01] [INFO ] Time to serialize gal into /tmp/CTLFireability5798670256744523264.gal : 3 ms
[2022-05-15 18:38:01] [INFO ] Time to serialize properties into /tmp/CTLFireability13282501854789510350.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/CTLFireability5798670256744523264.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13282501854789510350.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 : 585/585 places, 518/518 transitions.
Graph (trivial) has 296 edges and 585 vertex of which 6 / 585 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1256 edges and 580 vertex of which 573 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 91 place count 572 transition count 415
Reduce places removed 89 places and 0 transitions.
Iterating post reduction 1 with 89 rules applied. Total rules applied 180 place count 483 transition count 415
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 180 place count 483 transition count 302
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 248 rules applied. Total rules applied 428 place count 348 transition count 302
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 458 place count 318 transition count 272
Ensure Unique test removed 1 places
Iterating global reduction 2 with 31 rules applied. Total rules applied 489 place count 317 transition count 272
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 489 place count 317 transition count 270
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 493 place count 315 transition count 270
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 257 rules applied. Total rules applied 750 place count 185 transition count 143
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 752 place count 184 transition count 142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 753 place count 183 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 754 place count 182 transition count 141
Applied a total of 754 rules in 36 ms. Remains 182 /585 variables (removed 403) and now considering 141/518 (removed 377) transitions.
// Phase 1: matrix 141 rows 182 cols
[2022-05-15 18:38:31] [INFO ] Computed 80 place invariants in 1 ms
[2022-05-15 18:38:31] [INFO ] Implicit Places using invariants in 103 ms returned [28, 29, 30, 31, 32, 38, 39, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 103 ms to find 23 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 159/585 places, 141/518 transitions.
Applied a total of 0 rules in 4 ms. Remains 159 /159 variables (removed 0) and now considering 141/141 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 159/585 places, 141/518 transitions.
[2022-05-15 18:38:31] [INFO ] Flatten gal took : 5 ms
[2022-05-15 18:38:31] [INFO ] Flatten gal took : 5 ms
[2022-05-15 18:38:31] [INFO ] Input system was already deterministic with 141 transitions.
Incomplete random walk after 10000 steps, including 1270 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 288 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1033 steps, run visited all 1 properties in 7 ms. (steps per millisecond=147 )
Probabilistic random walk after 1033 steps, saw 476 distinct states, run finished after 22 ms. (steps per millisecond=46 ) properties seen :1
FORMULA BusinessProcesses-PT-20-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 585/585 places, 518/518 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 552 transition count 485
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 552 transition count 485
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 78 place count 540 transition count 473
Iterating global reduction 0 with 12 rules applied. Total rules applied 90 place count 540 transition count 473
Applied a total of 90 rules in 41 ms. Remains 540 /585 variables (removed 45) and now considering 473/518 (removed 45) transitions.
// Phase 1: matrix 473 rows 540 cols
[2022-05-15 18:38:31] [INFO ] Computed 107 place invariants in 3 ms
[2022-05-15 18:38:31] [INFO ] Implicit Places using invariants in 192 ms returned []
// Phase 1: matrix 473 rows 540 cols
[2022-05-15 18:38:31] [INFO ] Computed 107 place invariants in 3 ms
[2022-05-15 18:38:32] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 715 ms to find 0 implicit places.
// Phase 1: matrix 473 rows 540 cols
[2022-05-15 18:38:32] [INFO ] Computed 107 place invariants in 3 ms
[2022-05-15 18:38:32] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 540/585 places, 473/518 transitions.
Finished structural reductions, in 1 iterations. Remains : 540/585 places, 473/518 transitions.
[2022-05-15 18:38:32] [INFO ] Flatten gal took : 11 ms
[2022-05-15 18:38:32] [INFO ] Flatten gal took : 12 ms
[2022-05-15 18:38:32] [INFO ] Input system was already deterministic with 473 transitions.
[2022-05-15 18:38:32] [INFO ] Flatten gal took : 12 ms
[2022-05-15 18:38:32] [INFO ] Flatten gal took : 12 ms
[2022-05-15 18:38:32] [INFO ] Time to serialize gal into /tmp/CTLFireability8069772471403299311.gal : 2 ms
[2022-05-15 18:38:32] [INFO ] Time to serialize properties into /tmp/CTLFireability4811910471791795917.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/CTLFireability8069772471403299311.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4811910471791795917.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-15 18:39:02] [INFO ] Flatten gal took : 12 ms
[2022-05-15 18:39:02] [INFO ] Applying decomposition
[2022-05-15 18:39:02] [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/graph14028583743827115886.txt' '-o' '/tmp/graph14028583743827115886.bin' '-w' '/tmp/graph14028583743827115886.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14028583743827115886.bin' '-l' '-1' '-v' '-w' '/tmp/graph14028583743827115886.weights' '-q' '0' '-e' '0.001'
[2022-05-15 18:39:02] [INFO ] Decomposing Gal with order
[2022-05-15 18:39:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 18:39:02] [INFO ] Removed a total of 279 redundant transitions.
[2022-05-15 18:39:02] [INFO ] Flatten gal took : 21 ms
[2022-05-15 18:39:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 5 ms.
[2022-05-15 18:39:02] [INFO ] Time to serialize gal into /tmp/CTLFireability6314626191790556706.gal : 4 ms
[2022-05-15 18:39:02] [INFO ] Time to serialize properties into /tmp/CTLFireability15834100437509697802.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/CTLFireability6314626191790556706.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15834100437509697802.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 : 585/585 places, 518/518 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 554 transition count 487
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 554 transition count 487
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 73 place count 543 transition count 476
Iterating global reduction 0 with 11 rules applied. Total rules applied 84 place count 543 transition count 476
Applied a total of 84 rules in 38 ms. Remains 543 /585 variables (removed 42) and now considering 476/518 (removed 42) transitions.
// Phase 1: matrix 476 rows 543 cols
[2022-05-15 18:39:32] [INFO ] Computed 107 place invariants in 6 ms
[2022-05-15 18:39:32] [INFO ] Implicit Places using invariants in 182 ms returned []
// Phase 1: matrix 476 rows 543 cols
[2022-05-15 18:39:32] [INFO ] Computed 107 place invariants in 3 ms
[2022-05-15 18:39:33] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 697 ms to find 0 implicit places.
// Phase 1: matrix 476 rows 543 cols
[2022-05-15 18:39:33] [INFO ] Computed 107 place invariants in 2 ms
[2022-05-15 18:39:33] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 543/585 places, 476/518 transitions.
Finished structural reductions, in 1 iterations. Remains : 543/585 places, 476/518 transitions.
[2022-05-15 18:39:33] [INFO ] Flatten gal took : 12 ms
[2022-05-15 18:39:33] [INFO ] Flatten gal took : 19 ms
[2022-05-15 18:39:33] [INFO ] Input system was already deterministic with 476 transitions.
[2022-05-15 18:39:33] [INFO ] Flatten gal took : 12 ms
[2022-05-15 18:39:33] [INFO ] Flatten gal took : 13 ms
[2022-05-15 18:39:33] [INFO ] Time to serialize gal into /tmp/CTLFireability10255944962543605389.gal : 2 ms
[2022-05-15 18:39:33] [INFO ] Time to serialize properties into /tmp/CTLFireability11272905824514974481.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/CTLFireability10255944962543605389.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11272905824514974481.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-15 18:40:03] [INFO ] Flatten gal took : 17 ms
[2022-05-15 18:40:03] [INFO ] Applying decomposition
[2022-05-15 18:40:03] [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/graph14072826082831045921.txt' '-o' '/tmp/graph14072826082831045921.bin' '-w' '/tmp/graph14072826082831045921.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14072826082831045921.bin' '-l' '-1' '-v' '-w' '/tmp/graph14072826082831045921.weights' '-q' '0' '-e' '0.001'
[2022-05-15 18:40:03] [INFO ] Decomposing Gal with order
[2022-05-15 18:40:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 18:40:03] [INFO ] Removed a total of 278 redundant transitions.
[2022-05-15 18:40:03] [INFO ] Flatten gal took : 20 ms
[2022-05-15 18:40:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 5 ms.
[2022-05-15 18:40:03] [INFO ] Time to serialize gal into /tmp/CTLFireability12731053637147191031.gal : 3 ms
[2022-05-15 18:40:03] [INFO ] Time to serialize properties into /tmp/CTLFireability16752825022224431010.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/CTLFireability12731053637147191031.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16752825022224431010.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 : 585/585 places, 518/518 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 556 transition count 489
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 556 transition count 489
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 69 place count 545 transition count 478
Iterating global reduction 0 with 11 rules applied. Total rules applied 80 place count 545 transition count 478
Applied a total of 80 rules in 35 ms. Remains 545 /585 variables (removed 40) and now considering 478/518 (removed 40) transitions.
// Phase 1: matrix 478 rows 545 cols
[2022-05-15 18:40:33] [INFO ] Computed 107 place invariants in 6 ms
[2022-05-15 18:40:34] [INFO ] Implicit Places using invariants in 171 ms returned []
// Phase 1: matrix 478 rows 545 cols
[2022-05-15 18:40:34] [INFO ] Computed 107 place invariants in 3 ms
[2022-05-15 18:40:34] [INFO ] Implicit Places using invariants and state equation in 518 ms returned []
Implicit Place search using SMT with State Equation took 689 ms to find 0 implicit places.
// Phase 1: matrix 478 rows 545 cols
[2022-05-15 18:40:34] [INFO ] Computed 107 place invariants in 14 ms
[2022-05-15 18:40:34] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 545/585 places, 478/518 transitions.
Finished structural reductions, in 1 iterations. Remains : 545/585 places, 478/518 transitions.
[2022-05-15 18:40:34] [INFO ] Flatten gal took : 11 ms
[2022-05-15 18:40:34] [INFO ] Flatten gal took : 12 ms
[2022-05-15 18:40:34] [INFO ] Input system was already deterministic with 478 transitions.
[2022-05-15 18:40:34] [INFO ] Flatten gal took : 12 ms
[2022-05-15 18:40:34] [INFO ] Flatten gal took : 12 ms
[2022-05-15 18:40:34] [INFO ] Time to serialize gal into /tmp/CTLFireability9088806455893407117.gal : 1 ms
[2022-05-15 18:40:34] [INFO ] Time to serialize properties into /tmp/CTLFireability13200916647291849275.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/CTLFireability9088806455893407117.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13200916647291849275.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-15 18:41:04] [INFO ] Flatten gal took : 16 ms
[2022-05-15 18:41:04] [INFO ] Applying decomposition
[2022-05-15 18:41:04] [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/graph2885277821491920766.txt' '-o' '/tmp/graph2885277821491920766.bin' '-w' '/tmp/graph2885277821491920766.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2885277821491920766.bin' '-l' '-1' '-v' '-w' '/tmp/graph2885277821491920766.weights' '-q' '0' '-e' '0.001'
[2022-05-15 18:41:05] [INFO ] Decomposing Gal with order
[2022-05-15 18:41:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 18:41:05] [INFO ] Removed a total of 276 redundant transitions.
[2022-05-15 18:41:05] [INFO ] Flatten gal took : 22 ms
[2022-05-15 18:41:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 5 ms.
[2022-05-15 18:41:05] [INFO ] Time to serialize gal into /tmp/CTLFireability5309297852273981850.gal : 3 ms
[2022-05-15 18:41:05] [INFO ] Time to serialize properties into /tmp/CTLFireability12531672109797026988.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/CTLFireability5309297852273981850.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12531672109797026988.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 : 585/585 places, 518/518 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 552 transition count 485
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 552 transition count 485
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 79 place count 539 transition count 472
Iterating global reduction 0 with 13 rules applied. Total rules applied 92 place count 539 transition count 472
Applied a total of 92 rules in 27 ms. Remains 539 /585 variables (removed 46) and now considering 472/518 (removed 46) transitions.
// Phase 1: matrix 472 rows 539 cols
[2022-05-15 18:41:35] [INFO ] Computed 107 place invariants in 9 ms
[2022-05-15 18:41:35] [INFO ] Implicit Places using invariants in 190 ms returned []
// Phase 1: matrix 472 rows 539 cols
[2022-05-15 18:41:35] [INFO ] Computed 107 place invariants in 3 ms
[2022-05-15 18:41:35] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 728 ms to find 0 implicit places.
// Phase 1: matrix 472 rows 539 cols
[2022-05-15 18:41:35] [INFO ] Computed 107 place invariants in 5 ms
[2022-05-15 18:41:36] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 539/585 places, 472/518 transitions.
Finished structural reductions, in 1 iterations. Remains : 539/585 places, 472/518 transitions.
[2022-05-15 18:41:36] [INFO ] Flatten gal took : 12 ms
[2022-05-15 18:41:36] [INFO ] Flatten gal took : 12 ms
[2022-05-15 18:41:36] [INFO ] Input system was already deterministic with 472 transitions.
[2022-05-15 18:41:36] [INFO ] Flatten gal took : 12 ms
[2022-05-15 18:41:36] [INFO ] Flatten gal took : 23 ms
[2022-05-15 18:41:36] [INFO ] Time to serialize gal into /tmp/CTLFireability14704097980634187458.gal : 2 ms
[2022-05-15 18:41:36] [INFO ] Time to serialize properties into /tmp/CTLFireability12383359034450795313.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/CTLFireability14704097980634187458.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12383359034450795313.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-15 18:42:06] [INFO ] Flatten gal took : 12 ms
[2022-05-15 18:42:06] [INFO ] Applying decomposition
[2022-05-15 18:42:06] [INFO ] Flatten gal took : 11 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/graph578298439300006187.txt' '-o' '/tmp/graph578298439300006187.bin' '-w' '/tmp/graph578298439300006187.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph578298439300006187.bin' '-l' '-1' '-v' '-w' '/tmp/graph578298439300006187.weights' '-q' '0' '-e' '0.001'
[2022-05-15 18:42:06] [INFO ] Decomposing Gal with order
[2022-05-15 18:42:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 18:42:06] [INFO ] Removed a total of 279 redundant transitions.
[2022-05-15 18:42:06] [INFO ] Flatten gal took : 31 ms
[2022-05-15 18:42:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 5 ms.
[2022-05-15 18:42:06] [INFO ] Time to serialize gal into /tmp/CTLFireability5735118629136352517.gal : 3 ms
[2022-05-15 18:42:06] [INFO ] Time to serialize properties into /tmp/CTLFireability3647649730530337678.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/CTLFireability5735118629136352517.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3647649730530337678.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 : 585/585 places, 518/518 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 552 transition count 485
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 552 transition count 485
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 79 place count 539 transition count 472
Iterating global reduction 0 with 13 rules applied. Total rules applied 92 place count 539 transition count 472
Applied a total of 92 rules in 34 ms. Remains 539 /585 variables (removed 46) and now considering 472/518 (removed 46) transitions.
// Phase 1: matrix 472 rows 539 cols
[2022-05-15 18:42:36] [INFO ] Computed 107 place invariants in 3 ms
[2022-05-15 18:42:36] [INFO ] Implicit Places using invariants in 176 ms returned []
// Phase 1: matrix 472 rows 539 cols
[2022-05-15 18:42:36] [INFO ] Computed 107 place invariants in 3 ms
[2022-05-15 18:42:37] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 694 ms to find 0 implicit places.
// Phase 1: matrix 472 rows 539 cols
[2022-05-15 18:42:37] [INFO ] Computed 107 place invariants in 3 ms
[2022-05-15 18:42:37] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 539/585 places, 472/518 transitions.
Finished structural reductions, in 1 iterations. Remains : 539/585 places, 472/518 transitions.
[2022-05-15 18:42:37] [INFO ] Flatten gal took : 11 ms
[2022-05-15 18:42:37] [INFO ] Flatten gal took : 11 ms
[2022-05-15 18:42:37] [INFO ] Input system was already deterministic with 472 transitions.
[2022-05-15 18:42:37] [INFO ] Flatten gal took : 12 ms
[2022-05-15 18:42:37] [INFO ] Flatten gal took : 12 ms
[2022-05-15 18:42:37] [INFO ] Time to serialize gal into /tmp/CTLFireability14951512240761235529.gal : 1 ms
[2022-05-15 18:42:37] [INFO ] Time to serialize properties into /tmp/CTLFireability6311869157895331930.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/CTLFireability14951512240761235529.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6311869157895331930.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-15 18:43:07] [INFO ] Flatten gal took : 19 ms
[2022-05-15 18:43:07] [INFO ] Applying decomposition
[2022-05-15 18:43:07] [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/graph10205202032141203848.txt' '-o' '/tmp/graph10205202032141203848.bin' '-w' '/tmp/graph10205202032141203848.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10205202032141203848.bin' '-l' '-1' '-v' '-w' '/tmp/graph10205202032141203848.weights' '-q' '0' '-e' '0.001'
[2022-05-15 18:43:07] [INFO ] Decomposing Gal with order
[2022-05-15 18:43:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 18:43:07] [INFO ] Removed a total of 284 redundant transitions.
[2022-05-15 18:43:07] [INFO ] Flatten gal took : 21 ms
[2022-05-15 18:43:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 5 ms.
[2022-05-15 18:43:07] [INFO ] Time to serialize gal into /tmp/CTLFireability364195761427583269.gal : 3 ms
[2022-05-15 18:43:07] [INFO ] Time to serialize properties into /tmp/CTLFireability15650538120691860322.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/CTLFireability364195761427583269.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15650538120691860322.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.00933e+34,12.8692,341904,14154,83,693056,1016,1249,1.11854e+06,71,2344,0

Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 585/585 places, 518/518 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 554 transition count 487
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 554 transition count 487
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 73 place count 543 transition count 476
Iterating global reduction 0 with 11 rules applied. Total rules applied 84 place count 543 transition count 476
Applied a total of 84 rules in 38 ms. Remains 543 /585 variables (removed 42) and now considering 476/518 (removed 42) transitions.
// Phase 1: matrix 476 rows 543 cols
[2022-05-15 18:43:37] [INFO ] Computed 107 place invariants in 7 ms
[2022-05-15 18:43:37] [INFO ] Implicit Places using invariants in 169 ms returned []
// Phase 1: matrix 476 rows 543 cols
[2022-05-15 18:43:37] [INFO ] Computed 107 place invariants in 2 ms
[2022-05-15 18:43:38] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 674 ms to find 0 implicit places.
// Phase 1: matrix 476 rows 543 cols
[2022-05-15 18:43:38] [INFO ] Computed 107 place invariants in 2 ms
[2022-05-15 18:43:38] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 543/585 places, 476/518 transitions.
Finished structural reductions, in 1 iterations. Remains : 543/585 places, 476/518 transitions.
[2022-05-15 18:43:38] [INFO ] Flatten gal took : 11 ms
[2022-05-15 18:43:38] [INFO ] Flatten gal took : 12 ms
[2022-05-15 18:43:38] [INFO ] Input system was already deterministic with 476 transitions.
[2022-05-15 18:43:38] [INFO ] Flatten gal took : 12 ms
[2022-05-15 18:43:38] [INFO ] Flatten gal took : 12 ms
[2022-05-15 18:43:38] [INFO ] Time to serialize gal into /tmp/CTLFireability594988597312477886.gal : 2 ms
[2022-05-15 18:43:38] [INFO ] Time to serialize properties into /tmp/CTLFireability16353139172333792603.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/CTLFireability594988597312477886.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16353139172333792603.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-15 18:44:08] [INFO ] Flatten gal took : 17 ms
[2022-05-15 18:44:08] [INFO ] Applying decomposition
[2022-05-15 18:44:08] [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/graph13347843560799066471.txt' '-o' '/tmp/graph13347843560799066471.bin' '-w' '/tmp/graph13347843560799066471.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13347843560799066471.bin' '-l' '-1' '-v' '-w' '/tmp/graph13347843560799066471.weights' '-q' '0' '-e' '0.001'
[2022-05-15 18:44:08] [INFO ] Decomposing Gal with order
[2022-05-15 18:44:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 18:44:08] [INFO ] Removed a total of 277 redundant transitions.
[2022-05-15 18:44:08] [INFO ] Flatten gal took : 38 ms
[2022-05-15 18:44:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 4 ms.
[2022-05-15 18:44:08] [INFO ] Time to serialize gal into /tmp/CTLFireability18046884194580128245.gal : 3 ms
[2022-05-15 18:44:08] [INFO ] Time to serialize properties into /tmp/CTLFireability6076186244622896480.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/CTLFireability18046884194580128245.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6076186244622896480.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-15 18:44:38] [INFO ] Flatten gal took : 15 ms
[2022-05-15 18:44:38] [INFO ] Flatten gal took : 13 ms
[2022-05-15 18:44:38] [INFO ] Applying decomposition
[2022-05-15 18:44:38] [INFO ] Flatten gal took : 13 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/graph12159171096426033356.txt' '-o' '/tmp/graph12159171096426033356.bin' '-w' '/tmp/graph12159171096426033356.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12159171096426033356.bin' '-l' '-1' '-v' '-w' '/tmp/graph12159171096426033356.weights' '-q' '0' '-e' '0.001'
[2022-05-15 18:44:39] [INFO ] Decomposing Gal with order
[2022-05-15 18:44:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 18:44:39] [INFO ] Removed a total of 278 redundant transitions.
[2022-05-15 18:44:39] [INFO ] Flatten gal took : 38 ms
[2022-05-15 18:44:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2022-05-15 18:44:39] [INFO ] Time to serialize gal into /tmp/CTLFireability3538192073126738218.gal : 3 ms
[2022-05-15 18:44:39] [INFO ] Time to serialize properties into /tmp/CTLFireability16997910986581613391.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/CTLFireability3538192073126738218.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16997910986581613391.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.
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.89315e+35,589.275,3818884,32722,85,4.59816e+06,1138,1352,1.15125e+07,79,3953,0

Converting to forward existential form...Done !
original formula: AX(AG(AF(((!(E((i3.i1.u133.p445==1) U (i5.i0.u20.p59==1))) * (i16.i0.u82.p265==0)) * (i18.u175.p620==0)))))
=> equivalent forward existential formula: [FwdG(FwdU(EY(Init),TRUE),!(((!(E((i3.i1.u133.p445==1) U (i5.i0.u20.p59==1))) * (i16.i0.u82.p265==0)) * (i18.u17...177
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t238, t332, t417, t419, t422, t424, t431, t436, t438, t444, t446, t450, t451,...1959
Detected timeout of ITS tools.
[2022-05-15 19:09:17] [INFO ] Applying decomposition
[2022-05-15 19:09:17] [INFO ] Flatten gal took : 14 ms
[2022-05-15 19:09:17] [INFO ] Decomposing Gal with order
[2022-05-15 19:09:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 19:09:17] [INFO ] Removed a total of 142 redundant transitions.
[2022-05-15 19:09:17] [INFO ] Flatten gal took : 25 ms
[2022-05-15 19:09:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 264 labels/synchronizations in 129 ms.
[2022-05-15 19:09:17] [INFO ] Time to serialize gal into /tmp/CTLFireability12584691434988209137.gal : 22 ms
[2022-05-15 19:09:17] [INFO ] Time to serialize properties into /tmp/CTLFireability8392295139014059765.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12584691434988209137.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8392295139014059765.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.

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="BusinessProcesses-PT-20"
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 BusinessProcesses-PT-20, 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 r024-tall-165251918600474"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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