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-171620399800555.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-14, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399800555
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 11 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 16:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 16:37 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 156K 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-14-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717225829136

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-14
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:10:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:10:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:10:30] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2024-06-01 07:10:30] [INFO ] Transformed 624 places.
[2024-06-01 07:10:30] [INFO ] Transformed 564 transitions.
[2024-06-01 07:10:30] [INFO ] Found NUPN structural information;
[2024-06-01 07:10:30] [INFO ] Parsed PT model containing 624 places and 564 transitions and 1657 arcs in 240 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 8 places in 9 ms
Reduce places removed 8 places and 8 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-14-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 616 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 616/616 places, 556/556 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 611 transition count 556
Discarding 90 places :
Symmetric choice reduction at 1 with 90 rule applications. Total rules 95 place count 521 transition count 466
Iterating global reduction 1 with 90 rules applied. Total rules applied 185 place count 521 transition count 466
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 228 place count 478 transition count 423
Iterating global reduction 1 with 43 rules applied. Total rules applied 271 place count 478 transition count 423
Applied a total of 271 rules in 147 ms. Remains 478 /616 variables (removed 138) and now considering 423/556 (removed 133) transitions.
// Phase 1: matrix 423 rows 478 cols
[2024-06-01 07:10:31] [INFO ] Computed 94 invariants in 25 ms
[2024-06-01 07:10:31] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-06-01 07:10:31] [INFO ] Invariant cache hit.
[2024-06-01 07:10:31] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 856 ms to find 0 implicit places.
Running 422 sub problems to find dead transitions.
[2024-06-01 07:10:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (OVERLAPS) 1/478 variables, 55/92 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2024-06-01 07:10:42] [INFO ] Deduced a trap composed of 104 places in 139 ms of which 26 ms to minimize.
[2024-06-01 07:10:42] [INFO ] Deduced a trap composed of 87 places in 142 ms of which 4 ms to minimize.
[2024-06-01 07:10:42] [INFO ] Deduced a trap composed of 103 places in 304 ms of which 3 ms to minimize.
[2024-06-01 07:10:42] [INFO ] Deduced a trap composed of 90 places in 154 ms of which 12 ms to minimize.
[2024-06-01 07:10:42] [INFO ] Deduced a trap composed of 100 places in 135 ms of which 6 ms to minimize.
[2024-06-01 07:10:43] [INFO ] Deduced a trap composed of 104 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:10:43] [INFO ] Deduced a trap composed of 107 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:10:43] [INFO ] Deduced a trap composed of 84 places in 213 ms of which 4 ms to minimize.
[2024-06-01 07:10:43] [INFO ] Deduced a trap composed of 106 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:10:43] [INFO ] Deduced a trap composed of 104 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:10:43] [INFO ] Deduced a trap composed of 104 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:10:43] [INFO ] Deduced a trap composed of 104 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:10:44] [INFO ] Deduced a trap composed of 105 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:10:44] [INFO ] Deduced a trap composed of 91 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:10:44] [INFO ] Deduced a trap composed of 101 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:10:44] [INFO ] Deduced a trap composed of 104 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:10:44] [INFO ] Deduced a trap composed of 104 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:10:44] [INFO ] Deduced a trap composed of 103 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:10:44] [INFO ] Deduced a trap composed of 94 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:10:44] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 2 ms to minimize.
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/478 variables, 20/114 constraints. Problems are: Problem set: 22 solved, 400 unsolved
[2024-06-01 07:10:45] [INFO ] Deduced a trap composed of 91 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:10:45] [INFO ] Deduced a trap composed of 102 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:10:45] [INFO ] Deduced a trap composed of 86 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:10:45] [INFO ] Deduced a trap composed of 82 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:10:45] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:10:45] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:10:45] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 88 places in 93 ms of which 3 ms to minimize.
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 3 ms to minimize.
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 92 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 94 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 89 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 86 places in 85 ms of which 2 ms to minimize.
Problem TDEAD363 is UNSAT
Problem TDEAD366 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 20/134 constraints. Problems are: Problem set: 24 solved, 398 unsolved
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 25 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 85 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 87 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 84 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 92 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 89 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 93 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:10:48] [INFO ] Deduced a trap composed of 90 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:10:48] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:10:48] [INFO ] Deduced a trap composed of 86 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:10:48] [INFO ] Deduced a trap composed of 88 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:10:48] [INFO ] Deduced a trap composed of 97 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:10:48] [INFO ] Deduced a trap composed of 84 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:10:48] [INFO ] Deduced a trap composed of 90 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:10:48] [INFO ] Deduced a trap composed of 85 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:10:48] [INFO ] Deduced a trap composed of 87 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:10:48] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 4 ms to minimize.
[2024-06-01 07:10:49] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:10:49] [INFO ] Deduced a trap composed of 84 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:10:49] [INFO ] Deduced a trap composed of 84 places in 86 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 20/154 constraints. Problems are: Problem set: 24 solved, 398 unsolved
[2024-06-01 07:10:52] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:10:52] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:10:52] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:10:52] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 4 ms to minimize.
[2024-06-01 07:10:53] [INFO ] Deduced a trap composed of 102 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:10:53] [INFO ] Deduced a trap composed of 100 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:10:53] [INFO ] Deduced a trap composed of 104 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:10:53] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:10:53] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:10:53] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:10:53] [INFO ] Deduced a trap composed of 107 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:10:53] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:10:53] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:10:54] [INFO ] Deduced a trap composed of 91 places in 91 ms of which 3 ms to minimize.
[2024-06-01 07:10:54] [INFO ] Deduced a trap composed of 92 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:10:54] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:10:54] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:10:54] [INFO ] Deduced a trap composed of 84 places in 78 ms of which 4 ms to minimize.
[2024-06-01 07:10:54] [INFO ] Deduced a trap composed of 85 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:10:54] [INFO ] Deduced a trap composed of 96 places in 80 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 20/174 constraints. Problems are: Problem set: 24 solved, 398 unsolved
[2024-06-01 07:10:55] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:10:55] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:10:55] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:10:55] [INFO ] Deduced a trap composed of 103 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:10:55] [INFO ] Deduced a trap composed of 91 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:10:55] [INFO ] Deduced a trap composed of 101 places in 89 ms of which 3 ms to minimize.
[2024-06-01 07:10:56] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:10:56] [INFO ] Deduced a trap composed of 92 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:10:56] [INFO ] Deduced a trap composed of 102 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:10:56] [INFO ] Deduced a trap composed of 101 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:10:56] [INFO ] Deduced a trap composed of 85 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:10:56] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:10:56] [INFO ] Deduced a trap composed of 85 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:10:57] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:10:57] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:10:57] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:10:57] [INFO ] Deduced a trap composed of 91 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:10:57] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:10:57] [INFO ] Deduced a trap composed of 93 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:10:57] [INFO ] Deduced a trap composed of 86 places in 87 ms of which 3 ms to minimize.
Problem TDEAD320 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 20/194 constraints. Problems are: Problem set: 28 solved, 394 unsolved
[2024-06-01 07:10:57] [INFO ] Deduced a trap composed of 25 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:10:58] [INFO ] Deduced a trap composed of 43 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:10:58] [INFO ] Deduced a trap composed of 21 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:10:58] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:10:58] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:10:58] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:10:58] [INFO ] Deduced a trap composed of 87 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:10:59] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:10:59] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:10:59] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:10:59] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:10:59] [INFO ] Deduced a trap composed of 98 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:10:59] [INFO ] Deduced a trap composed of 92 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:10:59] [INFO ] Deduced a trap composed of 92 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:10:59] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:10:59] [INFO ] Deduced a trap composed of 84 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:11:00] [INFO ] Deduced a trap composed of 93 places in 90 ms of which 3 ms to minimize.
[2024-06-01 07:11:00] [INFO ] Deduced a trap composed of 95 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:11:00] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:11:00] [INFO ] Deduced a trap composed of 87 places in 86 ms of which 2 ms to minimize.
Problem TDEAD340 is UNSAT
Problem TDEAD371 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 20/214 constraints. Problems are: Problem set: 30 solved, 392 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/901 variables, and 214 constraints, problems are : Problem set: 30 solved, 392 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/478 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 30 solved, 392 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 37/37 constraints. Problems are: Problem set: 30 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 0/37 constraints. Problems are: Problem set: 30 solved, 392 unsolved
At refinement iteration 2 (OVERLAPS) 1/478 variables, 55/92 constraints. Problems are: Problem set: 30 solved, 392 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 2/94 constraints. Problems are: Problem set: 30 solved, 392 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/478 variables, 120/214 constraints. Problems are: Problem set: 30 solved, 392 unsolved
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 91 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 85 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 85 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 96 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 87 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 99 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:11:07] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:11:07] [INFO ] Deduced a trap composed of 100 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:11:07] [INFO ] Deduced a trap composed of 85 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:11:07] [INFO ] Deduced a trap composed of 89 places in 84 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 20/234 constraints. Problems are: Problem set: 30 solved, 392 unsolved
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 96 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:11:08] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:11:09] [INFO ] Deduced a trap composed of 106 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:11:09] [INFO ] Deduced a trap composed of 114 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:11:09] [INFO ] Deduced a trap composed of 107 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:11:09] [INFO ] Deduced a trap composed of 107 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:11:09] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:11:09] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:11:09] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:11:09] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:11:10] [INFO ] Deduced a trap composed of 75 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:11:10] [INFO ] Deduced a trap composed of 77 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:11:10] [INFO ] Deduced a trap composed of 80 places in 90 ms of which 4 ms to minimize.
[2024-06-01 07:11:10] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:11:10] [INFO ] Deduced a trap composed of 81 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:11:10] [INFO ] Deduced a trap composed of 82 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:11:10] [INFO ] Deduced a trap composed of 80 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:11:10] [INFO ] Deduced a trap composed of 79 places in 84 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 20/254 constraints. Problems are: Problem set: 30 solved, 392 unsolved
[2024-06-01 07:11:11] [INFO ] Deduced a trap composed of 69 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:11:11] [INFO ] Deduced a trap composed of 84 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:11:12] [INFO ] Deduced a trap composed of 67 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:11:12] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:11:12] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:11:12] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:11:12] [INFO ] Deduced a trap composed of 61 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:11:12] [INFO ] Deduced a trap composed of 90 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:11:12] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:11:12] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 91 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 87 places in 82 ms of which 3 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 68 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 82 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 88 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 20/274 constraints. Problems are: Problem set: 30 solved, 392 unsolved
[2024-06-01 07:11:14] [INFO ] Deduced a trap composed of 66 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:11:15] [INFO ] Deduced a trap composed of 82 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:11:15] [INFO ] Deduced a trap composed of 96 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:11:15] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:11:15] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:11:15] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 87 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 88 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 73 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 87 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:11:16] [INFO ] Deduced a trap composed of 88 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:11:17] [INFO ] Deduced a trap composed of 95 places in 93 ms of which 3 ms to minimize.
[2024-06-01 07:11:17] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:11:17] [INFO ] Deduced a trap composed of 88 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:11:17] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:11:17] [INFO ] Deduced a trap composed of 94 places in 85 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 20/294 constraints. Problems are: Problem set: 30 solved, 392 unsolved
[2024-06-01 07:11:18] [INFO ] Deduced a trap composed of 105 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:11:18] [INFO ] Deduced a trap composed of 102 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:11:18] [INFO ] Deduced a trap composed of 99 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:11:18] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:11:18] [INFO ] Deduced a trap composed of 89 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:11:18] [INFO ] Deduced a trap composed of 92 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:11:19] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:11:19] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:11:19] [INFO ] Deduced a trap composed of 88 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:11:19] [INFO ] Deduced a trap composed of 99 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:11:19] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:11:19] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:11:19] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:11:19] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:11:19] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:11:20] [INFO ] Deduced a trap composed of 97 places in 92 ms of which 2 ms to minimize.
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD367 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 20/314 constraints. Problems are: Problem set: 33 solved, 389 unsolved
[2024-06-01 07:11:21] [INFO ] Deduced a trap composed of 80 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:11:21] [INFO ] Deduced a trap composed of 82 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:11:21] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:11:21] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:11:21] [INFO ] Deduced a trap composed of 80 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:11:21] [INFO ] Deduced a trap composed of 78 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:11:21] [INFO ] Deduced a trap composed of 80 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:11:22] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:11:22] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:11:22] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:11:22] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:11:22] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:11:22] [INFO ] Deduced a trap composed of 79 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:11:22] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:11:22] [INFO ] Deduced a trap composed of 83 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:11:22] [INFO ] Deduced a trap composed of 81 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:11:22] [INFO ] Deduced a trap composed of 84 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 87 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:11:23] [INFO ] Deduced a trap composed of 87 places in 76 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/478 variables, 20/334 constraints. Problems are: Problem set: 33 solved, 389 unsolved
[2024-06-01 07:11:25] [INFO ] Deduced a trap composed of 83 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:11:25] [INFO ] Deduced a trap composed of 78 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:11:25] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:11:25] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:11:25] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:11:25] [INFO ] Deduced a trap composed of 83 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:11:25] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:11:25] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:11:26] [INFO ] Deduced a trap composed of 100 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:11:26] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:11:26] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:11:26] [INFO ] Deduced a trap composed of 93 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:11:26] [INFO ] Deduced a trap composed of 85 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:11:26] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:11:26] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 3 ms to minimize.
[2024-06-01 07:11:26] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 88 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:11:27] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/478 variables, 20/354 constraints. Problems are: Problem set: 33 solved, 389 unsolved
[2024-06-01 07:11:29] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:11:29] [INFO ] Deduced a trap composed of 85 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:11:29] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 3 ms to minimize.
[2024-06-01 07:11:29] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:11:29] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:11:29] [INFO ] Deduced a trap composed of 86 places in 96 ms of which 3 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 80 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 80 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 83 places in 91 ms of which 3 ms to minimize.
[2024-06-01 07:11:30] [INFO ] Deduced a trap composed of 78 places in 93 ms of which 3 ms to minimize.
[2024-06-01 07:11:31] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:11:31] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:11:31] [INFO ] Deduced a trap composed of 86 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:11:31] [INFO ] Deduced a trap composed of 92 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:11:31] [INFO ] Deduced a trap composed of 100 places in 120 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/478 variables, 20/374 constraints. Problems are: Problem set: 33 solved, 389 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/901 variables, and 374 constraints, problems are : Problem set: 33 solved, 389 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/478 constraints, PredecessorRefiner: 0/422 constraints, Known Traps: 280/280 constraints]
After SMT, in 60176ms problems are : Problem set: 33 solved, 389 unsolved
Search for dead transitions found 33 dead transitions in 60195ms
Found 33 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 33 transitions
Dead transitions reduction (with SMT) removed 33 transitions
Starting structural reductions in LTL mode, iteration 1 : 478/616 places, 390/556 transitions.
Applied a total of 0 rules in 24 ms. Remains 478 /478 variables (removed 0) and now considering 390/390 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61248 ms. Remains : 478/616 places, 390/556 transitions.
Support contains 30 out of 478 places after structural reductions.
[2024-06-01 07:11:32] [INFO ] Flatten gal took : 83 ms
[2024-06-01 07:11:32] [INFO ] Flatten gal took : 38 ms
[2024-06-01 07:11:32] [INFO ] Input system was already deterministic with 390 transitions.
RANDOM walk for 40000 steps (273 resets) in 1718 ms. (23 steps per ms) remains 9/15 properties
BEST_FIRST walk for 40004 steps (48 resets) in 162 ms. (245 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (47 resets) in 129 ms. (307 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (46 resets) in 148 ms. (268 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (43 resets) in 120 ms. (330 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (48 resets) in 96 ms. (412 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (49 resets) in 165 ms. (240 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (58 resets) in 95 ms. (416 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (46 resets) in 109 ms. (363 steps per ms) remains 8/8 properties
// Phase 1: matrix 390 rows 478 cols
[2024-06-01 07:11:33] [INFO ] Computed 100 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 190/206 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 146/352 variables, 33/55 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 117/469 variables, 45/100 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 384/853 variables, 469/569 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/853 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 13/866 variables, 7/576 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/866 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 2/868 variables, 2/578 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/868 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/868 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 868/868 variables, and 578 constraints, problems are : Problem set: 0 solved, 8 unsolved in 673 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 478/478 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 1 (OVERLAPS) 190/206 variables, 22/22 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 146/352 variables, 33/55 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 61 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 81 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 77 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:11:34] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 75 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 77 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 79 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 85 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 84 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:11:35] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 20/75 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 80 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 76 places in 79 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 4/79 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/79 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 117/469 variables, 45/124 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 79 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:11:36] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 78 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 91 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 86 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 80 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 86 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:11:37] [INFO ] Deduced a trap composed of 89 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 86 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 3 ms to minimize.
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 87 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 20/144 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/469 variables, 1/145 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/469 variables, 0/145 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 384/853 variables, 469/614 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/853 variables, 7/621 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-06-01 07:11:38] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:11:39] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:11:39] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:11:39] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 2 ms to minimize.
[2024-06-01 07:11:39] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
SMT process timed out in 5719ms, After SMT, problems are : Problem set: 1 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 390/390 transitions.
Graph (trivial) has 213 edges and 478 vertex of which 6 / 478 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1016 edges and 473 vertex of which 472 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 49 place count 472 transition count 335
Reduce places removed 47 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 48 rules applied. Total rules applied 97 place count 425 transition count 334
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 98 place count 424 transition count 334
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 93 Pre rules applied. Total rules applied 98 place count 424 transition count 241
Deduced a syphon composed of 93 places in 1 ms
Ensure Unique test removed 14 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 298 place count 317 transition count 241
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 303 place count 312 transition count 236
Iterating global reduction 3 with 5 rules applied. Total rules applied 308 place count 312 transition count 236
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 3 with 255 rules applied. Total rules applied 563 place count 180 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 565 place count 179 transition count 117
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 567 place count 179 transition count 115
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 569 place count 177 transition count 115
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 573 place count 177 transition count 115
Applied a total of 573 rules in 143 ms. Remains 177 /478 variables (removed 301) and now considering 115/390 (removed 275) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 177/478 places, 115/390 transitions.
RANDOM walk for 3376 steps (117 resets) in 115 ms. (29 steps per ms) remains 0/7 properties
FORMULA BusinessProcesses-PT-14-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BusinessProcesses-PT-14-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Computed a total of 127 stabilizing places and 120 stable transitions
Graph (complete) has 1023 edges and 478 vertex of which 477 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.23 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(F(p0)))'
Support contains 2 out of 478 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 478/478 places, 390/390 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 470 transition count 382
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 470 transition count 382
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 466 transition count 378
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 466 transition count 378
Applied a total of 24 rules in 63 ms. Remains 466 /478 variables (removed 12) and now considering 378/390 (removed 12) transitions.
// Phase 1: matrix 378 rows 466 cols
[2024-06-01 07:11:39] [INFO ] Computed 100 invariants in 5 ms
[2024-06-01 07:11:40] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-06-01 07:11:40] [INFO ] Invariant cache hit.
[2024-06-01 07:11:40] [INFO ] Implicit Places using invariants and state equation in 468 ms returned [149, 150, 420]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 776 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 463/478 places, 378/390 transitions.
Applied a total of 0 rules in 7 ms. Remains 463 /463 variables (removed 0) and now considering 378/378 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 846 ms. Remains : 463/478 places, 378/390 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-02
Stuttering criterion allowed to conclude after 276 steps with 3 reset in 3 ms.
FORMULA BusinessProcesses-PT-14-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLCardinality-02 finished in 1087 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' '!(((F(p0) U (X(X(!p2))||p1)) U p0))'
Support contains 5 out of 478 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 478/478 places, 390/390 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 472 transition count 384
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 472 transition count 384
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 469 transition count 381
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 469 transition count 381
Applied a total of 18 rules in 32 ms. Remains 469 /478 variables (removed 9) and now considering 381/390 (removed 9) transitions.
// Phase 1: matrix 381 rows 469 cols
[2024-06-01 07:11:40] [INFO ] Computed 100 invariants in 5 ms
[2024-06-01 07:11:41] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-06-01 07:11:41] [INFO ] Invariant cache hit.
[2024-06-01 07:11:41] [INFO ] Implicit Places using invariants and state equation in 380 ms returned [149, 152, 423]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 533 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 466/478 places, 381/390 transitions.
Applied a total of 0 rules in 13 ms. Remains 466 /466 variables (removed 0) and now considering 381/381 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 578 ms. Remains : 466/478 places, 381/390 transitions.
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p1) p2), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-05
Stuttering criterion allowed to conclude after 135 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-14-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLCardinality-05 finished in 816 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 478 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 478/478 places, 390/390 transitions.
Graph (trivial) has 225 edges and 478 vertex of which 6 / 478 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1017 edges and 473 vertex of which 472 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 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 471 transition count 332
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 421 transition count 332
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 102 place count 421 transition count 231
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 218 rules applied. Total rules applied 320 place count 304 transition count 231
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 328 place count 296 transition count 223
Iterating global reduction 2 with 8 rules applied. Total rules applied 336 place count 296 transition count 223
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 592 place count 163 transition count 100
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 594 place count 162 transition count 104
Applied a total of 594 rules in 44 ms. Remains 162 /478 variables (removed 316) and now considering 104/390 (removed 286) transitions.
// Phase 1: matrix 104 rows 162 cols
[2024-06-01 07:11:41] [INFO ] Computed 74 invariants in 1 ms
[2024-06-01 07:11:41] [INFO ] Implicit Places using invariants in 108 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 29, 30, 43, 44, 45, 46, 47]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 110 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/478 places, 104/390 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 139 transition count 103
Applied a total of 2 rules in 9 ms. Remains 139 /140 variables (removed 1) and now considering 103/104 (removed 1) transitions.
// Phase 1: matrix 103 rows 139 cols
[2024-06-01 07:11:41] [INFO ] Computed 52 invariants in 1 ms
[2024-06-01 07:11:41] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-01 07:11:41] [INFO ] Invariant cache hit.
[2024-06-01 07:11:41] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:11:42] [INFO ] Implicit Places using invariants and state equation in 136 ms returned [1, 3, 7, 10, 11, 12, 24, 27, 29, 31, 32, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 57, 59, 61, 63, 65, 67, 69, 71, 79, 81, 83, 85, 87, 109, 127]
Discarding 37 places :
Implicit Place search using SMT with State Equation took 215 ms to find 37 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 102/478 places, 103/390 transitions.
Graph (complete) has 248 edges and 102 vertex of which 91 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 91 transition count 89
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 82 transition count 89
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 24 place count 77 transition count 82
Iterating global reduction 2 with 5 rules applied. Total rules applied 29 place count 77 transition count 82
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 32 place count 77 transition count 79
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 35 place count 74 transition count 79
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 36 place count 73 transition count 78
Iterating global reduction 4 with 1 rules applied. Total rules applied 37 place count 73 transition count 78
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 54 place count 64 transition count 70
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 56 place count 63 transition count 69
Applied a total of 56 rules in 12 ms. Remains 63 /102 variables (removed 39) and now considering 69/103 (removed 34) transitions.
// Phase 1: matrix 69 rows 63 cols
[2024-06-01 07:11:42] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 07:11:42] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-01 07:11:42] [INFO ] Invariant cache hit.
[2024-06-01 07:11:42] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 07:11:42] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 63/478 places, 69/390 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 499 ms. Remains : 63/478 places, 69/390 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-14-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLCardinality-06 finished in 568 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(p0)))'
Support contains 1 out of 478 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 478/478 places, 390/390 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 470 transition count 382
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 470 transition count 382
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 466 transition count 378
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 466 transition count 378
Applied a total of 24 rules in 22 ms. Remains 466 /478 variables (removed 12) and now considering 378/390 (removed 12) transitions.
// Phase 1: matrix 378 rows 466 cols
[2024-06-01 07:11:42] [INFO ] Computed 100 invariants in 2 ms
[2024-06-01 07:11:42] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-06-01 07:11:42] [INFO ] Invariant cache hit.
[2024-06-01 07:11:42] [INFO ] Implicit Places using invariants and state equation in 404 ms returned [149, 150, 420]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 561 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 463/478 places, 378/390 transitions.
Applied a total of 0 rules in 16 ms. Remains 463 /463 variables (removed 0) and now considering 378/378 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 600 ms. Remains : 463/478 places, 378/390 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-08
Product exploration explored 100000 steps with 685 reset in 341 ms.
Product exploration explored 100000 steps with 681 reset in 276 ms.
Computed a total of 123 stabilizing places and 116 stable transitions
Graph (complete) has 986 edges and 463 vertex of which 462 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 123 stabilizing places and 116 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (269 resets) in 218 ms. (182 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (49 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2193 steps, run visited all 1 properties in 21 ms. (steps per millisecond=104 )
Probabilistic random walk after 2193 steps, saw 1969 distinct states, run finished after 25 ms. (steps per millisecond=87 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-14-LTLCardinality-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-14-LTLCardinality-08 finished in 1753 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' '!(F(G(p0)))'
Support contains 4 out of 478 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 478/478 places, 390/390 transitions.
Graph (trivial) has 222 edges and 478 vertex of which 6 / 478 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 1017 edges and 473 vertex of which 472 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 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 471 transition count 333
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 422 transition count 333
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 100 place count 422 transition count 233
Deduced a syphon composed of 100 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 217 rules applied. Total rules applied 317 place count 305 transition count 233
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 324 place count 298 transition count 226
Iterating global reduction 2 with 7 rules applied. Total rules applied 331 place count 298 transition count 226
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 2 with 261 rules applied. Total rules applied 592 place count 162 transition count 101
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 594 place count 161 transition count 105
Applied a total of 594 rules in 47 ms. Remains 161 /478 variables (removed 317) and now considering 105/390 (removed 285) transitions.
// Phase 1: matrix 105 rows 161 cols
[2024-06-01 07:11:44] [INFO ] Computed 72 invariants in 2 ms
[2024-06-01 07:11:44] [INFO ] Implicit Places using invariants in 145 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 41, 42, 43, 44, 45]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 147 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 141/478 places, 105/390 transitions.
Applied a total of 0 rules in 15 ms. Remains 141 /141 variables (removed 0) and now considering 105/105 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 210 ms. Remains : 141/478 places, 105/390 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-12
Product exploration explored 100000 steps with 17988 reset in 338 ms.
Product exploration explored 100000 steps with 18008 reset in 280 ms.
Computed a total of 14 stabilizing places and 12 stable transitions
Computed a total of 14 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 40000 steps (7936 resets) in 1010 ms. (39 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (2575 resets) in 158 ms. (251 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 123 steps, run visited all 1 properties in 4 ms. (steps per millisecond=30 )
Probabilistic random walk after 123 steps, saw 79 distinct states, run finished after 5 ms. (steps per millisecond=24 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 105/105 transitions.
Applied a total of 0 rules in 5 ms. Remains 141 /141 variables (removed 0) and now considering 105/105 (removed 0) transitions.
// Phase 1: matrix 105 rows 141 cols
[2024-06-01 07:11:45] [INFO ] Computed 52 invariants in 2 ms
[2024-06-01 07:11:45] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-01 07:11:45] [INFO ] Invariant cache hit.
[2024-06-01 07:11:45] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:11:45] [INFO ] Implicit Places using invariants and state equation in 139 ms returned [1, 3, 7, 10, 11, 12, 24, 27, 29, 31, 32, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 57, 59, 61, 63, 65, 67, 72, 80, 82, 84, 86, 88, 112, 124, 128]
Discarding 37 places :
Implicit Place search using SMT with State Equation took 215 ms to find 37 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/141 places, 105/105 transitions.
Graph (complete) has 264 edges and 104 vertex of which 93 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 93 transition count 92
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 85 transition count 92
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 22 place count 80 transition count 85
Iterating global reduction 2 with 5 rules applied. Total rules applied 27 place count 80 transition count 85
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 80 transition count 82
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 33 place count 77 transition count 82
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 34 place count 76 transition count 81
Iterating global reduction 4 with 1 rules applied. Total rules applied 35 place count 76 transition count 81
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 49 place count 69 transition count 74
Applied a total of 49 rules in 10 ms. Remains 69 /104 variables (removed 35) and now considering 74/105 (removed 31) transitions.
// Phase 1: matrix 74 rows 69 cols
[2024-06-01 07:11:45] [INFO ] Computed 11 invariants in 1 ms
[2024-06-01 07:11:45] [INFO ] Implicit Places using invariants in 48 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 68/141 places, 74/105 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 67 transition count 73
Applied a total of 2 rules in 3 ms. Remains 67 /68 variables (removed 1) and now considering 73/74 (removed 1) transitions.
// Phase 1: matrix 73 rows 67 cols
[2024-06-01 07:11:45] [INFO ] Computed 10 invariants in 0 ms
[2024-06-01 07:11:45] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-01 07:11:45] [INFO ] Invariant cache hit.
[2024-06-01 07:11:45] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 07:11:45] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 67/141 places, 73/105 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 407 ms. Remains : 67/141 places, 73/105 transitions.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
RANDOM walk for 35527 steps (7284 resets) in 55 ms. (634 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 18206 reset in 131 ms.
Product exploration explored 100000 steps with 18307 reset in 129 ms.
Support contains 4 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 73/73 transitions.
Applied a total of 0 rules in 2 ms. Remains 67 /67 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2024-06-01 07:11:46] [INFO ] Invariant cache hit.
[2024-06-01 07:11:46] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-01 07:11:46] [INFO ] Invariant cache hit.
[2024-06-01 07:11:46] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 07:11:46] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2024-06-01 07:11:46] [INFO ] Redundant transitions in 12 ms returned []
Running 68 sub problems to find dead transitions.
[2024-06-01 07:11:46] [INFO ] Invariant cache hit.
[2024-06-01 07:11:46] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 68 unsolved
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
At refinement iteration 4 (OVERLAPS) 72/139 variables, 67/77 constraints. Problems are: Problem set: 3 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 3/80 constraints. Problems are: Problem set: 3 solved, 65 unsolved
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:11:47] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 4/84 constraints. Problems are: Problem set: 3 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/84 constraints. Problems are: Problem set: 3 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/139 variables, 0/84 constraints. Problems are: Problem set: 3 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/140 variables, and 84 constraints, problems are : Problem set: 3 solved, 65 unsolved in 1141 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 67/67 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 3 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 4/8 constraints. Problems are: Problem set: 3 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 65 unsolved
At refinement iteration 3 (OVERLAPS) 1/67 variables, 6/14 constraints. Problems are: Problem set: 3 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/14 constraints. Problems are: Problem set: 3 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 72/139 variables, 67/81 constraints. Problems are: Problem set: 3 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 3/84 constraints. Problems are: Problem set: 3 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 65/149 constraints. Problems are: Problem set: 3 solved, 65 unsolved
[2024-06-01 07:11:48] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:11:48] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 2/151 constraints. Problems are: Problem set: 3 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/151 constraints. Problems are: Problem set: 3 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 0/139 variables, 0/151 constraints. Problems are: Problem set: 3 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/140 variables, and 151 constraints, problems are : Problem set: 3 solved, 65 unsolved in 1617 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 67/67 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 65/68 constraints, Known Traps: 6/6 constraints]
After SMT, in 2794ms problems are : Problem set: 3 solved, 65 unsolved
Search for dead transitions found 3 dead transitions in 2795ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 67/67 places, 70/73 transitions.
Applied a total of 0 rules in 5 ms. Remains 67 /67 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2024-06-01 07:11:49] [INFO ] Redundant transitions in 12 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 2992 ms. Remains : 67/67 places, 70/73 transitions.
Treatment of property BusinessProcesses-PT-14-LTLCardinality-12 finished in 5549 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(X((p0 U G(p1))))))'
Support contains 4 out of 478 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 478/478 places, 390/390 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 473 transition count 385
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 473 transition count 385
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 470 transition count 382
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 470 transition count 382
Applied a total of 16 rules in 29 ms. Remains 470 /478 variables (removed 8) and now considering 382/390 (removed 8) transitions.
// Phase 1: matrix 382 rows 470 cols
[2024-06-01 07:11:49] [INFO ] Computed 100 invariants in 3 ms
[2024-06-01 07:11:49] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-06-01 07:11:49] [INFO ] Invariant cache hit.
[2024-06-01 07:11:50] [INFO ] Implicit Places using invariants and state equation in 528 ms returned [150, 151, 424]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 707 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 467/478 places, 382/390 transitions.
Applied a total of 0 rules in 18 ms. Remains 467 /467 variables (removed 0) and now considering 382/382 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 756 ms. Remains : 467/478 places, 382/390 transitions.
Stuttering acceptance computed with spot in 279 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-14
Product exploration explored 100000 steps with 681 reset in 232 ms.
Entered a terminal (fully accepting) state of product in 74371 steps with 500 reset in 148 ms.
FORMULA BusinessProcesses-PT-14-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLCardinality-14 finished in 1439 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((X(p0) U G((p1 U p0))))))'
Support contains 4 out of 478 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 478/478 places, 390/390 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 471 transition count 383
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 471 transition count 383
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 468 transition count 380
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 468 transition count 380
Applied a total of 20 rules in 20 ms. Remains 468 /478 variables (removed 10) and now considering 380/390 (removed 10) transitions.
// Phase 1: matrix 380 rows 468 cols
[2024-06-01 07:11:51] [INFO ] Computed 100 invariants in 5 ms
[2024-06-01 07:11:51] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-06-01 07:11:51] [INFO ] Invariant cache hit.
[2024-06-01 07:11:51] [INFO ] Implicit Places using invariants and state equation in 389 ms returned [149, 150, 422]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 583 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 465/478 places, 380/390 transitions.
Applied a total of 0 rules in 8 ms. Remains 465 /465 variables (removed 0) and now considering 380/380 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 612 ms. Remains : 465/478 places, 380/390 transitions.
Stuttering acceptance computed with spot in 253 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-15
Product exploration explored 100000 steps with 20057 reset in 188 ms.
Product exploration explored 100000 steps with 20023 reset in 162 ms.
Computed a total of 123 stabilizing places and 116 stable transitions
Graph (complete) has 990 edges and 465 vertex of which 464 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 123 stabilizing places and 116 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 120 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), true]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (270 resets) in 130 ms. (305 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (46 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (46 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
// Phase 1: matrix 380 rows 465 cols
[2024-06-01 07:11:52] [INFO ] Computed 97 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 101/105 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 237/342 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 114/456 variables, 42/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 374/830 variables, 456/553 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/830 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 13/843 variables, 7/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/843 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/845 variables, 2/562 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/845 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/845 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 845/845 variables, and 562 constraints, problems are : Problem set: 0 solved, 2 unsolved in 342 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 465/465 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 101/105 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 237/342 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:11:53] [INFO ] Deduced a trap composed of 79 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:11:53] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:11:53] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:11:53] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 114/456 variables, 42/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 374/830 variables, 456/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/830 variables, 2/559 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:11:53] [INFO ] Deduced a trap composed of 81 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:11:53] [INFO ] Deduced a trap composed of 82 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:11:53] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 81 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 81 places in 123 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/830 variables, 6/565 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/830 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf0 is UNSAT
At refinement iteration 12 (OVERLAPS) 13/843 variables, 7/572 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/843 variables, 0/572 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/845 variables, 2/574 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/845 variables, 0/574 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/845 variables, 0/574 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 845/845 variables, and 574 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1644 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 465/465 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints]
After SMT, in 1998ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 76 ms.
Support contains 2 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 380/380 transitions.
Graph (trivial) has 214 edges and 465 vertex of which 6 / 465 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 983 edges and 460 vertex of which 459 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 49 place count 459 transition count 325
Reduce places removed 47 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 48 rules applied. Total rules applied 97 place count 412 transition count 324
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 98 place count 411 transition count 324
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 98 Pre rules applied. Total rules applied 98 place count 411 transition count 226
Deduced a syphon composed of 98 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 213 rules applied. Total rules applied 311 place count 296 transition count 226
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 312 place count 295 transition count 225
Iterating global reduction 3 with 1 rules applied. Total rules applied 313 place count 295 transition count 225
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 3 with 265 rules applied. Total rules applied 578 place count 157 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 580 place count 156 transition count 102
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 582 place count 156 transition count 100
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 584 place count 154 transition count 100
Applied a total of 584 rules in 44 ms. Remains 154 /465 variables (removed 311) and now considering 100/380 (removed 280) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 154/465 places, 100/380 transitions.
RANDOM walk for 375 steps (14 resets) in 6 ms. (53 steps per ms) remains 0/1 properties
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (G (OR p0 p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 185 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 465 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 465/465 places, 380/380 transitions.
Graph (trivial) has 211 edges and 465 vertex of which 6 / 465 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 984 edges and 460 vertex of which 459 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (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 458 transition count 326
Reduce places removed 46 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 412 transition count 325
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 96 place count 411 transition count 325
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 96 place count 411 transition count 229
Deduced a syphon composed of 96 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 3 with 209 rules applied. Total rules applied 305 place count 298 transition count 229
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 3 with 265 rules applied. Total rules applied 570 place count 160 transition count 102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 572 place count 159 transition count 106
Applied a total of 572 rules in 24 ms. Remains 159 /465 variables (removed 306) and now considering 106/380 (removed 274) transitions.
// Phase 1: matrix 106 rows 159 cols
[2024-06-01 07:11:55] [INFO ] Computed 69 invariants in 2 ms
[2024-06-01 07:11:55] [INFO ] Implicit Places using invariants in 128 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 20, 21, 22, 23, 24, 25, 41, 42, 43, 44, 45]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 141 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 139/465 places, 106/380 transitions.
Applied a total of 0 rules in 4 ms. Remains 139 /139 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 169 ms. Remains : 139/465 places, 106/380 transitions.
Computed a total of 12 stabilizing places and 10 stable transitions
Computed a total of 12 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 18928 steps (4717 resets) in 48 ms. (386 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 21803 reset in 169 ms.
Product exploration explored 100000 steps with 21856 reset in 162 ms.
Support contains 2 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 106/106 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 139 transition count 104
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 137 transition count 104
Applied a total of 4 rules in 4 ms. Remains 137 /139 variables (removed 2) and now considering 104/106 (removed 2) transitions.
// Phase 1: matrix 104 rows 137 cols
[2024-06-01 07:11:56] [INFO ] Computed 49 invariants in 1 ms
[2024-06-01 07:11:56] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-01 07:11:56] [INFO ] Invariant cache hit.
[2024-06-01 07:11:56] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:11:56] [INFO ] Implicit Places using invariants and state equation in 195 ms returned [1, 3, 7, 10, 23, 26, 28, 30, 31, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 56, 58, 60, 62, 64, 66, 68, 70, 78, 80, 82, 84, 86, 121, 125]
Discarding 35 places :
Implicit Place search using SMT with State Equation took 292 ms to find 35 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/139 places, 104/106 transitions.
Graph (complete) has 257 edges and 102 vertex of which 94 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 94 transition count 91
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 85 transition count 91
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 24 place count 80 transition count 84
Iterating global reduction 2 with 5 rules applied. Total rules applied 29 place count 80 transition count 84
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 32 place count 80 transition count 81
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 35 place count 77 transition count 81
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 36 place count 76 transition count 80
Iterating global reduction 4 with 1 rules applied. Total rules applied 37 place count 76 transition count 80
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 54 place count 67 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 56 place count 66 transition count 71
Applied a total of 56 rules in 8 ms. Remains 66 /102 variables (removed 36) and now considering 71/104 (removed 33) transitions.
// Phase 1: matrix 71 rows 66 cols
[2024-06-01 07:11:56] [INFO ] Computed 11 invariants in 1 ms
[2024-06-01 07:11:56] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 07:11:56] [INFO ] Invariant cache hit.
[2024-06-01 07:11:56] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 07:11:56] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 66/139 places, 71/106 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 401 ms. Remains : 66/139 places, 71/106 transitions.
Treatment of property BusinessProcesses-PT-14-LTLCardinality-15 finished in 5585 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' '!(F(G(p0)))'
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((X(p0) U G((p1 U p0))))))'
Found a Lengthening insensitive property : BusinessProcesses-PT-14-LTLCardinality-15
Stuttering acceptance computed with spot in 277 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), true]
Support contains 4 out of 478 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 478/478 places, 390/390 transitions.
Graph (trivial) has 221 edges and 478 vertex of which 6 / 478 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1017 edges and 473 vertex of which 472 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 50 place count 471 transition count 334
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 49 rules applied. Total rules applied 99 place count 423 transition count 333
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 100 place count 422 transition count 333
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 98 Pre rules applied. Total rules applied 100 place count 422 transition count 235
Deduced a syphon composed of 98 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 213 rules applied. Total rules applied 313 place count 307 transition count 235
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 320 place count 300 transition count 228
Iterating global reduction 3 with 7 rules applied. Total rules applied 327 place count 300 transition count 228
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 3 with 263 rules applied. Total rules applied 590 place count 163 transition count 102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 592 place count 162 transition count 106
Applied a total of 592 rules in 33 ms. Remains 162 /478 variables (removed 316) and now considering 106/390 (removed 284) transitions.
// Phase 1: matrix 106 rows 162 cols
[2024-06-01 07:11:57] [INFO ] Computed 72 invariants in 2 ms
[2024-06-01 07:11:57] [INFO ] Implicit Places using invariants in 117 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 20, 21, 22, 23, 24, 25, 43, 44, 45, 46, 47]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 118 ms to find 20 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 142/478 places, 106/390 transitions.
Applied a total of 0 rules in 3 ms. Remains 142 /142 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 154 ms. Remains : 142/478 places, 106/390 transitions.
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-15
Product exploration explored 100000 steps with 26339 reset in 245 ms.
Product exploration explored 100000 steps with 26428 reset in 228 ms.
Computed a total of 12 stabilizing places and 10 stable transitions
Computed a total of 12 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 102 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), true]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (9991 resets) in 236 ms. (168 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (3025 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3098 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
// Phase 1: matrix 106 rows 142 cols
[2024-06-01 07:11:58] [INFO ] Computed 52 invariants in 1 ms
[2024-06-01 07:11:58] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 40/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 64/108 variables, 32/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 31/139 variables, 18/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 105/244 variables, 139/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 5/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3/247 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/247 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/248 variables, and 199 constraints, problems are : Problem set: 0 solved, 2 unsolved in 109 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 142/142 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 40/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 64/108 variables, 32/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 31/139 variables, 18/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 105/244 variables, 139/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 5/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:11:58] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/244 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/247 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:11:58] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 2 ms to minimize.
Problem apf0 is UNSAT
[2024-06-01 07:11:58] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 2/204 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/247 variables, 0/204 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/247 variables, 0/204 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/248 variables, and 204 constraints, problems are : Problem set: 1 solved, 1 unsolved in 346 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 142/142 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 460ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 35 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=35 )
Parikh walk visited 1 properties in 6 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (G (OR p0 p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 162 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 142 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 106/106 transitions.
Applied a total of 0 rules in 3 ms. Remains 142 /142 variables (removed 0) and now considering 106/106 (removed 0) transitions.
[2024-06-01 07:11:59] [INFO ] Invariant cache hit.
[2024-06-01 07:11:59] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-01 07:11:59] [INFO ] Invariant cache hit.
[2024-06-01 07:11:59] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:11:59] [INFO ] Implicit Places using invariants and state equation in 186 ms returned [1, 3, 7, 11, 12, 13, 26, 29, 31, 33, 34, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 59, 61, 63, 65, 67, 69, 71, 73, 81, 83, 85, 87, 89, 113, 126, 130]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 321 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/142 places, 106/106 transitions.
Graph (complete) has 259 edges and 104 vertex of which 98 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 98 transition count 94
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 89 transition count 94
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 24 place count 84 transition count 87
Iterating global reduction 2 with 5 rules applied. Total rules applied 29 place count 84 transition count 87
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 32 place count 84 transition count 84
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 35 place count 81 transition count 84
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 36 place count 80 transition count 83
Iterating global reduction 4 with 1 rules applied. Total rules applied 37 place count 80 transition count 83
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 54 place count 71 transition count 75
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 56 place count 70 transition count 74
Applied a total of 56 rules in 7 ms. Remains 70 /104 variables (removed 34) and now considering 74/106 (removed 32) transitions.
// Phase 1: matrix 74 rows 70 cols
[2024-06-01 07:11:59] [INFO ] Computed 12 invariants in 0 ms
[2024-06-01 07:11:59] [INFO ] Implicit Places using invariants in 42 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 43 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 69/142 places, 74/106 transitions.
Applied a total of 0 rules in 2 ms. Remains 69 /69 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 376 ms. Remains : 69/142 places, 74/106 transitions.
Computed a total of 4 stabilizing places and 5 stable transitions
Graph (complete) has 213 edges and 69 vertex of which 63 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 4 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 14627 steps (3748 resets) in 16 ms. (860 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22374 reset in 101 ms.
Product exploration explored 100000 steps with 22434 reset in 112 ms.
Support contains 2 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 74/74 transitions.
Graph (complete) has 213 edges and 69 vertex of which 67 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 67 transition count 71
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 66 transition count 71
Applied a total of 3 rules in 2 ms. Remains 66 /69 variables (removed 3) and now considering 71/74 (removed 3) transitions.
// Phase 1: matrix 71 rows 66 cols
[2024-06-01 07:12:00] [INFO ] Computed 11 invariants in 2 ms
[2024-06-01 07:12:00] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-01 07:12:00] [INFO ] Invariant cache hit.
[2024-06-01 07:12:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 07:12:00] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2024-06-01 07:12:00] [INFO ] Redundant transitions in 11 ms returned []
Running 66 sub problems to find dead transitions.
[2024-06-01 07:12:00] [INFO ] Invariant cache hit.
[2024-06-01 07:12:00] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 1/66 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Problem TDEAD31 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
At refinement iteration 4 (OVERLAPS) 70/136 variables, 66/77 constraints. Problems are: Problem set: 3 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 3/80 constraints. Problems are: Problem set: 3 solved, 63 unsolved
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 4/84 constraints. Problems are: Problem set: 3 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/84 constraints. Problems are: Problem set: 3 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/136 variables, 0/84 constraints. Problems are: Problem set: 3 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/137 variables, and 84 constraints, problems are : Problem set: 3 solved, 63 unsolved in 1050 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 66/66 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 3 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 6/6 constraints. Problems are: Problem set: 3 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 4/10 constraints. Problems are: Problem set: 3 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 1/66 variables, 5/15 constraints. Problems are: Problem set: 3 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/15 constraints. Problems are: Problem set: 3 solved, 63 unsolved
At refinement iteration 5 (OVERLAPS) 70/136 variables, 66/81 constraints. Problems are: Problem set: 3 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 3/84 constraints. Problems are: Problem set: 3 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 63/147 constraints. Problems are: Problem set: 3 solved, 63 unsolved
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 1/148 constraints. Problems are: Problem set: 3 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 0/148 constraints. Problems are: Problem set: 3 solved, 63 unsolved
At refinement iteration 10 (OVERLAPS) 0/136 variables, 0/148 constraints. Problems are: Problem set: 3 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/137 variables, and 148 constraints, problems are : Problem set: 3 solved, 63 unsolved in 1602 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 66/66 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 63/66 constraints, Known Traps: 5/5 constraints]
After SMT, in 2686ms problems are : Problem set: 3 solved, 63 unsolved
Search for dead transitions found 3 dead transitions in 2687ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 66/69 places, 68/74 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2024-06-01 07:12:02] [INFO ] Redundant transitions in 13 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 2923 ms. Remains : 66/69 places, 68/74 transitions.
Treatment of property BusinessProcesses-PT-14-LTLCardinality-15 finished in 6281 ms.
[2024-06-01 07:12:03] [INFO ] Flatten gal took : 35 ms
[2024-06-01 07:12:03] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-01 07:12:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 478 places, 390 transitions and 1172 arcs took 7 ms.
Total runtime 92614 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA BusinessProcesses-PT-14-LTLCardinality-12 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-14-LTLCardinality-15 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717226495210

