Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 11 16:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 16:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 11 16:29 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 192K 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-20-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716309318167

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 16:35:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 16:35:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 16:35:20] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2024-05-21 16:35:20] [INFO ] Transformed 782 places.
[2024-05-21 16:35:20] [INFO ] Transformed 697 transitions.
[2024-05-21 16:35:20] [INFO ] Found NUPN structural information;
[2024-05-21 16:35:20] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 232 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 63 places in 13 ms
Reduce places removed 63 places and 59 transitions.
FORMULA BusinessProcesses-PT-20-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 719 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 719/719 places, 638/638 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 705 transition count 638
Discarding 104 places :
Symmetric choice reduction at 1 with 104 rule applications. Total rules 118 place count 601 transition count 534
Iterating global reduction 1 with 104 rules applied. Total rules applied 222 place count 601 transition count 534
Discarding 54 places :
Symmetric choice reduction at 1 with 54 rule applications. Total rules 276 place count 547 transition count 480
Iterating global reduction 1 with 54 rules applied. Total rules applied 330 place count 547 transition count 480
Applied a total of 330 rules in 141 ms. Remains 547 /719 variables (removed 172) and now considering 480/638 (removed 158) transitions.
// Phase 1: matrix 480 rows 547 cols
[2024-05-21 16:35:20] [INFO ] Computed 107 invariants in 55 ms
[2024-05-21 16:35:21] [INFO ] Implicit Places using invariants in 535 ms returned []
[2024-05-21 16:35:21] [INFO ] Invariant cache hit.
[2024-05-21 16:35:21] [INFO ] Implicit Places using invariants and state equation in 740 ms returned []
Implicit Place search using SMT with State Equation took 1325 ms to find 0 implicit places.
Running 479 sub problems to find dead transitions.
[2024-05-21 16:35:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 2 (OVERLAPS) 1/547 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/547 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-21 16:35:36] [INFO ] Deduced a trap composed of 74 places in 2191 ms of which 28 ms to minimize.
[2024-05-21 16:35:37] [INFO ] Deduced a trap composed of 73 places in 184 ms of which 6 ms to minimize.
[2024-05-21 16:35:37] [INFO ] Deduced a trap composed of 94 places in 333 ms of which 12 ms to minimize.
[2024-05-21 16:35:37] [INFO ] Deduced a trap composed of 96 places in 222 ms of which 3 ms to minimize.
[2024-05-21 16:35:37] [INFO ] Deduced a trap composed of 75 places in 237 ms of which 20 ms to minimize.
[2024-05-21 16:35:38] [INFO ] Deduced a trap composed of 72 places in 200 ms of which 4 ms to minimize.
[2024-05-21 16:35:39] [INFO ] Deduced a trap composed of 92 places in 1240 ms of which 3 ms to minimize.
[2024-05-21 16:35:39] [INFO ] Deduced a trap composed of 72 places in 168 ms of which 2 ms to minimize.
[2024-05-21 16:35:39] [INFO ] Deduced a trap composed of 89 places in 180 ms of which 5 ms to minimize.
[2024-05-21 16:35:39] [INFO ] Deduced a trap composed of 86 places in 190 ms of which 5 ms to minimize.
[2024-05-21 16:35:40] [INFO ] Deduced a trap composed of 92 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:35:40] [INFO ] Deduced a trap composed of 96 places in 200 ms of which 5 ms to minimize.
[2024-05-21 16:35:40] [INFO ] Deduced a trap composed of 100 places in 180 ms of which 7 ms to minimize.
[2024-05-21 16:35:40] [INFO ] Deduced a trap composed of 93 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:35:40] [INFO ] Deduced a trap composed of 93 places in 195 ms of which 4 ms to minimize.
[2024-05-21 16:35:41] [INFO ] Deduced a trap composed of 89 places in 197 ms of which 5 ms to minimize.
[2024-05-21 16:35:41] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:35:41] [INFO ] Deduced a trap composed of 100 places in 129 ms of which 2 ms to minimize.
[2024-05-21 16:35:41] [INFO ] Deduced a trap composed of 100 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:35:41] [INFO ] Deduced a trap composed of 101 places in 120 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/547 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-21 16:35:41] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-21 16:35:41] [INFO ] Deduced a trap composed of 99 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:35:42] [INFO ] Deduced a trap composed of 74 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:35:42] [INFO ] Deduced a trap composed of 75 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:35:42] [INFO ] Deduced a trap composed of 71 places in 108 ms of which 3 ms to minimize.
[2024-05-21 16:35:42] [INFO ] Deduced a trap composed of 92 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:35:42] [INFO ] Deduced a trap composed of 92 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:35:42] [INFO ] Deduced a trap composed of 95 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:35:42] [INFO ] Deduced a trap composed of 90 places in 154 ms of which 3 ms to minimize.
[2024-05-21 16:35:42] [INFO ] Deduced a trap composed of 91 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:35:43] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 17 ms to minimize.
[2024-05-21 16:35:43] [INFO ] Deduced a trap composed of 88 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:35:43] [INFO ] Deduced a trap composed of 98 places in 166 ms of which 3 ms to minimize.
[2024-05-21 16:35:43] [INFO ] Deduced a trap composed of 100 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:35:43] [INFO ] Deduced a trap composed of 96 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:35:43] [INFO ] Deduced a trap composed of 94 places in 160 ms of which 3 ms to minimize.
[2024-05-21 16:35:44] [INFO ] Deduced a trap composed of 90 places in 156 ms of which 3 ms to minimize.
[2024-05-21 16:35:44] [INFO ] Deduced a trap composed of 92 places in 144 ms of which 2 ms to minimize.
[2024-05-21 16:35:44] [INFO ] Deduced a trap composed of 100 places in 102 ms of which 3 ms to minimize.
[2024-05-21 16:35:44] [INFO ] Deduced a trap composed of 98 places in 153 ms of which 2 ms to minimize.
Problem TDEAD467 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 20/147 constraints. Problems are: Problem set: 1 solved, 478 unsolved
[2024-05-21 16:35:44] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:35:44] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:35:45] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:35:45] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:35:45] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:35:45] [INFO ] Deduced a trap composed of 101 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:35:45] [INFO ] Deduced a trap composed of 104 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:35:45] [INFO ] Deduced a trap composed of 91 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:35:45] [INFO ] Deduced a trap composed of 105 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:35:46] [INFO ] Deduced a trap composed of 104 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:35:46] [INFO ] Deduced a trap composed of 95 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:35:46] [INFO ] Deduced a trap composed of 90 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:35:46] [INFO ] Deduced a trap composed of 103 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:35:46] [INFO ] Deduced a trap composed of 96 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:35:46] [INFO ] Deduced a trap composed of 88 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:35:46] [INFO ] Deduced a trap composed of 91 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:35:46] [INFO ] Deduced a trap composed of 100 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:35:47] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:35:47] [INFO ] Deduced a trap composed of 90 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:35:47] [INFO ] Deduced a trap composed of 100 places in 116 ms of which 3 ms to minimize.
Problem TDEAD442 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 20/167 constraints. Problems are: Problem set: 2 solved, 477 unsolved
[2024-05-21 16:35:51] [INFO ] Deduced a trap composed of 102 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:35:51] [INFO ] Deduced a trap composed of 102 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:35:51] [INFO ] Deduced a trap composed of 101 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:35:51] [INFO ] Deduced a trap composed of 98 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:35:51] [INFO ] Deduced a trap composed of 90 places in 95 ms of which 3 ms to minimize.
[2024-05-21 16:35:51] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:35:51] [INFO ] Deduced a trap composed of 96 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:35:52] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:35:52] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 2 ms to minimize.
SMT process timed out in 30267ms, After SMT, problems are : Problem set: 2 solved, 477 unsolved
Search for dead transitions found 2 dead transitions in 30288ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 547/719 places, 478/638 transitions.
Applied a total of 0 rules in 12 ms. Remains 547 /547 variables (removed 0) and now considering 478/478 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31819 ms. Remains : 547/719 places, 478/638 transitions.
Support contains 18 out of 547 places after structural reductions.
[2024-05-21 16:35:52] [INFO ] Flatten gal took : 85 ms
[2024-05-21 16:35:52] [INFO ] Flatten gal took : 51 ms
[2024-05-21 16:35:52] [INFO ] Input system was already deterministic with 478 transitions.
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 40000 steps (200 resets) in 2011 ms. (19 steps per ms) remains 7/11 properties
BEST_FIRST walk for 40004 steps (37 resets) in 122 ms. (325 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (46 resets) in 248 ms. (160 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (35 resets) in 139 ms. (285 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (36 resets) in 223 ms. (178 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (37 resets) in 124 ms. (320 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (35 resets) in 101 ms. (392 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (35 resets) in 74 ms. (533 steps per ms) remains 6/7 properties
// Phase 1: matrix 478 rows 547 cols
[2024-05-21 16:35:54] [INFO ] Computed 107 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 166/176 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 236/412 variables, 59/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 125/537 variables, 40/104 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 3/540 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 473/1013 variables, 540/647 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1013 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 11/1024 variables, 6/653 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1024 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 1/1025 variables, 1/654 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1025 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/1025 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1025/1025 variables, and 654 constraints, problems are : Problem set: 0 solved, 6 unsolved in 676 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 547/547 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 166/176 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 16:35:55] [INFO ] Deduced a trap composed of 69 places in 88 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 236/412 variables, 59/65 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 16:35:55] [INFO ] Deduced a trap composed of 82 places in 147 ms of which 2 ms to minimize.
[2024-05-21 16:35:55] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 1 ms to minimize.
[2024-05-21 16:35:55] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2024-05-21 16:35:55] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 1 ms to minimize.
[2024-05-21 16:35:55] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 0 ms to minimize.
[2024-05-21 16:35:55] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 0 ms to minimize.
[2024-05-21 16:35:55] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-21 16:35:55] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 0 ms to minimize.
[2024-05-21 16:35:56] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
[2024-05-21 16:35:56] [INFO ] Deduced a trap composed of 82 places in 192 ms of which 2 ms to minimize.
[2024-05-21 16:35:56] [INFO ] Deduced a trap composed of 82 places in 162 ms of which 2 ms to minimize.
[2024-05-21 16:35:56] [INFO ] Deduced a trap composed of 85 places in 129 ms of which 2 ms to minimize.
[2024-05-21 16:35:56] [INFO ] Deduced a trap composed of 86 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:35:56] [INFO ] Deduced a trap composed of 81 places in 159 ms of which 2 ms to minimize.
[2024-05-21 16:35:57] [INFO ] Deduced a trap composed of 85 places in 84 ms of which 2 ms to minimize.
[2024-05-21 16:35:57] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:35:57] [INFO ] Deduced a trap composed of 82 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:35:57] [INFO ] Deduced a trap composed of 82 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:35:57] [INFO ] Deduced a trap composed of 82 places in 159 ms of which 2 ms to minimize.
[2024-05-21 16:35:57] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 16:35:57] [INFO ] Deduced a trap composed of 95 places in 150 ms of which 2 ms to minimize.
[2024-05-21 16:35:58] [INFO ] Deduced a trap composed of 85 places in 122 ms of which 1 ms to minimize.
[2024-05-21 16:35:58] [INFO ] Deduced a trap composed of 83 places in 81 ms of which 2 ms to minimize.
[2024-05-21 16:35:58] [INFO ] Deduced a trap composed of 104 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:35:58] [INFO ] Deduced a trap composed of 82 places in 89 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 5/90 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 8 (OVERLAPS) 125/537 variables, 40/130 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-21 16:35:58] [INFO ] Deduced a trap composed of 46 places in 143 ms of which 2 ms to minimize.
[2024-05-21 16:35:58] [INFO ] Deduced a trap composed of 46 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:35:58] [INFO ] Deduced a trap composed of 95 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:35:58] [INFO ] Deduced a trap composed of 43 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:35:59] [INFO ] Deduced a trap composed of 99 places in 122 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/537 variables, 5/135 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/537 variables, 0/135 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 3/540 variables, 3/138 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 0/138 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 473/1013 variables, 540/678 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1013 variables, 5/683 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-21 16:35:59] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:35:59] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:35:59] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:35:59] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 2 ms to minimize.
SMT process timed out in 5737ms, After SMT, problems are : Problem set: 1 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 547 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 547/547 places, 478/478 transitions.
Graph (trivial) has 256 edges and 547 vertex of which 6 / 547 are part of one of the 1 SCC in 12 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 1211 edges and 542 vertex of which 540 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 72 place count 540 transition count 399
Reduce places removed 70 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 71 rules applied. Total rules applied 143 place count 470 transition count 398
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 144 place count 469 transition count 398
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 144 place count 469 transition count 288
Deduced a syphon composed of 110 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 3 with 242 rules applied. Total rules applied 386 place count 337 transition count 288
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 391 place count 332 transition count 283
Iterating global reduction 3 with 5 rules applied. Total rules applied 396 place count 332 transition count 283
Performed 139 Post agglomeration using F-continuation condition.Transition count delta: 139
Deduced a syphon composed of 139 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 3 with 282 rules applied. Total rules applied 678 place count 189 transition count 144
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 682 place count 187 transition count 151
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 684 place count 187 transition count 149
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 686 place count 185 transition count 149
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 691 place count 185 transition count 149
Applied a total of 691 rules in 137 ms. Remains 185 /547 variables (removed 362) and now considering 149/478 (removed 329) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 185/547 places, 149/478 transitions.
RANDOM walk for 40000 steps (2038 resets) in 714 ms. (55 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40001 steps (789 resets) in 260 ms. (153 steps per ms) remains 1/1 properties
[2024-05-21 16:36:00] [INFO ] Flow matrix only has 148 transitions (discarded 1 similar events)
// Phase 1: matrix 148 rows 185 cols
[2024-05-21 16:36:00] [INFO ] Computed 81 invariants in 2 ms
[2024-05-21 16:36:00] [INFO ] State equation strengthened by 15 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 141/146 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/180 variables, 15/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/183 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 148/331 variables, 183/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/331 variables, 15/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/331 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/333 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/333 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/333 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 333/333 variables, and 281 constraints, problems are : Problem set: 0 solved, 1 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 185/185 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 141/146 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/180 variables, 15/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/183 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 148/331 variables, 183/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/331 variables, 15/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/331 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/331 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/333 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/333 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/333 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 333/333 variables, and 282 constraints, problems are : Problem set: 0 solved, 1 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 185/185 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 379ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 21 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=21 )
Parikh walk visited 1 properties in 5 ms.
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
FORMULA BusinessProcesses-PT-20-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 478 stabilizing places and 419 stable transitions
Graph (complete) has 1218 edges and 547 vertex of which 545 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.33 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 547 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 547/547 places, 478/478 transitions.
Graph (trivial) has 261 edges and 547 vertex of which 6 / 547 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 1212 edges and 542 vertex of which 540 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 539 transition count 397
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 467 transition count 397
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 146 place count 467 transition count 286
Deduced a syphon composed of 111 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 390 place count 334 transition count 286
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 397 place count 327 transition count 279
Iterating global reduction 2 with 7 rules applied. Total rules applied 404 place count 327 transition count 279
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 404 place count 327 transition count 278
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 406 place count 326 transition count 278
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 284 rules applied. Total rules applied 690 place count 182 transition count 138
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 694 place count 180 transition count 145
Applied a total of 694 rules in 123 ms. Remains 180 /547 variables (removed 367) and now considering 145/478 (removed 333) transitions.
[2024-05-21 16:36:01] [INFO ] Flow matrix only has 144 transitions (discarded 1 similar events)
// Phase 1: matrix 144 rows 180 cols
[2024-05-21 16:36:01] [INFO ] Computed 81 invariants in 3 ms
[2024-05-21 16:36:01] [INFO ] Implicit Places using invariants in 378 ms returned [27, 28, 29, 30, 31, 36, 37, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 384 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/547 places, 145/478 transitions.
Applied a total of 0 rules in 28 ms. Remains 156 /156 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 535 ms. Remains : 156/547 places, 145/478 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLCardinality-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-20-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLCardinality-02 finished in 831 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U X(X(G(p1)))) U (F(p3)||p2))))'
Support contains 5 out of 547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 478/478 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 543 transition count 474
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 543 transition count 474
Applied a total of 8 rules in 18 ms. Remains 543 /547 variables (removed 4) and now considering 474/478 (removed 4) transitions.
// Phase 1: matrix 474 rows 543 cols
[2024-05-21 16:36:01] [INFO ] Computed 107 invariants in 6 ms
[2024-05-21 16:36:02] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-05-21 16:36:02] [INFO ] Invariant cache hit.
[2024-05-21 16:36:02] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 795 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2024-05-21 16:36:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/542 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/542 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 1/543 variables, 64/105 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/543 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 473 unsolved
[2024-05-21 16:36:13] [INFO ] Deduced a trap composed of 72 places in 142 ms of which 4 ms to minimize.
[2024-05-21 16:36:13] [INFO ] Deduced a trap composed of 88 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:36:13] [INFO ] Deduced a trap composed of 83 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:36:13] [INFO ] Deduced a trap composed of 85 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:36:13] [INFO ] Deduced a trap composed of 89 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:36:13] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:36:13] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:36:13] [INFO ] Deduced a trap composed of 84 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:36:14] [INFO ] Deduced a trap composed of 88 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:36:14] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:36:14] [INFO ] Deduced a trap composed of 83 places in 166 ms of which 4 ms to minimize.
[2024-05-21 16:36:14] [INFO ] Deduced a trap composed of 87 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:36:14] [INFO ] Deduced a trap composed of 83 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:36:14] [INFO ] Deduced a trap composed of 86 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:36:14] [INFO ] Deduced a trap composed of 87 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:36:15] [INFO ] Deduced a trap composed of 95 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:36:15] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:36:15] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:36:15] [INFO ] Deduced a trap composed of 88 places in 103 ms of which 3 ms to minimize.
[2024-05-21 16:36:15] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 3 ms to minimize.
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD430 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/543 variables, 20/127 constraints. Problems are: Problem set: 3 solved, 470 unsolved
[2024-05-21 16:36:15] [INFO ] Deduced a trap composed of 72 places in 138 ms of which 2 ms to minimize.
[2024-05-21 16:36:16] [INFO ] Deduced a trap composed of 86 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:36:16] [INFO ] Deduced a trap composed of 72 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:36:16] [INFO ] Deduced a trap composed of 84 places in 151 ms of which 5 ms to minimize.
[2024-05-21 16:36:16] [INFO ] Deduced a trap composed of 84 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:36:16] [INFO ] Deduced a trap composed of 74 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:36:16] [INFO ] Deduced a trap composed of 75 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:36:16] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:36:17] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:36:17] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:36:17] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:36:17] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:36:17] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:36:17] [INFO ] Deduced a trap composed of 91 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:36:17] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:36:17] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:36:18] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:36:18] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 4 ms to minimize.
[2024-05-21 16:36:18] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 3 ms to minimize.
[2024-05-21 16:36:18] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 2 ms to minimize.
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/543 variables, 20/147 constraints. Problems are: Problem set: 6 solved, 467 unsolved
[2024-05-21 16:36:18] [INFO ] Deduced a trap composed of 57 places in 30 ms of which 0 ms to minimize.
[2024-05-21 16:36:18] [INFO ] Deduced a trap composed of 99 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:36:18] [INFO ] Deduced a trap composed of 102 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:36:19] [INFO ] Deduced a trap composed of 94 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:36:19] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 1 ms to minimize.
[2024-05-21 16:36:19] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 2 ms to minimize.
[2024-05-21 16:36:19] [INFO ] Deduced a trap composed of 96 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:36:19] [INFO ] Deduced a trap composed of 79 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:36:19] [INFO ] Deduced a trap composed of 99 places in 142 ms of which 2 ms to minimize.
[2024-05-21 16:36:19] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-05-21 16:36:19] [INFO ] Deduced a trap composed of 60 places in 47 ms of which 1 ms to minimize.
[2024-05-21 16:36:19] [INFO ] Deduced a trap composed of 77 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:36:20] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 3 ms to minimize.
[2024-05-21 16:36:20] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:36:20] [INFO ] Deduced a trap composed of 85 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:36:20] [INFO ] Deduced a trap composed of 74 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:36:20] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:36:20] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 3 ms to minimize.
[2024-05-21 16:36:21] [INFO ] Deduced a trap composed of 90 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:36:21] [INFO ] Deduced a trap composed of 91 places in 124 ms of which 2 ms to minimize.
Problem TDEAD423 is UNSAT
Problem TDEAD440 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/543 variables, 20/167 constraints. Problems are: Problem set: 8 solved, 465 unsolved
[2024-05-21 16:36:25] [INFO ] Deduced a trap composed of 94 places in 128 ms of which 2 ms to minimize.
[2024-05-21 16:36:25] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:36:25] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:36:25] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:36:25] [INFO ] Deduced a trap composed of 96 places in 128 ms of which 2 ms to minimize.
[2024-05-21 16:36:25] [INFO ] Deduced a trap composed of 93 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:36:26] [INFO ] Deduced a trap composed of 92 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:36:26] [INFO ] Deduced a trap composed of 72 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:36:26] [INFO ] Deduced a trap composed of 100 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:36:26] [INFO ] Deduced a trap composed of 96 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:36:26] [INFO ] Deduced a trap composed of 95 places in 141 ms of which 2 ms to minimize.
[2024-05-21 16:36:26] [INFO ] Deduced a trap composed of 100 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:36:27] [INFO ] Deduced a trap composed of 93 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:36:27] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:36:27] [INFO ] Deduced a trap composed of 68 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:36:27] [INFO ] Deduced a trap composed of 92 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:36:27] [INFO ] Deduced a trap composed of 79 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:36:27] [INFO ] Deduced a trap composed of 93 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:36:27] [INFO ] Deduced a trap composed of 92 places in 136 ms of which 2 ms to minimize.
[2024-05-21 16:36:28] [INFO ] Deduced a trap composed of 95 places in 141 ms of which 2 ms to minimize.
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD442 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/543 variables, 20/187 constraints. Problems are: Problem set: 15 solved, 458 unsolved
[2024-05-21 16:36:28] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:36:28] [INFO ] Deduced a trap composed of 95 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:36:28] [INFO ] Deduced a trap composed of 71 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:36:28] [INFO ] Deduced a trap composed of 87 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:36:29] [INFO ] Deduced a trap composed of 95 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:36:29] [INFO ] Deduced a trap composed of 88 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:36:29] [INFO ] Deduced a trap composed of 94 places in 148 ms of which 2 ms to minimize.
[2024-05-21 16:36:29] [INFO ] Deduced a trap composed of 77 places in 140 ms of which 2 ms to minimize.
[2024-05-21 16:36:30] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:36:30] [INFO ] Deduced a trap composed of 85 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:36:30] [INFO ] Deduced a trap composed of 95 places in 110 ms of which 3 ms to minimize.
[2024-05-21 16:36:30] [INFO ] Deduced a trap composed of 94 places in 128 ms of which 2 ms to minimize.
[2024-05-21 16:36:30] [INFO ] Deduced a trap composed of 95 places in 134 ms of which 2 ms to minimize.
[2024-05-21 16:36:30] [INFO ] Deduced a trap composed of 93 places in 139 ms of which 2 ms to minimize.
[2024-05-21 16:36:30] [INFO ] Deduced a trap composed of 95 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:36:31] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:36:31] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-05-21 16:36:31] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 2 ms to minimize.
[2024-05-21 16:36:32] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:36:32] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 2 ms to minimize.
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 20/207 constraints. Problems are: Problem set: 26 solved, 447 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 543/1017 variables, and 207 constraints, problems are : Problem set: 26 solved, 447 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/543 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 26 solved, 447 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/542 variables, 41/41 constraints. Problems are: Problem set: 26 solved, 447 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/542 variables, 0/41 constraints. Problems are: Problem set: 26 solved, 447 unsolved
At refinement iteration 2 (OVERLAPS) 1/543 variables, 64/105 constraints. Problems are: Problem set: 26 solved, 447 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/543 variables, 2/107 constraints. Problems are: Problem set: 26 solved, 447 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/543 variables, 100/207 constraints. Problems are: Problem set: 26 solved, 447 unsolved
[2024-05-21 16:36:36] [INFO ] Deduced a trap composed of 30 places in 21 ms of which 1 ms to minimize.
[2024-05-21 16:36:36] [INFO ] Deduced a trap composed of 75 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:36:37] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 2 ms to minimize.
[2024-05-21 16:36:37] [INFO ] Deduced a trap composed of 92 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:36:37] [INFO ] Deduced a trap composed of 74 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:36:37] [INFO ] Deduced a trap composed of 74 places in 164 ms of which 5 ms to minimize.
[2024-05-21 16:36:37] [INFO ] Deduced a trap composed of 87 places in 184 ms of which 2 ms to minimize.
[2024-05-21 16:36:37] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:36:38] [INFO ] Deduced a trap composed of 95 places in 152 ms of which 2 ms to minimize.
[2024-05-21 16:36:38] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:36:38] [INFO ] Deduced a trap composed of 88 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:36:38] [INFO ] Deduced a trap composed of 89 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:36:38] [INFO ] Deduced a trap composed of 94 places in 143 ms of which 2 ms to minimize.
[2024-05-21 16:36:38] [INFO ] Deduced a trap composed of 91 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:36:38] [INFO ] Deduced a trap composed of 89 places in 136 ms of which 2 ms to minimize.
[2024-05-21 16:36:38] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 3 ms to minimize.
[2024-05-21 16:36:39] [INFO ] Deduced a trap composed of 95 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:36:39] [INFO ] Deduced a trap composed of 98 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:36:39] [INFO ] Deduced a trap composed of 95 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:36:39] [INFO ] Deduced a trap composed of 93 places in 148 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/543 variables, 20/227 constraints. Problems are: Problem set: 26 solved, 447 unsolved
[2024-05-21 16:36:40] [INFO ] Deduced a trap composed of 91 places in 166 ms of which 3 ms to minimize.
[2024-05-21 16:36:40] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:36:40] [INFO ] Deduced a trap composed of 94 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:36:40] [INFO ] Deduced a trap composed of 91 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:36:40] [INFO ] Deduced a trap composed of 93 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:36:40] [INFO ] Deduced a trap composed of 89 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:36:41] [INFO ] Deduced a trap composed of 95 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:36:41] [INFO ] Deduced a trap composed of 90 places in 119 ms of which 4 ms to minimize.
[2024-05-21 16:36:41] [INFO ] Deduced a trap composed of 96 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:36:41] [INFO ] Deduced a trap composed of 94 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:36:41] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:36:41] [INFO ] Deduced a trap composed of 92 places in 175 ms of which 2 ms to minimize.
[2024-05-21 16:36:42] [INFO ] Deduced a trap composed of 93 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:36:42] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 3 ms to minimize.
[2024-05-21 16:36:42] [INFO ] Deduced a trap composed of 98 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:36:42] [INFO ] Deduced a trap composed of 93 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:36:42] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:36:42] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:36:42] [INFO ] Deduced a trap composed of 98 places in 150 ms of which 2 ms to minimize.
[2024-05-21 16:36:43] [INFO ] Deduced a trap composed of 93 places in 128 ms of which 2 ms to minimize.
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/543 variables, 20/247 constraints. Problems are: Problem set: 28 solved, 445 unsolved
[2024-05-21 16:36:43] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:36:43] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:36:43] [INFO ] Deduced a trap composed of 85 places in 132 ms of which 2 ms to minimize.
[2024-05-21 16:36:44] [INFO ] Deduced a trap composed of 89 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:36:44] [INFO ] Deduced a trap composed of 84 places in 153 ms of which 4 ms to minimize.
[2024-05-21 16:36:44] [INFO ] Deduced a trap composed of 88 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:36:44] [INFO ] Deduced a trap composed of 87 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:36:44] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:36:44] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:36:45] [INFO ] Deduced a trap composed of 93 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:36:45] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:36:45] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 17 ms to minimize.
[2024-05-21 16:36:45] [INFO ] Deduced a trap composed of 92 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:36:45] [INFO ] Deduced a trap composed of 91 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:36:45] [INFO ] Deduced a trap composed of 98 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:36:45] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-21 16:36:45] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-21 16:36:46] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:36:46] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:36:46] [INFO ] Deduced a trap composed of 58 places in 66 ms of which 1 ms to minimize.
Problem TDEAD422 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD448 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/543 variables, 20/267 constraints. Problems are: Problem set: 31 solved, 442 unsolved
[2024-05-21 16:36:47] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2024-05-21 16:36:47] [INFO ] Deduced a trap composed of 74 places in 148 ms of which 2 ms to minimize.
[2024-05-21 16:36:47] [INFO ] Deduced a trap composed of 71 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:36:47] [INFO ] Deduced a trap composed of 74 places in 128 ms of which 2 ms to minimize.
[2024-05-21 16:36:48] [INFO ] Deduced a trap composed of 70 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:36:48] [INFO ] Deduced a trap composed of 70 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:36:48] [INFO ] Deduced a trap composed of 95 places in 135 ms of which 4 ms to minimize.
[2024-05-21 16:36:48] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 1 ms to minimize.
[2024-05-21 16:36:49] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-21 16:36:49] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:36:49] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-05-21 16:36:49] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:36:49] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:36:49] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 1 ms to minimize.
[2024-05-21 16:36:50] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 3 ms to minimize.
[2024-05-21 16:36:50] [INFO ] Deduced a trap composed of 89 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:36:50] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:36:50] [INFO ] Deduced a trap composed of 89 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:36:50] [INFO ] Deduced a trap composed of 90 places in 129 ms of which 2 ms to minimize.
[2024-05-21 16:36:51] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 20/287 constraints. Problems are: Problem set: 31 solved, 442 unsolved
[2024-05-21 16:36:51] [INFO ] Deduced a trap composed of 93 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:36:52] [INFO ] Deduced a trap composed of 93 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:36:52] [INFO ] Deduced a trap composed of 62 places in 110 ms of which 1 ms to minimize.
[2024-05-21 16:36:52] [INFO ] Deduced a trap composed of 100 places in 189 ms of which 2 ms to minimize.
[2024-05-21 16:36:53] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-05-21 16:36:54] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:36:54] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:36:54] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:36:54] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:36:54] [INFO ] Deduced a trap composed of 53 places in 129 ms of which 2 ms to minimize.
[2024-05-21 16:36:54] [INFO ] Deduced a trap composed of 50 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:36:55] [INFO ] Deduced a trap composed of 18 places in 153 ms of which 2 ms to minimize.
[2024-05-21 16:36:55] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 2 ms to minimize.
[2024-05-21 16:36:55] [INFO ] Deduced a trap composed of 52 places in 133 ms of which 2 ms to minimize.
[2024-05-21 16:36:55] [INFO ] Deduced a trap composed of 45 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:36:55] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:36:55] [INFO ] Deduced a trap composed of 47 places in 170 ms of which 16 ms to minimize.
[2024-05-21 16:36:56] [INFO ] Deduced a trap composed of 65 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:36:56] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:36:56] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/543 variables, 20/307 constraints. Problems are: Problem set: 31 solved, 442 unsolved
[2024-05-21 16:36:56] [INFO ] Deduced a trap composed of 89 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:36:57] [INFO ] Deduced a trap composed of 95 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:36:57] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:36:57] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:36:57] [INFO ] Deduced a trap composed of 100 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:36:57] [INFO ] Deduced a trap composed of 89 places in 129 ms of which 2 ms to minimize.
[2024-05-21 16:36:57] [INFO ] Deduced a trap composed of 89 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:36:57] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:36:57] [INFO ] Deduced a trap composed of 96 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:36:58] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:36:58] [INFO ] Deduced a trap composed of 99 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:36:58] [INFO ] Deduced a trap composed of 92 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:36:58] [INFO ] Deduced a trap composed of 91 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:36:58] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:36:58] [INFO ] Deduced a trap composed of 96 places in 153 ms of which 2 ms to minimize.
[2024-05-21 16:36:58] [INFO ] Deduced a trap composed of 94 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:36:59] [INFO ] Deduced a trap composed of 93 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:36:59] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:36:59] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:36:59] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/543 variables, 20/327 constraints. Problems are: Problem set: 31 solved, 442 unsolved
[2024-05-21 16:37:00] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:37:00] [INFO ] Deduced a trap composed of 94 places in 136 ms of which 2 ms to minimize.
[2024-05-21 16:37:00] [INFO ] Deduced a trap composed of 99 places in 142 ms of which 2 ms to minimize.
[2024-05-21 16:37:00] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:37:00] [INFO ] Deduced a trap composed of 96 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:37:00] [INFO ] Deduced a trap composed of 94 places in 150 ms of which 2 ms to minimize.
[2024-05-21 16:37:00] [INFO ] Deduced a trap composed of 91 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:37:01] [INFO ] Deduced a trap composed of 110 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:37:01] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 2 ms to minimize.
[2024-05-21 16:37:01] [INFO ] Deduced a trap composed of 94 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:37:01] [INFO ] Deduced a trap composed of 92 places in 140 ms of which 2 ms to minimize.
[2024-05-21 16:37:01] [INFO ] Deduced a trap composed of 90 places in 128 ms of which 2 ms to minimize.
[2024-05-21 16:37:01] [INFO ] Deduced a trap composed of 91 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:37:02] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:37:02] [INFO ] Deduced a trap composed of 94 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:37:02] [INFO ] Deduced a trap composed of 94 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:37:02] [INFO ] Deduced a trap composed of 92 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:37:02] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:37:02] [INFO ] Deduced a trap composed of 94 places in 127 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 543/1017 variables, and 346 constraints, problems are : Problem set: 31 solved, 442 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/543 constraints, PredecessorRefiner: 0/473 constraints, Known Traps: 239/239 constraints]
After SMT, in 60148ms problems are : Problem set: 31 solved, 442 unsolved
Search for dead transitions found 31 dead transitions in 60155ms
Found 31 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 31 transitions
Dead transitions reduction (with SMT) removed 31 transitions
Starting structural reductions in LTL mode, iteration 1 : 543/547 places, 443/478 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 542 transition count 443
Applied a total of 1 rules in 8 ms. Remains 542 /543 variables (removed 1) and now considering 443/443 (removed 0) transitions.
// Phase 1: matrix 443 rows 542 cols
[2024-05-21 16:37:02] [INFO ] Computed 112 invariants in 4 ms
[2024-05-21 16:37:02] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-05-21 16:37:03] [INFO ] Invariant cache hit.
[2024-05-21 16:37:03] [INFO ] Implicit Places using invariants and state equation in 421 ms returned [62, 63]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 675 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 540/547 places, 443/478 transitions.
Applied a total of 0 rules in 16 ms. Remains 540 /540 variables (removed 0) and now considering 443/443 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61681 ms. Remains : 540/547 places, 443/478 transitions.
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (NOT p3)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 346 ms.
Product exploration explored 100000 steps with 50000 reset in 226 ms.
Computed a total of 472 stabilizing places and 385 stable transitions
Graph (complete) has 1137 edges and 540 vertex of which 538 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Computed a total of 472 stabilizing places and 385 stable transitions
Detected a total of 472/540 stabilizing places and 385/443 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND p2 p3 p0 p1), (X p2), (X p3), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p3) p0))), (X p0), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3) p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p3) p0 p1)))), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 20 factoid took 42 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-20-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-20-LTLCardinality-04 finished in 62583 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||G(p1)))))'
Support contains 3 out of 547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 478/478 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 542 transition count 473
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 542 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 540 transition count 471
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 540 transition count 471
Applied a total of 14 rules in 39 ms. Remains 540 /547 variables (removed 7) and now considering 471/478 (removed 7) transitions.
// Phase 1: matrix 471 rows 540 cols
[2024-05-21 16:37:04] [INFO ] Computed 107 invariants in 5 ms
[2024-05-21 16:37:04] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-05-21 16:37:04] [INFO ] Invariant cache hit.
[2024-05-21 16:37:05] [INFO ] Implicit Places using invariants and state equation in 646 ms returned []
Implicit Place search using SMT with State Equation took 910 ms to find 0 implicit places.
Running 470 sub problems to find dead transitions.
[2024-05-21 16:37:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/539 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/539 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 1/540 variables, 64/105 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/540 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 470 unsolved
[2024-05-21 16:37:15] [INFO ] Deduced a trap composed of 73 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:37:15] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:37:15] [INFO ] Deduced a trap composed of 70 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:37:15] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:37:15] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:37:15] [INFO ] Deduced a trap composed of 73 places in 157 ms of which 2 ms to minimize.
[2024-05-21 16:37:16] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:37:16] [INFO ] Deduced a trap composed of 74 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:37:16] [INFO ] Deduced a trap composed of 88 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:37:16] [INFO ] Deduced a trap composed of 76 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:37:16] [INFO ] Deduced a trap composed of 73 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:37:16] [INFO ] Deduced a trap composed of 71 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:37:16] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 2 ms to minimize.
[2024-05-21 16:37:16] [INFO ] Deduced a trap composed of 85 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:37:17] [INFO ] Deduced a trap composed of 88 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:37:17] [INFO ] Deduced a trap composed of 94 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:37:17] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:37:17] [INFO ] Deduced a trap composed of 96 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:37:17] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:37:17] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 2 ms to minimize.
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD459 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 20/127 constraints. Problems are: Problem set: 9 solved, 461 unsolved
[2024-05-21 16:37:17] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:37:18] [INFO ] Deduced a trap composed of 86 places in 134 ms of which 2 ms to minimize.
[2024-05-21 16:37:18] [INFO ] Deduced a trap composed of 85 places in 138 ms of which 2 ms to minimize.
[2024-05-21 16:37:18] [INFO ] Deduced a trap composed of 87 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:37:18] [INFO ] Deduced a trap composed of 85 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:37:18] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 5 ms to minimize.
[2024-05-21 16:37:18] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:37:18] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:37:19] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:37:19] [INFO ] Deduced a trap composed of 91 places in 102 ms of which 3 ms to minimize.
[2024-05-21 16:37:19] [INFO ] Deduced a trap composed of 88 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:37:19] [INFO ] Deduced a trap composed of 88 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:37:19] [INFO ] Deduced a trap composed of 94 places in 105 ms of which 3 ms to minimize.
[2024-05-21 16:37:19] [INFO ] Deduced a trap composed of 126 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:37:19] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:37:19] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:37:20] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:37:20] [INFO ] Deduced a trap composed of 92 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:37:20] [INFO ] Deduced a trap composed of 59 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:37:20] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 3 ms to minimize.
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD460 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 20/147 constraints. Problems are: Problem set: 15 solved, 455 unsolved
[2024-05-21 16:37:20] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:37:20] [INFO ] Deduced a trap composed of 87 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:37:21] [INFO ] Deduced a trap composed of 87 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:37:21] [INFO ] Deduced a trap composed of 88 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:37:21] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:37:21] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:37:21] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:37:21] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:37:21] [INFO ] Deduced a trap composed of 87 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:37:21] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:37:21] [INFO ] Deduced a trap composed of 90 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:37:22] [INFO ] Deduced a trap composed of 91 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:37:22] [INFO ] Deduced a trap composed of 96 places in 133 ms of which 2 ms to minimize.
[2024-05-21 16:37:22] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:37:22] [INFO ] Deduced a trap composed of 87 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:37:22] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:37:22] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 3 ms to minimize.
[2024-05-21 16:37:22] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:37:23] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:37:23] [INFO ] Deduced a trap composed of 90 places in 114 ms of which 2 ms to minimize.
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 20/167 constraints. Problems are: Problem set: 17 solved, 453 unsolved
[2024-05-21 16:37:26] [INFO ] Deduced a trap composed of 94 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:37:26] [INFO ] Deduced a trap composed of 93 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:37:26] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:37:26] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:37:26] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:37:27] [INFO ] Deduced a trap composed of 87 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:37:27] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:37:27] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:37:27] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:37:27] [INFO ] Deduced a trap composed of 91 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:37:27] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:37:27] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:37:27] [INFO ] Deduced a trap composed of 93 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:37:28] [INFO ] Deduced a trap composed of 91 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:37:28] [INFO ] Deduced a trap composed of 89 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:37:28] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:37:28] [INFO ] Deduced a trap composed of 98 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:37:28] [INFO ] Deduced a trap composed of 99 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:37:28] [INFO ] Deduced a trap composed of 102 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:37:28] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 20/187 constraints. Problems are: Problem set: 17 solved, 453 unsolved
[2024-05-21 16:37:29] [INFO ] Deduced a trap composed of 102 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:37:29] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-21 16:37:29] [INFO ] Deduced a trap composed of 72 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:37:29] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:37:29] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:37:29] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:37:29] [INFO ] Deduced a trap composed of 73 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:37:30] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:37:30] [INFO ] Deduced a trap composed of 91 places in 146 ms of which 2 ms to minimize.
[2024-05-21 16:37:30] [INFO ] Deduced a trap composed of 88 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:37:30] [INFO ] Deduced a trap composed of 90 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:37:30] [INFO ] Deduced a trap composed of 93 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:37:30] [INFO ] Deduced a trap composed of 91 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:37:30] [INFO ] Deduced a trap composed of 90 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:37:31] [INFO ] Deduced a trap composed of 90 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:37:31] [INFO ] Deduced a trap composed of 86 places in 158 ms of which 3 ms to minimize.
[2024-05-21 16:37:31] [INFO ] Deduced a trap composed of 83 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:37:31] [INFO ] Deduced a trap composed of 128 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:37:31] [INFO ] Deduced a trap composed of 84 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:37:31] [INFO ] Deduced a trap composed of 93 places in 99 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 20/207 constraints. Problems are: Problem set: 17 solved, 453 unsolved
[2024-05-21 16:37:32] [INFO ] Deduced a trap composed of 97 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:37:32] [INFO ] Deduced a trap composed of 94 places in 152 ms of which 3 ms to minimize.
[2024-05-21 16:37:32] [INFO ] Deduced a trap composed of 97 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:37:32] [INFO ] Deduced a trap composed of 100 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:37:33] [INFO ] Deduced a trap composed of 99 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:37:33] [INFO ] Deduced a trap composed of 94 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:37:33] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:37:33] [INFO ] Deduced a trap composed of 89 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:37:33] [INFO ] Deduced a trap composed of 85 places in 146 ms of which 2 ms to minimize.
[2024-05-21 16:37:33] [INFO ] Deduced a trap composed of 92 places in 135 ms of which 2 ms to minimize.
[2024-05-21 16:37:33] [INFO ] Deduced a trap composed of 63 places in 41 ms of which 1 ms to minimize.
[2024-05-21 16:37:34] [INFO ] Deduced a trap composed of 91 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:37:34] [INFO ] Deduced a trap composed of 92 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:37:34] [INFO ] Deduced a trap composed of 91 places in 157 ms of which 3 ms to minimize.
[2024-05-21 16:37:34] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:37:34] [INFO ] Deduced a trap composed of 87 places in 154 ms of which 3 ms to minimize.
[2024-05-21 16:37:34] [INFO ] Deduced a trap composed of 95 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:37:34] [INFO ] Deduced a trap composed of 116 places in 100 ms of which 3 ms to minimize.
[2024-05-21 16:37:35] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:37:35] [INFO ] Deduced a trap composed of 90 places in 129 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/540 variables, 20/227 constraints. Problems are: Problem set: 17 solved, 453 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 540/1011 variables, and 227 constraints, problems are : Problem set: 17 solved, 453 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/540 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 17 solved, 453 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/539 variables, 41/41 constraints. Problems are: Problem set: 17 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/539 variables, 0/41 constraints. Problems are: Problem set: 17 solved, 453 unsolved
At refinement iteration 2 (OVERLAPS) 1/540 variables, 64/105 constraints. Problems are: Problem set: 17 solved, 453 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/540 variables, 2/107 constraints. Problems are: Problem set: 17 solved, 453 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 120/227 constraints. Problems are: Problem set: 17 solved, 453 unsolved
[2024-05-21 16:37:39] [INFO ] Deduced a trap composed of 101 places in 159 ms of which 4 ms to minimize.
[2024-05-21 16:37:39] [INFO ] Deduced a trap composed of 96 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:37:40] [INFO ] Deduced a trap composed of 100 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:37:40] [INFO ] Deduced a trap composed of 94 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:37:40] [INFO ] Deduced a trap composed of 93 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:37:40] [INFO ] Deduced a trap composed of 91 places in 108 ms of which 3 ms to minimize.
[2024-05-21 16:37:40] [INFO ] Deduced a trap composed of 103 places in 157 ms of which 3 ms to minimize.
[2024-05-21 16:37:40] [INFO ] Deduced a trap composed of 76 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:37:41] [INFO ] Deduced a trap composed of 94 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:37:41] [INFO ] Deduced a trap composed of 100 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:37:41] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:37:41] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:37:41] [INFO ] Deduced a trap composed of 78 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:37:41] [INFO ] Deduced a trap composed of 76 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:37:41] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:37:41] [INFO ] Deduced a trap composed of 101 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:37:42] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:37:42] [INFO ] Deduced a trap composed of 96 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:37:42] [INFO ] Deduced a trap composed of 99 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:37:42] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 3 ms to minimize.
Problem TDEAD451 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 20/247 constraints. Problems are: Problem set: 18 solved, 452 unsolved
[2024-05-21 16:37:42] [INFO ] Deduced a trap composed of 30 places in 27 ms of which 1 ms to minimize.
[2024-05-21 16:37:42] [INFO ] Deduced a trap composed of 101 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:37:43] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:37:43] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:37:43] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:37:43] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:37:43] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:37:43] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:37:43] [INFO ] Deduced a trap composed of 75 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:37:43] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:37:44] [INFO ] Deduced a trap composed of 96 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:37:44] [INFO ] Deduced a trap composed of 98 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:37:44] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:37:44] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:37:44] [INFO ] Deduced a trap composed of 96 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:37:44] [INFO ] Deduced a trap composed of 91 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:37:44] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:37:44] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:37:45] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:37:45] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 2 ms to minimize.
Problem TDEAD427 is UNSAT
Problem TDEAD431 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 20/267 constraints. Problems are: Problem set: 20 solved, 450 unsolved
[2024-05-21 16:37:45] [INFO ] Deduced a trap composed of 97 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:37:46] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 2 ms to minimize.
[2024-05-21 16:37:46] [INFO ] Deduced a trap composed of 96 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:37:46] [INFO ] Deduced a trap composed of 88 places in 167 ms of which 2 ms to minimize.
[2024-05-21 16:37:46] [INFO ] Deduced a trap composed of 91 places in 139 ms of which 2 ms to minimize.
[2024-05-21 16:37:46] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:37:46] [INFO ] Deduced a trap composed of 106 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:37:46] [INFO ] Deduced a trap composed of 99 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:37:47] [INFO ] Deduced a trap composed of 96 places in 139 ms of which 20 ms to minimize.
[2024-05-21 16:37:47] [INFO ] Deduced a trap composed of 100 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:37:47] [INFO ] Deduced a trap composed of 99 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:37:47] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:37:47] [INFO ] Deduced a trap composed of 91 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:37:47] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:37:47] [INFO ] Deduced a trap composed of 105 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:37:48] [INFO ] Deduced a trap composed of 96 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:37:48] [INFO ] Deduced a trap composed of 99 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:37:48] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:37:48] [INFO ] Deduced a trap composed of 95 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:37:48] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 2 ms to minimize.
Problem TDEAD439 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 20/287 constraints. Problems are: Problem set: 21 solved, 449 unsolved
[2024-05-21 16:37:49] [INFO ] Deduced a trap composed of 70 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:37:49] [INFO ] Deduced a trap composed of 99 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:37:49] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:37:49] [INFO ] Deduced a trap composed of 98 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:37:49] [INFO ] Deduced a trap composed of 70 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:37:49] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:37:50] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:37:50] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:37:50] [INFO ] Deduced a trap composed of 99 places in 148 ms of which 2 ms to minimize.
[2024-05-21 16:37:50] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:37:50] [INFO ] Deduced a trap composed of 81 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:37:50] [INFO ] Deduced a trap composed of 95 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:37:50] [INFO ] Deduced a trap composed of 95 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:37:51] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:37:51] [INFO ] Deduced a trap composed of 101 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:37:51] [INFO ] Deduced a trap composed of 100 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:37:51] [INFO ] Deduced a trap composed of 98 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:37:51] [INFO ] Deduced a trap composed of 99 places in 128 ms of which 2 ms to minimize.
[2024-05-21 16:37:51] [INFO ] Deduced a trap composed of 59 places in 37 ms of which 1 ms to minimize.
[2024-05-21 16:37:51] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 2 ms to minimize.
Problem TDEAD429 is UNSAT
Problem TDEAD447 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 20/307 constraints. Problems are: Problem set: 23 solved, 447 unsolved
[2024-05-21 16:37:52] [INFO ] Deduced a trap composed of 94 places in 176 ms of which 3 ms to minimize.
[2024-05-21 16:37:52] [INFO ] Deduced a trap composed of 99 places in 155 ms of which 3 ms to minimize.
[2024-05-21 16:37:53] [INFO ] Deduced a trap composed of 91 places in 154 ms of which 3 ms to minimize.
[2024-05-21 16:37:53] [INFO ] Deduced a trap composed of 92 places in 169 ms of which 3 ms to minimize.
[2024-05-21 16:37:53] [INFO ] Deduced a trap composed of 90 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:37:53] [INFO ] Deduced a trap composed of 95 places in 137 ms of which 2 ms to minimize.
[2024-05-21 16:37:53] [INFO ] Deduced a trap composed of 93 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:37:53] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 3 ms to minimize.
[2024-05-21 16:37:54] [INFO ] Deduced a trap composed of 92 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:37:54] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:37:54] [INFO ] Deduced a trap composed of 98 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:37:54] [INFO ] Deduced a trap composed of 95 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:37:54] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 2 ms to minimize.
[2024-05-21 16:37:54] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 1 ms to minimize.
[2024-05-21 16:37:54] [INFO ] Deduced a trap composed of 61 places in 55 ms of which 1 ms to minimize.
[2024-05-21 16:37:55] [INFO ] Deduced a trap composed of 88 places in 134 ms of which 2 ms to minimize.
[2024-05-21 16:37:55] [INFO ] Deduced a trap composed of 89 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:37:55] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 3 ms to minimize.
[2024-05-21 16:37:55] [INFO ] Deduced a trap composed of 92 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:37:55] [INFO ] Deduced a trap composed of 89 places in 134 ms of which 2 ms to minimize.
Problem TDEAD428 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD448 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/540 variables, 20/327 constraints. Problems are: Problem set: 28 solved, 442 unsolved
[2024-05-21 16:37:57] [INFO ] Deduced a trap composed of 90 places in 179 ms of which 3 ms to minimize.
[2024-05-21 16:37:57] [INFO ] Deduced a trap composed of 90 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:37:57] [INFO ] Deduced a trap composed of 90 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:37:57] [INFO ] Deduced a trap composed of 91 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:37:57] [INFO ] Deduced a trap composed of 88 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:37:58] [INFO ] Deduced a trap composed of 93 places in 157 ms of which 3 ms to minimize.
[2024-05-21 16:37:58] [INFO ] Deduced a trap composed of 91 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:37:58] [INFO ] Deduced a trap composed of 89 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:37:58] [INFO ] Deduced a trap composed of 72 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:37:58] [INFO ] Deduced a trap composed of 73 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:37:58] [INFO ] Deduced a trap composed of 73 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:37:59] [INFO ] Deduced a trap composed of 91 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:37:59] [INFO ] Deduced a trap composed of 73 places in 145 ms of which 2 ms to minimize.
[2024-05-21 16:37:59] [INFO ] Deduced a trap composed of 73 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:38:00] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 2 ms to minimize.
[2024-05-21 16:38:00] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:38:00] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 3 ms to minimize.
[2024-05-21 16:38:00] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:38:01] [INFO ] Deduced a trap composed of 35 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:38:01] [INFO ] Deduced a trap composed of 73 places in 94 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 20/347 constraints. Problems are: Problem set: 28 solved, 442 unsolved
[2024-05-21 16:38:03] [INFO ] Deduced a trap composed of 86 places in 155 ms of which 3 ms to minimize.
[2024-05-21 16:38:03] [INFO ] Deduced a trap composed of 91 places in 152 ms of which 3 ms to minimize.
[2024-05-21 16:38:03] [INFO ] Deduced a trap composed of 87 places in 169 ms of which 3 ms to minimize.
[2024-05-21 16:38:03] [INFO ] Deduced a trap composed of 92 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:38:04] [INFO ] Deduced a trap composed of 87 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:38:04] [INFO ] Deduced a trap composed of 86 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:38:04] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 3 ms to minimize.
[2024-05-21 16:38:04] [INFO ] Deduced a trap composed of 86 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:38:04] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:38:04] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:38:05] [INFO ] Deduced a trap composed of 100 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:38:05] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:38:05] [INFO ] Deduced a trap composed of 98 places in 117 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 1)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 1)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 1)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 1)
(s111 0)
(s112 0)
(s113 0)
(s114 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/1011 variables, and 360 constraints, problems are : Problem set: 28 solved, 442 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/540 constraints, PredecessorRefiner: 0/470 constraints, Known Traps: 253/253 constraints]
After SMT, in 60122ms problems are : Problem set: 28 solved, 442 unsolved
Search for dead transitions found 28 dead transitions in 60126ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in LTL mode, iteration 1 : 540/547 places, 443/478 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 539 transition count 443
Applied a total of 1 rules in 9 ms. Remains 539 /540 variables (removed 1) and now considering 443/443 (removed 0) transitions.
// Phase 1: matrix 443 rows 539 cols
[2024-05-21 16:38:05] [INFO ] Computed 109 invariants in 10 ms
[2024-05-21 16:38:05] [INFO ] Implicit Places using invariants in 248 ms returned []
[2024-05-21 16:38:05] [INFO ] Invariant cache hit.
[2024-05-21 16:38:06] [INFO ] Implicit Places using invariants and state equation in 470 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 719 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 538/547 places, 443/478 transitions.
Applied a total of 0 rules in 11 ms. Remains 538 /538 variables (removed 0) and now considering 443/443 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61816 ms. Remains : 538/547 places, 443/478 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-20-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 791 steps with 3 reset in 3 ms.
FORMULA BusinessProcesses-PT-20-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLCardinality-09 finished in 61953 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&&X(G(p1))))))'
Support contains 2 out of 547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 478/478 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 541 transition count 472
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 541 transition count 472
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 539 transition count 470
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 539 transition count 470
Applied a total of 16 rules in 23 ms. Remains 539 /547 variables (removed 8) and now considering 470/478 (removed 8) transitions.
// Phase 1: matrix 470 rows 539 cols
[2024-05-21 16:38:06] [INFO ] Computed 107 invariants in 5 ms
[2024-05-21 16:38:06] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-05-21 16:38:06] [INFO ] Invariant cache hit.
[2024-05-21 16:38:07] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 751 ms to find 0 implicit places.
Running 469 sub problems to find dead transitions.
[2024-05-21 16:38:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 2 (OVERLAPS) 1/539 variables, 64/105 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/539 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 469 unsolved
[2024-05-21 16:38:17] [INFO ] Deduced a trap composed of 96 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:38:17] [INFO ] Deduced a trap composed of 71 places in 131 ms of which 2 ms to minimize.
[2024-05-21 16:38:17] [INFO ] Deduced a trap composed of 68 places in 134 ms of which 2 ms to minimize.
[2024-05-21 16:38:17] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:38:17] [INFO ] Deduced a trap composed of 73 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:38:17] [INFO ] Deduced a trap composed of 84 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:38:17] [INFO ] Deduced a trap composed of 83 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:38:18] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:38:18] [INFO ] Deduced a trap composed of 85 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:38:18] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 3 ms to minimize.
[2024-05-21 16:38:18] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 3 ms to minimize.
[2024-05-21 16:38:18] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:38:18] [INFO ] Deduced a trap composed of 95 places in 106 ms of which 3 ms to minimize.
[2024-05-21 16:38:18] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:38:18] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:38:18] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:38:19] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 3 ms to minimize.
[2024-05-21 16:38:19] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:38:19] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 3 ms to minimize.
[2024-05-21 16:38:19] [INFO ] Deduced a trap composed of 95 places in 111 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/539 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 469 unsolved
[2024-05-21 16:38:19] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 2 ms to minimize.
[2024-05-21 16:38:19] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:38:19] [INFO ] Deduced a trap composed of 84 places in 133 ms of which 2 ms to minimize.
[2024-05-21 16:38:20] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:38:20] [INFO ] Deduced a trap composed of 87 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:38:20] [INFO ] Deduced a trap composed of 90 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:38:20] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 3 ms to minimize.
[2024-05-21 16:38:20] [INFO ] Deduced a trap composed of 89 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:38:20] [INFO ] Deduced a trap composed of 101 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:38:20] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 3 ms to minimize.
[2024-05-21 16:38:20] [INFO ] Deduced a trap composed of 91 places in 101 ms of which 3 ms to minimize.
[2024-05-21 16:38:21] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:38:21] [INFO ] Deduced a trap composed of 86 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:38:21] [INFO ] Deduced a trap composed of 94 places in 156 ms of which 3 ms to minimize.
[2024-05-21 16:38:21] [INFO ] Deduced a trap composed of 94 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:38:21] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:38:21] [INFO ] Deduced a trap composed of 90 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:38:21] [INFO ] Deduced a trap composed of 94 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:38:22] [INFO ] Deduced a trap composed of 93 places in 135 ms of which 16 ms to minimize.
[2024-05-21 16:38:22] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 2 ms to minimize.
Problem TDEAD408 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD432 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/539 variables, 20/147 constraints. Problems are: Problem set: 3 solved, 466 unsolved
[2024-05-21 16:38:22] [INFO ] Deduced a trap composed of 74 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:38:22] [INFO ] Deduced a trap composed of 86 places in 135 ms of which 2 ms to minimize.
[2024-05-21 16:38:22] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:38:22] [INFO ] Deduced a trap composed of 101 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:38:23] [INFO ] Deduced a trap composed of 90 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:38:23] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:38:23] [INFO ] Deduced a trap composed of 87 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:38:23] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:38:23] [INFO ] Deduced a trap composed of 88 places in 132 ms of which 10 ms to minimize.
[2024-05-21 16:38:23] [INFO ] Deduced a trap composed of 99 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:38:23] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:38:24] [INFO ] Deduced a trap composed of 90 places in 136 ms of which 2 ms to minimize.
[2024-05-21 16:38:24] [INFO ] Deduced a trap composed of 93 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:38:24] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:38:24] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:38:24] [INFO ] Deduced a trap composed of 101 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:38:24] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 3 ms to minimize.
[2024-05-21 16:38:24] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:38:25] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:38:25] [INFO ] Deduced a trap composed of 86 places in 119 ms of which 2 ms to minimize.
Problem TDEAD426 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/539 variables, 20/167 constraints. Problems are: Problem set: 4 solved, 465 unsolved
[2024-05-21 16:38:29] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:38:29] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:38:29] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:38:29] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 3 ms to minimize.
[2024-05-21 16:38:29] [INFO ] Deduced a trap composed of 95 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:38:29] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:38:29] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:38:30] [INFO ] Deduced a trap composed of 85 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:38:30] [INFO ] Deduced a trap composed of 88 places in 133 ms of which 2 ms to minimize.
[2024-05-21 16:38:30] [INFO ] Deduced a trap composed of 89 places in 110 ms of which 3 ms to minimize.
[2024-05-21 16:38:30] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:38:30] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:38:30] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:38:31] [INFO ] Deduced a trap composed of 86 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:38:31] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:38:31] [INFO ] Deduced a trap composed of 96 places in 128 ms of which 2 ms to minimize.
[2024-05-21 16:38:31] [INFO ] Deduced a trap composed of 94 places in 105 ms of which 3 ms to minimize.
[2024-05-21 16:38:31] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:38:31] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:38:31] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 3 ms to minimize.
Problem TDEAD409 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 20/187 constraints. Problems are: Problem set: 5 solved, 464 unsolved
[2024-05-21 16:38:32] [INFO ] Deduced a trap composed of 103 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:38:32] [INFO ] Deduced a trap composed of 98 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:38:32] [INFO ] Deduced a trap composed of 96 places in 145 ms of which 2 ms to minimize.
[2024-05-21 16:38:32] [INFO ] Deduced a trap composed of 107 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:38:32] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:38:32] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:38:33] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 3 ms to minimize.
[2024-05-21 16:38:33] [INFO ] Deduced a trap composed of 89 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:38:33] [INFO ] Deduced a trap composed of 93 places in 158 ms of which 2 ms to minimize.
[2024-05-21 16:38:33] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:38:33] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:38:33] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:38:33] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:38:33] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:38:34] [INFO ] Deduced a trap composed of 94 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:38:34] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:38:34] [INFO ] Deduced a trap composed of 91 places in 109 ms of which 3 ms to minimize.
[2024-05-21 16:38:34] [INFO ] Deduced a trap composed of 94 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:38:34] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:38:35] [INFO ] Deduced a trap composed of 89 places in 117 ms of which 2 ms to minimize.
Problem TDEAD410 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 20/207 constraints. Problems are: Problem set: 14 solved, 455 unsolved
[2024-05-21 16:38:35] [INFO ] Deduced a trap composed of 104 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:38:35] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:38:35] [INFO ] Deduced a trap composed of 98 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:38:36] [INFO ] Deduced a trap composed of 93 places in 156 ms of which 3 ms to minimize.
[2024-05-21 16:38:36] [INFO ] Deduced a trap composed of 93 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:38:36] [INFO ] Deduced a trap composed of 96 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:38:36] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:38:36] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:38:36] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:38:37] [INFO ] Deduced a trap composed of 100 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:38:37] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 2 ms to minimize.
SMT process timed out in 30110ms, After SMT, problems are : Problem set: 14 solved, 455 unsolved
Search for dead transitions found 14 dead transitions in 30117ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) removed 14 transitions
Starting structural reductions in LTL mode, iteration 1 : 539/547 places, 456/478 transitions.
Applied a total of 0 rules in 12 ms. Remains 539 /539 variables (removed 0) and now considering 456/456 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30908 ms. Remains : 539/547 places, 456/478 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLCardinality-12
Product exploration explored 100000 steps with 500 reset in 380 ms.
Product exploration explored 100000 steps with 503 reset in 376 ms.
Computed a total of 471 stabilizing places and 398 stable transitions
Graph (complete) has 1178 edges and 539 vertex of which 537 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 471 stabilizing places and 398 stable transitions
Detected a total of 471/539 stabilizing places and 398/456 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 233 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (195 resets) in 735 ms. (54 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (36 resets) in 138 ms. (287 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (36 resets) in 169 ms. (235 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (35 resets) in 58 ms. (678 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (35 resets) in 98 ms. (404 steps per ms) remains 2/4 properties
// Phase 1: matrix 456 rows 539 cols
[2024-05-21 16:38:38] [INFO ] Computed 108 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 161/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 280/443 variables, 63/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/443 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 89/532 variables, 38/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 451/983 variables, 532/640 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/983 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 11/994 variables, 6/646 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/994 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/995 variables, 1/647 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/995 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/995 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 995/995 variables, and 647 constraints, problems are : Problem set: 0 solved, 2 unsolved in 294 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 539/539 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 161/163 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 16:38:39] [INFO ] Deduced a trap composed of 86 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 280/443 variables, 63/71 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 16:38:39] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 3 ms to minimize.
[2024-05-21 16:38:39] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:38:39] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 3 ms to minimize.
[2024-05-21 16:38:39] [INFO ] Deduced a trap composed of 79 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:38:40] [INFO ] Deduced a trap composed of 77 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:38:40] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 2 ms to minimize.
[2024-05-21 16:38:40] [INFO ] Deduced a trap composed of 68 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:38:40] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:38:40] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:38:40] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:38:40] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:38:40] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:38:40] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:38:40] [INFO ] Deduced a trap composed of 79 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:38:41] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:38:41] [INFO ] Deduced a trap composed of 77 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:38:41] [INFO ] Deduced a trap composed of 82 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:38:41] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:38:41] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:38:41] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 20/91 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 16:38:41] [INFO ] Deduced a trap composed of 79 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:38:41] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 1 ms to minimize.
[2024-05-21 16:38:41] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:38:42] [INFO ] Deduced a trap composed of 82 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:38:42] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:38:42] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 3 ms to minimize.
[2024-05-21 16:38:42] [INFO ] Deduced a trap composed of 82 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:38:42] [INFO ] Deduced a trap composed of 83 places in 91 ms of which 1 ms to minimize.
[2024-05-21 16:38:42] [INFO ] Deduced a trap composed of 82 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:38:42] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:38:42] [INFO ] Deduced a trap composed of 80 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:38:42] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:38:43] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:38:43] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:38:43] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:38:43] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:38:43] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:38:43] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:38:43] [INFO ] Deduced a trap composed of 67 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:38:43] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 20/111 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 16:38:43] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 1 ms to minimize.
[2024-05-21 16:38:43] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:38:44] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:38:44] [INFO ] Deduced a trap composed of 82 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:38:44] [INFO ] Deduced a trap composed of 83 places in 85 ms of which 1 ms to minimize.
SMT process timed out in 5378ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 539 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 539/539 places, 456/456 transitions.
Graph (trivial) has 252 edges and 539 vertex of which 6 / 539 are part of one of the 1 SCC in 4 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 1171 edges and 534 vertex of which 532 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 532 transition count 379
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 138 place count 464 transition count 379
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 138 place count 464 transition count 268
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 382 place count 331 transition count 268
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 383 place count 330 transition count 267
Iterating global reduction 2 with 1 rules applied. Total rules applied 384 place count 330 transition count 267
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 291 rules applied. Total rules applied 675 place count 182 transition count 124
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 679 place count 180 transition count 131
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 681 place count 180 transition count 129
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 683 place count 178 transition count 129
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 684 place count 178 transition count 129
Applied a total of 684 rules in 66 ms. Remains 178 /539 variables (removed 361) and now considering 129/456 (removed 327) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 178/539 places, 129/456 transitions.
RANDOM walk for 553 steps (25 resets) in 6 ms. (79 steps per ms) remains 0/1 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 421 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p1)]
Support contains 1 out of 539 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 : 539/539 places, 456/456 transitions.
Graph (trivial) has 251 edges and 539 vertex of which 6 / 539 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 1172 edges and 534 vertex of which 532 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 531 transition count 379
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 138 place count 463 transition count 379
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 138 place count 463 transition count 268
Deduced a syphon composed of 111 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 382 place count 330 transition count 268
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 2 with 289 rules applied. Total rules applied 671 place count 183 transition count 126
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 675 place count 181 transition count 133
Applied a total of 675 rules in 58 ms. Remains 181 /539 variables (removed 358) and now considering 133/456 (removed 323) transitions.
[2024-05-21 16:38:44] [INFO ] Flow matrix only has 132 transitions (discarded 1 similar events)
// Phase 1: matrix 132 rows 181 cols
[2024-05-21 16:38:44] [INFO ] Computed 81 invariants in 2 ms
[2024-05-21 16:38:45] [INFO ] Implicit Places using invariants in 177 ms returned [26, 27, 28, 29, 30, 35, 36, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 189 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 157/539 places, 133/456 transitions.
Applied a total of 0 rules in 12 ms. Remains 157 /157 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 261 ms. Remains : 157/539 places, 133/456 transitions.
Computed a total of 84 stabilizing places and 81 stable transitions
Computed a total of 84 stabilizing places and 81 stable transitions
Detected a total of 84/157 stabilizing places and 81/133 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 95 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 48 ms :[(NOT p1)]
RANDOM walk for 20617 steps (3623 resets) in 331 ms. (62 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 118 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 35 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Product exploration explored 100000 steps with 15606 reset in 337 ms.
Product exploration explored 100000 steps with 15841 reset in 323 ms.
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 133/133 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 157 transition count 132
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 156 transition count 132
Applied a total of 2 rules in 7 ms. Remains 156 /157 variables (removed 1) and now considering 132/133 (removed 1) transitions.
[2024-05-21 16:38:46] [INFO ] Flow matrix only has 131 transitions (discarded 1 similar events)
// Phase 1: matrix 131 rows 156 cols
[2024-05-21 16:38:46] [INFO ] Computed 57 invariants in 2 ms
[2024-05-21 16:38:46] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-21 16:38:46] [INFO ] Flow matrix only has 131 transitions (discarded 1 similar events)
[2024-05-21 16:38:46] [INFO ] Invariant cache hit.
[2024-05-21 16:38:46] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 16:38:46] [INFO ] Implicit Places using invariants and state equation in 208 ms returned [5, 24, 43, 45, 47, 55, 89, 91, 93, 95, 97, 99, 101, 108, 134, 136]
Discarding 16 places :
Implicit Place search using SMT with State Equation took 332 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/157 places, 132/133 transitions.
Graph (complete) has 475 edges and 140 vertex of which 131 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 131 transition count 124
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 127 transition count 124
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 15 place count 121 transition count 109
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 121 transition count 109
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 121 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 23 place count 120 transition count 108
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 24 place count 119 transition count 107
Iterating global reduction 4 with 1 rules applied. Total rules applied 25 place count 119 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 27 place count 119 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 28 place count 118 transition count 105
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 32 place count 116 transition count 103
Applied a total of 32 rules in 15 ms. Remains 116 /140 variables (removed 24) and now considering 103/132 (removed 29) transitions.
[2024-05-21 16:38:46] [INFO ] Flow matrix only has 102 transitions (discarded 1 similar events)
// Phase 1: matrix 102 rows 116 cols
[2024-05-21 16:38:46] [INFO ] Computed 36 invariants in 0 ms
[2024-05-21 16:38:46] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-21 16:38:46] [INFO ] Flow matrix only has 102 transitions (discarded 1 similar events)
[2024-05-21 16:38:46] [INFO ] Invariant cache hit.
[2024-05-21 16:38:46] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 16:38:46] [INFO ] Implicit Places using invariants and state equation in 109 ms returned [5, 6]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 194 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 114/157 places, 103/133 transitions.
Applied a total of 0 rules in 3 ms. Remains 114 /114 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 551 ms. Remains : 114/157 places, 103/133 transitions.
Treatment of property BusinessProcesses-PT-20-LTLCardinality-12 finished in 40720 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(G(p0))&&F(p1))))'
Support contains 3 out of 547 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 547/547 places, 478/478 transitions.
Graph (trivial) has 259 edges and 547 vertex of which 6 / 547 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 1212 edges and 542 vertex of which 540 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 539 transition count 398
Reduce places removed 71 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 72 rules applied. Total rules applied 145 place count 468 transition count 397
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 146 place count 467 transition count 397
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 146 place count 467 transition count 286
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 3 with 244 rules applied. Total rules applied 390 place count 334 transition count 286
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 396 place count 328 transition count 280
Iterating global reduction 3 with 6 rules applied. Total rules applied 402 place count 328 transition count 280
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 402 place count 328 transition count 279
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 404 place count 327 transition count 279
Performed 137 Post agglomeration using F-continuation condition.Transition count delta: 137
Deduced a syphon composed of 137 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 3 with 278 rules applied. Total rules applied 682 place count 186 transition count 142
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 686 place count 184 transition count 149
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 692 place count 184 transition count 149
Applied a total of 692 rules in 37 ms. Remains 184 /547 variables (removed 363) and now considering 149/478 (removed 329) transitions.
[2024-05-21 16:38:47] [INFO ] Flow matrix only has 148 transitions (discarded 1 similar events)
// Phase 1: matrix 148 rows 184 cols
[2024-05-21 16:38:47] [INFO ] Computed 81 invariants in 1 ms
[2024-05-21 16:38:47] [INFO ] Implicit Places using invariants in 177 ms returned [27, 28, 29, 30, 31, 36, 37, 41, 42, 43, 44, 45, 46, 47, 50, 51, 52, 53, 54, 55, 56, 57, 58]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 177 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 161/547 places, 149/478 transitions.
Applied a total of 0 rules in 5 ms. Remains 161 /161 variables (removed 0) and now considering 149/149 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 219 ms. Remains : 161/547 places, 149/478 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLCardinality-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-20-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLCardinality-15 finished in 356 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&&X(G(p1))))))'
Found a Shortening insensitive property : BusinessProcesses-PT-20-LTLCardinality-12
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 547 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 547/547 places, 478/478 transitions.
Graph (trivial) has 259 edges and 547 vertex of which 6 / 547 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 1212 edges and 542 vertex of which 540 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 539 transition count 397
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 467 transition count 397
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 110 Pre rules applied. Total rules applied 146 place count 467 transition count 287
Deduced a syphon composed of 110 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 242 rules applied. Total rules applied 388 place count 335 transition count 287
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 394 place count 329 transition count 281
Iterating global reduction 2 with 6 rules applied. Total rules applied 400 place count 329 transition count 281
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 400 place count 329 transition count 280
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 402 place count 328 transition count 280
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 284 rules applied. Total rules applied 686 place count 184 transition count 140
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 690 place count 182 transition count 147
Applied a total of 690 rules in 89 ms. Remains 182 /547 variables (removed 365) and now considering 147/478 (removed 331) transitions.
[2024-05-21 16:38:47] [INFO ] Flow matrix only has 146 transitions (discarded 1 similar events)
// Phase 1: matrix 146 rows 182 cols
[2024-05-21 16:38:47] [INFO ] Computed 81 invariants in 1 ms
[2024-05-21 16:38:48] [INFO ] Implicit Places using invariants in 917 ms returned [27, 28, 29, 30, 31, 36, 37, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 928 ms to find 24 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 158/547 places, 147/478 transitions.
Applied a total of 0 rules in 3 ms. Remains 158 /158 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1021 ms. Remains : 158/547 places, 147/478 transitions.
Running random walk in product with property : BusinessProcesses-PT-20-LTLCardinality-12
Product exploration explored 100000 steps with 15829 reset in 315 ms.
Product exploration explored 100000 steps with 15679 reset in 418 ms.
Computed a total of 85 stabilizing places and 95 stable transitions
Computed a total of 85 stabilizing places and 95 stable transitions
Detected a total of 85/158 stabilizing places and 95/147 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 275 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (7046 resets) in 208 ms. (191 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40002 steps (1782 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
[2024-05-21 16:38:49] [INFO ] Flow matrix only has 146 transitions (discarded 1 similar events)
// Phase 1: matrix 146 rows 158 cols
[2024-05-21 16:38:49] [INFO ] Computed 57 invariants in 1 ms
[2024-05-21 16:38:49] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/45 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 74/119 variables, 37/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 35/154 variables, 16/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/156 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 145/301 variables, 156/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/301 variables, 7/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/301 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/303 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/303 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/303 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/304 variables, and 222 constraints, problems are : Problem set: 0 solved, 1 unsolved in 103 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 158/158 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 42/304 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 22 ms.
Refiners :[Positive P Invariants (semi-flows): 1/39 constraints, Generalized P Invariants (flows): 0/18 constraints, State Equation: 0/158 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 130ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 294 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Support contains 1 out of 158 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 : 158/158 places, 147/147 transitions.
Applied a total of 0 rules in 5 ms. Remains 158 /158 variables (removed 0) and now considering 147/147 (removed 0) transitions.
[2024-05-21 16:38:50] [INFO ] Flow matrix only has 146 transitions (discarded 1 similar events)
[2024-05-21 16:38:50] [INFO ] Invariant cache hit.
[2024-05-21 16:38:50] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-21 16:38:50] [INFO ] Flow matrix only has 146 transitions (discarded 1 similar events)
[2024-05-21 16:38:50] [INFO ] Invariant cache hit.
[2024-05-21 16:38:50] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 16:38:50] [INFO ] Implicit Places using invariants and state equation in 287 ms returned [5, 44, 46, 48, 56, 90, 92, 94, 96, 98, 100, 102]
Discarding 12 places :
Implicit Place search using SMT with State Equation took 437 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 146/158 places, 147/147 transitions.
Graph (complete) has 524 edges and 146 vertex of which 137 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 137 transition count 139
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 133 transition count 139
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 18 place count 124 transition count 108
Iterating global reduction 2 with 9 rules applied. Total rules applied 27 place count 124 transition count 108
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 124 transition count 107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 29 place count 123 transition count 107
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 30 place count 122 transition count 106
Iterating global reduction 4 with 1 rules applied. Total rules applied 31 place count 122 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 33 place count 122 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 34 place count 121 transition count 104
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 38 place count 119 transition count 102
Applied a total of 38 rules in 8 ms. Remains 119 /146 variables (removed 27) and now considering 102/147 (removed 45) transitions.
[2024-05-21 16:38:50] [INFO ] Flow matrix only has 101 transitions (discarded 1 similar events)
// Phase 1: matrix 101 rows 119 cols
[2024-05-21 16:38:50] [INFO ] Computed 40 invariants in 0 ms
[2024-05-21 16:38:51] [INFO ] Implicit Places using invariants in 150 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 152 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 118/158 places, 102/147 transitions.
Applied a total of 0 rules in 2 ms. Remains 118 /118 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 604 ms. Remains : 118/158 places, 102/147 transitions.
Computed a total of 45 stabilizing places and 50 stable transitions
Computed a total of 45 stabilizing places and 50 stable transitions
Detected a total of 45/118 stabilizing places and 50/102 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 116 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 51 ms :[(NOT p1)]
RANDOM walk for 17825 steps (3212 resets) in 35 ms. (495 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 156 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 35 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p1)]
Product exploration explored 100000 steps with 16333 reset in 154 ms.
Product exploration explored 100000 steps with 16318 reset in 170 ms.
Support contains 1 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 102/102 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 118 transition count 101
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 117 transition count 101
Applied a total of 2 rules in 3 ms. Remains 117 /118 variables (removed 1) and now considering 101/102 (removed 1) transitions.
[2024-05-21 16:38:51] [INFO ] Flow matrix only has 100 transitions (discarded 1 similar events)
// Phase 1: matrix 100 rows 117 cols
[2024-05-21 16:38:51] [INFO ] Computed 39 invariants in 2 ms
[2024-05-21 16:38:51] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-21 16:38:51] [INFO ] Flow matrix only has 100 transitions (discarded 1 similar events)
[2024-05-21 16:38:51] [INFO ] Invariant cache hit.
[2024-05-21 16:38:52] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 16:38:52] [INFO ] Implicit Places using invariants and state equation in 143 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 258 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 116/118 places, 101/102 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 116 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 115 transition count 100
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 112 transition count 97
Applied a total of 8 rules in 3 ms. Remains 112 /116 variables (removed 4) and now considering 97/101 (removed 4) transitions.
[2024-05-21 16:38:52] [INFO ] Flow matrix only has 96 transitions (discarded 1 similar events)
// Phase 1: matrix 96 rows 112 cols
[2024-05-21 16:38:52] [INFO ] Computed 38 invariants in 1 ms
[2024-05-21 16:38:52] [INFO ] Implicit Places using invariants in 89 ms returned [93, 98, 101]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 103 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 109/118 places, 97/102 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 108 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 108 transition count 96
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 4 place count 107 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 106 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 106 transition count 93
Applied a total of 6 rules in 4 ms. Remains 106 /109 variables (removed 3) and now considering 93/97 (removed 4) transitions.
[2024-05-21 16:38:52] [INFO ] Flow matrix only has 92 transitions (discarded 1 similar events)
// Phase 1: matrix 92 rows 106 cols
[2024-05-21 16:38:52] [INFO ] Computed 35 invariants in 1 ms
[2024-05-21 16:38:52] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-21 16:38:52] [INFO ] Flow matrix only has 92 transitions (discarded 1 similar events)
[2024-05-21 16:38:52] [INFO ] Invariant cache hit.
[2024-05-21 16:38:52] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 16:38:52] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 106/118 places, 93/102 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 615 ms. Remains : 106/118 places, 93/102 transitions.
Treatment of property BusinessProcesses-PT-20-LTLCardinality-12 finished in 5111 ms.
[2024-05-21 16:38:52] [INFO ] Flatten gal took : 22 ms
[2024-05-21 16:38:52] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-05-21 16:38:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 547 places, 478 transitions and 1517 arcs took 6 ms.
Total runtime 212594 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BusinessProcesses-PT-20

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/419/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 547
TRANSITIONS: 478
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.012s, Sys 0.001s]


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


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

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

Process ID: 3249
MODEL NAME: /home/mcc/execution/419/model
547 places, 478 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-20"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is BusinessProcesses-PT-20, 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 r047-tajo-171620398600603"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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