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.r042-tajo-167813695900554.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 marciexred
Input is BusinessProcesses-PT-14, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695900554
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 6.9K Feb 25 16:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 16:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:42 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.8K 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.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 192K Feb 25 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:43 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 156K 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-14-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-14-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678733011588

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=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-14
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 18:43:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 18:43:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 18:43:33] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2023-03-13 18:43:33] [INFO ] Transformed 624 places.
[2023-03-13 18:43:33] [INFO ] Transformed 564 transitions.
[2023-03-13 18:43:33] [INFO ] Found NUPN structural information;
[2023-03-13 18:43:33] [INFO ] Parsed PT model containing 624 places and 564 transitions and 1657 arcs in 176 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Deduced a syphon composed of 8 places in 8 ms
Reduce places removed 8 places and 8 transitions.
Support contains 135 out of 616 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 616/616 places, 556/556 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 611 transition count 556
Discarding 72 places :
Symmetric choice reduction at 1 with 72 rule applications. Total rules 77 place count 539 transition count 484
Iterating global reduction 1 with 72 rules applied. Total rules applied 149 place count 539 transition count 484
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 182 place count 506 transition count 451
Iterating global reduction 1 with 33 rules applied. Total rules applied 215 place count 506 transition count 451
Applied a total of 215 rules in 98 ms. Remains 506 /616 variables (removed 110) and now considering 451/556 (removed 105) transitions.
// Phase 1: matrix 451 rows 506 cols
[2023-03-13 18:43:33] [INFO ] Computed 94 place invariants in 23 ms
[2023-03-13 18:43:33] [INFO ] Implicit Places using invariants in 351 ms returned []
[2023-03-13 18:43:33] [INFO ] Invariant cache hit.
[2023-03-13 18:43:34] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 809 ms to find 0 implicit places.
[2023-03-13 18:43:34] [INFO ] Invariant cache hit.
[2023-03-13 18:43:34] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 506/616 places, 451/556 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1161 ms. Remains : 506/616 places, 451/556 transitions.
Support contains 135 out of 506 places after structural reductions.
[2023-03-13 18:43:34] [INFO ] Flatten gal took : 62 ms
[2023-03-13 18:43:34] [INFO ] Flatten gal took : 27 ms
[2023-03-13 18:43:34] [INFO ] Input system was already deterministic with 451 transitions.
Incomplete random walk after 10000 steps, including 66 resets, run finished after 493 ms. (steps per millisecond=20 ) properties (out of 86) seen :34
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) 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 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) 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 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 52) seen :0
Running SMT prover for 52 properties.
[2023-03-13 18:43:35] [INFO ] Invariant cache hit.
[2023-03-13 18:43:35] [INFO ] After 378ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:52
[2023-03-13 18:43:36] [INFO ] [Nat]Absence check using 55 positive place invariants in 18 ms returned sat
[2023-03-13 18:43:36] [INFO ] [Nat]Absence check using 55 positive and 39 generalized place invariants in 14 ms returned sat
[2023-03-13 18:43:37] [INFO ] After 904ms SMT Verify possible using state equation in natural domain returned unsat :10 sat :42
[2023-03-13 18:43:37] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 4 ms to minimize.
[2023-03-13 18:43:37] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 2 ms to minimize.
[2023-03-13 18:43:37] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 1 ms to minimize.
[2023-03-13 18:43:37] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2023-03-13 18:43:38] [INFO ] Deduced a trap composed of 113 places in 111 ms of which 1 ms to minimize.
[2023-03-13 18:43:38] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 584 ms
[2023-03-13 18:43:38] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 0 ms to minimize.
[2023-03-13 18:43:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-03-13 18:43:38] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2023-03-13 18:43:38] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
[2023-03-13 18:43:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 156 ms
[2023-03-13 18:43:38] [INFO ] Deduced a trap composed of 100 places in 104 ms of which 1 ms to minimize.
[2023-03-13 18:43:38] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 0 ms to minimize.
[2023-03-13 18:43:38] [INFO ] Deduced a trap composed of 102 places in 105 ms of which 1 ms to minimize.
[2023-03-13 18:43:38] [INFO ] Deduced a trap composed of 99 places in 119 ms of which 1 ms to minimize.
[2023-03-13 18:43:39] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 0 ms to minimize.
[2023-03-13 18:43:39] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 1 ms to minimize.
[2023-03-13 18:43:39] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 694 ms
[2023-03-13 18:43:39] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2023-03-13 18:43:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2023-03-13 18:43:39] [INFO ] Deduced a trap composed of 97 places in 168 ms of which 0 ms to minimize.
[2023-03-13 18:43:39] [INFO ] Deduced a trap composed of 96 places in 117 ms of which 1 ms to minimize.
[2023-03-13 18:43:39] [INFO ] Deduced a trap composed of 101 places in 88 ms of which 0 ms to minimize.
[2023-03-13 18:43:39] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2023-03-13 18:43:40] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 0 ms to minimize.
[2023-03-13 18:43:40] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 0 ms to minimize.
[2023-03-13 18:43:40] [INFO ] Deduced a trap composed of 100 places in 88 ms of which 1 ms to minimize.
[2023-03-13 18:43:40] [INFO ] Deduced a trap composed of 102 places in 98 ms of which 0 ms to minimize.
[2023-03-13 18:43:40] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 1 ms to minimize.
[2023-03-13 18:43:40] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2023-03-13 18:43:40] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2023-03-13 18:43:40] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 0 ms to minimize.
[2023-03-13 18:43:40] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2023-03-13 18:43:40] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 0 ms to minimize.
[2023-03-13 18:43:40] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1551 ms
[2023-03-13 18:43:41] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2023-03-13 18:43:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-03-13 18:43:41] [INFO ] Deduced a trap composed of 116 places in 116 ms of which 1 ms to minimize.
[2023-03-13 18:43:41] [INFO ] Deduced a trap composed of 103 places in 78 ms of which 1 ms to minimize.
[2023-03-13 18:43:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 260 ms
[2023-03-13 18:43:41] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 0 ms to minimize.
[2023-03-13 18:43:41] [INFO ] Deduced a trap composed of 98 places in 135 ms of which 1 ms to minimize.
[2023-03-13 18:43:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 292 ms
[2023-03-13 18:43:41] [INFO ] Deduced a trap composed of 101 places in 101 ms of which 4 ms to minimize.
[2023-03-13 18:43:42] [INFO ] Deduced a trap composed of 103 places in 91 ms of which 0 ms to minimize.
[2023-03-13 18:43:42] [INFO ] Deduced a trap composed of 103 places in 82 ms of which 1 ms to minimize.
[2023-03-13 18:43:42] [INFO ] Deduced a trap composed of 104 places in 81 ms of which 0 ms to minimize.
[2023-03-13 18:43:42] [INFO ] Deduced a trap composed of 112 places in 90 ms of which 0 ms to minimize.
[2023-03-13 18:43:42] [INFO ] Deduced a trap composed of 100 places in 107 ms of which 1 ms to minimize.
[2023-03-13 18:43:42] [INFO ] Deduced a trap composed of 111 places in 86 ms of which 1 ms to minimize.
[2023-03-13 18:43:42] [INFO ] Deduced a trap composed of 100 places in 91 ms of which 1 ms to minimize.
[2023-03-13 18:43:42] [INFO ] Deduced a trap composed of 111 places in 91 ms of which 0 ms to minimize.
[2023-03-13 18:43:42] [INFO ] Deduced a trap composed of 100 places in 72 ms of which 1 ms to minimize.
[2023-03-13 18:43:42] [INFO ] Deduced a trap composed of 104 places in 85 ms of which 1 ms to minimize.
[2023-03-13 18:43:43] [INFO ] Deduced a trap composed of 103 places in 73 ms of which 0 ms to minimize.
[2023-03-13 18:43:43] [INFO ] Deduced a trap composed of 97 places in 87 ms of which 0 ms to minimize.
[2023-03-13 18:43:43] [INFO ] Deduced a trap composed of 106 places in 92 ms of which 1 ms to minimize.
[2023-03-13 18:43:43] [INFO ] Deduced a trap composed of 114 places in 80 ms of which 0 ms to minimize.
[2023-03-13 18:43:43] [INFO ] Deduced a trap composed of 107 places in 77 ms of which 0 ms to minimize.
[2023-03-13 18:43:43] [INFO ] Deduced a trap composed of 122 places in 77 ms of which 1 ms to minimize.
[2023-03-13 18:43:43] [INFO ] Deduced a trap composed of 100 places in 76 ms of which 0 ms to minimize.
[2023-03-13 18:43:43] [INFO ] Deduced a trap composed of 98 places in 78 ms of which 0 ms to minimize.
[2023-03-13 18:43:43] [INFO ] Deduced a trap composed of 97 places in 81 ms of which 0 ms to minimize.
[2023-03-13 18:43:43] [INFO ] Deduced a trap composed of 108 places in 74 ms of which 1 ms to minimize.
[2023-03-13 18:43:44] [INFO ] Deduced a trap composed of 114 places in 82 ms of which 10 ms to minimize.
[2023-03-13 18:43:44] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 2253 ms
[2023-03-13 18:43:44] [INFO ] Deduced a trap composed of 114 places in 87 ms of which 1 ms to minimize.
[2023-03-13 18:43:44] [INFO ] Deduced a trap composed of 103 places in 81 ms of which 1 ms to minimize.
[2023-03-13 18:43:44] [INFO ] Deduced a trap composed of 105 places in 87 ms of which 1 ms to minimize.
[2023-03-13 18:43:44] [INFO ] Deduced a trap composed of 103 places in 78 ms of which 0 ms to minimize.
[2023-03-13 18:43:44] [INFO ] Deduced a trap composed of 122 places in 76 ms of which 1 ms to minimize.
[2023-03-13 18:43:44] [INFO ] Deduced a trap composed of 109 places in 71 ms of which 1 ms to minimize.
[2023-03-13 18:43:44] [INFO ] Deduced a trap composed of 113 places in 78 ms of which 1 ms to minimize.
[2023-03-13 18:43:44] [INFO ] Deduced a trap composed of 107 places in 82 ms of which 1 ms to minimize.
[2023-03-13 18:43:45] [INFO ] Deduced a trap composed of 103 places in 96 ms of which 0 ms to minimize.
[2023-03-13 18:43:45] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 937 ms
[2023-03-13 18:43:45] [INFO ] Deduced a trap composed of 108 places in 79 ms of which 0 ms to minimize.
[2023-03-13 18:43:45] [INFO ] Deduced a trap composed of 121 places in 75 ms of which 0 ms to minimize.
[2023-03-13 18:43:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 244 ms
[2023-03-13 18:43:45] [INFO ] Deduced a trap composed of 117 places in 87 ms of which 2 ms to minimize.
[2023-03-13 18:43:45] [INFO ] Deduced a trap composed of 107 places in 123 ms of which 0 ms to minimize.
[2023-03-13 18:43:45] [INFO ] Deduced a trap composed of 86 places in 82 ms of which 2 ms to minimize.
[2023-03-13 18:43:45] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 1 ms to minimize.
[2023-03-13 18:43:46] [INFO ] Deduced a trap composed of 102 places in 130 ms of which 0 ms to minimize.
[2023-03-13 18:43:46] [INFO ] Deduced a trap composed of 105 places in 97 ms of which 0 ms to minimize.
[2023-03-13 18:43:46] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1027 ms
[2023-03-13 18:43:46] [INFO ] After 10315ms SMT Verify possible using trap constraints in natural domain returned unsat :16 sat :36
Attempting to minimize the solution found.
Minimization took 884 ms.
[2023-03-13 18:43:47] [INFO ] After 11876ms SMT Verify possible using all constraints in natural domain returned unsat :16 sat :36
Fused 52 Parikh solutions to 36 different solutions.
Parikh walk visited 32 properties in 321 ms.
Support contains 7 out of 506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 506/506 places, 451/451 transitions.
Graph (trivial) has 247 edges and 506 vertex of which 6 / 506 are part of one of the 1 SCC in 6 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1119 edges and 501 vertex of which 500 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 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 500 transition count 379
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 130 place count 436 transition count 379
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 130 place count 436 transition count 279
Deduced a syphon composed of 100 places in 2 ms
Ensure Unique test removed 17 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 217 rules applied. Total rules applied 347 place count 319 transition count 279
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 372 place count 294 transition count 254
Ensure Unique test removed 1 places
Iterating global reduction 2 with 26 rules applied. Total rules applied 398 place count 293 transition count 254
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 398 place count 293 transition count 252
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 402 place count 291 transition count 252
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 634 place count 173 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 636 place count 172 transition count 142
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 638 place count 172 transition count 140
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 640 place count 170 transition count 140
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 645 place count 170 transition count 140
Applied a total of 645 rules in 108 ms. Remains 170 /506 variables (removed 336) and now considering 140/451 (removed 311) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 170/506 places, 140/451 transitions.
Incomplete random walk after 10000 steps, including 407 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 183 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 122 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 140 rows 170 cols
[2023-03-13 18:43:48] [INFO ] Computed 72 place invariants in 2 ms
[2023-03-13 18:43:48] [INFO ] [Real]Absence check using 54 positive place invariants in 8 ms returned sat
[2023-03-13 18:43:48] [INFO ] [Real]Absence check using 54 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-13 18:43:48] [INFO ] After 54ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-13 18:43:48] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-13 18:43:48] [INFO ] After 19ms SMT Verify possible using 11 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 18:43:48] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 18:43:48] [INFO ] [Nat]Absence check using 54 positive place invariants in 7 ms returned sat
[2023-03-13 18:43:48] [INFO ] [Nat]Absence check using 54 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-13 18:43:48] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 18:43:48] [INFO ] After 16ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 18:43:48] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2023-03-13 18:43:48] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 0 ms to minimize.
[2023-03-13 18:43:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 113 ms
[2023-03-13 18:43:48] [INFO ] After 146ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-13 18:43:48] [INFO ] After 262ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 140/140 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 170 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 169 transition count 139
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 169 transition count 138
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 4 place count 168 transition count 138
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 6 place count 167 transition count 137
Applied a total of 6 rules in 12 ms. Remains 167 /170 variables (removed 3) and now considering 137/140 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 167/170 places, 137/140 transitions.
Incomplete random walk after 10000 steps, including 401 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 211 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 136 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Probably explored full state space saw : 6741 states, properties seen :1
Probabilistic random walk after 21095 steps, saw 6741 distinct states, run finished after 96 ms. (steps per millisecond=219 ) properties seen :1
Explored full state space saw : 6741 states, properties seen :0
Exhaustive walk after 21095 steps, saw 6741 distinct states, run finished after 66 ms. (steps per millisecond=319 ) properties seen :0
Successfully simplified 17 atomic propositions for a total of 16 simplifications.
FORMULA BusinessProcesses-PT-14-CTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 18:43:49] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-13 18:43:49] [INFO ] Flatten gal took : 29 ms
FORMULA BusinessProcesses-PT-14-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 18:43:49] [INFO ] Flatten gal took : 25 ms
[2023-03-13 18:43:49] [INFO ] Input system was already deterministic with 451 transitions.
Support contains 71 out of 506 places (down from 83) after GAL structural reductions.
Computed a total of 136 stabilizing places and 129 stable transitions
Graph (complete) has 1126 edges and 506 vertex of which 505 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 506/506 places, 451/451 transitions.
Graph (trivial) has 249 edges and 506 vertex of which 6 / 506 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 1120 edges and 501 vertex of which 500 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 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 499 transition count 379
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 130 place count 435 transition count 379
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 130 place count 435 transition count 278
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 349 place count 317 transition count 278
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 376 place count 290 transition count 251
Ensure Unique test removed 1 places
Iterating global reduction 2 with 28 rules applied. Total rules applied 404 place count 289 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 404 place count 289 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 408 place count 287 transition count 249
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 634 place count 172 transition count 138
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 636 place count 171 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 637 place count 170 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 638 place count 169 transition count 136
Applied a total of 638 rules in 103 ms. Remains 169 /506 variables (removed 337) and now considering 136/451 (removed 315) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 104 ms. Remains : 169/506 places, 136/451 transitions.
[2023-03-13 18:43:49] [INFO ] Flatten gal took : 9 ms
[2023-03-13 18:43:49] [INFO ] Flatten gal took : 8 ms
[2023-03-13 18:43:49] [INFO ] Input system was already deterministic with 136 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 506/506 places, 451/451 transitions.
Graph (complete) has 1126 edges and 506 vertex of which 505 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 56 place count 504 transition count 394
Reduce places removed 55 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 57 rules applied. Total rules applied 113 place count 449 transition count 392
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 115 place count 447 transition count 392
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 108 Pre rules applied. Total rules applied 115 place count 447 transition count 284
Deduced a syphon composed of 108 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 3 with 233 rules applied. Total rules applied 348 place count 322 transition count 284
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 374 place count 296 transition count 258
Ensure Unique test removed 1 places
Iterating global reduction 3 with 27 rules applied. Total rules applied 401 place count 295 transition count 258
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 401 place count 295 transition count 256
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 405 place count 293 transition count 256
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 230 rules applied. Total rules applied 635 place count 176 transition count 143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 636 place count 175 transition count 142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 637 place count 174 transition count 142
Applied a total of 637 rules in 78 ms. Remains 174 /506 variables (removed 332) and now considering 142/451 (removed 309) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 79 ms. Remains : 174/506 places, 142/451 transitions.
[2023-03-13 18:43:49] [INFO ] Flatten gal took : 21 ms
[2023-03-13 18:43:49] [INFO ] Flatten gal took : 8 ms
[2023-03-13 18:43:49] [INFO ] Input system was already deterministic with 142 transitions.
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 451/451 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 477 transition count 422
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 477 transition count 422
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 68 place count 467 transition count 412
Iterating global reduction 0 with 10 rules applied. Total rules applied 78 place count 467 transition count 412
Applied a total of 78 rules in 37 ms. Remains 467 /506 variables (removed 39) and now considering 412/451 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 467/506 places, 412/451 transitions.
[2023-03-13 18:43:49] [INFO ] Flatten gal took : 28 ms
[2023-03-13 18:43:49] [INFO ] Flatten gal took : 26 ms
[2023-03-13 18:43:49] [INFO ] Input system was already deterministic with 412 transitions.
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 451/451 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 476 transition count 421
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 476 transition count 421
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 70 place count 466 transition count 411
Iterating global reduction 0 with 10 rules applied. Total rules applied 80 place count 466 transition count 411
Applied a total of 80 rules in 38 ms. Remains 466 /506 variables (removed 40) and now considering 411/451 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 466/506 places, 411/451 transitions.
[2023-03-13 18:43:49] [INFO ] Flatten gal took : 13 ms
[2023-03-13 18:43:49] [INFO ] Flatten gal took : 13 ms
[2023-03-13 18:43:49] [INFO ] Input system was already deterministic with 411 transitions.
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 451/451 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 478 transition count 423
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 478 transition count 423
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 66 place count 468 transition count 413
Iterating global reduction 0 with 10 rules applied. Total rules applied 76 place count 468 transition count 413
Applied a total of 76 rules in 50 ms. Remains 468 /506 variables (removed 38) and now considering 413/451 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 468/506 places, 413/451 transitions.
[2023-03-13 18:43:50] [INFO ] Flatten gal took : 12 ms
[2023-03-13 18:43:50] [INFO ] Flatten gal took : 12 ms
[2023-03-13 18:43:50] [INFO ] Input system was already deterministic with 413 transitions.
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 451/451 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 476 transition count 421
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 476 transition count 421
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 70 place count 466 transition count 411
Iterating global reduction 0 with 10 rules applied. Total rules applied 80 place count 466 transition count 411
Applied a total of 80 rules in 23 ms. Remains 466 /506 variables (removed 40) and now considering 411/451 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 466/506 places, 411/451 transitions.
[2023-03-13 18:43:50] [INFO ] Flatten gal took : 11 ms
[2023-03-13 18:43:50] [INFO ] Flatten gal took : 12 ms
[2023-03-13 18:43:50] [INFO ] Input system was already deterministic with 411 transitions.
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 451/451 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 476 transition count 421
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 476 transition count 421
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 70 place count 466 transition count 411
Iterating global reduction 0 with 10 rules applied. Total rules applied 80 place count 466 transition count 411
Applied a total of 80 rules in 33 ms. Remains 466 /506 variables (removed 40) and now considering 411/451 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 466/506 places, 411/451 transitions.
[2023-03-13 18:43:50] [INFO ] Flatten gal took : 25 ms
[2023-03-13 18:43:50] [INFO ] Flatten gal took : 16 ms
[2023-03-13 18:43:50] [INFO ] Input system was already deterministic with 411 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 506/506 places, 451/451 transitions.
Graph (trivial) has 248 edges and 506 vertex of which 6 / 506 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 1120 edges and 501 vertex of which 500 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 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 499 transition count 379
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 130 place count 435 transition count 379
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 130 place count 435 transition count 281
Deduced a syphon composed of 98 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 212 rules applied. Total rules applied 342 place count 321 transition count 281
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 369 place count 294 transition count 254
Ensure Unique test removed 1 places
Iterating global reduction 2 with 28 rules applied. Total rules applied 397 place count 293 transition count 254
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 397 place count 293 transition count 252
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 401 place count 291 transition count 252
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 4 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 633 place count 173 transition count 138
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 635 place count 172 transition count 137
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 641 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 642 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 643 place count 170 transition count 136
Applied a total of 643 rules in 80 ms. Remains 170 /506 variables (removed 336) and now considering 136/451 (removed 315) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 80 ms. Remains : 170/506 places, 136/451 transitions.
[2023-03-13 18:43:50] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:43:50] [INFO ] Flatten gal took : 12 ms
[2023-03-13 18:43:50] [INFO ] Input system was already deterministic with 136 transitions.
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 451/451 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 479 transition count 424
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 479 transition count 424
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 63 place count 470 transition count 415
Iterating global reduction 0 with 9 rules applied. Total rules applied 72 place count 470 transition count 415
Applied a total of 72 rules in 20 ms. Remains 470 /506 variables (removed 36) and now considering 415/451 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 470/506 places, 415/451 transitions.
[2023-03-13 18:43:50] [INFO ] Flatten gal took : 23 ms
[2023-03-13 18:43:50] [INFO ] Flatten gal took : 10 ms
[2023-03-13 18:43:50] [INFO ] Input system was already deterministic with 415 transitions.
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 451/451 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 478 transition count 423
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 478 transition count 423
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 65 place count 469 transition count 414
Iterating global reduction 0 with 9 rules applied. Total rules applied 74 place count 469 transition count 414
Applied a total of 74 rules in 21 ms. Remains 469 /506 variables (removed 37) and now considering 414/451 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 469/506 places, 414/451 transitions.
[2023-03-13 18:43:50] [INFO ] Flatten gal took : 10 ms
[2023-03-13 18:43:50] [INFO ] Flatten gal took : 10 ms
[2023-03-13 18:43:50] [INFO ] Input system was already deterministic with 414 transitions.
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 451/451 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 478 transition count 423
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 478 transition count 423
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 65 place count 469 transition count 414
Iterating global reduction 0 with 9 rules applied. Total rules applied 74 place count 469 transition count 414
Applied a total of 74 rules in 23 ms. Remains 469 /506 variables (removed 37) and now considering 414/451 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 469/506 places, 414/451 transitions.
[2023-03-13 18:43:50] [INFO ] Flatten gal took : 23 ms
[2023-03-13 18:43:50] [INFO ] Flatten gal took : 10 ms
[2023-03-13 18:43:50] [INFO ] Input system was already deterministic with 414 transitions.
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 451/451 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 476 transition count 421
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 476 transition count 421
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 70 place count 466 transition count 411
Iterating global reduction 0 with 10 rules applied. Total rules applied 80 place count 466 transition count 411
Applied a total of 80 rules in 23 ms. Remains 466 /506 variables (removed 40) and now considering 411/451 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 466/506 places, 411/451 transitions.
[2023-03-13 18:43:50] [INFO ] Flatten gal took : 22 ms
[2023-03-13 18:43:50] [INFO ] Flatten gal took : 10 ms
[2023-03-13 18:43:50] [INFO ] Input system was already deterministic with 411 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 506/506 places, 451/451 transitions.
Graph (trivial) has 252 edges and 506 vertex of which 6 / 506 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 1120 edges and 501 vertex of which 500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 499 transition count 378
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 133 place count 434 transition count 377
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 134 place count 433 transition count 377
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 134 place count 433 transition count 277
Deduced a syphon composed of 100 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 217 rules applied. Total rules applied 351 place count 316 transition count 277
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 379 place count 288 transition count 249
Ensure Unique test removed 1 places
Iterating global reduction 3 with 29 rules applied. Total rules applied 408 place count 287 transition count 249
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 408 place count 287 transition count 247
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 412 place count 285 transition count 247
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 230 rules applied. Total rules applied 642 place count 168 transition count 134
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 644 place count 167 transition count 133
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 645 place count 166 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 646 place count 165 transition count 132
Applied a total of 646 rules in 70 ms. Remains 165 /506 variables (removed 341) and now considering 132/451 (removed 319) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 71 ms. Remains : 165/506 places, 132/451 transitions.
[2023-03-13 18:43:50] [INFO ] Flatten gal took : 4 ms
[2023-03-13 18:43:50] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:43:50] [INFO ] Input system was already deterministic with 132 transitions.
[2023-03-13 18:43:50] [INFO ] Flatten gal took : 12 ms
[2023-03-13 18:43:50] [INFO ] Flatten gal took : 10 ms
[2023-03-13 18:43:50] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-13 18:43:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 506 places, 451 transitions and 1426 arcs took 17 ms.
Total runtime 18003 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 506 NrTr: 451 NrArc: 1426)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.014sec

net check time: 0m 0.000sec

init dd package: 0m 3.019sec


before gc: list nodes free: 1654571

after gc: idd nodes used:60396055, unused:3603945; list nodes free:16568823

RS generation: 37m30.241sec


-> last computed set: #nodes 60395551 (6.0e+07) #states 3,614,080,217 (9)


CANNOT_COMPUTE


BK_STOP 1678735320214

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.002sec

idd.cc:820: DD Exception: No free nodes

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-14"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is BusinessProcesses-PT-14, 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 r042-tajo-167813695900554"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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