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.r472-tajo-171620399700531.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 ltsminxred
Input is BusinessProcesses-PT-11, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399700531
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 15K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 11 16:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 11 16:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 11 16:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 141K 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-11-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-11-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-11-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-11-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-11-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-11-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-11-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-11-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-11-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-11-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-11-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-11-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-11-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-11-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-11-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-11-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717225603181

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:06:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:06:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:06:44] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2024-06-01 07:06:44] [INFO ] Transformed 567 places.
[2024-06-01 07:06:44] [INFO ] Transformed 508 transitions.
[2024-06-01 07:06:44] [INFO ] Found NUPN structural information;
[2024-06-01 07:06:44] [INFO ] Parsed PT model containing 567 places and 508 transitions and 1512 arcs in 196 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Deduced a syphon composed of 7 places in 7 ms
Reduce places removed 7 places and 7 transitions.
FORMULA BusinessProcesses-PT-11-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 560/560 places, 501/501 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 556 transition count 501
Discarding 76 places :
Symmetric choice reduction at 1 with 76 rule applications. Total rules 80 place count 480 transition count 425
Iterating global reduction 1 with 76 rules applied. Total rules applied 156 place count 480 transition count 425
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 195 place count 441 transition count 386
Iterating global reduction 1 with 39 rules applied. Total rules applied 234 place count 441 transition count 386
Applied a total of 234 rules in 120 ms. Remains 441 /560 variables (removed 119) and now considering 386/501 (removed 115) transitions.
// Phase 1: matrix 386 rows 441 cols
[2024-06-01 07:06:45] [INFO ] Computed 91 invariants in 27 ms
[2024-06-01 07:06:45] [INFO ] Implicit Places using invariants in 330 ms returned []
[2024-06-01 07:06:45] [INFO ] Invariant cache hit.
[2024-06-01 07:06:45] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 780 ms to find 0 implicit places.
Running 385 sub problems to find dead transitions.
[2024-06-01 07:06:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 2 (OVERLAPS) 1/441 variables, 49/87 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/441 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 385 unsolved
[2024-06-01 07:06:53] [INFO ] Deduced a trap composed of 85 places in 129 ms of which 23 ms to minimize.
[2024-06-01 07:06:53] [INFO ] Deduced a trap composed of 104 places in 207 ms of which 7 ms to minimize.
[2024-06-01 07:06:53] [INFO ] Deduced a trap composed of 55 places in 200 ms of which 15 ms to minimize.
[2024-06-01 07:06:53] [INFO ] Deduced a trap composed of 78 places in 305 ms of which 5 ms to minimize.
[2024-06-01 07:06:54] [INFO ] Deduced a trap composed of 77 places in 288 ms of which 21 ms to minimize.
[2024-06-01 07:06:54] [INFO ] Deduced a trap composed of 104 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:06:54] [INFO ] Deduced a trap composed of 65 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:06:54] [INFO ] Deduced a trap composed of 60 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:06:54] [INFO ] Deduced a trap composed of 81 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:06:54] [INFO ] Deduced a trap composed of 107 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:06:55] [INFO ] Deduced a trap composed of 72 places in 155 ms of which 8 ms to minimize.
[2024-06-01 07:06:55] [INFO ] Deduced a trap composed of 73 places in 166 ms of which 5 ms to minimize.
[2024-06-01 07:06:55] [INFO ] Deduced a trap composed of 83 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:06:55] [INFO ] Deduced a trap composed of 77 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:06:55] [INFO ] Deduced a trap composed of 100 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:06:55] [INFO ] Deduced a trap composed of 99 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:06:56] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:06:56] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:06:56] [INFO ] Deduced a trap composed of 83 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:06:56] [INFO ] Deduced a trap composed of 81 places in 129 ms of which 3 ms to minimize.
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 20/111 constraints. Problems are: Problem set: 12 solved, 373 unsolved
[2024-06-01 07:06:56] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:06:56] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:06:56] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:06:57] [INFO ] Deduced a trap composed of 76 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:06:57] [INFO ] Deduced a trap composed of 83 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:06:57] [INFO ] Deduced a trap composed of 102 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:06:57] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 4 ms to minimize.
[2024-06-01 07:06:57] [INFO ] Deduced a trap composed of 84 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:06:57] [INFO ] Deduced a trap composed of 81 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:06:57] [INFO ] Deduced a trap composed of 74 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:06:57] [INFO ] Deduced a trap composed of 80 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:06:58] [INFO ] Deduced a trap composed of 80 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:06:58] [INFO ] Deduced a trap composed of 72 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:06:58] [INFO ] Deduced a trap composed of 73 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:06:58] [INFO ] Deduced a trap composed of 70 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:06:58] [INFO ] Deduced a trap composed of 68 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:06:58] [INFO ] Deduced a trap composed of 80 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:06:58] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:06:59] [INFO ] Deduced a trap composed of 82 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:06:59] [INFO ] Deduced a trap composed of 78 places in 131 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 20/131 constraints. Problems are: Problem set: 12 solved, 373 unsolved
[2024-06-01 07:06:59] [INFO ] Deduced a trap composed of 88 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:06:59] [INFO ] Deduced a trap composed of 84 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:06:59] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:07:00] [INFO ] Deduced a trap composed of 80 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:07:00] [INFO ] Deduced a trap composed of 86 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:07:00] [INFO ] Deduced a trap composed of 80 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:07:00] [INFO ] Deduced a trap composed of 84 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:07:00] [INFO ] Deduced a trap composed of 79 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:07:00] [INFO ] Deduced a trap composed of 79 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:07:00] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:07:00] [INFO ] Deduced a trap composed of 79 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:07:01] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:07:01] [INFO ] Deduced a trap composed of 79 places in 128 ms of which 4 ms to minimize.
[2024-06-01 07:07:01] [INFO ] Deduced a trap composed of 81 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:07:01] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:07:01] [INFO ] Deduced a trap composed of 80 places in 112 ms of which 4 ms to minimize.
[2024-06-01 07:07:01] [INFO ] Deduced a trap composed of 79 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:07:01] [INFO ] Deduced a trap composed of 84 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:07:02] [INFO ] Deduced a trap composed of 83 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:07:02] [INFO ] Deduced a trap composed of 80 places in 116 ms of which 3 ms to minimize.
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 20/151 constraints. Problems are: Problem set: 33 solved, 352 unsolved
[2024-06-01 07:07:05] [INFO ] Deduced a trap composed of 96 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:07:05] [INFO ] Deduced a trap composed of 81 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:07:05] [INFO ] Deduced a trap composed of 87 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:07:05] [INFO ] Deduced a trap composed of 87 places in 122 ms of which 4 ms to minimize.
[2024-06-01 07:07:05] [INFO ] Deduced a trap composed of 84 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:07:05] [INFO ] Deduced a trap composed of 82 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:07:06] [INFO ] Deduced a trap composed of 75 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:07:06] [INFO ] Deduced a trap composed of 84 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:07:06] [INFO ] Deduced a trap composed of 82 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:07:06] [INFO ] Deduced a trap composed of 82 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:07:06] [INFO ] Deduced a trap composed of 82 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:07:07] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:07:07] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:07:07] [INFO ] Deduced a trap composed of 61 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:07:07] [INFO ] Deduced a trap composed of 58 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:07:07] [INFO ] Deduced a trap composed of 61 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:07:08] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:07:08] [INFO ] Deduced a trap composed of 58 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:07:08] [INFO ] Deduced a trap composed of 60 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:07:08] [INFO ] Deduced a trap composed of 62 places in 141 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 20/171 constraints. Problems are: Problem set: 33 solved, 352 unsolved
[2024-06-01 07:07:09] [INFO ] Deduced a trap composed of 73 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:07:09] [INFO ] Deduced a trap composed of 72 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:07:09] [INFO ] Deduced a trap composed of 81 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:07:09] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:07:10] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:07:10] [INFO ] Deduced a trap composed of 61 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:07:10] [INFO ] Deduced a trap composed of 53 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:07:10] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:07:11] [INFO ] Deduced a trap composed of 75 places in 126 ms of which 4 ms to minimize.
[2024-06-01 07:07:11] [INFO ] Deduced a trap composed of 68 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:07:11] [INFO ] Deduced a trap composed of 71 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:07:11] [INFO ] Deduced a trap composed of 74 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:07:11] [INFO ] Deduced a trap composed of 72 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:07:12] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:07:12] [INFO ] Deduced a trap composed of 60 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:07:12] [INFO ] Deduced a trap composed of 50 places in 151 ms of which 4 ms to minimize.
[2024-06-01 07:07:12] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 4 ms to minimize.
[2024-06-01 07:07:12] [INFO ] Deduced a trap composed of 79 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:07:12] [INFO ] Deduced a trap composed of 79 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:07:13] [INFO ] Deduced a trap composed of 58 places in 157 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/441 variables, 20/191 constraints. Problems are: Problem set: 33 solved, 352 unsolved
[2024-06-01 07:07:13] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:07:14] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:07:14] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:07:14] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:07:15] [INFO ] Deduced a trap composed of 51 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:07:15] [INFO ] Deduced a trap composed of 49 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:07:15] [INFO ] Deduced a trap composed of 75 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:07:15] [INFO ] Deduced a trap composed of 77 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:07:15] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 1.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 1.0)
(s300 1.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 1.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 0.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 0.0)
(s324 1.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 1.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 1.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 1.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
timeout
(s382 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 441/827 variables, and 200 constraints, problems are : Problem set: 33 solved, 352 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/441 constraints, PredecessorRefiner: 385/385 constraints, Known Traps: 109/109 constraints]
Escalating to Integer solving :Problem set: 33 solved, 352 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 38/38 constraints. Problems are: Problem set: 33 solved, 352 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 0/38 constraints. Problems are: Problem set: 33 solved, 352 unsolved
At refinement iteration 2 (OVERLAPS) 1/441 variables, 49/87 constraints. Problems are: Problem set: 33 solved, 352 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/441 variables, 4/91 constraints. Problems are: Problem set: 33 solved, 352 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 109/200 constraints. Problems are: Problem set: 33 solved, 352 unsolved
[2024-06-01 07:07:18] [INFO ] Deduced a trap composed of 55 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:07:19] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:07:19] [INFO ] Deduced a trap composed of 60 places in 161 ms of which 5 ms to minimize.
[2024-06-01 07:07:19] [INFO ] Deduced a trap composed of 63 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:07:19] [INFO ] Deduced a trap composed of 61 places in 161 ms of which 2 ms to minimize.
[2024-06-01 07:07:19] [INFO ] Deduced a trap composed of 85 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:07:20] [INFO ] Deduced a trap composed of 83 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:07:20] [INFO ] Deduced a trap composed of 85 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:07:20] [INFO ] Deduced a trap composed of 77 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:07:20] [INFO ] Deduced a trap composed of 79 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:07:20] [INFO ] Deduced a trap composed of 89 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:07:20] [INFO ] Deduced a trap composed of 72 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:07:20] [INFO ] Deduced a trap composed of 72 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:07:21] [INFO ] Deduced a trap composed of 77 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:07:21] [INFO ] Deduced a trap composed of 80 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:07:21] [INFO ] Deduced a trap composed of 72 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:07:21] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:07:21] [INFO ] Deduced a trap composed of 75 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:07:21] [INFO ] Deduced a trap composed of 59 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:07:21] [INFO ] Deduced a trap composed of 82 places in 121 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 20/220 constraints. Problems are: Problem set: 33 solved, 352 unsolved
[2024-06-01 07:07:22] [INFO ] Deduced a trap composed of 58 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:07:22] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:07:22] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:07:22] [INFO ] Deduced a trap composed of 81 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:07:22] [INFO ] Deduced a trap composed of 81 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:07:23] [INFO ] Deduced a trap composed of 71 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:07:23] [INFO ] Deduced a trap composed of 80 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:07:23] [INFO ] Deduced a trap composed of 76 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:07:23] [INFO ] Deduced a trap composed of 81 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:07:23] [INFO ] Deduced a trap composed of 71 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:07:23] [INFO ] Deduced a trap composed of 74 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:07:23] [INFO ] Deduced a trap composed of 74 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:07:24] [INFO ] Deduced a trap composed of 75 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:07:24] [INFO ] Deduced a trap composed of 75 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:07:24] [INFO ] Deduced a trap composed of 78 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:07:24] [INFO ] Deduced a trap composed of 72 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:07:24] [INFO ] Deduced a trap composed of 72 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:07:24] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:07:24] [INFO ] Deduced a trap composed of 81 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:07:25] [INFO ] Deduced a trap composed of 77 places in 139 ms of which 3 ms to minimize.
Problem TDEAD335 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 20/240 constraints. Problems are: Problem set: 34 solved, 351 unsolved
[2024-06-01 07:07:25] [INFO ] Deduced a trap composed of 56 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:07:26] [INFO ] Deduced a trap composed of 74 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:07:26] [INFO ] Deduced a trap composed of 60 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:07:26] [INFO ] Deduced a trap composed of 80 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:07:26] [INFO ] Deduced a trap composed of 59 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:07:26] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:07:26] [INFO ] Deduced a trap composed of 54 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:07:26] [INFO ] Deduced a trap composed of 58 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:07:27] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:07:27] [INFO ] Deduced a trap composed of 73 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:07:27] [INFO ] Deduced a trap composed of 62 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:07:27] [INFO ] Deduced a trap composed of 74 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:07:27] [INFO ] Deduced a trap composed of 93 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:07:27] [INFO ] Deduced a trap composed of 58 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:07:27] [INFO ] Deduced a trap composed of 58 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:07:27] [INFO ] Deduced a trap composed of 80 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:07:28] [INFO ] Deduced a trap composed of 62 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:07:28] [INFO ] Deduced a trap composed of 75 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:07:28] [INFO ] Deduced a trap composed of 74 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:07:28] [INFO ] Deduced a trap composed of 61 places in 113 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 20/260 constraints. Problems are: Problem set: 34 solved, 351 unsolved
[2024-06-01 07:07:29] [INFO ] Deduced a trap composed of 57 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:07:29] [INFO ] Deduced a trap composed of 79 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:07:29] [INFO ] Deduced a trap composed of 70 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:07:29] [INFO ] Deduced a trap composed of 83 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:07:29] [INFO ] Deduced a trap composed of 64 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:07:30] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:07:30] [INFO ] Deduced a trap composed of 68 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:07:30] [INFO ] Deduced a trap composed of 62 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:07:30] [INFO ] Deduced a trap composed of 62 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:07:30] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:07:31] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:07:31] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:07:32] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:07:32] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 2 ms to minimize.
[2024-06-01 07:07:32] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:07:32] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:07:32] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:07:32] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:07:32] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:07:33] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/441 variables, 20/280 constraints. Problems are: Problem set: 34 solved, 351 unsolved
[2024-06-01 07:07:33] [INFO ] Deduced a trap composed of 72 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:07:33] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:07:34] [INFO ] Deduced a trap composed of 71 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:07:34] [INFO ] Deduced a trap composed of 80 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:07:34] [INFO ] Deduced a trap composed of 74 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:07:34] [INFO ] Deduced a trap composed of 78 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:07:34] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:07:34] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:07:35] [INFO ] Deduced a trap composed of 78 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:07:35] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:07:35] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:07:36] [INFO ] Deduced a trap composed of 54 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:07:36] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:07:36] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:07:37] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:07:37] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:07:37] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:07:37] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:07:37] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:07:37] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/441 variables, 20/300 constraints. Problems are: Problem set: 34 solved, 351 unsolved
[2024-06-01 07:07:38] [INFO ] Deduced a trap composed of 72 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:07:38] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:07:38] [INFO ] Deduced a trap composed of 75 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:07:38] [INFO ] Deduced a trap composed of 81 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:07:38] [INFO ] Deduced a trap composed of 80 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:07:39] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:07:39] [INFO ] Deduced a trap composed of 77 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:07:39] [INFO ] Deduced a trap composed of 81 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:07:39] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:07:39] [INFO ] Deduced a trap composed of 79 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:07:39] [INFO ] Deduced a trap composed of 77 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:07:39] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:07:39] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:07:40] [INFO ] Deduced a trap composed of 82 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:07:40] [INFO ] Deduced a trap composed of 79 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:07:40] [INFO ] Deduced a trap composed of 80 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:07:40] [INFO ] Deduced a trap composed of 81 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:07:40] [INFO ] Deduced a trap composed of 79 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:07:41] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:07:41] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/441 variables, 20/320 constraints. Problems are: Problem set: 34 solved, 351 unsolved
[2024-06-01 07:07:42] [INFO ] Deduced a trap composed of 80 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:07:42] [INFO ] Deduced a trap composed of 85 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:07:42] [INFO ] Deduced a trap composed of 80 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:07:42] [INFO ] Deduced a trap composed of 79 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:07:42] [INFO ] Deduced a trap composed of 83 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:07:43] [INFO ] Deduced a trap composed of 84 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:07:43] [INFO ] Deduced a trap composed of 78 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:07:43] [INFO ] Deduced a trap composed of 106 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:07:43] [INFO ] Deduced a trap composed of 84 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:07:43] [INFO ] Deduced a trap composed of 82 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:07:43] [INFO ] Deduced a trap composed of 74 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:07:43] [INFO ] Deduced a trap composed of 79 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:07:44] [INFO ] Deduced a trap composed of 73 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:07:44] [INFO ] Deduced a trap composed of 71 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:07:44] [INFO ] Deduced a trap composed of 76 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:07:44] [INFO ] Deduced a trap composed of 77 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:07:44] [INFO ] Deduced a trap composed of 78 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:07:44] [INFO ] Deduced a trap composed of 82 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:07:44] [INFO ] Deduced a trap composed of 82 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:07:45] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/441 variables, 20/340 constraints. Problems are: Problem set: 34 solved, 351 unsolved
[2024-06-01 07:07:45] [INFO ] Deduced a trap composed of 82 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:07:45] [INFO ] Deduced a trap composed of 79 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:07:46] [INFO ] Deduced a trap composed of 74 places in 104 ms of which 3 ms to minimize.
SMT process timed out in 60253ms, After SMT, problems are : Problem set: 34 solved, 351 unsolved
Search for dead transitions found 34 dead transitions in 60269ms
Found 34 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 34 transitions
Dead transitions reduction (with SMT) removed 34 transitions
Starting structural reductions in LTL mode, iteration 1 : 441/560 places, 352/501 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 440 transition count 352
Applied a total of 1 rules in 28 ms. Remains 440 /441 variables (removed 1) and now considering 352/352 (removed 0) transitions.
// Phase 1: matrix 352 rows 440 cols
[2024-06-01 07:07:46] [INFO ] Computed 97 invariants in 10 ms
[2024-06-01 07:07:46] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-06-01 07:07:46] [INFO ] Invariant cache hit.
[2024-06-01 07:07:46] [INFO ] Implicit Places using invariants and state equation in 418 ms returned [58, 59]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 625 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 438/560 places, 352/501 transitions.
Applied a total of 0 rules in 16 ms. Remains 438 /438 variables (removed 0) and now considering 352/352 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61862 ms. Remains : 438/560 places, 352/501 transitions.
Support contains 18 out of 438 places after structural reductions.
[2024-06-01 07:07:46] [INFO ] Flatten gal took : 53 ms
[2024-06-01 07:07:46] [INFO ] Flatten gal took : 23 ms
[2024-06-01 07:07:46] [INFO ] Input system was already deterministic with 352 transitions.
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40000 steps (290 resets) in 1193 ms. (33 steps per ms) remains 2/10 properties
BEST_FIRST walk for 40004 steps (48 resets) in 190 ms. (209 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (55 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
// Phase 1: matrix 352 rows 438 cols
[2024-06-01 07:07:47] [INFO ] Computed 95 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 99/109 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 202/311 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 115/426 variables, 43/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/429 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/429 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 346/775 variables, 429/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/775 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/788 variables, 7/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/788 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/790 variables, 2/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/790 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/790 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 790/790 variables, and 533 constraints, problems are : Problem set: 0 solved, 1 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 438/438 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 99/109 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 202/311 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:07:47] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 115/426 variables, 43/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:07:47] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:07:48] [INFO ] Deduced a trap composed of 52 places in 43 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/429 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/429 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 346/775 variables, 429/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/775 variables, 1/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/775 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 13/788 variables, 7/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/788 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/790 variables, 2/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/790 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/790 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 790/790 variables, and 537 constraints, problems are : Problem set: 0 solved, 1 unsolved in 456 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 438/438 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 688ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 166 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=55 )
Parikh walk visited 1 properties in 11 ms.
FORMULA BusinessProcesses-PT-11-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 423 stabilizing places and 337 stable transitions
Graph (complete) has 914 edges and 438 vertex of which 437 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.18 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0&&F(G(p0)))))'
Support contains 2 out of 438 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 438/438 places, 352/352 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 435 transition count 349
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 435 transition count 349
Applied a total of 6 rules in 23 ms. Remains 435 /438 variables (removed 3) and now considering 349/352 (removed 3) transitions.
// Phase 1: matrix 349 rows 435 cols
[2024-06-01 07:07:48] [INFO ] Computed 95 invariants in 5 ms
[2024-06-01 07:07:48] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-06-01 07:07:48] [INFO ] Invariant cache hit.
[2024-06-01 07:07:48] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2024-06-01 07:07:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (OVERLAPS) 1/435 variables, 51/93 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/435 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-01 07:07:55] [INFO ] Deduced a trap composed of 56 places in 121 ms of which 4 ms to minimize.
[2024-06-01 07:07:55] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:07:55] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:07:55] [INFO ] Deduced a trap composed of 75 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:07:55] [INFO ] Deduced a trap composed of 73 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:07:55] [INFO ] Deduced a trap composed of 77 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:07:56] [INFO ] Deduced a trap composed of 76 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:07:56] [INFO ] Deduced a trap composed of 73 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:07:56] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:07:56] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:07:56] [INFO ] Deduced a trap composed of 78 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:07:56] [INFO ] Deduced a trap composed of 75 places in 97 ms of which 3 ms to minimize.
[2024-06-01 07:07:56] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:07:56] [INFO ] Deduced a trap composed of 74 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:07:57] [INFO ] Deduced a trap composed of 71 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:07:57] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:07:57] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 3 ms to minimize.
[2024-06-01 07:07:57] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:07:57] [INFO ] Deduced a trap composed of 72 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:07:57] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/435 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-01 07:07:57] [INFO ] Deduced a trap composed of 75 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:07:58] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:07:58] [INFO ] Deduced a trap composed of 77 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:07:58] [INFO ] Deduced a trap composed of 75 places in 129 ms of which 15 ms to minimize.
[2024-06-01 07:07:58] [INFO ] Deduced a trap composed of 71 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:07:58] [INFO ] Deduced a trap composed of 77 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:07:58] [INFO ] Deduced a trap composed of 71 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:07:58] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:07:58] [INFO ] Deduced a trap composed of 68 places in 90 ms of which 3 ms to minimize.
[2024-06-01 07:07:59] [INFO ] Deduced a trap composed of 72 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:08:00] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:08:00] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:08:00] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:08:00] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:08:00] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:08:01] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:08:01] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:08:01] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:08:01] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:08:01] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/435 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-01 07:08:02] [INFO ] Deduced a trap composed of 69 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 73 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:08:04] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:08:04] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:08:04] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:08:04] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:08:04] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:08:04] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:08:04] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:08:04] [INFO ] Deduced a trap composed of 72 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:08:05] [INFO ] Deduced a trap composed of 70 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:08:05] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:08:05] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:08:05] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:08:05] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 2 ms to minimize.
[2024-06-01 07:08:05] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/435 variables, 20/155 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-01 07:08:09] [INFO ] Deduced a trap composed of 73 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:08:09] [INFO ] Deduced a trap composed of 68 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:08:09] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:08:09] [INFO ] Deduced a trap composed of 75 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:08:09] [INFO ] Deduced a trap composed of 73 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:08:09] [INFO ] Deduced a trap composed of 80 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:08:10] [INFO ] Deduced a trap composed of 79 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:08:10] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:08:10] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:08:10] [INFO ] Deduced a trap composed of 70 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:08:10] [INFO ] Deduced a trap composed of 79 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:08:10] [INFO ] Deduced a trap composed of 72 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:08:11] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:08:11] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:08:11] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:08:11] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:08:11] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:08:11] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:08:11] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 3 ms to minimize.
[2024-06-01 07:08:11] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 20/175 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-01 07:08:12] [INFO ] Deduced a trap composed of 77 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:08:12] [INFO ] Deduced a trap composed of 77 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:08:13] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:08:14] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:08:14] [INFO ] Deduced a trap composed of 45 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:08:14] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:08:14] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:08:14] [INFO ] Deduced a trap composed of 55 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:08:14] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:08:14] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:08:15] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:08:15] [INFO ] Deduced a trap composed of 72 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:08:15] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:08:15] [INFO ] Deduced a trap composed of 66 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:08:16] [INFO ] Deduced a trap composed of 70 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:08:16] [INFO ] Deduced a trap composed of 70 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:08:16] [INFO ] Deduced a trap composed of 73 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:08:16] [INFO ] Deduced a trap composed of 82 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:08:16] [INFO ] Deduced a trap composed of 74 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:08:16] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 20/195 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-01 07:08:17] [INFO ] Deduced a trap composed of 76 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:08:17] [INFO ] Deduced a trap composed of 73 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:08:17] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:08:17] [INFO ] Deduced a trap composed of 75 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:08:17] [INFO ] Deduced a trap composed of 75 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:08:18] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:08:18] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 3 ms to minimize.
[2024-06-01 07:08:18] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:08:18] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:08:18] [INFO ] Deduced a trap composed of 74 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:08:18] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:08:18] [INFO ] Deduced a trap composed of 76 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:08:18] [INFO ] Deduced a trap composed of 77 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:08:18] [INFO ] Deduced a trap composed of 85 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:08:19] [INFO ] Deduced a trap composed of 79 places in 122 ms of which 3 ms to minimize.
SMT process timed out in 30112ms, After SMT, problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 30121ms
Starting structural reductions in LTL mode, iteration 1 : 435/438 places, 349/352 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30670 ms. Remains : 435/438 places, 349/352 transitions.
Stuttering acceptance computed with spot in 256 ms :[true, true, true, (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-11-LTLCardinality-00
Stuttering criterion allowed to conclude after 121 steps with 0 reset in 3 ms.
FORMULA BusinessProcesses-PT-11-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLCardinality-00 finished in 31000 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 438 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 438/438 places, 352/352 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 436 transition count 350
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 436 transition count 350
Applied a total of 4 rules in 25 ms. Remains 436 /438 variables (removed 2) and now considering 350/352 (removed 2) transitions.
// Phase 1: matrix 350 rows 436 cols
[2024-06-01 07:08:19] [INFO ] Computed 95 invariants in 5 ms
[2024-06-01 07:08:19] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-06-01 07:08:19] [INFO ] Invariant cache hit.
[2024-06-01 07:08:19] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
Running 349 sub problems to find dead transitions.
[2024-06-01 07:08:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/435 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 2 (OVERLAPS) 1/436 variables, 49/91 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 56 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 57 places in 95 ms of which 3 ms to minimize.
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:08:27] [INFO ] Deduced a trap composed of 53 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 64 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 60 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 53 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 61 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:08:28] [INFO ] Deduced a trap composed of 78 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 57 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 58 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 58 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 55 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 63 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 59 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 56 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 64 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:08:30] [INFO ] Deduced a trap composed of 57 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:08:30] [INFO ] Deduced a trap composed of 59 places in 132 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-01 07:08:30] [INFO ] Deduced a trap composed of 64 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:08:31] [INFO ] Deduced a trap composed of 59 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:08:31] [INFO ] Deduced a trap composed of 60 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:08:31] [INFO ] Deduced a trap composed of 71 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:08:31] [INFO ] Deduced a trap composed of 57 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:08:31] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:08:31] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:08:32] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:08:32] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 3 ms to minimize.
[2024-06-01 07:08:34] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:08:34] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:08:34] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-01 07:08:34] [INFO ] Deduced a trap composed of 54 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:08:34] [INFO ] Deduced a trap composed of 75 places in 95 ms of which 3 ms to minimize.
[2024-06-01 07:08:34] [INFO ] Deduced a trap composed of 60 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:08:35] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:08:35] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 3 ms to minimize.
[2024-06-01 07:08:35] [INFO ] Deduced a trap composed of 78 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:08:35] [INFO ] Deduced a trap composed of 73 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:08:35] [INFO ] Deduced a trap composed of 73 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:08:35] [INFO ] Deduced a trap composed of 77 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:08:37] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:08:37] [INFO ] Deduced a trap composed of 31 places in 216 ms of which 3 ms to minimize.
[2024-06-01 07:08:37] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:08:37] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:08:37] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:08:37] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:08:38] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:08:38] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:08:38] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:08:38] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:08:38] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 20/155 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-01 07:08:41] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:08:42] [INFO ] Deduced a trap composed of 76 places in 158 ms of which 2 ms to minimize.
[2024-06-01 07:08:42] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:08:42] [INFO ] Deduced a trap composed of 78 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:08:43] [INFO ] Deduced a trap composed of 78 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:08:43] [INFO ] Deduced a trap composed of 85 places in 152 ms of which 2 ms to minimize.
[2024-06-01 07:08:43] [INFO ] Deduced a trap composed of 73 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:08:43] [INFO ] Deduced a trap composed of 77 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:08:43] [INFO ] Deduced a trap composed of 75 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:08:43] [INFO ] Deduced a trap composed of 77 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:08:43] [INFO ] Deduced a trap composed of 76 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:08:44] [INFO ] Deduced a trap composed of 71 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:08:44] [INFO ] Deduced a trap composed of 77 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:08:44] [INFO ] Deduced a trap composed of 78 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:08:44] [INFO ] Deduced a trap composed of 74 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:08:44] [INFO ] Deduced a trap composed of 76 places in 175 ms of which 4 ms to minimize.
[2024-06-01 07:08:44] [INFO ] Deduced a trap composed of 87 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:08:44] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:08:45] [INFO ] Deduced a trap composed of 75 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:08:45] [INFO ] Deduced a trap composed of 72 places in 135 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 20/175 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-01 07:08:45] [INFO ] Deduced a trap composed of 63 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:08:45] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:08:45] [INFO ] Deduced a trap composed of 61 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:08:45] [INFO ] Deduced a trap composed of 58 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 91 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:08:47] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:08:48] [INFO ] Deduced a trap composed of 122 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:08:48] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 4 ms to minimize.
[2024-06-01 07:08:48] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:08:48] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:08:48] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:08:48] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:08:48] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:08:48] [INFO ] Deduced a trap composed of 72 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:08:49] [INFO ] Deduced a trap composed of 75 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:08:49] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:08:49] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:08:49] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:08:49] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 20/195 constraints. Problems are: Problem set: 0 solved, 349 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 436/786 variables, and 195 constraints, problems are : Problem set: 0 solved, 349 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/436 constraints, PredecessorRefiner: 349/349 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 349 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/435 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 2 (OVERLAPS) 1/436 variables, 49/91 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 100/195 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 3 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 3 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 55 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 54 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 74 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 74 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 72 places in 122 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 20/215 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 78 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 75 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 74 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:08:58] [INFO ] Deduced a trap composed of 76 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:08:58] [INFO ] Deduced a trap composed of 75 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:08:58] [INFO ] Deduced a trap composed of 77 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:08:58] [INFO ] Deduced a trap composed of 76 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:08:58] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:08:58] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:08:58] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:08:58] [INFO ] Deduced a trap composed of 79 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:08:59] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:08:59] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:08:59] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:09:00] [INFO ] Deduced a trap composed of 74 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:09:00] [INFO ] Deduced a trap composed of 72 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:09:00] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 79 places in 161 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 20/235 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 76 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:09:01] [INFO ] Deduced a trap composed of 73 places in 114 ms of which 5 ms to minimize.
[2024-06-01 07:09:02] [INFO ] Deduced a trap composed of 69 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:09:02] [INFO ] Deduced a trap composed of 70 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:09:02] [INFO ] Deduced a trap composed of 72 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:09:02] [INFO ] Deduced a trap composed of 70 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:09:02] [INFO ] Deduced a trap composed of 75 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:09:02] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:09:02] [INFO ] Deduced a trap composed of 72 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:09:02] [INFO ] Deduced a trap composed of 77 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:09:02] [INFO ] Deduced a trap composed of 77 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:09:03] [INFO ] Deduced a trap composed of 78 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:09:03] [INFO ] Deduced a trap composed of 73 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:09:03] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:09:03] [INFO ] Deduced a trap composed of 76 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:09:03] [INFO ] Deduced a trap composed of 78 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:09:03] [INFO ] Deduced a trap composed of 74 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:09:03] [INFO ] Deduced a trap composed of 79 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:09:03] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:09:04] [INFO ] Deduced a trap composed of 77 places in 151 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 20/255 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-01 07:09:05] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 3 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 3 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:09:08] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:09:08] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:09:08] [INFO ] Deduced a trap composed of 59 places in 146 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 20/275 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-01 07:09:10] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:09:10] [INFO ] Deduced a trap composed of 69 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:09:10] [INFO ] Deduced a trap composed of 69 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:09:10] [INFO ] Deduced a trap composed of 69 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:09:10] [INFO ] Deduced a trap composed of 72 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:09:10] [INFO ] Deduced a trap composed of 71 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:09:10] [INFO ] Deduced a trap composed of 71 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:09:11] [INFO ] Deduced a trap composed of 70 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:09:11] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:09:11] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:09:11] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 3 ms to minimize.
[2024-06-01 07:09:11] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:09:12] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:09:13] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 20/295 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-01 07:09:13] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:09:13] [INFO ] Deduced a trap composed of 88 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:09:13] [INFO ] Deduced a trap composed of 72 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:09:14] [INFO ] Deduced a trap composed of 77 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:09:14] [INFO ] Deduced a trap composed of 75 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:09:14] [INFO ] Deduced a trap composed of 74 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:09:14] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:09:15] [INFO ] Deduced a trap composed of 76 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:09:15] [INFO ] Deduced a trap composed of 77 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:09:15] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:09:15] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:09:15] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:09:16] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:09:16] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:09:16] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:09:16] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:09:16] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:09:17] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 3 ms to minimize.
[2024-06-01 07:09:17] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:09:17] [INFO ] Deduced a trap composed of 59 places in 121 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/436 variables, 20/315 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-01 07:09:18] [INFO ] Deduced a trap composed of 81 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:09:18] [INFO ] Deduced a trap composed of 78 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:09:18] [INFO ] Deduced a trap composed of 74 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:09:18] [INFO ] Deduced a trap composed of 82 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:09:18] [INFO ] Deduced a trap composed of 78 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:09:19] [INFO ] Deduced a trap composed of 49 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:09:19] [INFO ] Deduced a trap composed of 81 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:09:19] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:09:19] [INFO ] Deduced a trap composed of 78 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:09:19] [INFO ] Deduced a trap composed of 78 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:09:19] [INFO ] Deduced a trap composed of 80 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:09:19] [INFO ] Deduced a trap composed of 73 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:09:20] [INFO ] Deduced a trap composed of 96 places in 117 ms of which 3 ms to minimize.
SMT process timed out in 60106ms, After SMT, problems are : Problem set: 0 solved, 349 unsolved
Search for dead transitions found 0 dead transitions in 60111ms
Starting structural reductions in LTL mode, iteration 1 : 436/438 places, 350/352 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60711 ms. Remains : 436/438 places, 350/352 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-11-LTLCardinality-02
Product exploration explored 100000 steps with 33333 reset in 351 ms.
Product exploration explored 100000 steps with 33333 reset in 213 ms.
Computed a total of 421 stabilizing places and 335 stable transitions
Graph (complete) has 910 edges and 436 vertex of which 435 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 421 stabilizing places and 335 stable transitions
Detected a total of 421/436 stabilizing places and 335/350 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 31 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-11-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-11-LTLCardinality-02 finished in 61497 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 438 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 438/438 places, 352/352 transitions.
Graph (trivial) has 200 edges and 438 vertex of which 6 / 438 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 908 edges and 433 vertex of which 432 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 48 place count 431 transition count 298
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 94 place count 385 transition count 298
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 94 place count 385 transition count 203
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 302 place count 272 transition count 203
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 305 place count 269 transition count 200
Iterating global reduction 2 with 3 rules applied. Total rules applied 308 place count 269 transition count 200
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 230 rules applied. Total rules applied 538 place count 149 transition count 90
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 2 with 2 rules applied. Total rules applied 540 place count 148 transition count 94
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 541 place count 147 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 542 place count 146 transition count 93
Applied a total of 542 rules in 90 ms. Remains 146 /438 variables (removed 292) and now considering 93/352 (removed 259) transitions.
// Phase 1: matrix 93 rows 146 cols
[2024-06-01 07:09:20] [INFO ] Computed 66 invariants in 2 ms
[2024-06-01 07:09:21] [INFO ] Implicit Places using invariants in 113 ms returned [41, 42]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 115 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 144/438 places, 93/352 transitions.
Applied a total of 0 rules in 8 ms. Remains 144 /144 variables (removed 0) and now considering 93/93 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 214 ms. Remains : 144/438 places, 93/352 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-11-LTLCardinality-03
Stuttering criterion allowed to conclude after 5 steps with 1 reset in 1 ms.
FORMULA BusinessProcesses-PT-11-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLCardinality-03 finished in 302 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 438 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 438/438 places, 352/352 transitions.
Graph (trivial) has 199 edges and 438 vertex of which 6 / 438 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 908 edges and 433 vertex of which 432 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 48 place count 431 transition count 298
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 94 place count 385 transition count 298
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 94 place count 385 transition count 203
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 302 place count 272 transition count 203
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 305 place count 269 transition count 200
Iterating global reduction 2 with 3 rules applied. Total rules applied 308 place count 269 transition count 200
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 230 rules applied. Total rules applied 538 place count 149 transition count 90
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 2 with 2 rules applied. Total rules applied 540 place count 148 transition count 94
Applied a total of 540 rules in 73 ms. Remains 148 /438 variables (removed 290) and now considering 94/352 (removed 258) transitions.
// Phase 1: matrix 94 rows 148 cols
[2024-06-01 07:09:21] [INFO ] Computed 67 invariants in 2 ms
[2024-06-01 07:09:21] [INFO ] Implicit Places using invariants in 122 ms returned [1, 4, 5, 18, 19, 20, 21, 28, 29, 30, 35, 36, 37, 38, 39, 40, 41, 42]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 125 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/438 places, 94/352 transitions.
Applied a total of 0 rules in 6 ms. Remains 130 /130 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 204 ms. Remains : 130/438 places, 94/352 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-11-LTLCardinality-04
Stuttering criterion allowed to conclude after 43 steps with 7 reset in 0 ms.
FORMULA BusinessProcesses-PT-11-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLCardinality-04 finished in 295 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((F(p0)||X(p1)))) U G(!p2)))'
Support contains 6 out of 438 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 438/438 places, 352/352 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 436 transition count 350
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 436 transition count 350
Applied a total of 4 rules in 14 ms. Remains 436 /438 variables (removed 2) and now considering 350/352 (removed 2) transitions.
// Phase 1: matrix 350 rows 436 cols
[2024-06-01 07:09:21] [INFO ] Computed 95 invariants in 6 ms
[2024-06-01 07:09:21] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-06-01 07:09:21] [INFO ] Invariant cache hit.
[2024-06-01 07:09:22] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
Running 349 sub problems to find dead transitions.
[2024-06-01 07:09:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/435 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 2 (OVERLAPS) 1/436 variables, 49/91 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-01 07:09:28] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 3 ms to minimize.
[2024-06-01 07:09:28] [INFO ] Deduced a trap composed of 74 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:09:28] [INFO ] Deduced a trap composed of 75 places in 97 ms of which 3 ms to minimize.
[2024-06-01 07:09:28] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:09:29] [INFO ] Deduced a trap composed of 89 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:09:29] [INFO ] Deduced a trap composed of 78 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:09:29] [INFO ] Deduced a trap composed of 79 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:09:29] [INFO ] Deduced a trap composed of 82 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:09:29] [INFO ] Deduced a trap composed of 73 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:09:29] [INFO ] Deduced a trap composed of 78 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:09:29] [INFO ] Deduced a trap composed of 72 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:09:29] [INFO ] Deduced a trap composed of 73 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:09:29] [INFO ] Deduced a trap composed of 71 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:09:29] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:09:30] [INFO ] Deduced a trap composed of 70 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:09:30] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:09:30] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:09:30] [INFO ] Deduced a trap composed of 79 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:09:30] [INFO ] Deduced a trap composed of 80 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:09:30] [INFO ] Deduced a trap composed of 69 places in 107 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-01 07:09:31] [INFO ] Deduced a trap composed of 77 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:09:31] [INFO ] Deduced a trap composed of 73 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:09:31] [INFO ] Deduced a trap composed of 74 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:09:31] [INFO ] Deduced a trap composed of 76 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:09:31] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:09:31] [INFO ] Deduced a trap composed of 79 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:09:31] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:09:32] [INFO ] Deduced a trap composed of 73 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:09:32] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:09:32] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:09:32] [INFO ] Deduced a trap composed of 79 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:09:32] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:09:32] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:09:32] [INFO ] Deduced a trap composed of 78 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:09:32] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 3 ms to minimize.
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 75 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 78 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 76 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-01 07:09:34] [INFO ] Deduced a trap composed of 69 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:09:34] [INFO ] Deduced a trap composed of 71 places in 94 ms of which 3 ms to minimize.
[2024-06-01 07:09:34] [INFO ] Deduced a trap composed of 71 places in 95 ms of which 3 ms to minimize.
[2024-06-01 07:09:34] [INFO ] Deduced a trap composed of 75 places in 92 ms of which 3 ms to minimize.
[2024-06-01 07:09:34] [INFO ] Deduced a trap composed of 68 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:09:34] [INFO ] Deduced a trap composed of 71 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:09:34] [INFO ] Deduced a trap composed of 71 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:09:34] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:09:35] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:09:35] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:09:35] [INFO ] Deduced a trap composed of 55 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:09:35] [INFO ] Deduced a trap composed of 72 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:09:35] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:09:35] [INFO ] Deduced a trap composed of 55 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:09:35] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:09:36] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:09:36] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:09:37] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:09:37] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 3 ms to minimize.
[2024-06-01 07:09:37] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 20/155 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-01 07:09:40] [INFO ] Deduced a trap composed of 78 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:09:40] [INFO ] Deduced a trap composed of 61 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:09:40] [INFO ] Deduced a trap composed of 56 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:09:40] [INFO ] Deduced a trap composed of 58 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:09:40] [INFO ] Deduced a trap composed of 58 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:09:40] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:09:40] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:09:41] [INFO ] Deduced a trap composed of 59 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:09:41] [INFO ] Deduced a trap composed of 66 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:09:41] [INFO ] Deduced a trap composed of 60 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:09:41] [INFO ] Deduced a trap composed of 62 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:09:41] [INFO ] Deduced a trap composed of 59 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:09:41] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 20/175 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 71 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 55 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 57 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 55 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:09:44] [INFO ] Deduced a trap composed of 59 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:09:44] [INFO ] Deduced a trap composed of 76 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:09:44] [INFO ] Deduced a trap composed of 76 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:09:44] [INFO ] Deduced a trap composed of 72 places in 96 ms of which 3 ms to minimize.
[2024-06-01 07:09:44] [INFO ] Deduced a trap composed of 75 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:09:44] [INFO ] Deduced a trap composed of 75 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:09:44] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:09:44] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:09:44] [INFO ] Deduced a trap composed of 79 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:09:45] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 20/195 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-01 07:09:45] [INFO ] Deduced a trap composed of 61 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:09:46] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:09:46] [INFO ] Deduced a trap composed of 25 places in 148 ms of which 4 ms to minimize.
[2024-06-01 07:09:46] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:09:47] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:09:47] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 3 ms to minimize.
[2024-06-01 07:09:47] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:09:47] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:09:47] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:09:47] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:09:48] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:09:48] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:09:48] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:09:48] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:09:48] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:09:48] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:09:48] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:09:49] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:09:49] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:09:49] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 20/215 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-01 07:09:51] [INFO ] Deduced a trap composed of 80 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:09:52] [INFO ] Deduced a trap composed of 55 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:09:52] [INFO ] Deduced a trap composed of 61 places in 98 ms of which 3 ms to minimize.
SMT process timed out in 30089ms, After SMT, problems are : Problem set: 0 solved, 349 unsolved
Search for dead transitions found 0 dead transitions in 30094ms
Starting structural reductions in LTL mode, iteration 1 : 436/438 places, 350/352 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30675 ms. Remains : 436/438 places, 350/352 transitions.
Stuttering acceptance computed with spot in 454 ms :[p2, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (NOT p0), (AND (NOT p0) p2 p1)]
Running random walk in product with property : BusinessProcesses-PT-11-LTLCardinality-05
Product exploration explored 100000 steps with 33460 reset in 230 ms.
Stack based approach found an accepted trace after 187 steps with 60 reset with depth 5 and stack size 5 in 1 ms.
FORMULA BusinessProcesses-PT-11-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-11-LTLCardinality-05 finished in 31387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 438 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 438/438 places, 352/352 transitions.
Graph (trivial) has 200 edges and 438 vertex of which 6 / 438 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 908 edges and 433 vertex of which 432 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 48 place count 431 transition count 298
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 94 place count 385 transition count 298
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 94 place count 385 transition count 203
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 302 place count 272 transition count 203
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 305 place count 269 transition count 200
Iterating global reduction 2 with 3 rules applied. Total rules applied 308 place count 269 transition count 200
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 230 rules applied. Total rules applied 538 place count 149 transition count 90
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 2 with 2 rules applied. Total rules applied 540 place count 148 transition count 94
Applied a total of 540 rules in 81 ms. Remains 148 /438 variables (removed 290) and now considering 94/352 (removed 258) transitions.
// Phase 1: matrix 94 rows 148 cols
[2024-06-01 07:09:52] [INFO ] Computed 67 invariants in 1 ms
[2024-06-01 07:09:53] [INFO ] Implicit Places using invariants in 443 ms returned [1, 4, 5, 19, 20, 21, 22, 30, 31, 32, 37, 38, 39, 40, 41, 42, 43, 44]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 444 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/438 places, 94/352 transitions.
Applied a total of 0 rules in 5 ms. Remains 130 /130 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 531 ms. Remains : 130/438 places, 94/352 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-11-LTLCardinality-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-11-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLCardinality-06 finished in 623 ms.
All properties solved by simple procedures.
Total runtime 188985 ms.
ITS solved all properties within timeout

BK_STOP 1717225793516

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML

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-11"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BusinessProcesses-PT-11, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r472-tajo-171620399700531"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-11.tgz
mv BusinessProcesses-PT-11 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;