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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.6K Feb 25 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 16:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 141K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678643375751

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-11
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 17:49:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 17:49:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:49:37] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2023-03-12 17:49:37] [INFO ] Transformed 567 places.
[2023-03-12 17:49:37] [INFO ] Transformed 508 transitions.
[2023-03-12 17:49:37] [INFO ] Found NUPN structural information;
[2023-03-12 17:49:37] [INFO ] Parsed PT model containing 567 places and 508 transitions and 1512 arcs in 136 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Deduced a syphon composed of 7 places in 7 ms
Reduce places removed 7 places and 7 transitions.
Support contains 110 out of 560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 560/560 places, 501/501 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 556 transition count 501
Discarding 54 places :
Symmetric choice reduction at 1 with 54 rule applications. Total rules 58 place count 502 transition count 447
Iterating global reduction 1 with 54 rules applied. Total rules applied 112 place count 502 transition count 447
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 134 place count 480 transition count 425
Iterating global reduction 1 with 22 rules applied. Total rules applied 156 place count 480 transition count 425
Applied a total of 156 rules in 100 ms. Remains 480 /560 variables (removed 80) and now considering 425/501 (removed 76) transitions.
// Phase 1: matrix 425 rows 480 cols
[2023-03-12 17:49:37] [INFO ] Computed 91 place invariants in 28 ms
[2023-03-12 17:49:38] [INFO ] Implicit Places using invariants in 394 ms returned []
[2023-03-12 17:49:38] [INFO ] Invariant cache hit.
[2023-03-12 17:49:38] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 841 ms to find 0 implicit places.
[2023-03-12 17:49:38] [INFO ] Invariant cache hit.
[2023-03-12 17:49:38] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 480/560 places, 425/501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1193 ms. Remains : 480/560 places, 425/501 transitions.
Support contains 110 out of 480 places after structural reductions.
[2023-03-12 17:49:38] [INFO ] Flatten gal took : 61 ms
[2023-03-12 17:49:38] [INFO ] Flatten gal took : 27 ms
[2023-03-12 17:49:39] [INFO ] Input system was already deterministic with 425 transitions.
Incomplete random walk after 10000 steps, including 74 resets, run finished after 648 ms. (steps per millisecond=15 ) properties (out of 79) seen :27
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) 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 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) 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 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) 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 52) 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 52) 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 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) 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 52) 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 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) 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 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 52) 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 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) 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 52) 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 52) 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 52) 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 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 52) 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 52) 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 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 52) 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 52) 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 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 52) 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 52) 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 52) 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 52) seen :0
Running SMT prover for 52 properties.
[2023-03-12 17:49:40] [INFO ] Invariant cache hit.
[2023-03-12 17:49:40] [INFO ] [Real]Absence check using 49 positive place invariants in 14 ms returned sat
[2023-03-12 17:49:40] [INFO ] [Real]Absence check using 49 positive and 42 generalized place invariants in 12 ms returned sat
[2023-03-12 17:49:40] [INFO ] After 563ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:51
[2023-03-12 17:49:41] [INFO ] [Nat]Absence check using 49 positive place invariants in 13 ms returned sat
[2023-03-12 17:49:41] [INFO ] [Nat]Absence check using 49 positive and 42 generalized place invariants in 16 ms returned sat
[2023-03-12 17:49:42] [INFO ] After 855ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :43
[2023-03-12 17:49:42] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 8 ms to minimize.
[2023-03-12 17:49:42] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 1 ms to minimize.
[2023-03-12 17:49:42] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 1 ms to minimize.
[2023-03-12 17:49:42] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2023-03-12 17:49:42] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2023-03-12 17:49:42] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2023-03-12 17:49:43] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 628 ms
[2023-03-12 17:49:43] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 1 ms to minimize.
[2023-03-12 17:49:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2023-03-12 17:49:43] [INFO ] Deduced a trap composed of 107 places in 123 ms of which 1 ms to minimize.
[2023-03-12 17:49:43] [INFO ] Deduced a trap composed of 101 places in 113 ms of which 1 ms to minimize.
[2023-03-12 17:49:43] [INFO ] Deduced a trap composed of 103 places in 134 ms of which 0 ms to minimize.
[2023-03-12 17:49:43] [INFO ] Deduced a trap composed of 104 places in 96 ms of which 0 ms to minimize.
[2023-03-12 17:49:43] [INFO ] Deduced a trap composed of 103 places in 98 ms of which 1 ms to minimize.
[2023-03-12 17:49:44] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 1 ms to minimize.
[2023-03-12 17:49:44] [INFO ] Deduced a trap composed of 100 places in 130 ms of which 0 ms to minimize.
[2023-03-12 17:49:44] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 1 ms to minimize.
[2023-03-12 17:49:44] [INFO ] Deduced a trap composed of 121 places in 157 ms of which 1 ms to minimize.
[2023-03-12 17:49:44] [INFO ] Deduced a trap composed of 123 places in 125 ms of which 0 ms to minimize.
[2023-03-12 17:49:44] [INFO ] Deduced a trap composed of 117 places in 126 ms of which 0 ms to minimize.
[2023-03-12 17:49:44] [INFO ] Deduced a trap composed of 109 places in 131 ms of which 1 ms to minimize.
[2023-03-12 17:49:45] [INFO ] Deduced a trap composed of 98 places in 94 ms of which 0 ms to minimize.
[2023-03-12 17:49:45] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 0 ms to minimize.
[2023-03-12 17:49:45] [INFO ] Deduced a trap composed of 127 places in 142 ms of which 1 ms to minimize.
[2023-03-12 17:49:45] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 1 ms to minimize.
[2023-03-12 17:49:45] [INFO ] Deduced a trap composed of 109 places in 110 ms of which 0 ms to minimize.
[2023-03-12 17:49:45] [INFO ] Deduced a trap composed of 126 places in 106 ms of which 1 ms to minimize.
[2023-03-12 17:49:45] [INFO ] Deduced a trap composed of 97 places in 83 ms of which 1 ms to minimize.
[2023-03-12 17:49:45] [INFO ] Deduced a trap composed of 99 places in 136 ms of which 0 ms to minimize.
[2023-03-12 17:49:46] [INFO ] Deduced a trap composed of 116 places in 108 ms of which 0 ms to minimize.
[2023-03-12 17:49:46] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 0 ms to minimize.
[2023-03-12 17:49:46] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 0 ms to minimize.
[2023-03-12 17:49:46] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 1 ms to minimize.
[2023-03-12 17:49:46] [INFO ] Deduced a trap composed of 115 places in 122 ms of which 0 ms to minimize.
[2023-03-12 17:49:46] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 2 ms to minimize.
[2023-03-12 17:49:46] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 1 ms to minimize.
[2023-03-12 17:49:47] [INFO ] Deduced a trap composed of 100 places in 148 ms of which 0 ms to minimize.
[2023-03-12 17:49:47] [INFO ] Deduced a trap composed of 129 places in 125 ms of which 1 ms to minimize.
[2023-03-12 17:49:47] [INFO ] Deduced a trap composed of 132 places in 123 ms of which 0 ms to minimize.
[2023-03-12 17:49:47] [INFO ] Deduced a trap composed of 128 places in 121 ms of which 1 ms to minimize.
[2023-03-12 17:49:47] [INFO ] Deduced a trap composed of 125 places in 134 ms of which 1 ms to minimize.
[2023-03-12 17:49:47] [INFO ] Deduced a trap composed of 54 places in 123 ms of which 1 ms to minimize.
[2023-03-12 17:49:47] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 4640 ms
[2023-03-12 17:49:48] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 0 ms to minimize.
[2023-03-12 17:49:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2023-03-12 17:49:48] [INFO ] Deduced a trap composed of 52 places in 40 ms of which 0 ms to minimize.
[2023-03-12 17:49:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-03-12 17:49:48] [INFO ] Deduced a trap composed of 116 places in 84 ms of which 0 ms to minimize.
[2023-03-12 17:49:48] [INFO ] Deduced a trap composed of 118 places in 90 ms of which 1 ms to minimize.
[2023-03-12 17:49:48] [INFO ] Deduced a trap composed of 122 places in 110 ms of which 4 ms to minimize.
[2023-03-12 17:49:48] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 1 ms to minimize.
[2023-03-12 17:49:49] [INFO ] Deduced a trap composed of 93 places in 106 ms of which 0 ms to minimize.
[2023-03-12 17:49:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 629 ms
[2023-03-12 17:49:49] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2023-03-12 17:49:49] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 0 ms to minimize.
[2023-03-12 17:49:49] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 0 ms to minimize.
[2023-03-12 17:49:49] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2023-03-12 17:49:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 419 ms
[2023-03-12 17:49:50] [INFO ] Deduced a trap composed of 93 places in 120 ms of which 1 ms to minimize.
[2023-03-12 17:49:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2023-03-12 17:49:50] [INFO ] Deduced a trap composed of 51 places in 38 ms of which 0 ms to minimize.
[2023-03-12 17:49:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-03-12 17:49:50] [INFO ] Deduced a trap composed of 103 places in 84 ms of which 0 ms to minimize.
[2023-03-12 17:49:50] [INFO ] Deduced a trap composed of 120 places in 84 ms of which 0 ms to minimize.
[2023-03-12 17:49:50] [INFO ] Deduced a trap composed of 105 places in 82 ms of which 1 ms to minimize.
[2023-03-12 17:49:50] [INFO ] Deduced a trap composed of 126 places in 110 ms of which 4 ms to minimize.
[2023-03-12 17:49:50] [INFO ] Deduced a trap composed of 102 places in 110 ms of which 1 ms to minimize.
[2023-03-12 17:49:51] [INFO ] Deduced a trap composed of 128 places in 90 ms of which 1 ms to minimize.
[2023-03-12 17:49:51] [INFO ] Deduced a trap composed of 118 places in 98 ms of which 2 ms to minimize.
[2023-03-12 17:49:51] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 1 ms to minimize.
[2023-03-12 17:49:51] [INFO ] Deduced a trap composed of 102 places in 98 ms of which 0 ms to minimize.
[2023-03-12 17:49:51] [INFO ] Deduced a trap composed of 100 places in 114 ms of which 1 ms to minimize.
[2023-03-12 17:49:51] [INFO ] Deduced a trap composed of 92 places in 100 ms of which 0 ms to minimize.
[2023-03-12 17:49:51] [INFO ] Deduced a trap composed of 115 places in 83 ms of which 0 ms to minimize.
[2023-03-12 17:49:51] [INFO ] Deduced a trap composed of 97 places in 88 ms of which 1 ms to minimize.
[2023-03-12 17:49:52] [INFO ] Deduced a trap composed of 118 places in 83 ms of which 0 ms to minimize.
[2023-03-12 17:49:52] [INFO ] Deduced a trap composed of 111 places in 83 ms of which 0 ms to minimize.
[2023-03-12 17:49:52] [INFO ] Deduced a trap composed of 123 places in 84 ms of which 0 ms to minimize.
[2023-03-12 17:49:52] [INFO ] Deduced a trap composed of 103 places in 136 ms of which 2 ms to minimize.
[2023-03-12 17:49:52] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 0 ms to minimize.
[2023-03-12 17:49:52] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 0 ms to minimize.
[2023-03-12 17:49:52] [INFO ] Deduced a trap composed of 106 places in 138 ms of which 1 ms to minimize.
[2023-03-12 17:49:53] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 0 ms to minimize.
[2023-03-12 17:49:53] [INFO ] Deduced a trap composed of 98 places in 133 ms of which 0 ms to minimize.
[2023-03-12 17:49:53] [INFO ] Deduced a trap composed of 106 places in 114 ms of which 1 ms to minimize.
[2023-03-12 17:49:53] [INFO ] Deduced a trap composed of 103 places in 138 ms of which 0 ms to minimize.
[2023-03-12 17:49:53] [INFO ] Deduced a trap composed of 110 places in 132 ms of which 1 ms to minimize.
[2023-03-12 17:49:53] [INFO ] Deduced a trap composed of 107 places in 99 ms of which 0 ms to minimize.
[2023-03-12 17:49:53] [INFO ] Deduced a trap composed of 102 places in 96 ms of which 1 ms to minimize.
[2023-03-12 17:49:54] [INFO ] Deduced a trap composed of 121 places in 137 ms of which 0 ms to minimize.
[2023-03-12 17:49:54] [INFO ] Deduced a trap composed of 103 places in 114 ms of which 1 ms to minimize.
[2023-03-12 17:49:54] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 3907 ms
[2023-03-12 17:49:54] [INFO ] After 13057ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :43
Attempting to minimize the solution found.
Minimization took 1193 ms.
[2023-03-12 17:49:55] [INFO ] After 14990ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :43
Fused 52 Parikh solutions to 43 different solutions.
Parikh walk visited 0 properties in 729 ms.
Support contains 65 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 425/425 transitions.
Graph (complete) has 1046 edges and 480 vertex of which 479 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 479 transition count 388
Reduce places removed 36 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 40 rules applied. Total rules applied 77 place count 443 transition count 384
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 81 place count 439 transition count 384
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 81 place count 439 transition count 300
Deduced a syphon composed of 84 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 181 rules applied. Total rules applied 262 place count 342 transition count 300
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 271 place count 333 transition count 291
Iterating global reduction 3 with 9 rules applied. Total rules applied 280 place count 333 transition count 291
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 191 rules applied. Total rules applied 471 place count 237 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 472 place count 237 transition count 195
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 474 place count 236 transition count 199
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 483 place count 236 transition count 199
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 484 place count 235 transition count 198
Applied a total of 484 rules in 97 ms. Remains 235 /480 variables (removed 245) and now considering 198/425 (removed 227) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 235/480 places, 198/425 transitions.
Incomplete random walk after 10000 steps, including 507 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 43) seen :0
Interrupted probabilistic random walk after 600072 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :{0=1, 1=1, 2=1, 5=1, 6=1, 7=1, 8=1, 9=1, 11=1, 13=1, 14=1, 15=1, 16=1, 17=1, 18=1, 19=1, 20=1, 21=1, 22=1, 23=1, 24=1, 25=1, 26=1, 28=1, 29=1, 30=1, 31=1, 32=1, 33=1, 34=1, 35=1, 36=1, 37=1, 38=1, 39=1, 40=1, 41=1, 42=1}
Probabilistic random walk after 600072 steps, saw 96087 distinct states, run finished after 3002 ms. (steps per millisecond=199 ) properties seen :38
Running SMT prover for 5 properties.
// Phase 1: matrix 198 rows 235 cols
[2023-03-12 17:50:00] [INFO ] Computed 77 place invariants in 5 ms
[2023-03-12 17:50:00] [INFO ] [Real]Absence check using 51 positive place invariants in 8 ms returned sat
[2023-03-12 17:50:00] [INFO ] [Real]Absence check using 51 positive and 26 generalized place invariants in 7 ms returned sat
[2023-03-12 17:50:00] [INFO ] After 138ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5
[2023-03-12 17:50:00] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-12 17:50:00] [INFO ] After 47ms SMT Verify possible using 5 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 17:50:00] [INFO ] After 291ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 17:50:00] [INFO ] [Nat]Absence check using 51 positive place invariants in 8 ms returned sat
[2023-03-12 17:50:00] [INFO ] [Nat]Absence check using 51 positive and 26 generalized place invariants in 11 ms returned sat
[2023-03-12 17:50:00] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 17:50:00] [INFO ] After 37ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 17:50:00] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2023-03-12 17:50:00] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-12 17:50:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 104 ms
[2023-03-12 17:50:01] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2023-03-12 17:50:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2023-03-12 17:50:01] [INFO ] Deduced a trap composed of 51 places in 93 ms of which 1 ms to minimize.
[2023-03-12 17:50:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2023-03-12 17:50:01] [INFO ] After 351ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-12 17:50:01] [INFO ] After 597ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 30 ms.
Support contains 7 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 198/198 transitions.
Graph (trivial) has 53 edges and 235 vertex of which 2 / 235 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 234 transition count 183
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 221 transition count 183
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 27 place count 221 transition count 167
Deduced a syphon composed of 16 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 64 place count 200 transition count 167
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 72 place count 192 transition count 159
Iterating global reduction 2 with 8 rules applied. Total rules applied 80 place count 192 transition count 159
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 45 rules applied. Total rules applied 125 place count 168 transition count 138
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 127 place count 168 transition count 136
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 129 place count 166 transition count 136
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 130 place count 166 transition count 136
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 131 place count 165 transition count 135
Iterating global reduction 3 with 1 rules applied. Total rules applied 132 place count 165 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 133 place count 164 transition count 134
Applied a total of 133 rules in 97 ms. Remains 164 /235 variables (removed 71) and now considering 134/198 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 164/235 places, 134/198 transitions.
Incomplete random walk after 10000 steps, including 493 resets, run finished after 385 ms. (steps per millisecond=25 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 211 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 184 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 139 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 203 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 208 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 5) seen :0
Finished probabilistic random walk after 15289 steps, run visited all 5 properties in 118 ms. (steps per millisecond=129 )
Probabilistic random walk after 15289 steps, saw 4668 distinct states, run finished after 131 ms. (steps per millisecond=116 ) properties seen :5
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
FORMULA BusinessProcesses-PT-11-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 17:50:02] [INFO ] Flatten gal took : 31 ms
[2023-03-12 17:50:02] [INFO ] Flatten gal took : 47 ms
[2023-03-12 17:50:02] [INFO ] Input system was already deterministic with 425 transitions.
Support contains 93 out of 480 places (down from 94) after GAL structural reductions.
Computed a total of 465 stabilizing places and 410 stable transitions
Graph (complete) has 1046 edges and 480 vertex of which 479 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.27 ms
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 453 transition count 398
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 453 transition count 398
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 67 place count 440 transition count 385
Iterating global reduction 0 with 13 rules applied. Total rules applied 80 place count 440 transition count 385
Applied a total of 80 rules in 31 ms. Remains 440 /480 variables (removed 40) and now considering 385/425 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 440/480 places, 385/425 transitions.
[2023-03-12 17:50:02] [INFO ] Flatten gal took : 29 ms
[2023-03-12 17:50:02] [INFO ] Flatten gal took : 18 ms
[2023-03-12 17:50:02] [INFO ] Input system was already deterministic with 385 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 459 transition count 404
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 459 transition count 404
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 53 place count 448 transition count 393
Iterating global reduction 0 with 11 rules applied. Total rules applied 64 place count 448 transition count 393
Applied a total of 64 rules in 74 ms. Remains 448 /480 variables (removed 32) and now considering 393/425 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74 ms. Remains : 448/480 places, 393/425 transitions.
[2023-03-12 17:50:03] [INFO ] Flatten gal took : 33 ms
[2023-03-12 17:50:03] [INFO ] Flatten gal took : 32 ms
[2023-03-12 17:50:03] [INFO ] Input system was already deterministic with 393 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 456 transition count 401
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 456 transition count 401
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 60 place count 444 transition count 389
Iterating global reduction 0 with 12 rules applied. Total rules applied 72 place count 444 transition count 389
Applied a total of 72 rules in 55 ms. Remains 444 /480 variables (removed 36) and now considering 389/425 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56 ms. Remains : 444/480 places, 389/425 transitions.
[2023-03-12 17:50:03] [INFO ] Flatten gal took : 14 ms
[2023-03-12 17:50:03] [INFO ] Flatten gal took : 15 ms
[2023-03-12 17:50:03] [INFO ] Input system was already deterministic with 389 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Graph (trivial) has 228 edges and 480 vertex of which 4 / 480 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 1043 edges and 477 vertex of which 476 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 475 transition count 355
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 133 place count 410 transition count 354
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 134 place count 409 transition count 354
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 89 Pre rules applied. Total rules applied 134 place count 409 transition count 265
Deduced a syphon composed of 89 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 328 place count 304 transition count 265
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 352 place count 280 transition count 241
Iterating global reduction 3 with 24 rules applied. Total rules applied 376 place count 280 transition count 241
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 376 place count 280 transition count 239
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 380 place count 278 transition count 239
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 3 with 205 rules applied. Total rules applied 585 place count 175 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 586 place count 174 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 587 place count 173 transition count 136
Applied a total of 587 rules in 79 ms. Remains 173 /480 variables (removed 307) and now considering 136/425 (removed 289) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 79 ms. Remains : 173/480 places, 136/425 transitions.
[2023-03-12 17:50:03] [INFO ] Flatten gal took : 9 ms
[2023-03-12 17:50:03] [INFO ] Flatten gal took : 8 ms
[2023-03-12 17:50:03] [INFO ] Input system was already deterministic with 136 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Graph (trivial) has 238 edges and 480 vertex of which 6 / 480 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1040 edges and 475 vertex of which 474 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 473 transition count 351
Reduce places removed 66 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 67 rules applied. Total rules applied 135 place count 407 transition count 350
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 136 place count 406 transition count 350
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 94 Pre rules applied. Total rules applied 136 place count 406 transition count 256
Deduced a syphon composed of 94 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 206 rules applied. Total rules applied 342 place count 294 transition count 256
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 368 place count 268 transition count 230
Iterating global reduction 3 with 26 rules applied. Total rules applied 394 place count 268 transition count 230
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 394 place count 268 transition count 228
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 398 place count 266 transition count 228
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 211 rules applied. Total rules applied 609 place count 159 transition count 124
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 610 place count 158 transition count 123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 611 place count 157 transition count 123
Applied a total of 611 rules in 80 ms. Remains 157 /480 variables (removed 323) and now considering 123/425 (removed 302) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 81 ms. Remains : 157/480 places, 123/425 transitions.
[2023-03-12 17:50:03] [INFO ] Flatten gal took : 11 ms
[2023-03-12 17:50:03] [INFO ] Flatten gal took : 15 ms
[2023-03-12 17:50:03] [INFO ] Input system was already deterministic with 123 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Graph (trivial) has 226 edges and 480 vertex of which 6 / 480 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1040 edges and 475 vertex of which 474 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 473 transition count 358
Reduce places removed 59 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 62 rules applied. Total rules applied 123 place count 414 transition count 355
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 126 place count 411 transition count 355
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 91 Pre rules applied. Total rules applied 126 place count 411 transition count 264
Deduced a syphon composed of 91 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 324 place count 304 transition count 264
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 349 place count 279 transition count 239
Iterating global reduction 3 with 25 rules applied. Total rules applied 374 place count 279 transition count 239
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 374 place count 279 transition count 237
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 378 place count 277 transition count 237
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 209 rules applied. Total rules applied 587 place count 171 transition count 134
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 588 place count 170 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 589 place count 169 transition count 133
Applied a total of 589 rules in 57 ms. Remains 169 /480 variables (removed 311) and now considering 133/425 (removed 292) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 58 ms. Remains : 169/480 places, 133/425 transitions.
[2023-03-12 17:50:03] [INFO ] Flatten gal took : 10 ms
[2023-03-12 17:50:03] [INFO ] Flatten gal took : 7 ms
[2023-03-12 17:50:03] [INFO ] Input system was already deterministic with 133 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 455 transition count 400
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 455 transition count 400
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 61 place count 444 transition count 389
Iterating global reduction 0 with 11 rules applied. Total rules applied 72 place count 444 transition count 389
Applied a total of 72 rules in 42 ms. Remains 444 /480 variables (removed 36) and now considering 389/425 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42 ms. Remains : 444/480 places, 389/425 transitions.
[2023-03-12 17:50:03] [INFO ] Flatten gal took : 12 ms
[2023-03-12 17:50:03] [INFO ] Flatten gal took : 12 ms
[2023-03-12 17:50:03] [INFO ] Input system was already deterministic with 389 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Graph (trivial) has 233 edges and 480 vertex of which 6 / 480 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1040 edges and 475 vertex of which 474 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 473 transition count 352
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 132 place count 408 transition count 352
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 132 place count 408 transition count 257
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 340 place count 295 transition count 257
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 365 place count 270 transition count 232
Iterating global reduction 2 with 25 rules applied. Total rules applied 390 place count 270 transition count 232
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 390 place count 270 transition count 231
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 392 place count 269 transition count 231
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 2 with 201 rules applied. Total rules applied 593 place count 167 transition count 132
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 599 place count 167 transition count 132
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 600 place count 166 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 601 place count 165 transition count 131
Applied a total of 601 rules in 91 ms. Remains 165 /480 variables (removed 315) and now considering 131/425 (removed 294) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 91 ms. Remains : 165/480 places, 131/425 transitions.
[2023-03-12 17:50:03] [INFO ] Flatten gal took : 6 ms
[2023-03-12 17:50:03] [INFO ] Flatten gal took : 7 ms
[2023-03-12 17:50:03] [INFO ] Input system was already deterministic with 131 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 452 transition count 397
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 452 transition count 397
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 438 transition count 383
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 438 transition count 383
Applied a total of 84 rules in 22 ms. Remains 438 /480 variables (removed 42) and now considering 383/425 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 438/480 places, 383/425 transitions.
[2023-03-12 17:50:04] [INFO ] Flatten gal took : 12 ms
[2023-03-12 17:50:04] [INFO ] Flatten gal took : 23 ms
[2023-03-12 17:50:04] [INFO ] Input system was already deterministic with 383 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Graph (trivial) has 238 edges and 480 vertex of which 6 / 480 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1040 edges and 475 vertex of which 474 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.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 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 69 place count 473 transition count 350
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 136 place count 406 transition count 350
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 93 Pre rules applied. Total rules applied 136 place count 406 transition count 257
Deduced a syphon composed of 93 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 340 place count 295 transition count 257
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 366 place count 269 transition count 231
Iterating global reduction 2 with 26 rules applied. Total rules applied 392 place count 269 transition count 231
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 392 place count 269 transition count 229
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 396 place count 267 transition count 229
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Deduced a syphon composed of 105 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 2 with 213 rules applied. Total rules applied 609 place count 159 transition count 124
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 610 place count 158 transition count 123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 611 place count 157 transition count 123
Applied a total of 611 rules in 59 ms. Remains 157 /480 variables (removed 323) and now considering 123/425 (removed 302) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 59 ms. Remains : 157/480 places, 123/425 transitions.
[2023-03-12 17:50:04] [INFO ] Flatten gal took : 6 ms
[2023-03-12 17:50:04] [INFO ] Flatten gal took : 5 ms
[2023-03-12 17:50:04] [INFO ] Input system was already deterministic with 123 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Graph (trivial) has 230 edges and 480 vertex of which 6 / 480 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1040 edges and 475 vertex of which 474 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 473 transition count 353
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 130 place count 409 transition count 353
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 92 Pre rules applied. Total rules applied 130 place count 409 transition count 261
Deduced a syphon composed of 92 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 330 place count 301 transition count 261
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 355 place count 276 transition count 236
Iterating global reduction 2 with 25 rules applied. Total rules applied 380 place count 276 transition count 236
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 380 place count 276 transition count 235
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 382 place count 275 transition count 235
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 2 with 207 rules applied. Total rules applied 589 place count 170 transition count 133
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 590 place count 169 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 591 place count 168 transition count 132
Applied a total of 591 rules in 67 ms. Remains 168 /480 variables (removed 312) and now considering 132/425 (removed 293) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 68 ms. Remains : 168/480 places, 132/425 transitions.
[2023-03-12 17:50:04] [INFO ] Flatten gal took : 5 ms
[2023-03-12 17:50:04] [INFO ] Flatten gal took : 18 ms
[2023-03-12 17:50:04] [INFO ] Input system was already deterministic with 132 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 454 transition count 399
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 454 transition count 399
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 65 place count 441 transition count 386
Iterating global reduction 0 with 13 rules applied. Total rules applied 78 place count 441 transition count 386
Applied a total of 78 rules in 30 ms. Remains 441 /480 variables (removed 39) and now considering 386/425 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 441/480 places, 386/425 transitions.
[2023-03-12 17:50:04] [INFO ] Flatten gal took : 26 ms
[2023-03-12 17:50:04] [INFO ] Flatten gal took : 11 ms
[2023-03-12 17:50:04] [INFO ] Input system was already deterministic with 386 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Graph (complete) has 1046 edges and 480 vertex of which 479 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 478 transition count 374
Reduce places removed 49 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 52 rules applied. Total rules applied 102 place count 429 transition count 371
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 105 place count 426 transition count 371
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 108 Pre rules applied. Total rules applied 105 place count 426 transition count 263
Deduced a syphon composed of 108 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 234 rules applied. Total rules applied 339 place count 300 transition count 263
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 362 place count 277 transition count 240
Iterating global reduction 3 with 23 rules applied. Total rules applied 385 place count 277 transition count 240
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 385 place count 277 transition count 239
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 387 place count 276 transition count 239
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 209 rules applied. Total rules applied 596 place count 170 transition count 136
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 602 place count 170 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 603 place count 169 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 604 place count 168 transition count 135
Applied a total of 604 rules in 69 ms. Remains 168 /480 variables (removed 312) and now considering 135/425 (removed 290) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 69 ms. Remains : 168/480 places, 135/425 transitions.
[2023-03-12 17:50:04] [INFO ] Flatten gal took : 5 ms
[2023-03-12 17:50:04] [INFO ] Flatten gal took : 19 ms
[2023-03-12 17:50:04] [INFO ] Input system was already deterministic with 135 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 452 transition count 397
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 452 transition count 397
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 438 transition count 383
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 438 transition count 383
Applied a total of 84 rules in 36 ms. Remains 438 /480 variables (removed 42) and now considering 383/425 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 438/480 places, 383/425 transitions.
[2023-03-12 17:50:04] [INFO ] Flatten gal took : 11 ms
[2023-03-12 17:50:04] [INFO ] Flatten gal took : 10 ms
[2023-03-12 17:50:04] [INFO ] Input system was already deterministic with 383 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 425/425 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 452 transition count 397
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 452 transition count 397
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 438 transition count 383
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 438 transition count 383
Applied a total of 84 rules in 34 ms. Remains 438 /480 variables (removed 42) and now considering 383/425 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 438/480 places, 383/425 transitions.
[2023-03-12 17:50:04] [INFO ] Flatten gal took : 11 ms
[2023-03-12 17:50:04] [INFO ] Flatten gal took : 11 ms
[2023-03-12 17:50:04] [INFO ] Input system was already deterministic with 383 transitions.
[2023-03-12 17:50:04] [INFO ] Flatten gal took : 12 ms
[2023-03-12 17:50:04] [INFO ] Flatten gal took : 12 ms
[2023-03-12 17:50:04] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-12 17:50:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 480 places, 425 transitions and 1342 arcs took 5 ms.
Total runtime 27581 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/755/ctl_0_ --ctl=/tmp/755/ctl_1_ --ctl=/tmp/755/ctl_2_ --ctl=/tmp/755/ctl_3_ --ctl=/tmp/755/ctl_4_ --ctl=/tmp/755/ctl_5_ --ctl=/tmp/755/ctl_6_ --ctl=/tmp/755/ctl_7_ --ctl=/tmp/755/ctl_8_ --ctl=/tmp/755/ctl_9_ --ctl=/tmp/755/ctl_10_ --ctl=/tmp/755/ctl_11_ --ctl=/tmp/755/ctl_12_ --ctl=/tmp/755/ctl_13_ --ctl=/tmp/755/ctl_14_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393340 kB
MemFree: 9995748 kB
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 16100064 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16101152 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-11"
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-11, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813694800530"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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