Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r047-tajo-171620398400514.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is BusinessProcesses-PT-09, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398400514
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 16:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Apr 11 16:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 16:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 16:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 104K May 18 16:42 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-09-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-2023-12
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-2023-13
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-2023-14
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716304469345

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 15:14:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 15:14:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:14:30] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2024-05-21 15:14:30] [INFO ] Transformed 403 places.
[2024-05-21 15:14:30] [INFO ] Transformed 374 transitions.
[2024-05-21 15:14:30] [INFO ] Found NUPN structural information;
[2024-05-21 15:14:30] [INFO ] Parsed PT model containing 403 places and 374 transitions and 1148 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 134 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 374/374 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 402 transition count 374
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 32 place count 371 transition count 343
Iterating global reduction 1 with 31 rules applied. Total rules applied 63 place count 371 transition count 343
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 72 place count 362 transition count 334
Iterating global reduction 1 with 9 rules applied. Total rules applied 81 place count 362 transition count 334
Applied a total of 81 rules in 76 ms. Remains 362 /403 variables (removed 41) and now considering 334/374 (removed 40) transitions.
// Phase 1: matrix 334 rows 362 cols
[2024-05-21 15:14:31] [INFO ] Computed 64 invariants in 26 ms
[2024-05-21 15:14:31] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-05-21 15:14:31] [INFO ] Invariant cache hit.
[2024-05-21 15:14:31] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
Running 333 sub problems to find dead transitions.
[2024-05-21 15:14:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (OVERLAPS) 1/362 variables, 34/62 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-21 15:14:37] [INFO ] Deduced a trap composed of 91 places in 153 ms of which 31 ms to minimize.
[2024-05-21 15:14:37] [INFO ] Deduced a trap composed of 64 places in 106 ms of which 3 ms to minimize.
[2024-05-21 15:14:37] [INFO ] Deduced a trap composed of 73 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:14:37] [INFO ] Deduced a trap composed of 78 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:14:38] [INFO ] Deduced a trap composed of 82 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:14:38] [INFO ] Deduced a trap composed of 62 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:14:38] [INFO ] Deduced a trap composed of 82 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:14:38] [INFO ] Deduced a trap composed of 75 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:14:38] [INFO ] Deduced a trap composed of 88 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:14:38] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 1 ms to minimize.
[2024-05-21 15:14:38] [INFO ] Deduced a trap composed of 94 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:14:38] [INFO ] Deduced a trap composed of 78 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:14:38] [INFO ] Deduced a trap composed of 81 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:14:38] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:14:39] [INFO ] Deduced a trap composed of 84 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:14:39] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:14:39] [INFO ] Deduced a trap composed of 75 places in 125 ms of which 2 ms to minimize.
[2024-05-21 15:14:39] [INFO ] Deduced a trap composed of 70 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:14:39] [INFO ] Deduced a trap composed of 71 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:14:39] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-21 15:14:39] [INFO ] Deduced a trap composed of 80 places in 137 ms of which 2 ms to minimize.
[2024-05-21 15:14:40] [INFO ] Deduced a trap composed of 91 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:14:40] [INFO ] Deduced a trap composed of 88 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:14:40] [INFO ] Deduced a trap composed of 82 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:14:40] [INFO ] Deduced a trap composed of 105 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:14:40] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:14:40] [INFO ] Deduced a trap composed of 70 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:14:40] [INFO ] Deduced a trap composed of 94 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:14:40] [INFO ] Deduced a trap composed of 63 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:14:40] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:14:41] [INFO ] Deduced a trap composed of 74 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:14:41] [INFO ] Deduced a trap composed of 86 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:14:41] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:14:41] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-21 15:14:41] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:14:41] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 3 ms to minimize.
[2024-05-21 15:14:41] [INFO ] Deduced a trap composed of 60 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:14:41] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 2 ms to minimize.
[2024-05-21 15:14:41] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 3 ms to minimize.
[2024-05-21 15:14:42] [INFO ] Deduced a trap composed of 93 places in 138 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-21 15:14:42] [INFO ] Deduced a trap composed of 88 places in 127 ms of which 2 ms to minimize.
[2024-05-21 15:14:42] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:14:42] [INFO ] Deduced a trap composed of 57 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:14:42] [INFO ] Deduced a trap composed of 73 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:14:42] [INFO ] Deduced a trap composed of 82 places in 98 ms of which 3 ms to minimize.
[2024-05-21 15:14:43] [INFO ] Deduced a trap composed of 76 places in 101 ms of which 3 ms to minimize.
[2024-05-21 15:14:43] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:14:43] [INFO ] Deduced a trap composed of 54 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:14:43] [INFO ] Deduced a trap composed of 59 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:14:43] [INFO ] Deduced a trap composed of 62 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:14:43] [INFO ] Deduced a trap composed of 52 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:14:43] [INFO ] Deduced a trap composed of 64 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:14:44] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:14:44] [INFO ] Deduced a trap composed of 58 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:14:44] [INFO ] Deduced a trap composed of 59 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:14:44] [INFO ] Deduced a trap composed of 62 places in 107 ms of which 3 ms to minimize.
[2024-05-21 15:14:44] [INFO ] Deduced a trap composed of 70 places in 109 ms of which 4 ms to minimize.
[2024-05-21 15:14:44] [INFO ] Deduced a trap composed of 56 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:14:44] [INFO ] Deduced a trap composed of 70 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:14:44] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-21 15:14:47] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:14:47] [INFO ] Deduced a trap composed of 74 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:14:47] [INFO ] Deduced a trap composed of 82 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:14:47] [INFO ] Deduced a trap composed of 61 places in 108 ms of which 4 ms to minimize.
[2024-05-21 15:14:47] [INFO ] Deduced a trap composed of 81 places in 86 ms of which 3 ms to minimize.
[2024-05-21 15:14:47] [INFO ] Deduced a trap composed of 75 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:14:47] [INFO ] Deduced a trap composed of 74 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:14:47] [INFO ] Deduced a trap composed of 74 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:14:47] [INFO ] Deduced a trap composed of 74 places in 107 ms of which 3 ms to minimize.
[2024-05-21 15:14:48] [INFO ] Deduced a trap composed of 78 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:14:48] [INFO ] Deduced a trap composed of 73 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:14:48] [INFO ] Deduced a trap composed of 80 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:14:48] [INFO ] Deduced a trap composed of 87 places in 128 ms of which 2 ms to minimize.
[2024-05-21 15:14:48] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 3 ms to minimize.
[2024-05-21 15:14:48] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:14:48] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-21 15:14:49] [INFO ] Deduced a trap composed of 81 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:14:49] [INFO ] Deduced a trap composed of 87 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:14:49] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:14:49] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-21 15:14:50] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 2 ms to minimize.
[2024-05-21 15:14:50] [INFO ] Deduced a trap composed of 79 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:14:50] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:14:51] [INFO ] Deduced a trap composed of 79 places in 143 ms of which 2 ms to minimize.
[2024-05-21 15:14:51] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:14:51] [INFO ] Deduced a trap composed of 74 places in 134 ms of which 2 ms to minimize.
[2024-05-21 15:14:51] [INFO ] Deduced a trap composed of 84 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:14:51] [INFO ] Deduced a trap composed of 75 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:14:52] [INFO ] Deduced a trap composed of 81 places in 132 ms of which 2 ms to minimize.
[2024-05-21 15:14:52] [INFO ] Deduced a trap composed of 74 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:14:52] [INFO ] Deduced a trap composed of 75 places in 126 ms of which 4 ms to minimize.
[2024-05-21 15:14:52] [INFO ] Deduced a trap composed of 78 places in 102 ms of which 3 ms to minimize.
[2024-05-21 15:14:52] [INFO ] Deduced a trap composed of 75 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:14:52] [INFO ] Deduced a trap composed of 82 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:14:52] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:14:52] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 1 ms to minimize.
[2024-05-21 15:14:53] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 3 ms to minimize.
[2024-05-21 15:14:53] [INFO ] Deduced a trap composed of 71 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:14:53] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 1 ms to minimize.
[2024-05-21 15:14:53] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-21 15:14:54] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:14:54] [INFO ] Deduced a trap composed of 78 places in 196 ms of which 2 ms to minimize.
[2024-05-21 15:14:54] [INFO ] Deduced a trap composed of 91 places in 144 ms of which 2 ms to minimize.
[2024-05-21 15:14:55] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:14:55] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:14:55] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:14:55] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:14:55] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 4 ms to minimize.
[2024-05-21 15:14:55] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 4 ms to minimize.
[2024-05-21 15:14:56] [INFO ] Deduced a trap composed of 44 places in 143 ms of which 5 ms to minimize.
[2024-05-21 15:14:56] [INFO ] Deduced a trap composed of 84 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:14:56] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:14:56] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:14:56] [INFO ] Deduced a trap composed of 60 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:14:56] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:14:57] [INFO ] Deduced a trap composed of 78 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:14:57] [INFO ] Deduced a trap composed of 89 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:14:57] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:14:57] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:14:57] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 2 ms to minimize.
Problem TDEAD262 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD312 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 20/184 constraints. Problems are: Problem set: 6 solved, 327 unsolved
[2024-05-21 15:15:01] [INFO ] Deduced a trap composed of 88 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:15:01] [INFO ] Deduced a trap composed of 73 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:15:01] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:15:01] [INFO ] Deduced a trap composed of 80 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:15:01] [INFO ] Deduced a trap composed of 77 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:15:01] [INFO ] Deduced a trap composed of 72 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:15:01] [INFO ] Deduced a trap composed of 67 places in 102 ms of which 2 ms to minimize.
SMT process timed out in 30166ms, After SMT, problems are : Problem set: 6 solved, 327 unsolved
Search for dead transitions found 6 dead transitions in 30183ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in LTL mode, iteration 1 : 362/403 places, 328/374 transitions.
Applied a total of 0 rules in 6 ms. Remains 362 /362 variables (removed 0) and now considering 328/328 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30923 ms. Remains : 362/403 places, 328/374 transitions.
Support contains 134 out of 362 places after structural reductions.
[2024-05-21 15:15:02] [INFO ] Flatten gal took : 68 ms
[2024-05-21 15:15:02] [INFO ] Flatten gal took : 29 ms
[2024-05-21 15:15:02] [INFO ] Input system was already deterministic with 328 transitions.
Support contains 132 out of 362 places (down from 134) after GAL structural reductions.
RANDOM walk for 40000 steps (419 resets) in 1847 ms. (21 steps per ms) remains 14/93 properties
BEST_FIRST walk for 40003 steps (70 resets) in 160 ms. (248 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (72 resets) in 150 ms. (264 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (76 resets) in 140 ms. (283 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (77 resets) in 199 ms. (200 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (75 resets) in 201 ms. (198 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (66 resets) in 171 ms. (232 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (71 resets) in 67 ms. (588 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (67 resets) in 232 ms. (171 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (75 resets) in 128 ms. (310 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (65 resets) in 321 ms. (124 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40004 steps (76 resets) in 166 ms. (239 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (73 resets) in 201 ms. (198 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (78 resets) in 151 ms. (263 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (71 resets) in 119 ms. (333 steps per ms) remains 13/13 properties
// Phase 1: matrix 328 rows 362 cols
[2024-05-21 15:15:03] [INFO ] Computed 64 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp55 is UNSAT
At refinement iteration 1 (OVERLAPS) 129/164 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 111/275 variables, 24/34 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 0/34 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp69 is UNSAT
At refinement iteration 5 (OVERLAPS) 84/359 variables, 30/64 constraints. Problems are: Problem set: 4 solved, 9 unsolved
[2024-05-21 15:15:04] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:15:04] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:15:04] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:15:04] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:15:04] [INFO ] Deduced a trap composed of 78 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:15:04] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:15:04] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:15:05] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:15:05] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 3 ms to minimize.
[2024-05-21 15:15:05] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:15:05] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 8 ms to minimize.
[2024-05-21 15:15:05] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:15:05] [INFO ] Deduced a trap composed of 75 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:15:05] [INFO ] Deduced a trap composed of 82 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:15:05] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 3 ms to minimize.
[2024-05-21 15:15:05] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:15:06] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:15:06] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:15:06] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 3 ms to minimize.
[2024-05-21 15:15:06] [INFO ] Deduced a trap composed of 100 places in 103 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 20/84 constraints. Problems are: Problem set: 4 solved, 9 unsolved
[2024-05-21 15:15:06] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 3 ms to minimize.
Problem AtomicPropp12 is UNSAT
[2024-05-21 15:15:06] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:15:06] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:15:06] [INFO ] Deduced a trap composed of 56 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:15:06] [INFO ] Deduced a trap composed of 76 places in 102 ms of which 3 ms to minimize.
[2024-05-21 15:15:07] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:15:07] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:15:07] [INFO ] Deduced a trap composed of 47 places in 94 ms of which 1 ms to minimize.
[2024-05-21 15:15:07] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:15:07] [INFO ] Deduced a trap composed of 42 places in 135 ms of which 2 ms to minimize.
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp28 is UNSAT
[2024-05-21 15:15:07] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:15:07] [INFO ] Deduced a trap composed of 69 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:15:07] [INFO ] Deduced a trap composed of 74 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:15:07] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:15:08] [INFO ] Deduced a trap composed of 62 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:15:08] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:15:08] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:15:08] [INFO ] Deduced a trap composed of 64 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:15:08] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:15:08] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 2 ms to minimize.
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp28 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 20/104 constraints. Problems are: Problem set: 7 solved, 6 unsolved
[2024-05-21 15:15:08] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:15:08] [INFO ] Deduced a trap composed of 94 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:15:08] [INFO ] Deduced a trap composed of 58 places in 115 ms of which 2 ms to minimize.
SMT process timed out in 5028ms, After SMT, problems are : Problem set: 7 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 328/328 transitions.
Graph (trivial) has 178 edges and 362 vertex of which 7 / 362 are part of one of the 1 SCC in 5 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 780 edges and 356 vertex of which 355 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 (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 355 transition count 265
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 301 transition count 265
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 62 Pre rules applied. Total rules applied 110 place count 301 transition count 203
Deduced a syphon composed of 62 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 133 rules applied. Total rules applied 243 place count 230 transition count 203
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 268 place count 205 transition count 178
Iterating global reduction 2 with 25 rules applied. Total rules applied 293 place count 205 transition count 178
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 293 place count 205 transition count 176
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 297 place count 203 transition count 176
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 131 rules applied. Total rules applied 428 place count 136 transition count 112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 430 place count 135 transition count 115
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 432 place count 135 transition count 113
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 434 place count 133 transition count 113
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 439 place count 133 transition count 113
Applied a total of 439 rules in 117 ms. Remains 133 /362 variables (removed 229) and now considering 113/328 (removed 215) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 133/362 places, 113/328 transitions.
RANDOM walk for 40000 steps (2034 resets) in 1079 ms. (37 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40003 steps (786 resets) in 261 ms. (152 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (985 resets) in 207 ms. (192 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (828 resets) in 237 ms. (168 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (782 resets) in 214 ms. (186 steps per ms) remains 4/4 properties
// Phase 1: matrix 113 rows 133 cols
[2024-05-21 15:15:09] [INFO ] Computed 52 invariants in 2 ms
[2024-05-21 15:15:09] [INFO ] State equation strengthened by 11 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 34/44 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 49/93 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 38/131 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 15:15:09] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-21 15:15:10] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-21 15:15:10] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 2 ms to minimize.
[2024-05-21 15:15:10] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-21 15:15:10] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-21 15:15:10] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:15:10] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp90 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 7/58 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/58 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/132 variables, 1/59 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/59 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 113/245 variables, 132/191 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 11/202 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 0/202 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/246 variables, 1/203 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 0/203 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/246 variables, 0/203 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 203 constraints, problems are : Problem set: 3 solved, 1 unsolved in 495 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 133/133 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 83/89 variables, 32/33 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/33 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 40/129 variables, 16/49 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 7/56 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-05-21 15:15:10] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-21 15:15:10] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-21 15:15:10] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:15:10] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:15:10] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-21 15:15:10] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
Problem AtomicPropp68 is UNSAT
After SMT solving in domain Int declared 129/246 variables, and 62 constraints, problems are : Problem set: 4 solved, 0 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 16/19 constraints, State Equation: 0/133 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 13/13 constraints]
After SMT, in 827ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 11 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA BusinessProcesses-PT-09-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 15:15:10] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-21 15:15:10] [INFO ] Flatten gal took : 19 ms
FORMULA BusinessProcesses-PT-09-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 15:15:10] [INFO ] Flatten gal took : 17 ms
[2024-05-21 15:15:10] [INFO ] Input system was already deterministic with 328 transitions.
Computed a total of 222 stabilizing places and 218 stable transitions
Graph (complete) has 788 edges and 362 vertex of which 361 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 328/328 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 328 transition count 294
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 328 transition count 294
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 79 place count 317 transition count 283
Iterating global reduction 0 with 11 rules applied. Total rules applied 90 place count 317 transition count 283
Applied a total of 90 rules in 27 ms. Remains 317 /362 variables (removed 45) and now considering 283/328 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 317/362 places, 283/328 transitions.
[2024-05-21 15:15:10] [INFO ] Flatten gal took : 15 ms
[2024-05-21 15:15:10] [INFO ] Flatten gal took : 14 ms
[2024-05-21 15:15:10] [INFO ] Input system was already deterministic with 283 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 362/362 places, 328/328 transitions.
Graph (trivial) has 185 edges and 362 vertex of which 7 / 362 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 781 edges and 356 vertex of which 355 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 (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 354 transition count 264
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 112 place count 299 transition count 264
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 112 place count 299 transition count 199
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 139 rules applied. Total rules applied 251 place count 225 transition count 199
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 279 place count 197 transition count 171
Iterating global reduction 2 with 28 rules applied. Total rules applied 307 place count 197 transition count 171
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 307 place count 197 transition count 168
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 313 place count 194 transition count 168
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 139 rules applied. Total rules applied 452 place count 123 transition count 100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 453 place count 122 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 454 place count 121 transition count 99
Applied a total of 454 rules in 47 ms. Remains 121 /362 variables (removed 241) and now considering 99/328 (removed 229) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47 ms. Remains : 121/362 places, 99/328 transitions.
[2024-05-21 15:15:10] [INFO ] Flatten gal took : 6 ms
[2024-05-21 15:15:10] [INFO ] Flatten gal took : 6 ms
[2024-05-21 15:15:10] [INFO ] Input system was already deterministic with 99 transitions.
RANDOM walk for 523 steps (108 resets) in 24 ms. (20 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-09-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 328/328 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 330 transition count 296
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 330 transition count 296
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 74 place count 320 transition count 286
Iterating global reduction 0 with 10 rules applied. Total rules applied 84 place count 320 transition count 286
Applied a total of 84 rules in 33 ms. Remains 320 /362 variables (removed 42) and now considering 286/328 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 320/362 places, 286/328 transitions.
[2024-05-21 15:15:10] [INFO ] Flatten gal took : 12 ms
[2024-05-21 15:15:11] [INFO ] Flatten gal took : 13 ms
[2024-05-21 15:15:11] [INFO ] Input system was already deterministic with 286 transitions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 328/328 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 329 transition count 295
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 329 transition count 295
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 77 place count 318 transition count 284
Iterating global reduction 0 with 11 rules applied. Total rules applied 88 place count 318 transition count 284
Applied a total of 88 rules in 31 ms. Remains 318 /362 variables (removed 44) and now considering 284/328 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 318/362 places, 284/328 transitions.
[2024-05-21 15:15:11] [INFO ] Flatten gal took : 12 ms
[2024-05-21 15:15:11] [INFO ] Flatten gal took : 12 ms
[2024-05-21 15:15:11] [INFO ] Input system was already deterministic with 284 transitions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 328/328 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 331 transition count 297
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 331 transition count 297
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 73 place count 320 transition count 286
Iterating global reduction 0 with 11 rules applied. Total rules applied 84 place count 320 transition count 286
Applied a total of 84 rules in 28 ms. Remains 320 /362 variables (removed 42) and now considering 286/328 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 320/362 places, 286/328 transitions.
[2024-05-21 15:15:11] [INFO ] Flatten gal took : 10 ms
[2024-05-21 15:15:11] [INFO ] Flatten gal took : 11 ms
[2024-05-21 15:15:11] [INFO ] Input system was already deterministic with 286 transitions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 328/328 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 334 transition count 300
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 334 transition count 300
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 64 place count 326 transition count 292
Iterating global reduction 0 with 8 rules applied. Total rules applied 72 place count 326 transition count 292
Applied a total of 72 rules in 28 ms. Remains 326 /362 variables (removed 36) and now considering 292/328 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 326/362 places, 292/328 transitions.
[2024-05-21 15:15:11] [INFO ] Flatten gal took : 12 ms
[2024-05-21 15:15:11] [INFO ] Flatten gal took : 12 ms
[2024-05-21 15:15:11] [INFO ] Input system was already deterministic with 292 transitions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 328/328 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 332 transition count 298
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 332 transition count 298
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 70 place count 322 transition count 288
Iterating global reduction 0 with 10 rules applied. Total rules applied 80 place count 322 transition count 288
Applied a total of 80 rules in 24 ms. Remains 322 /362 variables (removed 40) and now considering 288/328 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 322/362 places, 288/328 transitions.
[2024-05-21 15:15:11] [INFO ] Flatten gal took : 12 ms
[2024-05-21 15:15:11] [INFO ] Flatten gal took : 11 ms
[2024-05-21 15:15:11] [INFO ] Input system was already deterministic with 288 transitions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 328/328 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 328 transition count 294
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 328 transition count 294
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 79 place count 317 transition count 283
Iterating global reduction 0 with 11 rules applied. Total rules applied 90 place count 317 transition count 283
Applied a total of 90 rules in 12 ms. Remains 317 /362 variables (removed 45) and now considering 283/328 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 317/362 places, 283/328 transitions.
[2024-05-21 15:15:11] [INFO ] Flatten gal took : 11 ms
[2024-05-21 15:15:11] [INFO ] Flatten gal took : 11 ms
[2024-05-21 15:15:11] [INFO ] Input system was already deterministic with 283 transitions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 328/328 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 330 transition count 296
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 330 transition count 296
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 74 place count 320 transition count 286
Iterating global reduction 0 with 10 rules applied. Total rules applied 84 place count 320 transition count 286
Applied a total of 84 rules in 20 ms. Remains 320 /362 variables (removed 42) and now considering 286/328 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 320/362 places, 286/328 transitions.
[2024-05-21 15:15:11] [INFO ] Flatten gal took : 10 ms
[2024-05-21 15:15:11] [INFO ] Flatten gal took : 9 ms
[2024-05-21 15:15:11] [INFO ] Input system was already deterministic with 286 transitions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 328/328 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 328 transition count 294
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 328 transition count 294
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 79 place count 317 transition count 283
Iterating global reduction 0 with 11 rules applied. Total rules applied 90 place count 317 transition count 283
Applied a total of 90 rules in 13 ms. Remains 317 /362 variables (removed 45) and now considering 283/328 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 317/362 places, 283/328 transitions.
[2024-05-21 15:15:11] [INFO ] Flatten gal took : 9 ms
[2024-05-21 15:15:11] [INFO ] Flatten gal took : 10 ms
[2024-05-21 15:15:11] [INFO ] Input system was already deterministic with 283 transitions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 328/328 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 330 transition count 296
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 330 transition count 296
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 74 place count 320 transition count 286
Iterating global reduction 0 with 10 rules applied. Total rules applied 84 place count 320 transition count 286
Applied a total of 84 rules in 12 ms. Remains 320 /362 variables (removed 42) and now considering 286/328 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 320/362 places, 286/328 transitions.
[2024-05-21 15:15:11] [INFO ] Flatten gal took : 9 ms
[2024-05-21 15:15:11] [INFO ] Flatten gal took : 10 ms
[2024-05-21 15:15:11] [INFO ] Input system was already deterministic with 286 transitions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 328/328 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 330 transition count 296
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 330 transition count 296
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 74 place count 320 transition count 286
Iterating global reduction 0 with 10 rules applied. Total rules applied 84 place count 320 transition count 286
Applied a total of 84 rules in 13 ms. Remains 320 /362 variables (removed 42) and now considering 286/328 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 320/362 places, 286/328 transitions.
[2024-05-21 15:15:11] [INFO ] Flatten gal took : 10 ms
[2024-05-21 15:15:11] [INFO ] Flatten gal took : 10 ms
[2024-05-21 15:15:11] [INFO ] Input system was already deterministic with 286 transitions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 328/328 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 330 transition count 296
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 330 transition count 296
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 75 place count 319 transition count 285
Iterating global reduction 0 with 11 rules applied. Total rules applied 86 place count 319 transition count 285
Applied a total of 86 rules in 12 ms. Remains 319 /362 variables (removed 43) and now considering 285/328 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 319/362 places, 285/328 transitions.
[2024-05-21 15:15:11] [INFO ] Flatten gal took : 10 ms
[2024-05-21 15:15:11] [INFO ] Flatten gal took : 9 ms
[2024-05-21 15:15:11] [INFO ] Input system was already deterministic with 285 transitions.
[2024-05-21 15:15:11] [INFO ] Flatten gal took : 11 ms
[2024-05-21 15:15:11] [INFO ] Flatten gal took : 11 ms
[2024-05-21 15:15:11] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-05-21 15:15:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 362 places, 328 transitions and 1031 arcs took 3 ms.
Total runtime 41067 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BusinessProcesses-PT-09

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 362
TRANSITIONS: 328
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.007s, Sys 0.000s]


SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.001s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1128
MODEL NAME: /home/mcc/execution/415/model
362 places, 328 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA BusinessProcesses-PT-09-CTLFireability-2024-01 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-09-CTLFireability-2024-03 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-09-CTLFireability-2024-04 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-09-CTLFireability-2024-06 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-09-CTLFireability-2024-07 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-09-CTLFireability-2024-08 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-09-CTLFireability-2024-09 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-09-CTLFireability-2024-11 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-09-CTLFireability-2023-12 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-09-CTLFireability-2023-13 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-09-CTLFireability-2023-14 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-09-CTLFireability-2023-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716307425396

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
Error in allocating array of size 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 1048576 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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-09"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is BusinessProcesses-PT-09, 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 r047-tajo-171620398400514"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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