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.r048-tajo-171620399900603.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 itstools
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 r048-tajo-171620399900603
=====================================================================

--------------------
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 1716338057231

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-22 00:34:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 00:34:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:34:18] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2024-05-22 00:34:18] [INFO ] Transformed 782 places.
[2024-05-22 00:34:18] [INFO ] Transformed 697 transitions.
[2024-05-22 00:34:18] [INFO ] Found NUPN structural information;
[2024-05-22 00:34:18] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 327 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 12 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 120 ms. Remains 547 /719 variables (removed 172) and now considering 480/638 (removed 158) transitions.
// Phase 1: matrix 480 rows 547 cols
[2024-05-22 00:34:19] [INFO ] Computed 107 invariants in 33 ms
[2024-05-22 00:34:19] [INFO ] Implicit Places using invariants in 475 ms returned []
[2024-05-22 00:34:19] [INFO ] Invariant cache hit.
[2024-05-22 00:34:20] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 1005 ms to find 0 implicit places.
Running 479 sub problems to find dead transitions.
[2024-05-22 00:34:20] [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-22 00:34:32] [INFO ] Deduced a trap composed of 74 places in 193 ms of which 26 ms to minimize.
[2024-05-22 00:34:32] [INFO ] Deduced a trap composed of 73 places in 174 ms of which 3 ms to minimize.
[2024-05-22 00:34:32] [INFO ] Deduced a trap composed of 94 places in 194 ms of which 4 ms to minimize.
[2024-05-22 00:34:32] [INFO ] Deduced a trap composed of 96 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:34:32] [INFO ] Deduced a trap composed of 75 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:34:33] [INFO ] Deduced a trap composed of 72 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:34:33] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:34:33] [INFO ] Deduced a trap composed of 72 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:34:33] [INFO ] Deduced a trap composed of 89 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:34:33] [INFO ] Deduced a trap composed of 86 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:34:33] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:34:33] [INFO ] Deduced a trap composed of 96 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:34:33] [INFO ] Deduced a trap composed of 100 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:34:34] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:34:34] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:34:34] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:34:34] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:34:34] [INFO ] Deduced a trap composed of 100 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:34:34] [INFO ] Deduced a trap composed of 100 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:34:34] [INFO ] Deduced a trap composed of 101 places in 145 ms of which 3 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-22 00:34:35] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:34:35] [INFO ] Deduced a trap composed of 99 places in 159 ms of which 6 ms to minimize.
[2024-05-22 00:34:35] [INFO ] Deduced a trap composed of 74 places in 135 ms of which 4 ms to minimize.
[2024-05-22 00:34:35] [INFO ] Deduced a trap composed of 75 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:34:35] [INFO ] Deduced a trap composed of 71 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:34:35] [INFO ] Deduced a trap composed of 92 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:34:36] [INFO ] Deduced a trap composed of 92 places in 255 ms of which 3 ms to minimize.
[2024-05-22 00:34:36] [INFO ] Deduced a trap composed of 95 places in 172 ms of which 3 ms to minimize.
[2024-05-22 00:34:36] [INFO ] Deduced a trap composed of 90 places in 207 ms of which 3 ms to minimize.
[2024-05-22 00:34:36] [INFO ] Deduced a trap composed of 91 places in 198 ms of which 3 ms to minimize.
[2024-05-22 00:34:37] [INFO ] Deduced a trap composed of 97 places in 170 ms of which 2 ms to minimize.
[2024-05-22 00:34:37] [INFO ] Deduced a trap composed of 88 places in 178 ms of which 2 ms to minimize.
[2024-05-22 00:34:37] [INFO ] Deduced a trap composed of 98 places in 207 ms of which 2 ms to minimize.
[2024-05-22 00:34:37] [INFO ] Deduced a trap composed of 100 places in 177 ms of which 3 ms to minimize.
[2024-05-22 00:34:37] [INFO ] Deduced a trap composed of 96 places in 143 ms of which 4 ms to minimize.
[2024-05-22 00:34:37] [INFO ] Deduced a trap composed of 94 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:34:38] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:34:38] [INFO ] Deduced a trap composed of 92 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:34:38] [INFO ] Deduced a trap composed of 100 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:34:38] [INFO ] Deduced a trap composed of 98 places in 139 ms of which 4 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-22 00:34:39] [INFO ] Deduced a trap composed of 92 places in 197 ms of which 3 ms to minimize.
[2024-05-22 00:34:39] [INFO ] Deduced a trap composed of 91 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:34:39] [INFO ] Deduced a trap composed of 92 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:34:39] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:34:39] [INFO ] Deduced a trap composed of 95 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:34:39] [INFO ] Deduced a trap composed of 101 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:34:39] [INFO ] Deduced a trap composed of 104 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:34:40] [INFO ] Deduced a trap composed of 91 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:34:40] [INFO ] Deduced a trap composed of 105 places in 170 ms of which 3 ms to minimize.
[2024-05-22 00:34:40] [INFO ] Deduced a trap composed of 104 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:34:40] [INFO ] Deduced a trap composed of 95 places in 179 ms of which 5 ms to minimize.
[2024-05-22 00:34:40] [INFO ] Deduced a trap composed of 90 places in 188 ms of which 4 ms to minimize.
[2024-05-22 00:34:41] [INFO ] Deduced a trap composed of 103 places in 194 ms of which 3 ms to minimize.
[2024-05-22 00:34:41] [INFO ] Deduced a trap composed of 96 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:34:41] [INFO ] Deduced a trap composed of 88 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:34:41] [INFO ] Deduced a trap composed of 91 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:34:41] [INFO ] Deduced a trap composed of 100 places in 138 ms of which 8 ms to minimize.
[2024-05-22 00:34:41] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:34:42] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:34:42] [INFO ] Deduced a trap composed of 100 places in 107 ms of which 2 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-22 00:34:45] [INFO ] Deduced a trap composed of 102 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:34:46] [INFO ] Deduced a trap composed of 102 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:34:46] [INFO ] Deduced a trap composed of 101 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:34:46] [INFO ] Deduced a trap composed of 98 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:34:46] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:34:46] [INFO ] Deduced a trap composed of 98 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:34:46] [INFO ] Deduced a trap composed of 96 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:34:46] [INFO ] Deduced a trap composed of 93 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:34:47] [INFO ] Deduced a trap composed of 91 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:34:47] [INFO ] Deduced a trap composed of 90 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:34:47] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:34:47] [INFO ] Deduced a trap composed of 95 places in 105 ms of which 15 ms to minimize.
[2024-05-22 00:34:47] [INFO ] Deduced a trap composed of 93 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:34:47] [INFO ] Deduced a trap composed of 96 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:34:47] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:34:47] [INFO ] Deduced a trap composed of 95 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:34:48] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:34:48] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:34:48] [INFO ] Deduced a trap composed of 92 places in 179 ms of which 3 ms to minimize.
[2024-05-22 00:34:48] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 20/187 constraints. Problems are: Problem set: 2 solved, 477 unsolved
[2024-05-22 00:34:48] [INFO ] Deduced a trap composed of 102 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:34:48] [INFO ] Deduced a trap composed of 97 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:34:49] [INFO ] Deduced a trap composed of 96 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:34:49] [INFO ] Deduced a trap composed of 96 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:34:49] [INFO ] Deduced a trap composed of 99 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:34:49] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:34:49] [INFO ] Deduced a trap composed of 93 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:34:49] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:34:49] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:34:50] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:34:50] [INFO ] Deduced a trap composed of 89 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:34:50] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:34:50] [INFO ] Deduced a trap composed of 100 places in 147 ms of which 3 ms to minimize.
SMT process timed out in 30312ms, After SMT, problems are : Problem set: 2 solved, 477 unsolved
Search for dead transitions found 2 dead transitions in 30344ms
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 17 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 31528 ms. Remains : 547/719 places, 478/638 transitions.
Support contains 18 out of 547 places after structural reductions.
[2024-05-22 00:34:50] [INFO ] Flatten gal took : 89 ms
[2024-05-22 00:34:51] [INFO ] Flatten gal took : 63 ms
[2024-05-22 00:34:51] [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 (198 resets) in 1458 ms. (27 steps per ms) remains 4/11 properties
BEST_FIRST walk for 40004 steps (35 resets) in 299 ms. (133 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (45 resets) in 282 ms. (141 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (35 resets) in 144 ms. (275 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (35 resets) in 84 ms. (470 steps per ms) remains 3/3 properties
// Phase 1: matrix 478 rows 547 cols
[2024-05-22 00:34:52] [INFO ] Computed 107 invariants in 11 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 137/144 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 268/412 variables, 60/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 125/537 variables, 40/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 3/540 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 473/1013 variables, 540/647 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1013 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 11/1024 variables, 6/653 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1024 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/1025 variables, 1/654 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1025 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/1025 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1025/1025 variables, and 654 constraints, problems are : Problem set: 0 solved, 3 unsolved in 446 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 547/547 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 137/144 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:34:54] [INFO ] Deduced a trap composed of 69 places in 1636 ms of which 27 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 268/412 variables, 60/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:34:54] [INFO ] Deduced a trap composed of 8 places in 245 ms of which 2 ms to minimize.
[2024-05-22 00:34:54] [INFO ] Deduced a trap composed of 69 places in 178 ms of which 2 ms to minimize.
[2024-05-22 00:34:55] [INFO ] Deduced a trap composed of 70 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:34:55] [INFO ] Deduced a trap composed of 69 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:34:55] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:34:55] [INFO ] Deduced a trap composed of 84 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:34:55] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:34:55] [INFO ] Deduced a trap composed of 69 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:34:55] [INFO ] Deduced a trap composed of 69 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:34:55] [INFO ] Deduced a trap composed of 68 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:34:56] [INFO ] Deduced a trap composed of 69 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:34:56] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:34:56] [INFO ] Deduced a trap composed of 18 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:34:56] [INFO ] Deduced a trap composed of 69 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:34:56] [INFO ] Deduced a trap composed of 70 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:34:56] [INFO ] Deduced a trap composed of 68 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:34:56] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
[2024-05-22 00:34:56] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 2 ms to minimize.
[2024-05-22 00:34:56] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 2 ms to minimize.
[2024-05-22 00:34:56] [INFO ] Deduced a trap composed of 28 places in 88 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, 3 unsolved
[2024-05-22 00:34:57] [INFO ] Deduced a trap composed of 71 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:34:57] [INFO ] Deduced a trap composed of 69 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:34:57] [INFO ] Deduced a trap composed of 70 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:34:57] [INFO ] Deduced a trap composed of 68 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:34:57] [INFO ] Deduced a trap composed of 69 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:34:57] [INFO ] Deduced a trap composed of 70 places in 69 ms of which 2 ms to minimize.
[2024-05-22 00:34:57] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 2 ms to minimize.
[2024-05-22 00:34:57] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
SMT process timed out in 5514ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 547 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 547/547 places, 478/478 transitions.
Graph (trivial) has 255 edges and 547 vertex of which 6 / 547 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 1211 edges and 542 vertex of which 540 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 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 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 540 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 469 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 468 transition count 397
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 109 Pre rules applied. Total rules applied 146 place count 468 transition count 288
Deduced a syphon composed of 109 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 386 place count 337 transition count 288
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 392 place count 331 transition count 282
Iterating global reduction 3 with 6 rules applied. Total rules applied 398 place count 331 transition count 282
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 398 place count 331 transition count 281
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 400 place count 330 transition count 281
Performed 134 Post agglomeration using F-continuation condition.Transition count delta: 134
Deduced a syphon composed of 134 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 3 with 271 rules applied. Total rules applied 671 place count 193 transition count 147
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 675 place count 191 transition count 154
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 677 place count 191 transition count 152
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 679 place count 189 transition count 152
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 684 place count 189 transition count 152
Applied a total of 684 rules in 163 ms. Remains 189 /547 variables (removed 358) and now considering 152/478 (removed 326) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 189/547 places, 152/478 transitions.
RANDOM walk for 40000 steps (1656 resets) in 1053 ms. (37 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40002 steps (609 resets) in 385 ms. (103 steps per ms) remains 1/1 properties
[2024-05-22 00:34:58] [INFO ] Flow matrix only has 151 transitions (discarded 1 similar events)
// Phase 1: matrix 151 rows 189 cols
[2024-05-22 00:34:58] [INFO ] Computed 82 invariants in 5 ms
[2024-05-22 00:34:58] [INFO ] State equation strengthened by 16 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 138/149 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 35/184 variables, 16/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/187 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 151/338 variables, 187/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/338 variables, 16/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/338 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/340 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/340 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/340 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 189/189 constraints, ReadFeed: 16/16 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 138/149 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:34:58] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:34:58] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 2 ms to minimize.
[2024-05-22 00:34:58] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp1 is UNSAT
After SMT solving in domain Int declared 184/340 variables, and 82 constraints, problems are : Problem set: 1 solved, 0 unsolved in 210 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 16/19 constraints, State Equation: 0/189 constraints, ReadFeed: 0/16 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 403ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
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.28 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 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.3 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 70 ms. Remains 180 /547 variables (removed 367) and now considering 145/478 (removed 333) transitions.
[2024-05-22 00:34:58] [INFO ] Flow matrix only has 144 transitions (discarded 1 similar events)
// Phase 1: matrix 144 rows 180 cols
[2024-05-22 00:34:58] [INFO ] Computed 81 invariants in 3 ms
[2024-05-22 00:34:59] [INFO ] Implicit Places using invariants in 161 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 165 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 10 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 246 ms. Remains : 156/547 places, 145/478 transitions.
Stuttering acceptance computed with spot in 196 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 514 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 15 ms. Remains 543 /547 variables (removed 4) and now considering 474/478 (removed 4) transitions.
// Phase 1: matrix 474 rows 543 cols
[2024-05-22 00:34:59] [INFO ] Computed 107 invariants in 6 ms
[2024-05-22 00:34:59] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-22 00:34:59] [INFO ] Invariant cache hit.
[2024-05-22 00:35:00] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2024-05-22 00:35:00] [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-22 00:35:09] [INFO ] Deduced a trap composed of 72 places in 206 ms of which 3 ms to minimize.
[2024-05-22 00:35:10] [INFO ] Deduced a trap composed of 88 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:35:10] [INFO ] Deduced a trap composed of 83 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:35:10] [INFO ] Deduced a trap composed of 85 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:35:10] [INFO ] Deduced a trap composed of 89 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:35:10] [INFO ] Deduced a trap composed of 88 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:35:10] [INFO ] Deduced a trap composed of 86 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:35:11] [INFO ] Deduced a trap composed of 84 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:35:11] [INFO ] Deduced a trap composed of 88 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:35:11] [INFO ] Deduced a trap composed of 87 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:35:11] [INFO ] Deduced a trap composed of 83 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:35:11] [INFO ] Deduced a trap composed of 87 places in 142 ms of which 4 ms to minimize.
[2024-05-22 00:35:11] [INFO ] Deduced a trap composed of 83 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:35:12] [INFO ] Deduced a trap composed of 86 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:35:12] [INFO ] Deduced a trap composed of 87 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:35:12] [INFO ] Deduced a trap composed of 95 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:35:12] [INFO ] Deduced a trap composed of 92 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:35:12] [INFO ] Deduced a trap composed of 93 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:35:12] [INFO ] Deduced a trap composed of 88 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:35:12] [INFO ] Deduced a trap composed of 92 places in 123 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-22 00:35:13] [INFO ] Deduced a trap composed of 72 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:35:13] [INFO ] Deduced a trap composed of 86 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:35:13] [INFO ] Deduced a trap composed of 72 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:35:13] [INFO ] Deduced a trap composed of 84 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:35:13] [INFO ] Deduced a trap composed of 84 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:35:13] [INFO ] Deduced a trap composed of 74 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:35:14] [INFO ] Deduced a trap composed of 75 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:35:14] [INFO ] Deduced a trap composed of 88 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:35:14] [INFO ] Deduced a trap composed of 88 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:35:14] [INFO ] Deduced a trap composed of 88 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:35:14] [INFO ] Deduced a trap composed of 90 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:35:14] [INFO ] Deduced a trap composed of 88 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:35:15] [INFO ] Deduced a trap composed of 90 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:35:15] [INFO ] Deduced a trap composed of 91 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:35:15] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:35:15] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:35:15] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:35:15] [INFO ] Deduced a trap composed of 93 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:35:15] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:35:15] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 3 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-22 00:35:16] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:35:16] [INFO ] Deduced a trap composed of 99 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:35:16] [INFO ] Deduced a trap composed of 102 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:35:16] [INFO ] Deduced a trap composed of 94 places in 172 ms of which 3 ms to minimize.
[2024-05-22 00:35:16] [INFO ] Deduced a trap composed of 59 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:35:17] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:35:17] [INFO ] Deduced a trap composed of 96 places in 171 ms of which 4 ms to minimize.
[2024-05-22 00:35:17] [INFO ] Deduced a trap composed of 79 places in 178 ms of which 3 ms to minimize.
[2024-05-22 00:35:17] [INFO ] Deduced a trap composed of 99 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:35:17] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 2 ms to minimize.
[2024-05-22 00:35:17] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:35:18] [INFO ] Deduced a trap composed of 77 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:35:18] [INFO ] Deduced a trap composed of 97 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:35:18] [INFO ] Deduced a trap composed of 22 places in 185 ms of which 4 ms to minimize.
[2024-05-22 00:35:18] [INFO ] Deduced a trap composed of 85 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:35:18] [INFO ] Deduced a trap composed of 74 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:35:19] [INFO ] Deduced a trap composed of 92 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:35:19] [INFO ] Deduced a trap composed of 90 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:35:19] [INFO ] Deduced a trap composed of 90 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:35:19] [INFO ] Deduced a trap composed of 91 places in 153 ms of which 3 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-22 00:35:22] [INFO ] Deduced a trap composed of 94 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:35:23] [INFO ] Deduced a trap composed of 93 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:35:23] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:35:23] [INFO ] Deduced a trap composed of 92 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:35:23] [INFO ] Deduced a trap composed of 96 places in 169 ms of which 3 ms to minimize.
[2024-05-22 00:35:23] [INFO ] Deduced a trap composed of 93 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:35:24] [INFO ] Deduced a trap composed of 92 places in 180 ms of which 4 ms to minimize.
[2024-05-22 00:35:24] [INFO ] Deduced a trap composed of 72 places in 182 ms of which 3 ms to minimize.
[2024-05-22 00:35:24] [INFO ] Deduced a trap composed of 100 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:35:24] [INFO ] Deduced a trap composed of 96 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:35:24] [INFO ] Deduced a trap composed of 95 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:35:24] [INFO ] Deduced a trap composed of 100 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:35:25] [INFO ] Deduced a trap composed of 93 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:35:25] [INFO ] Deduced a trap composed of 96 places in 152 ms of which 16 ms to minimize.
[2024-05-22 00:35:25] [INFO ] Deduced a trap composed of 68 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:35:25] [INFO ] Deduced a trap composed of 92 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:35:25] [INFO ] Deduced a trap composed of 79 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:35:26] [INFO ] Deduced a trap composed of 93 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:35:26] [INFO ] Deduced a trap composed of 92 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:35:26] [INFO ] Deduced a trap composed of 95 places in 170 ms of which 5 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-22 00:35:26] [INFO ] Deduced a trap composed of 91 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:35:26] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:35:27] [INFO ] Deduced a trap composed of 71 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:35:27] [INFO ] Deduced a trap composed of 87 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:35:27] [INFO ] Deduced a trap composed of 95 places in 187 ms of which 3 ms to minimize.
[2024-05-22 00:35:27] [INFO ] Deduced a trap composed of 88 places in 149 ms of which 4 ms to minimize.
[2024-05-22 00:35:27] [INFO ] Deduced a trap composed of 94 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:35:28] [INFO ] Deduced a trap composed of 77 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:35:28] [INFO ] Deduced a trap composed of 86 places in 170 ms of which 3 ms to minimize.
[2024-05-22 00:35:28] [INFO ] Deduced a trap composed of 85 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:35:28] [INFO ] Deduced a trap composed of 95 places in 139 ms of which 4 ms to minimize.
[2024-05-22 00:35:29] [INFO ] Deduced a trap composed of 94 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:35:29] [INFO ] Deduced a trap composed of 95 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:35:29] [INFO ] Deduced a trap composed of 93 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:35:29] [INFO ] Deduced a trap composed of 95 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:35:30] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 543/1017 variables, and 203 constraints, problems are : Problem set: 15 solved, 458 unsolved in 30026 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: 96/96 constraints]
Escalating to Integer solving :Problem set: 15 solved, 458 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/542 variables, 41/41 constraints. Problems are: Problem set: 15 solved, 458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/542 variables, 0/41 constraints. Problems are: Problem set: 15 solved, 458 unsolved
At refinement iteration 2 (OVERLAPS) 1/543 variables, 64/105 constraints. Problems are: Problem set: 15 solved, 458 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/543 variables, 2/107 constraints. Problems are: Problem set: 15 solved, 458 unsolved
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 4 (INCLUDED_ONLY) 0/543 variables, 96/203 constraints. Problems are: Problem set: 26 solved, 447 unsolved
[2024-05-22 00:35:34] [INFO ] Deduced a trap composed of 91 places in 150 ms of which 4 ms to minimize.
[2024-05-22 00:35:34] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:35:34] [INFO ] Deduced a trap composed of 69 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:35:34] [INFO ] Deduced a trap composed of 73 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:35:35] [INFO ] Deduced a trap composed of 72 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:35:35] [INFO ] Deduced a trap composed of 71 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:35:35] [INFO ] Deduced a trap composed of 73 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:35:35] [INFO ] Deduced a trap composed of 91 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:35:35] [INFO ] Deduced a trap composed of 93 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:35:35] [INFO ] Deduced a trap composed of 76 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:35:36] [INFO ] Deduced a trap composed of 70 places in 124 ms of which 4 ms to minimize.
[2024-05-22 00:35:36] [INFO ] Deduced a trap composed of 70 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:35:36] [INFO ] Deduced a trap composed of 93 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:35:36] [INFO ] Deduced a trap composed of 92 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:35:36] [INFO ] Deduced a trap composed of 87 places in 150 ms of which 4 ms to minimize.
[2024-05-22 00:35:36] [INFO ] Deduced a trap composed of 92 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:35:37] [INFO ] Deduced a trap composed of 87 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:35:37] [INFO ] Deduced a trap composed of 93 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:35:37] [INFO ] Deduced a trap composed of 99 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:35:37] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/543 variables, 20/223 constraints. Problems are: Problem set: 26 solved, 447 unsolved
[2024-05-22 00:35:37] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:35:38] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 0 ms to minimize.
[2024-05-22 00:35:38] [INFO ] Deduced a trap composed of 93 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:35:38] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:35:38] [INFO ] Deduced a trap composed of 94 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:35:38] [INFO ] Deduced a trap composed of 93 places in 139 ms of which 14 ms to minimize.
[2024-05-22 00:35:38] [INFO ] Deduced a trap composed of 91 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:35:38] [INFO ] Deduced a trap composed of 89 places in 131 ms of which 5 ms to minimize.
[2024-05-22 00:35:39] [INFO ] Deduced a trap composed of 96 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:35:39] [INFO ] Deduced a trap composed of 98 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:35:39] [INFO ] Deduced a trap composed of 89 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:35:39] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:35:39] [INFO ] Deduced a trap composed of 87 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:35:40] [INFO ] Deduced a trap composed of 94 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:35:40] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 6 ms to minimize.
[2024-05-22 00:35:40] [INFO ] Deduced a trap composed of 93 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:35:40] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:35:40] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:35:40] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:35:40] [INFO ] Deduced a trap composed of 98 places in 111 ms of which 2 ms to minimize.
Problem TDEAD444 is UNSAT
Problem TDEAD448 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/543 variables, 20/243 constraints. Problems are: Problem set: 28 solved, 445 unsolved
[2024-05-22 00:35:41] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:35:41] [INFO ] Deduced a trap composed of 72 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:35:41] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:35:42] [INFO ] Deduced a trap composed of 73 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:35:42] [INFO ] Deduced a trap composed of 89 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:35:42] [INFO ] Deduced a trap composed of 90 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:35:42] [INFO ] Deduced a trap composed of 85 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:35:42] [INFO ] Deduced a trap composed of 91 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:35:42] [INFO ] Deduced a trap composed of 89 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:35:42] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:35:43] [INFO ] Deduced a trap composed of 87 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:35:43] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:35:43] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:35:43] [INFO ] Deduced a trap composed of 91 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:35:43] [INFO ] Deduced a trap composed of 94 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:35:43] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-22 00:35:44] [INFO ] Deduced a trap composed of 104 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:35:44] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:35:44] [INFO ] Deduced a trap composed of 102 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:35:44] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/543 variables, 20/263 constraints. Problems are: Problem set: 28 solved, 445 unsolved
[2024-05-22 00:35:45] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:35:45] [INFO ] Deduced a trap composed of 91 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:35:45] [INFO ] Deduced a trap composed of 92 places in 155 ms of which 2 ms to minimize.
[2024-05-22 00:35:45] [INFO ] Deduced a trap composed of 86 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:35:46] [INFO ] Deduced a trap composed of 87 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:35:46] [INFO ] Deduced a trap composed of 92 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:35:46] [INFO ] Deduced a trap composed of 65 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:35:47] [INFO ] Deduced a trap composed of 94 places in 152 ms of which 2 ms to minimize.
[2024-05-22 00:35:47] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:35:47] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:35:47] [INFO ] Deduced a trap composed of 28 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:35:48] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:35:48] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:35:48] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:35:48] [INFO ] Deduced a trap composed of 65 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:35:48] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:35:49] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:35:49] [INFO ] Deduced a trap composed of 63 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:35:49] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:35:49] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 3 ms to minimize.
Problem TDEAD458 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 20/283 constraints. Problems are: Problem set: 29 solved, 444 unsolved
[2024-05-22 00:35:50] [INFO ] Deduced a trap composed of 89 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:35:50] [INFO ] Deduced a trap composed of 75 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:35:50] [INFO ] Deduced a trap composed of 77 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:35:50] [INFO ] Deduced a trap composed of 78 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:35:50] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:35:50] [INFO ] Deduced a trap composed of 93 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:35:51] [INFO ] Deduced a trap composed of 94 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:35:51] [INFO ] Deduced a trap composed of 93 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:35:51] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:35:51] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:35:51] [INFO ] Deduced a trap composed of 93 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:35:51] [INFO ] Deduced a trap composed of 116 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:35:51] [INFO ] Deduced a trap composed of 93 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:35:51] [INFO ] Deduced a trap composed of 92 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:35:51] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:35:52] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:35:52] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:35:52] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:35:52] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:35:52] [INFO ] Deduced a trap composed of 99 places in 156 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/543 variables, 20/303 constraints. Problems are: Problem set: 29 solved, 444 unsolved
[2024-05-22 00:35:53] [INFO ] Deduced a trap composed of 94 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:35:53] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:35:53] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:35:53] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:35:53] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:35:53] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:35:53] [INFO ] Deduced a trap composed of 91 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:35:54] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:35:54] [INFO ] Deduced a trap composed of 89 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:35:54] [INFO ] Deduced a trap composed of 84 places in 175 ms of which 2 ms to minimize.
[2024-05-22 00:35:54] [INFO ] Deduced a trap composed of 86 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:35:54] [INFO ] Deduced a trap composed of 89 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:35:54] [INFO ] Deduced a trap composed of 85 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:35:54] [INFO ] Deduced a trap composed of 90 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:35:55] [INFO ] Deduced a trap composed of 96 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:35:55] [INFO ] Deduced a trap composed of 101 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:35:55] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:35:55] [INFO ] Deduced a trap composed of 89 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:35:55] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:35:55] [INFO ] Deduced a trap composed of 89 places in 114 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/543 variables, 20/323 constraints. Problems are: Problem set: 29 solved, 444 unsolved
[2024-05-22 00:35:56] [INFO ] Deduced a trap composed of 94 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:35:56] [INFO ] Deduced a trap composed of 96 places in 152 ms of which 2 ms to minimize.
[2024-05-22 00:35:57] [INFO ] Deduced a trap composed of 98 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:35:57] [INFO ] Deduced a trap composed of 93 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:35:57] [INFO ] Deduced a trap composed of 92 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:35:57] [INFO ] Deduced a trap composed of 61 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:35:57] [INFO ] Deduced a trap composed of 91 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:35:58] [INFO ] Deduced a trap composed of 93 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:35:58] [INFO ] Deduced a trap composed of 20 places in 172 ms of which 3 ms to minimize.
[2024-05-22 00:35:58] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:35:58] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:35:58] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 2 ms to minimize.
[2024-05-22 00:35:59] [INFO ] Deduced a trap composed of 58 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:35:59] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:35:59] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:36:00] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 3 ms to minimize.
SMT process timed out in 60199ms, After SMT, problems are : Problem set: 29 solved, 444 unsolved
Search for dead transitions found 29 dead transitions in 60213ms
Found 29 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 29 transitions
Dead transitions reduction (with SMT) removed 29 transitions
Starting structural reductions in LTL mode, iteration 1 : 543/547 places, 445/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 445
Applied a total of 1 rules in 11 ms. Remains 542 /543 variables (removed 1) and now considering 445/445 (removed 0) transitions.
// Phase 1: matrix 445 rows 542 cols
[2024-05-22 00:36:00] [INFO ] Computed 110 invariants in 4 ms
[2024-05-22 00:36:00] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-22 00:36:00] [INFO ] Invariant cache hit.
[2024-05-22 00:36:00] [INFO ] Implicit Places using invariants and state equation in 395 ms returned [62, 63]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 582 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 540/547 places, 445/478 transitions.
Applied a total of 0 rules in 8 ms. Remains 540 /540 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61488 ms. Remains : 540/547 places, 445/478 transitions.
Stuttering acceptance computed with spot in 198 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 318 ms.
Product exploration explored 100000 steps with 50000 reset in 251 ms.
Computed a total of 472 stabilizing places and 387 stable transitions
Graph (complete) has 1141 edges and 540 vertex of which 538 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 472 stabilizing places and 387 stable transitions
Detected a total of 472/540 stabilizing places and 387/445 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 89 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 62417 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 33 ms. Remains 540 /547 variables (removed 7) and now considering 471/478 (removed 7) transitions.
// Phase 1: matrix 471 rows 540 cols
[2024-05-22 00:36:01] [INFO ] Computed 107 invariants in 6 ms
[2024-05-22 00:36:01] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-05-22 00:36:02] [INFO ] Invariant cache hit.
[2024-05-22 00:36:02] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
Running 470 sub problems to find dead transitions.
[2024-05-22 00:36:02] [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-22 00:36:13] [INFO ] Deduced a trap composed of 73 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:36:13] [INFO ] Deduced a trap composed of 94 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:36:13] [INFO ] Deduced a trap composed of 70 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:36:14] [INFO ] Deduced a trap composed of 93 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:36:14] [INFO ] Deduced a trap composed of 93 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:36:14] [INFO ] Deduced a trap composed of 73 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:36:14] [INFO ] Deduced a trap composed of 95 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:36:14] [INFO ] Deduced a trap composed of 74 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:36:14] [INFO ] Deduced a trap composed of 88 places in 174 ms of which 3 ms to minimize.
[2024-05-22 00:36:14] [INFO ] Deduced a trap composed of 76 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:36:15] [INFO ] Deduced a trap composed of 73 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:36:15] [INFO ] Deduced a trap composed of 71 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:36:15] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 0 ms to minimize.
[2024-05-22 00:36:15] [INFO ] Deduced a trap composed of 85 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:36:15] [INFO ] Deduced a trap composed of 88 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:36:15] [INFO ] Deduced a trap composed of 94 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:36:15] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:36:15] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:36:16] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:36:16] [INFO ] Deduced a trap composed of 92 places in 104 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-22 00:36:16] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:36:16] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:36:16] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:36:16] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:36:16] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:36:16] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:36:17] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:36:17] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:36:17] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:36:17] [INFO ] Deduced a trap composed of 91 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:36:17] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:36:17] [INFO ] Deduced a trap composed of 88 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:36:17] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:36:18] [INFO ] Deduced a trap composed of 126 places in 172 ms of which 3 ms to minimize.
[2024-05-22 00:36:18] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:36:18] [INFO ] Deduced a trap composed of 90 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:36:18] [INFO ] Deduced a trap composed of 92 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:36:18] [INFO ] Deduced a trap composed of 92 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:36:18] [INFO ] Deduced a trap composed of 59 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:36:18] [INFO ] Deduced a trap composed of 95 places in 131 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-22 00:36:19] [INFO ] Deduced a trap composed of 90 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:36:19] [INFO ] Deduced a trap composed of 87 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:36:19] [INFO ] Deduced a trap composed of 87 places in 213 ms of which 3 ms to minimize.
[2024-05-22 00:36:19] [INFO ] Deduced a trap composed of 88 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:36:19] [INFO ] Deduced a trap composed of 87 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:36:20] [INFO ] Deduced a trap composed of 93 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:36:20] [INFO ] Deduced a trap composed of 91 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:36:20] [INFO ] Deduced a trap composed of 88 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:36:20] [INFO ] Deduced a trap composed of 87 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:36:20] [INFO ] Deduced a trap composed of 86 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:36:20] [INFO ] Deduced a trap composed of 90 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:36:20] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:36:21] [INFO ] Deduced a trap composed of 96 places in 126 ms of which 4 ms to minimize.
[2024-05-22 00:36:21] [INFO ] Deduced a trap composed of 83 places in 125 ms of which 4 ms to minimize.
[2024-05-22 00:36:21] [INFO ] Deduced a trap composed of 87 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:36:21] [INFO ] Deduced a trap composed of 82 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:36:21] [INFO ] Deduced a trap composed of 86 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:36:21] [INFO ] Deduced a trap composed of 92 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:36:21] [INFO ] Deduced a trap composed of 93 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:36:22] [INFO ] Deduced a trap composed of 90 places in 103 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-22 00:36:25] [INFO ] Deduced a trap composed of 94 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:36:25] [INFO ] Deduced a trap composed of 93 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:36:26] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:36:26] [INFO ] Deduced a trap composed of 94 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:36:26] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:36:26] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:36:26] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:36:26] [INFO ] Deduced a trap composed of 89 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:36:26] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:36:26] [INFO ] Deduced a trap composed of 91 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:36:27] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:36:27] [INFO ] Deduced a trap composed of 90 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:36:27] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:36:27] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:36:27] [INFO ] Deduced a trap composed of 89 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:36:27] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:36:27] [INFO ] Deduced a trap composed of 98 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:36:27] [INFO ] Deduced a trap composed of 99 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:36:28] [INFO ] Deduced a trap composed of 102 places in 151 ms of which 2 ms to minimize.
[2024-05-22 00:36:28] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 3 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-22 00:36:28] [INFO ] Deduced a trap composed of 102 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:36:28] [INFO ] Deduced a trap composed of 30 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:36:29] [INFO ] Deduced a trap composed of 72 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:36:29] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:36:29] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:36:29] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:36:29] [INFO ] Deduced a trap composed of 73 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:36:29] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:36:29] [INFO ] Deduced a trap composed of 91 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:36:29] [INFO ] Deduced a trap composed of 88 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:36:29] [INFO ] Deduced a trap composed of 90 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:36:30] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:36:30] [INFO ] Deduced a trap composed of 91 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:36:30] [INFO ] Deduced a trap composed of 90 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:36:30] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:36:30] [INFO ] Deduced a trap composed of 86 places in 187 ms of which 3 ms to minimize.
[2024-05-22 00:36:30] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:36:30] [INFO ] Deduced a trap composed of 128 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:36:31] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:36:31] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 2 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-22 00:36:31] [INFO ] Deduced a trap composed of 97 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:36:31] [INFO ] Deduced a trap composed of 94 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:36:31] [INFO ] Deduced a trap composed of 97 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:36:31] [INFO ] Deduced a trap composed of 100 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:36:32] [INFO ] Deduced a trap composed of 99 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:36:32] [INFO ] Deduced a trap composed of 94 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:36:32] [INFO ] Deduced a trap composed of 91 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:36:32] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:36:32] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:36:32] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 2 ms to minimize.
SMT process timed out in 30143ms, After SMT, problems are : Problem set: 17 solved, 453 unsolved
Search for dead transitions found 17 dead transitions in 30179ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in LTL mode, iteration 1 : 540/547 places, 454/478 transitions.
Applied a total of 0 rules in 7 ms. Remains 540 /540 variables (removed 0) and now considering 454/454 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30981 ms. Remains : 540/547 places, 454/478 transitions.
Stuttering acceptance computed with spot in 86 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 429 steps with 1 reset in 1 ms.
FORMULA BusinessProcesses-PT-20-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLCardinality-09 finished in 31093 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 21 ms. Remains 539 /547 variables (removed 8) and now considering 470/478 (removed 8) transitions.
// Phase 1: matrix 470 rows 539 cols
[2024-05-22 00:36:32] [INFO ] Computed 107 invariants in 12 ms
[2024-05-22 00:36:33] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-05-22 00:36:33] [INFO ] Invariant cache hit.
[2024-05-22 00:36:33] [INFO ] Implicit Places using invariants and state equation in 593 ms returned []
Implicit Place search using SMT with State Equation took 820 ms to find 0 implicit places.
Running 469 sub problems to find dead transitions.
[2024-05-22 00:36:33] [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-22 00:36:42] [INFO ] Deduced a trap composed of 96 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:36:42] [INFO ] Deduced a trap composed of 71 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:36:42] [INFO ] Deduced a trap composed of 68 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:36:42] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:36:43] [INFO ] Deduced a trap composed of 73 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:36:43] [INFO ] Deduced a trap composed of 84 places in 177 ms of which 3 ms to minimize.
[2024-05-22 00:36:43] [INFO ] Deduced a trap composed of 83 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:36:43] [INFO ] Deduced a trap composed of 85 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:36:43] [INFO ] Deduced a trap composed of 85 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:36:43] [INFO ] Deduced a trap composed of 87 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:36:44] [INFO ] Deduced a trap composed of 93 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:36:44] [INFO ] Deduced a trap composed of 86 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:36:44] [INFO ] Deduced a trap composed of 95 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:36:44] [INFO ] Deduced a trap composed of 90 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:36:44] [INFO ] Deduced a trap composed of 91 places in 137 ms of which 4 ms to minimize.
[2024-05-22 00:36:44] [INFO ] Deduced a trap composed of 87 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:36:45] [INFO ] Deduced a trap composed of 91 places in 171 ms of which 3 ms to minimize.
[2024-05-22 00:36:45] [INFO ] Deduced a trap composed of 87 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:36:45] [INFO ] Deduced a trap composed of 92 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:36:45] [INFO ] Deduced a trap composed of 95 places in 104 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-22 00:36:45] [INFO ] Deduced a trap composed of 57 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:36:45] [INFO ] Deduced a trap composed of 88 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:36:45] [INFO ] Deduced a trap composed of 84 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:36:46] [INFO ] Deduced a trap composed of 85 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:36:46] [INFO ] Deduced a trap composed of 87 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:36:46] [INFO ] Deduced a trap composed of 90 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:36:46] [INFO ] Deduced a trap composed of 88 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:36:46] [INFO ] Deduced a trap composed of 89 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:36:46] [INFO ] Deduced a trap composed of 101 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:36:46] [INFO ] Deduced a trap composed of 96 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:36:47] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:36:47] [INFO ] Deduced a trap composed of 87 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:36:47] [INFO ] Deduced a trap composed of 86 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:36:47] [INFO ] Deduced a trap composed of 94 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:36:47] [INFO ] Deduced a trap composed of 94 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:36:47] [INFO ] Deduced a trap composed of 92 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:36:47] [INFO ] Deduced a trap composed of 90 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:36:48] [INFO ] Deduced a trap composed of 94 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:36:48] [INFO ] Deduced a trap composed of 93 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:36:48] [INFO ] Deduced a trap composed of 97 places in 110 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-22 00:36:48] [INFO ] Deduced a trap composed of 74 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:36:48] [INFO ] Deduced a trap composed of 86 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:36:48] [INFO ] Deduced a trap composed of 87 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:36:49] [INFO ] Deduced a trap composed of 101 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:36:49] [INFO ] Deduced a trap composed of 90 places in 119 ms of which 6 ms to minimize.
[2024-05-22 00:36:49] [INFO ] Deduced a trap composed of 90 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:36:49] [INFO ] Deduced a trap composed of 87 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:36:49] [INFO ] Deduced a trap composed of 87 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:36:49] [INFO ] Deduced a trap composed of 88 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:36:49] [INFO ] Deduced a trap composed of 99 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:36:50] [INFO ] Deduced a trap composed of 95 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:36:50] [INFO ] Deduced a trap composed of 90 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:36:50] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:36:50] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:36:50] [INFO ] Deduced a trap composed of 92 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:36:50] [INFO ] Deduced a trap composed of 101 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:36:51] [INFO ] Deduced a trap composed of 95 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:36:51] [INFO ] Deduced a trap composed of 90 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:36:51] [INFO ] Deduced a trap composed of 88 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:36:51] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 3 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-22 00:36:55] [INFO ] Deduced a trap composed of 89 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:36:55] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:36:55] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:36:55] [INFO ] Deduced a trap composed of 96 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:36:55] [INFO ] Deduced a trap composed of 95 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:36:55] [INFO ] Deduced a trap composed of 93 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:36:55] [INFO ] Deduced a trap composed of 89 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:36:56] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:36:56] [INFO ] Deduced a trap composed of 88 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:36:56] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:36:56] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:36:56] [INFO ] Deduced a trap composed of 90 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:36:56] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:36:56] [INFO ] Deduced a trap composed of 86 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:36:57] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:36:57] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:36:57] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:36:57] [INFO ] Deduced a trap composed of 93 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:36:57] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:36:57] [INFO ] Deduced a trap composed of 92 places in 117 ms of which 2 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-22 00:36:58] [INFO ] Deduced a trap composed of 103 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:36:58] [INFO ] Deduced a trap composed of 98 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:36:58] [INFO ] Deduced a trap composed of 96 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:36:58] [INFO ] Deduced a trap composed of 107 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:36:58] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:36:58] [INFO ] Deduced a trap composed of 96 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:36:59] [INFO ] Deduced a trap composed of 94 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:36:59] [INFO ] Deduced a trap composed of 89 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:36:59] [INFO ] Deduced a trap composed of 93 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:36:59] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:36:59] [INFO ] Deduced a trap composed of 94 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:36:59] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:36:59] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:36:59] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:37:00] [INFO ] Deduced a trap composed of 94 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:37:00] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:37:00] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:37:00] [INFO ] Deduced a trap composed of 94 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:37:00] [INFO ] Deduced a trap composed of 92 places in 184 ms of which 3 ms to minimize.
[2024-05-22 00:37:01] [INFO ] Deduced a trap composed of 89 places in 145 ms of which 3 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-22 00:37:01] [INFO ] Deduced a trap composed of 104 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:37:01] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:37:01] [INFO ] Deduced a trap composed of 98 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:37:02] [INFO ] Deduced a trap composed of 93 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:37:02] [INFO ] Deduced a trap composed of 93 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:37:02] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:37:02] [INFO ] Deduced a trap composed of 94 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:37:02] [INFO ] Deduced a trap composed of 94 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:37:02] [INFO ] Deduced a trap composed of 95 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:37:03] [INFO ] Deduced a trap composed of 100 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:37:03] [INFO ] Deduced a trap composed of 91 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:37:03] [INFO ] Deduced a trap composed of 61 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:37:03] [INFO ] Deduced a trap composed of 89 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:37:03] [INFO ] Deduced a trap composed of 87 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:37:03] [INFO ] Deduced a trap composed of 84 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:37:03] [INFO ] Deduced a trap composed of 86 places in 146 ms of which 3 ms to minimize.
SMT process timed out in 30214ms, After SMT, problems are : Problem set: 14 solved, 455 unsolved
Search for dead transitions found 14 dead transitions in 30223ms
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 21 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 31086 ms. Remains : 539/547 places, 456/478 transitions.
Stuttering acceptance computed with spot in 107 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 273 ms.
Product exploration explored 100000 steps with 505 reset in 302 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.6 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 259 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 191 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (195 resets) in 338 ms. (117 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (36 resets) in 242 ms. (164 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (36 resets) in 421 ms. (94 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (36 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (36 resets) in 187 ms. (212 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 838736 steps, run timeout after 3001 ms. (steps per millisecond=279 ) properties seen :3 out of 4
Probabilistic random walk after 838736 steps, saw 129700 distinct states, run finished after 3004 ms. (steps per millisecond=279 ) properties seen :3
// Phase 1: matrix 456 rows 539 cols
[2024-05-22 00:37:08] [INFO ] Computed 108 invariants in 11 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 161/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 280/443 variables, 63/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/443 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 89/532 variables, 38/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 451/983 variables, 532/640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/983 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 11/994 variables, 6/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/994 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/995 variables, 1/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/995 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/995 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 995/995 variables, and 647 constraints, problems are : Problem set: 0 solved, 1 unsolved in 289 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 539/539 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 163/995 variables, and 7 constraints, problems are : Problem set: 1 solved, 0 unsolved in 73 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, Generalized P Invariants (flows): 7/45 constraints, State Equation: 0/539 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 380ms 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 549 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 46 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 34 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.5 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 61 ms. Remains 181 /539 variables (removed 358) and now considering 133/456 (removed 323) transitions.
[2024-05-22 00:37:09] [INFO ] Flow matrix only has 132 transitions (discarded 1 similar events)
// Phase 1: matrix 132 rows 181 cols
[2024-05-22 00:37:09] [INFO ] Computed 81 invariants in 2 ms
[2024-05-22 00:37:09] [INFO ] Implicit Places using invariants in 178 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 179 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 8 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 249 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 139 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 29 ms :[(NOT p1)]
RANDOM walk for 7484 steps (1306 resets) in 121 ms. (61 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 114 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 33 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
Product exploration explored 100000 steps with 15682 reset in 299 ms.
Product exploration explored 100000 steps with 15650 reset in 317 ms.
Built C files in :
/tmp/ltsmin2510670022184462214
[2024-05-22 00:37:11] [INFO ] Computing symmetric may disable matrix : 133 transitions.
[2024-05-22 00:37:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:37:11] [INFO ] Computing symmetric may enable matrix : 133 transitions.
[2024-05-22 00:37:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:37:11] [INFO ] Computing Do-Not-Accords matrix : 133 transitions.
[2024-05-22 00:37:11] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:37:11] [INFO ] Built C files in 75ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2510670022184462214
Running compilation step : cd /tmp/ltsmin2510670022184462214;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 510 ms.
Running link step : cd /tmp/ltsmin2510670022184462214;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin2510670022184462214;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8910542227620885437.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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-22 00:37:26] [INFO ] Flow matrix only has 131 transitions (discarded 1 similar events)
// Phase 1: matrix 131 rows 156 cols
[2024-05-22 00:37:26] [INFO ] Computed 57 invariants in 0 ms
[2024-05-22 00:37:26] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-22 00:37:26] [INFO ] Flow matrix only has 131 transitions (discarded 1 similar events)
[2024-05-22 00:37:26] [INFO ] Invariant cache hit.
[2024-05-22 00:37:26] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-22 00:37:26] [INFO ] Implicit Places using invariants and state equation in 178 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 289 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.2 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 20 ms. Remains 116 /140 variables (removed 24) and now considering 103/132 (removed 29) transitions.
[2024-05-22 00:37:26] [INFO ] Flow matrix only has 102 transitions (discarded 1 similar events)
// Phase 1: matrix 102 rows 116 cols
[2024-05-22 00:37:26] [INFO ] Computed 36 invariants in 1 ms
[2024-05-22 00:37:26] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-22 00:37:26] [INFO ] Flow matrix only has 102 transitions (discarded 1 similar events)
[2024-05-22 00:37:26] [INFO ] Invariant cache hit.
[2024-05-22 00:37:26] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:37:26] [INFO ] Implicit Places using invariants and state equation in 162 ms returned [5, 6]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 264 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 5 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 586 ms. Remains : 114/157 places, 103/133 transitions.
Built C files in :
/tmp/ltsmin7912003071512900687
[2024-05-22 00:37:26] [INFO ] Computing symmetric may disable matrix : 103 transitions.
[2024-05-22 00:37:26] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:37:26] [INFO ] Computing symmetric may enable matrix : 103 transitions.
[2024-05-22 00:37:26] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:37:26] [INFO ] Computing Do-Not-Accords matrix : 103 transitions.
[2024-05-22 00:37:26] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:37:26] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7912003071512900687
Running compilation step : cd /tmp/ltsmin7912003071512900687;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 305 ms.
Running link step : cd /tmp/ltsmin7912003071512900687;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin7912003071512900687;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased236511788476499581.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 00:37:41] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:37:41] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:37:41] [INFO ] Time to serialize gal into /tmp/LTL2897874614885919746.gal : 4 ms
[2024-05-22 00:37:42] [INFO ] Time to serialize properties into /tmp/LTL2536224384340729855.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2897874614885919746.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10346820332183904159.hoa' '-atoms' '/tmp/LTL2536224384340729855.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2536224384340729855.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10346820332183904159.hoa
Detected timeout of ITS tools.
[2024-05-22 00:37:57] [INFO ] Flatten gal took : 23 ms
[2024-05-22 00:37:57] [INFO ] Flatten gal took : 21 ms
[2024-05-22 00:37:57] [INFO ] Time to serialize gal into /tmp/LTL4149509221158983432.gal : 3 ms
[2024-05-22 00:37:57] [INFO ] Time to serialize properties into /tmp/LTL12393497740675324444.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4149509221158983432.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12393497740675324444.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F(("(p768==0)")&&(X(G("(p709==0)")))))))
Formula 0 simplified : XG(!"(p768==0)" | XF!"(p709==0)")
Detected timeout of ITS tools.
[2024-05-22 00:38:12] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:38:12] [INFO ] Applying decomposition
[2024-05-22 00:38:12] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18186279106474157060.txt' '-o' '/tmp/graph18186279106474157060.bin' '-w' '/tmp/graph18186279106474157060.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18186279106474157060.bin' '-l' '-1' '-v' '-w' '/tmp/graph18186279106474157060.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:38:12] [INFO ] Decomposing Gal with order
[2024-05-22 00:38:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:38:12] [INFO ] Removed a total of 188 redundant transitions.
[2024-05-22 00:38:12] [INFO ] Flatten gal took : 52 ms
[2024-05-22 00:38:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 44 ms.
[2024-05-22 00:38:12] [INFO ] Time to serialize gal into /tmp/LTL2242161298423746335.gal : 21 ms
[2024-05-22 00:38:12] [INFO ] Time to serialize properties into /tmp/LTL9963783092018644452.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2242161298423746335.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9963783092018644452.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(F(("(i0.u39.p768==0)")&&(X(G("(i1.i0.u38.p709==0)")))))))
Formula 0 simplified : XG(!"(i0.u39.p768==0)" | XF!"(i1.i0.u38.p709==0)")
Detected timeout of ITS tools.
Treatment of property BusinessProcesses-PT-20-LTLCardinality-12 finished in 114718 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 1 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 48 ms. Remains 184 /547 variables (removed 363) and now considering 149/478 (removed 329) transitions.
[2024-05-22 00:38:27] [INFO ] Flow matrix only has 148 transitions (discarded 1 similar events)
// Phase 1: matrix 148 rows 184 cols
[2024-05-22 00:38:27] [INFO ] Computed 81 invariants in 1 ms
[2024-05-22 00:38:27] [INFO ] Implicit Places using invariants in 125 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 125 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 178 ms. Remains : 161/547 places, 149/478 transitions.
Stuttering acceptance computed with spot in 138 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 332 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 109 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 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 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 1 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 62 ms. Remains 182 /547 variables (removed 365) and now considering 147/478 (removed 331) transitions.
[2024-05-22 00:38:28] [INFO ] Flow matrix only has 146 transitions (discarded 1 similar events)
// Phase 1: matrix 146 rows 182 cols
[2024-05-22 00:38:28] [INFO ] Computed 81 invariants in 1 ms
[2024-05-22 00:38:28] [INFO ] Implicit Places using invariants in 210 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 211 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 4 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 277 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 15540 reset in 319 ms.
Product exploration explored 100000 steps with 15618 reset in 311 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 208 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 112 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (7032 resets) in 531 ms. (75 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (1833 resets) in 160 ms. (248 steps per ms) remains 1/1 properties
[2024-05-22 00:38:29] [INFO ] Flow matrix only has 146 transitions (discarded 1 similar events)
// Phase 1: matrix 146 rows 158 cols
[2024-05-22 00:38:29] [INFO ] Computed 57 invariants in 4 ms
[2024-05-22 00:38:29] [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 208 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 34 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 260ms 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 298 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 45 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 37 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 6 ms. Remains 158 /158 variables (removed 0) and now considering 147/147 (removed 0) transitions.
[2024-05-22 00:38:30] [INFO ] Flow matrix only has 146 transitions (discarded 1 similar events)
[2024-05-22 00:38:30] [INFO ] Invariant cache hit.
[2024-05-22 00:38:30] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-22 00:38:30] [INFO ] Flow matrix only has 146 transitions (discarded 1 similar events)
[2024-05-22 00:38:30] [INFO ] Invariant cache hit.
[2024-05-22 00:38:30] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-22 00:38:30] [INFO ] Implicit Places using invariants and state equation in 226 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 392 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.1 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 18 ms. Remains 119 /146 variables (removed 27) and now considering 102/147 (removed 45) transitions.
[2024-05-22 00:38:30] [INFO ] Flow matrix only has 101 transitions (discarded 1 similar events)
// Phase 1: matrix 101 rows 119 cols
[2024-05-22 00:38:30] [INFO ] Computed 40 invariants in 1 ms
[2024-05-22 00:38:30] [INFO ] Implicit Places using invariants in 114 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 115 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 4 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 537 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 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 28 ms :[(NOT p1)]
RANDOM walk for 28847 steps (5274 resets) in 72 ms. (395 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 101 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 45 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Product exploration explored 100000 steps with 16369 reset in 242 ms.
Product exploration explored 100000 steps with 16103 reset in 250 ms.
Built C files in :
/tmp/ltsmin17757047763003793407
[2024-05-22 00:38:31] [INFO ] Computing symmetric may disable matrix : 102 transitions.
[2024-05-22 00:38:31] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:38:31] [INFO ] Computing symmetric may enable matrix : 102 transitions.
[2024-05-22 00:38:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:38:31] [INFO ] Computing Do-Not-Accords matrix : 102 transitions.
[2024-05-22 00:38:31] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:38:31] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17757047763003793407
Running compilation step : cd /tmp/ltsmin17757047763003793407;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 338 ms.
Running link step : cd /tmp/ltsmin17757047763003793407;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin17757047763003793407;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14369446921474426730.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 5 ms. Remains 117 /118 variables (removed 1) and now considering 101/102 (removed 1) transitions.
[2024-05-22 00:38:46] [INFO ] Flow matrix only has 100 transitions (discarded 1 similar events)
// Phase 1: matrix 100 rows 117 cols
[2024-05-22 00:38:46] [INFO ] Computed 39 invariants in 1 ms
[2024-05-22 00:38:47] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-22 00:38:47] [INFO ] Flow matrix only has 100 transitions (discarded 1 similar events)
[2024-05-22 00:38:47] [INFO ] Invariant cache hit.
[2024-05-22 00:38:47] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:38:47] [INFO ] Implicit Places using invariants and state equation in 98 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 208 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 4 ms. Remains 112 /116 variables (removed 4) and now considering 97/101 (removed 4) transitions.
[2024-05-22 00:38:47] [INFO ] Flow matrix only has 96 transitions (discarded 1 similar events)
// Phase 1: matrix 96 rows 112 cols
[2024-05-22 00:38:47] [INFO ] Computed 38 invariants in 0 ms
[2024-05-22 00:38:47] [INFO ] Implicit Places using invariants in 54 ms returned [93, 98, 101]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 55 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 11 ms. Remains 106 /109 variables (removed 3) and now considering 93/97 (removed 4) transitions.
[2024-05-22 00:38:47] [INFO ] Flow matrix only has 92 transitions (discarded 1 similar events)
// Phase 1: matrix 92 rows 106 cols
[2024-05-22 00:38:47] [INFO ] Computed 35 invariants in 1 ms
[2024-05-22 00:38:47] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-22 00:38:47] [INFO ] Flow matrix only has 92 transitions (discarded 1 similar events)
[2024-05-22 00:38:47] [INFO ] Invariant cache hit.
[2024-05-22 00:38:47] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:38:47] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 152 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 435 ms. Remains : 106/118 places, 93/102 transitions.
Built C files in :
/tmp/ltsmin8528863011541297398
[2024-05-22 00:38:47] [INFO ] Computing symmetric may disable matrix : 93 transitions.
[2024-05-22 00:38:47] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:38:47] [INFO ] Computing symmetric may enable matrix : 93 transitions.
[2024-05-22 00:38:47] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:38:47] [INFO ] Computing Do-Not-Accords matrix : 93 transitions.
[2024-05-22 00:38:47] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:38:47] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8528863011541297398
Running compilation step : cd /tmp/ltsmin8528863011541297398;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 198 ms.
Running link step : cd /tmp/ltsmin8528863011541297398;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin8528863011541297398;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7792976920744554470.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 00:39:02] [INFO ] Flatten gal took : 19 ms
[2024-05-22 00:39:02] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:39:02] [INFO ] Time to serialize gal into /tmp/LTL2234005005702811373.gal : 3 ms
[2024-05-22 00:39:02] [INFO ] Time to serialize properties into /tmp/LTL6341351881209047813.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2234005005702811373.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16211690866569436049.hoa' '-atoms' '/tmp/LTL6341351881209047813.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL6341351881209047813.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16211690866569436049.hoa
Detected timeout of ITS tools.
[2024-05-22 00:39:17] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:39:17] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:39:17] [INFO ] Time to serialize gal into /tmp/LTL4943045607691132706.gal : 2 ms
[2024-05-22 00:39:17] [INFO ] Time to serialize properties into /tmp/LTL1812223943562921603.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4943045607691132706.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1812223943562921603.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(F(("(p768==0)")&&(X(G("(p709==0)")))))))
Formula 0 simplified : XG(!"(p768==0)" | XF!"(p709==0)")
Detected timeout of ITS tools.
[2024-05-22 00:39:32] [INFO ] Flatten gal took : 26 ms
[2024-05-22 00:39:32] [INFO ] Applying decomposition
[2024-05-22 00:39:32] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17805197039875357244.txt' '-o' '/tmp/graph17805197039875357244.bin' '-w' '/tmp/graph17805197039875357244.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17805197039875357244.bin' '-l' '-1' '-v' '-w' '/tmp/graph17805197039875357244.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:39:32] [INFO ] Decomposing Gal with order
[2024-05-22 00:39:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:39:32] [INFO ] Removed a total of 156 redundant transitions.
[2024-05-22 00:39:32] [INFO ] Flatten gal took : 24 ms
[2024-05-22 00:39:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 24 ms.
[2024-05-22 00:39:32] [INFO ] Time to serialize gal into /tmp/LTL7298913783449379338.gal : 3 ms
[2024-05-22 00:39:32] [INFO ] Time to serialize properties into /tmp/LTL11261548679862040387.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7298913783449379338.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11261548679862040387.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F(("(i8.u34.p768==0)")&&(X(G("(i6.u31.p709==0)")))))))
Formula 0 simplified : XG(!"(i8.u34.p768==0)" | XF!"(i6.u31.p709==0)")
Reverse transition relation is NOT exact ! Due to transitions t56_t58_t59_t6, t53_t54_t7, t51_t8, t47_t48_t9, t150_t418_t67, t156_t429_t304_t319_t67, t153_...1509
Computing Next relation with stutter on 1.71875e+09 deadlock states
Detected timeout of ITS tools.
Treatment of property BusinessProcesses-PT-20-LTLCardinality-12 finished in 79992 ms.
[2024-05-22 00:39:47] [INFO ] Flatten gal took : 39 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin30299868851084362
[2024-05-22 00:39:47] [INFO ] Applying decomposition
[2024-05-22 00:39:47] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:39:47] [INFO ] Computing symmetric may disable matrix : 478 transitions.
[2024-05-22 00:39:47] [INFO ] Computation of Complete disable matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:39:47] [INFO ] Computing symmetric may enable matrix : 478 transitions.
[2024-05-22 00:39:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3923611182248483521.txt' '-o' '/tmp/graph3923611182248483521.bin' '-w' '/tmp/graph3923611182248483521.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3923611182248483521.bin' '-l' '-1' '-v' '-w' '/tmp/graph3923611182248483521.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:39:47] [INFO ] Decomposing Gal with order
[2024-05-22 00:39:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:39:48] [INFO ] Computing Do-Not-Accords matrix : 478 transitions.
[2024-05-22 00:39:48] [INFO ] Removed a total of 268 redundant transitions.
[2024-05-22 00:39:48] [INFO ] Flatten gal took : 27 ms
[2024-05-22 00:39:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 7 ms.
[2024-05-22 00:39:48] [INFO ] Time to serialize gal into /tmp/LTLCardinality12388727494670083282.gal : 5 ms
[2024-05-22 00:39:48] [INFO ] Time to serialize properties into /tmp/LTLCardinality10015421589424353326.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality12388727494670083282.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10015421589424353326.ltl' '-c' '-stutter-deadlock'
[2024-05-22 00:39:48] [INFO ] Computation of Completed DNA matrix. took 64 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:39:48] [INFO ] Built C files in 219ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin30299868851084362
Running compilation step : cd /tmp/ltsmin30299868851084362;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((X(F(("(i16.i2.u192.p768==0)")&&(X(G("(i19.u153.p709==0)")))))))
Formula 0 simplified : XG(!"(i16.i2.u192.p768==0)" | XF!"(i19.u153.p709==0)")
Compilation finished in 1500 ms.
Running link step : cd /tmp/ltsmin30299868851084362;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin30299868851084362;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp0==true)&&X([]((LTLAPp1==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-22 01:01:37] [INFO ] Applying decomposition
[2024-05-22 01:01:37] [INFO ] Flatten gal took : 95 ms
[2024-05-22 01:01:37] [INFO ] Decomposing Gal with order
[2024-05-22 01:01:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:01:38] [INFO ] Removed a total of 143 redundant transitions.
[2024-05-22 01:01:38] [INFO ] Flatten gal took : 140 ms
[2024-05-22 01:01:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 216 labels/synchronizations in 802 ms.
[2024-05-22 01:01:39] [INFO ] Time to serialize gal into /tmp/LTLCardinality14864484705931773927.gal : 77 ms
[2024-05-22 01:01:39] [INFO ] Time to serialize properties into /tmp/LTLCardinality17497817241749956592.ltl : 47 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14864484705931773927.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17497817241749956592.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((X(F(("(i1.u176.p768==0)")&&(X(G("(i1.u182.p709==0)")))))))
Formula 0 simplified : XG(!"(i1.u176.p768==0)" | XF!"(i1.u182.p709==0)")
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 4/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.038: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.024: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.038: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.024: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.046: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.038: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.038: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.052: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.052: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.079: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.080: LTL layer: formula: X(<>(((LTLAPp0==true)&&X([]((LTLAPp1==true))))))
pins2lts-mc-linux64( 5/ 8), 0.080: "X(<>(((LTLAPp0==true)&&X([]((LTLAPp1==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.080: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.100: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.123: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.150: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.157: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.173: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.176: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.178: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.421: There are 481 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.421: State length is 548, there are 487 groups
pins2lts-mc-linux64( 0/ 8), 0.421: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.421: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.421: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.421: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.616: [Blue] ~120 levels ~960 states ~6000 transitions
pins2lts-mc-linux64( 5/ 8), 0.692: [Blue] ~236 levels ~1920 states ~9456 transitions
pins2lts-mc-linux64( 5/ 8), 0.811: [Blue] ~345 levels ~3840 states ~13592 transitions
pins2lts-mc-linux64( 3/ 8), 0.966: [Blue] ~178 levels ~7680 states ~35680 transitions
pins2lts-mc-linux64( 3/ 8), 1.238: [Blue] ~178 levels ~15360 states ~66392 transitions
pins2lts-mc-linux64( 3/ 8), 1.711: [Blue] ~178 levels ~30720 states ~140448 transitions
pins2lts-mc-linux64( 3/ 8), 3.708: [Blue] ~178 levels ~61440 states ~303472 transitions
pins2lts-mc-linux64( 3/ 8), 5.794: [Blue] ~178 levels ~122880 states ~642056 transitions
pins2lts-mc-linux64( 0/ 8), 12.133: [Blue] ~640 levels ~245760 states ~1383120 transitions
pins2lts-mc-linux64( 0/ 8), 22.219: [Blue] ~640 levels ~491520 states ~2966576 transitions
pins2lts-mc-linux64( 0/ 8), 38.240: [Blue] ~640 levels ~983040 states ~6404560 transitions
pins2lts-mc-linux64( 1/ 8), 61.146: [Blue] ~947 levels ~1966080 states ~11661464 transitions
pins2lts-mc-linux64( 3/ 8), 91.052: [Blue] ~178 levels ~3932160 states ~30193088 transitions
pins2lts-mc-linux64( 3/ 8), 150.436: [Blue] ~178 levels ~7864320 states ~62440440 transitions
pins2lts-mc-linux64( 4/ 8), 276.738: [Blue] ~181 levels ~15728640 states ~122803488 transitions
pins2lts-mc-linux64( 3/ 8), 482.623: [Blue] ~178 levels ~31457280 states ~275191096 transitions
pins2lts-mc-linux64( 3/ 8), 864.559: [Blue] ~178 levels ~62914560 states ~568847336 transitions
pins2lts-mc-linux64( 3/ 8), 1886.025: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1886.048:
pins2lts-mc-linux64( 0/ 8), 1886.048: Explored 120936492 states 1055547871 transitions, fanout: 8.728
pins2lts-mc-linux64( 0/ 8), 1886.048: Total exploration time 1885.610 sec (1885.560 sec minimum, 1885.584 sec on average)
pins2lts-mc-linux64( 0/ 8), 1886.048: States per second: 64137, Transitions per second: 559791
pins2lts-mc-linux64( 0/ 8), 1886.048:
pins2lts-mc-linux64( 0/ 8), 1886.048: State space has 121157976 states, 340287 are accepting
pins2lts-mc-linux64( 0/ 8), 1886.048: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1886.048: blue states: 120936492 (99.82%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1886.048: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1886.048: all-red states: 340950 (0.28%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1886.048:
pins2lts-mc-linux64( 0/ 8), 1886.048: Total memory used for local state coloring: 2.1MB
pins2lts-mc-linux64( 0/ 8), 1886.048:
pins2lts-mc-linux64( 0/ 8), 1886.048: Queue width: 8B, total height: 136803, memory: 1.04MB
pins2lts-mc-linux64( 0/ 8), 1886.048: Tree memory: 1180.4MB, 10.2 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 1886.048: Tree fill ratio (roots/leafs): 90.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1886.048: Stored 480 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1886.048: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1886.048: Est. total memory use: 1181.4MB (~1025.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin30299868851084362;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp0==true)&&X([]((LTLAPp1==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin30299868851084362;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp0==true)&&X([]((LTLAPp1==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
ITS-tools command line returned an error code 137
[2024-05-22 01:14:49] [INFO ] Flatten gal took : 27 ms
[2024-05-22 01:14:49] [INFO ] Input system was already deterministic with 478 transitions.
[2024-05-22 01:14:49] [INFO ] Transformed 547 places.
[2024-05-22 01:14:49] [INFO ] Transformed 478 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-22 01:15:20] [INFO ] Time to serialize gal into /tmp/LTLCardinality8512995899513514459.gal : 7 ms
[2024-05-22 01:15:20] [INFO ] Time to serialize properties into /tmp/LTLCardinality11694127811869890289.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality8512995899513514459.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11694127811869890289.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F(("(p768==0)")&&(X(G("(p709==0)")))))))
Formula 0 simplified : XG(!"(p768==0)" | XF!"(p709==0)")
ITS-tools command line returned an error code 137
Total runtime 3182213 ms.

BK_STOP 1716341240846

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
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 itstools"
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 r048-tajo-171620399900603"
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 ;