--------------------
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
mcc2024
ltl formula name BusinessProcesses-PT-14-LTLCardinality-12
ltl formula formula --ltl=/tmp/2241/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 478 places, 390 transitions and 1172 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.010 user 0.030 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2241/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2241/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2241/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2241/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 479 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 479, there are 410 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~138 levels ~10000 states ~99972 transitions
pnml2lts-mc( 1/ 4): ~138 levels ~20000 states ~212748 transitions
pnml2lts-mc( 1/ 4): ~138 levels ~40000 states ~466828 transitions
pnml2lts-mc( 1/ 4): ~138 levels ~80000 states ~986996 transitions
pnml2lts-mc( 1/ 4): ~138 levels ~160000 states ~2113164 transitions
pnml2lts-mc( 1/ 4): ~138 levels ~320000 states ~4548540 transitions
pnml2lts-mc( 1/ 4): ~138 levels ~640000 states ~9746300 transitions
pnml2lts-mc( 1/ 4): ~138 levels ~1280000 states ~20772852 transitions
pnml2lts-mc( 1/ 4): ~138 levels ~2560000 states ~42859588 transitions
pnml2lts-mc( 2/ 4): ~135 levels ~5120000 states ~81272812 transitions
pnml2lts-mc( 2/ 4): ~135 levels ~10240000 states ~170924748 transitions
pnml2lts-mc( 2/ 4): ~135 levels ~20480000 states ~356780308 transitions
pnml2lts-mc( 2/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33552176
pnml2lts-mc( 0/ 4): unique states count: 33552645
pnml2lts-mc( 0/ 4): unique transitions count: 589622740
pnml2lts-mc( 0/ 4): - self-loop count: 6
pnml2lts-mc( 0/ 4): - claim dead count: 556067461
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33552655
pnml2lts-mc( 0/ 4): - cum. max stack depth: 548
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33552655 states 589622766 transitions, fanout: 17.573
pnml2lts-mc( 0/ 4): Total exploration time 316.610 sec (316.590 sec minimum, 316.598 sec on average)
pnml2lts-mc( 0/ 4): States per second: 105975, Transitions per second: 1862300
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 269.8MB, 8.4 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/21.0%
pnml2lts-mc( 0/ 4): Stored 393 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 269.8MB (~256.0MB paged-in)
ltl formula name BusinessProcesses-PT-14-LTLCardinality-15
ltl formula formula --ltl=/tmp/2241/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 478 places, 390 transitions and 1172 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.010 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2241/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2241/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2241/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2241/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 479 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 479, there are 529 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~140 levels ~10000 states ~62968 transitions
pnml2lts-mc( 2/ 4): ~140 levels ~20000 states ~136024 transitions
pnml2lts-mc( 2/ 4): ~140 levels ~40000 states ~300472 transitions
pnml2lts-mc( 2/ 4): ~140 levels ~80000 states ~661096 transitions
pnml2lts-mc( 2/ 4): ~140 levels ~160000 states ~1389400 transitions
pnml2lts-mc( 2/ 4): ~140 levels ~320000 states ~3018748 transitions
pnml2lts-mc( 3/ 4): ~1284 levels ~640000 states ~4781416 transitions
pnml2lts-mc( 3/ 4): ~1284 levels ~1280000 states ~10444600 transitions
pnml2lts-mc( 3/ 4): ~1284 levels ~2560000 states ~23385704 transitions
pnml2lts-mc( 3/ 4): ~1284 levels ~5120000 states ~48447264 transitions
pnml2lts-mc( 3/ 4): ~1284 levels ~10240000 states ~104426360 transitions
pnml2lts-mc( 3/ 4): ~1284 levels ~20480000 states ~221897836 transitions
pnml2lts-mc( 2/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 31269079
pnml2lts-mc( 0/ 4): unique states count: 33549132
pnml2lts-mc( 0/ 4): unique transitions count: 434015150
pnml2lts-mc( 0/ 4): - self-loop count: 114
pnml2lts-mc( 0/ 4): - claim dead count: 397410704
pnml2lts-mc( 0/ 4): - claim found count: 3044455
pnml2lts-mc( 0/ 4): - claim success count: 33549142
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1698
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33549142 states 434015192 transitions, fanout: 12.937
pnml2lts-mc( 0/ 4): Total exploration time 254.130 sec (254.120 sec minimum, 254.125 sec on average)
pnml2lts-mc( 0/ 4): States per second: 132016, Transitions per second: 1707847
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 261.9MB, 8.2 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/9.0%
pnml2lts-mc( 0/ 4): Stored 393 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 261.9MB (~256.0MB paged-in)

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

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