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-167813694900594.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-19, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694900594
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.0K Feb 25 16:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 16:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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 25K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 25 16:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:46 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 189K 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-19-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678649062768

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-19
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 19:24:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 19:24:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 19:24:24] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2023-03-12 19:24:24] [INFO ] Transformed 772 places.
[2023-03-12 19:24:24] [INFO ] Transformed 685 transitions.
[2023-03-12 19:24:24] [INFO ] Found NUPN structural information;
[2023-03-12 19:24:24] [INFO ] Parsed PT model containing 772 places and 685 transitions and 1981 arcs in 143 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Deduced a syphon composed of 15 places in 18 ms
Reduce places removed 15 places and 15 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-19-CTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 110 out of 757 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 757/757 places, 670/670 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 749 transition count 670
Discarding 93 places :
Symmetric choice reduction at 1 with 93 rule applications. Total rules 101 place count 656 transition count 577
Iterating global reduction 1 with 93 rules applied. Total rules applied 194 place count 656 transition count 577
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 235 place count 615 transition count 536
Iterating global reduction 1 with 41 rules applied. Total rules applied 276 place count 615 transition count 536
Applied a total of 276 rules in 130 ms. Remains 615 /757 variables (removed 142) and now considering 536/670 (removed 134) transitions.
// Phase 1: matrix 536 rows 615 cols
[2023-03-12 19:24:24] [INFO ] Computed 117 place invariants in 34 ms
[2023-03-12 19:24:25] [INFO ] Implicit Places using invariants in 407 ms returned []
[2023-03-12 19:24:25] [INFO ] Invariant cache hit.
[2023-03-12 19:24:25] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 947 ms to find 0 implicit places.
[2023-03-12 19:24:25] [INFO ] Invariant cache hit.
[2023-03-12 19:24:26] [INFO ] Dead Transitions using invariants and state equation in 317 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 615/757 places, 536/670 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1396 ms. Remains : 615/757 places, 536/670 transitions.
Support contains 110 out of 615 places after structural reductions.
[2023-03-12 19:24:26] [INFO ] Flatten gal took : 71 ms
[2023-03-12 19:24:26] [INFO ] Flatten gal took : 33 ms
[2023-03-12 19:24:26] [INFO ] Input system was already deterministic with 536 transitions.
Support contains 109 out of 615 places (down from 110) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 55 resets, run finished after 503 ms. (steps per millisecond=19 ) properties (out of 70) seen :33
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 37) 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 37) 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 37) 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 37) 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 37) 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 37) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 37) 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 37) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 37) 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 37) 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 37) 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 37) 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 37) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 37) 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 37) 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 37) 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 37) 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 37) 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 37) 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 37) 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 37) 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 37) 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 37) 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 37) 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 37) 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 37) 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 37) 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 37) 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 37) 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 37) 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 37) 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 37) 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 37) 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 37) 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 37) 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 37) 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 37) seen :0
Running SMT prover for 37 properties.
[2023-03-12 19:24:27] [INFO ] Invariant cache hit.
[2023-03-12 19:24:27] [INFO ] [Real]Absence check using 70 positive place invariants in 21 ms returned sat
[2023-03-12 19:24:27] [INFO ] [Real]Absence check using 70 positive and 47 generalized place invariants in 15 ms returned sat
[2023-03-12 19:24:28] [INFO ] After 419ms SMT Verify possible using state equation in real domain returned unsat :3 sat :1 real:33
[2023-03-12 19:24:28] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 6 ms to minimize.
[2023-03-12 19:24:28] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 0 ms to minimize.
[2023-03-12 19:24:28] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 1 ms to minimize.
[2023-03-12 19:24:28] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2023-03-12 19:24:28] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 0 ms to minimize.
[2023-03-12 19:24:28] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 0 ms to minimize.
[2023-03-12 19:24:29] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 1 ms to minimize.
[2023-03-12 19:24:29] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 1 ms to minimize.
[2023-03-12 19:24:29] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 1 ms to minimize.
[2023-03-12 19:24:29] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 0 ms to minimize.
[2023-03-12 19:24:29] [INFO ] Deduced a trap composed of 55 places in 70 ms of which 0 ms to minimize.
[2023-03-12 19:24:29] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2023-03-12 19:24:29] [INFO ] Deduced a trap composed of 60 places in 68 ms of which 0 ms to minimize.
[2023-03-12 19:24:29] [INFO ] Deduced a trap composed of 85 places in 65 ms of which 1 ms to minimize.
[2023-03-12 19:24:29] [INFO ] Deduced a trap composed of 88 places in 71 ms of which 1 ms to minimize.
[2023-03-12 19:24:29] [INFO ] Deduced a trap composed of 80 places in 69 ms of which 1 ms to minimize.
[2023-03-12 19:24:29] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1821 ms
[2023-03-12 19:24:29] [INFO ] After 2266ms SMT Verify possible using trap constraints in real domain returned unsat :3 sat :0 real:34
[2023-03-12 19:24:29] [INFO ] After 2812ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:34
[2023-03-12 19:24:30] [INFO ] [Nat]Absence check using 70 positive place invariants in 22 ms returned sat
[2023-03-12 19:24:30] [INFO ] [Nat]Absence check using 70 positive and 47 generalized place invariants in 15 ms returned sat
[2023-03-12 19:24:31] [INFO ] After 861ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :28
[2023-03-12 19:24:31] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2023-03-12 19:24:31] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2023-03-12 19:24:31] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 0 ms to minimize.
[2023-03-12 19:24:31] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 0 ms to minimize.
[2023-03-12 19:24:32] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 0 ms to minimize.
[2023-03-12 19:24:32] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 1 ms to minimize.
[2023-03-12 19:24:32] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 1 ms to minimize.
[2023-03-12 19:24:32] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2023-03-12 19:24:32] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 0 ms to minimize.
[2023-03-12 19:24:32] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2023-03-12 19:24:32] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 1 ms to minimize.
[2023-03-12 19:24:32] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 0 ms to minimize.
[2023-03-12 19:24:32] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 1 ms to minimize.
[2023-03-12 19:24:33] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 0 ms to minimize.
[2023-03-12 19:24:33] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 0 ms to minimize.
[2023-03-12 19:24:33] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 0 ms to minimize.
[2023-03-12 19:24:33] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1731 ms
[2023-03-12 19:24:33] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 0 ms to minimize.
[2023-03-12 19:24:33] [INFO ] Deduced a trap composed of 46 places in 76 ms of which 1 ms to minimize.
[2023-03-12 19:24:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 222 ms
[2023-03-12 19:24:33] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 2 ms to minimize.
[2023-03-12 19:24:33] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 1 ms to minimize.
[2023-03-12 19:24:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 240 ms
[2023-03-12 19:24:34] [INFO ] Deduced a trap composed of 107 places in 101 ms of which 1 ms to minimize.
[2023-03-12 19:24:34] [INFO ] Deduced a trap composed of 105 places in 139 ms of which 0 ms to minimize.
[2023-03-12 19:24:34] [INFO ] Deduced a trap composed of 103 places in 161 ms of which 1 ms to minimize.
[2023-03-12 19:24:34] [INFO ] Deduced a trap composed of 108 places in 112 ms of which 1 ms to minimize.
[2023-03-12 19:24:34] [INFO ] Deduced a trap composed of 108 places in 116 ms of which 1 ms to minimize.
[2023-03-12 19:24:34] [INFO ] Deduced a trap composed of 106 places in 122 ms of which 1 ms to minimize.
[2023-03-12 19:24:35] [INFO ] Deduced a trap composed of 103 places in 114 ms of which 1 ms to minimize.
[2023-03-12 19:24:35] [INFO ] Deduced a trap composed of 105 places in 150 ms of which 1 ms to minimize.
[2023-03-12 19:24:35] [INFO ] Deduced a trap composed of 107 places in 149 ms of which 1 ms to minimize.
[2023-03-12 19:24:35] [INFO ] Deduced a trap composed of 109 places in 115 ms of which 1 ms to minimize.
[2023-03-12 19:24:35] [INFO ] Deduced a trap composed of 111 places in 160 ms of which 1 ms to minimize.
[2023-03-12 19:24:35] [INFO ] Deduced a trap composed of 103 places in 132 ms of which 0 ms to minimize.
[2023-03-12 19:24:36] [INFO ] Deduced a trap composed of 101 places in 145 ms of which 1 ms to minimize.
[2023-03-12 19:24:36] [INFO ] Deduced a trap composed of 103 places in 116 ms of which 0 ms to minimize.
[2023-03-12 19:24:36] [INFO ] Deduced a trap composed of 107 places in 154 ms of which 2 ms to minimize.
[2023-03-12 19:24:36] [INFO ] Deduced a trap composed of 108 places in 125 ms of which 1 ms to minimize.
[2023-03-12 19:24:36] [INFO ] Deduced a trap composed of 112 places in 117 ms of which 0 ms to minimize.
[2023-03-12 19:24:36] [INFO ] Deduced a trap composed of 108 places in 116 ms of which 0 ms to minimize.
[2023-03-12 19:24:36] [INFO ] Deduced a trap composed of 108 places in 134 ms of which 1 ms to minimize.
[2023-03-12 19:24:37] [INFO ] Deduced a trap composed of 108 places in 136 ms of which 8 ms to minimize.
[2023-03-12 19:24:37] [INFO ] Deduced a trap composed of 106 places in 159 ms of which 2 ms to minimize.
[2023-03-12 19:24:37] [INFO ] Deduced a trap composed of 113 places in 108 ms of which 1 ms to minimize.
[2023-03-12 19:24:37] [INFO ] Deduced a trap composed of 116 places in 119 ms of which 0 ms to minimize.
[2023-03-12 19:24:37] [INFO ] Deduced a trap composed of 109 places in 132 ms of which 0 ms to minimize.
[2023-03-12 19:24:37] [INFO ] Deduced a trap composed of 107 places in 128 ms of which 0 ms to minimize.
[2023-03-12 19:24:38] [INFO ] Deduced a trap composed of 105 places in 116 ms of which 0 ms to minimize.
[2023-03-12 19:24:38] [INFO ] Deduced a trap composed of 109 places in 123 ms of which 0 ms to minimize.
[2023-03-12 19:24:38] [INFO ] Deduced a trap composed of 111 places in 125 ms of which 2 ms to minimize.
[2023-03-12 19:24:38] [INFO ] Deduced a trap composed of 110 places in 118 ms of which 0 ms to minimize.
[2023-03-12 19:24:38] [INFO ] Deduced a trap composed of 116 places in 123 ms of which 2 ms to minimize.
[2023-03-12 19:24:38] [INFO ] Deduced a trap composed of 109 places in 139 ms of which 1 ms to minimize.
[2023-03-12 19:24:38] [INFO ] Deduced a trap composed of 112 places in 125 ms of which 1 ms to minimize.
[2023-03-12 19:24:39] [INFO ] Deduced a trap composed of 112 places in 136 ms of which 1 ms to minimize.
[2023-03-12 19:24:39] [INFO ] Deduced a trap composed of 107 places in 123 ms of which 0 ms to minimize.
[2023-03-12 19:24:39] [INFO ] Deduced a trap composed of 104 places in 134 ms of which 1 ms to minimize.
[2023-03-12 19:24:39] [INFO ] Deduced a trap composed of 106 places in 120 ms of which 0 ms to minimize.
[2023-03-12 19:24:39] [INFO ] Deduced a trap composed of 108 places in 151 ms of which 1 ms to minimize.
[2023-03-12 19:24:39] [INFO ] Deduced a trap composed of 108 places in 134 ms of which 0 ms to minimize.
[2023-03-12 19:24:40] [INFO ] Deduced a trap composed of 104 places in 113 ms of which 1 ms to minimize.
[2023-03-12 19:24:40] [INFO ] Deduced a trap composed of 103 places in 112 ms of which 1 ms to minimize.
[2023-03-12 19:24:40] [INFO ] Deduced a trap composed of 110 places in 116 ms of which 0 ms to minimize.
[2023-03-12 19:24:40] [INFO ] Deduced a trap composed of 110 places in 112 ms of which 0 ms to minimize.
[2023-03-12 19:24:40] [INFO ] Deduced a trap composed of 109 places in 118 ms of which 0 ms to minimize.
[2023-03-12 19:24:40] [INFO ] Deduced a trap composed of 104 places in 143 ms of which 1 ms to minimize.
[2023-03-12 19:24:40] [INFO ] Deduced a trap composed of 114 places in 127 ms of which 6 ms to minimize.
[2023-03-12 19:24:41] [INFO ] Deduced a trap composed of 108 places in 113 ms of which 0 ms to minimize.
[2023-03-12 19:24:41] [INFO ] Deduced a trap composed of 114 places in 110 ms of which 1 ms to minimize.
[2023-03-12 19:24:41] [INFO ] Deduced a trap composed of 110 places in 113 ms of which 1 ms to minimize.
[2023-03-12 19:24:41] [INFO ] Deduced a trap composed of 109 places in 114 ms of which 1 ms to minimize.
[2023-03-12 19:24:41] [INFO ] Deduced a trap composed of 109 places in 113 ms of which 1 ms to minimize.
[2023-03-12 19:24:41] [INFO ] Deduced a trap composed of 107 places in 113 ms of which 1 ms to minimize.
[2023-03-12 19:24:41] [INFO ] Deduced a trap composed of 102 places in 97 ms of which 0 ms to minimize.
[2023-03-12 19:24:41] [INFO ] Deduced a trap composed of 103 places in 98 ms of which 0 ms to minimize.
[2023-03-12 19:24:42] [INFO ] Deduced a trap composed of 104 places in 97 ms of which 0 ms to minimize.
[2023-03-12 19:24:42] [INFO ] Deduced a trap composed of 101 places in 94 ms of which 1 ms to minimize.
[2023-03-12 19:24:42] [INFO ] Deduced a trap composed of 111 places in 93 ms of which 0 ms to minimize.
[2023-03-12 19:24:42] [INFO ] Deduced a trap composed of 106 places in 95 ms of which 1 ms to minimize.
[2023-03-12 19:24:42] [INFO ] Deduced a trap composed of 110 places in 97 ms of which 0 ms to minimize.
[2023-03-12 19:24:42] [INFO ] Deduced a trap composed of 115 places in 94 ms of which 1 ms to minimize.
[2023-03-12 19:24:42] [INFO ] Deduced a trap composed of 110 places in 96 ms of which 0 ms to minimize.
[2023-03-12 19:24:42] [INFO ] Deduced a trap composed of 107 places in 94 ms of which 0 ms to minimize.
[2023-03-12 19:24:43] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 0 ms to minimize.
[2023-03-12 19:24:43] [INFO ] Deduced a trap composed of 105 places in 106 ms of which 0 ms to minimize.
[2023-03-12 19:24:43] [INFO ] Deduced a trap composed of 107 places in 109 ms of which 1 ms to minimize.
[2023-03-12 19:24:43] [INFO ] Deduced a trap composed of 105 places in 99 ms of which 0 ms to minimize.
[2023-03-12 19:24:43] [INFO ] Deduced a trap composed of 103 places in 96 ms of which 0 ms to minimize.
[2023-03-12 19:24:43] [INFO ] Deduced a trap composed of 111 places in 108 ms of which 0 ms to minimize.
[2023-03-12 19:24:43] [INFO ] Deduced a trap composed of 112 places in 110 ms of which 0 ms to minimize.
[2023-03-12 19:24:44] [INFO ] Deduced a trap composed of 109 places in 109 ms of which 0 ms to minimize.
[2023-03-12 19:24:44] [INFO ] Deduced a trap composed of 109 places in 106 ms of which 0 ms to minimize.
[2023-03-12 19:24:44] [INFO ] Deduced a trap composed of 107 places in 109 ms of which 1 ms to minimize.
[2023-03-12 19:24:44] [INFO ] Deduced a trap composed of 109 places in 118 ms of which 1 ms to minimize.
[2023-03-12 19:24:44] [INFO ] Deduced a trap composed of 112 places in 93 ms of which 0 ms to minimize.
[2023-03-12 19:24:44] [INFO ] Deduced a trap composed of 110 places in 144 ms of which 1 ms to minimize.
[2023-03-12 19:24:44] [INFO ] Deduced a trap composed of 109 places in 127 ms of which 1 ms to minimize.
[2023-03-12 19:24:45] [INFO ] Deduced a trap composed of 106 places in 156 ms of which 1 ms to minimize.
[2023-03-12 19:24:45] [INFO ] Trap strengthening (SAT) tested/added 77/76 trap constraints in 11124 ms
[2023-03-12 19:24:45] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 1 ms to minimize.
[2023-03-12 19:24:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2023-03-12 19:24:45] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 1 ms to minimize.
[2023-03-12 19:24:45] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 1 ms to minimize.
[2023-03-12 19:24:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 276 ms
[2023-03-12 19:24:46] [INFO ] Deduced a trap composed of 112 places in 151 ms of which 0 ms to minimize.
[2023-03-12 19:24:46] [INFO ] Deduced a trap composed of 113 places in 169 ms of which 0 ms to minimize.
[2023-03-12 19:24:46] [INFO ] Deduced a trap composed of 117 places in 172 ms of which 1 ms to minimize.
[2023-03-12 19:24:46] [INFO ] Deduced a trap composed of 110 places in 156 ms of which 1 ms to minimize.
[2023-03-12 19:24:46] [INFO ] Deduced a trap composed of 113 places in 136 ms of which 1 ms to minimize.
[2023-03-12 19:24:47] [INFO ] Deduced a trap composed of 110 places in 165 ms of which 1 ms to minimize.
[2023-03-12 19:24:47] [INFO ] Deduced a trap composed of 112 places in 144 ms of which 0 ms to minimize.
[2023-03-12 19:24:47] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1363 ms
[2023-03-12 19:24:47] [INFO ] Deduced a trap composed of 104 places in 172 ms of which 1 ms to minimize.
[2023-03-12 19:24:47] [INFO ] Deduced a trap composed of 108 places in 172 ms of which 1 ms to minimize.
[2023-03-12 19:24:48] [INFO ] Deduced a trap composed of 132 places in 170 ms of which 1 ms to minimize.
[2023-03-12 19:24:48] [INFO ] Deduced a trap composed of 104 places in 148 ms of which 1 ms to minimize.
[2023-03-12 19:24:48] [INFO ] Deduced a trap composed of 138 places in 173 ms of which 0 ms to minimize.
[2023-03-12 19:24:48] [INFO ] Deduced a trap composed of 111 places in 146 ms of which 1 ms to minimize.
[2023-03-12 19:24:48] [INFO ] Deduced a trap composed of 134 places in 141 ms of which 1 ms to minimize.
[2023-03-12 19:24:48] [INFO ] Deduced a trap composed of 119 places in 150 ms of which 1 ms to minimize.
[2023-03-12 19:24:49] [INFO ] Deduced a trap composed of 110 places in 166 ms of which 1 ms to minimize.
[2023-03-12 19:24:49] [INFO ] Deduced a trap composed of 112 places in 143 ms of which 1 ms to minimize.
[2023-03-12 19:24:49] [INFO ] Deduced a trap composed of 112 places in 145 ms of which 0 ms to minimize.
[2023-03-12 19:24:49] [INFO ] Deduced a trap composed of 107 places in 169 ms of which 0 ms to minimize.
[2023-03-12 19:24:49] [INFO ] Deduced a trap composed of 139 places in 157 ms of which 1 ms to minimize.
[2023-03-12 19:24:50] [INFO ] Deduced a trap composed of 143 places in 163 ms of which 0 ms to minimize.
[2023-03-12 19:24:50] [INFO ] Deduced a trap composed of 115 places in 145 ms of which 0 ms to minimize.
[2023-03-12 19:24:50] [INFO ] Deduced a trap composed of 100 places in 151 ms of which 0 ms to minimize.
[2023-03-12 19:24:50] [INFO ] Deduced a trap composed of 105 places in 147 ms of which 1 ms to minimize.
[2023-03-12 19:24:50] [INFO ] Deduced a trap composed of 111 places in 160 ms of which 0 ms to minimize.
[2023-03-12 19:24:50] [INFO ] Deduced a trap composed of 117 places in 127 ms of which 0 ms to minimize.
[2023-03-12 19:24:51] [INFO ] Deduced a trap composed of 39 places in 143 ms of which 13 ms to minimize.
[2023-03-12 19:24:51] [INFO ] Deduced a trap composed of 111 places in 163 ms of which 1 ms to minimize.
[2023-03-12 19:24:51] [INFO ] Deduced a trap composed of 107 places in 166 ms of which 1 ms to minimize.
[2023-03-12 19:24:51] [INFO ] Deduced a trap composed of 113 places in 140 ms of which 1 ms to minimize.
[2023-03-12 19:24:51] [INFO ] Deduced a trap composed of 109 places in 160 ms of which 0 ms to minimize.
[2023-03-12 19:24:52] [INFO ] Deduced a trap composed of 114 places in 168 ms of which 1 ms to minimize.
[2023-03-12 19:24:52] [INFO ] Deduced a trap composed of 107 places in 168 ms of which 1 ms to minimize.
[2023-03-12 19:24:52] [INFO ] Deduced a trap composed of 108 places in 162 ms of which 0 ms to minimize.
[2023-03-12 19:24:52] [INFO ] Deduced a trap composed of 131 places in 165 ms of which 1 ms to minimize.
[2023-03-12 19:24:52] [INFO ] Deduced a trap composed of 114 places in 138 ms of which 0 ms to minimize.
[2023-03-12 19:24:53] [INFO ] Deduced a trap composed of 105 places in 181 ms of which 1 ms to minimize.
[2023-03-12 19:24:53] [INFO ] Deduced a trap composed of 108 places in 147 ms of which 1 ms to minimize.
[2023-03-12 19:24:53] [INFO ] Deduced a trap composed of 112 places in 138 ms of which 0 ms to minimize.
[2023-03-12 19:24:53] [INFO ] Deduced a trap composed of 139 places in 138 ms of which 1 ms to minimize.
[2023-03-12 19:24:53] [INFO ] Deduced a trap composed of 110 places in 145 ms of which 0 ms to minimize.
[2023-03-12 19:24:53] [INFO ] Deduced a trap composed of 120 places in 126 ms of which 1 ms to minimize.
[2023-03-12 19:24:54] [INFO ] Deduced a trap composed of 109 places in 138 ms of which 0 ms to minimize.
[2023-03-12 19:24:54] [INFO ] Deduced a trap composed of 126 places in 120 ms of which 1 ms to minimize.
[2023-03-12 19:24:54] [INFO ] Deduced a trap composed of 115 places in 116 ms of which 1 ms to minimize.
[2023-03-12 19:24:54] [INFO ] Deduced a trap composed of 107 places in 104 ms of which 1 ms to minimize.
[2023-03-12 19:24:54] [INFO ] Deduced a trap composed of 112 places in 110 ms of which 1 ms to minimize.
[2023-03-12 19:24:54] [INFO ] Deduced a trap composed of 108 places in 118 ms of which 1 ms to minimize.
[2023-03-12 19:24:55] [INFO ] Deduced a trap composed of 123 places in 121 ms of which 0 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
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 19:24:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 19:24:55] [INFO ] After 25080ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0 real:34
Fused 37 Parikh solutions to 27 different solutions.
Parikh walk visited 1 properties in 359 ms.
Support contains 36 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 536/536 transitions.
Graph (complete) has 1352 edges and 615 vertex of which 614 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 614 transition count 475
Reduce places removed 60 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 65 rules applied. Total rules applied 126 place count 554 transition count 470
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 131 place count 549 transition count 470
Performed 118 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 118 Pre rules applied. Total rules applied 131 place count 549 transition count 352
Deduced a syphon composed of 118 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 385 place count 413 transition count 352
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 398 place count 400 transition count 339
Iterating global reduction 3 with 13 rules applied. Total rules applied 411 place count 400 transition count 339
Performed 152 Post agglomeration using F-continuation condition.Transition count delta: 152
Deduced a syphon composed of 152 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 3 with 309 rules applied. Total rules applied 720 place count 243 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 721 place count 243 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 723 place count 242 transition count 189
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 728 place count 242 transition count 189
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 729 place count 241 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 730 place count 240 transition count 188
Applied a total of 730 rules in 117 ms. Remains 240 /615 variables (removed 375) and now considering 188/536 (removed 348) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 240/615 places, 188/536 transitions.
Incomplete random walk after 10000 steps, including 748 resets, run finished after 387 ms. (steps per millisecond=25 ) properties (out of 26) seen :1
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 17 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 19 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 18 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 18 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Interrupted probabilistic random walk after 661785 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :{0=1, 1=1, 2=1, 4=1, 5=1, 7=1, 8=1, 9=1, 10=1, 11=1, 12=1, 13=1, 15=1, 16=1, 17=1, 18=1, 19=1, 20=1, 21=1, 22=1, 23=1, 24=1}
Probabilistic random walk after 661785 steps, saw 121789 distinct states, run finished after 3003 ms. (steps per millisecond=220 ) properties seen :22
Running SMT prover for 3 properties.
// Phase 1: matrix 188 rows 240 cols
[2023-03-12 19:24:59] [INFO ] Computed 93 place invariants in 9 ms
[2023-03-12 19:24:59] [INFO ] [Real]Absence check using 69 positive place invariants in 9 ms returned sat
[2023-03-12 19:24:59] [INFO ] [Real]Absence check using 69 positive and 24 generalized place invariants in 5 ms returned sat
[2023-03-12 19:24:59] [INFO ] After 96ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2023-03-12 19:24:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 19:24:59] [INFO ] After 21ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :3
[2023-03-12 19:24:59] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2023-03-12 19:24:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-12 19:24:59] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2023-03-12 19:24:59] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2023-03-12 19:24:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 173 ms
[2023-03-12 19:24:59] [INFO ] After 294ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 19:24:59] [INFO ] After 493ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 19:24:59] [INFO ] [Nat]Absence check using 69 positive place invariants in 13 ms returned sat
[2023-03-12 19:24:59] [INFO ] [Nat]Absence check using 69 positive and 24 generalized place invariants in 4 ms returned sat
[2023-03-12 19:24:59] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 19:24:59] [INFO ] After 19ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 19:24:59] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2023-03-12 19:24:59] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2023-03-12 19:24:59] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2023-03-12 19:24:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 130 ms
[2023-03-12 19:25:00] [INFO ] After 190ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-12 19:25:00] [INFO ] After 367ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 188/188 transitions.
Graph (trivial) has 34 edges and 240 vertex of which 2 / 240 are part of one of the 1 SCC in 4 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 239 transition count 181
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 234 transition count 181
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 11 place count 234 transition count 166
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 48 place count 212 transition count 166
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 52 place count 208 transition count 162
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 208 transition count 162
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 207 transition count 161
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 207 transition count 161
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 74 place count 199 transition count 153
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 199 transition count 151
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 78 place count 197 transition count 151
Applied a total of 78 rules in 57 ms. Remains 197 /240 variables (removed 43) and now considering 151/188 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 197/240 places, 151/188 transitions.
Incomplete random walk after 10000 steps, including 461 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 201 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 217 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 171 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 797796 steps, run timeout after 3001 ms. (steps per millisecond=265 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 797796 steps, saw 244595 distinct states, run finished after 3001 ms. (steps per millisecond=265 ) properties seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 151 rows 197 cols
[2023-03-12 19:25:03] [INFO ] Computed 86 place invariants in 6 ms
[2023-03-12 19:25:03] [INFO ] [Real]Absence check using 69 positive place invariants in 8 ms returned sat
[2023-03-12 19:25:03] [INFO ] [Real]Absence check using 69 positive and 17 generalized place invariants in 3 ms returned sat
[2023-03-12 19:25:03] [INFO ] After 54ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 19:25:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 19:25:03] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 19:25:03] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 19:25:03] [INFO ] [Nat]Absence check using 69 positive place invariants in 8 ms returned sat
[2023-03-12 19:25:03] [INFO ] [Nat]Absence check using 69 positive and 17 generalized place invariants in 4 ms returned sat
[2023-03-12 19:25:03] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 19:25:03] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 19:25:03] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2023-03-12 19:25:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-03-12 19:25:03] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-12 19:25:03] [INFO ] After 164ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 151/151 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 197 transition count 150
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 196 transition count 150
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 195 transition count 148
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 195 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 194 transition count 148
Applied a total of 6 rules in 20 ms. Remains 194 /197 variables (removed 3) and now considering 148/151 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 194/197 places, 148/151 transitions.
Incomplete random walk after 10000 steps, including 427 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 144 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 853087 steps, run timeout after 3001 ms. (steps per millisecond=284 ) properties seen :{}
Probabilistic random walk after 853087 steps, saw 275718 distinct states, run finished after 3002 ms. (steps per millisecond=284 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 148 rows 194 cols
[2023-03-12 19:25:06] [INFO ] Computed 86 place invariants in 3 ms
[2023-03-12 19:25:06] [INFO ] [Real]Absence check using 68 positive place invariants in 12 ms returned sat
[2023-03-12 19:25:06] [INFO ] [Real]Absence check using 68 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-12 19:25:07] [INFO ] After 70ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 19:25:07] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 19:25:07] [INFO ] After 8ms SMT Verify possible using 4 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 19:25:07] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 19:25:07] [INFO ] [Nat]Absence check using 68 positive place invariants in 9 ms returned sat
[2023-03-12 19:25:07] [INFO ] [Nat]Absence check using 68 positive and 18 generalized place invariants in 17 ms returned sat
[2023-03-12 19:25:07] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 19:25:07] [INFO ] After 14ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 19:25:07] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2023-03-12 19:25:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-03-12 19:25:07] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-12 19:25:07] [INFO ] After 236ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 194 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 148/148 transitions.
Applied a total of 0 rules in 13 ms. Remains 194 /194 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 194/194 places, 148/148 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 148/148 transitions.
Applied a total of 0 rules in 14 ms. Remains 194 /194 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2023-03-12 19:25:07] [INFO ] Invariant cache hit.
[2023-03-12 19:25:07] [INFO ] Implicit Places using invariants in 167 ms returned [11, 12, 54, 55, 56, 57, 58, 59]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 185 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 186/194 places, 148/148 transitions.
Applied a total of 0 rules in 8 ms. Remains 186 /186 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 208 ms. Remains : 186/194 places, 148/148 transitions.
Incomplete random walk after 10000 steps, including 464 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 161 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 892318 steps, run timeout after 3001 ms. (steps per millisecond=297 ) properties seen :{}
Probabilistic random walk after 892318 steps, saw 294110 distinct states, run finished after 3002 ms. (steps per millisecond=297 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 148 rows 186 cols
[2023-03-12 19:25:10] [INFO ] Computed 78 place invariants in 5 ms
[2023-03-12 19:25:10] [INFO ] [Real]Absence check using 61 positive place invariants in 17 ms returned sat
[2023-03-12 19:25:10] [INFO ] [Real]Absence check using 61 positive and 17 generalized place invariants in 25 ms returned sat
[2023-03-12 19:25:10] [INFO ] After 115ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 19:25:10] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 19:25:10] [INFO ] After 8ms SMT Verify possible using 4 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 19:25:10] [INFO ] After 242ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 19:25:10] [INFO ] [Nat]Absence check using 61 positive place invariants in 9 ms returned sat
[2023-03-12 19:25:10] [INFO ] [Nat]Absence check using 61 positive and 17 generalized place invariants in 5 ms returned sat
[2023-03-12 19:25:11] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 19:25:11] [INFO ] After 8ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 19:25:11] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2023-03-12 19:25:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-12 19:25:11] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-12 19:25:11] [INFO ] After 178ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 148/148 transitions.
Applied a total of 0 rules in 8 ms. Remains 186 /186 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 186/186 places, 148/148 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 148/148 transitions.
Applied a total of 0 rules in 6 ms. Remains 186 /186 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2023-03-12 19:25:11] [INFO ] Invariant cache hit.
[2023-03-12 19:25:11] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-12 19:25:11] [INFO ] Invariant cache hit.
[2023-03-12 19:25:11] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 19:25:11] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
[2023-03-12 19:25:11] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-12 19:25:11] [INFO ] Invariant cache hit.
[2023-03-12 19:25:11] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 502 ms. Remains : 186/186 places, 148/148 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 186 transition count 147
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 185 transition count 147
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 0 with 2 rules applied. Total rules applied 4 place count 184 transition count 146
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 184 transition count 146
Applied a total of 6 rules in 23 ms. Remains 184 /186 variables (removed 2) and now considering 146/148 (removed 2) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 146 rows 184 cols
[2023-03-12 19:25:11] [INFO ] Computed 78 place invariants in 3 ms
[2023-03-12 19:25:11] [INFO ] [Real]Absence check using 61 positive place invariants in 10 ms returned sat
[2023-03-12 19:25:11] [INFO ] [Real]Absence check using 61 positive and 17 generalized place invariants in 5 ms returned sat
[2023-03-12 19:25:11] [INFO ] After 65ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 19:25:11] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 19:25:11] [INFO ] After 22ms SMT Verify possible using 4 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 19:25:11] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 19:25:11] [INFO ] [Nat]Absence check using 61 positive place invariants in 9 ms returned sat
[2023-03-12 19:25:11] [INFO ] [Nat]Absence check using 61 positive and 17 generalized place invariants in 5 ms returned sat
[2023-03-12 19:25:11] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 19:25:11] [INFO ] After 22ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 19:25:11] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-12 19:25:11] [INFO ] After 172ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 10 atomic propositions for a total of 15 simplifications.
[2023-03-12 19:25:11] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-12 19:25:11] [INFO ] Flatten gal took : 37 ms
[2023-03-12 19:25:11] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-19-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-CTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 19:25:12] [INFO ] Flatten gal took : 32 ms
[2023-03-12 19:25:12] [INFO ] Input system was already deterministic with 536 transitions.
Support contains 66 out of 615 places (down from 84) after GAL structural reductions.
Computed a total of 555 stabilizing places and 486 stable transitions
Graph (complete) has 1352 edges and 615 vertex of which 614 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.54 ms
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 536/536 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 594 transition count 515
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 594 transition count 515
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 53 place count 583 transition count 504
Iterating global reduction 0 with 11 rules applied. Total rules applied 64 place count 583 transition count 504
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 582 transition count 503
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 582 transition count 503
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 581 transition count 502
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 581 transition count 502
Applied a total of 68 rules in 69 ms. Remains 581 /615 variables (removed 34) and now considering 502/536 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69 ms. Remains : 581/615 places, 502/536 transitions.
[2023-03-12 19:25:12] [INFO ] Flatten gal took : 25 ms
[2023-03-12 19:25:12] [INFO ] Flatten gal took : 25 ms
[2023-03-12 19:25:12] [INFO ] Input system was already deterministic with 502 transitions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 536/536 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 593 transition count 514
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 593 transition count 514
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 53 place count 584 transition count 505
Iterating global reduction 0 with 9 rules applied. Total rules applied 62 place count 584 transition count 505
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 583 transition count 504
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 583 transition count 504
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 582 transition count 503
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 582 transition count 503
Applied a total of 66 rules in 63 ms. Remains 582 /615 variables (removed 33) and now considering 503/536 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63 ms. Remains : 582/615 places, 503/536 transitions.
[2023-03-12 19:25:12] [INFO ] Flatten gal took : 17 ms
[2023-03-12 19:25:12] [INFO ] Flatten gal took : 17 ms
[2023-03-12 19:25:12] [INFO ] Input system was already deterministic with 503 transitions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 536/536 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 592 transition count 513
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 592 transition count 513
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 57 place count 581 transition count 502
Iterating global reduction 0 with 11 rules applied. Total rules applied 68 place count 581 transition count 502
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 580 transition count 501
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 580 transition count 501
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 579 transition count 500
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 579 transition count 500
Applied a total of 72 rules in 67 ms. Remains 579 /615 variables (removed 36) and now considering 500/536 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67 ms. Remains : 579/615 places, 500/536 transitions.
[2023-03-12 19:25:12] [INFO ] Flatten gal took : 16 ms
[2023-03-12 19:25:12] [INFO ] Flatten gal took : 34 ms
[2023-03-12 19:25:12] [INFO ] Input system was already deterministic with 500 transitions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 536/536 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 591 transition count 512
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 591 transition count 512
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 59 place count 580 transition count 501
Iterating global reduction 0 with 11 rules applied. Total rules applied 70 place count 580 transition count 501
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 579 transition count 500
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 579 transition count 500
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 578 transition count 499
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 578 transition count 499
Applied a total of 74 rules in 75 ms. Remains 578 /615 variables (removed 37) and now considering 499/536 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75 ms. Remains : 578/615 places, 499/536 transitions.
[2023-03-12 19:25:12] [INFO ] Flatten gal took : 29 ms
[2023-03-12 19:25:12] [INFO ] Flatten gal took : 35 ms
[2023-03-12 19:25:12] [INFO ] Input system was already deterministic with 499 transitions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 536/536 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 591 transition count 512
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 591 transition count 512
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 59 place count 580 transition count 501
Iterating global reduction 0 with 11 rules applied. Total rules applied 70 place count 580 transition count 501
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 579 transition count 500
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 579 transition count 500
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 578 transition count 499
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 578 transition count 499
Applied a total of 74 rules in 66 ms. Remains 578 /615 variables (removed 37) and now considering 499/536 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66 ms. Remains : 578/615 places, 499/536 transitions.
[2023-03-12 19:25:13] [INFO ] Flatten gal took : 55 ms
[2023-03-12 19:25:13] [INFO ] Flatten gal took : 18 ms
[2023-03-12 19:25:13] [INFO ] Input system was already deterministic with 499 transitions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 536/536 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 592 transition count 513
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 592 transition count 513
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 57 place count 581 transition count 502
Iterating global reduction 0 with 11 rules applied. Total rules applied 68 place count 581 transition count 502
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 580 transition count 501
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 580 transition count 501
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 579 transition count 500
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 579 transition count 500
Applied a total of 72 rules in 49 ms. Remains 579 /615 variables (removed 36) and now considering 500/536 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49 ms. Remains : 579/615 places, 500/536 transitions.
[2023-03-12 19:25:13] [INFO ] Flatten gal took : 13 ms
[2023-03-12 19:25:13] [INFO ] Flatten gal took : 13 ms
[2023-03-12 19:25:13] [INFO ] Input system was already deterministic with 500 transitions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 536/536 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 592 transition count 513
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 592 transition count 513
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 57 place count 581 transition count 502
Iterating global reduction 0 with 11 rules applied. Total rules applied 68 place count 581 transition count 502
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 580 transition count 501
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 580 transition count 501
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 579 transition count 500
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 579 transition count 500
Applied a total of 72 rules in 45 ms. Remains 579 /615 variables (removed 36) and now considering 500/536 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45 ms. Remains : 579/615 places, 500/536 transitions.
[2023-03-12 19:25:13] [INFO ] Flatten gal took : 13 ms
[2023-03-12 19:25:13] [INFO ] Flatten gal took : 14 ms
[2023-03-12 19:25:13] [INFO ] Input system was already deterministic with 500 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 615/615 places, 536/536 transitions.
Graph (trivial) has 302 edges and 615 vertex of which 6 / 615 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1346 edges and 610 vertex of which 609 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 80 place count 608 transition count 450
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 158 place count 530 transition count 450
Performed 125 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 125 Pre rules applied. Total rules applied 158 place count 530 transition count 325
Deduced a syphon composed of 125 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 274 rules applied. Total rules applied 432 place count 381 transition count 325
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 452 place count 361 transition count 305
Iterating global reduction 2 with 20 rules applied. Total rules applied 472 place count 361 transition count 305
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 472 place count 361 transition count 304
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 474 place count 360 transition count 304
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 475 place count 359 transition count 303
Iterating global reduction 2 with 1 rules applied. Total rules applied 476 place count 359 transition count 303
Performed 153 Post agglomeration using F-continuation condition.Transition count delta: 153
Deduced a syphon composed of 153 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 2 with 311 rules applied. Total rules applied 787 place count 201 transition count 150
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 788 place count 200 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 789 place count 199 transition count 149
Applied a total of 789 rules in 92 ms. Remains 199 /615 variables (removed 416) and now considering 149/536 (removed 387) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 92 ms. Remains : 199/615 places, 149/536 transitions.
[2023-03-12 19:25:13] [INFO ] Flatten gal took : 6 ms
[2023-03-12 19:25:13] [INFO ] Flatten gal took : 19 ms
[2023-03-12 19:25:13] [INFO ] Input system was already deterministic with 149 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 615/615 places, 536/536 transitions.
Graph (trivial) has 305 edges and 615 vertex of which 6 / 615 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1346 edges and 610 vertex of which 609 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 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 81 place count 608 transition count 449
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 160 place count 529 transition count 449
Performed 127 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 127 Pre rules applied. Total rules applied 160 place count 529 transition count 322
Deduced a syphon composed of 127 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 2 with 279 rules applied. Total rules applied 439 place count 377 transition count 322
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 461 place count 355 transition count 300
Iterating global reduction 2 with 22 rules applied. Total rules applied 483 place count 355 transition count 300
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 483 place count 355 transition count 299
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 485 place count 354 transition count 299
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 486 place count 353 transition count 298
Iterating global reduction 2 with 1 rules applied. Total rules applied 487 place count 353 transition count 298
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 150
Deduced a syphon composed of 150 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 2 with 305 rules applied. Total rules applied 792 place count 198 transition count 148
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 793 place count 197 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 794 place count 196 transition count 147
Applied a total of 794 rules in 83 ms. Remains 196 /615 variables (removed 419) and now considering 147/536 (removed 389) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 83 ms. Remains : 196/615 places, 147/536 transitions.
[2023-03-12 19:25:13] [INFO ] Flatten gal took : 19 ms
[2023-03-12 19:25:13] [INFO ] Flatten gal took : 7 ms
[2023-03-12 19:25:13] [INFO ] Input system was already deterministic with 147 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
FORMULA BusinessProcesses-PT-19-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 536/536 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 594 transition count 515
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 594 transition count 515
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 51 place count 585 transition count 506
Iterating global reduction 0 with 9 rules applied. Total rules applied 60 place count 585 transition count 506
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 584 transition count 505
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 584 transition count 505
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 583 transition count 504
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 583 transition count 504
Applied a total of 64 rules in 66 ms. Remains 583 /615 variables (removed 32) and now considering 504/536 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66 ms. Remains : 583/615 places, 504/536 transitions.
[2023-03-12 19:25:13] [INFO ] Flatten gal took : 14 ms
[2023-03-12 19:25:13] [INFO ] Flatten gal took : 13 ms
[2023-03-12 19:25:13] [INFO ] Input system was already deterministic with 504 transitions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 536/536 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 591 transition count 512
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 591 transition count 512
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 59 place count 580 transition count 501
Iterating global reduction 0 with 11 rules applied. Total rules applied 70 place count 580 transition count 501
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 579 transition count 500
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 579 transition count 500
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 578 transition count 499
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 578 transition count 499
Applied a total of 74 rules in 47 ms. Remains 578 /615 variables (removed 37) and now considering 499/536 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 578/615 places, 499/536 transitions.
[2023-03-12 19:25:13] [INFO ] Flatten gal took : 13 ms
[2023-03-12 19:25:13] [INFO ] Flatten gal took : 14 ms
[2023-03-12 19:25:14] [INFO ] Input system was already deterministic with 499 transitions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 536/536 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 592 transition count 513
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 592 transition count 513
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 56 place count 582 transition count 503
Iterating global reduction 0 with 10 rules applied. Total rules applied 66 place count 582 transition count 503
Applied a total of 66 rules in 55 ms. Remains 582 /615 variables (removed 33) and now considering 503/536 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55 ms. Remains : 582/615 places, 503/536 transitions.
[2023-03-12 19:25:14] [INFO ] Flatten gal took : 25 ms
[2023-03-12 19:25:14] [INFO ] Flatten gal took : 26 ms
[2023-03-12 19:25:14] [INFO ] Input system was already deterministic with 503 transitions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 536/536 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 591 transition count 512
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 591 transition count 512
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 59 place count 580 transition count 501
Iterating global reduction 0 with 11 rules applied. Total rules applied 70 place count 580 transition count 501
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 579 transition count 500
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 579 transition count 500
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 578 transition count 499
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 578 transition count 499
Applied a total of 74 rules in 105 ms. Remains 578 /615 variables (removed 37) and now considering 499/536 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105 ms. Remains : 578/615 places, 499/536 transitions.
[2023-03-12 19:25:14] [INFO ] Flatten gal took : 25 ms
[2023-03-12 19:25:14] [INFO ] Flatten gal took : 26 ms
[2023-03-12 19:25:14] [INFO ] Input system was already deterministic with 499 transitions.
[2023-03-12 19:25:14] [INFO ] Flatten gal took : 26 ms
[2023-03-12 19:25:14] [INFO ] Flatten gal took : 26 ms
[2023-03-12 19:25:14] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-12 19:25:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 615 places, 536 transitions and 1675 arcs took 4 ms.
Total runtime 50136 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/1060/ctl_0_ --ctl=/tmp/1060/ctl_1_ --ctl=/tmp/1060/ctl_2_ --ctl=/tmp/1060/ctl_3_ --ctl=/tmp/1060/ctl_4_ --ctl=/tmp/1060/ctl_5_ --ctl=/tmp/1060/ctl_6_ --ctl=/tmp/1060/ctl_7_ --ctl=/tmp/1060/ctl_8_ --ctl=/tmp/1060/ctl_9_ --ctl=/tmp/1060/ctl_10_ --ctl=/tmp/1060/ctl_11_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 12976760 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16101400 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-19"
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-19, 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-167813694900594"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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