Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 11 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 16:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 16:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 156K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716306575981

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-14
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 15:49:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 15:49:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:49:37] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2024-05-21 15:49:38] [INFO ] Transformed 624 places.
[2024-05-21 15:49:38] [INFO ] Transformed 564 transitions.
[2024-05-21 15:49:38] [INFO ] Found NUPN structural information;
[2024-05-21 15:49:38] [INFO ] Parsed PT model containing 624 places and 564 transitions and 1657 arcs in 246 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 52 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 8 places in 12 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-14-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 616 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 616/616 places, 556/556 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 611 transition count 556
Discarding 89 places :
Symmetric choice reduction at 1 with 89 rule applications. Total rules 94 place count 522 transition count 467
Iterating global reduction 1 with 89 rules applied. Total rules applied 183 place count 522 transition count 467
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 228 place count 477 transition count 422
Iterating global reduction 1 with 45 rules applied. Total rules applied 273 place count 477 transition count 422
Applied a total of 273 rules in 229 ms. Remains 477 /616 variables (removed 139) and now considering 422/556 (removed 134) transitions.
// Phase 1: matrix 422 rows 477 cols
[2024-05-21 15:49:38] [INFO ] Computed 94 invariants in 52 ms
[2024-05-21 15:49:39] [INFO ] Implicit Places using invariants in 603 ms returned []
[2024-05-21 15:49:39] [INFO ] Invariant cache hit.
[2024-05-21 15:49:40] [INFO ] Implicit Places using invariants and state equation in 888 ms returned []
Implicit Place search using SMT with State Equation took 1557 ms to find 0 implicit places.
Running 421 sub problems to find dead transitions.
[2024-05-21 15:49:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/476 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/476 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (OVERLAPS) 1/477 variables, 55/92 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/477 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-05-21 15:50:06] [INFO ] Deduced a trap composed of 91 places in 162 ms of which 24 ms to minimize.
[2024-05-21 15:50:06] [INFO ] Deduced a trap composed of 90 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:50:06] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:50:06] [INFO ] Deduced a trap composed of 93 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:50:06] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 3 ms to minimize.
[2024-05-21 15:50:06] [INFO ] Deduced a trap composed of 96 places in 115 ms of which 3 ms to minimize.
[2024-05-21 15:50:07] [INFO ] Deduced a trap composed of 91 places in 115 ms of which 3 ms to minimize.
[2024-05-21 15:50:07] [INFO ] Deduced a trap composed of 102 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:50:07] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:50:07] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:50:07] [INFO ] Deduced a trap composed of 99 places in 107 ms of which 3 ms to minimize.
[2024-05-21 15:50:07] [INFO ] Deduced a trap composed of 102 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:50:07] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:50:07] [INFO ] Deduced a trap composed of 97 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:50:07] [INFO ] Deduced a trap composed of 93 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:50:08] [INFO ] Deduced a trap composed of 90 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:50:08] [INFO ] Deduced a trap composed of 101 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:50:08] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:50:08] [INFO ] Deduced a trap composed of 87 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:50:08] [INFO ] Deduced a trap composed of 87 places in 123 ms of which 2 ms to minimize.
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 20/114 constraints. Problems are: Problem set: 19 solved, 402 unsolved
[2024-05-21 15:50:08] [INFO ] Deduced a trap composed of 88 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:50:09] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:50:09] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:50:09] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:50:09] [INFO ] Deduced a trap composed of 83 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:50:09] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:50:10] [INFO ] Deduced a trap composed of 95 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:50:10] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:50:10] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:50:10] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 2 ms to minimize.
SMT process timed out in 30266ms, After SMT, problems are : Problem set: 19 solved, 402 unsolved
Search for dead transitions found 19 dead transitions in 30307ms
Found 19 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 19 transitions
Dead transitions reduction (with SMT) removed 19 transitions
Starting structural reductions in LTL mode, iteration 1 : 477/616 places, 403/556 transitions.
Applied a total of 0 rules in 7 ms. Remains 477 /477 variables (removed 0) and now considering 403/403 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32135 ms. Remains : 477/616 places, 403/556 transitions.
Support contains 42 out of 477 places after structural reductions.
[2024-05-21 15:50:10] [INFO ] Flatten gal took : 65 ms
[2024-05-21 15:50:10] [INFO ] Flatten gal took : 39 ms
[2024-05-21 15:50:10] [INFO ] Input system was already deterministic with 403 transitions.
Reduction of identical properties reduced properties to check from 32 to 31
RANDOM walk for 40000 steps (271 resets) in 1852 ms. (21 steps per ms) remains 18/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
// Phase 1: matrix 403 rows 477 cols
[2024-05-21 15:50:11] [INFO ] Computed 94 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp12 is UNSAT
At refinement iteration 1 (OVERLAPS) 172/201 variables, 19/19 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 1/20 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/20 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 155/356 variables, 36/56 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 0/56 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 110/466 variables, 36/92 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 0/92 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 2/468 variables, 2/94 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/468 variables, 0/94 constraints. Problems are: Problem set: 2 solved, 16 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 10 (OVERLAPS) 397/865 variables, 468/562 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/865 variables, 0/562 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 13/878 variables, 7/569 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/878 variables, 0/569 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 2/880 variables, 2/571 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/880 variables, 0/571 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 16 (OVERLAPS) 0/880 variables, 0/571 constraints. Problems are: Problem set: 3 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 880/880 variables, and 571 constraints, problems are : Problem set: 3 solved, 15 unsolved in 1659 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 477/477 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 154/177 variables, 13/13 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 1/14 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/14 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 178/355 variables, 42/56 constraints. Problems are: Problem set: 3 solved, 15 unsolved
[2024-05-21 15:50:13] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 2 ms to minimize.
[2024-05-21 15:50:13] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:50:13] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:50:13] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 2 ms to minimize.
[2024-05-21 15:50:13] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:50:13] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-05-21 15:50:13] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2024-05-21 15:50:13] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-05-21 15:50:13] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 9/65 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 0/65 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 111/466 variables, 36/101 constraints. Problems are: Problem set: 3 solved, 15 unsolved
[2024-05-21 15:50:14] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 3 ms to minimize.
[2024-05-21 15:50:14] [INFO ] Deduced a trap composed of 84 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:50:14] [INFO ] Deduced a trap composed of 89 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:50:14] [INFO ] Deduced a trap composed of 87 places in 135 ms of which 4 ms to minimize.
[2024-05-21 15:50:14] [INFO ] Deduced a trap composed of 94 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:50:15] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:50:15] [INFO ] Deduced a trap composed of 83 places in 150 ms of which 3 ms to minimize.
[2024-05-21 15:50:15] [INFO ] Deduced a trap composed of 99 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:50:15] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:50:15] [INFO ] Deduced a trap composed of 86 places in 153 ms of which 3 ms to minimize.
[2024-05-21 15:50:15] [INFO ] Deduced a trap composed of 83 places in 158 ms of which 4 ms to minimize.
[2024-05-21 15:50:15] [INFO ] Deduced a trap composed of 99 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:50:16] [INFO ] Deduced a trap composed of 88 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:50:16] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:50:16] [INFO ] Deduced a trap composed of 86 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:50:16] [INFO ] Deduced a trap composed of 86 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:50:16] [INFO ] Deduced a trap composed of 103 places in 132 ms of which 11 ms to minimize.
[2024-05-21 15:50:16] [INFO ] Deduced a trap composed of 88 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:50:16] [INFO ] Deduced a trap composed of 88 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:50:17] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/466 variables, 20/121 constraints. Problems are: Problem set: 3 solved, 15 unsolved
[2024-05-21 15:50:17] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 2 ms to minimize.
[2024-05-21 15:50:17] [INFO ] Deduced a trap composed of 97 places in 142 ms of which 3 ms to minimize.
Problem AtomicPropp28 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/466 variables, 2/123 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/466 variables, 0/123 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 2/468 variables, 2/125 constraints. Problems are: Problem set: 4 solved, 14 unsolved
[2024-05-21 15:50:17] [INFO ] Deduced a trap composed of 93 places in 163 ms of which 3 ms to minimize.
[2024-05-21 15:50:18] [INFO ] Deduced a trap composed of 90 places in 142 ms of which 3 ms to minimize.
[2024-05-21 15:50:18] [INFO ] Deduced a trap composed of 89 places in 125 ms of which 4 ms to minimize.
[2024-05-21 15:50:18] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 3 ms to minimize.
SMT process timed out in 6747ms, After SMT, problems are : Problem set: 4 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 20 out of 477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 403/403 transitions.
Graph (complete) has 1049 edges and 477 vertex of which 476 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 476 transition count 357
Reduce places removed 45 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 50 rules applied. Total rules applied 96 place count 431 transition count 352
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 101 place count 426 transition count 352
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 93 Pre rules applied. Total rules applied 101 place count 426 transition count 259
Deduced a syphon composed of 93 places in 2 ms
Ensure Unique test removed 13 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 199 rules applied. Total rules applied 300 place count 320 transition count 259
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 305 place count 315 transition count 254
Iterating global reduction 3 with 5 rules applied. Total rules applied 310 place count 315 transition count 254
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 119
Deduced a syphon composed of 119 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 3 with 243 rules applied. Total rules applied 553 place count 191 transition count 135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 554 place count 191 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 556 place count 190 transition count 138
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 565 place count 190 transition count 138
Applied a total of 565 rules in 129 ms. Remains 190 /477 variables (removed 287) and now considering 138/403 (removed 265) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 190/477 places, 138/403 transitions.
RANDOM walk for 40000 steps (3526 resets) in 1178 ms. (33 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (972 resets) in 215 ms. (185 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1041 resets) in 267 ms. (149 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (1009 resets) in 189 ms. (210 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (1015 resets) in 215 ms. (185 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1002 resets) in 241 ms. (165 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1012 resets) in 154 ms. (258 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (867 resets) in 163 ms. (243 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1028 resets) in 138 ms. (287 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1038 resets) in 165 ms. (240 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1007 resets) in 131 ms. (303 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (1034 resets) in 115 ms. (344 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (1011 resets) in 117 ms. (339 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (937 resets) in 93 ms. (425 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (985 resets) in 88 ms. (449 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 1027148 steps, run timeout after 3001 ms. (steps per millisecond=342 ) properties seen :13 out of 14
Probabilistic random walk after 1027148 steps, saw 208696 distinct states, run finished after 3004 ms. (steps per millisecond=341 ) properties seen :13
// Phase 1: matrix 138 rows 190 cols
[2024-05-21 15:50:22] [INFO ] Computed 76 invariants in 6 ms
[2024-05-21 15:50:22] [INFO ] State equation strengthened by 6 read => feed constraints.
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) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 141/147 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 15:50:22] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-21 15:50:22] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 3 ms to minimize.
[2024-05-21 15:50:22] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 35/182 variables, 15/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 15:50:23] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 2 ms to minimize.
[2024-05-21 15:50:23] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-05-21 15:50:23] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 2 ms to minimize.
[2024-05-21 15:50:23] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/187 variables, 5/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 138/325 variables, 187/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/325 variables, 6/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/325 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 3/328 variables, 3/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/328 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/328 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 279 constraints, problems are : Problem set: 0 solved, 1 unsolved in 526 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 190/190 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 141/147 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 35/182 variables, 15/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/187 variables, 5/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 138/325 variables, 187/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/325 variables, 6/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/325 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 3/328 variables, 3/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/328 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 15:50:23] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
Problem AtomicPropp29 is UNSAT
After SMT solving in domain Int declared 328/328 variables, and 281 constraints, problems are : Problem set: 1 solved, 0 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 190/190 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 726ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 6 atomic propositions for a total of 14 simplifications.
FORMULA BusinessProcesses-PT-14-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 127 stabilizing places and 120 stable transitions
Graph (complete) has 1049 edges and 477 vertex of which 476 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.29 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||G(F((p1||G(p2))))))))'
Support contains 2 out of 477 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 403/403 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 470 transition count 396
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 470 transition count 396
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 466 transition count 392
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 466 transition count 392
Applied a total of 22 rules in 30 ms. Remains 466 /477 variables (removed 11) and now considering 392/403 (removed 11) transitions.
// Phase 1: matrix 392 rows 466 cols
[2024-05-21 15:50:23] [INFO ] Computed 94 invariants in 9 ms
[2024-05-21 15:50:24] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-05-21 15:50:24] [INFO ] Invariant cache hit.
[2024-05-21 15:50:24] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 694 ms to find 0 implicit places.
Running 391 sub problems to find dead transitions.
[2024-05-21 15:50:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (OVERLAPS) 1/466 variables, 56/93 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-21 15:50:32] [INFO ] Deduced a trap composed of 96 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:50:32] [INFO ] Deduced a trap composed of 85 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:50:32] [INFO ] Deduced a trap composed of 82 places in 138 ms of which 3 ms to minimize.
[2024-05-21 15:50:32] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:50:32] [INFO ] Deduced a trap composed of 87 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:50:32] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:50:32] [INFO ] Deduced a trap composed of 83 places in 139 ms of which 2 ms to minimize.
[2024-05-21 15:50:33] [INFO ] Deduced a trap composed of 101 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:50:33] [INFO ] Deduced a trap composed of 94 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:50:33] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:50:33] [INFO ] Deduced a trap composed of 98 places in 156 ms of which 3 ms to minimize.
[2024-05-21 15:50:33] [INFO ] Deduced a trap composed of 36 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:50:34] [INFO ] Deduced a trap composed of 42 places in 164 ms of which 3 ms to minimize.
[2024-05-21 15:50:34] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 2 ms to minimize.
[2024-05-21 15:50:34] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 2 ms to minimize.
[2024-05-21 15:50:34] [INFO ] Deduced a trap composed of 101 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:50:34] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-21 15:50:34] [INFO ] Deduced a trap composed of 84 places in 128 ms of which 3 ms to minimize.
[2024-05-21 15:50:34] [INFO ] Deduced a trap composed of 87 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:50:35] [INFO ] Deduced a trap composed of 88 places in 148 ms of which 3 ms to minimize.
Problem TDEAD318 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD340 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 20/114 constraints. Problems are: Problem set: 3 solved, 388 unsolved
[2024-05-21 15:50:35] [INFO ] Deduced a trap composed of 95 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:50:35] [INFO ] Deduced a trap composed of 94 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:50:35] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:50:35] [INFO ] Deduced a trap composed of 91 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:50:36] [INFO ] Deduced a trap composed of 76 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:50:36] [INFO ] Deduced a trap composed of 82 places in 146 ms of which 3 ms to minimize.
[2024-05-21 15:50:36] [INFO ] Deduced a trap composed of 78 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:50:36] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 3 ms to minimize.
[2024-05-21 15:50:36] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:50:36] [INFO ] Deduced a trap composed of 98 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:50:37] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:50:37] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:50:37] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:50:37] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:50:37] [INFO ] Deduced a trap composed of 99 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:50:37] [INFO ] Deduced a trap composed of 102 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:50:37] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:50:37] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:50:38] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:50:38] [INFO ] Deduced a trap composed of 83 places in 88 ms of which 2 ms to minimize.
Problem TDEAD320 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 20/134 constraints. Problems are: Problem set: 9 solved, 382 unsolved
[2024-05-21 15:50:38] [INFO ] Deduced a trap composed of 83 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:50:38] [INFO ] Deduced a trap composed of 79 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:50:38] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:50:38] [INFO ] Deduced a trap composed of 76 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:50:39] [INFO ] Deduced a trap composed of 97 places in 139 ms of which 3 ms to minimize.
[2024-05-21 15:50:39] [INFO ] Deduced a trap composed of 99 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:50:39] [INFO ] Deduced a trap composed of 79 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:50:39] [INFO ] Deduced a trap composed of 97 places in 137 ms of which 3 ms to minimize.
[2024-05-21 15:50:39] [INFO ] Deduced a trap composed of 79 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:50:39] [INFO ] Deduced a trap composed of 84 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:50:40] [INFO ] Deduced a trap composed of 81 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:50:40] [INFO ] Deduced a trap composed of 87 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:50:40] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:50:40] [INFO ] Deduced a trap composed of 86 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:50:40] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:50:40] [INFO ] Deduced a trap composed of 87 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:50:40] [INFO ] Deduced a trap composed of 84 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:50:40] [INFO ] Deduced a trap composed of 82 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:50:41] [INFO ] Deduced a trap composed of 99 places in 144 ms of which 3 ms to minimize.
[2024-05-21 15:50:41] [INFO ] Deduced a trap composed of 84 places in 146 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 20/154 constraints. Problems are: Problem set: 9 solved, 382 unsolved
[2024-05-21 15:50:44] [INFO ] Deduced a trap composed of 99 places in 139 ms of which 3 ms to minimize.
[2024-05-21 15:50:44] [INFO ] Deduced a trap composed of 87 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:50:45] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:50:45] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:50:45] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2024-05-21 15:50:45] [INFO ] Deduced a trap composed of 98 places in 145 ms of which 3 ms to minimize.
[2024-05-21 15:50:45] [INFO ] Deduced a trap composed of 84 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:50:46] [INFO ] Deduced a trap composed of 81 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:50:46] [INFO ] Deduced a trap composed of 95 places in 128 ms of which 3 ms to minimize.
[2024-05-21 15:50:46] [INFO ] Deduced a trap composed of 95 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:50:46] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:50:46] [INFO ] Deduced a trap composed of 84 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:50:46] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:50:46] [INFO ] Deduced a trap composed of 84 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:50:47] [INFO ] Deduced a trap composed of 80 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:50:47] [INFO ] Deduced a trap composed of 78 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:50:47] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 3 ms to minimize.
[2024-05-21 15:50:47] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:50:47] [INFO ] Deduced a trap composed of 65 places in 182 ms of which 3 ms to minimize.
[2024-05-21 15:50:48] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 20/174 constraints. Problems are: Problem set: 9 solved, 382 unsolved
[2024-05-21 15:50:48] [INFO ] Deduced a trap composed of 94 places in 126 ms of which 2 ms to minimize.
[2024-05-21 15:50:48] [INFO ] Deduced a trap composed of 94 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:50:48] [INFO ] Deduced a trap composed of 97 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:50:48] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:50:49] [INFO ] Deduced a trap composed of 88 places in 137 ms of which 3 ms to minimize.
[2024-05-21 15:50:49] [INFO ] Deduced a trap composed of 90 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:50:49] [INFO ] Deduced a trap composed of 86 places in 138 ms of which 3 ms to minimize.
[2024-05-21 15:50:49] [INFO ] Deduced a trap composed of 88 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:50:49] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:50:49] [INFO ] Deduced a trap composed of 86 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:50:50] [INFO ] Deduced a trap composed of 96 places in 142 ms of which 3 ms to minimize.
[2024-05-21 15:50:50] [INFO ] Deduced a trap composed of 93 places in 141 ms of which 3 ms to minimize.
[2024-05-21 15:50:50] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:50:50] [INFO ] Deduced a trap composed of 88 places in 135 ms of which 2 ms to minimize.
[2024-05-21 15:50:50] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:50:51] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-05-21 15:50:51] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:50:51] [INFO ] Deduced a trap composed of 86 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:50:51] [INFO ] Deduced a trap composed of 81 places in 142 ms of which 3 ms to minimize.
[2024-05-21 15:50:51] [INFO ] Deduced a trap composed of 87 places in 112 ms of which 3 ms to minimize.
Problem TDEAD308 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/466 variables, 20/194 constraints. Problems are: Problem set: 14 solved, 377 unsolved
[2024-05-21 15:50:52] [INFO ] Deduced a trap composed of 98 places in 146 ms of which 2 ms to minimize.
[2024-05-21 15:50:52] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:50:52] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:50:52] [INFO ] Deduced a trap composed of 82 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:50:53] [INFO ] Deduced a trap composed of 83 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:50:53] [INFO ] Deduced a trap composed of 82 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:50:53] [INFO ] Deduced a trap composed of 99 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:50:53] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:50:53] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:50:53] [INFO ] Deduced a trap composed of 98 places in 135 ms of which 2 ms to minimize.
[2024-05-21 15:50:53] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:50:54] [INFO ] Deduced a trap composed of 96 places in 115 ms of which 3 ms to minimize.
[2024-05-21 15:50:54] [INFO ] Deduced a trap composed of 98 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:50:54] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 3 ms to minimize.
[2024-05-21 15:50:54] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:50:54] [INFO ] Deduced a trap composed of 86 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:50:54] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 2 ms to minimize.
SMT process timed out in 30196ms, After SMT, problems are : Problem set: 14 solved, 377 unsolved
Search for dead transitions found 14 dead transitions in 30203ms
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 : 466/477 places, 378/403 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 465 transition count 378
Applied a total of 1 rules in 19 ms. Remains 465 /466 variables (removed 1) and now considering 378/378 (removed 0) transitions.
// Phase 1: matrix 378 rows 465 cols
[2024-05-21 15:50:54] [INFO ] Computed 100 invariants in 4 ms
[2024-05-21 15:50:55] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-21 15:50:55] [INFO ] Invariant cache hit.
[2024-05-21 15:50:55] [INFO ] Implicit Places using invariants and state equation in 523 ms returned [419]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 749 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 464/477 places, 378/403 transitions.
Applied a total of 0 rules in 7 ms. Remains 464 /464 variables (removed 0) and now considering 378/378 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31706 ms. Remains : 464/477 places, 378/403 transitions.
Stuttering acceptance computed with spot in 456 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-00
Product exploration explored 100000 steps with 717 reset in 377 ms.
Product exploration explored 100000 steps with 715 reset in 323 ms.
Computed a total of 123 stabilizing places and 116 stable transitions
Graph (complete) has 991 edges and 464 vertex of which 463 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Computed a total of 123 stabilizing places and 116 stable transitions
Detected a total of 123/464 stabilizing places and 116/378 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 248 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (272 resets) in 191 ms. (208 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (49 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (47 resets) in 213 ms. (186 steps per ms) remains 2/2 properties
// Phase 1: matrix 378 rows 464 cols
[2024-05-21 15:50:57] [INFO ] Computed 99 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 54/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 282/338 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 116/454 variables, 43/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/455 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 372/827 variables, 455/554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/827 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 13/840 variables, 7/561 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/840 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/842 variables, 2/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/842 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/842 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 842/842 variables, and 563 constraints, problems are : Problem set: 0 solved, 2 unsolved in 385 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 464/464 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 54/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 282/338 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:50:57] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:50:58] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:50:58] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:50:58] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:50:58] [INFO ] Deduced a trap composed of 59 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:50:58] [INFO ] Deduced a trap composed of 60 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:50:58] [INFO ] Deduced a trap composed of 59 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:50:58] [INFO ] Deduced a trap composed of 58 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:50:58] [INFO ] Deduced a trap composed of 59 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:50:58] [INFO ] Deduced a trap composed of 59 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:50:58] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:50:59] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:50:59] [INFO ] Deduced a trap composed of 60 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:50:59] [INFO ] Deduced a trap composed of 60 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:50:59] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:50:59] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 16/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 116/454 variables, 43/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:50:59] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-21 15:50:59] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/455 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/455 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 372/827 variables, 455/572 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/827 variables, 2/574 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:50:59] [INFO ] Deduced a trap composed of 45 places in 92 ms of which 3 ms to minimize.
[2024-05-21 15:50:59] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-05-21 15:51:00] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:51:00] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:51:00] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/827 variables, 5/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/827 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 13/840 variables, 7/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:51:00] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:51:00] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:51:00] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
[2024-05-21 15:51:00] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/840 variables, 4/590 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/840 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/842 variables, 2/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/842 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/842 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 842/842 variables, and 592 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3189 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 464/464 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 27/27 constraints]
After SMT, in 3587ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 228 ms.
Support contains 2 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 378/378 transitions.
Graph (trivial) has 211 edges and 464 vertex of which 6 / 464 are part of one of the 1 SCC in 3 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 984 edges and 459 vertex of which 458 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 48 place count 458 transition count 324
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 94 place count 412 transition count 324
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 94 place count 412 transition count 224
Deduced a syphon composed of 100 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 217 rules applied. Total rules applied 311 place count 295 transition count 224
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Deduced a syphon composed of 124 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 2 with 260 rules applied. Total rules applied 571 place count 159 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 573 place count 158 transition count 104
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 575 place count 158 transition count 102
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 577 place count 156 transition count 102
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 578 place count 156 transition count 102
Applied a total of 578 rules in 55 ms. Remains 156 /464 variables (removed 308) and now considering 102/378 (removed 276) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 156/464 places, 102/378 transitions.
RANDOM walk for 40000 steps (1619 resets) in 204 ms. (195 steps per ms) remains 1/2 properties
BEST_FIRST walk for 1732 steps (21 resets) in 18 ms. (91 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F p2), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 7 factoid took 568 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 2 out of 464 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 464/464 places, 378/378 transitions.
Graph (trivial) has 211 edges and 464 vertex of which 6 / 464 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 985 edges and 459 vertex of which 458 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 48 place count 457 transition count 324
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 94 place count 411 transition count 324
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 94 place count 411 transition count 224
Deduced a syphon composed of 100 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 217 rules applied. Total rules applied 311 place count 294 transition count 224
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 258 rules applied. Total rules applied 569 place count 159 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 571 place count 158 transition count 105
Applied a total of 571 rules in 64 ms. Remains 158 /464 variables (removed 306) and now considering 105/378 (removed 273) transitions.
// Phase 1: matrix 105 rows 158 cols
[2024-05-21 15:51:02] [INFO ] Computed 70 invariants in 2 ms
[2024-05-21 15:51:02] [INFO ] Implicit Places using invariants in 167 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 23, 24, 25, 26, 41, 42, 43, 44, 45]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 170 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 139/464 places, 105/378 transitions.
Applied a total of 0 rules in 11 ms. Remains 139 /139 variables (removed 0) and now considering 105/105 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 245 ms. Remains : 139/464 places, 105/378 transitions.
Computed a total of 14 stabilizing places and 12 stable transitions
Computed a total of 14 stabilizing places and 12 stable transitions
Detected a total of 14/139 stabilizing places and 12/105 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 329 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (6665 resets) in 803 ms. (49 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (2266 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (2106 resets) in 180 ms. (221 steps per ms) remains 2/2 properties
// Phase 1: matrix 105 rows 139 cols
[2024-05-21 15:51:03] [INFO ] Computed 51 invariants in 1 ms
[2024-05-21 15:51:03] [INFO ] State equation strengthened by 5 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 105/114 variables, 34/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 22/136 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 104/240 variables, 136/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 5/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3/243 variables, 3/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/243 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/243 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/244 variables, and 195 constraints, problems are : Problem set: 0 solved, 2 unsolved in 121 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 139/139 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 105/114 variables, 34/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:51:03] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 22/136 variables, 15/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:51:03] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 2 ms to minimize.
[2024-05-21 15:51:03] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 104/240 variables, 136/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 5/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/243 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/243 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/243 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/244 variables, and 200 constraints, problems are : Problem set: 0 solved, 2 unsolved in 372 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 139/139 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 501ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 63 ms.
Support contains 2 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 105/105 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 139 transition count 104
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 139 transition count 102
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 137 transition count 102
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 137 transition count 102
Applied a total of 6 rules in 16 ms. Remains 137 /139 variables (removed 2) and now considering 102/105 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 137/139 places, 102/105 transitions.
RANDOM walk for 40000 steps (1584 resets) in 205 ms. (194 steps per ms) remains 1/2 properties
BEST_FIRST walk for 2964 steps (25 resets) in 10 ms. (269 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F p2), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 8 factoid took 477 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering criterion allowed to conclude after 7 steps with 1 reset in 0 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLFireability-00 finished in 40740 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((p1&&X(X(G(p1))))))))'
Support contains 4 out of 477 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 477/477 places, 403/403 transitions.
Graph (trivial) has 220 edges and 477 vertex of which 6 / 477 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 1043 edges and 472 vertex of which 471 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 470 transition count 343
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 106 place count 418 transition count 343
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 106 place count 418 transition count 247
Deduced a syphon composed of 96 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 314 place count 306 transition count 247
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 320 place count 300 transition count 241
Iterating global reduction 2 with 6 rules applied. Total rules applied 326 place count 300 transition count 241
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 255 rules applied. Total rules applied 581 place count 170 transition count 116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 583 place count 169 transition count 120
Applied a total of 583 rules in 68 ms. Remains 169 /477 variables (removed 308) and now considering 120/403 (removed 283) transitions.
// Phase 1: matrix 120 rows 169 cols
[2024-05-21 15:51:04] [INFO ] Computed 73 invariants in 3 ms
[2024-05-21 15:51:04] [INFO ] Implicit Places using invariants in 157 ms returned [1, 2, 3, 4, 5, 6, 7, 16, 17, 21, 22, 23, 24, 25, 26, 49, 50, 51, 52, 53]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 159 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 149/477 places, 120/403 transitions.
Applied a total of 0 rules in 6 ms. Remains 149 /149 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 233 ms. Remains : 149/477 places, 120/403 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-01
Product exploration explored 100000 steps with 13175 reset in 359 ms.
Product exploration explored 100000 steps with 13207 reset in 312 ms.
Computed a total of 14 stabilizing places and 12 stable transitions
Computed a total of 14 stabilizing places and 12 stable transitions
Detected a total of 14/149 stabilizing places and 12/120 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 11 factoid took 398 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (5710 resets) in 401 ms. (99 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (1872 resets) in 101 ms. (392 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40001 steps (1647 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
// Phase 1: matrix 120 rows 149 cols
[2024-05-21 15:51:06] [INFO ] Computed 53 invariants in 1 ms
[2024-05-21 15:51:06] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 62/109 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 15:51:06] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-05-21 15:51:06] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:51:06] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 34/143 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/146 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/146 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 119/265 variables, 146/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 5/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/268 variables, 3/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/268 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/268 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/269 variables, and 210 constraints, problems are : Problem set: 0 solved, 1 unsolved in 283 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 149/149 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 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) 43/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 62/109 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 34/143 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 15:51:06] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/146 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/146 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 119/265 variables, 146/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 5/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/265 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/268 variables, 3/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 15:51:06] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
Problem apf4 is UNSAT
After SMT solving in domain Int declared 268/269 variables, and 213 constraints, problems are : Problem set: 1 solved, 0 unsolved in 232 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 149/149 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 521ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 12 factoid took 930 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Support contains 3 out of 149 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 : 149/149 places, 120/120 transitions.
Applied a total of 0 rules in 15 ms. Remains 149 /149 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-21 15:51:07] [INFO ] Invariant cache hit.
[2024-05-21 15:51:07] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-21 15:51:07] [INFO ] Invariant cache hit.
[2024-05-21 15:51:07] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 15:51:08] [INFO ] Implicit Places using invariants and state equation in 246 ms returned [3, 5, 9, 12, 26, 28, 30, 35, 37, 39, 40, 41, 43, 45, 47, 49, 51, 57, 59, 61, 68, 70, 72, 74, 76, 78, 80, 82, 90, 92, 94, 96, 98, 139]
Discarding 34 places :
Implicit Place search using SMT with State Equation took 376 ms to find 34 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/149 places, 120/120 transitions.
Graph (complete) has 331 edges and 115 vertex of which 104 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 104 transition count 108
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 97 transition count 108
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 22 place count 90 transition count 94
Iterating global reduction 2 with 7 rules applied. Total rules applied 29 place count 90 transition count 94
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 32 place count 90 transition count 91
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 35 place count 87 transition count 91
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 36 place count 86 transition count 90
Iterating global reduction 4 with 1 rules applied. Total rules applied 37 place count 86 transition count 90
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 54 place count 77 transition count 82
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 56 place count 76 transition count 81
Applied a total of 56 rules in 15 ms. Remains 76 /115 variables (removed 39) and now considering 81/120 (removed 39) transitions.
// Phase 1: matrix 81 rows 76 cols
[2024-05-21 15:51:08] [INFO ] Computed 14 invariants in 1 ms
[2024-05-21 15:51:08] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-21 15:51:08] [INFO ] Invariant cache hit.
[2024-05-21 15:51:08] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:51:08] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 76/149 places, 81/120 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 569 ms. Remains : 76/149 places, 81/120 transitions.
Computed a total of 6 stabilizing places and 7 stable transitions
Computed a total of 6 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 40000 steps (5797 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (1800 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 83 steps, run visited all 1 properties in 7 ms. (steps per millisecond=11 )
Probabilistic random walk after 83 steps, saw 60 distinct states, run finished after 11 ms. (steps per millisecond=7 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 120 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 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13342 reset in 237 ms.
Product exploration explored 100000 steps with 13389 reset in 171 ms.
Support contains 3 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 81/81 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 76 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 75 transition count 80
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 2 with 2 rules applied. Total rules applied 4 place count 74 transition count 79
Applied a total of 4 rules in 6 ms. Remains 74 /76 variables (removed 2) and now considering 79/81 (removed 2) transitions.
// Phase 1: matrix 79 rows 74 cols
[2024-05-21 15:51:09] [INFO ] Computed 14 invariants in 2 ms
[2024-05-21 15:51:09] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 15:51:09] [INFO ] Invariant cache hit.
[2024-05-21 15:51:09] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:51:09] [INFO ] Implicit Places using invariants and state equation in 117 ms returned [23]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 195 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/76 places, 79/81 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 73 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 72 transition count 78
Applied a total of 2 rules in 5 ms. Remains 72 /73 variables (removed 1) and now considering 78/79 (removed 1) transitions.
// Phase 1: matrix 78 rows 72 cols
[2024-05-21 15:51:09] [INFO ] Computed 13 invariants in 0 ms
[2024-05-21 15:51:09] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-21 15:51:09] [INFO ] Invariant cache hit.
[2024-05-21 15:51:09] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:51:09] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 72/76 places, 78/81 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 383 ms. Remains : 72/76 places, 78/81 transitions.
Treatment of property BusinessProcesses-PT-14-LTLFireability-01 finished in 5077 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 477 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 477/477 places, 403/403 transitions.
Graph (trivial) has 221 edges and 477 vertex of which 6 / 477 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 1043 edges and 472 vertex of which 471 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 470 transition count 344
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 419 transition count 344
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 104 place count 419 transition count 245
Deduced a syphon composed of 99 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 215 rules applied. Total rules applied 319 place count 303 transition count 245
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 324 place count 298 transition count 240
Iterating global reduction 2 with 5 rules applied. Total rules applied 329 place count 298 transition count 240
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 255 rules applied. Total rules applied 584 place count 168 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 586 place count 167 transition count 119
Applied a total of 586 rules in 52 ms. Remains 167 /477 variables (removed 310) and now considering 119/403 (removed 284) transitions.
// Phase 1: matrix 119 rows 167 cols
[2024-05-21 15:51:09] [INFO ] Computed 72 invariants in 2 ms
[2024-05-21 15:51:09] [INFO ] Implicit Places using invariants in 155 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 47, 48, 49, 50, 51]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 156 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 147/477 places, 119/403 transitions.
Applied a total of 0 rules in 5 ms. Remains 147 /147 variables (removed 0) and now considering 119/119 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 214 ms. Remains : 147/477 places, 119/403 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-05
Stuttering criterion allowed to conclude after 39 steps with 6 reset in 1 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLFireability-05 finished in 298 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((X(G(p0))||F(p1))))'
Support contains 3 out of 477 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 403/403 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 470 transition count 396
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 470 transition count 396
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 466 transition count 392
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 466 transition count 392
Applied a total of 22 rules in 60 ms. Remains 466 /477 variables (removed 11) and now considering 392/403 (removed 11) transitions.
// Phase 1: matrix 392 rows 466 cols
[2024-05-21 15:51:09] [INFO ] Computed 94 invariants in 6 ms
[2024-05-21 15:51:10] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-05-21 15:51:10] [INFO ] Invariant cache hit.
[2024-05-21 15:51:10] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 711 ms to find 0 implicit places.
Running 391 sub problems to find dead transitions.
[2024-05-21 15:51:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (OVERLAPS) 1/466 variables, 56/93 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-21 15:51:18] [INFO ] Deduced a trap composed of 96 places in 146 ms of which 3 ms to minimize.
[2024-05-21 15:51:18] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:51:18] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 3 ms to minimize.
[2024-05-21 15:51:18] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 3 ms to minimize.
[2024-05-21 15:51:18] [INFO ] Deduced a trap composed of 87 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:51:18] [INFO ] Deduced a trap composed of 90 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:51:19] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 3 ms to minimize.
[2024-05-21 15:51:19] [INFO ] Deduced a trap composed of 101 places in 91 ms of which 3 ms to minimize.
[2024-05-21 15:51:19] [INFO ] Deduced a trap composed of 94 places in 124 ms of which 2 ms to minimize.
[2024-05-21 15:51:19] [INFO ] Deduced a trap composed of 92 places in 139 ms of which 4 ms to minimize.
[2024-05-21 15:51:19] [INFO ] Deduced a trap composed of 98 places in 146 ms of which 2 ms to minimize.
[2024-05-21 15:51:19] [INFO ] Deduced a trap composed of 36 places in 129 ms of which 2 ms to minimize.
[2024-05-21 15:51:20] [INFO ] Deduced a trap composed of 42 places in 144 ms of which 3 ms to minimize.
[2024-05-21 15:51:20] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 2 ms to minimize.
[2024-05-21 15:51:20] [INFO ] Deduced a trap composed of 38 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:51:20] [INFO ] Deduced a trap composed of 101 places in 152 ms of which 3 ms to minimize.
[2024-05-21 15:51:20] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-21 15:51:20] [INFO ] Deduced a trap composed of 84 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:51:21] [INFO ] Deduced a trap composed of 87 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:51:21] [INFO ] Deduced a trap composed of 88 places in 135 ms of which 3 ms to minimize.
Problem TDEAD318 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD340 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 20/114 constraints. Problems are: Problem set: 3 solved, 388 unsolved
[2024-05-21 15:51:21] [INFO ] Deduced a trap composed of 95 places in 134 ms of which 2 ms to minimize.
[2024-05-21 15:51:21] [INFO ] Deduced a trap composed of 94 places in 141 ms of which 3 ms to minimize.
[2024-05-21 15:51:21] [INFO ] Deduced a trap composed of 85 places in 147 ms of which 2 ms to minimize.
[2024-05-21 15:51:22] [INFO ] Deduced a trap composed of 91 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:51:22] [INFO ] Deduced a trap composed of 76 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:51:22] [INFO ] Deduced a trap composed of 82 places in 143 ms of which 3 ms to minimize.
[2024-05-21 15:51:22] [INFO ] Deduced a trap composed of 78 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:51:22] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 4 ms to minimize.
[2024-05-21 15:51:22] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:51:23] [INFO ] Deduced a trap composed of 98 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:51:23] [INFO ] Deduced a trap composed of 42 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:51:23] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:51:23] [INFO ] Deduced a trap composed of 36 places in 137 ms of which 3 ms to minimize.
[2024-05-21 15:51:23] [INFO ] Deduced a trap composed of 85 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:51:23] [INFO ] Deduced a trap composed of 99 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:51:23] [INFO ] Deduced a trap composed of 102 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:51:24] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:51:24] [INFO ] Deduced a trap composed of 85 places in 146 ms of which 3 ms to minimize.
[2024-05-21 15:51:24] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:51:24] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 2 ms to minimize.
Problem TDEAD320 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 20/134 constraints. Problems are: Problem set: 9 solved, 382 unsolved
[2024-05-21 15:51:24] [INFO ] Deduced a trap composed of 83 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:51:24] [INFO ] Deduced a trap composed of 79 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:51:25] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:51:25] [INFO ] Deduced a trap composed of 76 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:51:25] [INFO ] Deduced a trap composed of 97 places in 149 ms of which 3 ms to minimize.
[2024-05-21 15:51:25] [INFO ] Deduced a trap composed of 99 places in 118 ms of which 2 ms to minimize.
[2024-05-21 15:51:25] [INFO ] Deduced a trap composed of 79 places in 150 ms of which 2 ms to minimize.
[2024-05-21 15:51:26] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:51:26] [INFO ] Deduced a trap composed of 79 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:51:26] [INFO ] Deduced a trap composed of 84 places in 106 ms of which 3 ms to minimize.
[2024-05-21 15:51:26] [INFO ] Deduced a trap composed of 81 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:51:26] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:51:26] [INFO ] Deduced a trap composed of 82 places in 115 ms of which 3 ms to minimize.
[2024-05-21 15:51:26] [INFO ] Deduced a trap composed of 86 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:51:26] [INFO ] Deduced a trap composed of 83 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:51:27] [INFO ] Deduced a trap composed of 87 places in 138 ms of which 2 ms to minimize.
[2024-05-21 15:51:27] [INFO ] Deduced a trap composed of 84 places in 132 ms of which 2 ms to minimize.
[2024-05-21 15:51:27] [INFO ] Deduced a trap composed of 82 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:51:27] [INFO ] Deduced a trap composed of 99 places in 147 ms of which 3 ms to minimize.
[2024-05-21 15:51:27] [INFO ] Deduced a trap composed of 84 places in 126 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 20/154 constraints. Problems are: Problem set: 9 solved, 382 unsolved
[2024-05-21 15:51:30] [INFO ] Deduced a trap composed of 99 places in 138 ms of which 3 ms to minimize.
[2024-05-21 15:51:30] [INFO ] Deduced a trap composed of 87 places in 145 ms of which 3 ms to minimize.
[2024-05-21 15:51:31] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:51:31] [INFO ] Deduced a trap composed of 82 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:51:31] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2024-05-21 15:51:31] [INFO ] Deduced a trap composed of 98 places in 142 ms of which 3 ms to minimize.
[2024-05-21 15:51:31] [INFO ] Deduced a trap composed of 84 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:51:32] [INFO ] Deduced a trap composed of 81 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:51:32] [INFO ] Deduced a trap composed of 95 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:51:32] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:51:32] [INFO ] Deduced a trap composed of 82 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:51:32] [INFO ] Deduced a trap composed of 84 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:51:32] [INFO ] Deduced a trap composed of 90 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:51:32] [INFO ] Deduced a trap composed of 84 places in 118 ms of which 4 ms to minimize.
[2024-05-21 15:51:33] [INFO ] Deduced a trap composed of 80 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:51:33] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 3 ms to minimize.
[2024-05-21 15:51:33] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:51:33] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:51:33] [INFO ] Deduced a trap composed of 65 places in 177 ms of which 3 ms to minimize.
[2024-05-21 15:51:34] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 20/174 constraints. Problems are: Problem set: 9 solved, 382 unsolved
[2024-05-21 15:51:34] [INFO ] Deduced a trap composed of 94 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:51:34] [INFO ] Deduced a trap composed of 94 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:51:34] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 3 ms to minimize.
[2024-05-21 15:51:34] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:51:35] [INFO ] Deduced a trap composed of 88 places in 142 ms of which 3 ms to minimize.
[2024-05-21 15:51:35] [INFO ] Deduced a trap composed of 90 places in 135 ms of which 2 ms to minimize.
[2024-05-21 15:51:35] [INFO ] Deduced a trap composed of 86 places in 136 ms of which 2 ms to minimize.
[2024-05-21 15:51:35] [INFO ] Deduced a trap composed of 88 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:51:35] [INFO ] Deduced a trap composed of 95 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:51:35] [INFO ] Deduced a trap composed of 86 places in 139 ms of which 2 ms to minimize.
[2024-05-21 15:51:36] [INFO ] Deduced a trap composed of 96 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:51:36] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:51:36] [INFO ] Deduced a trap composed of 89 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:51:36] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:51:36] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 3 ms to minimize.
[2024-05-21 15:51:37] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 2 ms to minimize.
[2024-05-21 15:51:37] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 2 ms to minimize.
[2024-05-21 15:51:37] [INFO ] Deduced a trap composed of 86 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:51:37] [INFO ] Deduced a trap composed of 81 places in 128 ms of which 3 ms to minimize.
[2024-05-21 15:51:37] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 2 ms to minimize.
Problem TDEAD308 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/466 variables, 20/194 constraints. Problems are: Problem set: 14 solved, 377 unsolved
[2024-05-21 15:51:38] [INFO ] Deduced a trap composed of 98 places in 150 ms of which 3 ms to minimize.
[2024-05-21 15:51:38] [INFO ] Deduced a trap composed of 85 places in 129 ms of which 2 ms to minimize.
[2024-05-21 15:51:38] [INFO ] Deduced a trap composed of 84 places in 128 ms of which 3 ms to minimize.
[2024-05-21 15:51:38] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:51:39] [INFO ] Deduced a trap composed of 83 places in 139 ms of which 3 ms to minimize.
[2024-05-21 15:51:39] [INFO ] Deduced a trap composed of 82 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:51:39] [INFO ] Deduced a trap composed of 99 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:51:39] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:51:39] [INFO ] Deduced a trap composed of 88 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:51:39] [INFO ] Deduced a trap composed of 98 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:51:40] [INFO ] Deduced a trap composed of 98 places in 139 ms of which 2 ms to minimize.
[2024-05-21 15:51:40] [INFO ] Deduced a trap composed of 96 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:51:40] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:51:40] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:51:40] [INFO ] Deduced a trap composed of 86 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:51:40] [INFO ] Deduced a trap composed of 86 places in 142 ms of which 3 ms to minimize.
SMT process timed out in 30192ms, After SMT, problems are : Problem set: 14 solved, 377 unsolved
Search for dead transitions found 14 dead transitions in 30197ms
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 : 466/477 places, 378/403 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 465 transition count 378
Applied a total of 1 rules in 9 ms. Remains 465 /466 variables (removed 1) and now considering 378/378 (removed 0) transitions.
// Phase 1: matrix 378 rows 465 cols
[2024-05-21 15:51:40] [INFO ] Computed 100 invariants in 3 ms
[2024-05-21 15:51:41] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-21 15:51:41] [INFO ] Invariant cache hit.
[2024-05-21 15:51:41] [INFO ] Implicit Places using invariants and state equation in 531 ms returned [419]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 755 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 464/477 places, 378/403 transitions.
Applied a total of 0 rules in 7 ms. Remains 464 /464 variables (removed 0) and now considering 378/378 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31741 ms. Remains : 464/477 places, 378/403 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-06
Stuttering criterion allowed to conclude after 135 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLFireability-06 finished in 31860 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(p1 U (G(p1)||(p1&&G(p2))))))'
Support contains 3 out of 477 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 477/477 places, 403/403 transitions.
Graph (trivial) has 223 edges and 477 vertex of which 6 / 477 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 1043 edges and 472 vertex of which 471 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 470 transition count 344
Reduce places removed 51 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 53 rules applied. Total rules applied 106 place count 419 transition count 342
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 108 place count 417 transition count 342
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 108 place count 417 transition count 242
Deduced a syphon composed of 100 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 217 rules applied. Total rules applied 325 place count 300 transition count 242
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 332 place count 293 transition count 235
Iterating global reduction 3 with 7 rules applied. Total rules applied 339 place count 293 transition count 235
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 3 with 245 rules applied. Total rules applied 584 place count 168 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 586 place count 167 transition count 119
Applied a total of 586 rules in 56 ms. Remains 167 /477 variables (removed 310) and now considering 119/403 (removed 284) transitions.
// Phase 1: matrix 119 rows 167 cols
[2024-05-21 15:51:41] [INFO ] Computed 72 invariants in 2 ms
[2024-05-21 15:51:41] [INFO ] Implicit Places using invariants in 139 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 20, 21, 22, 23, 26, 49, 50, 51, 52, 53]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 142 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 149/477 places, 119/403 transitions.
Applied a total of 0 rules in 3 ms. Remains 149 /149 variables (removed 0) and now considering 119/119 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 201 ms. Remains : 149/477 places, 119/403 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-08
Product exploration explored 100000 steps with 15251 reset in 214 ms.
Product exploration explored 100000 steps with 15184 reset in 220 ms.
Computed a total of 14 stabilizing places and 12 stable transitions
Computed a total of 14 stabilizing places and 12 stable transitions
Detected a total of 14/149 stabilizing places and 12/119 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND (NOT p2) p1))), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 p1)), (X p1), (X (NOT (AND p2 (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
Knowledge based reduction with 13 factoid took 510 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (6618 resets) in 197 ms. (202 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40002 steps (2258 resets) in 93 ms. (425 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (2157 resets) in 70 ms. (563 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (2378 resets) in 68 ms. (579 steps per ms) remains 3/3 properties
// Phase 1: matrix 119 rows 149 cols
[2024-05-21 15:51:43] [INFO ] Computed 54 invariants in 2 ms
[2024-05-21 15:51:43] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 107/117 variables, 34/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 29/146 variables, 17/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 118/264 variables, 146/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 5/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 3/267 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/267 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/267 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/268 variables, and 208 constraints, problems are : Problem set: 0 solved, 3 unsolved in 192 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 149/149 constraints, ReadFeed: 5/5 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 107/117 variables, 34/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 29/146 variables, 17/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 118/264 variables, 146/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 5/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/264 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 3/267 variables, 3/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/267 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/267 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/267 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 267/268 variables, and 211 constraints, problems are : Problem set: 0 solved, 3 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 149/149 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 413ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 268 steps, including 12 resets, run visited all 3 properties in 2 ms. (steps per millisecond=134 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 10 ms.
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND (NOT p2) p1))), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 p1)), (X p1), (X (NOT (AND p2 (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 p2))), (F (NOT p1)), (F (NOT p2)), (F (NOT (AND p1 p2))), (F (NOT (OR p1 (NOT p2))))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p1 p2)))
Knowledge based reduction with 13 factoid took 640 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-14-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-14-LTLFireability-08 finished in 2746 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(p0) U (G(!p1)||X(G(p2)))))'
Support contains 5 out of 477 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 403/403 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 471 transition count 397
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 471 transition count 397
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 467 transition count 393
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 467 transition count 393
Applied a total of 20 rules in 26 ms. Remains 467 /477 variables (removed 10) and now considering 393/403 (removed 10) transitions.
// Phase 1: matrix 393 rows 467 cols
[2024-05-21 15:51:44] [INFO ] Computed 94 invariants in 6 ms
[2024-05-21 15:51:44] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-05-21 15:51:44] [INFO ] Invariant cache hit.
[2024-05-21 15:51:45] [INFO ] Implicit Places using invariants and state equation in 621 ms returned []
Implicit Place search using SMT with State Equation took 829 ms to find 0 implicit places.
Running 392 sub problems to find dead transitions.
[2024-05-21 15:51:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (OVERLAPS) 1/467 variables, 55/92 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/467 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-05-21 15:51:52] [INFO ] Deduced a trap composed of 81 places in 141 ms of which 3 ms to minimize.
[2024-05-21 15:51:53] [INFO ] Deduced a trap composed of 82 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:51:53] [INFO ] Deduced a trap composed of 98 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:51:53] [INFO ] Deduced a trap composed of 98 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:51:53] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:51:53] [INFO ] Deduced a trap composed of 94 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:51:53] [INFO ] Deduced a trap composed of 85 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:51:53] [INFO ] Deduced a trap composed of 94 places in 107 ms of which 3 ms to minimize.
[2024-05-21 15:51:53] [INFO ] Deduced a trap composed of 82 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:51:54] [INFO ] Deduced a trap composed of 85 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:51:54] [INFO ] Deduced a trap composed of 86 places in 143 ms of which 2 ms to minimize.
[2024-05-21 15:51:54] [INFO ] Deduced a trap composed of 101 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:51:54] [INFO ] Deduced a trap composed of 85 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:51:54] [INFO ] Deduced a trap composed of 80 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:51:54] [INFO ] Deduced a trap composed of 83 places in 126 ms of which 2 ms to minimize.
[2024-05-21 15:51:55] [INFO ] Deduced a trap composed of 86 places in 141 ms of which 2 ms to minimize.
[2024-05-21 15:51:55] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:51:55] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:51:55] [INFO ] Deduced a trap composed of 86 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:51:55] [INFO ] Deduced a trap composed of 88 places in 133 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/467 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-05-21 15:51:55] [INFO ] Deduced a trap composed of 98 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:51:56] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:51:56] [INFO ] Deduced a trap composed of 98 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:51:56] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:51:56] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:51:56] [INFO ] Deduced a trap composed of 100 places in 124 ms of which 2 ms to minimize.
[2024-05-21 15:51:56] [INFO ] Deduced a trap composed of 38 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:51:57] [INFO ] Deduced a trap composed of 86 places in 152 ms of which 3 ms to minimize.
[2024-05-21 15:51:57] [INFO ] Deduced a trap composed of 94 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:51:57] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:51:57] [INFO ] Deduced a trap composed of 85 places in 140 ms of which 2 ms to minimize.
[2024-05-21 15:51:57] [INFO ] Deduced a trap composed of 84 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:51:57] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:51:57] [INFO ] Deduced a trap composed of 83 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:51:58] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:51:58] [INFO ] Deduced a trap composed of 91 places in 140 ms of which 2 ms to minimize.
[2024-05-21 15:51:58] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 2 ms to minimize.
[2024-05-21 15:51:58] [INFO ] Deduced a trap composed of 76 places in 139 ms of which 3 ms to minimize.
[2024-05-21 15:51:58] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 2 ms to minimize.
[2024-05-21 15:51:59] [INFO ] Deduced a trap composed of 61 places in 152 ms of which 3 ms to minimize.
Problem TDEAD315 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 20/134 constraints. Problems are: Problem set: 1 solved, 391 unsolved
[2024-05-21 15:51:59] [INFO ] Deduced a trap composed of 88 places in 136 ms of which 2 ms to minimize.
[2024-05-21 15:51:59] [INFO ] Deduced a trap composed of 36 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:51:59] [INFO ] Deduced a trap composed of 84 places in 143 ms of which 3 ms to minimize.
[2024-05-21 15:52:00] [INFO ] Deduced a trap composed of 86 places in 142 ms of which 3 ms to minimize.
[2024-05-21 15:52:00] [INFO ] Deduced a trap composed of 80 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:52:00] [INFO ] Deduced a trap composed of 87 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:52:00] [INFO ] Deduced a trap composed of 87 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:52:00] [INFO ] Deduced a trap composed of 83 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:52:01] [INFO ] Deduced a trap composed of 36 places in 134 ms of which 2 ms to minimize.
[2024-05-21 15:52:01] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 2 ms to minimize.
[2024-05-21 15:52:01] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-05-21 15:52:01] [INFO ] Deduced a trap composed of 80 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:52:01] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:52:02] [INFO ] Deduced a trap composed of 85 places in 180 ms of which 3 ms to minimize.
[2024-05-21 15:52:02] [INFO ] Deduced a trap composed of 82 places in 148 ms of which 3 ms to minimize.
[2024-05-21 15:52:02] [INFO ] Deduced a trap composed of 85 places in 142 ms of which 3 ms to minimize.
[2024-05-21 15:52:03] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:52:03] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 3 ms to minimize.
[2024-05-21 15:52:03] [INFO ] Deduced a trap composed of 69 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:52:03] [INFO ] Deduced a trap composed of 33 places in 127 ms of which 3 ms to minimize.
Problem TDEAD309 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 20/154 constraints. Problems are: Problem set: 11 solved, 381 unsolved
[2024-05-21 15:52:06] [INFO ] Deduced a trap composed of 101 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:52:06] [INFO ] Deduced a trap composed of 101 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:52:06] [INFO ] Deduced a trap composed of 74 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:52:06] [INFO ] Deduced a trap composed of 79 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:52:06] [INFO ] Deduced a trap composed of 93 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:52:06] [INFO ] Deduced a trap composed of 83 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:52:07] [INFO ] Deduced a trap composed of 85 places in 107 ms of which 3 ms to minimize.
[2024-05-21 15:52:07] [INFO ] Deduced a trap composed of 83 places in 124 ms of which 2 ms to minimize.
[2024-05-21 15:52:07] [INFO ] Deduced a trap composed of 43 places in 152 ms of which 3 ms to minimize.
[2024-05-21 15:52:08] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 1 ms to minimize.
[2024-05-21 15:52:08] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 2 ms to minimize.
[2024-05-21 15:52:09] [INFO ] Deduced a trap composed of 40 places in 150 ms of which 3 ms to minimize.
[2024-05-21 15:52:09] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:52:09] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:52:09] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:52:10] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:52:10] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 3 ms to minimize.
[2024-05-21 15:52:10] [INFO ] Deduced a trap composed of 45 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:52:10] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 3 ms to minimize.
[2024-05-21 15:52:10] [INFO ] Deduced a trap composed of 44 places in 131 ms of which 3 ms to minimize.
Problem TDEAD341 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 20/174 constraints. Problems are: Problem set: 12 solved, 380 unsolved
[2024-05-21 15:52:11] [INFO ] Deduced a trap composed of 80 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:52:11] [INFO ] Deduced a trap composed of 84 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:52:11] [INFO ] Deduced a trap composed of 89 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:52:12] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:52:12] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:52:12] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:52:12] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:52:12] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 3 ms to minimize.
[2024-05-21 15:52:12] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:52:12] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:52:12] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 5 ms to minimize.
[2024-05-21 15:52:13] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:52:13] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:52:13] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:52:13] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 2 ms to minimize.
[2024-05-21 15:52:14] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2024-05-21 15:52:14] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 2 ms to minimize.
[2024-05-21 15:52:14] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:52:14] [INFO ] Deduced a trap composed of 83 places in 167 ms of which 3 ms to minimize.
[2024-05-21 15:52:14] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 3 ms to minimize.
Problem TDEAD324 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 20/194 constraints. Problems are: Problem set: 13 solved, 379 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 467/860 variables, and 194 constraints, problems are : Problem set: 13 solved, 379 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/467 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 13 solved, 379 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 37/37 constraints. Problems are: Problem set: 13 solved, 379 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 0/37 constraints. Problems are: Problem set: 13 solved, 379 unsolved
At refinement iteration 2 (OVERLAPS) 1/467 variables, 55/92 constraints. Problems are: Problem set: 13 solved, 379 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/467 variables, 2/94 constraints. Problems are: Problem set: 13 solved, 379 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/467 variables, 100/194 constraints. Problems are: Problem set: 13 solved, 379 unsolved
[2024-05-21 15:52:18] [INFO ] Deduced a trap composed of 40 places in 150 ms of which 3 ms to minimize.
[2024-05-21 15:52:18] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:52:18] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:52:19] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:52:19] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 3 ms to minimize.
[2024-05-21 15:52:19] [INFO ] Deduced a trap composed of 89 places in 151 ms of which 4 ms to minimize.
[2024-05-21 15:52:19] [INFO ] Deduced a trap composed of 96 places in 147 ms of which 3 ms to minimize.
[2024-05-21 15:52:19] [INFO ] Deduced a trap composed of 99 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:52:19] [INFO ] Deduced a trap composed of 88 places in 118 ms of which 2 ms to minimize.
[2024-05-21 15:52:19] [INFO ] Deduced a trap composed of 93 places in 146 ms of which 3 ms to minimize.
[2024-05-21 15:52:20] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:52:20] [INFO ] Deduced a trap composed of 87 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:52:20] [INFO ] Deduced a trap composed of 81 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:52:20] [INFO ] Deduced a trap composed of 98 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:52:20] [INFO ] Deduced a trap composed of 85 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:52:20] [INFO ] Deduced a trap composed of 61 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:52:20] [INFO ] Deduced a trap composed of 86 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:52:21] [INFO ] Deduced a trap composed of 72 places in 153 ms of which 3 ms to minimize.
[2024-05-21 15:52:21] [INFO ] Deduced a trap composed of 72 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:52:21] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 2 ms to minimize.
Problem TDEAD317 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 20/214 constraints. Problems are: Problem set: 16 solved, 376 unsolved
[2024-05-21 15:52:21] [INFO ] Deduced a trap composed of 79 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:52:22] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:52:22] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:52:22] [INFO ] Deduced a trap composed of 65 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:52:22] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:52:22] [INFO ] Deduced a trap composed of 35 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:52:23] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:52:23] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-21 15:52:24] [INFO ] Deduced a trap composed of 85 places in 162 ms of which 3 ms to minimize.
[2024-05-21 15:52:24] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 2 ms to minimize.
[2024-05-21 15:52:24] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:52:24] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 2 ms to minimize.
[2024-05-21 15:52:24] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:52:25] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-21 15:52:25] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:52:25] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 1 ms to minimize.
[2024-05-21 15:52:25] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:52:25] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 2 ms to minimize.
[2024-05-21 15:52:26] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:52:26] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 20/234 constraints. Problems are: Problem set: 16 solved, 376 unsolved
[2024-05-21 15:52:27] [INFO ] Deduced a trap composed of 83 places in 142 ms of which 3 ms to minimize.
[2024-05-21 15:52:27] [INFO ] Deduced a trap composed of 89 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:52:27] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 2 ms to minimize.
[2024-05-21 15:52:27] [INFO ] Deduced a trap composed of 94 places in 146 ms of which 3 ms to minimize.
[2024-05-21 15:52:27] [INFO ] Deduced a trap composed of 76 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:52:27] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:52:27] [INFO ] Deduced a trap composed of 84 places in 134 ms of which 2 ms to minimize.
[2024-05-21 15:52:28] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:52:28] [INFO ] Deduced a trap composed of 34 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:52:28] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 0 ms to minimize.
[2024-05-21 15:52:29] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 2 ms to minimize.
[2024-05-21 15:52:29] [INFO ] Deduced a trap composed of 83 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:52:29] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:52:29] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:52:30] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:52:30] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:52:30] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:52:30] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:52:30] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-21 15:52:30] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
Problem TDEAD329 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 20/254 constraints. Problems are: Problem set: 17 solved, 375 unsolved
[2024-05-21 15:52:31] [INFO ] Deduced a trap composed of 83 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:52:31] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:52:32] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 1 ms to minimize.
[2024-05-21 15:52:33] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:52:33] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:52:33] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:52:33] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 1 ms to minimize.
[2024-05-21 15:52:34] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 0 ms to minimize.
[2024-05-21 15:52:34] [INFO ] Deduced a trap composed of 85 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:52:34] [INFO ] Deduced a trap composed of 83 places in 128 ms of which 2 ms to minimize.
[2024-05-21 15:52:34] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 17 ms to minimize.
[2024-05-21 15:52:34] [INFO ] Deduced a trap composed of 80 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:52:35] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:52:35] [INFO ] Deduced a trap composed of 79 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:52:35] [INFO ] Deduced a trap composed of 74 places in 137 ms of which 3 ms to minimize.
[2024-05-21 15:52:35] [INFO ] Deduced a trap composed of 62 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:52:35] [INFO ] Deduced a trap composed of 92 places in 100 ms of which 3 ms to minimize.
[2024-05-21 15:52:35] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:52:36] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:52:36] [INFO ] Deduced a trap composed of 81 places in 118 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 20/274 constraints. Problems are: Problem set: 17 solved, 375 unsolved
[2024-05-21 15:52:37] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 3 ms to minimize.
[2024-05-21 15:52:37] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:52:38] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:52:38] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 2 ms to minimize.
[2024-05-21 15:52:38] [INFO ] Deduced a trap composed of 58 places in 55 ms of which 1 ms to minimize.
[2024-05-21 15:52:39] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:52:39] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:52:39] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-21 15:52:40] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:52:41] [INFO ] Deduced a trap composed of 82 places in 160 ms of which 3 ms to minimize.
[2024-05-21 15:52:41] [INFO ] Deduced a trap composed of 67 places in 136 ms of which 2 ms to minimize.
[2024-05-21 15:52:41] [INFO ] Deduced a trap composed of 69 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:52:41] [INFO ] Deduced a trap composed of 87 places in 141 ms of which 3 ms to minimize.
[2024-05-21 15:52:41] [INFO ] Deduced a trap composed of 85 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:52:42] [INFO ] Deduced a trap composed of 74 places in 165 ms of which 3 ms to minimize.
[2024-05-21 15:52:42] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:52:42] [INFO ] Deduced a trap composed of 73 places in 116 ms of which 4 ms to minimize.
[2024-05-21 15:52:42] [INFO ] Deduced a trap composed of 68 places in 133 ms of which 2 ms to minimize.
[2024-05-21 15:52:42] [INFO ] Deduced a trap composed of 81 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:52:43] [INFO ] Deduced a trap composed of 62 places in 131 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/467 variables, 20/294 constraints. Problems are: Problem set: 17 solved, 375 unsolved
[2024-05-21 15:52:44] [INFO ] Deduced a trap composed of 79 places in 147 ms of which 3 ms to minimize.
[2024-05-21 15:52:44] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:52:44] [INFO ] Deduced a trap composed of 43 places in 127 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 467/860 variables, and 297 constraints, problems are : Problem set: 17 solved, 375 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/467 constraints, PredecessorRefiner: 0/392 constraints, Known Traps: 203/203 constraints]
After SMT, in 60116ms problems are : Problem set: 17 solved, 375 unsolved
Search for dead transitions found 17 dead transitions in 60122ms
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 : 467/477 places, 376/403 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 464 transition count 376
Applied a total of 3 rules in 8 ms. Remains 464 /467 variables (removed 3) and now considering 376/376 (removed 0) transitions.
// Phase 1: matrix 376 rows 464 cols
[2024-05-21 15:52:45] [INFO ] Computed 100 invariants in 6 ms
[2024-05-21 15:52:45] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-21 15:52:45] [INFO ] Invariant cache hit.
[2024-05-21 15:52:46] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 628 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 464/477 places, 376/403 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61615 ms. Remains : 464/477 places, 376/403 transitions.
Stuttering acceptance computed with spot in 320 ms :[(NOT p2), (AND (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (AND (NOT p0) (NOT p2)), true, p1, (NOT p0), (AND p1 (NOT p0) p2)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-10
Product exploration explored 100000 steps with 682 reset in 209 ms.
Product exploration explored 100000 steps with 684 reset in 205 ms.
Computed a total of 124 stabilizing places and 117 stable transitions
Graph (complete) has 981 edges and 464 vertex of which 463 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 124 stabilizing places and 117 stable transitions
Detected a total of 124/464 stabilizing places and 117/376 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 p2))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND p1 p2))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 43 factoid took 171 ms. Reduced automaton from 9 states, 31 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p2), (AND (NOT p2) p1), p1]
RANDOM walk for 40000 steps (273 resets) in 373 ms. (106 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (42 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (31 resets) in 63 ms. (625 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (34 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
[2024-05-21 15:52:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 124/128 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 211/339 variables, 50/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 15:52:47] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-21 15:52:47] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-21 15:52:47] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-21 15:52:47] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
[2024-05-21 15:52:47] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-21 15:52:47] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 0 ms to minimize.
[2024-05-21 15:52:48] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 116/455 variables, 45/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 15:52:48] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 370/825 variables, 455/563 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 15:52:48] [INFO ] Deduced a trap composed of 54 places in 261 ms of which 2 ms to minimize.
[2024-05-21 15:52:48] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 1 ms to minimize.
[2024-05-21 15:52:48] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/825 variables, 3/566 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/825 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 13/838 variables, 7/573 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 15:52:48] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/838 variables, 1/574 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/838 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 2/840 variables, 2/576 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/840 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/840 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 840/840 variables, and 576 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1771 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 464/464 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 124/128 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 211/339 variables, 50/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 15:52:49] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-21 15:52:49] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 2 ms to minimize.
[2024-05-21 15:52:49] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 116/455 variables, 45/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 370/825 variables, 455/569 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 15:52:49] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-05-21 15:52:49] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2024-05-21 15:52:50] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/825 variables, 3/572 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/825 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 13/838 variables, 7/579 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/838 variables, 3/582 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/838 variables, 1/583 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 15:52:50] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/838 variables, 1/584 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/838 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/840 variables, 2/586 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/840 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/840 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 840/840 variables, and 586 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1369 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 464/464 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 19/19 constraints]
After SMT, in 3151ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 150 ms.
Support contains 4 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 376/376 transitions.
Graph (complete) has 981 edges and 464 vertex of which 463 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 463 transition count 327
Reduce places removed 48 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 50 rules applied. Total rules applied 99 place count 415 transition count 325
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 101 place count 413 transition count 325
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 101 place count 413 transition count 225
Deduced a syphon composed of 100 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 217 rules applied. Total rules applied 318 place count 296 transition count 225
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 319 place count 295 transition count 224
Iterating global reduction 3 with 1 rules applied. Total rules applied 320 place count 295 transition count 224
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 3 with 264 rules applied. Total rules applied 584 place count 156 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 585 place count 156 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 587 place count 155 transition count 102
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 593 place count 155 transition count 102
Applied a total of 593 rules in 31 ms. Remains 155 /464 variables (removed 309) and now considering 102/376 (removed 274) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 155/464 places, 102/376 transitions.
RANDOM walk for 40000 steps (3925 resets) in 308 ms. (129 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1024 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
Probably explored full state space saw : 16141 states, properties seen :0
Probabilistic random walk after 56429 steps, saw 16141 distinct states, run finished after 186 ms. (steps per millisecond=303 ) properties seen :0
Explored full state space saw : 16141 states, properties seen :0
Exhaustive walk after 56429 steps, saw 16141 distinct states, run finished after 159 ms. (steps per millisecond=354 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 p2))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND p1 p2))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (G (OR (NOT p1) p2))]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F p1), (F (NOT p2)), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 44 factoid took 326 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p2), (AND (NOT p2) p1), p1]
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p2), (AND (NOT p2) p1), p1]
Support contains 4 out of 464 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 : 464/464 places, 376/376 transitions.
Graph (complete) has 981 edges and 464 vertex of which 463 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 462 transition count 326
Reduce places removed 48 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 50 rules applied. Total rules applied 99 place count 414 transition count 324
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 101 place count 412 transition count 324
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 101 place count 412 transition count 225
Deduced a syphon composed of 99 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 3 with 215 rules applied. Total rules applied 316 place count 296 transition count 225
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 3 with 264 rules applied. Total rules applied 580 place count 157 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 581 place count 157 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 583 place count 156 transition count 103
Applied a total of 583 rules in 40 ms. Remains 156 /464 variables (removed 308) and now considering 103/376 (removed 273) transitions.
// Phase 1: matrix 103 rows 156 cols
[2024-05-21 15:52:51] [INFO ] Computed 69 invariants in 0 ms
[2024-05-21 15:52:52] [INFO ] Implicit Places using invariants in 150 ms returned [1, 2, 3, 4, 5, 6, 7, 15, 16, 20, 21, 22, 23, 24, 25, 36, 37, 38, 39, 40]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 151 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 136/464 places, 103/376 transitions.
Applied a total of 0 rules in 2 ms. Remains 136 /136 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 193 ms. Remains : 136/464 places, 103/376 transitions.
Computed a total of 14 stabilizing places and 12 stable transitions
Computed a total of 14 stabilizing places and 12 stable transitions
Detected a total of 14/136 stabilizing places and 12/103 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1)), (X p2), (X (AND (NOT p1) p2)), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 11 factoid took 416 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p2), (AND (NOT p2) p1), p1]
RANDOM walk for 40000 steps (3996 resets) in 175 ms. (227 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (992 resets) in 51 ms. (769 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (888 resets) in 63 ms. (625 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (912 resets) in 48 ms. (816 steps per ms) remains 3/3 properties
// Phase 1: matrix 103 rows 136 cols
[2024-05-21 15:52:52] [INFO ] Computed 49 invariants in 0 ms
[2024-05-21 15:52:52] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 43/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 72/119 variables, 34/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 15:52:52] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 14/133 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 103/236 variables, 133/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 5/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 3/239 variables, 3/191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/239 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/239 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/239 variables, and 191 constraints, problems are : Problem set: 0 solved, 3 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 136/136 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 43/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 72/119 variables, 34/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 14/133 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 103/236 variables, 133/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 5/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 3/239 variables, 3/192 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/239 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/239 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/239 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/239 variables, and 194 constraints, problems are : Problem set: 0 solved, 3 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 136/136 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 459ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 48 ms.
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 103/103 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 135 transition count 102
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 135 transition count 102
Applied a total of 3 rules in 8 ms. Remains 135 /136 variables (removed 1) and now considering 102/103 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 135/136 places, 102/103 transitions.
RANDOM walk for 40000 steps (3987 resets) in 152 ms. (261 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (882 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Probably explored full state space saw : 16144 states, properties seen :0
Probabilistic random walk after 56442 steps, saw 16144 distinct states, run finished after 145 ms. (steps per millisecond=389 ) properties seen :0
Explored full state space saw : 16144 states, properties seen :0
Exhaustive walk after 56442 steps, saw 16144 distinct states, run finished after 115 ms. (steps per millisecond=490 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1)), (X p2), (X (AND (NOT p1) p2)), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (G (OR (NOT p1) p2))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (NOT (OR p1 p2))), (F p1), (F (NOT p2)), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 12 factoid took 907 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p2), (AND (NOT p2) p1), p1]
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p2), (AND (NOT p2) p1), p1]
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p2), (AND (NOT p2) p1), p1]
Product exploration explored 100000 steps with 9895 reset in 251 ms.
Product exploration explored 100000 steps with 9915 reset in 265 ms.
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 103/103 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 135 transition count 102
Applied a total of 2 rules in 8 ms. Remains 135 /136 variables (removed 1) and now considering 102/103 (removed 1) transitions.
// Phase 1: matrix 102 rows 135 cols
[2024-05-21 15:52:55] [INFO ] Computed 49 invariants in 2 ms
[2024-05-21 15:52:55] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-21 15:52:55] [INFO ] Invariant cache hit.
[2024-05-21 15:52:55] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 15:52:55] [INFO ] Implicit Places using invariants and state equation in 162 ms returned [8, 11, 78, 80, 82, 84]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 315 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/136 places, 102/103 transitions.
Graph (complete) has 383 edges and 129 vertex of which 118 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 118 transition count 96
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 117 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 2 with 2 rules applied. Total rules applied 5 place count 116 transition count 95
Applied a total of 5 rules in 5 ms. Remains 116 /129 variables (removed 13) and now considering 95/102 (removed 7) transitions.
// Phase 1: matrix 95 rows 116 cols
[2024-05-21 15:52:55] [INFO ] Computed 37 invariants in 0 ms
[2024-05-21 15:52:55] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-21 15:52:55] [INFO ] Invariant cache hit.
[2024-05-21 15:52:55] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 15:52:55] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 116/136 places, 95/103 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 529 ms. Remains : 116/136 places, 95/103 transitions.
Treatment of property BusinessProcesses-PT-14-LTLFireability-10 finished in 71512 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U X(X(X((p1 U p2))))))))'
Support contains 3 out of 477 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 403/403 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 471 transition count 397
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 471 transition count 397
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 467 transition count 393
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 467 transition count 393
Applied a total of 20 rules in 23 ms. Remains 467 /477 variables (removed 10) and now considering 393/403 (removed 10) transitions.
// Phase 1: matrix 393 rows 467 cols
[2024-05-21 15:52:56] [INFO ] Computed 94 invariants in 3 ms
[2024-05-21 15:52:56] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-21 15:52:56] [INFO ] Invariant cache hit.
[2024-05-21 15:52:56] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
Running 392 sub problems to find dead transitions.
[2024-05-21 15:52:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (OVERLAPS) 1/467 variables, 55/92 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/467 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-05-21 15:53:04] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:53:04] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:53:04] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:53:04] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:53:04] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:53:04] [INFO ] Deduced a trap composed of 100 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:53:05] [INFO ] Deduced a trap composed of 93 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:53:05] [INFO ] Deduced a trap composed of 94 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:53:05] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:53:05] [INFO ] Deduced a trap composed of 90 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:53:05] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 2 ms to minimize.
[2024-05-21 15:53:05] [INFO ] Deduced a trap composed of 103 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:53:05] [INFO ] Deduced a trap composed of 98 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:53:06] [INFO ] Deduced a trap composed of 87 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:53:06] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:53:06] [INFO ] Deduced a trap composed of 101 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:53:06] [INFO ] Deduced a trap composed of 100 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:53:06] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:53:06] [INFO ] Deduced a trap composed of 98 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:53:06] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/467 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-05-21 15:53:07] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:53:07] [INFO ] Deduced a trap composed of 98 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:53:07] [INFO ] Deduced a trap composed of 89 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:53:07] [INFO ] Deduced a trap composed of 87 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:53:07] [INFO ] Deduced a trap composed of 87 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:53:07] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:53:07] [INFO ] Deduced a trap composed of 84 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:53:07] [INFO ] Deduced a trap composed of 86 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:53:08] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:53:08] [INFO ] Deduced a trap composed of 89 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:53:08] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:53:08] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:53:08] [INFO ] Deduced a trap composed of 85 places in 147 ms of which 3 ms to minimize.
[2024-05-21 15:53:08] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:53:09] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:53:09] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:53:09] [INFO ] Deduced a trap composed of 97 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:53:09] [INFO ] Deduced a trap composed of 87 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:53:09] [INFO ] Deduced a trap composed of 87 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:53:09] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 2 ms to minimize.
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 20/134 constraints. Problems are: Problem set: 8 solved, 384 unsolved
[2024-05-21 15:53:10] [INFO ] Deduced a trap composed of 99 places in 151 ms of which 3 ms to minimize.
[2024-05-21 15:53:10] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:53:10] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:53:10] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:53:10] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:53:10] [INFO ] Deduced a trap composed of 90 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:53:11] [INFO ] Deduced a trap composed of 101 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:53:11] [INFO ] Deduced a trap composed of 98 places in 133 ms of which 2 ms to minimize.
[2024-05-21 15:53:11] [INFO ] Deduced a trap composed of 87 places in 138 ms of which 3 ms to minimize.
[2024-05-21 15:53:11] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:53:11] [INFO ] Deduced a trap composed of 79 places in 137 ms of which 3 ms to minimize.
[2024-05-21 15:53:11] [INFO ] Deduced a trap composed of 85 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:53:12] [INFO ] Deduced a trap composed of 82 places in 129 ms of which 2 ms to minimize.
[2024-05-21 15:53:12] [INFO ] Deduced a trap composed of 75 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:53:12] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:53:12] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:53:12] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 3 ms to minimize.
[2024-05-21 15:53:12] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:53:13] [INFO ] Deduced a trap composed of 64 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:53:13] [INFO ] Deduced a trap composed of 68 places in 95 ms of which 2 ms to minimize.
Problem TDEAD330 is UNSAT
Problem TDEAD335 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 20/154 constraints. Problems are: Problem set: 10 solved, 382 unsolved
[2024-05-21 15:53:15] [INFO ] Deduced a trap composed of 86 places in 158 ms of which 4 ms to minimize.
[2024-05-21 15:53:16] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 3 ms to minimize.
[2024-05-21 15:53:16] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 2 ms to minimize.
[2024-05-21 15:53:16] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-21 15:53:17] [INFO ] Deduced a trap composed of 63 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:53:17] [INFO ] Deduced a trap composed of 81 places in 155 ms of which 2 ms to minimize.
[2024-05-21 15:53:17] [INFO ] Deduced a trap composed of 82 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:53:17] [INFO ] Deduced a trap composed of 81 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:53:18] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 3 ms to minimize.
[2024-05-21 15:53:18] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:53:18] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 4 ms to minimize.
[2024-05-21 15:53:19] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 3 ms to minimize.
[2024-05-21 15:53:19] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 3 ms to minimize.
[2024-05-21 15:53:19] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:53:19] [INFO ] Deduced a trap composed of 54 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:53:19] [INFO ] Deduced a trap composed of 43 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:53:20] [INFO ] Deduced a trap composed of 53 places in 128 ms of which 3 ms to minimize.
[2024-05-21 15:53:20] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:53:20] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:53:20] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 20/174 constraints. Problems are: Problem set: 10 solved, 382 unsolved
[2024-05-21 15:53:20] [INFO ] Deduced a trap composed of 87 places in 139 ms of which 3 ms to minimize.
[2024-05-21 15:53:21] [INFO ] Deduced a trap composed of 85 places in 157 ms of which 3 ms to minimize.
[2024-05-21 15:53:22] [INFO ] Deduced a trap composed of 84 places in 137 ms of which 3 ms to minimize.
[2024-05-21 15:53:22] [INFO ] Deduced a trap composed of 82 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:53:22] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:53:22] [INFO ] Deduced a trap composed of 83 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:53:22] [INFO ] Deduced a trap composed of 87 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:53:22] [INFO ] Deduced a trap composed of 80 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:53:22] [INFO ] Deduced a trap composed of 84 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:53:23] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:53:23] [INFO ] Deduced a trap composed of 83 places in 133 ms of which 2 ms to minimize.
[2024-05-21 15:53:23] [INFO ] Deduced a trap composed of 91 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:53:23] [INFO ] Deduced a trap composed of 95 places in 142 ms of which 3 ms to minimize.
[2024-05-21 15:53:23] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:53:23] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:53:24] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:53:24] [INFO ] Deduced a trap composed of 92 places in 142 ms of which 4 ms to minimize.
[2024-05-21 15:53:24] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:53:24] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:53:24] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 20/194 constraints. Problems are: Problem set: 10 solved, 382 unsolved
[2024-05-21 15:53:25] [INFO ] Deduced a trap composed of 90 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:53:25] [INFO ] Deduced a trap composed of 99 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:53:26] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:53:26] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-21 15:53:26] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-21 15:53:26] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 467/860 variables, and 200 constraints, problems are : Problem set: 10 solved, 382 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/467 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 106/106 constraints]
Escalating to Integer solving :Problem set: 10 solved, 382 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 37/37 constraints. Problems are: Problem set: 10 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 0/37 constraints. Problems are: Problem set: 10 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 1/467 variables, 55/92 constraints. Problems are: Problem set: 10 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/467 variables, 2/94 constraints. Problems are: Problem set: 10 solved, 382 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/467 variables, 106/200 constraints. Problems are: Problem set: 10 solved, 382 unsolved
[2024-05-21 15:53:30] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:53:30] [INFO ] Deduced a trap composed of 89 places in 138 ms of which 3 ms to minimize.
[2024-05-21 15:53:30] [INFO ] Deduced a trap composed of 101 places in 128 ms of which 3 ms to minimize.
[2024-05-21 15:53:30] [INFO ] Deduced a trap composed of 102 places in 115 ms of which 3 ms to minimize.
[2024-05-21 15:53:30] [INFO ] Deduced a trap composed of 90 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:53:31] [INFO ] Deduced a trap composed of 83 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:53:31] [INFO ] Deduced a trap composed of 89 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:53:31] [INFO ] Deduced a trap composed of 87 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:53:31] [INFO ] Deduced a trap composed of 88 places in 147 ms of which 2 ms to minimize.
[2024-05-21 15:53:31] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:53:31] [INFO ] Deduced a trap composed of 89 places in 137 ms of which 3 ms to minimize.
[2024-05-21 15:53:31] [INFO ] Deduced a trap composed of 87 places in 122 ms of which 4 ms to minimize.
[2024-05-21 15:53:32] [INFO ] Deduced a trap composed of 89 places in 146 ms of which 2 ms to minimize.
[2024-05-21 15:53:32] [INFO ] Deduced a trap composed of 96 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:53:32] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:53:32] [INFO ] Deduced a trap composed of 77 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:53:32] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 3 ms to minimize.
[2024-05-21 15:53:32] [INFO ] Deduced a trap composed of 100 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:53:32] [INFO ] Deduced a trap composed of 84 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:53:32] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 20/220 constraints. Problems are: Problem set: 10 solved, 382 unsolved
[2024-05-21 15:53:33] [INFO ] Deduced a trap composed of 95 places in 141 ms of which 2 ms to minimize.
[2024-05-21 15:53:33] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 1 ms to minimize.
[2024-05-21 15:53:33] [INFO ] Deduced a trap composed of 86 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:53:33] [INFO ] Deduced a trap composed of 80 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:53:33] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 3 ms to minimize.
[2024-05-21 15:53:34] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:53:34] [INFO ] Deduced a trap composed of 98 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:53:34] [INFO ] Deduced a trap composed of 96 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:53:34] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:53:34] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 3 ms to minimize.
[2024-05-21 15:53:34] [INFO ] Deduced a trap composed of 81 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:53:34] [INFO ] Deduced a trap composed of 84 places in 118 ms of which 2 ms to minimize.
[2024-05-21 15:53:34] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:53:35] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:53:35] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:53:35] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:53:35] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:53:35] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:53:35] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:53:35] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 3 ms to minimize.
Problem TDEAD309 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 20/240 constraints. Problems are: Problem set: 14 solved, 378 unsolved
[2024-05-21 15:53:36] [INFO ] Deduced a trap composed of 96 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:53:36] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 3 ms to minimize.
[2024-05-21 15:53:36] [INFO ] Deduced a trap composed of 79 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:53:36] [INFO ] Deduced a trap composed of 78 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:53:36] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:53:36] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:53:37] [INFO ] Deduced a trap composed of 82 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:53:37] [INFO ] Deduced a trap composed of 84 places in 132 ms of which 2 ms to minimize.
[2024-05-21 15:53:38] [INFO ] Deduced a trap composed of 25 places in 139 ms of which 3 ms to minimize.
[2024-05-21 15:53:38] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:53:38] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:53:38] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:53:38] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:53:39] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:53:39] [INFO ] Deduced a trap composed of 127 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:53:39] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 4 ms to minimize.
[2024-05-21 15:53:40] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:53:40] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:53:40] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 2 ms to minimize.
[2024-05-21 15:53:40] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 20/260 constraints. Problems are: Problem set: 14 solved, 378 unsolved
[2024-05-21 15:53:41] [INFO ] Deduced a trap composed of 89 places in 159 ms of which 2 ms to minimize.
[2024-05-21 15:53:42] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 2 ms to minimize.
[2024-05-21 15:53:42] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:53:42] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:53:43] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 3 ms to minimize.
[2024-05-21 15:53:43] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 6 ms to minimize.
[2024-05-21 15:53:44] [INFO ] Deduced a trap composed of 83 places in 154 ms of which 3 ms to minimize.
[2024-05-21 15:53:44] [INFO ] Deduced a trap composed of 96 places in 142 ms of which 3 ms to minimize.
[2024-05-21 15:53:44] [INFO ] Deduced a trap composed of 87 places in 163 ms of which 3 ms to minimize.
[2024-05-21 15:53:44] [INFO ] Deduced a trap composed of 93 places in 149 ms of which 2 ms to minimize.
[2024-05-21 15:53:45] [INFO ] Deduced a trap composed of 76 places in 156 ms of which 3 ms to minimize.
[2024-05-21 15:53:45] [INFO ] Deduced a trap composed of 84 places in 142 ms of which 3 ms to minimize.
[2024-05-21 15:53:45] [INFO ] Deduced a trap composed of 93 places in 124 ms of which 2 ms to minimize.
[2024-05-21 15:53:45] [INFO ] Deduced a trap composed of 89 places in 156 ms of which 3 ms to minimize.
[2024-05-21 15:53:45] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:53:45] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:53:46] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:53:46] [INFO ] Deduced a trap composed of 83 places in 150 ms of which 2 ms to minimize.
[2024-05-21 15:53:46] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:53:46] [INFO ] Deduced a trap composed of 89 places in 160 ms of which 3 ms to minimize.
Problem TDEAD312 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD322 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 20/280 constraints. Problems are: Problem set: 17 solved, 375 unsolved
[2024-05-21 15:53:47] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
[2024-05-21 15:53:47] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 3 ms to minimize.
[2024-05-21 15:53:47] [INFO ] Deduced a trap composed of 80 places in 147 ms of which 3 ms to minimize.
[2024-05-21 15:53:47] [INFO ] Deduced a trap composed of 84 places in 157 ms of which 3 ms to minimize.
[2024-05-21 15:53:48] [INFO ] Deduced a trap composed of 82 places in 151 ms of which 3 ms to minimize.
[2024-05-21 15:53:48] [INFO ] Deduced a trap composed of 89 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:53:48] [INFO ] Deduced a trap composed of 87 places in 163 ms of which 3 ms to minimize.
[2024-05-21 15:53:48] [INFO ] Deduced a trap composed of 100 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:53:48] [INFO ] Deduced a trap composed of 89 places in 128 ms of which 2 ms to minimize.
[2024-05-21 15:53:48] [INFO ] Deduced a trap composed of 86 places in 158 ms of which 3 ms to minimize.
[2024-05-21 15:53:49] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:53:49] [INFO ] Deduced a trap composed of 79 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:53:49] [INFO ] Deduced a trap composed of 92 places in 154 ms of which 3 ms to minimize.
[2024-05-21 15:53:49] [INFO ] Deduced a trap composed of 78 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:53:49] [INFO ] Deduced a trap composed of 90 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:53:49] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:53:50] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:53:50] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:53:50] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-21 15:53:50] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/467 variables, 20/300 constraints. Problems are: Problem set: 17 solved, 375 unsolved
[2024-05-21 15:53:52] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 2 ms to minimize.
[2024-05-21 15:53:52] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:53:53] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 2 ms to minimize.
[2024-05-21 15:53:53] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 3 ms to minimize.
[2024-05-21 15:53:53] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:53:53] [INFO ] Deduced a trap composed of 42 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:53:53] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 2 ms to minimize.
[2024-05-21 15:53:53] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:53:54] [INFO ] Deduced a trap composed of 83 places in 173 ms of which 3 ms to minimize.
[2024-05-21 15:53:54] [INFO ] Deduced a trap composed of 81 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:53:54] [INFO ] Deduced a trap composed of 83 places in 157 ms of which 3 ms to minimize.
[2024-05-21 15:53:54] [INFO ] Deduced a trap composed of 86 places in 128 ms of which 3 ms to minimize.
[2024-05-21 15:53:54] [INFO ] Deduced a trap composed of 85 places in 151 ms of which 3 ms to minimize.
[2024-05-21 15:53:54] [INFO ] Deduced a trap composed of 82 places in 131 ms of which 2 ms to minimize.
[2024-05-21 15:53:55] [INFO ] Deduced a trap composed of 80 places in 146 ms of which 3 ms to minimize.
[2024-05-21 15:53:55] [INFO ] Deduced a trap composed of 83 places in 146 ms of which 3 ms to minimize.
[2024-05-21 15:53:55] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:53:55] [INFO ] Deduced a trap composed of 76 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:53:55] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:53:55] [INFO ] Deduced a trap composed of 83 places in 116 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/467 variables, 20/320 constraints. Problems are: Problem set: 17 solved, 375 unsolved
[2024-05-21 15:53:56] [INFO ] Deduced a trap composed of 87 places in 141 ms of which 3 ms to minimize.
[2024-05-21 15:53:56] [INFO ] Deduced a trap composed of 86 places in 120 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 1)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 1)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 1)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 1)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 1)
(s72 0)
(s73 0)
(s74 1)
(s75 0)
(s76 0)
(s77 0)
(s78 1)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 1)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 1)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 timeout
0)
(s96 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 467/860 variables, and 322 constraints, problems are : Problem set: 17 solved, 375 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/467 constraints, PredecessorRefiner: 0/392 constraints, Known Traps: 228/228 constraints]
After SMT, in 60087ms problems are : Problem set: 17 solved, 375 unsolved
Search for dead transitions found 17 dead transitions in 60091ms
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 : 467/477 places, 376/403 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 464 transition count 376
Applied a total of 3 rules in 9 ms. Remains 464 /467 variables (removed 3) and now considering 376/376 (removed 0) transitions.
// Phase 1: matrix 376 rows 464 cols
[2024-05-21 15:53:56] [INFO ] Computed 100 invariants in 3 ms
[2024-05-21 15:53:57] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-05-21 15:53:57] [INFO ] Invariant cache hit.
[2024-05-21 15:53:57] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 704 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 464/477 places, 376/403 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61479 ms. Remains : 464/477 places, 376/403 transitions.
Stuttering acceptance computed with spot in 586 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-11
Stuttering criterion allowed to conclude after 334 steps with 6 reset in 0 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLFireability-11 finished in 62108 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 (G(p1) U X(p2)))))'
Support contains 3 out of 477 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 403/403 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 472 transition count 398
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 472 transition count 398
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 470 transition count 396
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 470 transition count 396
Applied a total of 14 rules in 17 ms. Remains 470 /477 variables (removed 7) and now considering 396/403 (removed 7) transitions.
// Phase 1: matrix 396 rows 470 cols
[2024-05-21 15:53:58] [INFO ] Computed 94 invariants in 4 ms
[2024-05-21 15:53:58] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-21 15:53:58] [INFO ] Invariant cache hit.
[2024-05-21 15:53:58] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
Running 395 sub problems to find dead transitions.
[2024-05-21 15:53:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (OVERLAPS) 1/470 variables, 55/92 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-05-21 15:54:06] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:54:06] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 3 ms to minimize.
[2024-05-21 15:54:06] [INFO ] Deduced a trap composed of 99 places in 96 ms of which 3 ms to minimize.
[2024-05-21 15:54:06] [INFO ] Deduced a trap composed of 75 places in 100 ms of which 3 ms to minimize.
[2024-05-21 15:54:06] [INFO ] Deduced a trap composed of 84 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:54:07] [INFO ] Deduced a trap composed of 105 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:54:07] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 3 ms to minimize.
[2024-05-21 15:54:07] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:54:07] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:54:07] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:54:07] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 3 ms to minimize.
[2024-05-21 15:54:07] [INFO ] Deduced a trap composed of 94 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:54:07] [INFO ] Deduced a trap composed of 94 places in 93 ms of which 3 ms to minimize.
[2024-05-21 15:54:07] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:54:08] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:54:08] [INFO ] Deduced a trap composed of 93 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:54:08] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 3 ms to minimize.
[2024-05-21 15:54:08] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 3 ms to minimize.
[2024-05-21 15:54:08] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 3 ms to minimize.
[2024-05-21 15:54:08] [INFO ] Deduced a trap composed of 96 places in 92 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-05-21 15:54:08] [INFO ] Deduced a trap composed of 87 places in 124 ms of which 2 ms to minimize.
[2024-05-21 15:54:09] [INFO ] Deduced a trap composed of 81 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:54:09] [INFO ] Deduced a trap composed of 91 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:54:09] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:54:09] [INFO ] Deduced a trap composed of 83 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:54:09] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 3 ms to minimize.
[2024-05-21 15:54:09] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:54:09] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:54:09] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:54:10] [INFO ] Deduced a trap composed of 98 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:54:10] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:54:10] [INFO ] Deduced a trap composed of 84 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:54:10] [INFO ] Deduced a trap composed of 95 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:54:10] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:54:10] [INFO ] Deduced a trap composed of 95 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:54:10] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:54:10] [INFO ] Deduced a trap composed of 88 places in 144 ms of which 2 ms to minimize.
[2024-05-21 15:54:11] [INFO ] Deduced a trap composed of 84 places in 144 ms of which 3 ms to minimize.
[2024-05-21 15:54:11] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:54:11] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 3 ms to minimize.
Problem TDEAD318 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD338 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 20/134 constraints. Problems are: Problem set: 3 solved, 392 unsolved
[2024-05-21 15:54:12] [INFO ] Deduced a trap composed of 104 places in 141 ms of which 2 ms to minimize.
[2024-05-21 15:54:12] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:54:12] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:54:12] [INFO ] Deduced a trap composed of 93 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:54:12] [INFO ] Deduced a trap composed of 94 places in 139 ms of which 2 ms to minimize.
[2024-05-21 15:54:12] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:54:12] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:54:13] [INFO ] Deduced a trap composed of 84 places in 143 ms of which 2 ms to minimize.
[2024-05-21 15:54:13] [INFO ] Deduced a trap composed of 84 places in 139 ms of which 3 ms to minimize.
[2024-05-21 15:54:13] [INFO ] Deduced a trap composed of 85 places in 153 ms of which 3 ms to minimize.
[2024-05-21 15:54:13] [INFO ] Deduced a trap composed of 82 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:54:13] [INFO ] Deduced a trap composed of 90 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:54:13] [INFO ] Deduced a trap composed of 82 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:54:14] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 3 ms to minimize.
[2024-05-21 15:54:14] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:54:14] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:54:14] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 2 ms to minimize.
[2024-05-21 15:54:15] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 2 ms to minimize.
[2024-05-21 15:54:16] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 3 ms to minimize.
[2024-05-21 15:54:16] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 3 ms to minimize.
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD344 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 20/154 constraints. Problems are: Problem set: 7 solved, 388 unsolved
[2024-05-21 15:54:19] [INFO ] Deduced a trap composed of 86 places in 144 ms of which 3 ms to minimize.
[2024-05-21 15:54:19] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:54:19] [INFO ] Deduced a trap composed of 99 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:54:19] [INFO ] Deduced a trap composed of 84 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:54:20] [INFO ] Deduced a trap composed of 87 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:54:20] [INFO ] Deduced a trap composed of 83 places in 142 ms of which 2 ms to minimize.
[2024-05-21 15:54:20] [INFO ] Deduced a trap composed of 89 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:54:20] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:54:20] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:54:20] [INFO ] Deduced a trap composed of 85 places in 142 ms of which 3 ms to minimize.
[2024-05-21 15:54:20] [INFO ] Deduced a trap composed of 85 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:54:20] [INFO ] Deduced a trap composed of 82 places in 115 ms of which 3 ms to minimize.
[2024-05-21 15:54:21] [INFO ] Deduced a trap composed of 89 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:54:21] [INFO ] Deduced a trap composed of 82 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:54:21] [INFO ] Deduced a trap composed of 95 places in 135 ms of which 2 ms to minimize.
[2024-05-21 15:54:21] [INFO ] Deduced a trap composed of 99 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:54:21] [INFO ] Deduced a trap composed of 98 places in 106 ms of which 3 ms to minimize.
[2024-05-21 15:54:21] [INFO ] Deduced a trap composed of 99 places in 106 ms of which 3 ms to minimize.
[2024-05-21 15:54:21] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:54:21] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 20/174 constraints. Problems are: Problem set: 7 solved, 388 unsolved
[2024-05-21 15:54:22] [INFO ] Deduced a trap composed of 81 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:54:22] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:54:22] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:54:23] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:54:23] [INFO ] Deduced a trap composed of 90 places in 101 ms of which 3 ms to minimize.
[2024-05-21 15:54:23] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:54:23] [INFO ] Deduced a trap composed of 87 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:54:23] [INFO ] Deduced a trap composed of 98 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:54:23] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:54:23] [INFO ] Deduced a trap composed of 81 places in 94 ms of which 3 ms to minimize.
[2024-05-21 15:54:23] [INFO ] Deduced a trap composed of 82 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:54:23] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:54:24] [INFO ] Deduced a trap composed of 87 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:54:25] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 3 ms to minimize.
[2024-05-21 15:54:25] [INFO ] Deduced a trap composed of 30 places in 137 ms of which 2 ms to minimize.
[2024-05-21 15:54:26] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 6 ms to minimize.
[2024-05-21 15:54:26] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:54:26] [INFO ] Deduced a trap composed of 53 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:54:26] [INFO ] Deduced a trap composed of 60 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:54:26] [INFO ] Deduced a trap composed of 48 places in 141 ms of which 2 ms to minimize.
Problem TDEAD328 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 20/194 constraints. Problems are: Problem set: 8 solved, 387 unsolved
[2024-05-21 15:54:27] [INFO ] Deduced a trap composed of 87 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:54:27] [INFO ] Deduced a trap composed of 78 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:54:27] [INFO ] Deduced a trap composed of 33 places in 144 ms of which 4 ms to minimize.
[2024-05-21 15:54:27] [INFO ] Deduced a trap composed of 95 places in 148 ms of which 3 ms to minimize.
[2024-05-21 15:54:27] [INFO ] Deduced a trap composed of 80 places in 143 ms of which 2 ms to minimize.
[2024-05-21 15:54:28] [INFO ] Deduced a trap composed of 79 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:54:28] [INFO ] Deduced a trap composed of 79 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:54:28] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 2 ms to minimize.
[2024-05-21 15:54:28] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
[2024-05-21 15:54:28] [INFO ] Deduced a trap composed of 89 places in 147 ms of which 3 ms to minimize.
[2024-05-21 15:54:28] [INFO ] Deduced a trap composed of 89 places in 117 ms of which 3 ms to minimize.
SMT process timed out in 30099ms, After SMT, problems are : Problem set: 8 solved, 387 unsolved
Search for dead transitions found 8 dead transitions in 30106ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in LTL mode, iteration 1 : 470/477 places, 388/403 transitions.
Applied a total of 0 rules in 7 ms. Remains 470 /470 variables (removed 0) and now considering 388/388 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30777 ms. Remains : 470/477 places, 388/403 transitions.
Stuttering acceptance computed with spot in 334 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-12
Product exploration explored 100000 steps with 680 reset in 217 ms.
Product exploration explored 100000 steps with 685 reset in 229 ms.
Computed a total of 125 stabilizing places and 118 stable transitions
Graph (complete) has 1021 edges and 470 vertex of which 469 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 125 stabilizing places and 118 stable transitions
Detected a total of 125/470 stabilizing places and 118/388 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 361 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p1)]
RANDOM walk for 40000 steps (270 resets) in 293 ms. (136 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (49 resets) in 131 ms. (303 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (46 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
// Phase 1: matrix 388 rows 470 cols
[2024-05-21 15:54:30] [INFO ] Computed 96 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 36/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 305/343 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 116/459 variables, 39/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/461 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 382/843 variables, 461/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:54:30] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:54:31] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:54:31] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:54:31] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:54:31] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:54:31] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:54:31] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:54:31] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 2 ms to minimize.
[2024-05-21 15:54:31] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-05-21 15:54:31] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/843 variables, 10/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/843 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 13/856 variables, 7/574 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:54:31] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:54:32] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:54:32] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/856 variables, 3/577 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/856 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/858 variables, 2/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/858 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/858 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 858/858 variables, and 579 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1806 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 470/470 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 36/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 305/343 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:54:32] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 2 ms to minimize.
[2024-05-21 15:54:32] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-21 15:54:32] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-21 15:54:32] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 116/459 variables, 39/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 4/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:54:32] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
[2024-05-21 15:54:32] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2024-05-21 15:54:32] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 3/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/459 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/461 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/461 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 382/843 variables, 461/575 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/843 variables, 2/577 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:54:33] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/843 variables, 1/578 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/843 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 13/856 variables, 7/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/856 variables, 2/587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:54:33] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 3 ms to minimize.
[2024-05-21 15:54:33] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:54:33] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/856 variables, 3/590 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/856 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/858 variables, 2/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/858 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/858 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 858/858 variables, and 592 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1442 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 470/470 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 24/24 constraints]
After SMT, in 3266ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 176 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=44 )
Parikh walk visited 2 properties in 3 ms.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p1)), (F p2), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR p1 p2)))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 15 factoid took 453 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-14-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-14-LTLFireability-12 finished in 36100 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((X(p1)&&p0))||G(p2)))'
Support contains 2 out of 477 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 403/403 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 470 transition count 396
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 470 transition count 396
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 466 transition count 392
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 466 transition count 392
Applied a total of 22 rules in 30 ms. Remains 466 /477 variables (removed 11) and now considering 392/403 (removed 11) transitions.
// Phase 1: matrix 392 rows 466 cols
[2024-05-21 15:54:34] [INFO ] Computed 94 invariants in 8 ms
[2024-05-21 15:54:34] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-05-21 15:54:34] [INFO ] Invariant cache hit.
[2024-05-21 15:54:35] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 783 ms to find 0 implicit places.
Running 391 sub problems to find dead transitions.
[2024-05-21 15:54:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (OVERLAPS) 1/466 variables, 56/93 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-21 15:54:42] [INFO ] Deduced a trap composed of 96 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:54:42] [INFO ] Deduced a trap composed of 85 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:54:42] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:54:42] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:54:42] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 3 ms to minimize.
[2024-05-21 15:54:43] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:54:43] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:54:43] [INFO ] Deduced a trap composed of 101 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:54:43] [INFO ] Deduced a trap composed of 94 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:54:43] [INFO ] Deduced a trap composed of 92 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:54:43] [INFO ] Deduced a trap composed of 98 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:54:43] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:54:44] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:54:44] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:54:44] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 3 ms to minimize.
[2024-05-21 15:54:44] [INFO ] Deduced a trap composed of 101 places in 125 ms of which 2 ms to minimize.
[2024-05-21 15:54:44] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-21 15:54:44] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:54:44] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:54:45] [INFO ] Deduced a trap composed of 88 places in 144 ms of which 3 ms to minimize.
Problem TDEAD318 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD340 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 20/114 constraints. Problems are: Problem set: 3 solved, 388 unsolved
[2024-05-21 15:54:45] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:54:45] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:54:45] [INFO ] Deduced a trap composed of 85 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:54:45] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:54:45] [INFO ] Deduced a trap composed of 76 places in 105 ms of which 3 ms to minimize.
[2024-05-21 15:54:45] [INFO ] Deduced a trap composed of 82 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:54:46] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:54:46] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:54:46] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:54:46] [INFO ] Deduced a trap composed of 98 places in 102 ms of which 3 ms to minimize.
[2024-05-21 15:54:46] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:54:46] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:54:46] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:54:46] [INFO ] Deduced a trap composed of 85 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:54:47] [INFO ] Deduced a trap composed of 99 places in 98 ms of which 3 ms to minimize.
[2024-05-21 15:54:47] [INFO ] Deduced a trap composed of 102 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:54:47] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 3 ms to minimize.
[2024-05-21 15:54:47] [INFO ] Deduced a trap composed of 85 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:54:47] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:54:47] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 2 ms to minimize.
Problem TDEAD320 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 20/134 constraints. Problems are: Problem set: 9 solved, 382 unsolved
[2024-05-21 15:54:47] [INFO ] Deduced a trap composed of 83 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:54:48] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:54:48] [INFO ] Deduced a trap composed of 83 places in 144 ms of which 3 ms to minimize.
[2024-05-21 15:54:48] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:54:48] [INFO ] Deduced a trap composed of 97 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:54:48] [INFO ] Deduced a trap composed of 99 places in 128 ms of which 3 ms to minimize.
[2024-05-21 15:54:48] [INFO ] Deduced a trap composed of 79 places in 97 ms of which 2 ms to minimize.
[2024-05-21 15:54:48] [INFO ] Deduced a trap composed of 97 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:54:49] [INFO ] Deduced a trap composed of 79 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:54:49] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 3 ms to minimize.
[2024-05-21 15:54:49] [INFO ] Deduced a trap composed of 81 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:54:49] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:54:49] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:54:49] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:54:49] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 3 ms to minimize.
[2024-05-21 15:54:50] [INFO ] Deduced a trap composed of 87 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:54:50] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:54:50] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:54:50] [INFO ] Deduced a trap composed of 99 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:54:50] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 20/154 constraints. Problems are: Problem set: 9 solved, 382 unsolved
[2024-05-21 15:54:53] [INFO ] Deduced a trap composed of 99 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:54:53] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:54:53] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:54:53] [INFO ] Deduced a trap composed of 82 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:54:53] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 1 ms to minimize.
[2024-05-21 15:54:54] [INFO ] Deduced a trap composed of 98 places in 154 ms of which 3 ms to minimize.
[2024-05-21 15:54:54] [INFO ] Deduced a trap composed of 84 places in 121 ms of which 4 ms to minimize.
[2024-05-21 15:54:54] [INFO ] Deduced a trap composed of 81 places in 152 ms of which 2 ms to minimize.
[2024-05-21 15:54:55] [INFO ] Deduced a trap composed of 95 places in 161 ms of which 3 ms to minimize.
[2024-05-21 15:54:55] [INFO ] Deduced a trap composed of 95 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:54:55] [INFO ] Deduced a trap composed of 82 places in 142 ms of which 4 ms to minimize.
[2024-05-21 15:54:55] [INFO ] Deduced a trap composed of 84 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:54:55] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:54:55] [INFO ] Deduced a trap composed of 84 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:54:55] [INFO ] Deduced a trap composed of 80 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:54:56] [INFO ] Deduced a trap composed of 78 places in 148 ms of which 3 ms to minimize.
[2024-05-21 15:54:56] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 3 ms to minimize.
[2024-05-21 15:54:56] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 3 ms to minimize.
[2024-05-21 15:54:56] [INFO ] Deduced a trap composed of 65 places in 194 ms of which 3 ms to minimize.
[2024-05-21 15:54:57] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 20/174 constraints. Problems are: Problem set: 9 solved, 382 unsolved
[2024-05-21 15:54:57] [INFO ] Deduced a trap composed of 94 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:54:57] [INFO ] Deduced a trap composed of 94 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:54:57] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 3 ms to minimize.
[2024-05-21 15:54:57] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:54:57] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:54:58] [INFO ] Deduced a trap composed of 90 places in 136 ms of which 2 ms to minimize.
[2024-05-21 15:54:58] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:54:58] [INFO ] Deduced a trap composed of 88 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:54:58] [INFO ] Deduced a trap composed of 95 places in 106 ms of which 3 ms to minimize.
[2024-05-21 15:54:58] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 3 ms to minimize.
[2024-05-21 15:54:59] [INFO ] Deduced a trap composed of 96 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:54:59] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:54:59] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 3 ms to minimize.
[2024-05-21 15:54:59] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:54:59] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:54:59] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 2 ms to minimize.
[2024-05-21 15:55:00] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:55:00] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 3 ms to minimize.
[2024-05-21 15:55:00] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 3 ms to minimize.
[2024-05-21 15:55:00] [INFO ] Deduced a trap composed of 87 places in 102 ms of which 3 ms to minimize.
Problem TDEAD308 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/466 variables, 20/194 constraints. Problems are: Problem set: 14 solved, 377 unsolved
[2024-05-21 15:55:01] [INFO ] Deduced a trap composed of 98 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:55:01] [INFO ] Deduced a trap composed of 85 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:55:01] [INFO ] Deduced a trap composed of 84 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:55:01] [INFO ] Deduced a trap composed of 82 places in 107 ms of which 3 ms to minimize.
[2024-05-21 15:55:01] [INFO ] Deduced a trap composed of 83 places in 134 ms of which 2 ms to minimize.
[2024-05-21 15:55:01] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:55:01] [INFO ] Deduced a trap composed of 99 places in 125 ms of which 2 ms to minimize.
[2024-05-21 15:55:02] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:55:02] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:55:02] [INFO ] Deduced a trap composed of 98 places in 155 ms of which 3 ms to minimize.
[2024-05-21 15:55:02] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:55:02] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:55:02] [INFO ] Deduced a trap composed of 98 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:55:02] [INFO ] Deduced a trap composed of 83 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:55:02] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:55:03] [INFO ] Deduced a trap composed of 86 places in 130 ms of which 2 ms to minimize.
[2024-05-21 15:55:03] [INFO ] Deduced a trap composed of 85 places in 138 ms of which 3 ms to minimize.
[2024-05-21 15:55:03] [INFO ] Deduced a trap composed of 88 places in 138 ms of which 3 ms to minimize.
[2024-05-21 15:55:03] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 3 ms to minimize.
[2024-05-21 15:55:04] [INFO ] Deduced a trap composed of 62 places in 133 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/466 variables, 20/214 constraints. Problems are: Problem set: 14 solved, 377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/858 variables, and 214 constraints, problems are : Problem set: 14 solved, 377 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 0/466 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 14 solved, 377 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 37/37 constraints. Problems are: Problem set: 14 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 0/37 constraints. Problems are: Problem set: 14 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 1/466 variables, 56/93 constraints. Problems are: Problem set: 14 solved, 377 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 1/94 constraints. Problems are: Problem set: 14 solved, 377 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 120/214 constraints. Problems are: Problem set: 14 solved, 377 unsolved
[2024-05-21 15:55:08] [INFO ] Deduced a trap composed of 80 places in 138 ms of which 3 ms to minimize.
[2024-05-21 15:55:08] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:55:08] [INFO ] Deduced a trap composed of 77 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:55:08] [INFO ] Deduced a trap composed of 96 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:55:08] [INFO ] Deduced a trap composed of 96 places in 126 ms of which 2 ms to minimize.
[2024-05-21 15:55:08] [INFO ] Deduced a trap composed of 86 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:55:09] [INFO ] Deduced a trap composed of 88 places in 142 ms of which 2 ms to minimize.
[2024-05-21 15:55:09] [INFO ] Deduced a trap composed of 87 places in 137 ms of which 3 ms to minimize.
[2024-05-21 15:55:09] [INFO ] Deduced a trap composed of 77 places in 161 ms of which 2 ms to minimize.
[2024-05-21 15:55:09] [INFO ] Deduced a trap composed of 77 places in 146 ms of which 3 ms to minimize.
[2024-05-21 15:55:09] [INFO ] Deduced a trap composed of 81 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:55:10] [INFO ] Deduced a trap composed of 80 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:55:10] [INFO ] Deduced a trap composed of 78 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:55:10] [INFO ] Deduced a trap composed of 85 places in 142 ms of which 2 ms to minimize.
[2024-05-21 15:55:10] [INFO ] Deduced a trap composed of 82 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:55:10] [INFO ] Deduced a trap composed of 77 places in 144 ms of which 2 ms to minimize.
[2024-05-21 15:55:10] [INFO ] Deduced a trap composed of 89 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:55:10] [INFO ] Deduced a trap composed of 95 places in 146 ms of which 3 ms to minimize.
[2024-05-21 15:55:11] [INFO ] Deduced a trap composed of 74 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:55:11] [INFO ] Deduced a trap composed of 81 places in 137 ms of which 3 ms to minimize.
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 20/234 constraints. Problems are: Problem set: 16 solved, 375 unsolved
[2024-05-21 15:55:12] [INFO ] Deduced a trap composed of 85 places in 154 ms of which 3 ms to minimize.
[2024-05-21 15:55:12] [INFO ] Deduced a trap composed of 62 places in 126 ms of which 2 ms to minimize.
[2024-05-21 15:55:12] [INFO ] Deduced a trap composed of 79 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:55:12] [INFO ] Deduced a trap composed of 81 places in 124 ms of which 2 ms to minimize.
[2024-05-21 15:55:12] [INFO ] Deduced a trap composed of 86 places in 126 ms of which 2 ms to minimize.
[2024-05-21 15:55:12] [INFO ] Deduced a trap composed of 66 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:55:13] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:55:13] [INFO ] Deduced a trap composed of 80 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:55:13] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:55:13] [INFO ] Deduced a trap composed of 78 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:55:13] [INFO ] Deduced a trap composed of 63 places in 148 ms of which 3 ms to minimize.
[2024-05-21 15:55:13] [INFO ] Deduced a trap composed of 81 places in 142 ms of which 2 ms to minimize.
[2024-05-21 15:55:13] [INFO ] Deduced a trap composed of 83 places in 129 ms of which 2 ms to minimize.
[2024-05-21 15:55:14] [INFO ] Deduced a trap composed of 81 places in 142 ms of which 3 ms to minimize.
[2024-05-21 15:55:14] [INFO ] Deduced a trap composed of 76 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:55:14] [INFO ] Deduced a trap composed of 82 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:55:14] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:55:14] [INFO ] Deduced a trap composed of 79 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:55:14] [INFO ] Deduced a trap composed of 79 places in 196 ms of which 6 ms to minimize.
[2024-05-21 15:55:14] [INFO ] Deduced a trap composed of 79 places in 129 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 20/254 constraints. Problems are: Problem set: 16 solved, 375 unsolved
[2024-05-21 15:55:15] [INFO ] Deduced a trap composed of 81 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:55:15] [INFO ] Deduced a trap composed of 83 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:55:15] [INFO ] Deduced a trap composed of 82 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:55:16] [INFO ] Deduced a trap composed of 85 places in 154 ms of which 2 ms to minimize.
[2024-05-21 15:55:16] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 2 ms to minimize.
[2024-05-21 15:55:16] [INFO ] Deduced a trap composed of 82 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:55:16] [INFO ] Deduced a trap composed of 79 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:55:16] [INFO ] Deduced a trap composed of 82 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:55:17] [INFO ] Deduced a trap composed of 86 places in 132 ms of which 2 ms to minimize.
[2024-05-21 15:55:17] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:55:17] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:55:17] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:55:17] [INFO ] Deduced a trap composed of 90 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:55:17] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:55:17] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:55:18] [INFO ] Deduced a trap composed of 82 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:55:18] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:55:18] [INFO ] Deduced a trap composed of 88 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:55:18] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 3 ms to minimize.
[2024-05-21 15:55:18] [INFO ] Deduced a trap composed of 63 places in 121 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 20/274 constraints. Problems are: Problem set: 16 solved, 375 unsolved
[2024-05-21 15:55:19] [INFO ] Deduced a trap composed of 78 places in 125 ms of which 2 ms to minimize.
[2024-05-21 15:55:19] [INFO ] Deduced a trap composed of 82 places in 125 ms of which 2 ms to minimize.
[2024-05-21 15:55:19] [INFO ] Deduced a trap composed of 80 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:55:19] [INFO ] Deduced a trap composed of 82 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:55:19] [INFO ] Deduced a trap composed of 80 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:55:20] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 3 ms to minimize.
[2024-05-21 15:55:20] [INFO ] Deduced a trap composed of 79 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:55:20] [INFO ] Deduced a trap composed of 85 places in 126 ms of which 2 ms to minimize.
[2024-05-21 15:55:20] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 2 ms to minimize.
[2024-05-21 15:55:20] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:55:21] [INFO ] Deduced a trap composed of 84 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:55:21] [INFO ] Deduced a trap composed of 82 places in 141 ms of which 2 ms to minimize.
[2024-05-21 15:55:21] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:55:21] [INFO ] Deduced a trap composed of 35 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:55:21] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:55:22] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-21 15:55:22] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:55:22] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:55:23] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 3 ms to minimize.
[2024-05-21 15:55:23] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/466 variables, 20/294 constraints. Problems are: Problem set: 16 solved, 375 unsolved
[2024-05-21 15:55:24] [INFO ] Deduced a trap composed of 98 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:55:24] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:55:24] [INFO ] Deduced a trap composed of 113 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:55:24] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:55:24] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:55:24] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:55:24] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 3 ms to minimize.
[2024-05-21 15:55:25] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:55:25] [INFO ] Deduced a trap composed of 84 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:55:25] [INFO ] Deduced a trap composed of 85 places in 125 ms of which 2 ms to minimize.
[2024-05-21 15:55:25] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:55:25] [INFO ] Deduced a trap composed of 88 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:55:27] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 3 ms to minimize.
[2024-05-21 15:55:27] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:55:27] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 2 ms to minimize.
[2024-05-21 15:55:27] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 2 ms to minimize.
[2024-05-21 15:55:27] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 3 ms to minimize.
[2024-05-21 15:55:28] [INFO ] Deduced a trap composed of 51 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:55:28] [INFO ] Deduced a trap composed of 56 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:55:28] [INFO ] Deduced a trap composed of 46 places in 118 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/466 variables, 20/314 constraints. Problems are: Problem set: 16 solved, 375 unsolved
[2024-05-21 15:55:29] [INFO ] Deduced a trap composed of 35 places in 152 ms of which 4 ms to minimize.
[2024-05-21 15:55:30] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:55:30] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:55:30] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:55:30] [INFO ] Deduced a trap composed of 38 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:55:30] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:55:30] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:55:30] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:55:31] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 2 ms to minimize.
[2024-05-21 15:55:32] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:55:32] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 3 ms to minimize.
[2024-05-21 15:55:32] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:55:32] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 3 ms to minimize.
[2024-05-21 15:55:32] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:55:33] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:55:33] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-21 15:55:33] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:55:33] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-21 15:55:33] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 2 ms to minimize.
[2024-05-21 15:55:33] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/466 variables, 20/334 constraints. Problems are: Problem set: 16 solved, 375 unsolved
[2024-05-21 15:55:34] [INFO ] Deduced a trap composed of 78 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:55:34] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 5 ms to minimize.
[2024-05-21 15:55:35] [INFO ] Deduced a trap composed of 82 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:55:35] [INFO ] Deduced a trap composed of 82 places in 124 ms of which 3 ms to minimize.
SMT process timed out in 60205ms, After SMT, problems are : Problem set: 16 solved, 375 unsolved
Search for dead transitions found 16 dead transitions in 60209ms
Found 16 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 16 transitions
Dead transitions reduction (with SMT) removed 16 transitions
Starting structural reductions in LTL mode, iteration 1 : 466/477 places, 376/403 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 464 transition count 376
Applied a total of 2 rules in 7 ms. Remains 464 /466 variables (removed 2) and now considering 376/376 (removed 0) transitions.
// Phase 1: matrix 376 rows 464 cols
[2024-05-21 15:55:35] [INFO ] Computed 100 invariants in 8 ms
[2024-05-21 15:55:35] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-21 15:55:35] [INFO ] Invariant cache hit.
[2024-05-21 15:55:35] [INFO ] Implicit Places using invariants and state equation in 507 ms returned [149]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 684 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 463/477 places, 376/403 transitions.
Applied a total of 0 rules in 6 ms. Remains 463 /463 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61722 ms. Remains : 463/477 places, 376/403 transitions.
Stuttering acceptance computed with spot in 183 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-13
Product exploration explored 100000 steps with 677 reset in 213 ms.
Product exploration explored 100000 steps with 682 reset in 236 ms.
Computed a total of 123 stabilizing places and 116 stable transitions
Graph (complete) has 982 edges and 463 vertex of which 462 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 123 stabilizing places and 116 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (NOT (AND p0 p1))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (NOT (AND p0 p2 p1))), (X (OR (AND (NOT p0) p2) (AND p2 (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p2) p1))), (X (OR (NOT p0) (NOT p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (OR (AND (NOT p0) p2) (AND p2 (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 19 factoid took 188 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p2)]
RANDOM walk for 40000 steps (271 resets) in 152 ms. (261 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (47 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2301 steps, run visited all 1 properties in 17 ms. (steps per millisecond=135 )
Probabilistic random walk after 2301 steps, saw 2053 distinct states, run finished after 18 ms. (steps per millisecond=127 ) properties seen :1
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (NOT (AND p0 p1))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (NOT (AND p0 p2 p1))), (X (OR (AND (NOT p0) p2) (AND p2 (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p2) p1))), (X (OR (NOT p0) (NOT p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (OR (AND (NOT p0) p2) (AND p2 (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p2))]
Property proved to be false thanks to negative knowledge :(F (NOT p2))
Knowledge based reduction with 19 factoid took 181 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-14-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-14-LTLFireability-13 finished in 62964 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((p1&&X(X(G(p1))))))))'
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(p0) U (G(!p1)||X(G(p2)))))'
Found a Lengthening insensitive property : BusinessProcesses-PT-14-LTLFireability-10
Stuttering acceptance computed with spot in 383 ms :[(NOT p2), (AND (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (AND (NOT p0) (NOT p2)), true, p1, (NOT p0), (AND p1 (NOT p0) p2)]
Support contains 5 out of 477 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 477/477 places, 403/403 transitions.
Graph (complete) has 1049 edges and 477 vertex of which 476 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 475 transition count 350
Reduce places removed 51 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 53 rules applied. Total rules applied 105 place count 424 transition count 348
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 107 place count 422 transition count 348
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 107 place count 422 transition count 247
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 3 with 219 rules applied. Total rules applied 326 place count 304 transition count 247
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 332 place count 298 transition count 241
Iterating global reduction 3 with 6 rules applied. Total rules applied 338 place count 298 transition count 241
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Deduced a syphon composed of 124 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 253 rules applied. Total rules applied 591 place count 169 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 592 place count 169 transition count 116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 594 place count 168 transition count 120
Applied a total of 594 rules in 28 ms. Remains 168 /477 variables (removed 309) and now considering 120/403 (removed 283) transitions.
// Phase 1: matrix 120 rows 168 cols
[2024-05-21 15:55:37] [INFO ] Computed 72 invariants in 2 ms
[2024-05-21 15:55:38] [INFO ] Implicit Places using invariants in 139 ms returned [1, 2, 3, 4, 5, 6, 7, 15, 16, 20, 21, 22, 23, 24, 25, 48, 49, 50, 51, 52]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 140 ms to find 20 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 148/477 places, 120/403 transitions.
Applied a total of 0 rules in 2 ms. Remains 148 /148 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 171 ms. Remains : 148/477 places, 120/403 transitions.
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-10
Product exploration explored 100000 steps with 9936 reset in 215 ms.
Product exploration explored 100000 steps with 9886 reset in 218 ms.
Computed a total of 14 stabilizing places and 12 stable transitions
Computed a total of 14 stabilizing places and 12 stable transitions
Detected a total of 14/148 stabilizing places and 12/120 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 p2))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND p1 p2))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 37 factoid took 664 ms. Reduced automaton from 9 states, 31 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p2), (AND (NOT p2) p1), p1]
RANDOM walk for 40000 steps (3972 resets) in 166 ms. (239 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40002 steps (976 resets) in 54 ms. (727 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (863 resets) in 50 ms. (784 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (902 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
// Phase 1: matrix 120 rows 148 cols
[2024-05-21 15:55:39] [INFO ] Computed 52 invariants in 1 ms
[2024-05-21 15:55:39] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 43/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 61/108 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 34/142 variables, 15/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 15:55:39] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 3/145 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 120/265 variables, 145/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 5/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 3/268 variables, 3/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/268 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/268 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 206 constraints, problems are : Problem set: 0 solved, 3 unsolved in 206 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 148/148 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 43/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 61/108 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 34/142 variables, 15/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 15:55:39] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 3/145 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 120/265 variables, 145/199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 5/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/265 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 3/268 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/268 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/268 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/268 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 210 constraints, problems are : Problem set: 0 solved, 3 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 148/148 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 495ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 21 ms.
Support contains 4 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 120/120 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 147 transition count 119
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 147 transition count 119
Applied a total of 3 rules in 7 ms. Remains 147 /148 variables (removed 1) and now considering 119/120 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 147/148 places, 119/120 transitions.
RANDOM walk for 40000 steps (3989 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (877 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Probably explored full state space saw : 16144 states, properties seen :0
Probabilistic random walk after 56442 steps, saw 16144 distinct states, run finished after 118 ms. (steps per millisecond=478 ) properties seen :0
Explored full state space saw : 16144 states, properties seen :0
Exhaustive walk after 56442 steps, saw 16144 distinct states, run finished after 111 ms. (steps per millisecond=508 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 p2))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND p1 p2))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (G (OR (NOT p1) p2))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (NOT (OR p1 p2))), (F p1), (F (NOT p2)), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 38 factoid took 819 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p2), (AND (NOT p2) p1), p1]
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p2), (AND (NOT p2) p1), p1]
Support contains 4 out of 148 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 : 148/148 places, 120/120 transitions.
Applied a total of 0 rules in 2 ms. Remains 148 /148 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-21 15:55:41] [INFO ] Invariant cache hit.
[2024-05-21 15:55:41] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-21 15:55:41] [INFO ] Invariant cache hit.
[2024-05-21 15:55:41] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 15:55:41] [INFO ] Implicit Places using invariants and state equation in 174 ms returned [8, 11, 25, 27, 29, 91, 93, 95, 97, 138]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 264 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 138/148 places, 120/120 transitions.
Graph (complete) has 447 edges and 138 vertex of which 127 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 127 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 126 transition count 114
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5 place count 124 transition count 107
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 124 transition count 107
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 2 with 2 rules applied. Total rules applied 9 place count 123 transition count 106
Applied a total of 9 rules in 7 ms. Remains 123 /138 variables (removed 15) and now considering 106/120 (removed 14) transitions.
// Phase 1: matrix 106 rows 123 cols
[2024-05-21 15:55:41] [INFO ] Computed 36 invariants in 1 ms
[2024-05-21 15:55:41] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-21 15:55:41] [INFO ] Invariant cache hit.
[2024-05-21 15:55:41] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 15:55:41] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 123/148 places, 106/120 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 483 ms. Remains : 123/148 places, 106/120 transitions.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Detected a total of 11/123 stabilizing places and 11/106 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1)), (X p2), (X (AND (NOT p1) p2)), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 11 factoid took 358 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p2), (AND (NOT p2) p1), p1]
RANDOM walk for 40000 steps (4031 resets) in 466 ms. (85 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40002 steps (975 resets) in 104 ms. (380 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (875 resets) in 139 ms. (285 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (896 resets) in 73 ms. (540 steps per ms) remains 3/3 properties
[2024-05-21 15:55:42] [INFO ] Invariant cache hit.
[2024-05-21 15:55:42] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 41/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 51/96 variables, 25/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 12/108 variables, 7/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 106/214 variables, 108/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 5/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 15/229 variables, 15/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/229 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/229 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 164 constraints, problems are : Problem set: 0 solved, 3 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 123/123 constraints, ReadFeed: 5/5 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 41/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 51/96 variables, 25/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 12/108 variables, 7/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 106/214 variables, 108/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 5/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 15/229 variables, 15/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/229 variables, 3/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/229 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/229 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 229/229 variables, and 167 constraints, problems are : Problem set: 0 solved, 3 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 123/123 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 344ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 23 ms.
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 106/106 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 122 transition count 105
Applied a total of 2 rules in 3 ms. Remains 122 /123 variables (removed 1) and now considering 105/106 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 122/123 places, 105/106 transitions.
RANDOM walk for 40000 steps (4044 resets) in 136 ms. (291 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (895 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Probably explored full state space saw : 7088 states, properties seen :0
Probabilistic random walk after 21620 steps, saw 7088 distinct states, run finished after 45 ms. (steps per millisecond=480 ) properties seen :0
Explored full state space saw : 7088 states, properties seen :0
Exhaustive walk after 21620 steps, saw 7088 distinct states, run finished after 31 ms. (steps per millisecond=697 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1)), (X p2), (X (AND (NOT p1) p2)), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (G (OR (NOT p1) p2))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (NOT (OR p1 p2))), (F p1), (F (NOT p2)), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 12 factoid took 821 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p2), (AND (NOT p2) p1), p1]
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p2), (AND (NOT p2) p1), p1]
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p2), (AND (NOT p2) p1), p1]
Product exploration explored 100000 steps with 10021 reset in 167 ms.
Product exploration explored 100000 steps with 10026 reset in 184 ms.
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 106/106 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 122 transition count 105
Applied a total of 2 rules in 2 ms. Remains 122 /123 variables (removed 1) and now considering 105/106 (removed 1) transitions.
// Phase 1: matrix 105 rows 122 cols
[2024-05-21 15:55:44] [INFO ] Computed 36 invariants in 2 ms
[2024-05-21 15:55:44] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-21 15:55:44] [INFO ] Invariant cache hit.
[2024-05-21 15:55:44] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 15:55:44] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
[2024-05-21 15:55:45] [INFO ] Redundant transitions in 2 ms returned []
Running 102 sub problems to find dead transitions.
[2024-05-21 15:55:45] [INFO ] Invariant cache hit.
[2024-05-21 15:55:45] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 2/122 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-21 15:55:45] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:55:45] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-21 15:55:45] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-21 15:55:46] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-21 15:55:46] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:55:46] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-21 15:55:46] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:55:46] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:55:46] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:55:46] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2024-05-21 15:55:46] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:55:46] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 0 ms to minimize.
[2024-05-21 15:55:46] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-21 15:55:46] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-05-21 15:55:46] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-05-21 15:55:46] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:55:46] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-21 15:55:46] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-21 15:55:46] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 0 ms to minimize.
[2024-05-21 15:55:46] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-21 15:55:46] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 2 ms to minimize.
[2024-05-21 15:55:46] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:55:46] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-05-21 15:55:47] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 0 ms to minimize.
[2024-05-21 15:55:47] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:55:47] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-05-21 15:55:47] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
[2024-05-21 15:55:47] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 2 ms to minimize.
[2024-05-21 15:55:47] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:55:47] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
[2024-05-21 15:55:47] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:55:47] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:55:47] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 0 ms to minimize.
[2024-05-21 15:55:47] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 2 ms to minimize.
[2024-05-21 15:55:47] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-21 15:55:47] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-21 15:55:47] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 2 ms to minimize.
[2024-05-21 15:55:47] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 18/74 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-21 15:55:48] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-21 15:55:48] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-21 15:55:48] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 2 ms to minimize.
[2024-05-21 15:55:48] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Problem TDEAD22 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD51 is UNSAT
At refinement iteration 9 (OVERLAPS) 105/227 variables, 122/200 constraints. Problems are: Problem set: 10 solved, 92 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 5/205 constraints. Problems are: Problem set: 10 solved, 92 unsolved
[2024-05-21 15:55:49] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 2 ms to minimize.
[2024-05-21 15:55:49] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:55:49] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-21 15:55:49] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 4/209 constraints. Problems are: Problem set: 10 solved, 92 unsolved
[2024-05-21 15:55:50] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:55:50] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:55:50] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-21 15:55:50] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/227 variables, 4/213 constraints. Problems are: Problem set: 10 solved, 92 unsolved
[2024-05-21 15:55:51] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/227 variables, 1/214 constraints. Problems are: Problem set: 10 solved, 92 unsolved
[2024-05-21 15:55:51] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:55:51] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/227 variables, 2/216 constraints. Problems are: Problem set: 10 solved, 92 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/227 variables, 0/216 constraints. Problems are: Problem set: 10 solved, 92 unsolved
At refinement iteration 16 (OVERLAPS) 0/227 variables, 0/216 constraints. Problems are: Problem set: 10 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 216 constraints, problems are : Problem set: 10 solved, 92 unsolved in 8248 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 122/122 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 10 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 5/5 constraints. Problems are: Problem set: 10 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/5 constraints. Problems are: Problem set: 10 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 2/122 variables, 29/34 constraints. Problems are: Problem set: 10 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 2/36 constraints. Problems are: Problem set: 10 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 53/89 constraints. Problems are: Problem set: 10 solved, 92 unsolved
[2024-05-21 15:55:53] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 2 ms to minimize.
[2024-05-21 15:55:53] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2024-05-21 15:55:53] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-05-21 15:55:53] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2024-05-21 15:55:53] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2024-05-21 15:55:54] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 0 ms to minimize.
[2024-05-21 15:55:54] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-05-21 15:55:54] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-05-21 15:55:54] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:55:54] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:55:54] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 0 ms to minimize.
[2024-05-21 15:55:54] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-05-21 15:55:54] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-05-21 15:55:54] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-21 15:55:54] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 0 ms to minimize.
[2024-05-21 15:55:54] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:55:54] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:55:54] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 0 ms to minimize.
[2024-05-21 15:55:54] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-05-21 15:55:54] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/109 constraints. Problems are: Problem set: 10 solved, 92 unsolved
[2024-05-21 15:55:54] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-05-21 15:55:54] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-05-21 15:55:54] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
[2024-05-21 15:55:54] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 2 ms to minimize.
[2024-05-21 15:55:54] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-05-21 15:55:55] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-21 15:55:55] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-21 15:55:55] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-05-21 15:55:55] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 0 ms to minimize.
[2024-05-21 15:55:55] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:55:55] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
[2024-05-21 15:55:55] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-05-21 15:55:55] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 0 ms to minimize.
[2024-05-21 15:55:55] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-21 15:55:55] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-21 15:55:55] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 0 ms to minimize.
[2024-05-21 15:55:55] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:55:55] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:55:55] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:55:55] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 20/129 constraints. Problems are: Problem set: 10 solved, 92 unsolved
[2024-05-21 15:55:55] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 2 ms to minimize.
[2024-05-21 15:55:55] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-05-21 15:55:56] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-21 15:55:56] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 4/133 constraints. Problems are: Problem set: 10 solved, 92 unsolved
[2024-05-21 15:55:56] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2024-05-21 15:55:56] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-05-21 15:55:56] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:55:56] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:55:56] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-21 15:55:56] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 0 ms to minimize.
[2024-05-21 15:55:56] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-21 15:55:56] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:55:56] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-05-21 15:55:56] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 0 ms to minimize.
[2024-05-21 15:55:56] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:55:56] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-05-21 15:55:56] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
[2024-05-21 15:55:57] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:55:57] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-21 15:55:57] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-05-21 15:55:57] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:55:57] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2024-05-21 15:55:57] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 2 ms to minimize.
[2024-05-21 15:55:57] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 20/153 constraints. Problems are: Problem set: 10 solved, 92 unsolved
[2024-05-21 15:55:57] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 1 ms to minimize.
[2024-05-21 15:55:57] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 2/155 constraints. Problems are: Problem set: 10 solved, 92 unsolved
[2024-05-21 15:55:58] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-05-21 15:55:58] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:55:58] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:55:58] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-05-21 15:55:58] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-05-21 15:55:58] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 2 ms to minimize.
[2024-05-21 15:55:58] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:55:58] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-21 15:55:58] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:55:58] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:55:58] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-21 15:55:58] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:55:58] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-21 15:55:58] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-05-21 15:55:58] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-05-21 15:55:58] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-21 15:55:58] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:55:58] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:55:58] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:55:59] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 20/175 constraints. Problems are: Problem set: 10 solved, 92 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 0/175 constraints. Problems are: Problem set: 10 solved, 92 unsolved
At refinement iteration 12 (OVERLAPS) 105/227 variables, 122/297 constraints. Problems are: Problem set: 10 solved, 92 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/227 variables, 5/302 constraints. Problems are: Problem set: 10 solved, 92 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/227 variables, 92/394 constraints. Problems are: Problem set: 10 solved, 92 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/227 variables, 0/394 constraints. Problems are: Problem set: 10 solved, 92 unsolved
At refinement iteration 16 (OVERLAPS) 0/227 variables, 0/394 constraints. Problems are: Problem set: 10 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 394 constraints, problems are : Problem set: 10 solved, 92 unsolved in 11124 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 122/122 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 92/102 constraints, Known Traps: 139/139 constraints]
After SMT, in 19412ms problems are : Problem set: 10 solved, 92 unsolved
Search for dead transitions found 10 dead transitions in 19413ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 122/123 places, 95/106 transitions.
Ensure Unique test removed 4 places
Applied a total of 0 rules in 5 ms. Remains 118 /122 variables (removed 4) and now considering 95/95 (removed 0) transitions.
[2024-05-21 15:56:04] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 19714 ms. Remains : 118/123 places, 95/106 transitions.
Treatment of property BusinessProcesses-PT-14-LTLFireability-10 finished in 27040 ms.
[2024-05-21 15:56:04] [INFO ] Flatten gal took : 37 ms
[2024-05-21 15:56:04] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-21 15:56:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 477 places, 403 transitions and 1254 arcs took 9 ms.
Total runtime 386782 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BusinessProcesses-PT-14

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/417/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 477
TRANSITIONS: 403
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.007s, Sys 0.004s]


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


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

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

Process ID: 5794
MODEL NAME: /home/mcc/execution/417/model
477 places, 403 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA BusinessProcesses-PT-14-LTLFireability-01 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-14-LTLFireability-10 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716307550301

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

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

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is BusinessProcesses-PT-14, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r047-tajo-171620398500556"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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