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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.5K Feb 25 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 9.5K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Feb 25 16:47 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 157K 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-15-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678733234637

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-15
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 18:47:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 18:47:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 18:47:16] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2023-03-13 18:47:16] [INFO ] Transformed 630 places.
[2023-03-13 18:47:16] [INFO ] Transformed 566 transitions.
[2023-03-13 18:47:16] [INFO ] Found NUPN structural information;
[2023-03-13 18:47:16] [INFO ] Parsed PT model containing 630 places and 566 transitions and 1666 arcs in 209 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 23 ms.
Deduced a syphon composed of 4 places in 27 ms
Reduce places removed 4 places and 4 transitions.
Support contains 122 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 562/562 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 623 transition count 562
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 71 place count 555 transition count 494
Iterating global reduction 1 with 68 rules applied. Total rules applied 139 place count 555 transition count 494
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 170 place count 524 transition count 463
Iterating global reduction 1 with 31 rules applied. Total rules applied 201 place count 524 transition count 463
Applied a total of 201 rules in 207 ms. Remains 524 /626 variables (removed 102) and now considering 463/562 (removed 99) transitions.
// Phase 1: matrix 463 rows 524 cols
[2023-03-13 18:47:17] [INFO ] Computed 99 place invariants in 45 ms
[2023-03-13 18:47:17] [INFO ] Implicit Places using invariants in 467 ms returned []
[2023-03-13 18:47:17] [INFO ] Invariant cache hit.
[2023-03-13 18:47:18] [INFO ] Implicit Places using invariants and state equation in 637 ms returned []
Implicit Place search using SMT with State Equation took 1141 ms to find 0 implicit places.
[2023-03-13 18:47:18] [INFO ] Invariant cache hit.
[2023-03-13 18:47:18] [INFO ] Dead Transitions using invariants and state equation in 303 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 524/626 places, 463/562 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1656 ms. Remains : 524/626 places, 463/562 transitions.
Support contains 122 out of 524 places after structural reductions.
[2023-03-13 18:47:19] [INFO ] Flatten gal took : 73 ms
[2023-03-13 18:47:19] [INFO ] Flatten gal took : 41 ms
[2023-03-13 18:47:19] [INFO ] Input system was already deterministic with 463 transitions.
Incomplete random walk after 10000 steps, including 66 resets, run finished after 656 ms. (steps per millisecond=15 ) properties (out of 78) seen :29
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 49) 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 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 49) 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 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 49) 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 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 49) 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 49) 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 49) 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 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 49) 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 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 49) 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 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 49) 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 49) 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 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 49) 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 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 49) 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 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) seen :0
Running SMT prover for 49 properties.
[2023-03-13 18:47:20] [INFO ] Invariant cache hit.
[2023-03-13 18:47:21] [INFO ] [Real]Absence check using 58 positive place invariants in 18 ms returned sat
[2023-03-13 18:47:21] [INFO ] [Real]Absence check using 58 positive and 41 generalized place invariants in 14 ms returned sat
[2023-03-13 18:47:21] [INFO ] After 667ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:49
[2023-03-13 18:47:21] [INFO ] [Nat]Absence check using 58 positive place invariants in 17 ms returned sat
[2023-03-13 18:47:21] [INFO ] [Nat]Absence check using 58 positive and 41 generalized place invariants in 11 ms returned sat
[2023-03-13 18:47:23] [INFO ] After 1211ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :42
[2023-03-13 18:47:23] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 7 ms to minimize.
[2023-03-13 18:47:23] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 8 ms to minimize.
[2023-03-13 18:47:23] [INFO ] Deduced a trap composed of 29 places in 153 ms of which 2 ms to minimize.
[2023-03-13 18:47:23] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 2 ms to minimize.
[2023-03-13 18:47:23] [INFO ] Deduced a trap composed of 95 places in 182 ms of which 11 ms to minimize.
[2023-03-13 18:47:24] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2023-03-13 18:47:24] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 0 ms to minimize.
[2023-03-13 18:47:24] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 1 ms to minimize.
[2023-03-13 18:47:24] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 1 ms to minimize.
[2023-03-13 18:47:24] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2023-03-13 18:47:24] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 0 ms to minimize.
[2023-03-13 18:47:24] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2023-03-13 18:47:24] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 1 ms to minimize.
[2023-03-13 18:47:24] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 0 ms to minimize.
[2023-03-13 18:47:24] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1811 ms
[2023-03-13 18:47:25] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 1 ms to minimize.
[2023-03-13 18:47:25] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 0 ms to minimize.
[2023-03-13 18:47:25] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 0 ms to minimize.
[2023-03-13 18:47:25] [INFO ] Deduced a trap composed of 47 places in 99 ms of which 1 ms to minimize.
[2023-03-13 18:47:25] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 1 ms to minimize.
[2023-03-13 18:47:25] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 0 ms to minimize.
[2023-03-13 18:47:25] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 699 ms
[2023-03-13 18:47:25] [INFO ] Deduced a trap composed of 94 places in 150 ms of which 0 ms to minimize.
[2023-03-13 18:47:26] [INFO ] Deduced a trap composed of 94 places in 151 ms of which 1 ms to minimize.
[2023-03-13 18:47:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 391 ms
[2023-03-13 18:47:26] [INFO ] Deduced a trap composed of 90 places in 155 ms of which 1 ms to minimize.
[2023-03-13 18:47:26] [INFO ] Deduced a trap composed of 93 places in 133 ms of which 0 ms to minimize.
[2023-03-13 18:47:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 371 ms
[2023-03-13 18:47:27] [INFO ] Deduced a trap composed of 103 places in 163 ms of which 0 ms to minimize.
[2023-03-13 18:47:27] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 0 ms to minimize.
[2023-03-13 18:47:27] [INFO ] Deduced a trap composed of 102 places in 125 ms of which 0 ms to minimize.
[2023-03-13 18:47:27] [INFO ] Deduced a trap composed of 96 places in 122 ms of which 1 ms to minimize.
[2023-03-13 18:47:27] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 1 ms to minimize.
[2023-03-13 18:47:27] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 2 ms to minimize.
[2023-03-13 18:47:28] [INFO ] Deduced a trap composed of 108 places in 153 ms of which 0 ms to minimize.
[2023-03-13 18:47:28] [INFO ] Deduced a trap composed of 103 places in 139 ms of which 1 ms to minimize.
[2023-03-13 18:47:28] [INFO ] Deduced a trap composed of 53 places in 134 ms of which 0 ms to minimize.
[2023-03-13 18:47:28] [INFO ] Deduced a trap composed of 91 places in 137 ms of which 1 ms to minimize.
[2023-03-13 18:47:28] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1665 ms
[2023-03-13 18:47:29] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 1 ms to minimize.
[2023-03-13 18:47:29] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 1 ms to minimize.
[2023-03-13 18:47:29] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 1 ms to minimize.
[2023-03-13 18:47:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 418 ms
[2023-03-13 18:47:29] [INFO ] Deduced a trap composed of 56 places in 100 ms of which 0 ms to minimize.
[2023-03-13 18:47:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2023-03-13 18:47:30] [INFO ] After 8177ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :40
Attempting to minimize the solution found.
Minimization took 969 ms.
[2023-03-13 18:47:31] [INFO ] After 9843ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :40
Fused 49 Parikh solutions to 40 different solutions.
Parikh walk visited 11 properties in 689 ms.
Support contains 47 out of 524 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 463/463 transitions.
Graph (complete) has 1158 edges and 524 vertex of which 523 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 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 523 transition count 414
Reduce places removed 48 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 51 rules applied. Total rules applied 100 place count 475 transition count 411
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 103 place count 472 transition count 411
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 94 Pre rules applied. Total rules applied 103 place count 472 transition count 317
Deduced a syphon composed of 94 places in 2 ms
Ensure Unique test removed 16 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 204 rules applied. Total rules applied 307 place count 362 transition count 317
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 319 place count 350 transition count 305
Ensure Unique test removed 1 places
Iterating global reduction 3 with 13 rules applied. Total rules applied 332 place count 349 transition count 305
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 332 place count 349 transition count 304
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 334 place count 348 transition count 304
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 2 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 3 with 224 rules applied. Total rules applied 558 place count 235 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 559 place count 235 transition count 192
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 560 place count 235 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 561 place count 234 transition count 191
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 570 place count 234 transition count 191
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 576 place count 234 transition count 191
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 577 place count 233 transition count 190
Applied a total of 577 rules in 100 ms. Remains 233 /524 variables (removed 291) and now considering 190/463 (removed 273) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 233/524 places, 190/463 transitions.
Incomplete random walk after 10000 steps, including 462 resets, run finished after 326 ms. (steps per millisecond=30 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 29) seen :0
Interrupted probabilistic random walk after 652393 steps, run timeout after 3001 ms. (steps per millisecond=217 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 7=1, 8=1, 9=1, 11=1, 12=1, 13=1, 14=1, 15=1, 16=1, 17=1, 18=1, 19=1, 20=1, 21=1, 22=1, 23=1, 24=1, 25=1, 26=1, 27=1, 28=1}
Probabilistic random walk after 652393 steps, saw 106139 distinct states, run finished after 3002 ms. (steps per millisecond=217 ) properties seen :27
Running SMT prover for 2 properties.
// Phase 1: matrix 190 rows 233 cols
[2023-03-13 18:47:35] [INFO ] Computed 80 place invariants in 10 ms
[2023-03-13 18:47:35] [INFO ] [Real]Absence check using 60 positive place invariants in 12 ms returned sat
[2023-03-13 18:47:35] [INFO ] [Real]Absence check using 60 positive and 20 generalized place invariants in 6 ms returned sat
[2023-03-13 18:47:35] [INFO ] After 92ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-13 18:47:35] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 2 ms to minimize.
[2023-03-13 18:47:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-03-13 18:47:35] [INFO ] After 162ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 18:47:35] [INFO ] After 246ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 18:47:35] [INFO ] [Nat]Absence check using 60 positive place invariants in 18 ms returned sat
[2023-03-13 18:47:35] [INFO ] [Nat]Absence check using 60 positive and 20 generalized place invariants in 11 ms returned sat
[2023-03-13 18:47:35] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 18:47:35] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2023-03-13 18:47:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-13 18:47:36] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 1 ms to minimize.
[2023-03-13 18:47:36] [INFO ] Deduced a trap composed of 58 places in 73 ms of which 0 ms to minimize.
[2023-03-13 18:47:36] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 0 ms to minimize.
[2023-03-13 18:47:36] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 0 ms to minimize.
[2023-03-13 18:47:36] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 1 ms to minimize.
[2023-03-13 18:47:36] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2023-03-13 18:47:36] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 0 ms to minimize.
[2023-03-13 18:47:36] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2023-03-13 18:47:36] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 0 ms to minimize.
[2023-03-13 18:47:36] [INFO ] Deduced a trap composed of 55 places in 59 ms of which 1 ms to minimize.
[2023-03-13 18:47:36] [INFO ] Deduced a trap composed of 53 places in 86 ms of which 0 ms to minimize.
[2023-03-13 18:47:36] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 904 ms
[2023-03-13 18:47:36] [INFO ] After 1082ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-13 18:47:36] [INFO ] After 1259ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 ms.
Support contains 7 out of 233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 190/190 transitions.
Graph (trivial) has 46 edges and 233 vertex of which 2 / 233 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 232 transition count 175
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 219 transition count 175
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 27 place count 219 transition count 166
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 21 rules applied. Total rules applied 48 place count 207 transition count 166
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 53 place count 202 transition count 161
Iterating global reduction 2 with 5 rules applied. Total rules applied 58 place count 202 transition count 161
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 58 place count 202 transition count 160
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 60 place count 201 transition count 160
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 102 place count 179 transition count 140
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 105 place count 179 transition count 137
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 108 place count 176 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 109 place count 175 transition count 136
Applied a total of 109 rules in 70 ms. Remains 175 /233 variables (removed 58) and now considering 136/190 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 175/233 places, 136/190 transitions.
Incomplete random walk after 10000 steps, including 377 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 136 rows 175 cols
[2023-03-13 18:47:37] [INFO ] Computed 75 place invariants in 4 ms
[2023-03-13 18:47:37] [INFO ] [Real]Absence check using 59 positive place invariants in 12 ms returned sat
[2023-03-13 18:47:37] [INFO ] [Real]Absence check using 59 positive and 16 generalized place invariants in 5 ms returned sat
[2023-03-13 18:47:37] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 18:47:37] [INFO ] [Nat]Absence check using 59 positive place invariants in 9 ms returned sat
[2023-03-13 18:47:37] [INFO ] [Nat]Absence check using 59 positive and 16 generalized place invariants in 4 ms returned sat
[2023-03-13 18:47:37] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 18:47:37] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 18:47:37] [INFO ] After 7ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 18:47:37] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 0 ms to minimize.
[2023-03-13 18:47:37] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2023-03-13 18:47:37] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2023-03-13 18:47:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 216 ms
[2023-03-13 18:47:37] [INFO ] After 228ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-13 18:47:37] [INFO ] After 355ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 136/136 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 175 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 174 transition count 135
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 174 transition count 132
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 9 place count 170 transition count 132
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 12 place count 168 transition count 131
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 168 transition count 130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 167 transition count 130
Applied a total of 14 rules in 22 ms. Remains 167 /175 variables (removed 8) and now considering 130/136 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 167/175 places, 130/136 transitions.
Incomplete random walk after 10000 steps, including 580 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 199 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Probably explored full state space saw : 2684 states, properties seen :0
Probabilistic random walk after 9634 steps, saw 2684 distinct states, run finished after 35 ms. (steps per millisecond=275 ) properties seen :0
Explored full state space saw : 2684 states, properties seen :0
Exhaustive walk after 9634 steps, saw 2684 distinct states, run finished after 29 ms. (steps per millisecond=332 ) properties seen :0
Successfully simplified 10 atomic propositions for a total of 16 simplifications.
FORMULA BusinessProcesses-PT-15-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 18:47:37] [INFO ] Flatten gal took : 30 ms
[2023-03-13 18:47:37] [INFO ] Flatten gal took : 30 ms
[2023-03-13 18:47:37] [INFO ] Input system was already deterministic with 463 transitions.
Support contains 91 out of 524 places (down from 99) after GAL structural reductions.
Computed a total of 227 stabilizing places and 199 stable transitions
Graph (complete) has 1158 edges and 524 vertex of which 523 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.17 ms
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 463/463 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 501 transition count 440
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 501 transition count 440
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 57 place count 490 transition count 429
Iterating global reduction 0 with 11 rules applied. Total rules applied 68 place count 490 transition count 429
Applied a total of 68 rules in 26 ms. Remains 490 /524 variables (removed 34) and now considering 429/463 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 490/524 places, 429/463 transitions.
[2023-03-13 18:47:38] [INFO ] Flatten gal took : 24 ms
[2023-03-13 18:47:38] [INFO ] Flatten gal took : 23 ms
[2023-03-13 18:47:38] [INFO ] Input system was already deterministic with 429 transitions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 463/463 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 497 transition count 436
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 497 transition count 436
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 64 place count 487 transition count 426
Iterating global reduction 0 with 10 rules applied. Total rules applied 74 place count 487 transition count 426
Applied a total of 74 rules in 23 ms. Remains 487 /524 variables (removed 37) and now considering 426/463 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 487/524 places, 426/463 transitions.
[2023-03-13 18:47:38] [INFO ] Flatten gal took : 22 ms
[2023-03-13 18:47:38] [INFO ] Flatten gal took : 23 ms
[2023-03-13 18:47:38] [INFO ] Input system was already deterministic with 426 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 524/524 places, 463/463 transitions.
Graph (trivial) has 260 edges and 524 vertex of which 6 / 524 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 1152 edges and 519 vertex of which 518 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 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 517 transition count 383
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 445 transition count 383
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 146 place count 445 transition count 282
Deduced a syphon composed of 101 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 368 place count 324 transition count 282
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 394 place count 298 transition count 256
Ensure Unique test removed 1 places
Iterating global reduction 2 with 27 rules applied. Total rules applied 421 place count 297 transition count 256
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 421 place count 297 transition count 252
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 430 place count 292 transition count 252
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 2 with 236 rules applied. Total rules applied 666 place count 173 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 667 place count 172 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 668 place count 171 transition count 134
Applied a total of 668 rules in 70 ms. Remains 171 /524 variables (removed 353) and now considering 134/463 (removed 329) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 70 ms. Remains : 171/524 places, 134/463 transitions.
[2023-03-13 18:47:38] [INFO ] Flatten gal took : 9 ms
[2023-03-13 18:47:38] [INFO ] Flatten gal took : 9 ms
[2023-03-13 18:47:38] [INFO ] Input system was already deterministic with 134 transitions.
Incomplete random walk after 10000 steps, including 2066 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 584 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Finished probabilistic random walk after 227 steps, run visited all 1 properties in 6 ms. (steps per millisecond=37 )
Probabilistic random walk after 227 steps, saw 137 distinct states, run finished after 6 ms. (steps per millisecond=37 ) properties seen :1
FORMULA BusinessProcesses-PT-15-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 463/463 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 496 transition count 435
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 496 transition count 435
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 68 place count 484 transition count 423
Iterating global reduction 0 with 12 rules applied. Total rules applied 80 place count 484 transition count 423
Applied a total of 80 rules in 62 ms. Remains 484 /524 variables (removed 40) and now considering 423/463 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63 ms. Remains : 484/524 places, 423/463 transitions.
[2023-03-13 18:47:38] [INFO ] Flatten gal took : 15 ms
[2023-03-13 18:47:38] [INFO ] Flatten gal took : 15 ms
[2023-03-13 18:47:38] [INFO ] Input system was already deterministic with 423 transitions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 463/463 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 499 transition count 438
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 499 transition count 438
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 60 place count 489 transition count 428
Iterating global reduction 0 with 10 rules applied. Total rules applied 70 place count 489 transition count 428
Applied a total of 70 rules in 42 ms. Remains 489 /524 variables (removed 35) and now considering 428/463 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 489/524 places, 428/463 transitions.
[2023-03-13 18:47:38] [INFO ] Flatten gal took : 13 ms
[2023-03-13 18:47:38] [INFO ] Flatten gal took : 13 ms
[2023-03-13 18:47:38] [INFO ] Input system was already deterministic with 428 transitions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 463/463 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 499 transition count 438
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 499 transition count 438
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 62 place count 487 transition count 426
Iterating global reduction 0 with 12 rules applied. Total rules applied 74 place count 487 transition count 426
Applied a total of 74 rules in 41 ms. Remains 487 /524 variables (removed 37) and now considering 426/463 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 487/524 places, 426/463 transitions.
[2023-03-13 18:47:38] [INFO ] Flatten gal took : 12 ms
[2023-03-13 18:47:38] [INFO ] Flatten gal took : 11 ms
[2023-03-13 18:47:38] [INFO ] Input system was already deterministic with 426 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 524/524 places, 463/463 transitions.
Graph (trivial) has 261 edges and 524 vertex of which 6 / 524 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 1152 edges and 519 vertex of which 518 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 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 75 place count 517 transition count 382
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 1 with 73 rules applied. Total rules applied 148 place count 444 transition count 382
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 148 place count 444 transition count 281
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 370 place count 323 transition count 281
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 396 place count 297 transition count 255
Ensure Unique test removed 1 places
Iterating global reduction 2 with 27 rules applied. Total rules applied 423 place count 296 transition count 255
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 423 place count 296 transition count 251
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 432 place count 291 transition count 251
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 2 with 236 rules applied. Total rules applied 668 place count 172 transition count 134
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 669 place count 171 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 670 place count 170 transition count 133
Applied a total of 670 rules in 45 ms. Remains 170 /524 variables (removed 354) and now considering 133/463 (removed 330) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45 ms. Remains : 170/524 places, 133/463 transitions.
[2023-03-13 18:47:38] [INFO ] Flatten gal took : 6 ms
[2023-03-13 18:47:38] [INFO ] Flatten gal took : 6 ms
[2023-03-13 18:47:38] [INFO ] Input system was already deterministic with 133 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 524/524 places, 463/463 transitions.
Graph (complete) has 1158 edges and 524 vertex of which 523 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 66 place count 522 transition count 396
Reduce places removed 65 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 69 rules applied. Total rules applied 135 place count 457 transition count 392
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 139 place count 453 transition count 392
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 106 Pre rules applied. Total rules applied 139 place count 453 transition count 286
Deduced a syphon composed of 106 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 3 with 231 rules applied. Total rules applied 370 place count 328 transition count 286
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 396 place count 302 transition count 260
Ensure Unique test removed 1 places
Iterating global reduction 3 with 27 rules applied. Total rules applied 423 place count 301 transition count 260
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 423 place count 301 transition count 256
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 432 place count 296 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 2 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 228 rules applied. Total rules applied 660 place count 181 transition count 143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 661 place count 180 transition count 142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 662 place count 179 transition count 142
Applied a total of 662 rules in 41 ms. Remains 179 /524 variables (removed 345) and now considering 142/463 (removed 321) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42 ms. Remains : 179/524 places, 142/463 transitions.
[2023-03-13 18:47:38] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:47:38] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:47:38] [INFO ] Input system was already deterministic with 142 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 524/524 places, 463/463 transitions.
Graph (trivial) has 260 edges and 524 vertex of which 6 / 524 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 1152 edges and 519 vertex of which 518 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 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 75 place count 517 transition count 382
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 1 with 73 rules applied. Total rules applied 148 place count 444 transition count 382
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 148 place count 444 transition count 282
Deduced a syphon composed of 100 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 2 with 219 rules applied. Total rules applied 367 place count 325 transition count 282
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 393 place count 299 transition count 256
Ensure Unique test removed 1 places
Iterating global reduction 2 with 27 rules applied. Total rules applied 420 place count 298 transition count 256
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 420 place count 298 transition count 253
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 427 place count 294 transition count 253
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 238 rules applied. Total rules applied 665 place count 174 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 666 place count 173 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 667 place count 172 transition count 134
Applied a total of 667 rules in 44 ms. Remains 172 /524 variables (removed 352) and now considering 134/463 (removed 329) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 44 ms. Remains : 172/524 places, 134/463 transitions.
[2023-03-13 18:47:38] [INFO ] Flatten gal took : 6 ms
[2023-03-13 18:47:38] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:47:38] [INFO ] Input system was already deterministic with 134 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 524/524 places, 463/463 transitions.
Graph (trivial) has 261 edges and 524 vertex of which 6 / 524 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 1152 edges and 519 vertex of which 518 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 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 75 place count 517 transition count 382
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 1 with 73 rules applied. Total rules applied 148 place count 444 transition count 382
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 148 place count 444 transition count 281
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 221 rules applied. Total rules applied 369 place count 324 transition count 281
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 395 place count 298 transition count 255
Ensure Unique test removed 1 places
Iterating global reduction 2 with 27 rules applied. Total rules applied 422 place count 297 transition count 255
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 422 place count 297 transition count 252
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 429 place count 293 transition count 252
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Deduced a syphon composed of 112 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 655 place count 179 transition count 140
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 656 place count 178 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 657 place count 177 transition count 139
Applied a total of 657 rules in 37 ms. Remains 177 /524 variables (removed 347) and now considering 139/463 (removed 324) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 177/524 places, 139/463 transitions.
[2023-03-13 18:47:38] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:47:38] [INFO ] Flatten gal took : 6 ms
[2023-03-13 18:47:38] [INFO ] Input system was already deterministic with 139 transitions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 463/463 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 500 transition count 439
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 500 transition count 439
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 58 place count 490 transition count 429
Iterating global reduction 0 with 10 rules applied. Total rules applied 68 place count 490 transition count 429
Applied a total of 68 rules in 24 ms. Remains 490 /524 variables (removed 34) and now considering 429/463 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 490/524 places, 429/463 transitions.
[2023-03-13 18:47:39] [INFO ] Flatten gal took : 11 ms
[2023-03-13 18:47:39] [INFO ] Flatten gal took : 11 ms
[2023-03-13 18:47:39] [INFO ] Input system was already deterministic with 429 transitions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 463/463 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 499 transition count 438
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 499 transition count 438
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 61 place count 488 transition count 427
Iterating global reduction 0 with 11 rules applied. Total rules applied 72 place count 488 transition count 427
Applied a total of 72 rules in 22 ms. Remains 488 /524 variables (removed 36) and now considering 427/463 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 488/524 places, 427/463 transitions.
[2023-03-13 18:47:39] [INFO ] Flatten gal took : 11 ms
[2023-03-13 18:47:39] [INFO ] Flatten gal took : 11 ms
[2023-03-13 18:47:39] [INFO ] Input system was already deterministic with 427 transitions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 463/463 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 496 transition count 435
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 496 transition count 435
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 68 place count 484 transition count 423
Iterating global reduction 0 with 12 rules applied. Total rules applied 80 place count 484 transition count 423
Applied a total of 80 rules in 22 ms. Remains 484 /524 variables (removed 40) and now considering 423/463 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 484/524 places, 423/463 transitions.
[2023-03-13 18:47:39] [INFO ] Flatten gal took : 14 ms
[2023-03-13 18:47:39] [INFO ] Flatten gal took : 11 ms
[2023-03-13 18:47:39] [INFO ] Input system was already deterministic with 423 transitions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 463/463 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 496 transition count 435
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 496 transition count 435
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 68 place count 484 transition count 423
Iterating global reduction 0 with 12 rules applied. Total rules applied 80 place count 484 transition count 423
Applied a total of 80 rules in 25 ms. Remains 484 /524 variables (removed 40) and now considering 423/463 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 484/524 places, 423/463 transitions.
[2023-03-13 18:47:39] [INFO ] Flatten gal took : 11 ms
[2023-03-13 18:47:39] [INFO ] Flatten gal took : 12 ms
[2023-03-13 18:47:39] [INFO ] Input system was already deterministic with 423 transitions.
[2023-03-13 18:47:39] [INFO ] Flatten gal took : 16 ms
[2023-03-13 18:47:39] [INFO ] Flatten gal took : 12 ms
[2023-03-13 18:47:39] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-13 18:47:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 524 places, 463 transitions and 1457 arcs took 2 ms.
Total runtime 22639 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: 524 NrTr: 463 NrArc: 1457)

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

net check time: 0m 0.000sec

init dd package: 0m 3.287sec


before gc: list nodes free: 1777637

after gc: idd nodes used:59434178, unused:4565822; list nodes free:20340936

RS generation: 37m59.971sec


-> last computed set: #nodes 59434092 (5.9e+07) #states 30,037,767,087 (10)


CANNOT_COMPUTE


BK_STOP 1678735582260

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
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.009sec

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-15"
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-15, 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-167813695900562"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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