Execution Chart

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

Trace from the execution

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

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

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-14
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-22 00:00:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 00:00:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:00:10] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2024-05-22 00:00:10] [INFO ] Transformed 624 places.
[2024-05-22 00:00:10] [INFO ] Transformed 564 transitions.
[2024-05-22 00:00:10] [INFO ] Found NUPN structural information;
[2024-05-22 00:00:10] [INFO ] Parsed PT model containing 624 places and 564 transitions and 1657 arcs in 258 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 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 108 ms. Remains 477 /616 variables (removed 139) and now considering 422/556 (removed 134) transitions.
// Phase 1: matrix 422 rows 477 cols
[2024-05-22 00:00:11] [INFO ] Computed 94 invariants in 39 ms
[2024-05-22 00:00:11] [INFO ] Implicit Places using invariants in 382 ms returned []
[2024-05-22 00:00:11] [INFO ] Invariant cache hit.
[2024-05-22 00:00:11] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 815 ms to find 0 implicit places.
Running 421 sub problems to find dead transitions.
[2024-05-22 00:00:11] [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-22 00:00:24] [INFO ] Deduced a trap composed of 91 places in 169 ms of which 34 ms to minimize.
[2024-05-22 00:00:24] [INFO ] Deduced a trap composed of 90 places in 261 ms of which 3 ms to minimize.
[2024-05-22 00:00:24] [INFO ] Deduced a trap composed of 92 places in 184 ms of which 3 ms to minimize.
[2024-05-22 00:00:24] [INFO ] Deduced a trap composed of 93 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:00:25] [INFO ] Deduced a trap composed of 25 places in 155 ms of which 2 ms to minimize.
[2024-05-22 00:00:25] [INFO ] Deduced a trap composed of 96 places in 441 ms of which 33 ms to minimize.
[2024-05-22 00:00:25] [INFO ] Deduced a trap composed of 91 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:00:25] [INFO ] Deduced a trap composed of 102 places in 165 ms of which 28 ms to minimize.
[2024-05-22 00:00:26] [INFO ] Deduced a trap composed of 89 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:00:26] [INFO ] Deduced a trap composed of 98 places in 196 ms of which 2 ms to minimize.
[2024-05-22 00:00:26] [INFO ] Deduced a trap composed of 99 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:00:26] [INFO ] Deduced a trap composed of 102 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:00:26] [INFO ] Deduced a trap composed of 97 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:00:26] [INFO ] Deduced a trap composed of 97 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:00:26] [INFO ] Deduced a trap composed of 93 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:00:26] [INFO ] Deduced a trap composed of 90 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:00:27] [INFO ] Deduced a trap composed of 101 places in 197 ms of which 2 ms to minimize.
[2024-05-22 00:00:27] [INFO ] Deduced a trap composed of 90 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:00:27] [INFO ] Deduced a trap composed of 87 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:00:27] [INFO ] Deduced a trap composed of 87 places in 166 ms of which 3 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-22 00:00:27] [INFO ] Deduced a trap composed of 88 places in 178 ms of which 2 ms to minimize.
[2024-05-22 00:00:28] [INFO ] Deduced a trap composed of 95 places in 187 ms of which 3 ms to minimize.
[2024-05-22 00:00:28] [INFO ] Deduced a trap composed of 95 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:00:28] [INFO ] Deduced a trap composed of 89 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:00:28] [INFO ] Deduced a trap composed of 83 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:00:29] [INFO ] Deduced a trap composed of 83 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:00:29] [INFO ] Deduced a trap composed of 95 places in 130 ms of which 4 ms to minimize.
[2024-05-22 00:00:29] [INFO ] Deduced a trap composed of 92 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:00:29] [INFO ] Deduced a trap composed of 90 places in 201 ms of which 3 ms to minimize.
[2024-05-22 00:00:29] [INFO ] Deduced a trap composed of 83 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:00:29] [INFO ] Deduced a trap composed of 84 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:00:30] [INFO ] Deduced a trap composed of 90 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:00:30] [INFO ] Deduced a trap composed of 94 places in 151 ms of which 2 ms to minimize.
[2024-05-22 00:00:30] [INFO ] Deduced a trap composed of 94 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:00:30] [INFO ] Deduced a trap composed of 92 places in 157 ms of which 5 ms to minimize.
[2024-05-22 00:00:30] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:00:30] [INFO ] Deduced a trap composed of 87 places in 155 ms of which 2 ms to minimize.
[2024-05-22 00:00:31] [INFO ] Deduced a trap composed of 80 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:00:31] [INFO ] Deduced a trap composed of 84 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:00:31] [INFO ] Deduced a trap composed of 85 places in 173 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 20/134 constraints. Problems are: Problem set: 19 solved, 402 unsolved
[2024-05-22 00:00:31] [INFO ] Deduced a trap composed of 32 places in 172 ms of which 3 ms to minimize.
[2024-05-22 00:00:32] [INFO ] Deduced a trap composed of 96 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:00:32] [INFO ] Deduced a trap composed of 86 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:00:32] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:00:32] [INFO ] Deduced a trap composed of 83 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:00:32] [INFO ] Deduced a trap composed of 85 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:00:32] [INFO ] Deduced a trap composed of 84 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:00:32] [INFO ] Deduced a trap composed of 82 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:00:32] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:00:33] [INFO ] Deduced a trap composed of 85 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:00:33] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 4 ms to minimize.
[2024-05-22 00:00:33] [INFO ] Deduced a trap composed of 86 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:00:33] [INFO ] Deduced a trap composed of 93 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:00:33] [INFO ] Deduced a trap composed of 91 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:00:33] [INFO ] Deduced a trap composed of 90 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:00:34] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 22 ms to minimize.
[2024-05-22 00:00:34] [INFO ] Deduced a trap composed of 81 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:00:34] [INFO ] Deduced a trap composed of 83 places in 213 ms of which 3 ms to minimize.
[2024-05-22 00:00:34] [INFO ] Deduced a trap composed of 91 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:00:35] [INFO ] Deduced a trap composed of 89 places in 143 ms of which 3 ms to minimize.
Problem TDEAD321 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 20/154 constraints. Problems are: Problem set: 20 solved, 401 unsolved
[2024-05-22 00:00:37] [INFO ] Deduced a trap composed of 93 places in 184 ms of which 2 ms to minimize.
[2024-05-22 00:00:38] [INFO ] Deduced a trap composed of 90 places in 193 ms of which 3 ms to minimize.
[2024-05-22 00:00:38] [INFO ] Deduced a trap composed of 94 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:00:38] [INFO ] Deduced a trap composed of 85 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:00:38] [INFO ] Deduced a trap composed of 103 places in 169 ms of which 3 ms to minimize.
[2024-05-22 00:00:38] [INFO ] Deduced a trap composed of 102 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:00:39] [INFO ] Deduced a trap composed of 98 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:00:39] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:00:39] [INFO ] Deduced a trap composed of 94 places in 157 ms of which 4 ms to minimize.
[2024-05-22 00:00:39] [INFO ] Deduced a trap composed of 86 places in 152 ms of which 2 ms to minimize.
[2024-05-22 00:00:39] [INFO ] Deduced a trap composed of 68 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:00:40] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:00:40] [INFO ] Deduced a trap composed of 85 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:00:40] [INFO ] Deduced a trap composed of 80 places in 182 ms of which 3 ms to minimize.
[2024-05-22 00:00:40] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:00:40] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:00:41] [INFO ] Deduced a trap composed of 85 places in 147 ms of which 2 ms to minimize.
[2024-05-22 00:00:41] [INFO ] Deduced a trap composed of 101 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:00:41] [INFO ] Deduced a trap composed of 101 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:00:41] [INFO ] Deduced a trap composed of 79 places in 139 ms of which 3 ms to minimize.
Problem TDEAD326 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 20/174 constraints. Problems are: Problem set: 23 solved, 398 unsolved
[2024-05-22 00:00:42] [INFO ] Deduced a trap composed of 86 places in 152 ms of which 3 ms to minimize.
SMT process timed out in 30352ms, After SMT, problems are : Problem set: 23 solved, 398 unsolved
Search for dead transitions found 23 dead transitions in 30382ms
Found 23 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 23 transitions
Dead transitions reduction (with SMT) removed 23 transitions
Starting structural reductions in LTL mode, iteration 1 : 477/616 places, 399/556 transitions.
Applied a total of 0 rules in 11 ms. Remains 477 /477 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31342 ms. Remains : 477/616 places, 399/556 transitions.
Support contains 42 out of 477 places after structural reductions.
[2024-05-22 00:00:42] [INFO ] Flatten gal took : 73 ms
[2024-05-22 00:00:42] [INFO ] Flatten gal took : 32 ms
[2024-05-22 00:00:42] [INFO ] Input system was already deterministic with 399 transitions.
Reduction of identical properties reduced properties to check from 32 to 31
RANDOM walk for 40000 steps (272 resets) in 1929 ms. (20 steps per ms) remains 19/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 49 ms. (80 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
// Phase 1: matrix 399 rows 477 cols
[2024-05-22 00:00:43] [INFO ] Computed 95 invariants in 11 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp12 is UNSAT
At refinement iteration 1 (OVERLAPS) 171/201 variables, 19/19 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 1/20 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/20 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 155/356 variables, 36/56 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 0/56 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 110/466 variables, 37/93 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 0/93 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 2/468 variables, 2/95 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/468 variables, 0/95 constraints. Problems are: Problem set: 2 solved, 17 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 10 (OVERLAPS) 393/861 variables, 468/563 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/861 variables, 0/563 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 13/874 variables, 7/570 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/874 variables, 0/570 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 14 (OVERLAPS) 2/876 variables, 2/572 constraints. Problems are: Problem set: 3 solved, 16 unsolved
[2024-05-22 00:00:45] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 4 ms to minimize.
[2024-05-22 00:00:45] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 2 ms to minimize.
[2024-05-22 00:00:45] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:00:45] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:00:45] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 2 ms to minimize.
[2024-05-22 00:00:46] [INFO ] Deduced a trap composed of 14 places in 185 ms of which 3 ms to minimize.
[2024-05-22 00:00:46] [INFO ] Deduced a trap composed of 80 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:00:46] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:00:46] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 7 ms to minimize.
[2024-05-22 00:00:46] [INFO ] Deduced a trap composed of 82 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:00:46] [INFO ] Deduced a trap composed of 82 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:00:46] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:00:46] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 2 ms to minimize.
[2024-05-22 00:00:46] [INFO ] Deduced a trap composed of 78 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:00:47] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:00:47] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 2 ms to minimize.
[2024-05-22 00:00:47] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:00:47] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 2 ms to minimize.
[2024-05-22 00:00:47] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:00:47] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
Problem AtomicPropp29 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/876 variables, 20/592 constraints. Problems are: Problem set: 4 solved, 15 unsolved
[2024-05-22 00:00:47] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 2 ms to minimize.
[2024-05-22 00:00:47] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:00:47] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:00:47] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
[2024-05-22 00:00:48] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:00:48] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 1 ms to minimize.
[2024-05-22 00:00:48] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
[2024-05-22 00:00:48] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 2 ms to minimize.
[2024-05-22 00:00:48] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:00:48] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
SMT process timed out in 5055ms, After SMT, problems are : Problem set: 4 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 399/399 transitions.
Graph (complete) has 1041 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 353
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 348
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 348
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 91 Pre rules applied. Total rules applied 101 place count 426 transition count 257
Deduced a syphon composed of 91 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 195 rules applied. Total rules applied 296 place count 322 transition count 257
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 300 place count 318 transition count 253
Iterating global reduction 3 with 4 rules applied. Total rules applied 304 place count 318 transition count 253
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 246 rules applied. Total rules applied 550 place count 192 transition count 133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 551 place count 192 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 553 place count 191 transition count 136
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 562 place count 191 transition count 136
Applied a total of 562 rules in 132 ms. Remains 191 /477 variables (removed 286) and now considering 136/399 (removed 263) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 191/477 places, 136/399 transitions.
RANDOM walk for 40000 steps (3874 resets) in 929 ms. (43 steps per ms) remains 11/15 properties
BEST_FIRST walk for 40004 steps (1094 resets) in 197 ms. (202 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1149 resets) in 178 ms. (223 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (1094 resets) in 174 ms. (228 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (1104 resets) in 143 ms. (277 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (939 resets) in 123 ms. (322 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (1100 resets) in 198 ms. (201 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (1080 resets) in 97 ms. (408 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1112 resets) in 116 ms. (341 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1098 resets) in 107 ms. (370 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1104 resets) in 105 ms. (377 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1142 resets) in 95 ms. (416 steps per ms) remains 11/11 properties
// Phase 1: matrix 136 rows 191 cols
[2024-05-22 00:00:49] [INFO ] Computed 76 invariants in 8 ms
[2024-05-22 00:00:49] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 62/78 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 72/150 variables, 43/55 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 36/186 variables, 19/74 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 2/188 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 136/324 variables, 188/264 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/324 variables, 6/270 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/324 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 3/327 variables, 3/273 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/327 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 0/327 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 273 constraints, problems are : Problem set: 0 solved, 11 unsolved in 376 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 191/191 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 62/78 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 72/150 variables, 43/55 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 36/186 variables, 19/75 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
Problem AtomicPropp28 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 4/79 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/79 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 2/188 variables, 2/81 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 0/81 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 136/324 variables, 188/269 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/324 variables, 6/275 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/324 variables, 10/285 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/324 variables, 7/292 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/324 variables, 0/292 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 3/327 variables, 3/295 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/327 variables, 1/296 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:00:52] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/327 variables, 2/298 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/327 variables, 0/298 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 20 (OVERLAPS) 0/327 variables, 0/298 constraints. Problems are: Problem set: 1 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/327 variables, and 298 constraints, problems are : Problem set: 1 solved, 10 unsolved in 2434 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 191/191 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 10/11 constraints, Known Traps: 15/15 constraints]
After SMT, in 2838ms problems are : Problem set: 1 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Finished Parikh walk after 1884 steps, including 260 resets, run visited all 1 properties in 5 ms. (steps per millisecond=376 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 10 properties in 444 ms.
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 1041 edges and 477 vertex of which 476 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.23 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(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, 399/399 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 470 transition count 392
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 470 transition count 392
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 466 transition count 388
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 466 transition count 388
Applied a total of 22 rules in 48 ms. Remains 466 /477 variables (removed 11) and now considering 388/399 (removed 11) transitions.
// Phase 1: matrix 388 rows 466 cols
[2024-05-22 00:00:53] [INFO ] Computed 95 invariants in 6 ms
[2024-05-22 00:00:53] [INFO ] Implicit Places using invariants in 556 ms returned []
[2024-05-22 00:00:54] [INFO ] Invariant cache hit.
[2024-05-22 00:00:54] [INFO ] Implicit Places using invariants and state equation in 582 ms returned [419, 420]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1156 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 464/477 places, 388/399 transitions.
Applied a total of 0 rules in 8 ms. Remains 464 /464 variables (removed 0) and now considering 388/388 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1212 ms. Remains : 464/477 places, 388/399 transitions.
Stuttering acceptance computed with spot in 361 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 712 reset in 260 ms.
Product exploration explored 100000 steps with 714 reset in 255 ms.
Computed a total of 123 stabilizing places and 116 stable transitions
Graph (complete) has 1011 edges and 464 vertex of which 463 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 123 stabilizing places and 116 stable transitions
Detected a total of 123/464 stabilizing places and 116/388 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 149 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 66 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (270 resets) in 268 ms. (148 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (46 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (48 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
// Phase 1: matrix 388 rows 464 cols
[2024-05-22 00:00:55] [INFO ] Computed 93 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) 247/303 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 133/436 variables, 29/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 19/455 variables, 11/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 382/837 variables, 455/548 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/837 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 13/850 variables, 7/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/850 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/852 variables, 2/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/852 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/852 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 852/852 variables, and 557 constraints, problems are : Problem set: 0 solved, 2 unsolved in 359 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 40/40 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) 247/303 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:00:56] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:00:56] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 133/436 variables, 29/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:00:56] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 19/455 variables, 11/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/455 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 382/837 variables, 455/551 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/837 variables, 2/553 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:00:56] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/837 variables, 1/554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/837 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 13/850 variables, 7/561 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/850 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/852 variables, 2/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/852 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/852 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 852/852 variables, and 563 constraints, problems are : Problem set: 0 solved, 2 unsolved in 564 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 464/464 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 947ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 326 ms.
Support contains 2 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 388/388 transitions.
Graph (trivial) has 211 edges and 464 vertex of which 6 / 464 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1004 edges and 459 vertex of which 458 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 334
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 334
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 234
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 295 transition count 234
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Deduced a syphon composed of 124 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 565 place count 165 transition count 110
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 567 place count 164 transition count 114
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 569 place count 164 transition count 112
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 571 place count 162 transition count 112
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 572 place count 162 transition count 112
Applied a total of 572 rules in 62 ms. Remains 162 /464 variables (removed 302) and now considering 112/388 (removed 276) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 162/464 places, 112/388 transitions.
RANDOM walk for 40000 steps (1655 resets) in 261 ms. (152 steps per ms) remains 1/2 properties
BEST_FIRST walk for 1872 steps (20 resets) in 8 ms. (208 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 510 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 89 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 98 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, 388/388 transitions.
Graph (trivial) has 211 edges and 464 vertex of which 6 / 464 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 1005 edges and 459 vertex of which 458 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 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 334
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 334
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 234
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 294 transition count 234
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 6 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 252 rules applied. Total rules applied 563 place count 165 transition count 111
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 565 place count 164 transition count 115
Applied a total of 565 rules in 85 ms. Remains 164 /464 variables (removed 300) and now considering 115/388 (removed 273) transitions.
// Phase 1: matrix 115 rows 164 cols
[2024-05-22 00:00:58] [INFO ] Computed 70 invariants in 3 ms
[2024-05-22 00:00:58] [INFO ] Implicit Places using invariants in 165 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 166 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 163/464 places, 115/388 transitions.
Applied a total of 0 rules in 8 ms. Remains 163 /163 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 259 ms. Remains : 163/464 places, 115/388 transitions.
Computed a total of 16 stabilizing places and 12 stable transitions
Computed a total of 16 stabilizing places and 12 stable transitions
Detected a total of 16/163 stabilizing places and 12/115 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 354 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 99 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (6680 resets) in 1146 ms. (34 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40001 steps (2262 resets) in 168 ms. (236 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (2131 resets) in 195 ms. (204 steps per ms) remains 2/2 properties
// Phase 1: matrix 115 rows 163 cols
[2024-05-22 00:00:59] [INFO ] Computed 69 invariants in 1 ms
[2024-05-22 00:00:59] [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) 115/124 variables, 52/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 31/155 variables, 12/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 5/160 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 114/274 variables, 160/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 5/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/277 variables, 3/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/277 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/277 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/278 variables, and 237 constraints, problems are : Problem set: 0 solved, 2 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 163/163 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) 115/124 variables, 52/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 31/155 variables, 12/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 5/160 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 114/274 variables, 160/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 5/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:00:59] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/274 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/274 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3/277 variables, 3/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/277 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/277 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 277/278 variables, and 240 constraints, problems are : Problem set: 0 solved, 2 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 163/163 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 410ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 17 ms.
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 115/115 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 163 transition count 114
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 163 transition count 112
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 161 transition count 112
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 161 transition count 112
Applied a total of 6 rules in 17 ms. Remains 161 /163 variables (removed 2) and now considering 112/115 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 161/163 places, 112/115 transitions.
RANDOM walk for 40000 steps (1594 resets) in 216 ms. (184 steps per ms) remains 1/1 properties
BEST_FIRST walk for 1757 steps (20 resets) in 10 ms. (159 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 513 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 112 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering criterion allowed to conclude after 31 steps with 5 reset in 0 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLFireability-00 finished in 7312 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, 399/399 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 1035 edges and 472 vertex of which 471 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
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 339
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 339
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 243
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 243
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 320 place count 300 transition count 237
Iterating global reduction 2 with 6 rules applied. Total rules applied 326 place count 300 transition count 237
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 6 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 582 place count 169 transition count 112
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 584 place count 168 transition count 116
Applied a total of 584 rules in 63 ms. Remains 168 /477 variables (removed 309) and now considering 116/399 (removed 283) transitions.
// Phase 1: matrix 116 rows 168 cols
[2024-05-22 00:01:00] [INFO ] Computed 73 invariants in 2 ms
[2024-05-22 00:01:00] [INFO ] Implicit Places using invariants in 156 ms returned [1, 2, 3, 4, 5, 6, 7, 16, 17, 21, 22, 23, 24, 25, 26, 48, 49, 50, 51, 52]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 157 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 148/477 places, 116/399 transitions.
Applied a total of 0 rules in 17 ms. Remains 148 /148 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 237 ms. Remains : 148/477 places, 116/399 transitions.
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-01
Product exploration explored 100000 steps with 13185 reset in 336 ms.
Product exploration explored 100000 steps with 13155 reset in 306 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/116 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 584 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 64 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (5696 resets) in 401 ms. (99 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (1856 resets) in 70 ms. (563 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1781 resets) in 74 ms. (533 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1666 resets) in 70 ms. (563 steps per ms) remains 3/3 properties
// Phase 1: matrix 116 rows 148 cols
[2024-05-22 00:01:02] [INFO ] Computed 53 invariants in 1 ms
[2024-05-22 00:01:02] [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, 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) 70/117 variables, 32/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 28/145 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 115/260 variables, 145/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 5/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/260 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 3/263 variables, 3/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/263 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/264 variables, and 206 constraints, problems are : Problem set: 0 solved, 3 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 148/148 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) 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) 70/117 variables, 32/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 28/145 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 115/260 variables, 145/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 5/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/260 variables, 3/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/260 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 3/263 variables, 3/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:01:02] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
Problem apf4 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/263 variables, 1/210 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/263 variables, 0/210 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/263 variables, 0/210 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 263/264 variables, and 210 constraints, problems are : Problem set: 1 solved, 2 unsolved in 262 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 148/148 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 443ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 22 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=22 )
Parikh walk visited 2 properties in 1 ms.
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 897 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 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Support contains 3 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, 116/116 transitions.
Applied a total of 0 rules in 9 ms. Remains 148 /148 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2024-05-22 00:01:03] [INFO ] Invariant cache hit.
[2024-05-22 00:01:04] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-22 00:01:04] [INFO ] Invariant cache hit.
[2024-05-22 00:01:04] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-22 00:01:04] [INFO ] Implicit Places using invariants and state equation in 260 ms returned [3, 5, 9, 12, 20, 26, 29, 31, 34, 36, 38, 39, 40, 42, 44, 46, 48, 50, 56, 58, 60, 67, 69, 71, 73, 75, 77, 79, 81, 89, 91, 93, 95, 97, 119, 120, 138]
Discarding 37 places :
Implicit Place search using SMT with State Equation took 454 ms to find 37 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/148 places, 116/116 transitions.
Graph (complete) has 306 edges and 111 vertex of which 100 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 100 transition count 104
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 93 transition count 104
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 21 place count 87 transition count 93
Iterating global reduction 2 with 6 rules applied. Total rules applied 27 place count 87 transition count 93
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 87 transition count 90
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 33 place count 84 transition count 90
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 34 place count 83 transition count 89
Iterating global reduction 4 with 1 rules applied. Total rules applied 35 place count 83 transition count 89
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 52 place count 74 transition count 81
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 54 place count 73 transition count 80
Applied a total of 54 rules in 16 ms. Remains 73 /111 variables (removed 38) and now considering 80/116 (removed 36) transitions.
// Phase 1: matrix 80 rows 73 cols
[2024-05-22 00:01:04] [INFO ] Computed 13 invariants in 4 ms
[2024-05-22 00:01:04] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-22 00:01:04] [INFO ] Invariant cache hit.
[2024-05-22 00:01:04] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 00:01:04] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 73/148 places, 80/116 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 699 ms. Remains : 73/148 places, 80/116 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 76 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 39 ms :[(NOT p0)]
RANDOM walk for 40000 steps (5785 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1808 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 6 ms. (steps per millisecond=13 )
Probabilistic random walk after 83 steps, saw 60 distinct states, run finished after 15 ms. (steps per millisecond=5 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 151 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 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13403 reset in 233 ms.
Product exploration explored 100000 steps with 13385 reset in 173 ms.
Built C files in :
/tmp/ltsmin15130617642220263093
[2024-05-22 00:01:05] [INFO ] Computing symmetric may disable matrix : 80 transitions.
[2024-05-22 00:01:05] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:01:05] [INFO ] Computing symmetric may enable matrix : 80 transitions.
[2024-05-22 00:01:05] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:01:05] [INFO ] Computing Do-Not-Accords matrix : 80 transitions.
[2024-05-22 00:01:05] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:01:05] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15130617642220263093
Running compilation step : cd /tmp/ltsmin15130617642220263093;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 394 ms.
Running link step : cd /tmp/ltsmin15130617642220263093;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin15130617642220263093;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4187167553179417597.hoa' '--buchi-type=spotba'
LTSmin run took 183 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-14-LTLFireability-01 finished in 5610 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, 399/399 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 1035 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 340
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 340
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 241
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 241
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 324 place count 298 transition count 236
Iterating global reduction 2 with 5 rules applied. Total rules applied 329 place count 298 transition count 236
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 6 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 585 place count 167 transition count 111
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 587 place count 166 transition count 115
Applied a total of 587 rules in 49 ms. Remains 166 /477 variables (removed 311) and now considering 115/399 (removed 284) transitions.
// Phase 1: matrix 115 rows 166 cols
[2024-05-22 00:01:06] [INFO ] Computed 72 invariants in 1 ms
[2024-05-22 00:01:06] [INFO ] Implicit Places using invariants in 196 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 46, 47, 48, 49, 50]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 198 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 146/477 places, 115/399 transitions.
Applied a total of 0 rules in 18 ms. Remains 146 /146 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 265 ms. Remains : 146/477 places, 115/399 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-05
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLFireability-05 finished in 420 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, 399/399 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 470 transition count 392
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 470 transition count 392
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 466 transition count 388
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 466 transition count 388
Applied a total of 22 rules in 68 ms. Remains 466 /477 variables (removed 11) and now considering 388/399 (removed 11) transitions.
// Phase 1: matrix 388 rows 466 cols
[2024-05-22 00:01:06] [INFO ] Computed 95 invariants in 3 ms
[2024-05-22 00:01:06] [INFO ] Implicit Places using invariants in 243 ms returned []
[2024-05-22 00:01:06] [INFO ] Invariant cache hit.
[2024-05-22 00:01:07] [INFO ] Implicit Places using invariants and state equation in 559 ms returned [419, 420]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 806 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 464/477 places, 388/399 transitions.
Applied a total of 0 rules in 8 ms. Remains 464 /464 variables (removed 0) and now considering 388/388 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 882 ms. Remains : 464/477 places, 388/399 transitions.
Stuttering acceptance computed with spot in 128 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 143 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 1041 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, 399/399 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 1035 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 340
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 338
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 338
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 238
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 238
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 332 place count 293 transition count 231
Iterating global reduction 3 with 7 rules applied. Total rules applied 339 place count 293 transition count 231
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 6 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 246 rules applied. Total rules applied 585 place count 167 transition count 111
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 587 place count 166 transition count 115
Applied a total of 587 rules in 52 ms. Remains 166 /477 variables (removed 311) and now considering 115/399 (removed 284) transitions.
// Phase 1: matrix 115 rows 166 cols
[2024-05-22 00:01:07] [INFO ] Computed 72 invariants in 1 ms
[2024-05-22 00:01:08] [INFO ] Implicit Places using invariants in 272 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 20, 21, 22, 23, 26, 48, 49, 50, 51, 52]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 287 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 148/477 places, 115/399 transitions.
Applied a total of 0 rules in 3 ms. Remains 148 /148 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 343 ms. Remains : 148/477 places, 115/399 transitions.
Stuttering acceptance computed with spot in 255 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 15216 reset in 260 ms.
Product exploration explored 100000 steps with 15220 reset in 266 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/115 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 648 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 181 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (6599 resets) in 188 ms. (211 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (2269 resets) in 75 ms. (526 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (2100 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (2384 resets) in 93 ms. (425 steps per ms) remains 3/3 properties
// Phase 1: matrix 115 rows 148 cols
[2024-05-22 00:01:09] [INFO ] Computed 54 invariants in 1 ms
[2024-05-22 00:01:09] [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) 28/145 variables, 17/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 114/259 variables, 145/199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 5/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 3/262 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/262 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/262 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/263 variables, and 207 constraints, problems are : Problem set: 0 solved, 3 unsolved in 428 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 148/148 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
[2024-05-22 00:01:10] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 2 ms to minimize.
[2024-05-22 00:01:10] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:01:10] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:01:10] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 28/145 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 114/259 variables, 145/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 5/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 3/262 variables, 3/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/262 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/262 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/262 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/263 variables, and 214 constraints, problems are : Problem set: 0 solved, 3 unsolved in 377 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 148/148 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 810ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 21 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=10 )
Parikh walk visited 3 properties in 7 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 676 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 3647 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, 399/399 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 471 transition count 393
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 471 transition count 393
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 467 transition count 389
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 467 transition count 389
Applied a total of 20 rules in 51 ms. Remains 467 /477 variables (removed 10) and now considering 389/399 (removed 10) transitions.
// Phase 1: matrix 389 rows 467 cols
[2024-05-22 00:01:11] [INFO ] Computed 95 invariants in 3 ms
[2024-05-22 00:01:11] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-05-22 00:01:11] [INFO ] Invariant cache hit.
[2024-05-22 00:01:12] [INFO ] Implicit Places using invariants and state equation in 620 ms returned [420, 421]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 878 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 465/477 places, 389/399 transitions.
Applied a total of 0 rules in 15 ms. Remains 465 /465 variables (removed 0) and now considering 389/389 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 944 ms. Remains : 465/477 places, 389/399 transitions.
Stuttering acceptance computed with spot in 367 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 678 reset in 251 ms.
Product exploration explored 100000 steps with 684 reset in 229 ms.
Computed a total of 124 stabilizing places and 117 stable transitions
Graph (complete) has 1012 edges and 465 vertex of which 464 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/465 stabilizing places and 117/389 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 194 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 193 ms :[true, (NOT p2), (AND (NOT p2) p1), p1]
RANDOM walk for 40000 steps (267 resets) in 204 ms. (195 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (44 resets) in 64 ms. (615 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (31 resets) in 67 ms. (588 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (34 resets) in 52 ms. (754 steps per ms) remains 3/3 properties
// Phase 1: matrix 389 rows 465 cols
[2024-05-22 00:01:13] [INFO ] Computed 93 invariants in 3 ms
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) 46/50 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 255/305 variables, 50/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:01:13] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:01:13] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:01:14] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:01:14] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:01:14] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:01:14] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 122/427 variables, 29/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:01:14] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 2 ms to minimize.
[2024-05-22 00:01:14] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/427 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 29/456 variables, 11/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/456 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 383/839 variables, 456/557 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:01:15] [INFO ] Deduced a trap composed of 11 places in 552 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/839 variables, 1/558 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/839 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 13/852 variables, 7/565 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:01:15] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/852 variables, 1/566 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/852 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/854 variables, 2/568 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/854 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/854 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 854/854 variables, and 568 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2067 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 465/465 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 10/10 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) 46/50 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 255/305 variables, 50/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:01:15] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-05-22 00:01:16] [INFO ] Deduced a trap composed of 24 places in 435 ms of which 1 ms to minimize.
[2024-05-22 00:01:16] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 122/427 variables, 29/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 29/456 variables, 11/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/456 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 383/839 variables, 456/561 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:01:16] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:01:16] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:01:16] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:01:17] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:01:17] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 1 ms to minimize.
[2024-05-22 00:01:17] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 1 ms to minimize.
[2024-05-22 00:01:17] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:01:17] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-05-22 00:01:17] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 2 ms to minimize.
[2024-05-22 00:01:17] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 2 ms to minimize.
[2024-05-22 00:01:17] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/839 variables, 11/572 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/839 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 13/852 variables, 7/579 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/852 variables, 3/582 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/852 variables, 1/583 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:01:17] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:01:18] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:01:18] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 2 ms to minimize.
[2024-05-22 00:01:18] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:01:18] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/852 variables, 5/588 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:01:18] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/852 variables, 1/589 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/852 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 2/854 variables, 2/591 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/854 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/854 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 854/854 variables, and 591 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3089 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 465/465 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 30/30 constraints]
After SMT, in 5179ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 102 ms.
Support contains 4 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 389/389 transitions.
Graph (complete) has 1012 edges and 465 vertex of which 464 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
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 464 transition count 340
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 416 transition count 338
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 101 place count 414 transition count 338
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 414 transition count 238
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 3 with 217 rules applied. Total rules applied 318 place count 297 transition count 238
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 319 place count 296 transition count 237
Iterating global reduction 3 with 1 rules applied. Total rules applied 320 place count 296 transition count 237
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 6 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 576 place count 165 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 577 place count 165 transition count 111
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 579 place count 164 transition count 115
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 585 place count 164 transition count 115
Applied a total of 585 rules in 25 ms. Remains 164 /465 variables (removed 301) and now considering 115/389 (removed 274) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 164/465 places, 115/389 transitions.
RANDOM walk for 40000 steps (3897 resets) in 276 ms. (144 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1012 resets) in 103 ms. (384 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 214 ms. (steps per millisecond=263 ) 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 161 ms. (steps per millisecond=350 ) 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 449 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 165 ms :[true, (NOT p2), (AND (NOT p2) p1), p1]
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p2), (AND (NOT p2) p1), p1]
Support contains 4 out of 465 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 465/465 places, 389/389 transitions.
Graph (complete) has 1012 edges and 465 vertex of which 464 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 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 339
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 337
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 337
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 413 transition count 238
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 3 with 215 rules applied. Total rules applied 316 place count 297 transition count 238
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 6 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 572 place count 166 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 573 place count 166 transition count 112
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 575 place count 165 transition count 116
Applied a total of 575 rules in 37 ms. Remains 165 /465 variables (removed 300) and now considering 116/389 (removed 273) transitions.
// Phase 1: matrix 116 rows 165 cols
[2024-05-22 00:01:20] [INFO ] Computed 70 invariants in 1 ms
[2024-05-22 00:01:20] [INFO ] Implicit Places using invariants in 220 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 222 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 164/465 places, 116/389 transitions.
Applied a total of 0 rules in 3 ms. Remains 164 /164 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 262 ms. Remains : 164/465 places, 116/389 transitions.
Computed a total of 16 stabilizing places and 12 stable transitions
Computed a total of 16 stabilizing places and 12 stable transitions
Detected a total of 16/164 stabilizing places and 12/116 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 430 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 139 ms :[true, (NOT p2), (AND (NOT p2) p1), p1]
RANDOM walk for 40000 steps (4002 resets) in 236 ms. (168 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40002 steps (958 resets) in 92 ms. (430 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (874 resets) in 92 ms. (430 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (898 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
// Phase 1: matrix 116 rows 164 cols
[2024-05-22 00:01:21] [INFO ] Computed 69 invariants in 2 ms
[2024-05-22 00:01:21] [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) 7/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 100/111 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 41/152 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:01:21] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 9/161 variables, 8/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 116/277 variables, 161/231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/277 variables, 5/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/277 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 3/280 variables, 3/239 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/280 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/280 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 239 constraints, problems are : Problem set: 0 solved, 3 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 164/164 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) 7/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 100/111 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 41/152 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:01:21] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-22 00:01:21] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 9/161 variables, 8/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:01:21] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/161 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/161 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 116/277 variables, 161/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/277 variables, 5/239 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/277 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/277 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 3/280 variables, 3/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/280 variables, 2/245 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/280 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/280 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 245 constraints, problems are : Problem set: 0 solved, 3 unsolved in 397 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 164/164 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 731ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 47 ms.
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 116/116 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 163 transition count 115
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 163 transition count 115
Applied a total of 3 rules in 9 ms. Remains 163 /164 variables (removed 1) and now considering 115/116 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 163/164 places, 115/116 transitions.
RANDOM walk for 40000 steps (3905 resets) in 182 ms. (218 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (893 resets) in 81 ms. (487 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 174 ms. (steps per millisecond=324 ) 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 144 ms. (steps per millisecond=391 ) 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 747 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 124 ms :[true, (NOT p2), (AND (NOT p2) p1), p1]
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p2), (AND (NOT p2) p1), p1]
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p2), (AND (NOT p2) p1), p1]
Product exploration explored 100000 steps with 9995 reset in 320 ms.
Product exploration explored 100000 steps with 9935 reset in 346 ms.
Built C files in :
/tmp/ltsmin908085560261421967
[2024-05-22 00:01:24] [INFO ] Computing symmetric may disable matrix : 116 transitions.
[2024-05-22 00:01:24] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:01:24] [INFO ] Computing symmetric may enable matrix : 116 transitions.
[2024-05-22 00:01:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:01:24] [INFO ] Computing Do-Not-Accords matrix : 116 transitions.
[2024-05-22 00:01:24] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:01:24] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin908085560261421967
Running compilation step : cd /tmp/ltsmin908085560261421967;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 317 ms.
Running link step : cd /tmp/ltsmin908085560261421967;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin908085560261421967;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13150843807368714730.hoa' '--buchi-type=spotba'
LTSmin run took 904 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-14-LTLFireability-10 finished in 14321 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, 399/399 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 471 transition count 393
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 471 transition count 393
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 467 transition count 389
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 467 transition count 389
Applied a total of 20 rules in 21 ms. Remains 467 /477 variables (removed 10) and now considering 389/399 (removed 10) transitions.
// Phase 1: matrix 389 rows 467 cols
[2024-05-22 00:01:25] [INFO ] Computed 95 invariants in 3 ms
[2024-05-22 00:01:25] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-22 00:01:25] [INFO ] Invariant cache hit.
[2024-05-22 00:01:26] [INFO ] Implicit Places using invariants and state equation in 436 ms returned [420, 421]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 582 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 465/477 places, 389/399 transitions.
Applied a total of 0 rules in 7 ms. Remains 465 /465 variables (removed 0) and now considering 389/389 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 611 ms. Remains : 465/477 places, 389/399 transitions.
Stuttering acceptance computed with spot in 403 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 2072 steps with 58 reset in 3 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLFireability-11 finished in 1037 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, 399/399 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 472 transition count 394
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 472 transition count 394
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 470 transition count 392
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 470 transition count 392
Applied a total of 14 rules in 19 ms. Remains 470 /477 variables (removed 7) and now considering 392/399 (removed 7) transitions.
// Phase 1: matrix 392 rows 470 cols
[2024-05-22 00:01:26] [INFO ] Computed 95 invariants in 3 ms
[2024-05-22 00:01:26] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-22 00:01:26] [INFO ] Invariant cache hit.
[2024-05-22 00:01:27] [INFO ] Implicit Places using invariants and state equation in 410 ms returned [423, 424]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 594 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 468/477 places, 392/399 transitions.
Applied a total of 0 rules in 6 ms. Remains 468 /468 variables (removed 0) and now considering 392/392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 621 ms. Remains : 468/477 places, 392/399 transitions.
Stuttering acceptance computed with spot in 183 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 686 reset in 182 ms.
Stack based approach found an accepted trace after 22196 steps with 150 reset with depth 6 and stack size 6 in 48 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-14-LTLFireability-12 finished in 1053 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, 399/399 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 470 transition count 392
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 470 transition count 392
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 466 transition count 388
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 466 transition count 388
Applied a total of 22 rules in 32 ms. Remains 466 /477 variables (removed 11) and now considering 388/399 (removed 11) transitions.
// Phase 1: matrix 388 rows 466 cols
[2024-05-22 00:01:27] [INFO ] Computed 95 invariants in 5 ms
[2024-05-22 00:01:28] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-05-22 00:01:28] [INFO ] Invariant cache hit.
[2024-05-22 00:01:28] [INFO ] Implicit Places using invariants and state equation in 517 ms returned [419, 420]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 748 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 464/477 places, 388/399 transitions.
Applied a total of 0 rules in 17 ms. Remains 464 /464 variables (removed 0) and now considering 388/388 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 797 ms. Remains : 464/477 places, 388/399 transitions.
Stuttering acceptance computed with spot in 201 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 684 reset in 188 ms.
Product exploration explored 100000 steps with 681 reset in 190 ms.
Computed a total of 123 stabilizing places and 116 stable transitions
Graph (complete) has 1011 edges and 464 vertex of which 463 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 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 123 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 43 ms :[true, (NOT p2)]
RANDOM walk for 40000 steps (271 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (47 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2301 steps, run visited all 1 properties in 12 ms. (steps per millisecond=191 )
Probabilistic random walk after 2301 steps, saw 2053 distinct states, run finished after 12 ms. (steps per millisecond=191 ) 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 115 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 1779 ms.
All properties solved by simple procedures.
Total runtime 79046 ms.

BK_STOP 1716336089596

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-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 r048-tajo-171620399800556"
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 ;