Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r037-tajo-167813690500530.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is BusinessProcesses-PT-11, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690500530
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.6K Feb 25 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 16:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 141K Mar 5 18:22 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-11-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678362221279

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-11
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202303021504
[2023-03-09 11:43:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 11:43:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 11:43:43] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2023-03-09 11:43:43] [INFO ] Transformed 567 places.
[2023-03-09 11:43:43] [INFO ] Transformed 508 transitions.
[2023-03-09 11:43:43] [INFO ] Found NUPN structural information;
[2023-03-09 11:43:43] [INFO ] Parsed PT model containing 567 places and 508 transitions and 1512 arcs in 161 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Deduced a syphon composed of 7 places in 18 ms
Reduce places removed 7 places and 7 transitions.
Support contains 110 out of 560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 560/560 places, 501/501 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 556 transition count 501
Discarding 54 places :
Symmetric choice reduction at 1 with 54 rule applications. Total rules 58 place count 502 transition count 447
Iterating global reduction 1 with 54 rules applied. Total rules applied 112 place count 502 transition count 447
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 134 place count 480 transition count 425
Iterating global reduction 1 with 22 rules applied. Total rules applied 156 place count 480 transition count 425
Applied a total of 156 rules in 203 ms. Remains 480 /560 variables (removed 80) and now considering 425/501 (removed 76) transitions.
// Phase 1: matrix 425 rows 480 cols
[2023-03-09 11:43:43] [INFO ] Computed 91 place invariants in 60 ms
[2023-03-09 11:43:44] [INFO ] Implicit Places using invariants in 604 ms returned []
[2023-03-09 11:43:44] [INFO ] Invariant cache hit.
[2023-03-09 11:43:45] [INFO ] Implicit Places using invariants and state equation in 527 ms returned []
Implicit Place search using SMT with State Equation took 1160 ms to find 0 implicit places.
[2023-03-09 11:43:45] [INFO ] Invariant cache hit.
[2023-03-09 11:43:45] [INFO ] Dead Transitions using invariants and state equation in 348 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 480/560 places, 425/501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1714 ms. Remains : 480/560 places, 425/501 transitions.
Support contains 110 out of 480 places after structural reductions.
[2023-03-09 11:43:45] [INFO ] Flatten gal took : 69 ms
[2023-03-09 11:43:45] [INFO ] Flatten gal took : 31 ms
[2023-03-09 11:43:45] [INFO ] Input system was already deterministic with 425 transitions.
Incomplete random walk after 10000 steps, including 75 resets, run finished after 748 ms. (steps per millisecond=13 ) properties (out of 79) seen :25
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 54) 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 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 54) 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 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 54) 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 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 54) 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 54) 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 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 54) 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 54) 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 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 54) 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 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 54) 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 54) 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 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 54) 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 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 54) 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 54) 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 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 54) 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 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 54) 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 54) 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 54) 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 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 54) 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 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 54) 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 54) 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 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 54) 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 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 54) 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 54) 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 54) 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 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 54) 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 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 54) 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 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 54) 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 54) seen :0
Running SMT prover for 54 properties.
[2023-03-09 11:43:47] [INFO ] Invariant cache hit.
[2023-03-09 11:43:47] [INFO ] [Real]Absence check using 49 positive place invariants in 11 ms returned sat
[2023-03-09 11:43:47] [INFO ] [Real]Absence check using 49 positive and 42 generalized place invariants in 11 ms returned sat
[2023-03-09 11:43:47] [INFO ] After 673ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:53
[2023-03-09 11:43:49] [INFO ] [Nat]Absence check using 49 positive place invariants in 35 ms returned sat
[2023-03-09 11:43:49] [INFO ] [Nat]Absence check using 49 positive and 42 generalized place invariants in 25 ms returned sat
[2023-03-09 11:43:50] [INFO ] After 1199ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :45
[2023-03-09 11:43:51] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 4 ms to minimize.
[2023-03-09 11:43:51] [INFO ] Deduced a trap composed of 8 places in 214 ms of which 1 ms to minimize.
[2023-03-09 11:43:51] [INFO ] Deduced a trap composed of 18 places in 141 ms of which 1 ms to minimize.
[2023-03-09 11:43:51] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 2 ms to minimize.
[2023-03-09 11:43:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 749 ms
[2023-03-09 11:43:51] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 1 ms to minimize.
[2023-03-09 11:43:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2023-03-09 11:43:52] [INFO ] Deduced a trap composed of 89 places in 157 ms of which 1 ms to minimize.
[2023-03-09 11:43:52] [INFO ] Deduced a trap composed of 100 places in 137 ms of which 1 ms to minimize.
[2023-03-09 11:43:52] [INFO ] Deduced a trap composed of 78 places in 172 ms of which 1 ms to minimize.
[2023-03-09 11:43:52] [INFO ] Deduced a trap composed of 100 places in 169 ms of which 0 ms to minimize.
[2023-03-09 11:43:52] [INFO ] Deduced a trap composed of 84 places in 196 ms of which 14 ms to minimize.
[2023-03-09 11:43:53] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 1 ms to minimize.
[2023-03-09 11:43:53] [INFO ] Deduced a trap composed of 80 places in 143 ms of which 0 ms to minimize.
[2023-03-09 11:43:53] [INFO ] Deduced a trap composed of 107 places in 187 ms of which 1 ms to minimize.
[2023-03-09 11:43:53] [INFO ] Deduced a trap composed of 94 places in 149 ms of which 0 ms to minimize.
[2023-03-09 11:43:53] [INFO ] Deduced a trap composed of 99 places in 141 ms of which 1 ms to minimize.
[2023-03-09 11:43:53] [INFO ] Deduced a trap composed of 96 places in 97 ms of which 1 ms to minimize.
[2023-03-09 11:43:53] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 1 ms to minimize.
[2023-03-09 11:43:54] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 0 ms to minimize.
[2023-03-09 11:43:54] [INFO ] Deduced a trap composed of 99 places in 117 ms of which 1 ms to minimize.
[2023-03-09 11:43:54] [INFO ] Deduced a trap composed of 82 places in 117 ms of which 0 ms to minimize.
[2023-03-09 11:43:54] [INFO ] Deduced a trap composed of 105 places in 102 ms of which 2 ms to minimize.
[2023-03-09 11:43:54] [INFO ] Deduced a trap composed of 117 places in 121 ms of which 3 ms to minimize.
[2023-03-09 11:43:54] [INFO ] Deduced a trap composed of 92 places in 100 ms of which 1 ms to minimize.
[2023-03-09 11:43:54] [INFO ] Deduced a trap composed of 96 places in 115 ms of which 0 ms to minimize.
[2023-03-09 11:43:55] [INFO ] Deduced a trap composed of 101 places in 121 ms of which 1 ms to minimize.
[2023-03-09 11:43:55] [INFO ] Deduced a trap composed of 105 places in 131 ms of which 0 ms to minimize.
[2023-03-09 11:43:55] [INFO ] Deduced a trap composed of 105 places in 116 ms of which 0 ms to minimize.
[2023-03-09 11:43:55] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 0 ms to minimize.
[2023-03-09 11:43:55] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 3585 ms
[2023-03-09 11:43:55] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2023-03-09 11:43:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-09 11:43:55] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 0 ms to minimize.
[2023-03-09 11:43:55] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 1 ms to minimize.
[2023-03-09 11:43:55] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 1 ms to minimize.
[2023-03-09 11:43:56] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 0 ms to minimize.
[2023-03-09 11:43:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 382 ms
[2023-03-09 11:43:56] [INFO ] Deduced a trap composed of 107 places in 112 ms of which 0 ms to minimize.
[2023-03-09 11:43:56] [INFO ] Deduced a trap composed of 100 places in 147 ms of which 3 ms to minimize.
[2023-03-09 11:43:56] [INFO ] Deduced a trap composed of 104 places in 96 ms of which 0 ms to minimize.
[2023-03-09 11:43:56] [INFO ] Deduced a trap composed of 104 places in 139 ms of which 0 ms to minimize.
[2023-03-09 11:43:56] [INFO ] Deduced a trap composed of 109 places in 94 ms of which 1 ms to minimize.
[2023-03-09 11:43:56] [INFO ] Deduced a trap composed of 110 places in 107 ms of which 1 ms to minimize.
[2023-03-09 11:43:57] [INFO ] Deduced a trap composed of 106 places in 139 ms of which 2 ms to minimize.
[2023-03-09 11:43:57] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1004 ms
[2023-03-09 11:43:57] [INFO ] Deduced a trap composed of 116 places in 129 ms of which 1 ms to minimize.
[2023-03-09 11:43:57] [INFO ] Deduced a trap composed of 131 places in 137 ms of which 0 ms to minimize.
[2023-03-09 11:43:57] [INFO ] Deduced a trap composed of 52 places in 110 ms of which 1 ms to minimize.
[2023-03-09 11:43:57] [INFO ] Deduced a trap composed of 104 places in 102 ms of which 1 ms to minimize.
[2023-03-09 11:43:57] [INFO ] Deduced a trap composed of 114 places in 104 ms of which 1 ms to minimize.
[2023-03-09 11:43:58] [INFO ] Deduced a trap composed of 118 places in 102 ms of which 1 ms to minimize.
[2023-03-09 11:43:58] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 816 ms
[2023-03-09 11:43:58] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 1 ms to minimize.
[2023-03-09 11:43:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2023-03-09 11:43:58] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 0 ms to minimize.
[2023-03-09 11:43:58] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 0 ms to minimize.
[2023-03-09 11:43:58] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 0 ms to minimize.
[2023-03-09 11:43:58] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 1 ms to minimize.
[2023-03-09 11:43:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 513 ms
[2023-03-09 11:43:59] [INFO ] Deduced a trap composed of 99 places in 139 ms of which 1 ms to minimize.
[2023-03-09 11:43:59] [INFO ] Deduced a trap composed of 93 places in 124 ms of which 0 ms to minimize.
[2023-03-09 11:44:00] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 1 ms to minimize.
[2023-03-09 11:44:00] [INFO ] Deduced a trap composed of 104 places in 119 ms of which 1 ms to minimize.
[2023-03-09 11:44:00] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 0 ms to minimize.
[2023-03-09 11:44:00] [INFO ] Deduced a trap composed of 93 places in 128 ms of which 12 ms to minimize.
[2023-03-09 11:44:00] [INFO ] Deduced a trap composed of 94 places in 138 ms of which 0 ms to minimize.
[2023-03-09 11:44:00] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 0 ms to minimize.
[2023-03-09 11:44:00] [INFO ] Deduced a trap composed of 103 places in 112 ms of which 0 ms to minimize.
[2023-03-09 11:44:01] [INFO ] Deduced a trap composed of 108 places in 127 ms of which 1 ms to minimize.
[2023-03-09 11:44:01] [INFO ] Deduced a trap composed of 108 places in 107 ms of which 1 ms to minimize.
[2023-03-09 11:44:01] [INFO ] Deduced a trap composed of 114 places in 114 ms of which 1 ms to minimize.
[2023-03-09 11:44:01] [INFO ] Deduced a trap composed of 104 places in 125 ms of which 1 ms to minimize.
[2023-03-09 11:44:01] [INFO ] Deduced a trap composed of 120 places in 122 ms of which 1 ms to minimize.
[2023-03-09 11:44:01] [INFO ] Deduced a trap composed of 109 places in 126 ms of which 2 ms to minimize.
[2023-03-09 11:44:01] [INFO ] Deduced a trap composed of 101 places in 127 ms of which 0 ms to minimize.
[2023-03-09 11:44:02] [INFO ] Deduced a trap composed of 105 places in 125 ms of which 2 ms to minimize.
[2023-03-09 11:44:02] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2692 ms
[2023-03-09 11:44:02] [INFO ] Deduced a trap composed of 116 places in 151 ms of which 6 ms to minimize.
[2023-03-09 11:44:02] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 2 ms to minimize.
[2023-03-09 11:44:02] [INFO ] Deduced a trap composed of 100 places in 123 ms of which 1 ms to minimize.
[2023-03-09 11:44:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 503 ms
[2023-03-09 11:44:03] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 0 ms to minimize.
[2023-03-09 11:44:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2023-03-09 11:44:03] [INFO ] After 13789ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :45
Attempting to minimize the solution found.
Minimization took 1714 ms.
[2023-03-09 11:44:05] [INFO ] After 17321ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :45
Fused 54 Parikh solutions to 45 different solutions.
Parikh walk visited 0 properties in 563 ms.
Support contains 69 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 425/425 transitions.
Graph (complete) has 1046 edges and 480 vertex of which 479 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 479 transition count 389
Reduce places removed 35 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 39 rules applied. Total rules applied 75 place count 444 transition count 385
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 79 place count 440 transition count 385
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 81 Pre rules applied. Total rules applied 79 place count 440 transition count 304
Deduced a syphon composed of 81 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 253 place count 347 transition count 304
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 261 place count 339 transition count 296
Iterating global reduction 3 with 8 rules applied. Total rules applied 269 place count 339 transition count 296
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 191 rules applied. Total rules applied 460 place count 243 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 461 place count 243 transition count 200
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 463 place count 242 transition count 204
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 472 place count 242 transition count 204
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 473 place count 241 transition count 203
Applied a total of 473 rules in 87 ms. Remains 241 /480 variables (removed 239) and now considering 203/425 (removed 222) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 241/480 places, 203/425 transitions.
Incomplete random walk after 10000 steps, including 485 resets, run finished after 359 ms. (steps per millisecond=27 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 45) seen :0
Interrupted probabilistic random walk after 672665 steps, run timeout after 3001 ms. (steps per millisecond=224 ) properties seen :{0=1, 1=1, 2=1, 4=1, 6=1, 7=1, 8=1, 9=1, 10=1, 12=1, 14=1, 15=1, 16=1, 17=1, 18=1, 19=1, 20=1, 21=1, 22=1, 23=1, 24=1, 25=1, 26=1, 27=1, 29=1, 30=1, 31=1, 32=1, 33=1, 34=1, 35=1, 36=1, 37=1, 38=1, 39=1, 40=1, 41=1, 42=1, 43=1, 44=1}
Probabilistic random walk after 672665 steps, saw 107509 distinct states, run finished after 3002 ms. (steps per millisecond=224 ) properties seen :40
Running SMT prover for 5 properties.
// Phase 1: matrix 203 rows 241 cols
[2023-03-09 11:44:09] [INFO ] Computed 78 place invariants in 9 ms
[2023-03-09 11:44:09] [INFO ] [Real]Absence check using 52 positive place invariants in 6 ms returned sat
[2023-03-09 11:44:09] [INFO ] [Real]Absence check using 52 positive and 26 generalized place invariants in 6 ms returned sat
[2023-03-09 11:44:09] [INFO ] After 93ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5
[2023-03-09 11:44:09] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-09 11:44:09] [INFO ] After 31ms SMT Verify possible using 5 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 11:44:09] [INFO ] After 201ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 11:44:09] [INFO ] [Nat]Absence check using 52 positive place invariants in 8 ms returned sat
[2023-03-09 11:44:09] [INFO ] [Nat]Absence check using 52 positive and 26 generalized place invariants in 6 ms returned sat
[2023-03-09 11:44:09] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-09 11:44:10] [INFO ] After 28ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-09 11:44:10] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-09 11:44:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2023-03-09 11:44:10] [INFO ] Deduced a trap composed of 60 places in 130 ms of which 0 ms to minimize.
[2023-03-09 11:44:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2023-03-09 11:44:10] [INFO ] After 263ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-09 11:44:10] [INFO ] After 459ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 16 ms.
Support contains 7 out of 241 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 241/241 places, 203/203 transitions.
Graph (trivial) has 58 edges and 241 vertex of which 2 / 241 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 240 transition count 187
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 226 transition count 187
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 29 place count 226 transition count 168
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 73 place count 201 transition count 168
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 82 place count 192 transition count 159
Iterating global reduction 2 with 9 rules applied. Total rules applied 91 place count 192 transition count 159
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 45 rules applied. Total rules applied 136 place count 168 transition count 138
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 138 place count 168 transition count 136
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 140 place count 166 transition count 136
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 141 place count 166 transition count 136
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 142 place count 165 transition count 135
Iterating global reduction 3 with 1 rules applied. Total rules applied 143 place count 165 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 144 place count 164 transition count 134
Applied a total of 144 rules in 65 ms. Remains 164 /241 variables (removed 77) and now considering 134/203 (removed 69) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 164/241 places, 134/203 transitions.
Incomplete random walk after 10000 steps, including 478 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 198 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 181 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 127 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 197 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 207 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 5) seen :0
Finished probabilistic random walk after 15289 steps, run visited all 5 properties in 109 ms. (steps per millisecond=140 )
Probabilistic random walk after 15289 steps, saw 4668 distinct states, run finished after 109 ms. (steps per millisecond=140 ) properties seen :5
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
FORMULA BusinessProcesses-PT-11-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-09 11:44:11] [INFO ] Flatten gal took : 19 ms
[2023-03-09 11:44:11] [INFO ] Flatten gal took : 21 ms
[2023-03-09 11:44:11] [INFO ] Input system was already deterministic with 425 transitions.
Support contains 93 out of 480 places (down from 94) after GAL structural reductions.
Computed a total of 465 stabilizing places and 410 stable transitions
Graph (complete) has 1046 edges and 480 vertex of which 479 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.25 ms
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 453 transition count 398
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 453 transition count 398
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 67 place count 440 transition count 385
Iterating global reduction 0 with 13 rules applied. Total rules applied 80 place count 440 transition count 385
Applied a total of 80 rules in 31 ms. Remains 440 /480 variables (removed 40) and now considering 385/425 (removed 40) transitions.
// Phase 1: matrix 385 rows 440 cols
[2023-03-09 11:44:11] [INFO ] Computed 91 place invariants in 4 ms
[2023-03-09 11:44:11] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-09 11:44:11] [INFO ] Invariant cache hit.
[2023-03-09 11:44:11] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 559 ms to find 0 implicit places.
[2023-03-09 11:44:11] [INFO ] Invariant cache hit.
[2023-03-09 11:44:12] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 440/480 places, 385/425 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 818 ms. Remains : 440/480 places, 385/425 transitions.
[2023-03-09 11:44:12] [INFO ] Flatten gal took : 27 ms
[2023-03-09 11:44:12] [INFO ] Flatten gal took : 22 ms
[2023-03-09 11:44:12] [INFO ] Input system was already deterministic with 385 transitions.
[2023-03-09 11:44:12] [INFO ] Flatten gal took : 30 ms
[2023-03-09 11:44:12] [INFO ] Flatten gal took : 26 ms
[2023-03-09 11:44:12] [INFO ] Time to serialize gal into /tmp/CTLFireability1074256575362094994.gal : 11 ms
[2023-03-09 11:44:12] [INFO ] Time to serialize properties into /tmp/CTLFireability7104264035308828785.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1074256575362094994.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7104264035308828785.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2023-03-09 11:44:42] [INFO ] Flatten gal took : 29 ms
[2023-03-09 11:44:42] [INFO ] Applying decomposition
[2023-03-09 11:44:42] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13263936674102270789.txt' '-o' '/tmp/graph13263936674102270789.bin' '-w' '/tmp/graph13263936674102270789.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13263936674102270789.bin' '-l' '-1' '-v' '-w' '/tmp/graph13263936674102270789.weights' '-q' '0' '-e' '0.001'
[2023-03-09 11:44:42] [INFO ] Decomposing Gal with order
[2023-03-09 11:44:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 11:44:42] [INFO ] Removed a total of 246 redundant transitions.
[2023-03-09 11:44:42] [INFO ] Flatten gal took : 78 ms
[2023-03-09 11:44:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 17 ms.
[2023-03-09 11:44:42] [INFO ] Time to serialize gal into /tmp/CTLFireability14521774728506551710.gal : 13 ms
[2023-03-09 11:44:42] [INFO ] Time to serialize properties into /tmp/CTLFireability9596089856635375775.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14521774728506551710.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9596089856635375775.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.19769e+22,1.49124,38292,5135,69,66813,1171,1012,145498,72,2572,0


Converting to forward existential form...Done !
original formula: EX(A(((i8.i1.u76.p235==1) + !(EF(EX((i16.u132.p489==1))))) U AG(!(E((i4.i1.u87.p261==1) U (i2.u41.p130==1))))))
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(!(E(TRUE U !(!(E((i4.i1.u87.p261==1) U (i2.u41.p130==1)))))))))) * !(E(!(!(E(TRUE U !(!(E((...344
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t152, t164, t176, t180, t192, t200, t212, t216, t224, t250, t377, t378, t380,...1182
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 459 transition count 404
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 459 transition count 404
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 53 place count 448 transition count 393
Iterating global reduction 0 with 11 rules applied. Total rules applied 64 place count 448 transition count 393
Applied a total of 64 rules in 52 ms. Remains 448 /480 variables (removed 32) and now considering 393/425 (removed 32) transitions.
// Phase 1: matrix 393 rows 448 cols
[2023-03-09 11:45:12] [INFO ] Computed 91 place invariants in 8 ms
[2023-03-09 11:45:13] [INFO ] Implicit Places using invariants in 220 ms returned []
[2023-03-09 11:45:13] [INFO ] Invariant cache hit.
[2023-03-09 11:45:13] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
[2023-03-09 11:45:13] [INFO ] Invariant cache hit.
[2023-03-09 11:45:13] [INFO ] Dead Transitions using invariants and state equation in 289 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 448/480 places, 393/425 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1017 ms. Remains : 448/480 places, 393/425 transitions.
[2023-03-09 11:45:13] [INFO ] Flatten gal took : 16 ms
[2023-03-09 11:45:13] [INFO ] Flatten gal took : 16 ms
[2023-03-09 11:45:13] [INFO ] Input system was already deterministic with 393 transitions.
[2023-03-09 11:45:13] [INFO ] Flatten gal took : 13 ms
[2023-03-09 11:45:13] [INFO ] Flatten gal took : 12 ms
[2023-03-09 11:45:13] [INFO ] Time to serialize gal into /tmp/CTLFireability14588538194321334753.gal : 3 ms
[2023-03-09 11:45:13] [INFO ] Time to serialize properties into /tmp/CTLFireability3571671709109735018.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14588538194321334753.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3571671709109735018.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2023-03-09 11:45:44] [INFO ] Flatten gal took : 34 ms
[2023-03-09 11:45:44] [INFO ] Applying decomposition
[2023-03-09 11:45:44] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15077423428406785097.txt' '-o' '/tmp/graph15077423428406785097.bin' '-w' '/tmp/graph15077423428406785097.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15077423428406785097.bin' '-l' '-1' '-v' '-w' '/tmp/graph15077423428406785097.weights' '-q' '0' '-e' '0.001'
[2023-03-09 11:45:44] [INFO ] Decomposing Gal with order
[2023-03-09 11:45:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 11:45:44] [INFO ] Removed a total of 245 redundant transitions.
[2023-03-09 11:45:44] [INFO ] Flatten gal took : 26 ms
[2023-03-09 11:45:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2023-03-09 11:45:44] [INFO ] Time to serialize gal into /tmp/CTLFireability459482264118071250.gal : 6 ms
[2023-03-09 11:45:44] [INFO ] Time to serialize properties into /tmp/CTLFireability8365571185332093333.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability459482264118071250.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8365571185332093333.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.43961e+22,1.43669,45640,4739,65,81434,1043,1079,175081,69,2948,0


Converting to forward existential form...Done !
original formula: (AX(A(!(A((i14.u135.p485==1) U (i9.i1.u99.p257==1))) U EF((i15.i0.u90.p265==1)))) + ((E((((!(((i11.i2.u94.p280==1)&&(i6.u49.p149==1))) + ...372
=> equivalent forward existential formula: ([((FwdU(EY((Init * !(((E((((!(((i11.i2.u94.p280==1)&&(i6.u49.p149==1))) + !((E(!((i12.i1.u112.p360==1)) U (!((i...1161
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t159, t171, t183, t195, t203, t215, t219, t231, t250, t258, t384, t388, i0.i0...1277
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 456 transition count 401
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 456 transition count 401
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 60 place count 444 transition count 389
Iterating global reduction 0 with 12 rules applied. Total rules applied 72 place count 444 transition count 389
Applied a total of 72 rules in 58 ms. Remains 444 /480 variables (removed 36) and now considering 389/425 (removed 36) transitions.
// Phase 1: matrix 389 rows 444 cols
[2023-03-09 11:46:14] [INFO ] Computed 91 place invariants in 5 ms
[2023-03-09 11:46:14] [INFO ] Implicit Places using invariants in 224 ms returned []
[2023-03-09 11:46:14] [INFO ] Invariant cache hit.
[2023-03-09 11:46:15] [INFO ] Implicit Places using invariants and state equation in 679 ms returned []
Implicit Place search using SMT with State Equation took 919 ms to find 0 implicit places.
[2023-03-09 11:46:15] [INFO ] Invariant cache hit.
[2023-03-09 11:46:15] [INFO ] Dead Transitions using invariants and state equation in 292 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 444/480 places, 389/425 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1271 ms. Remains : 444/480 places, 389/425 transitions.
[2023-03-09 11:46:15] [INFO ] Flatten gal took : 10 ms
[2023-03-09 11:46:15] [INFO ] Flatten gal took : 10 ms
[2023-03-09 11:46:15] [INFO ] Input system was already deterministic with 389 transitions.
[2023-03-09 11:46:15] [INFO ] Flatten gal took : 22 ms
[2023-03-09 11:46:15] [INFO ] Flatten gal took : 19 ms
[2023-03-09 11:46:15] [INFO ] Time to serialize gal into /tmp/CTLFireability18078167382309269425.gal : 3 ms
[2023-03-09 11:46:15] [INFO ] Time to serialize properties into /tmp/CTLFireability5587878141706382375.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18078167382309269425.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5587878141706382375.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2023-03-09 11:46:45] [INFO ] Flatten gal took : 25 ms
[2023-03-09 11:46:45] [INFO ] Applying decomposition
[2023-03-09 11:46:45] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph11158275897042483355.txt' '-o' '/tmp/graph11158275897042483355.bin' '-w' '/tmp/graph11158275897042483355.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11158275897042483355.bin' '-l' '-1' '-v' '-w' '/tmp/graph11158275897042483355.weights' '-q' '0' '-e' '0.001'
[2023-03-09 11:46:45] [INFO ] Decomposing Gal with order
[2023-03-09 11:46:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 11:46:45] [INFO ] Removed a total of 249 redundant transitions.
[2023-03-09 11:46:45] [INFO ] Flatten gal took : 43 ms
[2023-03-09 11:46:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2023-03-09 11:46:45] [INFO ] Time to serialize gal into /tmp/CTLFireability3778908240852812879.gal : 5 ms
[2023-03-09 11:46:45] [INFO ] Time to serialize properties into /tmp/CTLFireability4254149145885516494.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3778908240852812879.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4254149145885516494.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.44067e+22,0.852836,28864,5038,72,44034,768,897,142320,70,1663,0


Converting to forward existential form...Done !
original formula: AG(A(!(A(((i4.u150.p546==1)&&(i4.u151.p549==1)) U !(((i12.u92.p283==1)&&(i14.u121.p424==1))))) U (((EG((i14.u121.p425==1)) + AX((((i4.u22...393
=> equivalent forward existential formula: ([(FwdU(((((FwdU(FwdU(Init,TRUE),!((((EG((i14.u121.p425==1)) + !(EX(!((((i4.u22.p82==1)&&(i4.u89.p267==1))&&(i4....1417
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t9, t35, t156, t160, t168, t176, t184, t204, t220, t228, t254, t381, t384, i0.t164, i...1120
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Graph (trivial) has 228 edges and 480 vertex of which 4 / 480 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 1043 edges and 477 vertex of which 476 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 475 transition count 355
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 133 place count 410 transition count 354
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 134 place count 409 transition count 354
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 89 Pre rules applied. Total rules applied 134 place count 409 transition count 265
Deduced a syphon composed of 89 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 328 place count 304 transition count 265
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 352 place count 280 transition count 241
Iterating global reduction 3 with 24 rules applied. Total rules applied 376 place count 280 transition count 241
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 376 place count 280 transition count 239
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 380 place count 278 transition count 239
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 3 with 205 rules applied. Total rules applied 585 place count 175 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 586 place count 174 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 587 place count 173 transition count 136
Applied a total of 587 rules in 59 ms. Remains 173 /480 variables (removed 307) and now considering 136/425 (removed 289) transitions.
// Phase 1: matrix 136 rows 173 cols
[2023-03-09 11:47:16] [INFO ] Computed 73 place invariants in 2 ms
[2023-03-09 11:47:16] [INFO ] Implicit Places using invariants in 129 ms returned [0, 4, 5, 28, 29, 30, 31, 38, 39, 40, 51, 52, 53, 54, 55, 56, 57, 58, 138]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 133 ms to find 19 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 154/480 places, 136/425 transitions.
Applied a total of 0 rules in 7 ms. Remains 154 /154 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 199 ms. Remains : 154/480 places, 136/425 transitions.
[2023-03-09 11:47:16] [INFO ] Flatten gal took : 5 ms
[2023-03-09 11:47:16] [INFO ] Flatten gal took : 6 ms
[2023-03-09 11:47:16] [INFO ] Input system was already deterministic with 136 transitions.
[2023-03-09 11:47:16] [INFO ] Flatten gal took : 5 ms
[2023-03-09 11:47:16] [INFO ] Flatten gal took : 5 ms
[2023-03-09 11:47:16] [INFO ] Time to serialize gal into /tmp/CTLFireability15608824652620939940.gal : 1 ms
[2023-03-09 11:47:16] [INFO ] Time to serialize properties into /tmp/CTLFireability2758860742834358968.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15608824652620939940.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2758860742834358968.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
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,98724,0.108504,7152,2,1964,5,11696,6,0,751,9156,0


Converting to forward existential form...Done !
original formula: A(AG((p309==1)) U !(E(EF((p395!=1)) U ((((p164!=1) * E((p300==1) U (((p171==1)&&(p347==1))&&(p558==1)))) + E((p511==1) U (p453==1))) + EG...170
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(E(TRUE U (p395!=1)) U ((((p164!=1) * E((p300==1) U (((p171==1)&&(p347==1))&&(p558==1)))) + ...543
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t11, t35, t38, t39, t40, t41, t42, t60, t61, t62, t63, t64, t93, t97, t98, t99, t107...269
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,1.67687,46060,1,0,269,208162,282,152,5788,169751,381
FORMULA BusinessProcesses-PT-11-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Graph (trivial) has 238 edges and 480 vertex of which 6 / 480 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 1040 edges and 475 vertex of which 474 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 473 transition count 351
Reduce places removed 66 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 67 rules applied. Total rules applied 135 place count 407 transition count 350
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 136 place count 406 transition count 350
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 94 Pre rules applied. Total rules applied 136 place count 406 transition count 256
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 206 rules applied. Total rules applied 342 place count 294 transition count 256
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 368 place count 268 transition count 230
Iterating global reduction 3 with 26 rules applied. Total rules applied 394 place count 268 transition count 230
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 394 place count 268 transition count 228
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 398 place count 266 transition count 228
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 211 rules applied. Total rules applied 609 place count 159 transition count 124
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 610 place count 158 transition count 123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 611 place count 157 transition count 123
Applied a total of 611 rules in 83 ms. Remains 157 /480 variables (removed 323) and now considering 123/425 (removed 302) transitions.
// Phase 1: matrix 123 rows 157 cols
[2023-03-09 11:47:18] [INFO ] Computed 69 place invariants in 2 ms
[2023-03-09 11:47:18] [INFO ] Implicit Places using invariants in 115 ms returned [0, 4, 5, 28, 29, 30, 31, 38, 39, 40, 45, 46, 47, 48, 49, 50, 51]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 117 ms to find 17 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 140/480 places, 123/425 transitions.
Applied a total of 0 rules in 5 ms. Remains 140 /140 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 206 ms. Remains : 140/480 places, 123/425 transitions.
[2023-03-09 11:47:18] [INFO ] Flatten gal took : 6 ms
[2023-03-09 11:47:18] [INFO ] Flatten gal took : 6 ms
[2023-03-09 11:47:18] [INFO ] Input system was already deterministic with 123 transitions.
[2023-03-09 11:47:18] [INFO ] Flatten gal took : 5 ms
[2023-03-09 11:47:18] [INFO ] Flatten gal took : 6 ms
[2023-03-09 11:47:18] [INFO ] Time to serialize gal into /tmp/CTLFireability1004387684227159554.gal : 1 ms
[2023-03-09 11:47:18] [INFO ] Time to serialize properties into /tmp/CTLFireability14746883743121558259.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1004387684227159554.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14746883743121558259.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
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,13254,0.064507,6268,2,1585,5,8222,6,0,682,7153,0


Converting to forward existential form...Done !
original formula: EF(AG((p421==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p421==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t22, t25, t26, t27, t28, t29, t45, t46, t47, t48, t49, t81, t82, t83, t97, t98, t99, t117, I...253
(forward)formula 0,0,0.570823,23260,1,0,159,78962,231,81,5085,52766,222
FORMULA BusinessProcesses-PT-11-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Graph (trivial) has 226 edges and 480 vertex of which 6 / 480 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 1040 edges and 475 vertex of which 474 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 473 transition count 358
Reduce places removed 59 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 62 rules applied. Total rules applied 123 place count 414 transition count 355
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 126 place count 411 transition count 355
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 91 Pre rules applied. Total rules applied 126 place count 411 transition count 264
Deduced a syphon composed of 91 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 324 place count 304 transition count 264
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 349 place count 279 transition count 239
Iterating global reduction 3 with 25 rules applied. Total rules applied 374 place count 279 transition count 239
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 374 place count 279 transition count 237
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 378 place count 277 transition count 237
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Deduced a syphon composed of 103 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 209 rules applied. Total rules applied 587 place count 171 transition count 134
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 588 place count 170 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 589 place count 169 transition count 133
Applied a total of 589 rules in 74 ms. Remains 169 /480 variables (removed 311) and now considering 133/425 (removed 292) transitions.
// Phase 1: matrix 133 rows 169 cols
[2023-03-09 11:47:18] [INFO ] Computed 71 place invariants in 3 ms
[2023-03-09 11:47:19] [INFO ] Implicit Places using invariants in 127 ms returned [0, 5, 6, 29, 30, 31, 32, 42, 43, 44, 49, 50, 51, 52, 55, 56, 57]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 129 ms to find 17 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 152/480 places, 133/425 transitions.
Applied a total of 0 rules in 5 ms. Remains 152 /152 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 210 ms. Remains : 152/480 places, 133/425 transitions.
[2023-03-09 11:47:19] [INFO ] Flatten gal took : 6 ms
[2023-03-09 11:47:19] [INFO ] Flatten gal took : 6 ms
[2023-03-09 11:47:19] [INFO ] Input system was already deterministic with 133 transitions.
[2023-03-09 11:47:19] [INFO ] Flatten gal took : 6 ms
[2023-03-09 11:47:19] [INFO ] Flatten gal took : 6 ms
[2023-03-09 11:47:19] [INFO ] Time to serialize gal into /tmp/CTLFireability2735790429027032330.gal : 1 ms
[2023-03-09 11:47:19] [INFO ] Time to serialize properties into /tmp/CTLFireability3558668694799355909.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2735790429027032330.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3558668694799355909.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
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,113840,0.077762,6620,2,1889,5,10022,6,0,740,8023,0


Converting to forward existential form...Done !
original formula: (A((((p131==1)&&(p322==1))&&(p473==1)) U AG((AG((((p203==1)&&(p372==1))&&(p510==1))) * A(((p45==1)||(p490==1)) U (p508==1))))) + EF((p136...161
=> equivalent forward existential formula: ([((Init * !(EG(!(!(E(TRUE U !((!(E(TRUE U !((((p203==1)&&(p372==1))&&(p510==1))))) * !((E(!((p508==1)) U (!(((p...646
Reverse transition relation is NOT exact ! Due to transitions t2, t29, t31, t32, t33, t34, t36, t54, t55, t56, t57, t58, t86, t92, t93, t94, t106, t110, t1...271
(forward)formula 0,1,1.95896,54144,1,0,321,248643,266,162,5530,261497,410
FORMULA BusinessProcesses-PT-11-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 455 transition count 400
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 455 transition count 400
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 61 place count 444 transition count 389
Iterating global reduction 0 with 11 rules applied. Total rules applied 72 place count 444 transition count 389
Applied a total of 72 rules in 34 ms. Remains 444 /480 variables (removed 36) and now considering 389/425 (removed 36) transitions.
// Phase 1: matrix 389 rows 444 cols
[2023-03-09 11:47:21] [INFO ] Computed 91 place invariants in 4 ms
[2023-03-09 11:47:21] [INFO ] Implicit Places using invariants in 219 ms returned []
[2023-03-09 11:47:21] [INFO ] Invariant cache hit.
[2023-03-09 11:47:21] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
[2023-03-09 11:47:21] [INFO ] Invariant cache hit.
[2023-03-09 11:47:22] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 444/480 places, 389/425 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 990 ms. Remains : 444/480 places, 389/425 transitions.
[2023-03-09 11:47:22] [INFO ] Flatten gal took : 10 ms
[2023-03-09 11:47:22] [INFO ] Flatten gal took : 10 ms
[2023-03-09 11:47:22] [INFO ] Input system was already deterministic with 389 transitions.
[2023-03-09 11:47:22] [INFO ] Flatten gal took : 9 ms
[2023-03-09 11:47:22] [INFO ] Flatten gal took : 9 ms
[2023-03-09 11:47:22] [INFO ] Time to serialize gal into /tmp/CTLFireability1945323473771678737.gal : 2 ms
[2023-03-09 11:47:22] [INFO ] Time to serialize properties into /tmp/CTLFireability13032349707278080833.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1945323473771678737.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13032349707278080833.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2023-03-09 11:47:52] [INFO ] Flatten gal took : 24 ms
[2023-03-09 11:47:52] [INFO ] Applying decomposition
[2023-03-09 11:47:52] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9835990874703134915.txt' '-o' '/tmp/graph9835990874703134915.bin' '-w' '/tmp/graph9835990874703134915.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9835990874703134915.bin' '-l' '-1' '-v' '-w' '/tmp/graph9835990874703134915.weights' '-q' '0' '-e' '0.001'
[2023-03-09 11:47:52] [INFO ] Decomposing Gal with order
[2023-03-09 11:47:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 11:47:52] [INFO ] Removed a total of 255 redundant transitions.
[2023-03-09 11:47:52] [INFO ] Flatten gal took : 27 ms
[2023-03-09 11:47:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2023-03-09 11:47:52] [INFO ] Time to serialize gal into /tmp/CTLFireability1659795174856942520.gal : 5 ms
[2023-03-09 11:47:52] [INFO ] Time to serialize properties into /tmp/CTLFireability2402310770764200751.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1659795174856942520.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2402310770764200751.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.50232e+22,1.47689,54500,5182,56,94110,882,915,326542,60,2369,0


Converting to forward existential form...Done !
original formula: EX((AF(AG((((i3.u40.p118==0)||(i3.u98.p302==0))||(i3.u130.p463==0)))) * (((AX((i10.u17.p51==0)) + EG((((i14.u24.p72==0)||(i14.u91.p267==0...365
=> equivalent forward existential formula: ((([((EY(Init) * !(EG(!(!(E(TRUE U !((((i3.u40.p118==0)||(i3.u98.p302==0))||(i3.u130.p463==0))))))))) * !(EX(!((...886
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t156, t164, t180, t192, t204, t216, t224, t228, t254, t380, t382, t384, i0.u7...1131
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,0,12.7702,355724,1,0,650684,882,7175,1.59118e+06,329,2369,1242903
FORMULA BusinessProcesses-PT-11-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Graph (trivial) has 233 edges and 480 vertex of which 6 / 480 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1040 edges and 475 vertex of which 474 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 473 transition count 352
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 132 place count 408 transition count 352
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 132 place count 408 transition count 257
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 340 place count 295 transition count 257
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 365 place count 270 transition count 232
Iterating global reduction 2 with 25 rules applied. Total rules applied 390 place count 270 transition count 232
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 390 place count 270 transition count 231
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 392 place count 269 transition count 231
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 2 with 201 rules applied. Total rules applied 593 place count 167 transition count 132
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 599 place count 167 transition count 132
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 600 place count 166 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 601 place count 165 transition count 131
Applied a total of 601 rules in 62 ms. Remains 165 /480 variables (removed 315) and now considering 131/425 (removed 294) transitions.
// Phase 1: matrix 131 rows 165 cols
[2023-03-09 11:48:05] [INFO ] Computed 69 place invariants in 1 ms
[2023-03-09 11:48:05] [INFO ] Implicit Places using invariants in 101 ms returned [0, 4, 5, 30, 31, 32, 33, 40, 41, 42, 47, 48, 49, 50, 51, 52, 53]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 103 ms to find 17 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 148/480 places, 131/425 transitions.
Applied a total of 0 rules in 5 ms. Remains 148 /148 variables (removed 0) and now considering 131/131 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 170 ms. Remains : 148/480 places, 131/425 transitions.
[2023-03-09 11:48:05] [INFO ] Flatten gal took : 6 ms
[2023-03-09 11:48:05] [INFO ] Flatten gal took : 6 ms
[2023-03-09 11:48:05] [INFO ] Input system was already deterministic with 131 transitions.
[2023-03-09 11:48:05] [INFO ] Flatten gal took : 5 ms
[2023-03-09 11:48:05] [INFO ] Flatten gal took : 5 ms
[2023-03-09 11:48:05] [INFO ] Time to serialize gal into /tmp/CTLFireability6131491392813681658.gal : 2 ms
[2023-03-09 11:48:05] [INFO ] Time to serialize properties into /tmp/CTLFireability18120606303327187713.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6131491392813681658.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18120606303327187713.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
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,36216,0.153726,9024,2,2898,5,16997,6,0,722,13687,0


Converting to forward existential form...Done !
original formula: AG(((p69==0) * EF(((EG((p418==0)) + ((((p85==0)||(p292==0))||(p551==0))&&(p319==0))) * (p413==0)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !((p69==0)))] = FALSE * [(FwdU(Init,TRUE) * !(E(TRUE U ((EG((p418==0)) + ((((p85==0)||(p292...211
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t7, t40, t41, t42, t43, t44, t59, t60, t61, t62, t63, t84, t91, t92, t93, t101, t104,...268
(forward)formula 0,0,2.71007,67096,1,0,283,334867,256,146,5538,281294,363
FORMULA BusinessProcesses-PT-11-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 452 transition count 397
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 452 transition count 397
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 438 transition count 383
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 438 transition count 383
Applied a total of 84 rules in 50 ms. Remains 438 /480 variables (removed 42) and now considering 383/425 (removed 42) transitions.
// Phase 1: matrix 383 rows 438 cols
[2023-03-09 11:48:08] [INFO ] Computed 91 place invariants in 14 ms
[2023-03-09 11:48:08] [INFO ] Implicit Places using invariants in 228 ms returned []
[2023-03-09 11:48:08] [INFO ] Invariant cache hit.
[2023-03-09 11:48:08] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 744 ms to find 0 implicit places.
[2023-03-09 11:48:08] [INFO ] Invariant cache hit.
[2023-03-09 11:48:09] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 438/480 places, 383/425 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 988 ms. Remains : 438/480 places, 383/425 transitions.
[2023-03-09 11:48:09] [INFO ] Flatten gal took : 9 ms
[2023-03-09 11:48:09] [INFO ] Flatten gal took : 17 ms
[2023-03-09 11:48:09] [INFO ] Input system was already deterministic with 383 transitions.
[2023-03-09 11:48:09] [INFO ] Flatten gal took : 9 ms
[2023-03-09 11:48:09] [INFO ] Flatten gal took : 9 ms
[2023-03-09 11:48:09] [INFO ] Time to serialize gal into /tmp/CTLFireability8995520735168840083.gal : 2 ms
[2023-03-09 11:48:09] [INFO ] Time to serialize properties into /tmp/CTLFireability14599621912247048890.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8995520735168840083.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14599621912247048890.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2023-03-09 11:48:39] [INFO ] Flatten gal took : 17 ms
[2023-03-09 11:48:39] [INFO ] Applying decomposition
[2023-03-09 11:48:39] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph10973260924408877313.txt' '-o' '/tmp/graph10973260924408877313.bin' '-w' '/tmp/graph10973260924408877313.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10973260924408877313.bin' '-l' '-1' '-v' '-w' '/tmp/graph10973260924408877313.weights' '-q' '0' '-e' '0.001'
[2023-03-09 11:48:39] [INFO ] Decomposing Gal with order
[2023-03-09 11:48:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 11:48:39] [INFO ] Removed a total of 251 redundant transitions.
[2023-03-09 11:48:39] [INFO ] Flatten gal took : 28 ms
[2023-03-09 11:48:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2023-03-09 11:48:39] [INFO ] Time to serialize gal into /tmp/CTLFireability11118150895859141413.gal : 5 ms
[2023-03-09 11:48:39] [INFO ] Time to serialize properties into /tmp/CTLFireability13979985783735107448.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11118150895859141413.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13979985783735107448.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.1963e+22,1.52048,51832,4981,79,85248,2092,904,298594,68,4838,0


Converting to forward existential form...Done !
original formula: (EF(AX(FALSE)) + AF((i12.u23.p63==1)))
=> equivalent forward existential formula: [FwdG((Init * !(E(TRUE U !(EX(!(FALSE)))))),!((i12.u23.p63==1)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t150, t158, t170, t178, t190, t198, t210, t218, t222, t248, t374, t375, t376,...1104
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,1,20.8985,524016,1,0,748767,2092,6678,3.4931e+06,335,4838,1105738
FORMULA BusinessProcesses-PT-11-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Graph (trivial) has 238 edges and 480 vertex of which 6 / 480 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 1040 edges and 475 vertex of which 474 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 69 place count 473 transition count 350
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 136 place count 406 transition count 350
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 93 Pre rules applied. Total rules applied 136 place count 406 transition count 257
Deduced a syphon composed of 93 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 340 place count 295 transition count 257
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 366 place count 269 transition count 231
Iterating global reduction 2 with 26 rules applied. Total rules applied 392 place count 269 transition count 231
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 392 place count 269 transition count 229
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 396 place count 267 transition count 229
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Deduced a syphon composed of 105 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 2 with 213 rules applied. Total rules applied 609 place count 159 transition count 124
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 610 place count 158 transition count 123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 611 place count 157 transition count 123
Applied a total of 611 rules in 54 ms. Remains 157 /480 variables (removed 323) and now considering 123/425 (removed 302) transitions.
// Phase 1: matrix 123 rows 157 cols
[2023-03-09 11:49:00] [INFO ] Computed 69 place invariants in 1 ms
[2023-03-09 11:49:00] [INFO ] Implicit Places using invariants in 250 ms returned [0, 4, 5, 28, 29, 30, 31, 38, 39, 40, 45, 46, 47, 48, 49, 50, 51]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 253 ms to find 17 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 140/480 places, 123/425 transitions.
Applied a total of 0 rules in 3 ms. Remains 140 /140 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 310 ms. Remains : 140/480 places, 123/425 transitions.
[2023-03-09 11:49:00] [INFO ] Flatten gal took : 6 ms
[2023-03-09 11:49:00] [INFO ] Flatten gal took : 5 ms
[2023-03-09 11:49:00] [INFO ] Input system was already deterministic with 123 transitions.
[2023-03-09 11:49:00] [INFO ] Flatten gal took : 6 ms
[2023-03-09 11:49:00] [INFO ] Flatten gal took : 5 ms
[2023-03-09 11:49:00] [INFO ] Time to serialize gal into /tmp/CTLFireability17930955208657683959.gal : 2 ms
[2023-03-09 11:49:00] [INFO ] Time to serialize properties into /tmp/CTLFireability15301223660896580859.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17930955208657683959.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15301223660896580859.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
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,23520,0.10348,6004,2,1595,5,7946,6,0,682,7021,0


Converting to forward existential form...Done !
original formula: EG(EF((p350==1)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (p350==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t26, t27, t28, t29, t30, t45, t46, t47, t48, t49, t80, t81, t82, t93, t97, t98, t99, t117...257
(forward)formula 0,1,1.00564,36952,1,0,304,148618,236,223,5093,160292,369
FORMULA BusinessProcesses-PT-11-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Graph (trivial) has 230 edges and 480 vertex of which 6 / 480 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 1040 edges and 475 vertex of which 474 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 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 66 place count 473 transition count 353
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 130 place count 409 transition count 353
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 92 Pre rules applied. Total rules applied 130 place count 409 transition count 261
Deduced a syphon composed of 92 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 330 place count 301 transition count 261
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 355 place count 276 transition count 236
Iterating global reduction 2 with 25 rules applied. Total rules applied 380 place count 276 transition count 236
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 380 place count 276 transition count 235
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 382 place count 275 transition count 235
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 2 with 207 rules applied. Total rules applied 589 place count 170 transition count 133
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 590 place count 169 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 591 place count 168 transition count 132
Applied a total of 591 rules in 45 ms. Remains 168 /480 variables (removed 312) and now considering 132/425 (removed 293) transitions.
// Phase 1: matrix 132 rows 168 cols
[2023-03-09 11:49:01] [INFO ] Computed 71 place invariants in 1 ms
[2023-03-09 11:49:02] [INFO ] Implicit Places using invariants in 139 ms returned [0, 4, 5, 29, 30, 31, 32, 39, 40, 41, 42, 48, 49, 50, 51, 52, 53, 56, 140]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 150 ms to find 19 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 149/480 places, 132/425 transitions.
Applied a total of 0 rules in 3 ms. Remains 149 /149 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 201 ms. Remains : 149/480 places, 132/425 transitions.
[2023-03-09 11:49:02] [INFO ] Flatten gal took : 6 ms
[2023-03-09 11:49:02] [INFO ] Flatten gal took : 17 ms
[2023-03-09 11:49:02] [INFO ] Input system was already deterministic with 132 transitions.
[2023-03-09 11:49:02] [INFO ] Flatten gal took : 18 ms
[2023-03-09 11:49:02] [INFO ] Flatten gal took : 5 ms
[2023-03-09 11:49:02] [INFO ] Time to serialize gal into /tmp/CTLFireability1420032197592287671.gal : 2 ms
[2023-03-09 11:49:02] [INFO ] Time to serialize properties into /tmp/CTLFireability11109341696725165427.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1420032197592287671.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11109341696725165427.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
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,35478,0.066231,6600,2,1977,5,10335,6,0,727,8636,0


Converting to forward existential form...Done !
original formula: AG(EF((EG(A((p465==1) U (((p85==1)&&(p292==1))&&(p533==1)))) + (AF(E((p457==1) U (p176==1))) * E((p484!=1) U EF((p218==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (EG(!((E(!((((p85==1)&&(p292==1))&&(p533==1))) U (!((p465==1)) * !((((p85==1)&&(p...314
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t42, t43, t44, t45, t46, t63, t64, t65, t66, t67, t94, t95, t96, t104, t108, t109, t1...265
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,1.33459,51392,1,0,392,236640,278,234,5567,238219,505
FORMULA BusinessProcesses-PT-11-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 454 transition count 399
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 454 transition count 399
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 65 place count 441 transition count 386
Iterating global reduction 0 with 13 rules applied. Total rules applied 78 place count 441 transition count 386
Applied a total of 78 rules in 27 ms. Remains 441 /480 variables (removed 39) and now considering 386/425 (removed 39) transitions.
// Phase 1: matrix 386 rows 441 cols
[2023-03-09 11:49:03] [INFO ] Computed 91 place invariants in 6 ms
[2023-03-09 11:49:03] [INFO ] Implicit Places using invariants in 160 ms returned []
[2023-03-09 11:49:03] [INFO ] Invariant cache hit.
[2023-03-09 11:49:04] [INFO ] Implicit Places using invariants and state equation in 541 ms returned []
Implicit Place search using SMT with State Equation took 703 ms to find 0 implicit places.
[2023-03-09 11:49:04] [INFO ] Invariant cache hit.
[2023-03-09 11:49:04] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 441/480 places, 386/425 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 988 ms. Remains : 441/480 places, 386/425 transitions.
[2023-03-09 11:49:04] [INFO ] Flatten gal took : 8 ms
[2023-03-09 11:49:04] [INFO ] Flatten gal took : 8 ms
[2023-03-09 11:49:04] [INFO ] Input system was already deterministic with 386 transitions.
[2023-03-09 11:49:04] [INFO ] Flatten gal took : 8 ms
[2023-03-09 11:49:04] [INFO ] Flatten gal took : 8 ms
[2023-03-09 11:49:04] [INFO ] Time to serialize gal into /tmp/CTLFireability9994147389732962748.gal : 3 ms
[2023-03-09 11:49:04] [INFO ] Time to serialize properties into /tmp/CTLFireability13359072302249400804.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9994147389732962748.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13359072302249400804.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2023-03-09 11:49:34] [INFO ] Flatten gal took : 21 ms
[2023-03-09 11:49:34] [INFO ] Applying decomposition
[2023-03-09 11:49:34] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15341845786276199352.txt' '-o' '/tmp/graph15341845786276199352.bin' '-w' '/tmp/graph15341845786276199352.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15341845786276199352.bin' '-l' '-1' '-v' '-w' '/tmp/graph15341845786276199352.weights' '-q' '0' '-e' '0.001'
[2023-03-09 11:49:34] [INFO ] Decomposing Gal with order
[2023-03-09 11:49:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 11:49:34] [INFO ] Removed a total of 249 redundant transitions.
[2023-03-09 11:49:34] [INFO ] Flatten gal took : 21 ms
[2023-03-09 11:49:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 6 ms.
[2023-03-09 11:49:34] [INFO ] Time to serialize gal into /tmp/CTLFireability848970910736457673.gal : 5 ms
[2023-03-09 11:49:34] [INFO ] Time to serialize properties into /tmp/CTLFireability17886627699225639722.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability848970910736457673.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17886627699225639722.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.34007e+22,0.797314,32096,3479,78,57340,1227,1052,117127,73,3013,0


Converting to forward existential form...Done !
original formula: (EF((i0.i2.u71.p214==1)) * EX(AX(EG((i15.u120.p420==0)))))
=> equivalent forward existential formula: [(EY((Init * E(TRUE U (i0.i2.u71.p214==1)))) * !(EX(!(EG((i15.u120.p420==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t152, t161, t173, t181, t193, t201, t209, t221, t225, t251, t378, t379, i0.t1...1230
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Graph (complete) has 1046 edges and 480 vertex of which 479 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 478 transition count 374
Reduce places removed 49 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 52 rules applied. Total rules applied 102 place count 429 transition count 371
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 105 place count 426 transition count 371
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 108 Pre rules applied. Total rules applied 105 place count 426 transition count 263
Deduced a syphon composed of 108 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 234 rules applied. Total rules applied 339 place count 300 transition count 263
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 362 place count 277 transition count 240
Iterating global reduction 3 with 23 rules applied. Total rules applied 385 place count 277 transition count 240
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 385 place count 277 transition count 239
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 387 place count 276 transition count 239
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 209 rules applied. Total rules applied 596 place count 170 transition count 136
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 602 place count 170 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 603 place count 169 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 604 place count 168 transition count 135
Applied a total of 604 rules in 53 ms. Remains 168 /480 variables (removed 312) and now considering 135/425 (removed 290) transitions.
// Phase 1: matrix 135 rows 168 cols
[2023-03-09 11:50:04] [INFO ] Computed 69 place invariants in 4 ms
[2023-03-09 11:50:05] [INFO ] Implicit Places using invariants in 171 ms returned [41, 42, 47, 48, 49, 50, 51, 52, 53]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 172 ms to find 9 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 159/480 places, 135/425 transitions.
Applied a total of 0 rules in 4 ms. Remains 159 /159 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 229 ms. Remains : 159/480 places, 135/425 transitions.
[2023-03-09 11:50:05] [INFO ] Flatten gal took : 6 ms
[2023-03-09 11:50:05] [INFO ] Flatten gal took : 6 ms
[2023-03-09 11:50:05] [INFO ] Input system was already deterministic with 135 transitions.
[2023-03-09 11:50:05] [INFO ] Flatten gal took : 6 ms
[2023-03-09 11:50:05] [INFO ] Flatten gal took : 6 ms
[2023-03-09 11:50:05] [INFO ] Time to serialize gal into /tmp/CTLFireability13065044366222416882.gal : 2 ms
[2023-03-09 11:50:05] [INFO ] Time to serialize properties into /tmp/CTLFireability13476594516243588266.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13065044366222416882.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13476594516243588266.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
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,100572,0.184747,9892,2,3977,5,21733,6,0,769,19441,0


Converting to forward existential form...Done !
original formula: EF((EG((((p330==0)&&(((p148==0)||(p346==0))||(p528==0)))&&(((p403==0)||(p289==0))&&(p445==1)))) * (p462==1)))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * (p462==1)),(((p330==0)&&(((p148==0)||(p346==0))||(p528==0)))&&(((p403==0)||(p289==0))&&...177
(forward)formula 0,0,0.893715,34400,1,0,9,117316,19,3,4391,37227,6
FORMULA BusinessProcesses-PT-11-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 452 transition count 397
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 452 transition count 397
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 438 transition count 383
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 438 transition count 383
Applied a total of 84 rules in 24 ms. Remains 438 /480 variables (removed 42) and now considering 383/425 (removed 42) transitions.
// Phase 1: matrix 383 rows 438 cols
[2023-03-09 11:50:06] [INFO ] Computed 91 place invariants in 7 ms
[2023-03-09 11:50:06] [INFO ] Implicit Places using invariants in 203 ms returned []
[2023-03-09 11:50:06] [INFO ] Invariant cache hit.
[2023-03-09 11:50:06] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 761 ms to find 0 implicit places.
[2023-03-09 11:50:06] [INFO ] Invariant cache hit.
[2023-03-09 11:50:07] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 438/480 places, 383/425 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1021 ms. Remains : 438/480 places, 383/425 transitions.
[2023-03-09 11:50:07] [INFO ] Flatten gal took : 12 ms
[2023-03-09 11:50:07] [INFO ] Flatten gal took : 13 ms
[2023-03-09 11:50:07] [INFO ] Input system was already deterministic with 383 transitions.
[2023-03-09 11:50:07] [INFO ] Flatten gal took : 8 ms
[2023-03-09 11:50:07] [INFO ] Flatten gal took : 14 ms
[2023-03-09 11:50:07] [INFO ] Time to serialize gal into /tmp/CTLFireability1274750113561120413.gal : 7 ms
[2023-03-09 11:50:07] [INFO ] Time to serialize properties into /tmp/CTLFireability5456792616282198841.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1274750113561120413.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5456792616282198841.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2023-03-09 11:50:37] [INFO ] Flatten gal took : 21 ms
[2023-03-09 11:50:37] [INFO ] Applying decomposition
[2023-03-09 11:50:37] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8248496767729736053.txt' '-o' '/tmp/graph8248496767729736053.bin' '-w' '/tmp/graph8248496767729736053.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8248496767729736053.bin' '-l' '-1' '-v' '-w' '/tmp/graph8248496767729736053.weights' '-q' '0' '-e' '0.001'
[2023-03-09 11:50:37] [INFO ] Decomposing Gal with order
[2023-03-09 11:50:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 11:50:37] [INFO ] Removed a total of 250 redundant transitions.
[2023-03-09 11:50:37] [INFO ] Flatten gal took : 25 ms
[2023-03-09 11:50:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 7 ms.
[2023-03-09 11:50:37] [INFO ] Time to serialize gal into /tmp/CTLFireability17195985758448831635.gal : 6 ms
[2023-03-09 11:50:37] [INFO ] Time to serialize properties into /tmp/CTLFireability16414536255446183784.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17195985758448831635.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16414536255446183784.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.1963e+22,2.41095,47944,4681,59,70809,573,1036,261747,61,1486,0


Converting to forward existential form...Done !
original formula: (AX((i4.i1.u46.p141==1)) + EF(EG((i6.u62.p185==1))))
=> equivalent forward existential formula: [(EY((Init * !(E(TRUE U EG((i6.u62.p185==1)))))) * !((i4.i1.u46.p141==1)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t150, t162, t170, t178, t190, t206, t222, t248, t375, t376, t378, i0.i0.u77.t...1222
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,0,14.7067,233008,1,0,436140,573,6398,1.07158e+06,292,1490,958633
FORMULA BusinessProcesses-PT-11-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 452 transition count 397
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 452 transition count 397
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 438 transition count 383
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 438 transition count 383
Applied a total of 84 rules in 22 ms. Remains 438 /480 variables (removed 42) and now considering 383/425 (removed 42) transitions.
[2023-03-09 11:50:52] [INFO ] Invariant cache hit.
[2023-03-09 11:50:52] [INFO ] Implicit Places using invariants in 274 ms returned []
[2023-03-09 11:50:52] [INFO ] Invariant cache hit.
[2023-03-09 11:50:53] [INFO ] Implicit Places using invariants and state equation in 627 ms returned []
Implicit Place search using SMT with State Equation took 904 ms to find 0 implicit places.
[2023-03-09 11:50:53] [INFO ] Invariant cache hit.
[2023-03-09 11:50:53] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 438/480 places, 383/425 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1181 ms. Remains : 438/480 places, 383/425 transitions.
[2023-03-09 11:50:53] [INFO ] Flatten gal took : 11 ms
[2023-03-09 11:50:53] [INFO ] Flatten gal took : 11 ms
[2023-03-09 11:50:53] [INFO ] Input system was already deterministic with 383 transitions.
[2023-03-09 11:50:53] [INFO ] Flatten gal took : 10 ms
[2023-03-09 11:50:53] [INFO ] Flatten gal took : 11 ms
[2023-03-09 11:50:53] [INFO ] Time to serialize gal into /tmp/CTLFireability15630912472398878962.gal : 3 ms
[2023-03-09 11:50:53] [INFO ] Time to serialize properties into /tmp/CTLFireability4940502251496265031.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15630912472398878962.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4940502251496265031.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2023-03-09 11:51:23] [INFO ] Flatten gal took : 21 ms
[2023-03-09 11:51:23] [INFO ] Applying decomposition
[2023-03-09 11:51:23] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5311578222077796021.txt' '-o' '/tmp/graph5311578222077796021.bin' '-w' '/tmp/graph5311578222077796021.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5311578222077796021.bin' '-l' '-1' '-v' '-w' '/tmp/graph5311578222077796021.weights' '-q' '0' '-e' '0.001'
[2023-03-09 11:51:23] [INFO ] Decomposing Gal with order
[2023-03-09 11:51:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 11:51:23] [INFO ] Removed a total of 248 redundant transitions.
[2023-03-09 11:51:23] [INFO ] Flatten gal took : 22 ms
[2023-03-09 11:51:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 9 ms.
[2023-03-09 11:51:23] [INFO ] Time to serialize gal into /tmp/CTLFireability10416616898426972539.gal : 5 ms
[2023-03-09 11:51:23] [INFO ] Time to serialize properties into /tmp/CTLFireability5078829997660376780.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10416616898426972539.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5078829997660376780.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.1963e+22,1.11396,30224,3355,71,52707,1216,1020,105562,66,2819,0


Converting to forward existential form...Done !
original formula: AG((!(E((i5.i0.u12.p30==1) U (i7.i1.u59.p173==1))) + AX(FALSE)))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !(!(E((i5.i0.u12.p30==1) U (i7.i1.u59.p173==1)))))) * !(FALSE))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t150, t162, t174, t190, t198, t206, t218, t222, t248, t374, t376, t378, i0.t1...1207
(forward)formula 0,0,4.33636,118928,1,0,219215,1380,6885,577102,324,3010,560462
FORMULA BusinessProcesses-PT-11-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

[2023-03-09 11:51:28] [INFO ] Flatten gal took : 23 ms
[2023-03-09 11:51:28] [INFO ] Flatten gal took : 20 ms
[2023-03-09 11:51:28] [INFO ] Applying decomposition
[2023-03-09 11:51:28] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14949501214370058506.txt' '-o' '/tmp/graph14949501214370058506.bin' '-w' '/tmp/graph14949501214370058506.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14949501214370058506.bin' '-l' '-1' '-v' '-w' '/tmp/graph14949501214370058506.weights' '-q' '0' '-e' '0.001'
[2023-03-09 11:51:28] [INFO ] Decomposing Gal with order
[2023-03-09 11:51:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 11:51:28] [INFO ] Removed a total of 254 redundant transitions.
[2023-03-09 11:51:28] [INFO ] Flatten gal took : 24 ms
[2023-03-09 11:51:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2023-03-09 11:51:28] [INFO ] Time to serialize gal into /tmp/CTLFireability1604857405023708953.gal : 5 ms
[2023-03-09 11:51:28] [INFO ] Time to serialize properties into /tmp/CTLFireability8245914714654872755.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1604857405023708953.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8245914714654872755.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 4 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.18058e+22,1.54543,43984,4629,62,75423,673,1179,173311,64,1881,0


Converting to forward existential form...Done !
original formula: EX(A(((i15.i0.u78.p235==1) + !(EF(EX((i16.u153.p489==1))))) U AG(!(E((i11.i2.u90.p261==1) U (i10.i0.u42.p130==1))))))
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(!(E(TRUE U !(!(E((i11.i2.u90.p261==1) U (i10.i0.u42.p130==1)))))))))) * !(E(!(!(E(TRUE U !(...360
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t9, t52, t190, t203, t211, t215, t235, t247, t255, t259, t263, t290, t416, i0.t251, i...1537
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
(forward)formula 0,0,380.805,2207192,1,0,2.79625e+06,673,2882,7.04376e+06,123,1881,655976
FORMULA BusinessProcesses-PT-11-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
Detected timeout of ITS tools.
[2023-03-09 12:14:02] [INFO ] Applying decomposition
[2023-03-09 12:14:02] [INFO ] Flatten gal took : 12 ms
[2023-03-09 12:14:02] [INFO ] Decomposing Gal with order
[2023-03-09 12:14:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 12:14:02] [INFO ] Removed a total of 131 redundant transitions.
[2023-03-09 12:14:02] [INFO ] Flatten gal took : 31 ms
[2023-03-09 12:14:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 83 ms.
[2023-03-09 12:14:02] [INFO ] Time to serialize gal into /tmp/CTLFireability16585189461153803563.gal : 13 ms
[2023-03-09 12:14:02] [INFO ] Time to serialize properties into /tmp/CTLFireability14503184921061477149.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16585189461153803563.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14503184921061477149.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 3 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.18058e+22,397.81,8112348,113627,2451,3.05697e+06,17738,1609,1.04211e+08,518,67747,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2023-03-09 12:36:40] [INFO ] Flatten gal took : 247 ms
[2023-03-09 12:36:40] [INFO ] Input system was already deterministic with 425 transitions.
[2023-03-09 12:36:41] [INFO ] Transformed 480 places.
[2023-03-09 12:36:41] [INFO ] Transformed 425 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-09 12:37:11] [INFO ] Time to serialize gal into /tmp/CTLFireability15940254735151003953.gal : 11 ms
[2023-03-09 12:37:11] [INFO ] Time to serialize properties into /tmp/CTLFireability15318887059814052359.ctl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15940254735151003953.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15318887059814052359.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...330
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 3 CTL formulae.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 9874708 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16134216 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-11"
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-5348"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-11, 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 r037-tajo-167813690500530"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-11.tgz
mv BusinessProcesses-PT-11 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 ;