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-171620399600500.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-07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399600500
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K 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.7K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 16:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Apr 11 16:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 11 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 11 16:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 100K 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-07-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716334200221

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-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 23:30:01] [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-21 23:30:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:30:01] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2024-05-21 23:30:01] [INFO ] Transformed 386 places.
[2024-05-21 23:30:01] [INFO ] Transformed 360 transitions.
[2024-05-21 23:30:01] [INFO ] Found NUPN structural information;
[2024-05-21 23:30:01] [INFO ] Parsed PT model containing 386 places and 360 transitions and 1110 arcs in 250 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-07-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 386 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 386/386 places, 360/360 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 385 transition count 360
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 48 place count 338 transition count 313
Iterating global reduction 1 with 47 rules applied. Total rules applied 95 place count 338 transition count 313
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 116 place count 317 transition count 292
Iterating global reduction 1 with 21 rules applied. Total rules applied 137 place count 317 transition count 292
Applied a total of 137 rules in 112 ms. Remains 317 /386 variables (removed 69) and now considering 292/360 (removed 68) transitions.
// Phase 1: matrix 292 rows 317 cols
[2024-05-21 23:30:02] [INFO ] Computed 61 invariants in 23 ms
[2024-05-21 23:30:02] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-21 23:30:02] [INFO ] Invariant cache hit.
[2024-05-21 23:30:02] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 592 ms to find 0 implicit places.
Running 291 sub problems to find dead transitions.
[2024-05-21 23:30:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (OVERLAPS) 1/317 variables, 33/60 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-21 23:30:07] [INFO ] Deduced a trap composed of 60 places in 107 ms of which 18 ms to minimize.
[2024-05-21 23:30:07] [INFO ] Deduced a trap composed of 77 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:30:07] [INFO ] Deduced a trap composed of 63 places in 132 ms of which 9 ms to minimize.
[2024-05-21 23:30:07] [INFO ] Deduced a trap composed of 82 places in 168 ms of which 2 ms to minimize.
[2024-05-21 23:30:07] [INFO ] Deduced a trap composed of 59 places in 106 ms of which 5 ms to minimize.
[2024-05-21 23:30:07] [INFO ] Deduced a trap composed of 59 places in 109 ms of which 5 ms to minimize.
[2024-05-21 23:30:07] [INFO ] Deduced a trap composed of 67 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:30:08] [INFO ] Deduced a trap composed of 47 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:30:08] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:30:08] [INFO ] Deduced a trap composed of 76 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:30:08] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:30:08] [INFO ] Deduced a trap composed of 63 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:30:08] [INFO ] Deduced a trap composed of 59 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:30:08] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:30:08] [INFO ] Deduced a trap composed of 62 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:30:08] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:30:08] [INFO ] Deduced a trap composed of 66 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:30:08] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:30:08] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:30:09] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-21 23:30:09] [INFO ] Deduced a trap composed of 67 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:30:09] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:30:09] [INFO ] Deduced a trap composed of 75 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:30:09] [INFO ] Deduced a trap composed of 73 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:30:09] [INFO ] Deduced a trap composed of 65 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:30:09] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:30:09] [INFO ] Deduced a trap composed of 71 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:30:09] [INFO ] Deduced a trap composed of 84 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:30:09] [INFO ] Deduced a trap composed of 82 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:30:09] [INFO ] Deduced a trap composed of 75 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:30:10] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:30:10] [INFO ] Deduced a trap composed of 70 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:30:10] [INFO ] Deduced a trap composed of 80 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:30:10] [INFO ] Deduced a trap composed of 78 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:30:10] [INFO ] Deduced a trap composed of 79 places in 58 ms of which 4 ms to minimize.
[2024-05-21 23:30:10] [INFO ] Deduced a trap composed of 70 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:30:10] [INFO ] Deduced a trap composed of 68 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:30:10] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:30:10] [INFO ] Deduced a trap composed of 69 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:30:10] [INFO ] Deduced a trap composed of 70 places in 63 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-21 23:30:10] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:30:10] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:30:11] [INFO ] Deduced a trap composed of 66 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:30:11] [INFO ] Deduced a trap composed of 67 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:30:11] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:30:11] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:30:11] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:30:11] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:30:11] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:30:11] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:30:11] [INFO ] Deduced a trap composed of 75 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:30:11] [INFO ] Deduced a trap composed of 62 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:30:11] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:30:11] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:30:11] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:30:11] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:30:12] [INFO ] Deduced a trap composed of 62 places in 60 ms of which 8 ms to minimize.
[2024-05-21 23:30:12] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:30:12] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:30:12] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-21 23:30:13] [INFO ] Deduced a trap composed of 70 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:30:13] [INFO ] Deduced a trap composed of 68 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:30:13] [INFO ] Deduced a trap composed of 81 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:30:14] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:30:14] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:30:14] [INFO ] Deduced a trap composed of 80 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:30:14] [INFO ] Deduced a trap composed of 74 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:30:14] [INFO ] Deduced a trap composed of 67 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:30:14] [INFO ] Deduced a trap composed of 77 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:30:14] [INFO ] Deduced a trap composed of 88 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:30:14] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:30:14] [INFO ] Deduced a trap composed of 67 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:30:14] [INFO ] Deduced a trap composed of 83 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:30:14] [INFO ] Deduced a trap composed of 62 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:30:14] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:30:15] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:30:15] [INFO ] Deduced a trap composed of 57 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:30:15] [INFO ] Deduced a trap composed of 67 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:30:15] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:30:15] [INFO ] Deduced a trap composed of 77 places in 91 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-21 23:30:15] [INFO ] Deduced a trap composed of 59 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:30:15] [INFO ] Deduced a trap composed of 61 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:30:15] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:30:16] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:30:16] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:30:16] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:30:16] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:30:16] [INFO ] Deduced a trap composed of 73 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:30:16] [INFO ] Deduced a trap composed of 68 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:30:16] [INFO ] Deduced a trap composed of 69 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:30:16] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:30:16] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:30:16] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:30:16] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:30:16] [INFO ] Deduced a trap composed of 66 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:30:17] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:30:17] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:30:17] [INFO ] Deduced a trap composed of 67 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:30:17] [INFO ] Deduced a trap composed of 79 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:30:17] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-21 23:30:17] [INFO ] Deduced a trap composed of 77 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:30:17] [INFO ] Deduced a trap composed of 66 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:30:18] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:30:18] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:30:18] [INFO ] Deduced a trap composed of 83 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:30:18] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:30:18] [INFO ] Deduced a trap composed of 80 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:30:18] [INFO ] Deduced a trap composed of 70 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:30:18] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:30:18] [INFO ] Deduced a trap composed of 77 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:30:18] [INFO ] Deduced a trap composed of 66 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:30:18] [INFO ] Deduced a trap composed of 20 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:30:18] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:30:18] [INFO ] Deduced a trap composed of 79 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:30:19] [INFO ] Deduced a trap composed of 68 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:30:19] [INFO ] Deduced a trap composed of 78 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:30:19] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:30:19] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:30:19] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:30:19] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
Problem TDEAD221 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD263 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 20/181 constraints. Problems are: Problem set: 6 solved, 285 unsolved
[2024-05-21 23:30:21] [INFO ] Deduced a trap composed of 78 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:30:21] [INFO ] Deduced a trap composed of 60 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:30:21] [INFO ] Deduced a trap composed of 61 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:30:21] [INFO ] Deduced a trap composed of 71 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:30:21] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:30:21] [INFO ] Deduced a trap composed of 80 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:30:21] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:30:21] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:30:21] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:30:21] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:30:21] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:30:22] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:30:22] [INFO ] Deduced a trap composed of 57 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:30:22] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:30:22] [INFO ] Deduced a trap composed of 67 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:30:22] [INFO ] Deduced a trap composed of 60 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:30:22] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:30:22] [INFO ] Deduced a trap composed of 75 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:30:22] [INFO ] Deduced a trap composed of 60 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:30:22] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 2 ms to minimize.
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD258 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 20/201 constraints. Problems are: Problem set: 9 solved, 282 unsolved
[2024-05-21 23:30:23] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:30:23] [INFO ] Deduced a trap composed of 62 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:30:23] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:30:23] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:30:23] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:30:24] [INFO ] Deduced a trap composed of 68 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:30:24] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:30:24] [INFO ] Deduced a trap composed of 74 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:30:24] [INFO ] Deduced a trap composed of 68 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:30:24] [INFO ] Deduced a trap composed of 71 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:30:24] [INFO ] Deduced a trap composed of 69 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:30:24] [INFO ] Deduced a trap composed of 67 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:30:24] [INFO ] Deduced a trap composed of 61 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:30:24] [INFO ] Deduced a trap composed of 63 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:30:24] [INFO ] Deduced a trap composed of 77 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:30:25] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:30:25] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:30:25] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:30:25] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:30:25] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 20/221 constraints. Problems are: Problem set: 22 solved, 269 unsolved
[2024-05-21 23:30:26] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:30:26] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:30:26] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:30:26] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:30:27] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:30:27] [INFO ] Deduced a trap composed of 69 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:30:27] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:30:27] [INFO ] Deduced a trap composed of 69 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:30:27] [INFO ] Deduced a trap composed of 69 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:30:27] [INFO ] Deduced a trap composed of 70 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:30:27] [INFO ] Deduced a trap composed of 67 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:30:27] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:30:27] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:30:27] [INFO ] Deduced a trap composed of 70 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:30:28] [INFO ] Deduced a trap composed of 70 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:30:28] [INFO ] Deduced a trap composed of 73 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:30:28] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:30:28] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:30:28] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:30:28] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 2 ms to minimize.
Problem TDEAD222 is UNSAT
Problem TDEAD226 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/317 variables, 20/241 constraints. Problems are: Problem set: 24 solved, 267 unsolved
[2024-05-21 23:30:30] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:30:30] [INFO ] Deduced a trap composed of 77 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:30:31] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:30:31] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:30:31] [INFO ] Deduced a trap composed of 65 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:30:31] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:30:31] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:30:31] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:30:31] [INFO ] Deduced a trap composed of 74 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:30:31] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 3 ms to minimize.
[2024-05-21 23:30:31] [INFO ] Deduced a trap composed of 75 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:30:32] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:30:32] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:30:32] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 2 ms to minimize.
SMT process timed out in 30175ms, After SMT, problems are : Problem set: 24 solved, 267 unsolved
Search for dead transitions found 24 dead transitions in 30193ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 317/386 places, 268/360 transitions.
Applied a total of 0 rules in 11 ms. Remains 317 /317 variables (removed 0) and now considering 268/268 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30935 ms. Remains : 317/386 places, 268/360 transitions.
Support contains 54 out of 317 places after structural reductions.
[2024-05-21 23:30:33] [INFO ] Flatten gal took : 80 ms
[2024-05-21 23:30:33] [INFO ] Flatten gal took : 29 ms
[2024-05-21 23:30:33] [INFO ] Input system was already deterministic with 268 transitions.
RANDOM walk for 40000 steps (436 resets) in 1562 ms. (25 steps per ms) remains 5/34 properties
BEST_FIRST walk for 40002 steps (74 resets) in 195 ms. (204 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (94 resets) in 129 ms. (307 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (82 resets) in 118 ms. (336 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (83 resets) in 66 ms. (597 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (80 resets) in 99 ms. (400 steps per ms) remains 5/5 properties
// Phase 1: matrix 268 rows 317 cols
[2024-05-21 23:30:34] [INFO ] Computed 61 invariants in 6 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 140/153 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 23:30:34] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 73/226 variables, 15/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 23:30:34] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:30:34] [INFO ] Deduced a trap composed of 17 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:30:34] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:30:34] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:30:34] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp8 is UNSAT
At refinement iteration 7 (OVERLAPS) 85/311 variables, 26/65 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-21 23:30:34] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:30:34] [INFO ] Deduced a trap composed of 75 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:30:34] [INFO ] Deduced a trap composed of 79 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:30:35] [INFO ] Deduced a trap composed of 58 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:30:35] [INFO ] Deduced a trap composed of 63 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:30:35] [INFO ] Deduced a trap composed of 76 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:30:35] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 2 ms to minimize.
Problem AtomicPropp21 is UNSAT
[2024-05-21 23:30:35] [INFO ] Deduced a trap composed of 61 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:30:35] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:30:35] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 2 ms to minimize.
Problem AtomicPropp33 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 10/75 constraints. Problems are: Problem set: 3 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 0/75 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3/314 variables, 2/77 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/314 variables, 0/77 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 266/580 variables, 314/391 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-21 23:30:35] [INFO ] Deduced a trap composed of 61 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:30:35] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:30:35] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:30:35] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:30:36] [INFO ] Deduced a trap composed of 67 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:30:36] [INFO ] Deduced a trap composed of 73 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:30:36] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:30:36] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:30:36] [INFO ] Deduced a trap composed of 83 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:30:36] [INFO ] Deduced a trap composed of 80 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:30:36] [INFO ] Deduced a trap composed of 63 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:30:36] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:30:36] [INFO ] Deduced a trap composed of 73 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:30:36] [INFO ] Deduced a trap composed of 63 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:30:36] [INFO ] Deduced a trap composed of 68 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:30:36] [INFO ] Deduced a trap composed of 69 places in 60 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/580 variables, 16/407 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/580 variables, 0/407 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 5/585 variables, 3/410 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-21 23:30:37] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:30:37] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:30:37] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/585 variables, 3/413 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/585 variables, 0/413 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/585 variables, 0/413 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 585/585 variables, and 413 constraints, problems are : Problem set: 3 solved, 2 unsolved in 3026 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 87/93 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 132/225 variables, 29/33 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 7/40 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-21 23:30:37] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:30:37] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:30:37] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 3/43 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/43 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 85/310 variables, 25/68 constraints. Problems are: Problem set: 3 solved, 2 unsolved
Problem AtomicPropp20 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 21/89 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 0/89 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/314 variables, 3/92 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/314 variables, 7/99 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/314 variables, 0/99 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 266/580 variables, 314/413 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/580 variables, 1/414 constraints. Problems are: Problem set: 4 solved, 1 unsolved
[2024-05-21 23:30:37] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/580 variables, 1/415 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/580 variables, 0/415 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/585 variables, 3/418 constraints. Problems are: Problem set: 4 solved, 1 unsolved
[2024-05-21 23:30:37] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:30:37] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/585 variables, 2/420 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/585 variables, 0/420 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/585 variables, 0/420 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 585/585 variables, and 420 constraints, problems are : Problem set: 4 solved, 1 unsolved in 572 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 1/5 constraints, Known Traps: 41/41 constraints]
After SMT, in 3624ms problems are : Problem set: 4 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 3 out of 317 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 268/268 transitions.
Graph (trivial) has 145 edges and 317 vertex of which 6 / 317 are part of one of the 1 SCC in 2 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 683 edges and 312 vertex of which 311 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 36 place count 311 transition count 226
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 70 place count 277 transition count 226
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 70 place count 277 transition count 163
Deduced a syphon composed of 63 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 135 rules applied. Total rules applied 205 place count 205 transition count 163
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 216 place count 194 transition count 152
Iterating global reduction 2 with 11 rules applied. Total rules applied 227 place count 194 transition count 152
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 227 place count 194 transition count 150
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 231 place count 192 transition count 150
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 139 rules applied. Total rules applied 370 place count 121 transition count 82
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 372 place count 120 transition count 85
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 374 place count 120 transition count 83
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 376 place count 118 transition count 83
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 380 place count 118 transition count 83
Applied a total of 380 rules in 63 ms. Remains 118 /317 variables (removed 199) and now considering 83/268 (removed 185) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 118/317 places, 83/268 transitions.
RANDOM walk for 40000 steps (2619 resets) in 593 ms. (67 steps per ms) remains 1/1 properties
BEST_FIRST walk for 8283 steps (243 resets) in 26 ms. (306 steps per ms) remains 0/1 properties
Successfully simplified 4 atomic propositions for a total of 15 simplifications.
FORMULA BusinessProcesses-PT-07-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 199 stabilizing places and 177 stable transitions
Graph (complete) has 690 edges and 317 vertex of which 316 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 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||X(X(p0))))) U p1)||G(F(p1))))'
Support contains 4 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 268/268 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 304 transition count 255
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 304 transition count 255
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 303 transition count 254
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 303 transition count 254
Applied a total of 28 rules in 14 ms. Remains 303 /317 variables (removed 14) and now considering 254/268 (removed 14) transitions.
// Phase 1: matrix 254 rows 303 cols
[2024-05-21 23:30:38] [INFO ] Computed 61 invariants in 8 ms
[2024-05-21 23:30:38] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-21 23:30:38] [INFO ] Invariant cache hit.
[2024-05-21 23:30:38] [INFO ] Implicit Places using invariants and state equation in 272 ms returned [69, 70]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 430 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/317 places, 254/268 transitions.
Applied a total of 0 rules in 9 ms. Remains 301 /301 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 453 ms. Remains : 301/317 places, 254/268 transitions.
Stuttering acceptance computed with spot in 403 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-00
Stuttering criterion allowed to conclude after 138 steps with 0 reset in 3 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-00 finished in 932 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 268/268 transitions.
Graph (trivial) has 145 edges and 317 vertex of which 6 / 317 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 684 edges and 312 vertex of which 311 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 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 36 place count 310 transition count 226
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 70 place count 276 transition count 226
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 70 place count 276 transition count 163
Deduced a syphon composed of 63 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 135 rules applied. Total rules applied 205 place count 204 transition count 163
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 216 place count 193 transition count 152
Iterating global reduction 2 with 11 rules applied. Total rules applied 227 place count 193 transition count 152
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 227 place count 193 transition count 150
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 231 place count 191 transition count 150
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 137 rules applied. Total rules applied 368 place count 121 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 370 place count 120 transition count 86
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 376 place count 120 transition count 86
Applied a total of 376 rules in 31 ms. Remains 120 /317 variables (removed 197) and now considering 86/268 (removed 182) transitions.
// Phase 1: matrix 86 rows 120 cols
[2024-05-21 23:30:39] [INFO ] Computed 49 invariants in 1 ms
[2024-05-21 23:30:39] [INFO ] Implicit Places using invariants in 68 ms returned [4, 12, 38, 39, 40, 41, 42, 43, 44]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 69 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/317 places, 86/268 transitions.
Applied a total of 0 rules in 4 ms. Remains 111 /111 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 105 ms. Remains : 111/317 places, 86/268 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-01 finished in 147 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 (p1||G(!p0)))&&(p2||X(p3)))))'
Support contains 7 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 268/268 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 306 transition count 257
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 306 transition count 257
Applied a total of 22 rules in 7 ms. Remains 306 /317 variables (removed 11) and now considering 257/268 (removed 11) transitions.
// Phase 1: matrix 257 rows 306 cols
[2024-05-21 23:30:39] [INFO ] Computed 61 invariants in 4 ms
[2024-05-21 23:30:39] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-21 23:30:39] [INFO ] Invariant cache hit.
[2024-05-21 23:30:39] [INFO ] Implicit Places using invariants and state equation in 263 ms returned [69, 70]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 378 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 304/317 places, 257/268 transitions.
Applied a total of 0 rules in 4 ms. Remains 304 /304 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 389 ms. Remains : 304/317 places, 257/268 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (OR (NOT p3) (AND p0 (NOT p1)))]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-02 finished in 547 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 268/268 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 305 transition count 256
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 305 transition count 256
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 304 transition count 255
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 304 transition count 255
Applied a total of 26 rules in 11 ms. Remains 304 /317 variables (removed 13) and now considering 255/268 (removed 13) transitions.
// Phase 1: matrix 255 rows 304 cols
[2024-05-21 23:30:40] [INFO ] Computed 61 invariants in 2 ms
[2024-05-21 23:30:40] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-21 23:30:40] [INFO ] Invariant cache hit.
[2024-05-21 23:30:40] [INFO ] Implicit Places using invariants and state equation in 206 ms returned [69, 70]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 337 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 302/317 places, 255/268 transitions.
Applied a total of 0 rules in 4 ms. Remains 302 /302 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 352 ms. Remains : 302/317 places, 255/268 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-03
Product exploration explored 100000 steps with 2047 reset in 366 ms.
Stack based approach found an accepted trace after 1137 steps with 26 reset with depth 5 and stack size 5 in 4 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-03 finished in 808 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X((p0 U (X(!p0)||G(p0))))))))'
Support contains 1 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 268/268 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 304 transition count 255
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 304 transition count 255
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 303 transition count 254
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 303 transition count 254
Applied a total of 28 rules in 11 ms. Remains 303 /317 variables (removed 14) and now considering 254/268 (removed 14) transitions.
// Phase 1: matrix 254 rows 303 cols
[2024-05-21 23:30:40] [INFO ] Computed 61 invariants in 11 ms
[2024-05-21 23:30:41] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-21 23:30:41] [INFO ] Invariant cache hit.
[2024-05-21 23:30:41] [INFO ] Implicit Places using invariants and state equation in 238 ms returned [69, 70]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 470 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/317 places, 254/268 transitions.
Applied a total of 0 rules in 4 ms. Remains 301 /301 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 486 ms. Remains : 301/317 places, 254/268 transitions.
Stuttering acceptance computed with spot in 120 ms :[false, false, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-04
Product exploration explored 100000 steps with 33333 reset in 130 ms.
Product exploration explored 100000 steps with 33333 reset in 125 ms.
Computed a total of 184 stabilizing places and 164 stable transitions
Graph (complete) has 661 edges and 301 vertex of which 300 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 184 stabilizing places and 164 stable transitions
Detected a total of 184/301 stabilizing places and 164/254 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 45 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-07-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-07-LTLFireability-04 finished in 955 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 U p1)||F((G(p2)||(p2&&F(!p1)))))))))'
Support contains 7 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 268/268 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 305 transition count 256
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 305 transition count 256
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 304 transition count 255
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 304 transition count 255
Applied a total of 26 rules in 13 ms. Remains 304 /317 variables (removed 13) and now considering 255/268 (removed 13) transitions.
// Phase 1: matrix 255 rows 304 cols
[2024-05-21 23:30:41] [INFO ] Computed 61 invariants in 3 ms
[2024-05-21 23:30:42] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-21 23:30:42] [INFO ] Invariant cache hit.
[2024-05-21 23:30:42] [INFO ] Implicit Places using invariants and state equation in 224 ms returned [69, 70]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 404 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 302/317 places, 255/268 transitions.
Applied a total of 0 rules in 3 ms. Remains 302 /302 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 420 ms. Remains : 302/317 places, 255/268 transitions.
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-05
Product exploration explored 100000 steps with 2719 reset in 344 ms.
Stack based approach found an accepted trace after 48874 steps with 1281 reset with depth 23 and stack size 23 in 136 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-05 finished in 1096 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(p0)||G(p1))))'
Support contains 2 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 268/268 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 304 transition count 255
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 304 transition count 255
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 303 transition count 254
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 303 transition count 254
Applied a total of 28 rules in 19 ms. Remains 303 /317 variables (removed 14) and now considering 254/268 (removed 14) transitions.
// Phase 1: matrix 254 rows 303 cols
[2024-05-21 23:30:42] [INFO ] Computed 61 invariants in 3 ms
[2024-05-21 23:30:43] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-21 23:30:43] [INFO ] Invariant cache hit.
[2024-05-21 23:30:43] [INFO ] Implicit Places using invariants and state equation in 244 ms returned [69, 70]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 396 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/317 places, 254/268 transitions.
Applied a total of 0 rules in 3 ms. Remains 301 /301 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 418 ms. Remains : 301/317 places, 254/268 transitions.
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-06
Product exploration explored 100000 steps with 33333 reset in 95 ms.
Product exploration explored 100000 steps with 33333 reset in 185 ms.
Computed a total of 184 stabilizing places and 164 stable transitions
Graph (complete) has 661 edges and 301 vertex of which 300 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 184 stabilizing places and 164 stable transitions
Detected a total of 184/301 stabilizing places and 164/254 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 13 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-07-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-07-LTLFireability-06 finished in 893 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(F(p0))))'
Support contains 1 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 268/268 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 305 transition count 256
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 305 transition count 256
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 304 transition count 255
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 304 transition count 255
Applied a total of 26 rules in 18 ms. Remains 304 /317 variables (removed 13) and now considering 255/268 (removed 13) transitions.
// Phase 1: matrix 255 rows 304 cols
[2024-05-21 23:30:43] [INFO ] Computed 61 invariants in 2 ms
[2024-05-21 23:30:43] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-21 23:30:43] [INFO ] Invariant cache hit.
[2024-05-21 23:30:44] [INFO ] Implicit Places using invariants and state equation in 261 ms returned [69, 70]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 426 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 302/317 places, 255/268 transitions.
Applied a total of 0 rules in 4 ms. Remains 302 /302 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 448 ms. Remains : 302/317 places, 255/268 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-07
Stuttering criterion allowed to conclude after 90 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-07 finished in 544 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 268/268 transitions.
Graph (trivial) has 147 edges and 317 vertex of which 6 / 317 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 684 edges and 312 vertex of which 311 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 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 310 transition count 224
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 74 place count 274 transition count 224
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 62 Pre rules applied. Total rules applied 74 place count 274 transition count 162
Deduced a syphon composed of 62 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 133 rules applied. Total rules applied 207 place count 203 transition count 162
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 217 place count 193 transition count 152
Iterating global reduction 2 with 10 rules applied. Total rules applied 227 place count 193 transition count 152
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 227 place count 193 transition count 150
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 231 place count 191 transition count 150
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 145 rules applied. Total rules applied 376 place count 117 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 378 place count 116 transition count 82
Applied a total of 378 rules in 33 ms. Remains 116 /317 variables (removed 201) and now considering 82/268 (removed 186) transitions.
// Phase 1: matrix 82 rows 116 cols
[2024-05-21 23:30:44] [INFO ] Computed 49 invariants in 1 ms
[2024-05-21 23:30:44] [INFO ] Implicit Places using invariants in 87 ms returned [1, 2, 10, 35, 36, 37, 38, 39, 40, 41]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 88 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/317 places, 82/268 transitions.
Applied a total of 0 rules in 6 ms. Remains 106 /106 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 127 ms. Remains : 106/317 places, 82/268 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-08
Stuttering criterion allowed to conclude after 107 steps with 21 reset in 1 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-08 finished in 163 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))))'
Support contains 1 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 268/268 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 304 transition count 255
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 304 transition count 255
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 303 transition count 254
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 303 transition count 254
Applied a total of 28 rules in 8 ms. Remains 303 /317 variables (removed 14) and now considering 254/268 (removed 14) transitions.
// Phase 1: matrix 254 rows 303 cols
[2024-05-21 23:30:44] [INFO ] Computed 61 invariants in 2 ms
[2024-05-21 23:30:44] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-21 23:30:44] [INFO ] Invariant cache hit.
[2024-05-21 23:30:44] [INFO ] Implicit Places using invariants and state equation in 239 ms returned [69, 70]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 352 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/317 places, 254/268 transitions.
Applied a total of 0 rules in 2 ms. Remains 301 /301 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 364 ms. Remains : 301/317 places, 254/268 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-09
Entered a terminal (fully accepting) state of product in 76 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-09 finished in 460 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||F(p1)))||G(p2))))'
Support contains 7 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 268/268 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 305 transition count 256
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 305 transition count 256
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 304 transition count 255
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 304 transition count 255
Applied a total of 26 rules in 9 ms. Remains 304 /317 variables (removed 13) and now considering 255/268 (removed 13) transitions.
// Phase 1: matrix 255 rows 304 cols
[2024-05-21 23:30:44] [INFO ] Computed 61 invariants in 1 ms
[2024-05-21 23:30:45] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-21 23:30:45] [INFO ] Invariant cache hit.
[2024-05-21 23:30:45] [INFO ] Implicit Places using invariants and state equation in 206 ms returned [69, 70]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 311 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 302/317 places, 255/268 transitions.
Applied a total of 0 rules in 4 ms. Remains 302 /302 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 325 ms. Remains : 302/317 places, 255/268 transitions.
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-12
Product exploration explored 100000 steps with 1087 reset in 201 ms.
Product exploration explored 100000 steps with 1070 reset in 255 ms.
Computed a total of 185 stabilizing places and 165 stable transitions
Graph (complete) has 662 edges and 302 vertex of which 301 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 185 stabilizing places and 165 stable transitions
Detected a total of 185/302 stabilizing places and 165/255 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 365 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) p0)]
RANDOM walk for 40000 steps (436 resets) in 494 ms. (80 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40004 steps (57 resets) in 178 ms. (223 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (56 resets) in 109 ms. (363 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (56 resets) in 140 ms. (283 steps per ms) remains 2/2 properties
// Phase 1: matrix 255 rows 302 cols
[2024-05-21 23:30:46] [INFO ] Computed 59 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 92/99 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 110/209 variables, 26/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 82/291 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 8/299 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 253/552 variables, 299/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/557 variables, 3/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/557 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/557 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 361 constraints, problems are : Problem set: 0 solved, 2 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 302/302 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf3 is UNSAT
Problem apf6 is UNSAT
After SMT solving in domain Int declared 99/557 variables, and 6 constraints, problems are : Problem set: 2 solved, 0 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 6/32 constraints, Generalized P Invariants (flows): 0/27 constraints, State Equation: 0/302 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 260ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p2 p0 p1)), (G (OR p2 (NOT p0) p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p0 p1))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F (NOT p1))]
Knowledge based reduction with 18 factoid took 884 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 7 out of 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 255/255 transitions.
Graph (complete) has 662 edges and 302 vertex of which 301 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 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 300 transition count 228
Reduce places removed 25 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 27 rules applied. Total rules applied 53 place count 275 transition count 226
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 55 place count 273 transition count 226
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 55 place count 273 transition count 163
Deduced a syphon composed of 63 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 189 place count 202 transition count 163
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 155 rules applied. Total rules applied 344 place count 123 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 345 place count 123 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 347 place count 122 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 348 place count 121 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 349 place count 120 transition count 88
Applied a total of 349 rules in 34 ms. Remains 120 /302 variables (removed 182) and now considering 88/255 (removed 167) transitions.
// Phase 1: matrix 88 rows 120 cols
[2024-05-21 23:30:48] [INFO ] Computed 47 invariants in 1 ms
[2024-05-21 23:30:48] [INFO ] Implicit Places using invariants in 87 ms returned [38, 39, 40, 41]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 88 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 116/302 places, 88/255 transitions.
Applied a total of 0 rules in 3 ms. Remains 116 /116 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 125 ms. Remains : 116/302 places, 88/255 transitions.
Computed a total of 71 stabilizing places and 61 stable transitions
Computed a total of 71 stabilizing places and 61 stable transitions
Detected a total of 71/116 stabilizing places and 61/88 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 11 factoid took 613 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (3655 resets) in 181 ms. (219 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (821 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
// Phase 1: matrix 88 rows 116 cols
[2024-05-21 23:30:49] [INFO ] Computed 43 invariants in 1 ms
[2024-05-21 23:30:49] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/56 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 35/91 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/95 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/95 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 88/183 variables, 95/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 4/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 21/204 variables, 21/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/204 variables, 10/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/204 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/204 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 163 constraints, problems are : Problem set: 0 solved, 1 unsolved in 97 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 116/116 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 46/204 variables, and 6 constraints, problems are : Problem set: 1 solved, 0 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 6/27 constraints, Generalized P Invariants (flows): 0/16 constraints, State Equation: 0/116 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 129ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 p2 p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 12 factoid took 1090 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 9077 reset in 207 ms.
Product exploration explored 100000 steps with 9081 reset in 228 ms.
Built C files in :
/tmp/ltsmin6040418621559109825
[2024-05-21 23:30:51] [INFO ] Computing symmetric may disable matrix : 88 transitions.
[2024-05-21 23:30:51] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:30:51] [INFO ] Computing symmetric may enable matrix : 88 transitions.
[2024-05-21 23:30:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:30:51] [INFO ] Computing Do-Not-Accords matrix : 88 transitions.
[2024-05-21 23:30:51] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:30:51] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6040418621559109825
Running compilation step : cd /tmp/ltsmin6040418621559109825;'/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 471 ms.
Running link step : cd /tmp/ltsmin6040418621559109825;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin6040418621559109825;'/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/stateBased11226129878061198340.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 88/88 transitions.
Applied a total of 0 rules in 3 ms. Remains 116 /116 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-05-21 23:31:06] [INFO ] Invariant cache hit.
[2024-05-21 23:31:06] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-21 23:31:06] [INFO ] Invariant cache hit.
[2024-05-21 23:31:06] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 23:31:06] [INFO ] Implicit Places using invariants and state equation in 106 ms returned [15, 27, 29, 31, 66, 72, 74, 100, 102, 104, 108]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 168 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/116 places, 88/88 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 105 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 104 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 103 transition count 86
Applied a total of 4 rules in 6 ms. Remains 103 /105 variables (removed 2) and now considering 86/88 (removed 2) transitions.
// Phase 1: matrix 86 rows 103 cols
[2024-05-21 23:31:06] [INFO ] Computed 32 invariants in 1 ms
[2024-05-21 23:31:06] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-21 23:31:06] [INFO ] Invariant cache hit.
[2024-05-21 23:31:06] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 23:31:06] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 103/116 places, 86/88 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 353 ms. Remains : 103/116 places, 86/88 transitions.
Built C files in :
/tmp/ltsmin13769920755955926068
[2024-05-21 23:31:06] [INFO ] Computing symmetric may disable matrix : 86 transitions.
[2024-05-21 23:31:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:31:06] [INFO ] Computing symmetric may enable matrix : 86 transitions.
[2024-05-21 23:31:06] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:31:06] [INFO ] Computing Do-Not-Accords matrix : 86 transitions.
[2024-05-21 23:31:06] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:31:06] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13769920755955926068
Running compilation step : cd /tmp/ltsmin13769920755955926068;'/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 201 ms.
Running link step : cd /tmp/ltsmin13769920755955926068;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin13769920755955926068;'/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/stateBased6764903690728869765.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 23:31:21] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:31:21] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:31:21] [INFO ] Time to serialize gal into /tmp/LTL8511867411325224614.gal : 2 ms
[2024-05-21 23:31:21] [INFO ] Time to serialize properties into /tmp/LTL2868398559672757658.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8511867411325224614.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16637773874195682182.hoa' '-atoms' '/tmp/LTL2868398559672757658.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2868398559672757658.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16637773874195682182.hoa
Reverse transition relation is NOT exact ! Due to transitions t78, t158.t160.t161.t2.t162, t155.t156.t3.t162, t152.t153.t4.t162, t148.t149.t5.t162, t138.t1...888
Computing Next relation with stutter on 141120 deadlock states
6 unique states visited
0 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
1013 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.1696,357244,1,0,695,1.64091e+06,197,610,3693,2.34043e+06,1119
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-07-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property BusinessProcesses-PT-07-LTLFireability-12 finished in 49422 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 2 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 268/268 transitions.
Graph (trivial) has 145 edges and 317 vertex of which 6 / 317 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 684 edges and 312 vertex of which 311 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 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 37 place count 310 transition count 225
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 72 place count 275 transition count 225
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 72 place count 275 transition count 162
Deduced a syphon composed of 63 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 135 rules applied. Total rules applied 207 place count 203 transition count 162
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 216 place count 194 transition count 153
Iterating global reduction 2 with 9 rules applied. Total rules applied 225 place count 194 transition count 153
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 225 place count 194 transition count 151
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 229 place count 192 transition count 151
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 143 rules applied. Total rules applied 372 place count 119 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 374 place count 118 transition count 84
Applied a total of 374 rules in 37 ms. Remains 118 /317 variables (removed 199) and now considering 84/268 (removed 184) transitions.
// Phase 1: matrix 84 rows 118 cols
[2024-05-21 23:31:34] [INFO ] Computed 49 invariants in 1 ms
[2024-05-21 23:31:34] [INFO ] Implicit Places using invariants in 106 ms returned [1, 2, 10, 35, 36, 37, 38, 39, 40, 41]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 107 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/317 places, 84/268 transitions.
Applied a total of 0 rules in 3 ms. Remains 108 /108 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 148 ms. Remains : 108/317 places, 84/268 transitions.
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-13
Product exploration explored 100000 steps with 20522 reset in 184 ms.
Product exploration explored 100000 steps with 20449 reset in 228 ms.
Computed a total of 68 stabilizing places and 58 stable transitions
Computed a total of 68 stabilizing places and 58 stable transitions
Detected a total of 68/108 stabilizing places and 58/84 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 166 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 3665 steps (757 resets) in 73 ms. (49 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 229 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 84/84 transitions.
Applied a total of 0 rules in 4 ms. Remains 108 /108 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 108 cols
[2024-05-21 23:31:35] [INFO ] Computed 39 invariants in 1 ms
[2024-05-21 23:31:35] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-21 23:31:35] [INFO ] Invariant cache hit.
[2024-05-21 23:31:36] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 23:31:36] [INFO ] Implicit Places using invariants and state equation in 137 ms returned [10, 11, 12, 14, 26, 28, 30, 33, 55, 57, 63, 65, 92, 94, 96, 100]
Discarding 16 places :
Implicit Place search using SMT with State Equation took 222 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/108 places, 84/84 transitions.
Graph (complete) has 302 edges and 92 vertex of which 83 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 83 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 82 transition count 79
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 9 place count 79 transition count 76
Applied a total of 9 rules in 5 ms. Remains 79 /92 variables (removed 13) and now considering 76/84 (removed 8) transitions.
// Phase 1: matrix 76 rows 79 cols
[2024-05-21 23:31:36] [INFO ] Computed 21 invariants in 1 ms
[2024-05-21 23:31:36] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 23:31:36] [INFO ] Invariant cache hit.
[2024-05-21 23:31:36] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 23:31:36] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 79/108 places, 76/84 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 392 ms. Remains : 79/108 places, 76/84 transitions.
Computed a total of 39 stabilizing places and 50 stable transitions
Computed a total of 39 stabilizing places and 50 stable transitions
Detected a total of 39/79 stabilizing places and 50/76 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 181 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 4657 steps (990 resets) in 15 ms. (291 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 269 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 20773 reset in 154 ms.
Product exploration explored 100000 steps with 20865 reset in 165 ms.
Built C files in :
/tmp/ltsmin9710740706206148538
[2024-05-21 23:31:37] [INFO ] Computing symmetric may disable matrix : 76 transitions.
[2024-05-21 23:31:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:31:37] [INFO ] Computing symmetric may enable matrix : 76 transitions.
[2024-05-21 23:31:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:31:37] [INFO ] Computing Do-Not-Accords matrix : 76 transitions.
[2024-05-21 23:31:37] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:31:37] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9710740706206148538
Running compilation step : cd /tmp/ltsmin9710740706206148538;'/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 291 ms.
Running link step : cd /tmp/ltsmin9710740706206148538;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin9710740706206148538;'/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/stateBased11884327324647393546.hoa' '--buchi-type=spotba'
LTSmin run took 5164 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-07-LTLFireability-13 finished in 8748 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)||G((F(p0)||(F(p1) U p2)))))))'
Support contains 5 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 268/268 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 304 transition count 255
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 304 transition count 255
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 303 transition count 254
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 303 transition count 254
Applied a total of 28 rules in 12 ms. Remains 303 /317 variables (removed 14) and now considering 254/268 (removed 14) transitions.
// Phase 1: matrix 254 rows 303 cols
[2024-05-21 23:31:43] [INFO ] Computed 61 invariants in 4 ms
[2024-05-21 23:31:43] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-21 23:31:43] [INFO ] Invariant cache hit.
[2024-05-21 23:31:43] [INFO ] Implicit Places using invariants and state equation in 208 ms returned [69, 70]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 350 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/317 places, 254/268 transitions.
Applied a total of 0 rules in 3 ms. Remains 301 /301 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 365 ms. Remains : 301/317 places, 254/268 transitions.
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-14
Stuttering criterion allowed to conclude after 82 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-14 finished in 506 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(F(p0))&&G(p1)))))'
Support contains 2 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 268/268 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 306 transition count 257
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 306 transition count 257
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 305 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 305 transition count 256
Applied a total of 24 rules in 7 ms. Remains 305 /317 variables (removed 12) and now considering 256/268 (removed 12) transitions.
// Phase 1: matrix 256 rows 305 cols
[2024-05-21 23:31:43] [INFO ] Computed 61 invariants in 3 ms
[2024-05-21 23:31:43] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-21 23:31:43] [INFO ] Invariant cache hit.
[2024-05-21 23:31:43] [INFO ] Implicit Places using invariants and state equation in 201 ms returned [69, 70]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 302 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 303/317 places, 256/268 transitions.
Applied a total of 0 rules in 6 ms. Remains 303 /303 variables (removed 0) and now considering 256/256 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 316 ms. Remains : 303/317 places, 256/268 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-15 finished in 482 ms.
All properties solved by simple procedures.
Total runtime 102642 ms.

BK_STOP 1716334304164

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

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