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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K 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.8K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14: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 14K Apr 11 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Apr 11 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 16:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 16:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 59K 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-02-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-2023-12
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-2023-13
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-2023-14
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716302380408

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-02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 14:39:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 14:39:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 14:39:42] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2024-05-21 14:39:42] [INFO ] Transformed 262 places.
[2024-05-21 14:39:42] [INFO ] Transformed 219 transitions.
[2024-05-21 14:39:42] [INFO ] Found NUPN structural information;
[2024-05-21 14:39:42] [INFO ] Parsed PT model containing 262 places and 219 transitions and 576 arcs in 211 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 17 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 15 transitions.
FORMULA BusinessProcesses-PT-02-CTLFireability-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 131 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 204/204 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 239 transition count 204
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 16 place count 229 transition count 194
Iterating global reduction 1 with 10 rules applied. Total rules applied 26 place count 229 transition count 194
Applied a total of 26 rules in 40 ms. Remains 229 /245 variables (removed 16) and now considering 194/204 (removed 10) transitions.
// Phase 1: matrix 194 rows 229 cols
[2024-05-21 14:39:42] [INFO ] Computed 37 invariants in 23 ms
[2024-05-21 14:39:42] [INFO ] Implicit Places using invariants in 280 ms returned []
[2024-05-21 14:39:42] [INFO ] Invariant cache hit.
[2024-05-21 14:39:42] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2024-05-21 14:39:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/228 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/229 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 14:39:45] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 17 ms to minimize.
[2024-05-21 14:39:45] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 2 ms to minimize.
[2024-05-21 14:39:45] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-21 14:39:45] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 2 ms to minimize.
[2024-05-21 14:39:45] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-21 14:39:45] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 2 ms to minimize.
[2024-05-21 14:39:45] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 2 ms to minimize.
[2024-05-21 14:39:45] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 2 ms to minimize.
[2024-05-21 14:39:45] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-21 14:39:45] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-21 14:39:45] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-21 14:39:45] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
[2024-05-21 14:39:45] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-21 14:39:45] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 1 ms to minimize.
[2024-05-21 14:39:45] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-21 14:39:45] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 0 ms to minimize.
[2024-05-21 14:39:45] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-21 14:39:45] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-21 14:39:45] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2024-05-21 14:39:45] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 14:39:46] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 4 ms to minimize.
[2024-05-21 14:39:46] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-21 14:39:46] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-21 14:39:46] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-21 14:39:46] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-21 14:39:46] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2024-05-21 14:39:46] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-05-21 14:39:46] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 0 ms to minimize.
[2024-05-21 14:39:46] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-21 14:39:46] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 2 ms to minimize.
[2024-05-21 14:39:46] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-21 14:39:47] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-21 14:39:47] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-21 14:39:47] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 2 ms to minimize.
[2024-05-21 14:39:47] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 5 ms to minimize.
[2024-05-21 14:39:47] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-21 14:39:47] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-21 14:39:47] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-21 14:39:47] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-21 14:39:47] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 14:39:47] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 2 ms to minimize.
[2024-05-21 14:39:47] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-21 14:39:47] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-21 14:39:47] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-05-21 14:39:48] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-21 14:39:48] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-21 14:39:48] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-21 14:39:48] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-21 14:39:48] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2024-05-21 14:39:48] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-21 14:39:48] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 2 ms to minimize.
[2024-05-21 14:39:48] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-21 14:39:48] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-21 14:39:48] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-21 14:39:48] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 2 ms to minimize.
[2024-05-21 14:39:48] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 3 ms to minimize.
[2024-05-21 14:39:48] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
[2024-05-21 14:39:48] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-21 14:39:48] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-21 14:39:48] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 14:39:49] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 2 ms to minimize.
[2024-05-21 14:39:49] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 2 ms to minimize.
[2024-05-21 14:39:50] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-21 14:39:50] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 2 ms to minimize.
[2024-05-21 14:39:50] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-21 14:39:50] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 6/103 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 14:39:51] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-21 14:39:51] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/229 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (OVERLAPS) 194/423 variables, 229/334 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 14:39:53] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-21 14:39:53] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 2 ms to minimize.
[2024-05-21 14:39:53] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 2 ms to minimize.
[2024-05-21 14:39:53] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-21 14:39:53] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 5/339 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 14:39:55] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-05-21 14:39:55] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 14:39:58] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 14:39:59] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/423 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/423 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 16 (OVERLAPS) 0/423 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 343 constraints, problems are : Problem set: 0 solved, 193 unsolved in 20167 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 77/77 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/228 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/229 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 77/114 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 14:40:04] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-21 14:40:04] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (OVERLAPS) 194/423 variables, 229/345 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 193/538 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 14:40:06] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-21 14:40:08] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-21 14:40:08] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-21 14:40:08] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-21 14:40:08] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-21 14:40:08] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 6/544 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 14:40:12] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-21 14:40:12] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-21 14:40:12] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 2 ms to minimize.
[2024-05-21 14:40:12] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 2 ms to minimize.
[2024-05-21 14:40:12] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-21 14:40:13] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-05-21 14:40:13] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 7/551 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 14:40:18] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 1/552 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 14:40:22] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 2 ms to minimize.
[2024-05-21 14:40:22] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 2/554 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 14:40:27] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 1/555 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/423 variables, and 555 constraints, problems are : Problem set: 0 solved, 193 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 96/96 constraints]
After SMT, in 50268ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 50281ms
Starting structural reductions in LTL mode, iteration 1 : 229/245 places, 194/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50822 ms. Remains : 229/245 places, 194/204 transitions.
Support contains 131 out of 229 places after structural reductions.
[2024-05-21 14:40:33] [INFO ] Flatten gal took : 33 ms
[2024-05-21 14:40:33] [INFO ] Flatten gal took : 20 ms
[2024-05-21 14:40:33] [INFO ] Input system was already deterministic with 194 transitions.
Support contains 125 out of 229 places (down from 131) after GAL structural reductions.
RANDOM walk for 40000 steps (539 resets) in 1691 ms. (23 steps per ms) remains 20/87 properties
BEST_FIRST walk for 4003 steps (9 resets) in 43 ms. (90 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (10 resets) in 55 ms. (71 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (10 resets) in 37 ms. (105 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (9 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (10 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (9 resets) in 31 ms. (125 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (10 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (10 resets) in 53 ms. (74 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (9 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (10 resets) in 31 ms. (125 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (9 resets) in 25 ms. (153 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (10 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (11 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (11 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (10 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (9 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (10 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
[2024-05-21 14:40:33] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 80/121 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 47/168 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 27/195 variables, 13/37 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 175/370 variables, 195/232 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Problem AtomicPropp24 is UNSAT
At refinement iteration 9 (OVERLAPS) 43/413 variables, 29/261 constraints. Problems are: Problem set: 1 solved, 19 unsolved
[2024-05-21 14:40:34] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-21 14:40:34] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-21 14:40:34] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-21 14:40:34] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-21 14:40:34] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-21 14:40:34] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-21 14:40:34] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-21 14:40:34] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-21 14:40:34] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-21 14:40:34] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-21 14:40:34] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-21 14:40:34] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-21 14:40:34] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-21 14:40:34] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-21 14:40:35] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-21 14:40:35] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-21 14:40:35] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-21 14:40:35] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-21 14:40:35] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-21 14:40:35] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
Problem AtomicPropp64 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/413 variables, 20/281 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 0/281 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 6/419 variables, 3/284 constraints. Problems are: Problem set: 2 solved, 18 unsolved
[2024-05-21 14:40:35] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-21 14:40:35] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-21 14:40:35] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-21 14:40:35] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-21 14:40:35] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-21 14:40:35] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/419 variables, 6/290 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/419 variables, 0/290 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 15 (OVERLAPS) 4/423 variables, 2/292 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 0/292 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 17 (OVERLAPS) 0/423 variables, 0/292 constraints. Problems are: Problem set: 2 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 292 constraints, problems are : Problem set: 2 solved, 18 unsolved in 2294 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 2 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 72/102 variables, 12/12 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 1/13 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 62/164 variables, 12/25 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 3/28 constraints. Problems are: Problem set: 2 solved, 18 unsolved
[2024-05-21 14:40:36] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-21 14:40:36] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 2/30 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/30 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 28/192 variables, 13/43 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 14/57 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/57 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 170/362 variables, 192/249 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/362 variables, 11/260 constraints. Problems are: Problem set: 2 solved, 18 unsolved
[2024-05-21 14:40:36] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-21 14:40:36] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/362 variables, 2/262 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/362 variables, 0/262 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 15 (OVERLAPS) 50/412 variables, 31/293 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/412 variables, 7/300 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/412 variables, 8/308 constraints. Problems are: Problem set: 2 solved, 18 unsolved
[2024-05-21 14:40:37] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/412 variables, 1/309 constraints. Problems are: Problem set: 2 solved, 18 unsolved
[2024-05-21 14:40:37] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/412 variables, 1/310 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/412 variables, 0/310 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 21 (OVERLAPS) 7/419 variables, 4/314 constraints. Problems are: Problem set: 2 solved, 18 unsolved
[2024-05-21 14:40:37] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-05-21 14:40:37] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-21 14:40:37] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-05-21 14:40:37] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-21 14:40:37] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/419 variables, 5/319 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/419 variables, 0/319 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 24 (OVERLAPS) 4/423 variables, 2/321 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/423 variables, 0/321 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 26 (OVERLAPS) 0/423 variables, 0/321 constraints. Problems are: Problem set: 2 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 321 constraints, problems are : Problem set: 2 solved, 18 unsolved in 2256 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 18/20 constraints, Known Traps: 37/37 constraints]
After SMT, in 4564ms problems are : Problem set: 2 solved, 18 unsolved
Fused 18 Parikh solutions to 17 different solutions.
Parikh walk visited 15 properties in 3741 ms.
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 194/194 transitions.
Graph (trivial) has 124 edges and 229 vertex of which 7 / 229 are part of one of the 1 SCC in 4 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 418 edges and 223 vertex of which 217 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 217 transition count 139
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 82 place count 177 transition count 139
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 82 place count 177 transition count 102
Deduced a syphon composed of 37 places in 8 ms
Ensure Unique test removed 7 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 81 rules applied. Total rules applied 163 place count 133 transition count 102
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 189 place count 107 transition count 76
Iterating global reduction 2 with 26 rules applied. Total rules applied 215 place count 107 transition count 76
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 297 place count 65 transition count 36
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 298 place count 65 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 299 place count 64 transition count 35
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 300 place count 64 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 301 place count 63 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 302 place count 62 transition count 34
Applied a total of 302 rules in 85 ms. Remains 62 /229 variables (removed 167) and now considering 34/194 (removed 160) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 62/229 places, 34/194 transitions.
RANDOM walk for 451 steps (16 resets) in 16 ms. (26 steps per ms) remains 0/3 properties
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
[2024-05-21 14:40:42] [INFO ] Flatten gal took : 12 ms
[2024-05-21 14:40:42] [INFO ] Flatten gal took : 10 ms
[2024-05-21 14:40:42] [INFO ] Input system was already deterministic with 194 transitions.
Computed a total of 221 stabilizing places and 184 stable transitions
Graph (complete) has 426 edges and 229 vertex of which 223 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 194/194 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 198 transition count 163
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 198 transition count 163
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 188 transition count 153
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 188 transition count 153
Applied a total of 82 rules in 12 ms. Remains 188 /229 variables (removed 41) and now considering 153/194 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 188/229 places, 153/194 transitions.
[2024-05-21 14:40:42] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:40:42] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:40:42] [INFO ] Input system was already deterministic with 153 transitions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 194/194 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 199 transition count 164
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 199 transition count 164
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 68 place count 191 transition count 156
Iterating global reduction 0 with 8 rules applied. Total rules applied 76 place count 191 transition count 156
Applied a total of 76 rules in 11 ms. Remains 191 /229 variables (removed 38) and now considering 156/194 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 191/229 places, 156/194 transitions.
[2024-05-21 14:40:42] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:40:42] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:40:42] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 229/229 places, 194/194 transitions.
Graph (trivial) has 129 edges and 229 vertex of which 7 / 229 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 419 edges and 223 vertex of which 217 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 45 place count 216 transition count 137
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 88 place count 173 transition count 137
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 88 place count 173 transition count 100
Deduced a syphon composed of 37 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 170 place count 128 transition count 100
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 197 place count 101 transition count 73
Iterating global reduction 2 with 27 rules applied. Total rules applied 224 place count 101 transition count 73
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 304 place count 60 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 306 place count 59 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 307 place count 58 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 308 place count 57 transition count 32
Applied a total of 308 rules in 23 ms. Remains 57 /229 variables (removed 172) and now considering 32/194 (removed 162) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 57/229 places, 32/194 transitions.
[2024-05-21 14:40:42] [INFO ] Flatten gal took : 3 ms
[2024-05-21 14:40:42] [INFO ] Flatten gal took : 3 ms
[2024-05-21 14:40:42] [INFO ] Input system was already deterministic with 32 transitions.
RANDOM walk for 2853 steps (1004 resets) in 35 ms. (79 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-02-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 194/194 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 205 transition count 170
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 205 transition count 170
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 54 place count 199 transition count 164
Iterating global reduction 0 with 6 rules applied. Total rules applied 60 place count 199 transition count 164
Applied a total of 60 rules in 10 ms. Remains 199 /229 variables (removed 30) and now considering 164/194 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 199/229 places, 164/194 transitions.
[2024-05-21 14:40:42] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:40:42] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:40:42] [INFO ] Input system was already deterministic with 164 transitions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 194/194 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 199 transition count 164
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 199 transition count 164
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 69 place count 190 transition count 155
Iterating global reduction 0 with 9 rules applied. Total rules applied 78 place count 190 transition count 155
Applied a total of 78 rules in 11 ms. Remains 190 /229 variables (removed 39) and now considering 155/194 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 190/229 places, 155/194 transitions.
[2024-05-21 14:40:42] [INFO ] Flatten gal took : 6 ms
[2024-05-21 14:40:42] [INFO ] Flatten gal took : 6 ms
[2024-05-21 14:40:42] [INFO ] Input system was already deterministic with 155 transitions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 194/194 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 201 transition count 166
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 201 transition count 166
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 65 place count 192 transition count 157
Iterating global reduction 0 with 9 rules applied. Total rules applied 74 place count 192 transition count 157
Applied a total of 74 rules in 11 ms. Remains 192 /229 variables (removed 37) and now considering 157/194 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 192/229 places, 157/194 transitions.
[2024-05-21 14:40:42] [INFO ] Flatten gal took : 5 ms
[2024-05-21 14:40:42] [INFO ] Flatten gal took : 6 ms
[2024-05-21 14:40:42] [INFO ] Input system was already deterministic with 157 transitions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 194/194 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 202 transition count 167
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 202 transition count 167
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 64 place count 192 transition count 157
Iterating global reduction 0 with 10 rules applied. Total rules applied 74 place count 192 transition count 157
Applied a total of 74 rules in 11 ms. Remains 192 /229 variables (removed 37) and now considering 157/194 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 192/229 places, 157/194 transitions.
[2024-05-21 14:40:42] [INFO ] Flatten gal took : 6 ms
[2024-05-21 14:40:42] [INFO ] Flatten gal took : 6 ms
[2024-05-21 14:40:42] [INFO ] Input system was already deterministic with 157 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 229/229 places, 194/194 transitions.
Graph (trivial) has 124 edges and 229 vertex of which 7 / 229 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 419 edges and 223 vertex of which 217 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 216 transition count 139
Reduce places removed 41 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 42 rules applied. Total rules applied 85 place count 175 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 86 place count 174 transition count 138
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 86 place count 174 transition count 105
Deduced a syphon composed of 33 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 73 rules applied. Total rules applied 159 place count 134 transition count 105
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 185 place count 108 transition count 79
Iterating global reduction 3 with 26 rules applied. Total rules applied 211 place count 108 transition count 79
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 289 place count 68 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 291 place count 67 transition count 40
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 292 place count 66 transition count 39
Applied a total of 292 rules in 25 ms. Remains 66 /229 variables (removed 163) and now considering 39/194 (removed 155) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 66/229 places, 39/194 transitions.
[2024-05-21 14:40:42] [INFO ] Flatten gal took : 2 ms
[2024-05-21 14:40:42] [INFO ] Flatten gal took : 2 ms
[2024-05-21 14:40:42] [INFO ] Input system was already deterministic with 39 transitions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 194/194 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 199 transition count 164
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 199 transition count 164
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 68 place count 191 transition count 156
Iterating global reduction 0 with 8 rules applied. Total rules applied 76 place count 191 transition count 156
Applied a total of 76 rules in 11 ms. Remains 191 /229 variables (removed 38) and now considering 156/194 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 191/229 places, 156/194 transitions.
[2024-05-21 14:40:42] [INFO ] Flatten gal took : 6 ms
[2024-05-21 14:40:42] [INFO ] Flatten gal took : 6 ms
[2024-05-21 14:40:42] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 194/194 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 198 transition count 163
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 198 transition count 163
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 71 place count 189 transition count 154
Iterating global reduction 0 with 9 rules applied. Total rules applied 80 place count 189 transition count 154
Applied a total of 80 rules in 12 ms. Remains 189 /229 variables (removed 40) and now considering 154/194 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 189/229 places, 154/194 transitions.
[2024-05-21 14:40:42] [INFO ] Flatten gal took : 6 ms
[2024-05-21 14:40:42] [INFO ] Flatten gal took : 6 ms
[2024-05-21 14:40:42] [INFO ] Input system was already deterministic with 154 transitions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 194/194 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 199 transition count 164
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 199 transition count 164
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 70 place count 189 transition count 154
Iterating global reduction 0 with 10 rules applied. Total rules applied 80 place count 189 transition count 154
Applied a total of 80 rules in 15 ms. Remains 189 /229 variables (removed 40) and now considering 154/194 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 189/229 places, 154/194 transitions.
[2024-05-21 14:40:42] [INFO ] Flatten gal took : 4 ms
[2024-05-21 14:40:42] [INFO ] Flatten gal took : 6 ms
[2024-05-21 14:40:42] [INFO ] Input system was already deterministic with 154 transitions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 194/194 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 204 transition count 169
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 204 transition count 169
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 60 place count 194 transition count 159
Iterating global reduction 0 with 10 rules applied. Total rules applied 70 place count 194 transition count 159
Applied a total of 70 rules in 10 ms. Remains 194 /229 variables (removed 35) and now considering 159/194 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 194/229 places, 159/194 transitions.
[2024-05-21 14:40:42] [INFO ] Flatten gal took : 5 ms
[2024-05-21 14:40:42] [INFO ] Flatten gal took : 5 ms
[2024-05-21 14:40:42] [INFO ] Input system was already deterministic with 159 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 229/229 places, 194/194 transitions.
Graph (trivial) has 120 edges and 229 vertex of which 4 / 229 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 423 edges and 226 vertex of which 223 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 222 transition count 147
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 82 place count 182 transition count 147
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 82 place count 182 transition count 110
Deduced a syphon composed of 37 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 164 place count 137 transition count 110
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 187 place count 114 transition count 87
Iterating global reduction 2 with 23 rules applied. Total rules applied 210 place count 114 transition count 87
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 284 place count 76 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 286 place count 75 transition count 50
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 287 place count 75 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 288 place count 74 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 289 place count 73 transition count 49
Applied a total of 289 rules in 22 ms. Remains 73 /229 variables (removed 156) and now considering 49/194 (removed 145) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 73/229 places, 49/194 transitions.
[2024-05-21 14:40:42] [INFO ] Flatten gal took : 2 ms
[2024-05-21 14:40:42] [INFO ] Flatten gal took : 2 ms
[2024-05-21 14:40:42] [INFO ] Input system was already deterministic with 49 transitions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 194/194 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 200 transition count 165
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 200 transition count 165
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 66 place count 192 transition count 157
Iterating global reduction 0 with 8 rules applied. Total rules applied 74 place count 192 transition count 157
Applied a total of 74 rules in 6 ms. Remains 192 /229 variables (removed 37) and now considering 157/194 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 192/229 places, 157/194 transitions.
[2024-05-21 14:40:42] [INFO ] Flatten gal took : 4 ms
[2024-05-21 14:40:42] [INFO ] Flatten gal took : 4 ms
[2024-05-21 14:40:43] [INFO ] Input system was already deterministic with 157 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 229/229 places, 194/194 transitions.
Graph (complete) has 426 edges and 229 vertex of which 224 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 223 transition count 155
Reduce places removed 33 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 36 rules applied. Total rules applied 70 place count 190 transition count 152
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 73 place count 187 transition count 152
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 73 place count 187 transition count 107
Deduced a syphon composed of 45 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 171 place count 134 transition count 107
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 198 place count 107 transition count 80
Iterating global reduction 3 with 27 rules applied. Total rules applied 225 place count 107 transition count 80
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 301 place count 69 transition count 42
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 302 place count 68 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 303 place count 67 transition count 41
Applied a total of 303 rules in 18 ms. Remains 67 /229 variables (removed 162) and now considering 41/194 (removed 153) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 67/229 places, 41/194 transitions.
[2024-05-21 14:40:43] [INFO ] Flatten gal took : 2 ms
[2024-05-21 14:40:43] [INFO ] Flatten gal took : 3 ms
[2024-05-21 14:40:43] [INFO ] Input system was already deterministic with 41 transitions.
[2024-05-21 14:40:43] [INFO ] Flatten gal took : 6 ms
[2024-05-21 14:40:43] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:40:43] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-05-21 14:40:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 229 places, 194 transitions and 520 arcs took 2 ms.
Total runtime 61264 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BusinessProcesses-PT-02

IS_COLORED=
IS_NUPN=

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


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


----------------------------------------------------------------------
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: 982
MODEL NAME: /home/mcc/execution/420/model
229 places, 194 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-02-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BusinessProcesses-PT-02-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BusinessProcesses-PT-02-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BusinessProcesses-PT-02-CTLFireability-2024-01 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-02-CTLFireability-2024-03 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-02-CTLFireability-2024-04 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-02-CTLFireability-2024-05 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-02-CTLFireability-2024-08 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-02-CTLFireability-2024-09 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-02-CTLFireability-2024-10 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-02-CTLFireability-2024-11 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-02-CTLFireability-2023-12 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-02-CTLFireability-2023-14 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-02-CTLFireability-2023-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716304737431

--------------------
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 1048576 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 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

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

Error in allocating array of size 4194304 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

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

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