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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 7.8K Feb 25 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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 4.2K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 25 16:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:50 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 159K 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-16-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678647056562

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-16
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 18:50:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 18:50:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 18:50:58] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2023-03-12 18:50:58] [INFO ] Transformed 638 places.
[2023-03-12 18:50:58] [INFO ] Transformed 578 transitions.
[2023-03-12 18:50:58] [INFO ] Found NUPN structural information;
[2023-03-12 18:50:58] [INFO ] Parsed PT model containing 638 places and 578 transitions and 1694 arcs in 169 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Deduced a syphon composed of 8 places in 13 ms
Reduce places removed 8 places and 8 transitions.
Support contains 115 out of 630 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 630/630 places, 570/570 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 625 transition count 570
Discarding 75 places :
Symmetric choice reduction at 1 with 75 rule applications. Total rules 80 place count 550 transition count 495
Iterating global reduction 1 with 75 rules applied. Total rules applied 155 place count 550 transition count 495
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 191 place count 514 transition count 459
Iterating global reduction 1 with 36 rules applied. Total rules applied 227 place count 514 transition count 459
Applied a total of 227 rules in 125 ms. Remains 514 /630 variables (removed 116) and now considering 459/570 (removed 111) transitions.
// Phase 1: matrix 459 rows 514 cols
[2023-03-12 18:50:58] [INFO ] Computed 95 place invariants in 37 ms
[2023-03-12 18:50:59] [INFO ] Implicit Places using invariants in 427 ms returned []
[2023-03-12 18:50:59] [INFO ] Invariant cache hit.
[2023-03-12 18:50:59] [INFO ] Implicit Places using invariants and state equation in 515 ms returned []
Implicit Place search using SMT with State Equation took 978 ms to find 0 implicit places.
[2023-03-12 18:50:59] [INFO ] Invariant cache hit.
[2023-03-12 18:50:59] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 514/630 places, 459/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1391 ms. Remains : 514/630 places, 459/570 transitions.
Support contains 115 out of 514 places after structural reductions.
[2023-03-12 18:51:00] [INFO ] Flatten gal took : 76 ms
[2023-03-12 18:51:00] [INFO ] Flatten gal took : 41 ms
[2023-03-12 18:51:00] [INFO ] Input system was already deterministic with 459 transitions.
Support contains 114 out of 514 places (down from 115) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 66 resets, run finished after 583 ms. (steps per millisecond=17 ) properties (out of 74) seen :26
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 48) 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 48) 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 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) seen :0
Running SMT prover for 48 properties.
[2023-03-12 18:51:01] [INFO ] Invariant cache hit.
[2023-03-12 18:51:01] [INFO ] [Real]Absence check using 56 positive place invariants in 14 ms returned sat
[2023-03-12 18:51:01] [INFO ] [Real]Absence check using 56 positive and 39 generalized place invariants in 15 ms returned sat
[2023-03-12 18:51:02] [INFO ] After 243ms SMT Verify possible using state equation in real domain returned unsat :2 sat :2 real:44
[2023-03-12 18:51:02] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 7 ms to minimize.
[2023-03-12 18:51:02] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2023-03-12 18:51:02] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 2 ms to minimize.
[2023-03-12 18:51:02] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 2 ms to minimize.
[2023-03-12 18:51:02] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 1 ms to minimize.
[2023-03-12 18:51:02] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 521 ms
[2023-03-12 18:51:02] [INFO ] After 818ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :0 real:46
[2023-03-12 18:51:02] [INFO ] After 1352ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:46
[2023-03-12 18:51:03] [INFO ] [Nat]Absence check using 56 positive place invariants in 24 ms returned sat
[2023-03-12 18:51:03] [INFO ] [Nat]Absence check using 56 positive and 39 generalized place invariants in 15 ms returned sat
[2023-03-12 18:51:04] [INFO ] After 1102ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :42
[2023-03-12 18:51:04] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 1 ms to minimize.
[2023-03-12 18:51:04] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 1 ms to minimize.
[2023-03-12 18:51:05] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 1 ms to minimize.
[2023-03-12 18:51:05] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 1 ms to minimize.
[2023-03-12 18:51:05] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 1 ms to minimize.
[2023-03-12 18:51:05] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 1 ms to minimize.
[2023-03-12 18:51:05] [INFO ] Deduced a trap composed of 101 places in 107 ms of which 1 ms to minimize.
[2023-03-12 18:51:05] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 1 ms to minimize.
[2023-03-12 18:51:05] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 0 ms to minimize.
[2023-03-12 18:51:06] [INFO ] Deduced a trap composed of 102 places in 113 ms of which 1 ms to minimize.
[2023-03-12 18:51:06] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 1 ms to minimize.
[2023-03-12 18:51:06] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 0 ms to minimize.
[2023-03-12 18:51:06] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 1 ms to minimize.
[2023-03-12 18:51:06] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 1 ms to minimize.
[2023-03-12 18:51:06] [INFO ] Deduced a trap composed of 93 places in 137 ms of which 1 ms to minimize.
[2023-03-12 18:51:06] [INFO ] Deduced a trap composed of 87 places in 135 ms of which 1 ms to minimize.
[2023-03-12 18:51:07] [INFO ] Deduced a trap composed of 89 places in 145 ms of which 1 ms to minimize.
[2023-03-12 18:51:07] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 1 ms to minimize.
[2023-03-12 18:51:07] [INFO ] Deduced a trap composed of 94 places in 119 ms of which 0 ms to minimize.
[2023-03-12 18:51:07] [INFO ] Deduced a trap composed of 88 places in 135 ms of which 1 ms to minimize.
[2023-03-12 18:51:07] [INFO ] Deduced a trap composed of 93 places in 128 ms of which 0 ms to minimize.
[2023-03-12 18:51:07] [INFO ] Deduced a trap composed of 89 places in 126 ms of which 1 ms to minimize.
[2023-03-12 18:51:08] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 1 ms to minimize.
[2023-03-12 18:51:08] [INFO ] Deduced a trap composed of 88 places in 121 ms of which 1 ms to minimize.
[2023-03-12 18:51:08] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 1 ms to minimize.
[2023-03-12 18:51:08] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 1 ms to minimize.
[2023-03-12 18:51:08] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 3852 ms
[2023-03-12 18:51:08] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2023-03-12 18:51:08] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 0 ms to minimize.
[2023-03-12 18:51:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 209 ms
[2023-03-12 18:51:08] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 0 ms to minimize.
[2023-03-12 18:51:08] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2023-03-12 18:51:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 198 ms
[2023-03-12 18:51:09] [INFO ] Deduced a trap composed of 97 places in 142 ms of which 0 ms to minimize.
[2023-03-12 18:51:09] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 0 ms to minimize.
[2023-03-12 18:51:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 252 ms
[2023-03-12 18:51:09] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 0 ms to minimize.
[2023-03-12 18:51:09] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2023-03-12 18:51:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 191 ms
[2023-03-12 18:51:09] [INFO ] Deduced a trap composed of 95 places in 137 ms of which 2 ms to minimize.
[2023-03-12 18:51:09] [INFO ] Deduced a trap composed of 104 places in 127 ms of which 0 ms to minimize.
[2023-03-12 18:51:10] [INFO ] Deduced a trap composed of 100 places in 117 ms of which 1 ms to minimize.
[2023-03-12 18:51:10] [INFO ] Deduced a trap composed of 94 places in 144 ms of which 1 ms to minimize.
[2023-03-12 18:51:10] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 1 ms to minimize.
[2023-03-12 18:51:10] [INFO ] Deduced a trap composed of 98 places in 147 ms of which 1 ms to minimize.
[2023-03-12 18:51:10] [INFO ] Deduced a trap composed of 101 places in 124 ms of which 0 ms to minimize.
[2023-03-12 18:51:10] [INFO ] Deduced a trap composed of 100 places in 115 ms of which 0 ms to minimize.
[2023-03-12 18:51:10] [INFO ] Deduced a trap composed of 96 places in 124 ms of which 0 ms to minimize.
[2023-03-12 18:51:11] [INFO ] Deduced a trap composed of 92 places in 119 ms of which 1 ms to minimize.
[2023-03-12 18:51:11] [INFO ] Deduced a trap composed of 100 places in 136 ms of which 1 ms to minimize.
[2023-03-12 18:51:11] [INFO ] Deduced a trap composed of 100 places in 167 ms of which 3 ms to minimize.
[2023-03-12 18:51:11] [INFO ] Deduced a trap composed of 95 places in 148 ms of which 1 ms to minimize.
[2023-03-12 18:51:11] [INFO ] Deduced a trap composed of 121 places in 123 ms of which 1 ms to minimize.
[2023-03-12 18:51:11] [INFO ] Deduced a trap composed of 100 places in 140 ms of which 0 ms to minimize.
[2023-03-12 18:51:12] [INFO ] Deduced a trap composed of 100 places in 114 ms of which 1 ms to minimize.
[2023-03-12 18:51:12] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 0 ms to minimize.
[2023-03-12 18:51:12] [INFO ] Deduced a trap composed of 99 places in 114 ms of which 5 ms to minimize.
[2023-03-12 18:51:12] [INFO ] Deduced a trap composed of 106 places in 155 ms of which 1 ms to minimize.
[2023-03-12 18:51:12] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 0 ms to minimize.
[2023-03-12 18:51:12] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 0 ms to minimize.
[2023-03-12 18:51:12] [INFO ] Deduced a trap composed of 102 places in 120 ms of which 0 ms to minimize.
[2023-03-12 18:51:13] [INFO ] Deduced a trap composed of 98 places in 144 ms of which 1 ms to minimize.
[2023-03-12 18:51:13] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 1 ms to minimize.
[2023-03-12 18:51:13] [INFO ] Deduced a trap composed of 98 places in 109 ms of which 1 ms to minimize.
[2023-03-12 18:51:13] [INFO ] Deduced a trap composed of 93 places in 127 ms of which 2 ms to minimize.
[2023-03-12 18:51:13] [INFO ] Deduced a trap composed of 98 places in 150 ms of which 5 ms to minimize.
[2023-03-12 18:51:14] [INFO ] Deduced a trap composed of 90 places in 118 ms of which 1 ms to minimize.
[2023-03-12 18:51:14] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 1 ms to minimize.
[2023-03-12 18:51:14] [INFO ] Deduced a trap composed of 95 places in 111 ms of which 0 ms to minimize.
[2023-03-12 18:51:14] [INFO ] Deduced a trap composed of 99 places in 115 ms of which 0 ms to minimize.
[2023-03-12 18:51:14] [INFO ] Deduced a trap composed of 98 places in 116 ms of which 1 ms to minimize.
[2023-03-12 18:51:14] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 1 ms to minimize.
[2023-03-12 18:51:14] [INFO ] Deduced a trap composed of 100 places in 118 ms of which 0 ms to minimize.
[2023-03-12 18:51:15] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 0 ms to minimize.
[2023-03-12 18:51:15] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 1 ms to minimize.
[2023-03-12 18:51:15] [INFO ] Deduced a trap composed of 99 places in 162 ms of which 1 ms to minimize.
[2023-03-12 18:51:15] [INFO ] Deduced a trap composed of 103 places in 149 ms of which 0 ms to minimize.
[2023-03-12 18:51:15] [INFO ] Deduced a trap composed of 98 places in 107 ms of which 1 ms to minimize.
[2023-03-12 18:51:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 39 trap constraints in 6240 ms
[2023-03-12 18:51:16] [INFO ] Deduced a trap composed of 37 places in 165 ms of which 0 ms to minimize.
[2023-03-12 18:51:16] [INFO ] Deduced a trap composed of 88 places in 121 ms of which 0 ms to minimize.
[2023-03-12 18:51:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 361 ms
[2023-03-12 18:51:16] [INFO ] Deduced a trap composed of 51 places in 94 ms of which 0 ms to minimize.
[2023-03-12 18:51:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2023-03-12 18:51:17] [INFO ] Deduced a trap composed of 90 places in 162 ms of which 1 ms to minimize.
[2023-03-12 18:51:17] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 0 ms to minimize.
[2023-03-12 18:51:17] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 1 ms to minimize.
[2023-03-12 18:51:17] [INFO ] Deduced a trap composed of 106 places in 110 ms of which 0 ms to minimize.
[2023-03-12 18:51:17] [INFO ] Deduced a trap composed of 107 places in 105 ms of which 0 ms to minimize.
[2023-03-12 18:51:17] [INFO ] Deduced a trap composed of 105 places in 126 ms of which 0 ms to minimize.
[2023-03-12 18:51:17] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 1 ms to minimize.
[2023-03-12 18:51:18] [INFO ] Deduced a trap composed of 93 places in 120 ms of which 1 ms to minimize.
[2023-03-12 18:51:18] [INFO ] Deduced a trap composed of 93 places in 131 ms of which 0 ms to minimize.
[2023-03-12 18:51:18] [INFO ] Deduced a trap composed of 100 places in 132 ms of which 0 ms to minimize.
[2023-03-12 18:51:18] [INFO ] Deduced a trap composed of 94 places in 158 ms of which 1 ms to minimize.
[2023-03-12 18:51:18] [INFO ] Deduced a trap composed of 97 places in 158 ms of which 0 ms to minimize.
[2023-03-12 18:51:18] [INFO ] Deduced a trap composed of 94 places in 115 ms of which 1 ms to minimize.
[2023-03-12 18:51:18] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2043 ms
[2023-03-12 18:51:19] [INFO ] Deduced a trap composed of 36 places in 180 ms of which 0 ms to minimize.
[2023-03-12 18:51:20] [INFO ] Deduced a trap composed of 34 places in 168 ms of which 1 ms to minimize.
[2023-03-12 18:51:20] [INFO ] Deduced a trap composed of 90 places in 193 ms of which 1 ms to minimize.
[2023-03-12 18:51:20] [INFO ] Deduced a trap composed of 92 places in 183 ms of which 1 ms to minimize.
[2023-03-12 18:51:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 913 ms
[2023-03-12 18:51:20] [INFO ] After 17365ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :39
Attempting to minimize the solution found.
Minimization took 1363 ms.
[2023-03-12 18:51:22] [INFO ] After 19484ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :39
Fused 48 Parikh solutions to 39 different solutions.
Parikh walk visited 11 properties in 568 ms.
Support contains 43 out of 514 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 514/514 places, 459/459 transitions.
Graph (complete) has 1144 edges and 514 vertex of which 513 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 513 transition count 402
Reduce places removed 56 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 59 rules applied. Total rules applied 116 place count 457 transition count 399
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 119 place count 454 transition count 399
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 83 Pre rules applied. Total rules applied 119 place count 454 transition count 316
Deduced a syphon composed of 83 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 299 place count 357 transition count 316
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 318 place count 338 transition count 297
Iterating global reduction 3 with 19 rules applied. Total rules applied 337 place count 338 transition count 297
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 115
Deduced a syphon composed of 115 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 3 with 234 rules applied. Total rules applied 571 place count 219 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 572 place count 219 transition count 181
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 574 place count 218 transition count 185
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 580 place count 218 transition count 185
Partial Post-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 585 place count 218 transition count 185
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 586 place count 217 transition count 184
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 587 place count 216 transition count 184
Applied a total of 587 rules in 160 ms. Remains 216 /514 variables (removed 298) and now considering 184/459 (removed 275) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 216/514 places, 184/459 transitions.
Incomplete random walk after 10000 steps, including 830 resets, run finished after 304 ms. (steps per millisecond=32 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 22 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 23 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 24 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 23 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 17 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 24 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 23 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 23 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 21 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 24 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Interrupted probabilistic random walk after 468186 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :{0=1, 1=1, 4=1, 5=1, 6=1, 8=1, 9=1, 10=1, 11=1, 12=1, 14=1, 15=1, 16=1, 17=1, 18=1, 20=1, 21=1, 22=1, 23=1, 25=1, 26=1, 27=1}
Probabilistic random walk after 468186 steps, saw 86011 distinct states, run finished after 3002 ms. (steps per millisecond=155 ) properties seen :22
Running SMT prover for 6 properties.
// Phase 1: matrix 184 rows 216 cols
[2023-03-12 18:51:26] [INFO ] Computed 76 place invariants in 10 ms
[2023-03-12 18:51:26] [INFO ] [Real]Absence check using 56 positive place invariants in 7 ms returned sat
[2023-03-12 18:51:26] [INFO ] [Real]Absence check using 56 positive and 20 generalized place invariants in 3 ms returned sat
[2023-03-12 18:51:26] [INFO ] After 65ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:4
[2023-03-12 18:51:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 18:51:26] [INFO ] After 13ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 18:51:26] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 18:51:26] [INFO ] [Nat]Absence check using 56 positive place invariants in 10 ms returned sat
[2023-03-12 18:51:26] [INFO ] [Nat]Absence check using 56 positive and 20 generalized place invariants in 4 ms returned sat
[2023-03-12 18:51:26] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 18:51:26] [INFO ] After 35ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 18:51:27] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2023-03-12 18:51:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-03-12 18:51:27] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 1 ms to minimize.
[2023-03-12 18:51:27] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 0 ms to minimize.
[2023-03-12 18:51:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 144 ms
[2023-03-12 18:51:27] [INFO ] After 330ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-12 18:51:27] [INFO ] After 564ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 2 properties in 25 ms.
Support contains 6 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 184/184 transitions.
Graph (trivial) has 39 edges and 216 vertex of which 2 / 216 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 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 215 transition count 178
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 211 transition count 178
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 9 place count 211 transition count 161
Deduced a syphon composed of 17 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 45 place count 192 transition count 161
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 49 place count 188 transition count 156
Iterating global reduction 2 with 4 rules applied. Total rules applied 53 place count 188 transition count 156
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 80 place count 174 transition count 143
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 2 with 2 rules applied. Total rules applied 82 place count 173 transition count 143
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 173 transition count 141
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 171 transition count 141
Applied a total of 86 rules in 48 ms. Remains 171 /216 variables (removed 45) and now considering 141/184 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 171/216 places, 141/184 transitions.
Incomplete random walk after 10000 steps, including 446 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 212 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 213 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 201 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 213 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 141 rows 171 cols
[2023-03-12 18:51:27] [INFO ] Computed 73 place invariants in 3 ms
[2023-03-12 18:51:28] [INFO ] [Real]Absence check using 55 positive place invariants in 9 ms returned sat
[2023-03-12 18:51:28] [INFO ] [Real]Absence check using 55 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-12 18:51:28] [INFO ] After 62ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-12 18:51:28] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 18:51:28] [INFO ] After 11ms SMT Verify possible using 4 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 18:51:28] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 18:51:28] [INFO ] [Nat]Absence check using 55 positive place invariants in 8 ms returned sat
[2023-03-12 18:51:28] [INFO ] [Nat]Absence check using 55 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-12 18:51:28] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 18:51:28] [INFO ] After 9ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 18:51:28] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2023-03-12 18:51:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-12 18:51:28] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-12 18:51:28] [INFO ] After 203ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 141/141 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 171 transition count 138
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 168 transition count 138
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 168 transition count 137
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 9 place count 166 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 165 transition count 136
Applied a total of 11 rules in 18 ms. Remains 165 /171 variables (removed 6) and now considering 136/141 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 165/171 places, 136/141 transitions.
Incomplete random walk after 10000 steps, including 425 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 229 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 222 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 2) seen :0
Finished probabilistic random walk after 4010 steps, run visited all 2 properties in 32 ms. (steps per millisecond=125 )
Probabilistic random walk after 4010 steps, saw 1407 distinct states, run finished after 32 ms. (steps per millisecond=125 ) properties seen :2
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
[2023-03-12 18:51:28] [INFO ] Flatten gal took : 29 ms
[2023-03-12 18:51:28] [INFO ] Flatten gal took : 29 ms
[2023-03-12 18:51:28] [INFO ] Input system was already deterministic with 459 transitions.
Support contains 92 out of 514 places (down from 94) after GAL structural reductions.
Computed a total of 142 stabilizing places and 135 stable transitions
Graph (complete) has 1144 edges and 514 vertex of which 513 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.16 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 514/514 places, 459/459 transitions.
Graph (trivial) has 257 edges and 514 vertex of which 6 / 514 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 1138 edges and 509 vertex of which 508 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 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 71 place count 507 transition count 382
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 140 place count 438 transition count 382
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 140 place count 438 transition count 281
Deduced a syphon composed of 101 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 218 rules applied. Total rules applied 358 place count 321 transition count 281
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 389 place count 290 transition count 250
Iterating global reduction 2 with 31 rules applied. Total rules applied 420 place count 290 transition count 250
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 420 place count 290 transition count 248
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 424 place count 288 transition count 248
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 227 rules applied. Total rules applied 651 place count 172 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 652 place count 171 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 653 place count 170 transition count 136
Applied a total of 653 rules in 71 ms. Remains 170 /514 variables (removed 344) and now considering 136/459 (removed 323) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 71 ms. Remains : 170/514 places, 136/459 transitions.
[2023-03-12 18:51:28] [INFO ] Flatten gal took : 11 ms
[2023-03-12 18:51:28] [INFO ] Flatten gal took : 12 ms
[2023-03-12 18:51:28] [INFO ] Input system was already deterministic with 136 transitions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 459/459 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 481 transition count 426
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 481 transition count 426
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 75 place count 472 transition count 417
Iterating global reduction 0 with 9 rules applied. Total rules applied 84 place count 472 transition count 417
Applied a total of 84 rules in 43 ms. Remains 472 /514 variables (removed 42) and now considering 417/459 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 472/514 places, 417/459 transitions.
[2023-03-12 18:51:28] [INFO ] Flatten gal took : 21 ms
[2023-03-12 18:51:29] [INFO ] Flatten gal took : 22 ms
[2023-03-12 18:51:29] [INFO ] Input system was already deterministic with 417 transitions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 459/459 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 481 transition count 426
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 481 transition count 426
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 75 place count 472 transition count 417
Iterating global reduction 0 with 9 rules applied. Total rules applied 84 place count 472 transition count 417
Applied a total of 84 rules in 30 ms. Remains 472 /514 variables (removed 42) and now considering 417/459 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 472/514 places, 417/459 transitions.
[2023-03-12 18:51:29] [INFO ] Flatten gal took : 20 ms
[2023-03-12 18:51:29] [INFO ] Flatten gal took : 21 ms
[2023-03-12 18:51:29] [INFO ] Input system was already deterministic with 417 transitions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 459/459 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 480 transition count 425
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 480 transition count 425
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 77 place count 471 transition count 416
Iterating global reduction 0 with 9 rules applied. Total rules applied 86 place count 471 transition count 416
Applied a total of 86 rules in 31 ms. Remains 471 /514 variables (removed 43) and now considering 416/459 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 471/514 places, 416/459 transitions.
[2023-03-12 18:51:29] [INFO ] Flatten gal took : 18 ms
[2023-03-12 18:51:29] [INFO ] Flatten gal took : 19 ms
[2023-03-12 18:51:29] [INFO ] Input system was already deterministic with 416 transitions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 459/459 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 483 transition count 428
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 483 transition count 428
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 69 place count 476 transition count 421
Iterating global reduction 0 with 7 rules applied. Total rules applied 76 place count 476 transition count 421
Applied a total of 76 rules in 32 ms. Remains 476 /514 variables (removed 38) and now considering 421/459 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 476/514 places, 421/459 transitions.
[2023-03-12 18:51:29] [INFO ] Flatten gal took : 17 ms
[2023-03-12 18:51:29] [INFO ] Flatten gal took : 17 ms
[2023-03-12 18:51:29] [INFO ] Input system was already deterministic with 421 transitions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 459/459 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 480 transition count 425
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 480 transition count 425
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 77 place count 471 transition count 416
Iterating global reduction 0 with 9 rules applied. Total rules applied 86 place count 471 transition count 416
Applied a total of 86 rules in 27 ms. Remains 471 /514 variables (removed 43) and now considering 416/459 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 471/514 places, 416/459 transitions.
[2023-03-12 18:51:29] [INFO ] Flatten gal took : 12 ms
[2023-03-12 18:51:29] [INFO ] Flatten gal took : 12 ms
[2023-03-12 18:51:29] [INFO ] Input system was already deterministic with 416 transitions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 459/459 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 480 transition count 425
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 480 transition count 425
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 76 place count 472 transition count 417
Iterating global reduction 0 with 8 rules applied. Total rules applied 84 place count 472 transition count 417
Applied a total of 84 rules in 24 ms. Remains 472 /514 variables (removed 42) and now considering 417/459 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 472/514 places, 417/459 transitions.
[2023-03-12 18:51:29] [INFO ] Flatten gal took : 10 ms
[2023-03-12 18:51:29] [INFO ] Flatten gal took : 11 ms
[2023-03-12 18:51:29] [INFO ] Input system was already deterministic with 417 transitions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 459/459 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 481 transition count 426
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 481 transition count 426
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 75 place count 472 transition count 417
Iterating global reduction 0 with 9 rules applied. Total rules applied 84 place count 472 transition count 417
Applied a total of 84 rules in 27 ms. Remains 472 /514 variables (removed 42) and now considering 417/459 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 472/514 places, 417/459 transitions.
[2023-03-12 18:51:29] [INFO ] Flatten gal took : 12 ms
[2023-03-12 18:51:29] [INFO ] Flatten gal took : 12 ms
[2023-03-12 18:51:29] [INFO ] Input system was already deterministic with 417 transitions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 459/459 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 486 transition count 431
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 486 transition count 431
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 64 place count 478 transition count 423
Iterating global reduction 0 with 8 rules applied. Total rules applied 72 place count 478 transition count 423
Applied a total of 72 rules in 26 ms. Remains 478 /514 variables (removed 36) and now considering 423/459 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 478/514 places, 423/459 transitions.
[2023-03-12 18:51:29] [INFO ] Flatten gal took : 11 ms
[2023-03-12 18:51:29] [INFO ] Flatten gal took : 12 ms
[2023-03-12 18:51:29] [INFO ] Input system was already deterministic with 423 transitions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 459/459 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 488 transition count 433
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 488 transition count 433
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 59 place count 481 transition count 426
Iterating global reduction 0 with 7 rules applied. Total rules applied 66 place count 481 transition count 426
Applied a total of 66 rules in 24 ms. Remains 481 /514 variables (removed 33) and now considering 426/459 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 481/514 places, 426/459 transitions.
[2023-03-12 18:51:29] [INFO ] Flatten gal took : 12 ms
[2023-03-12 18:51:29] [INFO ] Flatten gal took : 11 ms
[2023-03-12 18:51:29] [INFO ] Input system was already deterministic with 426 transitions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 459/459 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 481 transition count 426
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 481 transition count 426
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 74 place count 473 transition count 418
Iterating global reduction 0 with 8 rules applied. Total rules applied 82 place count 473 transition count 418
Applied a total of 82 rules in 26 ms. Remains 473 /514 variables (removed 41) and now considering 418/459 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 473/514 places, 418/459 transitions.
[2023-03-12 18:51:29] [INFO ] Flatten gal took : 11 ms
[2023-03-12 18:51:29] [INFO ] Flatten gal took : 11 ms
[2023-03-12 18:51:29] [INFO ] Input system was already deterministic with 418 transitions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 459/459 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 482 transition count 427
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 482 transition count 427
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 72 place count 474 transition count 419
Iterating global reduction 0 with 8 rules applied. Total rules applied 80 place count 474 transition count 419
Applied a total of 80 rules in 31 ms. Remains 474 /514 variables (removed 40) and now considering 419/459 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 474/514 places, 419/459 transitions.
[2023-03-12 18:51:29] [INFO ] Flatten gal took : 12 ms
[2023-03-12 18:51:29] [INFO ] Flatten gal took : 11 ms
[2023-03-12 18:51:29] [INFO ] Input system was already deterministic with 419 transitions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 459/459 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 481 transition count 426
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 481 transition count 426
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 74 place count 473 transition count 418
Iterating global reduction 0 with 8 rules applied. Total rules applied 82 place count 473 transition count 418
Applied a total of 82 rules in 27 ms. Remains 473 /514 variables (removed 41) and now considering 418/459 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 473/514 places, 418/459 transitions.
[2023-03-12 18:51:29] [INFO ] Flatten gal took : 11 ms
[2023-03-12 18:51:29] [INFO ] Flatten gal took : 11 ms
[2023-03-12 18:51:30] [INFO ] Input system was already deterministic with 418 transitions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 459/459 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 485 transition count 430
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 485 transition count 430
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 66 place count 477 transition count 422
Iterating global reduction 0 with 8 rules applied. Total rules applied 74 place count 477 transition count 422
Applied a total of 74 rules in 28 ms. Remains 477 /514 variables (removed 37) and now considering 422/459 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 477/514 places, 422/459 transitions.
[2023-03-12 18:51:30] [INFO ] Flatten gal took : 11 ms
[2023-03-12 18:51:30] [INFO ] Flatten gal took : 12 ms
[2023-03-12 18:51:30] [INFO ] Input system was already deterministic with 422 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 514/514 places, 459/459 transitions.
Graph (trivial) has 257 edges and 514 vertex of which 6 / 514 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 1138 edges and 509 vertex of which 508 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 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 72 place count 507 transition count 381
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 142 place count 437 transition count 381
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 142 place count 437 transition count 280
Deduced a syphon composed of 101 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 219 rules applied. Total rules applied 361 place count 319 transition count 280
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 390 place count 290 transition count 251
Iterating global reduction 2 with 29 rules applied. Total rules applied 419 place count 290 transition count 251
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 419 place count 290 transition count 249
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 423 place count 288 transition count 249
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 2 with 233 rules applied. Total rules applied 656 place count 169 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 657 place count 168 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 658 place count 167 transition count 134
Applied a total of 658 rules in 43 ms. Remains 167 /514 variables (removed 347) and now considering 134/459 (removed 325) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 167/514 places, 134/459 transitions.
[2023-03-12 18:51:30] [INFO ] Flatten gal took : 5 ms
[2023-03-12 18:51:30] [INFO ] Flatten gal took : 6 ms
[2023-03-12 18:51:30] [INFO ] Input system was already deterministic with 134 transitions.
Incomplete random walk after 10000 steps, including 2067 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 629 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Finished probabilistic random walk after 206 steps, run visited all 1 properties in 5 ms. (steps per millisecond=41 )
Probabilistic random walk after 206 steps, saw 137 distinct states, run finished after 6 ms. (steps per millisecond=34 ) properties seen :1
FORMULA BusinessProcesses-PT-16-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 459/459 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 482 transition count 427
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 482 transition count 427
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 73 place count 473 transition count 418
Iterating global reduction 0 with 9 rules applied. Total rules applied 82 place count 473 transition count 418
Applied a total of 82 rules in 24 ms. Remains 473 /514 variables (removed 41) and now considering 418/459 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 473/514 places, 418/459 transitions.
[2023-03-12 18:51:30] [INFO ] Flatten gal took : 11 ms
[2023-03-12 18:51:30] [INFO ] Flatten gal took : 12 ms
[2023-03-12 18:51:30] [INFO ] Input system was already deterministic with 418 transitions.
[2023-03-12 18:51:30] [INFO ] Flatten gal took : 12 ms
[2023-03-12 18:51:30] [INFO ] Flatten gal took : 12 ms
[2023-03-12 18:51:30] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-12 18:51:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 514 places, 459 transitions and 1451 arcs took 2 ms.
Total runtime 32141 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/809/ctl_0_ --ctl=/tmp/809/ctl_1_ --ctl=/tmp/809/ctl_2_ --ctl=/tmp/809/ctl_3_ --ctl=/tmp/809/ctl_4_ --ctl=/tmp/809/ctl_5_ --ctl=/tmp/809/ctl_6_ --ctl=/tmp/809/ctl_7_ --ctl=/tmp/809/ctl_8_ --ctl=/tmp/809/ctl_9_ --ctl=/tmp/809/ctl_10_ --ctl=/tmp/809/ctl_11_ --ctl=/tmp/809/ctl_12_ --ctl=/tmp/809/ctl_13_ --ctl=/tmp/809/ctl_14_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 10267500 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16099444 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-16"
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-16, 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-167813694900570"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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