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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 11 16:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 11 16:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 11 16:34 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 161K 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-17-CTLCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-2023-12
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-2023-13
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-2023-14
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716307642476

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-17
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 16:07:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 16:07:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 16:07:24] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2024-05-21 16:07:24] [INFO ] Transformed 650 places.
[2024-05-21 16:07:24] [INFO ] Transformed 580 transitions.
[2024-05-21 16:07:24] [INFO ] Found NUPN structural information;
[2024-05-21 16:07:24] [INFO ] Parsed PT model containing 650 places and 580 transitions and 1709 arcs in 231 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Deduced a syphon composed of 4 places in 13 ms
Reduce places removed 4 places and 4 transitions.
Support contains 131 out of 646 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 646/646 places, 576/576 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 644 transition count 576
Discarding 70 places :
Symmetric choice reduction at 1 with 70 rule applications. Total rules 72 place count 574 transition count 506
Iterating global reduction 1 with 70 rules applied. Total rules applied 142 place count 574 transition count 506
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 168 place count 548 transition count 480
Iterating global reduction 1 with 26 rules applied. Total rules applied 194 place count 548 transition count 480
Applied a total of 194 rules in 122 ms. Remains 548 /646 variables (removed 98) and now considering 480/576 (removed 96) transitions.
// Phase 1: matrix 480 rows 548 cols
[2024-05-21 16:07:24] [INFO ] Computed 106 invariants in 33 ms
[2024-05-21 16:07:24] [INFO ] Implicit Places using invariants in 380 ms returned []
[2024-05-21 16:07:24] [INFO ] Invariant cache hit.
[2024-05-21 16:07:25] [INFO ] Implicit Places using invariants and state equation in 617 ms returned []
Implicit Place search using SMT with State Equation took 1028 ms to find 0 implicit places.
Running 479 sub problems to find dead transitions.
[2024-05-21 16:07:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 2 (OVERLAPS) 2/548 variables, 60/102 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/548 variables, 4/106 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-21 16:07:37] [INFO ] Deduced a trap composed of 114 places in 153 ms of which 26 ms to minimize.
[2024-05-21 16:07:37] [INFO ] Deduced a trap composed of 91 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:07:37] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:07:38] [INFO ] Deduced a trap composed of 87 places in 213 ms of which 6 ms to minimize.
[2024-05-21 16:07:38] [INFO ] Deduced a trap composed of 88 places in 156 ms of which 3 ms to minimize.
[2024-05-21 16:07:38] [INFO ] Deduced a trap composed of 93 places in 155 ms of which 3 ms to minimize.
[2024-05-21 16:07:38] [INFO ] Deduced a trap composed of 86 places in 157 ms of which 6 ms to minimize.
[2024-05-21 16:07:38] [INFO ] Deduced a trap composed of 95 places in 138 ms of which 2 ms to minimize.
[2024-05-21 16:07:38] [INFO ] Deduced a trap composed of 88 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:07:39] [INFO ] Deduced a trap composed of 120 places in 155 ms of which 3 ms to minimize.
[2024-05-21 16:07:39] [INFO ] Deduced a trap composed of 106 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:07:39] [INFO ] Deduced a trap composed of 133 places in 136 ms of which 2 ms to minimize.
[2024-05-21 16:07:39] [INFO ] Deduced a trap composed of 118 places in 95 ms of which 3 ms to minimize.
[2024-05-21 16:07:39] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:07:39] [INFO ] Deduced a trap composed of 133 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:07:39] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:07:39] [INFO ] Deduced a trap composed of 135 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:07:40] [INFO ] Deduced a trap composed of 135 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:07:40] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:07:40] [INFO ] Deduced a trap composed of 139 places in 118 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/548 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-21 16:07:40] [INFO ] Deduced a trap composed of 102 places in 110 ms of which 3 ms to minimize.
[2024-05-21 16:07:40] [INFO ] Deduced a trap composed of 107 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:07:40] [INFO ] Deduced a trap composed of 112 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:07:40] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:07:41] [INFO ] Deduced a trap composed of 112 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:07:41] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:07:41] [INFO ] Deduced a trap composed of 101 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:07:41] [INFO ] Deduced a trap composed of 119 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:07:41] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:07:41] [INFO ] Deduced a trap composed of 90 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:07:41] [INFO ] Deduced a trap composed of 89 places in 87 ms of which 2 ms to minimize.
[2024-05-21 16:07:41] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:07:42] [INFO ] Deduced a trap composed of 91 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:07:42] [INFO ] Deduced a trap composed of 94 places in 124 ms of which 5 ms to minimize.
[2024-05-21 16:07:42] [INFO ] Deduced a trap composed of 91 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:07:42] [INFO ] Deduced a trap composed of 91 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:07:42] [INFO ] Deduced a trap composed of 95 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:07:42] [INFO ] Deduced a trap composed of 117 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:07:42] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:07:43] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-21 16:07:43] [INFO ] Deduced a trap composed of 120 places in 144 ms of which 2 ms to minimize.
[2024-05-21 16:07:43] [INFO ] Deduced a trap composed of 90 places in 136 ms of which 2 ms to minimize.
[2024-05-21 16:07:43] [INFO ] Deduced a trap composed of 94 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:07:43] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:07:43] [INFO ] Deduced a trap composed of 104 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:07:44] [INFO ] Deduced a trap composed of 120 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:07:44] [INFO ] Deduced a trap composed of 94 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:07:44] [INFO ] Deduced a trap composed of 94 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:07:44] [INFO ] Deduced a trap composed of 116 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:07:44] [INFO ] Deduced a trap composed of 115 places in 135 ms of which 2 ms to minimize.
[2024-05-21 16:07:44] [INFO ] Deduced a trap composed of 127 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:07:44] [INFO ] Deduced a trap composed of 117 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:07:45] [INFO ] Deduced a trap composed of 120 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:07:45] [INFO ] Deduced a trap composed of 119 places in 157 ms of which 4 ms to minimize.
[2024-05-21 16:07:45] [INFO ] Deduced a trap composed of 121 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:07:45] [INFO ] Deduced a trap composed of 117 places in 124 ms of which 5 ms to minimize.
[2024-05-21 16:07:45] [INFO ] Deduced a trap composed of 116 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:07:45] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:07:45] [INFO ] Deduced a trap composed of 111 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:07:46] [INFO ] Deduced a trap composed of 117 places in 119 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 20/166 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-21 16:07:50] [INFO ] Deduced a trap composed of 126 places in 176 ms of which 5 ms to minimize.
[2024-05-21 16:07:50] [INFO ] Deduced a trap composed of 115 places in 157 ms of which 3 ms to minimize.
[2024-05-21 16:07:50] [INFO ] Deduced a trap composed of 115 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:07:50] [INFO ] Deduced a trap composed of 122 places in 125 ms of which 4 ms to minimize.
[2024-05-21 16:07:51] [INFO ] Deduced a trap composed of 117 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:07:51] [INFO ] Deduced a trap composed of 120 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:07:51] [INFO ] Deduced a trap composed of 122 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:07:51] [INFO ] Deduced a trap composed of 132 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:07:51] [INFO ] Deduced a trap composed of 110 places in 169 ms of which 3 ms to minimize.
[2024-05-21 16:07:51] [INFO ] Deduced a trap composed of 116 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:07:51] [INFO ] Deduced a trap composed of 120 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:07:52] [INFO ] Deduced a trap composed of 116 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:07:52] [INFO ] Deduced a trap composed of 104 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:07:52] [INFO ] Deduced a trap composed of 114 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:07:52] [INFO ] Deduced a trap composed of 102 places in 160 ms of which 3 ms to minimize.
[2024-05-21 16:07:52] [INFO ] Deduced a trap composed of 118 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:07:53] [INFO ] Deduced a trap composed of 109 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:07:53] [INFO ] Deduced a trap composed of 85 places in 143 ms of which 2 ms to minimize.
[2024-05-21 16:07:53] [INFO ] Deduced a trap composed of 89 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:07:53] [INFO ] Deduced a trap composed of 115 places in 144 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 20/186 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-21 16:07:53] [INFO ] Deduced a trap composed of 111 places in 167 ms of which 2 ms to minimize.
[2024-05-21 16:07:54] [INFO ] Deduced a trap composed of 125 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:07:54] [INFO ] Deduced a trap composed of 116 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:07:54] [INFO ] Deduced a trap composed of 112 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:07:54] [INFO ] Deduced a trap composed of 118 places in 110 ms of which 3 ms to minimize.
[2024-05-21 16:07:54] [INFO ] Deduced a trap composed of 118 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:07:54] [INFO ] Deduced a trap composed of 111 places in 176 ms of which 3 ms to minimize.
[2024-05-21 16:07:55] [INFO ] Deduced a trap composed of 90 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:07:55] [INFO ] Deduced a trap composed of 82 places in 146 ms of which 4 ms to minimize.
[2024-05-21 16:07:55] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:07:55] [INFO ] Deduced a trap composed of 88 places in 156 ms of which 2 ms to minimize.
[2024-05-21 16:07:55] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 3 ms to minimize.
SMT process timed out in 30264ms, After SMT, problems are : Problem set: 0 solved, 479 unsolved
Search for dead transitions found 0 dead transitions in 30284ms
Starting structural reductions in LTL mode, iteration 1 : 548/646 places, 480/576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31458 ms. Remains : 548/646 places, 480/576 transitions.
Support contains 131 out of 548 places after structural reductions.
[2024-05-21 16:07:56] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-21 16:07:56] [INFO ] Flatten gal took : 115 ms
[2024-05-21 16:07:56] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA BusinessProcesses-PT-17-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 16:07:56] [INFO ] Flatten gal took : 44 ms
[2024-05-21 16:07:56] [INFO ] Input system was already deterministic with 480 transitions.
Support contains 108 out of 548 places (down from 131) after GAL structural reductions.
RANDOM walk for 40000 steps (261 resets) in 1803 ms. (22 steps per ms) remains 31/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 63 ms. (62 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (8 resets) in 13 ms. (285 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (8 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
[2024-05-21 16:07:57] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 295/354 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 66/420 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 122/542 variables, 45/105 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 1/543 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (OVERLAPS) 477/1020 variables, 543/649 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1020 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 11 (OVERLAPS) 8/1028 variables, 5/654 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1028 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 13 (OVERLAPS) 0/1028 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1028/1028 variables, and 654 constraints, problems are : Problem set: 0 solved, 31 unsolved in 2970 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 548/548 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 295/354 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-05-21 16:08:00] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 2 ms to minimize.
[2024-05-21 16:08:00] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-21 16:08:00] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-21 16:08:00] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-21 16:08:00] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
[2024-05-21 16:08:00] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
[2024-05-21 16:08:00] [INFO ] Deduced a trap composed of 96 places in 85 ms of which 1 ms to minimize.
[2024-05-21 16:08:00] [INFO ] Deduced a trap composed of 96 places in 81 ms of which 2 ms to minimize.
[2024-05-21 16:08:01] [INFO ] Deduced a trap composed of 103 places in 82 ms of which 2 ms to minimize.
[2024-05-21 16:08:01] [INFO ] Deduced a trap composed of 100 places in 81 ms of which 2 ms to minimize.
[2024-05-21 16:08:01] [INFO ] Deduced a trap composed of 95 places in 82 ms of which 2 ms to minimize.
[2024-05-21 16:08:01] [INFO ] Deduced a trap composed of 99 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:08:01] [INFO ] Deduced a trap composed of 102 places in 112 ms of which 4 ms to minimize.
[2024-05-21 16:08:01] [INFO ] Deduced a trap composed of 102 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:08:01] [INFO ] Deduced a trap composed of 101 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:08:01] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 3 ms to minimize.
[2024-05-21 16:08:01] [INFO ] Deduced a trap composed of 100 places in 84 ms of which 2 ms to minimize.
[2024-05-21 16:08:02] [INFO ] Deduced a trap composed of 101 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:08:02] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-05-21 16:08:02] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-05-21 16:08:02] [INFO ] Deduced a trap composed of 103 places in 84 ms of which 2 ms to minimize.
[2024-05-21 16:08:02] [INFO ] Deduced a trap composed of 101 places in 82 ms of which 2 ms to minimize.
[2024-05-21 16:08:02] [INFO ] Deduced a trap composed of 103 places in 101 ms of which 3 ms to minimize.
[2024-05-21 16:08:02] [INFO ] Deduced a trap composed of 95 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:08:02] [INFO ] Deduced a trap composed of 96 places in 81 ms of which 2 ms to minimize.
[2024-05-21 16:08:02] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 3 ms to minimize.
[2024-05-21 16:08:02] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 2 ms to minimize.
[2024-05-21 16:08:03] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-05-21 16:08:03] [INFO ] Deduced a trap composed of 106 places in 98 ms of which 3 ms to minimize.
[2024-05-21 16:08:03] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 2 ms to minimize.
[2024-05-21 16:08:03] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 2 ms to minimize.
[2024-05-21 16:08:03] [INFO ] Deduced a trap composed of 103 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:08:03] [INFO ] Deduced a trap composed of 110 places in 104 ms of which 3 ms to minimize.
[2024-05-21 16:08:03] [INFO ] Deduced a trap composed of 103 places in 102 ms of which 3 ms to minimize.
[2024-05-21 16:08:03] [INFO ] Deduced a trap composed of 115 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:08:03] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:08:03] [INFO ] Deduced a trap composed of 101 places in 96 ms of which 3 ms to minimize.
[2024-05-21 16:08:04] [INFO ] Deduced a trap composed of 102 places in 95 ms of which 3 ms to minimize.
[2024-05-21 16:08:04] [INFO ] Deduced a trap composed of 107 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:08:04] [INFO ] Deduced a trap composed of 105 places in 93 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-05-21 16:08:04] [INFO ] Deduced a trap composed of 99 places in 88 ms of which 2 ms to minimize.
[2024-05-21 16:08:04] [INFO ] Deduced a trap composed of 99 places in 85 ms of which 1 ms to minimize.
[2024-05-21 16:08:04] [INFO ] Deduced a trap composed of 107 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:08:04] [INFO ] Deduced a trap composed of 106 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:08:04] [INFO ] Deduced a trap composed of 103 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:08:05] [INFO ] Deduced a trap composed of 101 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:08:05] [INFO ] Deduced a trap composed of 100 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:08:05] [INFO ] Deduced a trap composed of 108 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:08:05] [INFO ] Deduced a trap composed of 111 places in 105 ms of which 2 ms to minimize.
SMT process timed out in 8103ms, After SMT, problems are : Problem set: 0 solved, 31 unsolved
Fused 31 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 59 out of 548 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 548/548 places, 480/480 transitions.
Graph (trivial) has 212 edges and 548 vertex of which 4 / 548 are part of one of the 1 SCC in 4 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1194 edges and 545 vertex of which 544 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 49 place count 544 transition count 428
Reduce places removed 47 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 53 rules applied. Total rules applied 102 place count 497 transition count 422
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 108 place count 491 transition count 422
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 108 place count 491 transition count 337
Deduced a syphon composed of 85 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 181 rules applied. Total rules applied 289 place count 395 transition count 337
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 306 place count 378 transition count 320
Iterating global reduction 3 with 17 rules applied. Total rules applied 323 place count 378 transition count 320
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 119
Deduced a syphon composed of 119 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 563 place count 257 transition count 201
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 565 place count 256 transition count 205
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 567 place count 256 transition count 203
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 569 place count 254 transition count 203
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 574 place count 254 transition count 203
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 575 place count 253 transition count 202
Applied a total of 575 rules in 153 ms. Remains 253 /548 variables (removed 295) and now considering 202/480 (removed 278) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 253/548 places, 202/480 transitions.
RANDOM walk for 40000 steps (11 resets) in 878 ms. (45 steps per ms) remains 8/31 properties
BEST_FIRST walk for 40001 steps (8 resets) in 281 ms. (141 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (11 resets) in 151 ms. (263 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 146 ms. (272 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (12 resets) in 186 ms. (213 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (8 resets) in 162 ms. (245 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40000 steps (11 resets) in 121 ms. (327 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40002 steps (11 resets) in 97 ms. (408 steps per ms) remains 5/6 properties
// Phase 1: matrix 202 rows 253 cols
[2024-05-21 16:08:06] [INFO ] Computed 93 invariants in 5 ms
[2024-05-21 16:08:06] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 78/90 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 81/171 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 64/235 variables, 32/86 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/236 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 197/433 variables, 236/323 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/433 variables, 3/326 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/433 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 18/451 variables, 14/340 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/451 variables, 5/345 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/451 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 2/453 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/453 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 2/455 variables, 3/349 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/455 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/455 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 455/455 variables, and 349 constraints, problems are : Problem set: 0 solved, 5 unsolved in 307 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 253/253 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 78/90 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 16:08:06] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-05-21 16:08:06] [INFO ] Deduced a trap composed of 61 places in 51 ms of which 1 ms to minimize.
[2024-05-21 16:08:06] [INFO ] Deduced a trap composed of 62 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 81/171 variables, 45/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 16:08:06] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 2 ms to minimize.
[2024-05-21 16:08:06] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2024-05-21 16:08:06] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:08:07] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:08:07] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 2 ms to minimize.
[2024-05-21 16:08:07] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:08:07] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:08:07] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2024-05-21 16:08:07] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 2 ms to minimize.
[2024-05-21 16:08:07] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2024-05-21 16:08:07] [INFO ] Deduced a trap composed of 52 places in 59 ms of which 1 ms to minimize.
[2024-05-21 16:08:07] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 16:08:07] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp20 is UNSAT
At refinement iteration 8 (OVERLAPS) 64/235 variables, 32/102 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-21 16:08:07] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 2 ms to minimize.
[2024-05-21 16:08:07] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 1 ms to minimize.
[2024-05-21 16:08:07] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 2 ms to minimize.
[2024-05-21 16:08:07] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 2 ms to minimize.
[2024-05-21 16:08:08] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
[2024-05-21 16:08:08] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 2 ms to minimize.
[2024-05-21 16:08:08] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
[2024-05-21 16:08:08] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 2 ms to minimize.
[2024-05-21 16:08:08] [INFO ] Deduced a trap composed of 60 places in 63 ms of which 1 ms to minimize.
[2024-05-21 16:08:08] [INFO ] Deduced a trap composed of 55 places in 61 ms of which 2 ms to minimize.
[2024-05-21 16:08:08] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 2 ms to minimize.
[2024-05-21 16:08:08] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 2 ms to minimize.
[2024-05-21 16:08:08] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:08:08] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 1 ms to minimize.
[2024-05-21 16:08:08] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2024-05-21 16:08:08] [INFO ] Deduced a trap composed of 55 places in 52 ms of which 1 ms to minimize.
[2024-05-21 16:08:08] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-05-21 16:08:08] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 1 ms to minimize.
[2024-05-21 16:08:09] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 1 ms to minimize.
[2024-05-21 16:08:09] [INFO ] Deduced a trap composed of 63 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 20/122 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-21 16:08:09] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:08:09] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
[2024-05-21 16:08:09] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 2 ms to minimize.
[2024-05-21 16:08:09] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 2 ms to minimize.
[2024-05-21 16:08:09] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 2 ms to minimize.
[2024-05-21 16:08:09] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 1 ms to minimize.
[2024-05-21 16:08:09] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
[2024-05-21 16:08:09] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 2 ms to minimize.
[2024-05-21 16:08:09] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 2 ms to minimize.
[2024-05-21 16:08:09] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:08:09] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 1 ms to minimize.
[2024-05-21 16:08:09] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 2 ms to minimize.
[2024-05-21 16:08:10] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 1 ms to minimize.
[2024-05-21 16:08:10] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 1 ms to minimize.
[2024-05-21 16:08:10] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 2 ms to minimize.
[2024-05-21 16:08:10] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 2 ms to minimize.
[2024-05-21 16:08:10] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 2 ms to minimize.
[2024-05-21 16:08:10] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 18/140 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-21 16:08:10] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:08:10] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 2 ms to minimize.
[2024-05-21 16:08:10] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 1 ms to minimize.
[2024-05-21 16:08:10] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 2 ms to minimize.
[2024-05-21 16:08:10] [INFO ] Deduced a trap composed of 58 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:08:11] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:08:11] [INFO ] Deduced a trap composed of 63 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:08:11] [INFO ] Deduced a trap composed of 57 places in 85 ms of which 2 ms to minimize.
[2024-05-21 16:08:11] [INFO ] Deduced a trap composed of 61 places in 75 ms of which 2 ms to minimize.
[2024-05-21 16:08:11] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:08:11] [INFO ] Deduced a trap composed of 62 places in 79 ms of which 2 ms to minimize.
[2024-05-21 16:08:11] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 2 ms to minimize.
[2024-05-21 16:08:11] [INFO ] Deduced a trap composed of 60 places in 75 ms of which 1 ms to minimize.
[2024-05-21 16:08:11] [INFO ] Deduced a trap composed of 67 places in 75 ms of which 2 ms to minimize.
[2024-05-21 16:08:11] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 2 ms to minimize.
[2024-05-21 16:08:11] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 1 ms to minimize.
[2024-05-21 16:08:12] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 2 ms to minimize.
[2024-05-21 16:08:12] [INFO ] Deduced a trap composed of 55 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:08:12] [INFO ] Deduced a trap composed of 58 places in 73 ms of which 2 ms to minimize.
[2024-05-21 16:08:12] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 20/160 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-21 16:08:12] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 1 ms to minimize.
[2024-05-21 16:08:12] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 1 ms to minimize.
[2024-05-21 16:08:12] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 2 ms to minimize.
[2024-05-21 16:08:12] [INFO ] Deduced a trap composed of 52 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:08:12] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 2 ms to minimize.
[2024-05-21 16:08:12] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:08:12] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 2 ms to minimize.
[2024-05-21 16:08:13] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 1 ms to minimize.
[2024-05-21 16:08:13] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 1 ms to minimize.
[2024-05-21 16:08:13] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 2 ms to minimize.
[2024-05-21 16:08:13] [INFO ] Deduced a trap composed of 63 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:08:13] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 1 ms to minimize.
[2024-05-21 16:08:13] [INFO ] Deduced a trap composed of 48 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:08:13] [INFO ] Deduced a trap composed of 59 places in 85 ms of which 2 ms to minimize.
[2024-05-21 16:08:13] [INFO ] Deduced a trap composed of 55 places in 68 ms of which 1 ms to minimize.
[2024-05-21 16:08:13] [INFO ] Deduced a trap composed of 57 places in 61 ms of which 2 ms to minimize.
[2024-05-21 16:08:13] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 3 ms to minimize.
[2024-05-21 16:08:13] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 1 ms to minimize.
[2024-05-21 16:08:13] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 3 ms to minimize.
[2024-05-21 16:08:13] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 20/180 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-21 16:08:14] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:08:14] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 2 ms to minimize.
[2024-05-21 16:08:14] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 2 ms to minimize.
[2024-05-21 16:08:14] [INFO ] Deduced a trap composed of 62 places in 62 ms of which 2 ms to minimize.
[2024-05-21 16:08:14] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 2 ms to minimize.
[2024-05-21 16:08:14] [INFO ] Deduced a trap composed of 58 places in 60 ms of which 2 ms to minimize.
[2024-05-21 16:08:14] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 1 ms to minimize.
[2024-05-21 16:08:14] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 2 ms to minimize.
[2024-05-21 16:08:14] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 2 ms to minimize.
[2024-05-21 16:08:14] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 2 ms to minimize.
[2024-05-21 16:08:14] [INFO ] Deduced a trap composed of 48 places in 79 ms of which 2 ms to minimize.
[2024-05-21 16:08:14] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:08:14] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-21 16:08:15] [INFO ] Deduced a trap composed of 61 places in 75 ms of which 2 ms to minimize.
[2024-05-21 16:08:15] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 2 ms to minimize.
[2024-05-21 16:08:15] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 16/196 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/235 variables, 0/196 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1/236 variables, 1/197 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/236 variables, 0/197 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 197/433 variables, 236/433 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/433 variables, 3/436 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/433 variables, 4/440 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-21 16:08:15] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/433 variables, 1/441 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/433 variables, 0/441 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 18/451 variables, 14/455 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/451 variables, 5/460 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/451 variables, 0/460 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 2/453 variables, 1/461 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/453 variables, 0/461 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp19 is UNSAT
At refinement iteration 27 (OVERLAPS) 2/455 variables, 3/464 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/455 variables, 0/464 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/455 variables, 0/464 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 455/455 variables, and 464 constraints, problems are : Problem set: 3 solved, 2 unsolved in 9347 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 253/253 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 111/111 constraints]
After SMT, in 9665ms problems are : Problem set: 3 solved, 2 unsolved
Parikh walk visited 0 properties in 165 ms.
Support contains 3 out of 253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 253/253 places, 202/202 transitions.
Graph (trivial) has 58 edges and 253 vertex of which 4 / 253 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 812 edges and 250 vertex of which 249 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 14 place count 249 transition count 186
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 26 place count 237 transition count 186
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 26 place count 237 transition count 162
Deduced a syphon composed of 24 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 57 rules applied. Total rules applied 83 place count 204 transition count 162
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 89 place count 198 transition count 155
Iterating global reduction 2 with 6 rules applied. Total rules applied 95 place count 198 transition count 155
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 129 place count 179 transition count 140
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 131 place count 178 transition count 140
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 132 place count 177 transition count 139
Applied a total of 132 rules in 32 ms. Remains 177 /253 variables (removed 76) and now considering 139/202 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 177/253 places, 139/202 transitions.
RANDOM walk for 40000 steps (1104 resets) in 248 ms. (160 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (311 resets) in 120 ms. (330 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (508 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
// Phase 1: matrix 139 rows 177 cols
[2024-05-21 16:08:16] [INFO ] Computed 79 invariants in 2 ms
[2024-05-21 16:08:16] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/66 variables, 22/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/70 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 41/111 variables, 16/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/117 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/117 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/122 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/122 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 134/256 variables, 122/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/256 variables, 3/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/256 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 59/315 variables, 54/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/315 variables, 26/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/315 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/315 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/316 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/316 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/316 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 261 constraints, problems are : Problem set: 0 solved, 1 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 177/177 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/66 variables, 22/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/70 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 41/111 variables, 16/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/117 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/117 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/122 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/122 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 134/256 variables, 122/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/256 variables, 3/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/256 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 59/315 variables, 54/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/315 variables, 26/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/315 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/315 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/315 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/316 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/316 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/316 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 262 constraints, problems are : Problem set: 0 solved, 1 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 177/177 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 227ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 139/139 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 177 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 176 transition count 138
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 176 transition count 137
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 175 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 174 transition count 136
Applied a total of 6 rules in 13 ms. Remains 174 /177 variables (removed 3) and now considering 136/139 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 174/177 places, 136/139 transitions.
RANDOM walk for 40000 steps (1155 resets) in 212 ms. (187 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (609 resets) in 155 ms. (256 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2005 steps, run visited all 1 properties in 19 ms. (steps per millisecond=105 )
Probabilistic random walk after 2005 steps, saw 900 distinct states, run finished after 22 ms. (steps per millisecond=91 ) properties seen :1
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
[2024-05-21 16:08:16] [INFO ] Flatten gal took : 23 ms
[2024-05-21 16:08:16] [INFO ] Flatten gal took : 23 ms
[2024-05-21 16:08:16] [INFO ] Input system was already deterministic with 480 transitions.
Support contains 100 out of 548 places (down from 103) after GAL structural reductions.
Computed a total of 233 stabilizing places and 204 stable transitions
Graph (complete) has 1198 edges and 548 vertex of which 546 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.14 ms
Starting structural reductions in LTL mode, iteration 0 : 548/548 places, 480/480 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 547 transition count 480
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 34 place count 514 transition count 447
Iterating global reduction 1 with 33 rules applied. Total rules applied 67 place count 514 transition count 447
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 78 place count 503 transition count 436
Iterating global reduction 1 with 11 rules applied. Total rules applied 89 place count 503 transition count 436
Applied a total of 89 rules in 57 ms. Remains 503 /548 variables (removed 45) and now considering 436/480 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57 ms. Remains : 503/548 places, 436/480 transitions.
[2024-05-21 16:08:16] [INFO ] Flatten gal took : 23 ms
[2024-05-21 16:08:16] [INFO ] Flatten gal took : 19 ms
[2024-05-21 16:08:16] [INFO ] Input system was already deterministic with 436 transitions.
Starting structural reductions in LTL mode, iteration 0 : 548/548 places, 480/480 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 547 transition count 480
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 35 place count 513 transition count 446
Iterating global reduction 1 with 34 rules applied. Total rules applied 69 place count 513 transition count 446
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 81 place count 501 transition count 434
Iterating global reduction 1 with 12 rules applied. Total rules applied 93 place count 501 transition count 434
Applied a total of 93 rules in 54 ms. Remains 501 /548 variables (removed 47) and now considering 434/480 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54 ms. Remains : 501/548 places, 434/480 transitions.
[2024-05-21 16:08:17] [INFO ] Flatten gal took : 18 ms
[2024-05-21 16:08:17] [INFO ] Flatten gal took : 17 ms
[2024-05-21 16:08:17] [INFO ] Input system was already deterministic with 434 transitions.
Starting structural reductions in LTL mode, iteration 0 : 548/548 places, 480/480 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 547 transition count 480
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 35 place count 513 transition count 446
Iterating global reduction 1 with 34 rules applied. Total rules applied 69 place count 513 transition count 446
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 81 place count 501 transition count 434
Iterating global reduction 1 with 12 rules applied. Total rules applied 93 place count 501 transition count 434
Applied a total of 93 rules in 57 ms. Remains 501 /548 variables (removed 47) and now considering 434/480 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57 ms. Remains : 501/548 places, 434/480 transitions.
[2024-05-21 16:08:17] [INFO ] Flatten gal took : 17 ms
[2024-05-21 16:08:17] [INFO ] Flatten gal took : 17 ms
[2024-05-21 16:08:17] [INFO ] Input system was already deterministic with 434 transitions.
Starting structural reductions in LTL mode, iteration 0 : 548/548 places, 480/480 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 547 transition count 480
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 29 place count 519 transition count 452
Iterating global reduction 1 with 28 rules applied. Total rules applied 57 place count 519 transition count 452
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 66 place count 510 transition count 443
Iterating global reduction 1 with 9 rules applied. Total rules applied 75 place count 510 transition count 443
Applied a total of 75 rules in 51 ms. Remains 510 /548 variables (removed 38) and now considering 443/480 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52 ms. Remains : 510/548 places, 443/480 transitions.
[2024-05-21 16:08:17] [INFO ] Flatten gal took : 16 ms
[2024-05-21 16:08:17] [INFO ] Flatten gal took : 17 ms
[2024-05-21 16:08:17] [INFO ] Input system was already deterministic with 443 transitions.
Starting structural reductions in LTL mode, iteration 0 : 548/548 places, 480/480 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 547 transition count 480
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 34 place count 514 transition count 447
Iterating global reduction 1 with 33 rules applied. Total rules applied 67 place count 514 transition count 447
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 78 place count 503 transition count 436
Iterating global reduction 1 with 11 rules applied. Total rules applied 89 place count 503 transition count 436
Applied a total of 89 rules in 24 ms. Remains 503 /548 variables (removed 45) and now considering 436/480 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 503/548 places, 436/480 transitions.
[2024-05-21 16:08:17] [INFO ] Flatten gal took : 14 ms
[2024-05-21 16:08:17] [INFO ] Flatten gal took : 14 ms
[2024-05-21 16:08:17] [INFO ] Input system was already deterministic with 436 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 548/548 places, 480/480 transitions.
Graph (trivial) has 271 edges and 548 vertex of which 7 / 548 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 1191 edges and 542 vertex of which 540 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 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 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 71 place count 539 transition count 402
Reduce places removed 69 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 70 rules applied. Total rules applied 141 place count 470 transition count 401
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 142 place count 469 transition count 401
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 108 Pre rules applied. Total rules applied 142 place count 469 transition count 293
Deduced a syphon composed of 108 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 234 rules applied. Total rules applied 376 place count 343 transition count 293
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 407 place count 312 transition count 262
Iterating global reduction 3 with 31 rules applied. Total rules applied 438 place count 312 transition count 262
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 438 place count 312 transition count 261
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 440 place count 311 transition count 261
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 255 rules applied. Total rules applied 695 place count 181 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 696 place count 180 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 697 place count 179 transition count 135
Applied a total of 697 rules in 59 ms. Remains 179 /548 variables (removed 369) and now considering 135/480 (removed 345) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 59 ms. Remains : 179/548 places, 135/480 transitions.
[2024-05-21 16:08:17] [INFO ] Flatten gal took : 7 ms
[2024-05-21 16:08:17] [INFO ] Flatten gal took : 7 ms
[2024-05-21 16:08:17] [INFO ] Input system was already deterministic with 135 transitions.
Starting structural reductions in LTL mode, iteration 0 : 548/548 places, 480/480 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 547 transition count 480
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 32 place count 516 transition count 449
Iterating global reduction 1 with 31 rules applied. Total rules applied 63 place count 516 transition count 449
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 74 place count 505 transition count 438
Iterating global reduction 1 with 11 rules applied. Total rules applied 85 place count 505 transition count 438
Applied a total of 85 rules in 26 ms. Remains 505 /548 variables (removed 43) and now considering 438/480 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 505/548 places, 438/480 transitions.
[2024-05-21 16:08:17] [INFO ] Flatten gal took : 18 ms
[2024-05-21 16:08:17] [INFO ] Flatten gal took : 14 ms
[2024-05-21 16:08:17] [INFO ] Input system was already deterministic with 438 transitions.
Starting structural reductions in LTL mode, iteration 0 : 548/548 places, 480/480 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 547 transition count 480
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 34 place count 514 transition count 447
Iterating global reduction 1 with 33 rules applied. Total rules applied 67 place count 514 transition count 447
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 79 place count 502 transition count 435
Iterating global reduction 1 with 12 rules applied. Total rules applied 91 place count 502 transition count 435
Applied a total of 91 rules in 24 ms. Remains 502 /548 variables (removed 46) and now considering 435/480 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 502/548 places, 435/480 transitions.
[2024-05-21 16:08:17] [INFO ] Flatten gal took : 15 ms
[2024-05-21 16:08:17] [INFO ] Flatten gal took : 15 ms
[2024-05-21 16:08:17] [INFO ] Input system was already deterministic with 435 transitions.
Starting structural reductions in LTL mode, iteration 0 : 548/548 places, 480/480 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 547 transition count 480
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 32 place count 516 transition count 449
Iterating global reduction 1 with 31 rules applied. Total rules applied 63 place count 516 transition count 449
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 74 place count 505 transition count 438
Iterating global reduction 1 with 11 rules applied. Total rules applied 85 place count 505 transition count 438
Applied a total of 85 rules in 30 ms. Remains 505 /548 variables (removed 43) and now considering 438/480 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 505/548 places, 438/480 transitions.
[2024-05-21 16:08:17] [INFO ] Flatten gal took : 15 ms
[2024-05-21 16:08:17] [INFO ] Flatten gal took : 14 ms
[2024-05-21 16:08:17] [INFO ] Input system was already deterministic with 438 transitions.
Starting structural reductions in LTL mode, iteration 0 : 548/548 places, 480/480 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 547 transition count 480
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 28 place count 520 transition count 453
Iterating global reduction 1 with 27 rules applied. Total rules applied 55 place count 520 transition count 453
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 63 place count 512 transition count 445
Iterating global reduction 1 with 8 rules applied. Total rules applied 71 place count 512 transition count 445
Applied a total of 71 rules in 24 ms. Remains 512 /548 variables (removed 36) and now considering 445/480 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 512/548 places, 445/480 transitions.
[2024-05-21 16:08:17] [INFO ] Flatten gal took : 13 ms
[2024-05-21 16:08:17] [INFO ] Flatten gal took : 14 ms
[2024-05-21 16:08:17] [INFO ] Input system was already deterministic with 445 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 548/548 places, 480/480 transitions.
Graph (trivial) has 266 edges and 548 vertex of which 7 / 548 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 1191 edges and 542 vertex of which 540 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 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 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 539 transition count 403
Reduce places removed 68 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 69 rules applied. Total rules applied 139 place count 471 transition count 402
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 140 place count 470 transition count 402
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 106 Pre rules applied. Total rules applied 140 place count 470 transition count 296
Deduced a syphon composed of 106 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 3 with 231 rules applied. Total rules applied 371 place count 345 transition count 296
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 400 place count 316 transition count 267
Iterating global reduction 3 with 29 rules applied. Total rules applied 429 place count 316 transition count 267
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 429 place count 316 transition count 266
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 431 place count 315 transition count 266
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Deduced a syphon composed of 124 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 253 rules applied. Total rules applied 684 place count 186 transition count 142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 685 place count 185 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 686 place count 184 transition count 141
Applied a total of 686 rules in 54 ms. Remains 184 /548 variables (removed 364) and now considering 141/480 (removed 339) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54 ms. Remains : 184/548 places, 141/480 transitions.
[2024-05-21 16:08:17] [INFO ] Flatten gal took : 5 ms
[2024-05-21 16:08:17] [INFO ] Flatten gal took : 6 ms
[2024-05-21 16:08:17] [INFO ] Input system was already deterministic with 141 transitions.
Starting structural reductions in LTL mode, iteration 0 : 548/548 places, 480/480 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 547 transition count 480
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 29 place count 519 transition count 452
Iterating global reduction 1 with 28 rules applied. Total rules applied 57 place count 519 transition count 452
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 69 place count 507 transition count 440
Iterating global reduction 1 with 12 rules applied. Total rules applied 81 place count 507 transition count 440
Applied a total of 81 rules in 30 ms. Remains 507 /548 variables (removed 41) and now considering 440/480 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 507/548 places, 440/480 transitions.
[2024-05-21 16:08:17] [INFO ] Flatten gal took : 12 ms
[2024-05-21 16:08:18] [INFO ] Flatten gal took : 12 ms
[2024-05-21 16:08:18] [INFO ] Input system was already deterministic with 440 transitions.
Starting structural reductions in LTL mode, iteration 0 : 548/548 places, 480/480 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 547 transition count 480
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 34 place count 514 transition count 447
Iterating global reduction 1 with 33 rules applied. Total rules applied 67 place count 514 transition count 447
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 78 place count 503 transition count 436
Iterating global reduction 1 with 11 rules applied. Total rules applied 89 place count 503 transition count 436
Applied a total of 89 rules in 26 ms. Remains 503 /548 variables (removed 45) and now considering 436/480 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 503/548 places, 436/480 transitions.
[2024-05-21 16:08:18] [INFO ] Flatten gal took : 13 ms
[2024-05-21 16:08:18] [INFO ] Flatten gal took : 12 ms
[2024-05-21 16:08:18] [INFO ] Input system was already deterministic with 436 transitions.
[2024-05-21 16:08:18] [INFO ] Flatten gal took : 14 ms
[2024-05-21 16:08:18] [INFO ] Flatten gal took : 14 ms
[2024-05-21 16:08:18] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-05-21 16:08:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 548 places, 480 transitions and 1507 arcs took 3 ms.
Total runtime 54314 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BusinessProcesses-PT-17

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: 548
TRANSITIONS: 480
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.011s, Sys 0.000s]


SAVING FILE /home/mcc/execution/420/model (.net / .def) ...
EXPORT TIME: [User 0.002s, 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: 1355
MODEL NAME: /home/mcc/execution/420/model
548 places, 480 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
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-17-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL

BK_TIME_CONFINEMENT_REACHED

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
Error in allocating array of size 524288 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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-17"
export BK_EXAMINATION="CTLCardinality"
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-17, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r047-tajo-171620398500577"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-17.tgz
mv BusinessProcesses-PT-17 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;