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.r041-tajo-167813694800546.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 ltsminxred
Input is BusinessProcesses-PT-13, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694800546
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 16:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 16:45 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 26K 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 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 16:47 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 148K 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-13-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678644283323

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=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-13
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 18:04:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 18:04:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 18:04:45] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2023-03-12 18:04:45] [INFO ] Transformed 593 places.
[2023-03-12 18:04:45] [INFO ] Transformed 536 transitions.
[2023-03-12 18:04:45] [INFO ] Found NUPN structural information;
[2023-03-12 18:04:45] [INFO ] Parsed PT model containing 593 places and 536 transitions and 1582 arcs in 140 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Deduced a syphon composed of 8 places in 8 ms
Reduce places removed 8 places and 8 transitions.
Support contains 154 out of 585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 585/585 places, 528/528 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 580 transition count 528
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 65 place count 520 transition count 468
Iterating global reduction 1 with 60 rules applied. Total rules applied 125 place count 520 transition count 468
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 148 place count 497 transition count 445
Iterating global reduction 1 with 23 rules applied. Total rules applied 171 place count 497 transition count 445
Applied a total of 171 rules in 87 ms. Remains 497 /585 variables (removed 88) and now considering 445/528 (removed 83) transitions.
// Phase 1: matrix 445 rows 497 cols
[2023-03-12 18:04:45] [INFO ] Computed 90 place invariants in 33 ms
[2023-03-12 18:04:45] [INFO ] Implicit Places using invariants in 353 ms returned []
[2023-03-12 18:04:45] [INFO ] Invariant cache hit.
[2023-03-12 18:04:46] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 780 ms to find 0 implicit places.
[2023-03-12 18:04:46] [INFO ] Invariant cache hit.
[2023-03-12 18:04:46] [INFO ] Dead Transitions using invariants and state equation in 298 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 497/585 places, 445/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1168 ms. Remains : 497/585 places, 445/528 transitions.
Support contains 154 out of 497 places after structural reductions.
[2023-03-12 18:04:46] [INFO ] Flatten gal took : 72 ms
[2023-03-12 18:04:46] [INFO ] Flatten gal took : 36 ms
[2023-03-12 18:04:46] [INFO ] Input system was already deterministic with 445 transitions.
Support contains 152 out of 497 places (down from 154) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 72 resets, run finished after 564 ms. (steps per millisecond=17 ) properties (out of 102) seen :37
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 65) 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 65) 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 65) 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 65) 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 65) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 65) 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 65) 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 65) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 65) 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 65) 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 65) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) 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 65) seen :0
Running SMT prover for 65 properties.
[2023-03-12 18:04:47] [INFO ] Invariant cache hit.
[2023-03-12 18:04:48] [INFO ] [Real]Absence check using 52 positive place invariants in 24 ms returned sat
[2023-03-12 18:04:48] [INFO ] [Real]Absence check using 52 positive and 38 generalized place invariants in 20 ms returned sat
[2023-03-12 18:04:48] [INFO ] After 677ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:65
[2023-03-12 18:04:49] [INFO ] [Nat]Absence check using 52 positive place invariants in 18 ms returned sat
[2023-03-12 18:04:49] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 17 ms returned sat
[2023-03-12 18:04:50] [INFO ] After 1040ms SMT Verify possible using state equation in natural domain returned unsat :11 sat :54
[2023-03-12 18:04:50] [INFO ] Deduced a trap composed of 14 places in 155 ms of which 6 ms to minimize.
[2023-03-12 18:04:50] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 1 ms to minimize.
[2023-03-12 18:04:51] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 1 ms to minimize.
[2023-03-12 18:04:51] [INFO ] Deduced a trap composed of 18 places in 203 ms of which 4 ms to minimize.
[2023-03-12 18:04:51] [INFO ] Deduced a trap composed of 17 places in 206 ms of which 1 ms to minimize.
[2023-03-12 18:04:51] [INFO ] Deduced a trap composed of 21 places in 167 ms of which 2 ms to minimize.
[2023-03-12 18:04:51] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 1 ms to minimize.
[2023-03-12 18:04:51] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 1 ms to minimize.
[2023-03-12 18:04:52] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 1 ms to minimize.
[2023-03-12 18:04:52] [INFO ] Deduced a trap composed of 100 places in 161 ms of which 1 ms to minimize.
[2023-03-12 18:04:52] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 0 ms to minimize.
[2023-03-12 18:04:52] [INFO ] Deduced a trap composed of 102 places in 134 ms of which 1 ms to minimize.
[2023-03-12 18:04:52] [INFO ] Deduced a trap composed of 33 places in 153 ms of which 1 ms to minimize.
[2023-03-12 18:04:52] [INFO ] Deduced a trap composed of 102 places in 135 ms of which 1 ms to minimize.
[2023-03-12 18:04:53] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 1 ms to minimize.
[2023-03-12 18:04:53] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2539 ms
[2023-03-12 18:04:53] [INFO ] Deduced a trap composed of 100 places in 161 ms of which 1 ms to minimize.
[2023-03-12 18:04:53] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 0 ms to minimize.
[2023-03-12 18:04:53] [INFO ] Deduced a trap composed of 98 places in 145 ms of which 1 ms to minimize.
[2023-03-12 18:04:53] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 1 ms to minimize.
[2023-03-12 18:04:53] [INFO ] Deduced a trap composed of 92 places in 137 ms of which 1 ms to minimize.
[2023-03-12 18:04:54] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 0 ms to minimize.
[2023-03-12 18:04:54] [INFO ] Deduced a trap composed of 113 places in 105 ms of which 1 ms to minimize.
[2023-03-12 18:04:54] [INFO ] Deduced a trap composed of 100 places in 108 ms of which 1 ms to minimize.
[2023-03-12 18:04:54] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 1 ms to minimize.
[2023-03-12 18:04:54] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 0 ms to minimize.
[2023-03-12 18:04:54] [INFO ] Deduced a trap composed of 99 places in 115 ms of which 0 ms to minimize.
[2023-03-12 18:04:54] [INFO ] Deduced a trap composed of 102 places in 114 ms of which 1 ms to minimize.
[2023-03-12 18:04:54] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 1 ms to minimize.
[2023-03-12 18:04:55] [INFO ] Deduced a trap composed of 103 places in 108 ms of which 1 ms to minimize.
[2023-03-12 18:04:55] [INFO ] Deduced a trap composed of 99 places in 107 ms of which 0 ms to minimize.
[2023-03-12 18:04:55] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 0 ms to minimize.
[2023-03-12 18:04:55] [INFO ] Deduced a trap composed of 115 places in 132 ms of which 1 ms to minimize.
[2023-03-12 18:04:55] [INFO ] Deduced a trap composed of 99 places in 112 ms of which 1 ms to minimize.
[2023-03-12 18:04:55] [INFO ] Deduced a trap composed of 98 places in 119 ms of which 1 ms to minimize.
[2023-03-12 18:04:55] [INFO ] Deduced a trap composed of 106 places in 108 ms of which 2 ms to minimize.
[2023-03-12 18:04:56] [INFO ] Deduced a trap composed of 102 places in 109 ms of which 1 ms to minimize.
[2023-03-12 18:04:56] [INFO ] Deduced a trap composed of 98 places in 106 ms of which 1 ms to minimize.
[2023-03-12 18:04:56] [INFO ] Deduced a trap composed of 95 places in 125 ms of which 1 ms to minimize.
[2023-03-12 18:04:56] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 1 ms to minimize.
[2023-03-12 18:04:56] [INFO ] Deduced a trap composed of 99 places in 110 ms of which 1 ms to minimize.
[2023-03-12 18:04:56] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 1 ms to minimize.
[2023-03-12 18:04:56] [INFO ] Deduced a trap composed of 95 places in 110 ms of which 0 ms to minimize.
[2023-03-12 18:04:57] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 0 ms to minimize.
[2023-03-12 18:04:57] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 1 ms to minimize.
[2023-03-12 18:04:57] [INFO ] Deduced a trap composed of 100 places in 156 ms of which 1 ms to minimize.
[2023-03-12 18:04:57] [INFO ] Deduced a trap composed of 101 places in 108 ms of which 0 ms to minimize.
[2023-03-12 18:04:57] [INFO ] Deduced a trap composed of 106 places in 110 ms of which 1 ms to minimize.
[2023-03-12 18:04:57] [INFO ] Deduced a trap composed of 104 places in 106 ms of which 0 ms to minimize.
[2023-03-12 18:04:57] [INFO ] Deduced a trap composed of 101 places in 115 ms of which 1 ms to minimize.
[2023-03-12 18:04:57] [INFO ] Deduced a trap composed of 104 places in 112 ms of which 1 ms to minimize.
[2023-03-12 18:04:58] [INFO ] Deduced a trap composed of 100 places in 137 ms of which 1 ms to minimize.
[2023-03-12 18:04:58] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 1 ms to minimize.
[2023-03-12 18:04:58] [INFO ] Deduced a trap composed of 103 places in 105 ms of which 1 ms to minimize.
[2023-03-12 18:04:58] [INFO ] Deduced a trap composed of 94 places in 123 ms of which 1 ms to minimize.
[2023-03-12 18:04:58] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 0 ms to minimize.
[2023-03-12 18:04:58] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 5596 ms
[2023-03-12 18:04:58] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 0 ms to minimize.
[2023-03-12 18:04:59] [INFO ] Deduced a trap composed of 97 places in 135 ms of which 1 ms to minimize.
[2023-03-12 18:04:59] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 1 ms to minimize.
[2023-03-12 18:04:59] [INFO ] Deduced a trap composed of 102 places in 132 ms of which 1 ms to minimize.
[2023-03-12 18:04:59] [INFO ] Deduced a trap composed of 100 places in 120 ms of which 1 ms to minimize.
[2023-03-12 18:04:59] [INFO ] Deduced a trap composed of 100 places in 117 ms of which 1 ms to minimize.
[2023-03-12 18:04:59] [INFO ] Deduced a trap composed of 99 places in 104 ms of which 0 ms to minimize.
[2023-03-12 18:04:59] [INFO ] Deduced a trap composed of 101 places in 110 ms of which 1 ms to minimize.
[2023-03-12 18:04:59] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 1 ms to minimize.
[2023-03-12 18:05:00] [INFO ] Deduced a trap composed of 101 places in 103 ms of which 0 ms to minimize.
[2023-03-12 18:05:00] [INFO ] Deduced a trap composed of 100 places in 109 ms of which 3 ms to minimize.
[2023-03-12 18:05:00] [INFO ] Deduced a trap composed of 102 places in 101 ms of which 1 ms to minimize.
[2023-03-12 18:05:00] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 12 ms to minimize.
[2023-03-12 18:05:00] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1674 ms
[2023-03-12 18:05:00] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2023-03-12 18:05:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2023-03-12 18:05:00] [INFO ] Deduced a trap composed of 93 places in 142 ms of which 1 ms to minimize.
[2023-03-12 18:05:00] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 0 ms to minimize.
[2023-03-12 18:05:01] [INFO ] Deduced a trap composed of 108 places in 137 ms of which 1 ms to minimize.
[2023-03-12 18:05:01] [INFO ] Deduced a trap composed of 95 places in 128 ms of which 1 ms to minimize.
[2023-03-12 18:05:01] [INFO ] Deduced a trap composed of 93 places in 115 ms of which 1 ms to minimize.
[2023-03-12 18:05:01] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 0 ms to minimize.
[2023-03-12 18:05:01] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 0 ms to minimize.
[2023-03-12 18:05:01] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1030 ms
[2023-03-12 18:05:01] [INFO ] Deduced a trap composed of 103 places in 149 ms of which 1 ms to minimize.
[2023-03-12 18:05:02] [INFO ] Deduced a trap composed of 104 places in 127 ms of which 0 ms to minimize.
[2023-03-12 18:05:02] [INFO ] Deduced a trap composed of 111 places in 148 ms of which 1 ms to minimize.
[2023-03-12 18:05:02] [INFO ] Deduced a trap composed of 102 places in 133 ms of which 0 ms to minimize.
[2023-03-12 18:05:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 687 ms
[2023-03-12 18:05:02] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2023-03-12 18:05:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2023-03-12 18:05:02] [INFO ] Deduced a trap composed of 98 places in 163 ms of which 1 ms to minimize.
[2023-03-12 18:05:03] [INFO ] Deduced a trap composed of 102 places in 125 ms of which 0 ms to minimize.
[2023-03-12 18:05:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 373 ms
[2023-03-12 18:05:03] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 0 ms to minimize.
[2023-03-12 18:05:03] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2023-03-12 18:05:03] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2023-03-12 18:05:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 234 ms
[2023-03-12 18:05:03] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 1 ms to minimize.
[2023-03-12 18:05:03] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 1 ms to minimize.
[2023-03-12 18:05:04] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 1 ms to minimize.
[2023-03-12 18:05:04] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 1 ms to minimize.
[2023-03-12 18:05:04] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 0 ms to minimize.
[2023-03-12 18:05:04] [INFO ] Deduced a trap composed of 97 places in 146 ms of which 0 ms to minimize.
[2023-03-12 18:05:04] [INFO ] Deduced a trap composed of 99 places in 149 ms of which 0 ms to minimize.
[2023-03-12 18:05:04] [INFO ] Deduced a trap composed of 101 places in 158 ms of which 1 ms to minimize.
[2023-03-12 18:05:05] [INFO ] Deduced a trap composed of 100 places in 150 ms of which 1 ms to minimize.
[2023-03-12 18:05:05] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1389 ms
[2023-03-12 18:05:05] [INFO ] Deduced a trap composed of 102 places in 143 ms of which 1 ms to minimize.
[2023-03-12 18:05:05] [INFO ] Deduced a trap composed of 107 places in 128 ms of which 0 ms to minimize.
[2023-03-12 18:05:05] [INFO ] Deduced a trap composed of 105 places in 123 ms of which 0 ms to minimize.
[2023-03-12 18:05:05] [INFO ] Deduced a trap composed of 96 places in 155 ms of which 0 ms to minimize.
[2023-03-12 18:05:05] [INFO ] Deduced a trap composed of 98 places in 138 ms of which 0 ms to minimize.
[2023-03-12 18:05:06] [INFO ] Deduced a trap composed of 99 places in 157 ms of which 0 ms to minimize.
[2023-03-12 18:05:06] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 0 ms to minimize.
[2023-03-12 18:05:06] [INFO ] Deduced a trap composed of 95 places in 144 ms of which 1 ms to minimize.
[2023-03-12 18:05:06] [INFO ] Deduced a trap composed of 124 places in 124 ms of which 1 ms to minimize.
[2023-03-12 18:05:06] [INFO ] Deduced a trap composed of 118 places in 127 ms of which 1 ms to minimize.
[2023-03-12 18:05:06] [INFO ] Deduced a trap composed of 105 places in 138 ms of which 1 ms to minimize.
[2023-03-12 18:05:07] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 1 ms to minimize.
[2023-03-12 18:05:07] [INFO ] Deduced a trap composed of 102 places in 124 ms of which 1 ms to minimize.
[2023-03-12 18:05:07] [INFO ] Deduced a trap composed of 103 places in 132 ms of which 1 ms to minimize.
[2023-03-12 18:05:07] [INFO ] Deduced a trap composed of 106 places in 139 ms of which 1 ms to minimize.
[2023-03-12 18:05:07] [INFO ] Deduced a trap composed of 107 places in 115 ms of which 0 ms to minimize.
[2023-03-12 18:05:07] [INFO ] Deduced a trap composed of 123 places in 152 ms of which 1 ms to minimize.
[2023-03-12 18:05:07] [INFO ] Deduced a trap composed of 124 places in 119 ms of which 0 ms to minimize.
[2023-03-12 18:05:08] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 0 ms to minimize.
[2023-03-12 18:05:08] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2999 ms
[2023-03-12 18:05:08] [INFO ] Deduced a trap composed of 99 places in 147 ms of which 0 ms to minimize.
[2023-03-12 18:05:08] [INFO ] Deduced a trap composed of 102 places in 140 ms of which 1 ms to minimize.
[2023-03-12 18:05:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 385 ms
[2023-03-12 18:05:08] [INFO ] Deduced a trap composed of 118 places in 153 ms of which 0 ms to minimize.
[2023-03-12 18:05:09] [INFO ] Deduced a trap composed of 102 places in 125 ms of which 1 ms to minimize.
[2023-03-12 18:05:09] [INFO ] Deduced a trap composed of 99 places in 158 ms of which 1 ms to minimize.
[2023-03-12 18:05:09] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 0 ms to minimize.
[2023-03-12 18:05:09] [INFO ] Deduced a trap composed of 105 places in 131 ms of which 1 ms to minimize.
[2023-03-12 18:05:09] [INFO ] Deduced a trap composed of 109 places in 142 ms of which 1 ms to minimize.
[2023-03-12 18:05:09] [INFO ] Deduced a trap composed of 101 places in 157 ms of which 1 ms to minimize.
[2023-03-12 18:05:10] [INFO ] Deduced a trap composed of 101 places in 123 ms of which 1 ms to minimize.
[2023-03-12 18:05:10] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1427 ms
[2023-03-12 18:05:10] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 0 ms to minimize.
[2023-03-12 18:05:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2023-03-12 18:05:10] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2023-03-12 18:05:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-03-12 18:05:11] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 0 ms to minimize.
[2023-03-12 18:05:11] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2023-03-12 18:05:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 222 ms
[2023-03-12 18:05:11] [INFO ] Deduced a trap composed of 103 places in 163 ms of which 1 ms to minimize.
[2023-03-12 18:05:11] [INFO ] Deduced a trap composed of 121 places in 151 ms of which 1 ms to minimize.
[2023-03-12 18:05:12] [INFO ] Deduced a trap composed of 102 places in 149 ms of which 1 ms to minimize.
[2023-03-12 18:05:12] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 1 ms to minimize.
[2023-03-12 18:05:12] [INFO ] Deduced a trap composed of 127 places in 130 ms of which 0 ms to minimize.
[2023-03-12 18:05:12] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 0 ms to minimize.
[2023-03-12 18:05:12] [INFO ] Deduced a trap composed of 107 places in 124 ms of which 0 ms to minimize.
[2023-03-12 18:05:12] [INFO ] Deduced a trap composed of 100 places in 128 ms of which 0 ms to minimize.
[2023-03-12 18:05:12] [INFO ] Deduced a trap composed of 97 places in 135 ms of which 1 ms to minimize.
[2023-03-12 18:05:13] [INFO ] Deduced a trap composed of 138 places in 144 ms of which 0 ms to minimize.
[2023-03-12 18:05:13] [INFO ] Deduced a trap composed of 96 places in 145 ms of which 1 ms to minimize.
[2023-03-12 18:05:13] [INFO ] Deduced a trap composed of 102 places in 128 ms of which 1 ms to minimize.
[2023-03-12 18:05:13] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2090 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:722)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 18:05:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 18:05:13] [INFO ] After 25014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:65
Fused 65 Parikh solutions to 54 different solutions.
Parikh walk visited 37 properties in 941 ms.
Support contains 33 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 445/445 transitions.
Graph (trivial) has 213 edges and 497 vertex of which 4 / 497 are part of one of the 1 SCC in 7 ms
Free SCC test removed 3 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1093 edges and 494 vertex of which 493 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 493 transition count 386
Reduce places removed 54 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 57 rules applied. Total rules applied 113 place count 439 transition count 383
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 116 place count 436 transition count 383
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 116 place count 436 transition count 299
Deduced a syphon composed of 84 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 184 rules applied. Total rules applied 300 place count 336 transition count 299
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 324 place count 312 transition count 275
Iterating global reduction 3 with 24 rules applied. Total rules applied 348 place count 312 transition count 275
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 348 place count 312 transition count 274
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 351 place count 310 transition count 274
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 6 ms
Ensure Unique test removed 2 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 210 rules applied. Total rules applied 561 place count 204 transition count 170
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 563 place count 203 transition count 174
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 566 place count 203 transition count 171
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 569 place count 200 transition count 171
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 573 place count 200 transition count 171
Applied a total of 573 rules in 117 ms. Remains 200 /497 variables (removed 297) and now considering 171/445 (removed 274) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 200/497 places, 171/445 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 11) 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 11) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 5) seen :1
Running SMT prover for 4 properties.
// Phase 1: matrix 171 rows 200 cols
[2023-03-12 18:05:15] [INFO ] Computed 71 place invariants in 5 ms
[2023-03-12 18:05:15] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 18:05:15] [INFO ] [Nat]Absence check using 52 positive place invariants in 6 ms returned sat
[2023-03-12 18:05:15] [INFO ] [Nat]Absence check using 52 positive and 19 generalized place invariants in 4 ms returned sat
[2023-03-12 18:05:15] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 18:05:15] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-12 18:05:15] [INFO ] After 49ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 18:05:15] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2023-03-12 18:05:15] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 0 ms to minimize.
[2023-03-12 18:05:15] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2023-03-12 18:05:15] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2023-03-12 18:05:15] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2023-03-12 18:05:15] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2023-03-12 18:05:15] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 335 ms
[2023-03-12 18:05:15] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 1 ms to minimize.
[2023-03-12 18:05:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2023-03-12 18:05:16] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 1 ms to minimize.
[2023-03-12 18:05:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2023-03-12 18:05:16] [INFO ] After 699ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 76 ms.
[2023-03-12 18:05:16] [INFO ] After 981ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 14 ms.
Support contains 14 out of 200 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 171/171 transitions.
Graph (trivial) has 20 edges and 200 vertex of which 2 / 200 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 199 transition count 164
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 194 transition count 164
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 11 place count 194 transition count 155
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 19 rules applied. Total rules applied 30 place count 184 transition count 155
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 44 place count 177 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
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 46 place count 176 transition count 165
Applied a total of 46 rules in 24 ms. Remains 176 /200 variables (removed 24) and now considering 165/171 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 176/200 places, 165/171 transitions.
Incomplete random walk after 10000 steps, including 293 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 112 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 109 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 91 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 112 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 165 rows 176 cols
[2023-03-12 18:05:16] [INFO ] Computed 70 place invariants in 7 ms
[2023-03-12 18:05:16] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 18:05:16] [INFO ] [Nat]Absence check using 51 positive place invariants in 6 ms returned sat
[2023-03-12 18:05:16] [INFO ] [Nat]Absence check using 51 positive and 19 generalized place invariants in 3 ms returned sat
[2023-03-12 18:05:16] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 18:05:16] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-12 18:05:17] [INFO ] After 39ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 18:05:17] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2023-03-12 18:05:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-12 18:05:17] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 0 ms to minimize.
[2023-03-12 18:05:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-03-12 18:05:17] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 0 ms to minimize.
[2023-03-12 18:05:17] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2023-03-12 18:05:17] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2023-03-12 18:05:17] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 0 ms to minimize.
[2023-03-12 18:05:17] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 0 ms to minimize.
[2023-03-12 18:05:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 367 ms
[2023-03-12 18:05:17] [INFO ] After 573ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 66 ms.
[2023-03-12 18:05:17] [INFO ] After 804ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 9 ms.
Support contains 12 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 165/165 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 174 transition count 163
Applied a total of 4 rules in 18 ms. Remains 174 /176 variables (removed 2) and now considering 163/165 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 174/176 places, 163/165 transitions.
Incomplete random walk after 10000 steps, including 287 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 116 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 124 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 3) seen :0
Probably explored full state space saw : 31345 states, properties seen :2
Probabilistic random walk after 132223 steps, saw 31345 distinct states, run finished after 572 ms. (steps per millisecond=231 ) properties seen :2
Explored full state space saw : 31345 states, properties seen :0
Exhaustive walk after 132223 steps, saw 31345 distinct states, run finished after 384 ms. (steps per millisecond=344 ) properties seen :0
Successfully simplified 12 atomic propositions for a total of 16 simplifications.
FORMULA BusinessProcesses-PT-13-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 18:05:19] [INFO ] Flatten gal took : 29 ms
[2023-03-12 18:05:19] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-13-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 18:05:19] [INFO ] Flatten gal took : 28 ms
[2023-03-12 18:05:19] [INFO ] Input system was already deterministic with 445 transitions.
Support contains 108 out of 497 places (down from 123) after GAL structural reductions.
Computed a total of 136 stabilizing places and 129 stable transitions
Graph (complete) has 1097 edges and 497 vertex of which 496 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.18 ms
Starting structural reductions in LTL mode, iteration 0 : 497/497 places, 445/445 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 464 transition count 412
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 464 transition count 412
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 77 place count 453 transition count 401
Iterating global reduction 0 with 11 rules applied. Total rules applied 88 place count 453 transition count 401
Applied a total of 88 rules in 28 ms. Remains 453 /497 variables (removed 44) and now considering 401/445 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 453/497 places, 401/445 transitions.
[2023-03-12 18:05:19] [INFO ] Flatten gal took : 20 ms
[2023-03-12 18:05:19] [INFO ] Flatten gal took : 21 ms
[2023-03-12 18:05:19] [INFO ] Input system was already deterministic with 401 transitions.
Starting structural reductions in LTL mode, iteration 0 : 497/497 places, 445/445 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 460 transition count 408
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 460 transition count 408
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 84 place count 450 transition count 398
Iterating global reduction 0 with 10 rules applied. Total rules applied 94 place count 450 transition count 398
Applied a total of 94 rules in 24 ms. Remains 450 /497 variables (removed 47) and now considering 398/445 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 450/497 places, 398/445 transitions.
[2023-03-12 18:05:19] [INFO ] Flatten gal took : 16 ms
[2023-03-12 18:05:19] [INFO ] Flatten gal took : 17 ms
[2023-03-12 18:05:19] [INFO ] Input system was already deterministic with 398 transitions.
Starting structural reductions in LTL mode, iteration 0 : 497/497 places, 445/445 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 459 transition count 407
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 459 transition count 407
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 87 place count 448 transition count 396
Iterating global reduction 0 with 11 rules applied. Total rules applied 98 place count 448 transition count 396
Applied a total of 98 rules in 24 ms. Remains 448 /497 variables (removed 49) and now considering 396/445 (removed 49) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 448/497 places, 396/445 transitions.
[2023-03-12 18:05:19] [INFO ] Flatten gal took : 16 ms
[2023-03-12 18:05:19] [INFO ] Flatten gal took : 16 ms
[2023-03-12 18:05:19] [INFO ] Input system was already deterministic with 396 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 497/497 places, 445/445 transitions.
Graph (trivial) has 253 edges and 497 vertex of which 7 / 497 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1090 edges and 491 vertex of which 490 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 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 71 place count 489 transition count 367
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 140 place count 420 transition count 367
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 92 Pre rules applied. Total rules applied 140 place count 420 transition count 275
Deduced a syphon composed of 92 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 2 with 201 rules applied. Total rules applied 341 place count 311 transition count 275
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 373 place count 279 transition count 243
Iterating global reduction 2 with 32 rules applied. Total rules applied 405 place count 279 transition count 243
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 405 place count 279 transition count 238
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 417 place count 272 transition count 238
Performed 108 Post agglomeration using F-continuation condition.Transition count delta: 108
Deduced a syphon composed of 108 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 218 rules applied. Total rules applied 635 place count 162 transition count 130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 637 place count 161 transition count 129
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 638 place count 160 transition count 128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 639 place count 159 transition count 128
Applied a total of 639 rules in 54 ms. Remains 159 /497 variables (removed 338) and now considering 128/445 (removed 317) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 55 ms. Remains : 159/497 places, 128/445 transitions.
[2023-03-12 18:05:19] [INFO ] Flatten gal took : 8 ms
[2023-03-12 18:05:19] [INFO ] Flatten gal took : 7 ms
[2023-03-12 18:05:19] [INFO ] Input system was already deterministic with 128 transitions.
Incomplete random walk after 10000 steps, including 2124 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 643 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Finished probabilistic random walk after 218 steps, run visited all 1 properties in 5 ms. (steps per millisecond=43 )
Probabilistic random walk after 218 steps, saw 142 distinct states, run finished after 5 ms. (steps per millisecond=43 ) properties seen :1
FORMULA BusinessProcesses-PT-13-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 497/497 places, 445/445 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 462 transition count 410
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 462 transition count 410
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 80 place count 452 transition count 400
Iterating global reduction 0 with 10 rules applied. Total rules applied 90 place count 452 transition count 400
Applied a total of 90 rules in 26 ms. Remains 452 /497 variables (removed 45) and now considering 400/445 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 452/497 places, 400/445 transitions.
[2023-03-12 18:05:19] [INFO ] Flatten gal took : 14 ms
[2023-03-12 18:05:19] [INFO ] Flatten gal took : 14 ms
[2023-03-12 18:05:19] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 497/497 places, 445/445 transitions.
Graph (trivial) has 248 edges and 497 vertex of which 7 / 497 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1090 edges and 491 vertex of which 490 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 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 489 transition count 370
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 134 place count 423 transition count 370
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 89 Pre rules applied. Total rules applied 134 place count 423 transition count 281
Deduced a syphon composed of 89 places in 0 ms
Ensure Unique test removed 15 places
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 2 with 193 rules applied. Total rules applied 327 place count 319 transition count 281
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 359 place count 287 transition count 249
Iterating global reduction 2 with 32 rules applied. Total rules applied 391 place count 287 transition count 249
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 391 place count 287 transition count 243
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 405 place count 279 transition count 243
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 2 places
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 2 with 206 rules applied. Total rules applied 611 place count 175 transition count 141
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 613 place count 174 transition count 140
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 614 place count 173 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 615 place count 172 transition count 139
Applied a total of 615 rules in 53 ms. Remains 172 /497 variables (removed 325) and now considering 139/445 (removed 306) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53 ms. Remains : 172/497 places, 139/445 transitions.
[2023-03-12 18:05:19] [INFO ] Flatten gal took : 7 ms
[2023-03-12 18:05:19] [INFO ] Flatten gal took : 7 ms
[2023-03-12 18:05:19] [INFO ] Input system was already deterministic with 139 transitions.
Starting structural reductions in LTL mode, iteration 0 : 497/497 places, 445/445 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 460 transition count 408
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 460 transition count 408
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 85 place count 449 transition count 397
Iterating global reduction 0 with 11 rules applied. Total rules applied 96 place count 449 transition count 397
Applied a total of 96 rules in 23 ms. Remains 449 /497 variables (removed 48) and now considering 397/445 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 449/497 places, 397/445 transitions.
[2023-03-12 18:05:19] [INFO ] Flatten gal took : 13 ms
[2023-03-12 18:05:19] [INFO ] Flatten gal took : 13 ms
[2023-03-12 18:05:19] [INFO ] Input system was already deterministic with 397 transitions.
Starting structural reductions in LTL mode, iteration 0 : 497/497 places, 445/445 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 461 transition count 409
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 461 transition count 409
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 84 place count 449 transition count 397
Iterating global reduction 0 with 12 rules applied. Total rules applied 96 place count 449 transition count 397
Applied a total of 96 rules in 23 ms. Remains 449 /497 variables (removed 48) and now considering 397/445 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 449/497 places, 397/445 transitions.
[2023-03-12 18:05:19] [INFO ] Flatten gal took : 12 ms
[2023-03-12 18:05:19] [INFO ] Flatten gal took : 12 ms
[2023-03-12 18:05:19] [INFO ] Input system was already deterministic with 397 transitions.
Starting structural reductions in LTL mode, iteration 0 : 497/497 places, 445/445 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 458 transition count 406
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 458 transition count 406
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 90 place count 446 transition count 394
Iterating global reduction 0 with 12 rules applied. Total rules applied 102 place count 446 transition count 394
Applied a total of 102 rules in 26 ms. Remains 446 /497 variables (removed 51) and now considering 394/445 (removed 51) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 446/497 places, 394/445 transitions.
[2023-03-12 18:05:19] [INFO ] Flatten gal took : 11 ms
[2023-03-12 18:05:19] [INFO ] Flatten gal took : 11 ms
[2023-03-12 18:05:20] [INFO ] Input system was already deterministic with 394 transitions.
Starting structural reductions in LTL mode, iteration 0 : 497/497 places, 445/445 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 460 transition count 408
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 460 transition count 408
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 84 place count 450 transition count 398
Iterating global reduction 0 with 10 rules applied. Total rules applied 94 place count 450 transition count 398
Applied a total of 94 rules in 24 ms. Remains 450 /497 variables (removed 47) and now considering 398/445 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 450/497 places, 398/445 transitions.
[2023-03-12 18:05:20] [INFO ] Flatten gal took : 12 ms
[2023-03-12 18:05:20] [INFO ] Flatten gal took : 16 ms
[2023-03-12 18:05:20] [INFO ] Input system was already deterministic with 398 transitions.
Starting structural reductions in LTL mode, iteration 0 : 497/497 places, 445/445 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 459 transition count 407
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 459 transition count 407
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 88 place count 447 transition count 395
Iterating global reduction 0 with 12 rules applied. Total rules applied 100 place count 447 transition count 395
Applied a total of 100 rules in 23 ms. Remains 447 /497 variables (removed 50) and now considering 395/445 (removed 50) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 447/497 places, 395/445 transitions.
[2023-03-12 18:05:20] [INFO ] Flatten gal took : 11 ms
[2023-03-12 18:05:20] [INFO ] Flatten gal took : 12 ms
[2023-03-12 18:05:20] [INFO ] Input system was already deterministic with 395 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 497/497 places, 445/445 transitions.
Graph (trivial) has 246 edges and 497 vertex of which 7 / 497 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1090 edges and 491 vertex of which 490 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 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 489 transition count 371
Reduce places removed 65 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 67 rules applied. Total rules applied 134 place count 424 transition count 369
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 136 place count 422 transition count 369
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 88 Pre rules applied. Total rules applied 136 place count 422 transition count 281
Deduced a syphon composed of 88 places in 0 ms
Ensure Unique test removed 15 places
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 3 with 191 rules applied. Total rules applied 327 place count 319 transition count 281
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 357 place count 289 transition count 251
Iterating global reduction 3 with 30 rules applied. Total rules applied 387 place count 289 transition count 251
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 387 place count 289 transition count 246
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 398 place count 283 transition count 246
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 2 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 212 rules applied. Total rules applied 610 place count 176 transition count 141
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 612 place count 175 transition count 140
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 613 place count 174 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 614 place count 173 transition count 139
Applied a total of 614 rules in 45 ms. Remains 173 /497 variables (removed 324) and now considering 139/445 (removed 306) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45 ms. Remains : 173/497 places, 139/445 transitions.
[2023-03-12 18:05:20] [INFO ] Flatten gal took : 6 ms
[2023-03-12 18:05:20] [INFO ] Flatten gal took : 6 ms
[2023-03-12 18:05:20] [INFO ] Input system was already deterministic with 139 transitions.
Starting structural reductions in LTL mode, iteration 0 : 497/497 places, 445/445 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 458 transition count 406
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 458 transition count 406
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 90 place count 446 transition count 394
Iterating global reduction 0 with 12 rules applied. Total rules applied 102 place count 446 transition count 394
Applied a total of 102 rules in 22 ms. Remains 446 /497 variables (removed 51) and now considering 394/445 (removed 51) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 446/497 places, 394/445 transitions.
[2023-03-12 18:05:20] [INFO ] Flatten gal took : 11 ms
[2023-03-12 18:05:20] [INFO ] Flatten gal took : 11 ms
[2023-03-12 18:05:20] [INFO ] Input system was already deterministic with 394 transitions.
Starting structural reductions in LTL mode, iteration 0 : 497/497 places, 445/445 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 459 transition count 407
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 459 transition count 407
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 88 place count 447 transition count 395
Iterating global reduction 0 with 12 rules applied. Total rules applied 100 place count 447 transition count 395
Applied a total of 100 rules in 22 ms. Remains 447 /497 variables (removed 50) and now considering 395/445 (removed 50) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 447/497 places, 395/445 transitions.
[2023-03-12 18:05:20] [INFO ] Flatten gal took : 10 ms
[2023-03-12 18:05:20] [INFO ] Flatten gal took : 11 ms
[2023-03-12 18:05:20] [INFO ] Input system was already deterministic with 395 transitions.
[2023-03-12 18:05:20] [INFO ] Flatten gal took : 11 ms
[2023-03-12 18:05:20] [INFO ] Flatten gal took : 12 ms
[2023-03-12 18:05:20] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-12 18:05:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 497 places, 445 transitions and 1395 arcs took 2 ms.
Total runtime 35451 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/967/ctl_0_ --ctl=/tmp/967/ctl_1_ --ctl=/tmp/967/ctl_2_ --ctl=/tmp/967/ctl_3_ --ctl=/tmp/967/ctl_4_ --ctl=/tmp/967/ctl_5_ --ctl=/tmp/967/ctl_6_ --ctl=/tmp/967/ctl_7_ --ctl=/tmp/967/ctl_8_ --ctl=/tmp/967/ctl_9_ --ctl=/tmp/967/ctl_10_ --ctl=/tmp/967/ctl_11_ --ctl=/tmp/967/ctl_12_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 11678084 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16101500 kB

BK_TIME_CONFINEMENT_REACHED

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2023

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-13"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BusinessProcesses-PT-13, 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 r041-tajo-167813694800546"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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