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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:50 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.3K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 25 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:52 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 131K 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-10-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678641966351

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 17:26:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 17:26:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:26:08] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2023-03-12 17:26:08] [INFO ] Transformed 518 places.
[2023-03-12 17:26:08] [INFO ] Transformed 471 transitions.
[2023-03-12 17:26:08] [INFO ] Found NUPN structural information;
[2023-03-12 17:26:08] [INFO ] Parsed PT model containing 518 places and 471 transitions and 1415 arcs in 182 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 10 ms.
Support contains 100 out of 518 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 471/471 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 517 transition count 471
Discarding 55 places :
Symmetric choice reduction at 1 with 55 rule applications. Total rules 56 place count 462 transition count 416
Iterating global reduction 1 with 55 rules applied. Total rules applied 111 place count 462 transition count 416
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 134 place count 439 transition count 393
Iterating global reduction 1 with 23 rules applied. Total rules applied 157 place count 439 transition count 393
Applied a total of 157 rules in 80 ms. Remains 439 /518 variables (removed 79) and now considering 393/471 (removed 78) transitions.
// Phase 1: matrix 393 rows 439 cols
[2023-03-12 17:26:08] [INFO ] Computed 84 place invariants in 31 ms
[2023-03-12 17:26:08] [INFO ] Implicit Places using invariants in 343 ms returned []
[2023-03-12 17:26:08] [INFO ] Invariant cache hit.
[2023-03-12 17:26:08] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 753 ms to find 0 implicit places.
[2023-03-12 17:26:08] [INFO ] Invariant cache hit.
[2023-03-12 17:26:09] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 439/518 places, 393/471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1044 ms. Remains : 439/518 places, 393/471 transitions.
Support contains 100 out of 439 places after structural reductions.
[2023-03-12 17:26:09] [INFO ] Flatten gal took : 52 ms
[2023-03-12 17:26:09] [INFO ] Flatten gal took : 26 ms
[2023-03-12 17:26:09] [INFO ] Input system was already deterministic with 393 transitions.
Support contains 93 out of 439 places (down from 100) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 82 resets, run finished after 531 ms. (steps per millisecond=18 ) properties (out of 57) seen :25
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) seen :0
Running SMT prover for 32 properties.
[2023-03-12 17:26:10] [INFO ] Invariant cache hit.
[2023-03-12 17:26:10] [INFO ] [Real]Absence check using 47 positive place invariants in 12 ms returned sat
[2023-03-12 17:26:10] [INFO ] [Real]Absence check using 47 positive and 37 generalized place invariants in 10 ms returned sat
[2023-03-12 17:26:10] [INFO ] After 335ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:32
[2023-03-12 17:26:10] [INFO ] [Nat]Absence check using 47 positive place invariants in 12 ms returned sat
[2023-03-12 17:26:10] [INFO ] [Nat]Absence check using 47 positive and 37 generalized place invariants in 9 ms returned sat
[2023-03-12 17:26:11] [INFO ] After 574ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :31
[2023-03-12 17:26:11] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 6 ms to minimize.
[2023-03-12 17:26:11] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 1 ms to minimize.
[2023-03-12 17:26:12] [INFO ] Deduced a trap composed of 76 places in 134 ms of which 1 ms to minimize.
[2023-03-12 17:26:12] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 2 ms to minimize.
[2023-03-12 17:26:12] [INFO ] Deduced a trap composed of 77 places in 181 ms of which 1 ms to minimize.
[2023-03-12 17:26:12] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 1 ms to minimize.
[2023-03-12 17:26:12] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 1 ms to minimize.
[2023-03-12 17:26:12] [INFO ] Deduced a trap composed of 83 places in 119 ms of which 0 ms to minimize.
[2023-03-12 17:26:12] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 0 ms to minimize.
[2023-03-12 17:26:12] [INFO ] Deduced a trap composed of 92 places in 112 ms of which 1 ms to minimize.
[2023-03-12 17:26:13] [INFO ] Deduced a trap composed of 100 places in 95 ms of which 1 ms to minimize.
[2023-03-12 17:26:13] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2023-03-12 17:26:13] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2023-03-12 17:26:13] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2023-03-12 17:26:13] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2023-03-12 17:26:13] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 0 ms to minimize.
[2023-03-12 17:26:13] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 0 ms to minimize.
[2023-03-12 17:26:13] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1958 ms
[2023-03-12 17:26:13] [INFO ] Deduced a trap composed of 94 places in 90 ms of which 0 ms to minimize.
[2023-03-12 17:26:13] [INFO ] Deduced a trap composed of 81 places in 81 ms of which 1 ms to minimize.
[2023-03-12 17:26:13] [INFO ] Deduced a trap composed of 82 places in 95 ms of which 0 ms to minimize.
[2023-03-12 17:26:14] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 0 ms to minimize.
[2023-03-12 17:26:14] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 13 ms to minimize.
[2023-03-12 17:26:14] [INFO ] Deduced a trap composed of 98 places in 88 ms of which 0 ms to minimize.
[2023-03-12 17:26:14] [INFO ] Deduced a trap composed of 83 places in 91 ms of which 0 ms to minimize.
[2023-03-12 17:26:14] [INFO ] Deduced a trap composed of 80 places in 91 ms of which 0 ms to minimize.
[2023-03-12 17:26:14] [INFO ] Deduced a trap composed of 90 places in 86 ms of which 0 ms to minimize.
[2023-03-12 17:26:14] [INFO ] Deduced a trap composed of 81 places in 72 ms of which 0 ms to minimize.
[2023-03-12 17:26:14] [INFO ] Deduced a trap composed of 78 places in 71 ms of which 0 ms to minimize.
[2023-03-12 17:26:14] [INFO ] Deduced a trap composed of 81 places in 69 ms of which 1 ms to minimize.
[2023-03-12 17:26:14] [INFO ] Deduced a trap composed of 88 places in 70 ms of which 2 ms to minimize.
[2023-03-12 17:26:14] [INFO ] Deduced a trap composed of 86 places in 68 ms of which 0 ms to minimize.
[2023-03-12 17:26:15] [INFO ] Deduced a trap composed of 84 places in 68 ms of which 1 ms to minimize.
[2023-03-12 17:26:15] [INFO ] Deduced a trap composed of 84 places in 66 ms of which 1 ms to minimize.
[2023-03-12 17:26:15] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1608 ms
[2023-03-12 17:26:15] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 1 ms to minimize.
[2023-03-12 17:26:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2023-03-12 17:26:15] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 2 ms to minimize.
[2023-03-12 17:26:15] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 2 ms to minimize.
[2023-03-12 17:26:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 175 ms
[2023-03-12 17:26:15] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
[2023-03-12 17:26:15] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 1 ms to minimize.
[2023-03-12 17:26:15] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2023-03-12 17:26:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 276 ms
[2023-03-12 17:26:16] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 1 ms to minimize.
[2023-03-12 17:26:16] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 0 ms to minimize.
[2023-03-12 17:26:16] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2023-03-12 17:26:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 280 ms
[2023-03-12 17:26:16] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 0 ms to minimize.
[2023-03-12 17:26:16] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 1 ms to minimize.
[2023-03-12 17:26:16] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 0 ms to minimize.
[2023-03-12 17:26:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 265 ms
[2023-03-12 17:26:16] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 0 ms to minimize.
[2023-03-12 17:26:16] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 0 ms to minimize.
[2023-03-12 17:26:16] [INFO ] Deduced a trap composed of 88 places in 84 ms of which 1 ms to minimize.
[2023-03-12 17:26:16] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2023-03-12 17:26:16] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 0 ms to minimize.
[2023-03-12 17:26:16] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 459 ms
[2023-03-12 17:26:17] [INFO ] Deduced a trap composed of 55 places in 57 ms of which 1 ms to minimize.
[2023-03-12 17:26:17] [INFO ] Deduced a trap composed of 57 places in 59 ms of which 0 ms to minimize.
[2023-03-12 17:26:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 156 ms
[2023-03-12 17:26:17] [INFO ] Deduced a trap composed of 90 places in 82 ms of which 1 ms to minimize.
[2023-03-12 17:26:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-03-12 17:26:17] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 0 ms to minimize.
[2023-03-12 17:26:17] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
[2023-03-12 17:26:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 167 ms
[2023-03-12 17:26:17] [INFO ] Deduced a trap composed of 90 places in 91 ms of which 0 ms to minimize.
[2023-03-12 17:26:17] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 5 ms to minimize.
[2023-03-12 17:26:17] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 0 ms to minimize.
[2023-03-12 17:26:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 321 ms
[2023-03-12 17:26:17] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 0 ms to minimize.
[2023-03-12 17:26:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-03-12 17:26:18] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 0 ms to minimize.
[2023-03-12 17:26:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-12 17:26:18] [INFO ] Deduced a trap composed of 68 places in 63 ms of which 0 ms to minimize.
[2023-03-12 17:26:18] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 0 ms to minimize.
[2023-03-12 17:26:18] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 1 ms to minimize.
[2023-03-12 17:26:18] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 1 ms to minimize.
[2023-03-12 17:26:18] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 1 ms to minimize.
[2023-03-12 17:26:18] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 2 ms to minimize.
[2023-03-12 17:26:18] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 2 ms to minimize.
[2023-03-12 17:26:18] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 587 ms
[2023-03-12 17:26:18] [INFO ] Deduced a trap composed of 85 places in 77 ms of which 2 ms to minimize.
[2023-03-12 17:26:18] [INFO ] Deduced a trap composed of 87 places in 75 ms of which 1 ms to minimize.
[2023-03-12 17:26:18] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 0 ms to minimize.
[2023-03-12 17:26:19] [INFO ] Deduced a trap composed of 82 places in 74 ms of which 0 ms to minimize.
[2023-03-12 17:26:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 397 ms
[2023-03-12 17:26:19] [INFO ] After 8223ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :31
Attempting to minimize the solution found.
Minimization took 504 ms.
[2023-03-12 17:26:19] [INFO ] After 9177ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :31
Fused 32 Parikh solutions to 31 different solutions.
Parikh walk visited 1 properties in 192 ms.
Support contains 52 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 393/393 transitions.
Graph (trivial) has 166 edges and 439 vertex of which 6 / 439 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 979 edges and 434 vertex of which 433 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 40 place count 433 transition count 347
Reduce places removed 38 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 40 rules applied. Total rules applied 80 place count 395 transition count 345
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 82 place count 393 transition count 345
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 62 Pre rules applied. Total rules applied 82 place count 393 transition count 283
Deduced a syphon composed of 62 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 127 rules applied. Total rules applied 209 place count 328 transition count 283
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 221 place count 316 transition count 271
Iterating global reduction 3 with 12 rules applied. Total rules applied 233 place count 316 transition count 271
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 233 place count 316 transition count 269
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 237 place count 314 transition count 269
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 415 place count 225 transition count 180
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 417 place count 224 transition count 183
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 419 place count 224 transition count 181
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 421 place count 222 transition count 181
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 425 place count 222 transition count 181
Applied a total of 425 rules in 86 ms. Remains 222 /439 variables (removed 217) and now considering 181/393 (removed 212) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 222/439 places, 181/393 transitions.
Finished random walk after 600 steps, including 13 resets, run visited all 30 properties in 10 ms. (steps per millisecond=60 )
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2023-03-12 17:26:20] [INFO ] Flatten gal took : 19 ms
[2023-03-12 17:26:20] [INFO ] Flatten gal took : 20 ms
[2023-03-12 17:26:20] [INFO ] Input system was already deterministic with 393 transitions.
Computed a total of 216 stabilizing places and 221 stable transitions
Graph (complete) has 986 edges and 439 vertex of which 438 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 393/393 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 411 transition count 365
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 411 transition count 365
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 67 place count 400 transition count 354
Iterating global reduction 0 with 11 rules applied. Total rules applied 78 place count 400 transition count 354
Applied a total of 78 rules in 39 ms. Remains 400 /439 variables (removed 39) and now considering 354/393 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 400/439 places, 354/393 transitions.
[2023-03-12 17:26:20] [INFO ] Flatten gal took : 16 ms
[2023-03-12 17:26:20] [INFO ] Flatten gal took : 16 ms
[2023-03-12 17:26:20] [INFO ] Input system was already deterministic with 354 transitions.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 393/393 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 412 transition count 366
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 412 transition count 366
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 63 place count 403 transition count 357
Iterating global reduction 0 with 9 rules applied. Total rules applied 72 place count 403 transition count 357
Applied a total of 72 rules in 20 ms. Remains 403 /439 variables (removed 36) and now considering 357/393 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 403/439 places, 357/393 transitions.
[2023-03-12 17:26:20] [INFO ] Flatten gal took : 17 ms
[2023-03-12 17:26:20] [INFO ] Flatten gal took : 16 ms
[2023-03-12 17:26:20] [INFO ] Input system was already deterministic with 357 transitions.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 393/393 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 411 transition count 365
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 411 transition count 365
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 67 place count 400 transition count 354
Iterating global reduction 0 with 11 rules applied. Total rules applied 78 place count 400 transition count 354
Applied a total of 78 rules in 20 ms. Remains 400 /439 variables (removed 39) and now considering 354/393 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 400/439 places, 354/393 transitions.
[2023-03-12 17:26:20] [INFO ] Flatten gal took : 15 ms
[2023-03-12 17:26:20] [INFO ] Flatten gal took : 14 ms
[2023-03-12 17:26:20] [INFO ] Input system was already deterministic with 354 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 439/439 places, 393/393 transitions.
Graph (trivial) has 210 edges and 439 vertex of which 6 / 439 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 980 edges and 434 vertex of which 433 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 55 place count 433 transition count 333
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 108 place count 380 transition count 333
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 83 Pre rules applied. Total rules applied 108 place count 380 transition count 250
Deduced a syphon composed of 83 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 286 place count 285 transition count 250
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 311 place count 260 transition count 225
Iterating global reduction 2 with 25 rules applied. Total rules applied 336 place count 260 transition count 225
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 336 place count 260 transition count 223
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 340 place count 258 transition count 223
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 191 rules applied. Total rules applied 531 place count 162 transition count 128
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 537 place count 162 transition count 128
Applied a total of 537 rules in 46 ms. Remains 162 /439 variables (removed 277) and now considering 128/393 (removed 265) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46 ms. Remains : 162/439 places, 128/393 transitions.
[2023-03-12 17:26:20] [INFO ] Flatten gal took : 8 ms
[2023-03-12 17:26:20] [INFO ] Flatten gal took : 8 ms
[2023-03-12 17:26:20] [INFO ] Input system was already deterministic with 128 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 439/439 places, 393/393 transitions.
Graph (trivial) has 215 edges and 439 vertex of which 6 / 439 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 980 edges and 434 vertex of which 433 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 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 432 transition count 330
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 112 place count 377 transition count 330
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 112 place count 377 transition count 246
Deduced a syphon composed of 84 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 181 rules applied. Total rules applied 293 place count 280 transition count 246
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 320 place count 253 transition count 219
Iterating global reduction 2 with 27 rules applied. Total rules applied 347 place count 253 transition count 219
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 347 place count 253 transition count 216
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 353 place count 250 transition count 216
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 193 rules applied. Total rules applied 546 place count 151 transition count 122
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 548 place count 150 transition count 121
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 549 place count 149 transition count 120
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 550 place count 148 transition count 120
Applied a total of 550 rules in 43 ms. Remains 148 /439 variables (removed 291) and now considering 120/393 (removed 273) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 148/439 places, 120/393 transitions.
[2023-03-12 17:26:20] [INFO ] Flatten gal took : 6 ms
[2023-03-12 17:26:20] [INFO ] Flatten gal took : 7 ms
[2023-03-12 17:26:20] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 439/439 places, 393/393 transitions.
Graph (trivial) has 211 edges and 439 vertex of which 6 / 439 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 980 edges and 434 vertex of which 433 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 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 432 transition count 331
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 378 transition count 331
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 82 Pre rules applied. Total rules applied 110 place count 378 transition count 249
Deduced a syphon composed of 82 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 2 with 175 rules applied. Total rules applied 285 place count 285 transition count 249
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 313 place count 257 transition count 221
Iterating global reduction 2 with 28 rules applied. Total rules applied 341 place count 257 transition count 221
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 341 place count 257 transition count 218
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 347 place count 254 transition count 218
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 527 place count 163 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 529 place count 162 transition count 128
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 530 place count 161 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 531 place count 160 transition count 127
Applied a total of 531 rules in 39 ms. Remains 160 /439 variables (removed 279) and now considering 127/393 (removed 266) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 160/439 places, 127/393 transitions.
[2023-03-12 17:26:20] [INFO ] Flatten gal took : 6 ms
[2023-03-12 17:26:20] [INFO ] Flatten gal took : 6 ms
[2023-03-12 17:26:20] [INFO ] Input system was already deterministic with 127 transitions.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 393/393 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 411 transition count 365
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 411 transition count 365
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 67 place count 400 transition count 354
Iterating global reduction 0 with 11 rules applied. Total rules applied 78 place count 400 transition count 354
Applied a total of 78 rules in 22 ms. Remains 400 /439 variables (removed 39) and now considering 354/393 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 400/439 places, 354/393 transitions.
[2023-03-12 17:26:20] [INFO ] Flatten gal took : 11 ms
[2023-03-12 17:26:20] [INFO ] Flatten gal took : 11 ms
[2023-03-12 17:26:20] [INFO ] Input system was already deterministic with 354 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 439/439 places, 393/393 transitions.
Graph (trivial) has 217 edges and 439 vertex of which 6 / 439 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 980 edges and 434 vertex of which 433 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 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 58 place count 432 transition count 329
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 114 place count 376 transition count 329
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 114 place count 376 transition count 244
Deduced a syphon composed of 85 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 183 rules applied. Total rules applied 297 place count 278 transition count 244
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 325 place count 250 transition count 216
Iterating global reduction 2 with 28 rules applied. Total rules applied 353 place count 250 transition count 216
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 353 place count 250 transition count 213
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 359 place count 247 transition count 213
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 187 rules applied. Total rules applied 546 place count 151 transition count 122
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 548 place count 150 transition count 121
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 549 place count 149 transition count 120
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 550 place count 148 transition count 120
Applied a total of 550 rules in 39 ms. Remains 148 /439 variables (removed 291) and now considering 120/393 (removed 273) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 148/439 places, 120/393 transitions.
[2023-03-12 17:26:20] [INFO ] Flatten gal took : 5 ms
[2023-03-12 17:26:20] [INFO ] Flatten gal took : 5 ms
[2023-03-12 17:26:20] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 393/393 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 412 transition count 366
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 412 transition count 366
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 65 place count 401 transition count 355
Iterating global reduction 0 with 11 rules applied. Total rules applied 76 place count 401 transition count 355
Applied a total of 76 rules in 20 ms. Remains 401 /439 variables (removed 38) and now considering 355/393 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 401/439 places, 355/393 transitions.
[2023-03-12 17:26:20] [INFO ] Flatten gal took : 10 ms
[2023-03-12 17:26:20] [INFO ] Flatten gal took : 11 ms
[2023-03-12 17:26:20] [INFO ] Input system was already deterministic with 355 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 439/439 places, 393/393 transitions.
Graph (trivial) has 205 edges and 439 vertex of which 6 / 439 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 980 edges and 434 vertex of which 433 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 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 432 transition count 333
Reduce places removed 52 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 53 rules applied. Total rules applied 107 place count 380 transition count 332
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 108 place count 379 transition count 332
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 108 place count 379 transition count 255
Deduced a syphon composed of 77 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 164 rules applied. Total rules applied 272 place count 292 transition count 255
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 297 place count 267 transition count 230
Iterating global reduction 3 with 25 rules applied. Total rules applied 322 place count 267 transition count 230
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 322 place count 267 transition count 227
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 328 place count 264 transition count 227
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 520 place count 166 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 522 place count 165 transition count 132
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 523 place count 164 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 524 place count 163 transition count 131
Applied a total of 524 rules in 39 ms. Remains 163 /439 variables (removed 276) and now considering 131/393 (removed 262) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 163/439 places, 131/393 transitions.
[2023-03-12 17:26:20] [INFO ] Flatten gal took : 5 ms
[2023-03-12 17:26:20] [INFO ] Flatten gal took : 5 ms
[2023-03-12 17:26:20] [INFO ] Input system was already deterministic with 131 transitions.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 393/393 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 413 transition count 367
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 413 transition count 367
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 62 place count 403 transition count 357
Iterating global reduction 0 with 10 rules applied. Total rules applied 72 place count 403 transition count 357
Applied a total of 72 rules in 17 ms. Remains 403 /439 variables (removed 36) and now considering 357/393 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 403/439 places, 357/393 transitions.
[2023-03-12 17:26:20] [INFO ] Flatten gal took : 9 ms
[2023-03-12 17:26:20] [INFO ] Flatten gal took : 10 ms
[2023-03-12 17:26:20] [INFO ] Input system was already deterministic with 357 transitions.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 393/393 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 416 transition count 370
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 416 transition count 370
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 54 place count 408 transition count 362
Iterating global reduction 0 with 8 rules applied. Total rules applied 62 place count 408 transition count 362
Applied a total of 62 rules in 18 ms. Remains 408 /439 variables (removed 31) and now considering 362/393 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 408/439 places, 362/393 transitions.
[2023-03-12 17:26:20] [INFO ] Flatten gal took : 10 ms
[2023-03-12 17:26:21] [INFO ] Flatten gal took : 11 ms
[2023-03-12 17:26:21] [INFO ] Input system was already deterministic with 362 transitions.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 393/393 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 411 transition count 365
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 411 transition count 365
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 67 place count 400 transition count 354
Iterating global reduction 0 with 11 rules applied. Total rules applied 78 place count 400 transition count 354
Applied a total of 78 rules in 22 ms. Remains 400 /439 variables (removed 39) and now considering 354/393 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 400/439 places, 354/393 transitions.
[2023-03-12 17:26:21] [INFO ] Flatten gal took : 10 ms
[2023-03-12 17:26:21] [INFO ] Flatten gal took : 11 ms
[2023-03-12 17:26:21] [INFO ] Input system was already deterministic with 354 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 439/439 places, 393/393 transitions.
Graph (trivial) has 214 edges and 439 vertex of which 6 / 439 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 980 edges and 434 vertex of which 433 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 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 432 transition count 330
Reduce places removed 55 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 56 rules applied. Total rules applied 113 place count 377 transition count 329
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 114 place count 376 transition count 329
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 83 Pre rules applied. Total rules applied 114 place count 376 transition count 246
Deduced a syphon composed of 83 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 292 place count 281 transition count 246
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 319 place count 254 transition count 219
Iterating global reduction 3 with 27 rules applied. Total rules applied 346 place count 254 transition count 219
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 346 place count 254 transition count 216
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 352 place count 251 transition count 216
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 191 rules applied. Total rules applied 543 place count 153 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 545 place count 152 transition count 122
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 546 place count 151 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 547 place count 150 transition count 121
Applied a total of 547 rules in 35 ms. Remains 150 /439 variables (removed 289) and now considering 121/393 (removed 272) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35 ms. Remains : 150/439 places, 121/393 transitions.
[2023-03-12 17:26:21] [INFO ] Flatten gal took : 5 ms
[2023-03-12 17:26:21] [INFO ] Flatten gal took : 5 ms
[2023-03-12 17:26:21] [INFO ] Input system was already deterministic with 121 transitions.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 393/393 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 420 transition count 374
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 420 transition count 374
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 46 place count 412 transition count 366
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 412 transition count 366
Applied a total of 54 rules in 21 ms. Remains 412 /439 variables (removed 27) and now considering 366/393 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 412/439 places, 366/393 transitions.
[2023-03-12 17:26:21] [INFO ] Flatten gal took : 10 ms
[2023-03-12 17:26:21] [INFO ] Flatten gal took : 10 ms
[2023-03-12 17:26:21] [INFO ] Input system was already deterministic with 366 transitions.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 393/393 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 413 transition count 367
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 413 transition count 367
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 63 place count 402 transition count 356
Iterating global reduction 0 with 11 rules applied. Total rules applied 74 place count 402 transition count 356
Applied a total of 74 rules in 19 ms. Remains 402 /439 variables (removed 37) and now considering 356/393 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 402/439 places, 356/393 transitions.
[2023-03-12 17:26:21] [INFO ] Flatten gal took : 9 ms
[2023-03-12 17:26:21] [INFO ] Flatten gal took : 10 ms
[2023-03-12 17:26:21] [INFO ] Input system was already deterministic with 356 transitions.
[2023-03-12 17:26:21] [INFO ] Flatten gal took : 11 ms
[2023-03-12 17:26:21] [INFO ] Flatten gal took : 10 ms
[2023-03-12 17:26:21] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-12 17:26:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 439 places, 393 transitions and 1258 arcs took 2 ms.
Total runtime 13532 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/696/ctl_0_ --ctl=/tmp/696/ctl_1_ --ctl=/tmp/696/ctl_2_ --ctl=/tmp/696/ctl_3_ --ctl=/tmp/696/ctl_4_ --ctl=/tmp/696/ctl_5_ --ctl=/tmp/696/ctl_6_ --ctl=/tmp/696/ctl_7_ --ctl=/tmp/696/ctl_8_ --ctl=/tmp/696/ctl_9_ --ctl=/tmp/696/ctl_10_ --ctl=/tmp/696/ctl_11_ --ctl=/tmp/696/ctl_12_ --ctl=/tmp/696/ctl_13_ --ctl=/tmp/696/ctl_14_ --ctl=/tmp/696/ctl_15_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393340 kB
MemFree: 12291032 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16099812 kB
Could not compute solution for formula : BusinessProcesses-PT-10-CTLCardinality-00
Could not compute solution for formula : BusinessProcesses-PT-10-CTLCardinality-01
Could not compute solution for formula : BusinessProcesses-PT-10-CTLCardinality-02
Could not compute solution for formula : BusinessProcesses-PT-10-CTLCardinality-03
Could not compute solution for formula : BusinessProcesses-PT-10-CTLCardinality-04
Could not compute solution for formula : BusinessProcesses-PT-10-CTLCardinality-05
Could not compute solution for formula : BusinessProcesses-PT-10-CTLCardinality-06
Could not compute solution for formula : BusinessProcesses-PT-10-CTLCardinality-07
Could not compute solution for formula : BusinessProcesses-PT-10-CTLCardinality-08
Could not compute solution for formula : BusinessProcesses-PT-10-CTLCardinality-09
Could not compute solution for formula : BusinessProcesses-PT-10-CTLCardinality-10
Could not compute solution for formula : BusinessProcesses-PT-10-CTLCardinality-11
Could not compute solution for formula : BusinessProcesses-PT-10-CTLCardinality-12
Could not compute solution for formula : BusinessProcesses-PT-10-CTLCardinality-13
Could not compute solution for formula : BusinessProcesses-PT-10-CTLCardinality-14
Could not compute solution for formula : BusinessProcesses-PT-10-CTLCardinality-15

BK_STOP 1678645552888

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2023
ctl formula name BusinessProcesses-PT-10-CTLCardinality-00
ctl formula formula --ctl=/tmp/696/ctl_0_
ctl formula name BusinessProcesses-PT-10-CTLCardinality-01
ctl formula formula --ctl=/tmp/696/ctl_1_
ctl formula name BusinessProcesses-PT-10-CTLCardinality-02
ctl formula formula --ctl=/tmp/696/ctl_2_
ctl formula name BusinessProcesses-PT-10-CTLCardinality-03
ctl formula formula --ctl=/tmp/696/ctl_3_
ctl formula name BusinessProcesses-PT-10-CTLCardinality-04
ctl formula formula --ctl=/tmp/696/ctl_4_
ctl formula name BusinessProcesses-PT-10-CTLCardinality-05
ctl formula formula --ctl=/tmp/696/ctl_5_
ctl formula name BusinessProcesses-PT-10-CTLCardinality-06
ctl formula formula --ctl=/tmp/696/ctl_6_
ctl formula name BusinessProcesses-PT-10-CTLCardinality-07
ctl formula formula --ctl=/tmp/696/ctl_7_
ctl formula name BusinessProcesses-PT-10-CTLCardinality-08
ctl formula formula --ctl=/tmp/696/ctl_8_
ctl formula name BusinessProcesses-PT-10-CTLCardinality-09
ctl formula formula --ctl=/tmp/696/ctl_9_
ctl formula name BusinessProcesses-PT-10-CTLCardinality-10
ctl formula formula --ctl=/tmp/696/ctl_10_
ctl formula name BusinessProcesses-PT-10-CTLCardinality-11
ctl formula formula --ctl=/tmp/696/ctl_11_
ctl formula name BusinessProcesses-PT-10-CTLCardinality-12
ctl formula formula --ctl=/tmp/696/ctl_12_
ctl formula name BusinessProcesses-PT-10-CTLCardinality-13
ctl formula formula --ctl=/tmp/696/ctl_13_
ctl formula name BusinessProcesses-PT-10-CTLCardinality-14
ctl formula formula --ctl=/tmp/696/ctl_14_
ctl formula name BusinessProcesses-PT-10-CTLCardinality-15
ctl formula formula --ctl=/tmp/696/ctl_15_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 439 places, 393 transitions and 1258 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 393->392 groups
pnml2lts-sym: Regrouping took 0.120 real 0.110 user 0.000 sys
pnml2lts-sym: state vector length is 439; there are 392 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
Killing (15) : 702
Killing (9) : 702

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-10"
export BK_EXAMINATION="CTLCardinality"
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-10, examination is CTLCardinality"
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-167813694800521"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-10.tgz
mv BusinessProcesses-PT-10 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;