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.r472-tajo-171620399800563.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 ltsminxred
Input is BusinessProcesses-PT-15, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399800563
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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.9K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 11 16:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 211K Apr 11 16:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 16:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 11 16:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 157K 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-15-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-15-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717225901595

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:11:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:11:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:11:43] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2024-06-01 07:11:43] [INFO ] Transformed 630 places.
[2024-06-01 07:11:43] [INFO ] Transformed 566 transitions.
[2024-06-01 07:11:43] [INFO ] Found NUPN structural information;
[2024-06-01 07:11:43] [INFO ] Parsed PT model containing 630 places and 566 transitions and 1666 arcs in 251 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Deduced a syphon composed of 4 places in 13 ms
Reduce places removed 4 places and 4 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-15-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 562/562 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 623 transition count 562
Discarding 88 places :
Symmetric choice reduction at 1 with 88 rule applications. Total rules 91 place count 535 transition count 474
Iterating global reduction 1 with 88 rules applied. Total rules applied 179 place count 535 transition count 474
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 221 place count 493 transition count 432
Iterating global reduction 1 with 42 rules applied. Total rules applied 263 place count 493 transition count 432
Applied a total of 263 rules in 135 ms. Remains 493 /626 variables (removed 133) and now considering 432/562 (removed 130) transitions.
// Phase 1: matrix 432 rows 493 cols
[2024-06-01 07:11:43] [INFO ] Computed 99 invariants in 28 ms
[2024-06-01 07:11:43] [INFO ] Implicit Places using invariants in 359 ms returned []
[2024-06-01 07:11:43] [INFO ] Invariant cache hit.
[2024-06-01 07:11:44] [INFO ] Implicit Places using invariants and state equation in 581 ms returned []
Implicit Place search using SMT with State Equation took 970 ms to find 0 implicit places.
Running 431 sub problems to find dead transitions.
[2024-06-01 07:11:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/492 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/492 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (OVERLAPS) 1/493 variables, 58/97 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/493 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 98 places in 134 ms of which 22 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 97 places in 103 ms of which 6 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 112 places in 260 ms of which 12 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 97 places in 380 ms of which 15 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 96 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:11:55] [INFO ] Deduced a trap composed of 94 places in 173 ms of which 2 ms to minimize.
[2024-06-01 07:11:56] [INFO ] Deduced a trap composed of 95 places in 156 ms of which 16 ms to minimize.
[2024-06-01 07:11:56] [INFO ] Deduced a trap composed of 91 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:11:56] [INFO ] Deduced a trap composed of 72 places in 180 ms of which 4 ms to minimize.
[2024-06-01 07:11:56] [INFO ] Deduced a trap composed of 72 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:11:56] [INFO ] Deduced a trap composed of 94 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:11:57] [INFO ] Deduced a trap composed of 91 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:11:57] [INFO ] Deduced a trap composed of 79 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:11:57] [INFO ] Deduced a trap composed of 96 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:11:57] [INFO ] Deduced a trap composed of 98 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:11:57] [INFO ] Deduced a trap composed of 73 places in 162 ms of which 5 ms to minimize.
[2024-06-01 07:11:57] [INFO ] Deduced a trap composed of 94 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:11:57] [INFO ] Deduced a trap composed of 96 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:11:58] [INFO ] Deduced a trap composed of 102 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:11:58] [INFO ] Deduced a trap composed of 122 places in 113 ms of which 3 ms to minimize.
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/493 variables, 20/119 constraints. Problems are: Problem set: 8 solved, 423 unsolved
[2024-06-01 07:11:58] [INFO ] Deduced a trap composed of 93 places in 149 ms of which 2 ms to minimize.
[2024-06-01 07:11:58] [INFO ] Deduced a trap composed of 101 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:11:58] [INFO ] Deduced a trap composed of 100 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:11:58] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:11:59] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:11:59] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:11:59] [INFO ] Deduced a trap composed of 88 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:11:59] [INFO ] Deduced a trap composed of 89 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:11:59] [INFO ] Deduced a trap composed of 95 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:11:59] [INFO ] Deduced a trap composed of 91 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:11:59] [INFO ] Deduced a trap composed of 93 places in 158 ms of which 2 ms to minimize.
[2024-06-01 07:11:59] [INFO ] Deduced a trap composed of 89 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 88 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 94 places in 145 ms of which 5 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 96 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 88 places in 155 ms of which 2 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 89 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 89 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 2 ms to minimize.
Problem TDEAD383 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD405 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 20/139 constraints. Problems are: Problem set: 11 solved, 420 unsolved
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 99 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 95 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 89 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 103 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 100 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 71 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 99 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 98 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 93 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 99 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 98 places in 157 ms of which 3 ms to minimize.
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 20/159 constraints. Problems are: Problem set: 13 solved, 418 unsolved
[2024-06-01 07:12:07] [INFO ] Deduced a trap composed of 98 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:12:07] [INFO ] Deduced a trap composed of 98 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:12:07] [INFO ] Deduced a trap composed of 98 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:12:07] [INFO ] Deduced a trap composed of 96 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:12:07] [INFO ] Deduced a trap composed of 95 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:12:08] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:12:08] [INFO ] Deduced a trap composed of 98 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:12:08] [INFO ] Deduced a trap composed of 102 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:12:08] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:12:08] [INFO ] Deduced a trap composed of 99 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:12:08] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:12:08] [INFO ] Deduced a trap composed of 76 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:12:09] [INFO ] Deduced a trap composed of 93 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:12:09] [INFO ] Deduced a trap composed of 102 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:12:09] [INFO ] Deduced a trap composed of 95 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:12:09] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:12:09] [INFO ] Deduced a trap composed of 93 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:12:09] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:12:09] [INFO ] Deduced a trap composed of 79 places in 168 ms of which 3 ms to minimize.
[2024-06-01 07:12:10] [INFO ] Deduced a trap composed of 75 places in 136 ms of which 3 ms to minimize.
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD402 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/493 variables, 20/179 constraints. Problems are: Problem set: 25 solved, 406 unsolved
[2024-06-01 07:12:10] [INFO ] Deduced a trap composed of 96 places in 159 ms of which 2 ms to minimize.
[2024-06-01 07:12:10] [INFO ] Deduced a trap composed of 87 places in 153 ms of which 2 ms to minimize.
[2024-06-01 07:12:11] [INFO ] Deduced a trap composed of 93 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:12:11] [INFO ] Deduced a trap composed of 90 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:12:11] [INFO ] Deduced a trap composed of 95 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:12:11] [INFO ] Deduced a trap composed of 89 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:12:11] [INFO ] Deduced a trap composed of 87 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:12:11] [INFO ] Deduced a trap composed of 91 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:12:11] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:12:11] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 92 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 96 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 93 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 93 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 92 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 97 places in 136 ms of which 4 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 94 places in 133 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/493 variables, 20/199 constraints. Problems are: Problem set: 25 solved, 406 unsolved
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 95 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 96 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 96 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 92 places in 128 ms of which 3 ms to minimize.
SMT process timed out in 30269ms, After SMT, problems are : Problem set: 25 solved, 406 unsolved
Search for dead transitions found 25 dead transitions in 30288ms
Found 25 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 25 transitions
Dead transitions reduction (with SMT) removed 25 transitions
Starting structural reductions in LTL mode, iteration 1 : 493/626 places, 407/562 transitions.
Applied a total of 0 rules in 22 ms. Remains 493 /493 variables (removed 0) and now considering 407/407 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31443 ms. Remains : 493/626 places, 407/562 transitions.
Support contains 23 out of 493 places after structural reductions.
[2024-06-01 07:12:15] [INFO ] Flatten gal took : 72 ms
[2024-06-01 07:12:15] [INFO ] Flatten gal took : 33 ms
[2024-06-01 07:12:15] [INFO ] Input system was already deterministic with 407 transitions.
Reduction of identical properties reduced properties to check from 14 to 13
RANDOM walk for 40000 steps (264 resets) in 2302 ms. (17 steps per ms) remains 7/13 properties
BEST_FIRST walk for 40004 steps (47 resets) in 151 ms. (263 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (51 resets) in 104 ms. (380 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (49 resets) in 138 ms. (287 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (45 resets) in 130 ms. (305 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (46 resets) in 155 ms. (256 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (47 resets) in 123 ms. (322 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (43 resets) in 90 ms. (439 steps per ms) remains 7/7 properties
// Phase 1: matrix 407 rows 493 cols
[2024-06-01 07:12:16] [INFO ] Computed 99 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 161/174 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 191/365 variables, 50/58 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 118/483 variables, 39/97 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 4/487 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/487 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 403/890 variables, 487/586 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 07:12:16] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:12:16] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 4 ms to minimize.
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 86 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 57 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 67 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/890 variables, 20/606 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 96 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 52 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 101 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 96 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 92 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 90 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 56 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:12:21] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:12:21] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:12:21] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 2 ms to minimize.
SMT process timed out in 5041ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 13 out of 493 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 493/493 places, 407/407 transitions.
Graph (trivial) has 214 edges and 493 vertex of which 6 / 493 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1059 edges and 488 vertex of which 487 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 49 place count 487 transition count 352
Reduce places removed 47 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 440 transition count 350
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 100 place count 438 transition count 350
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 97 Pre rules applied. Total rules applied 100 place count 438 transition count 253
Deduced a syphon composed of 97 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 212 rules applied. Total rules applied 312 place count 323 transition count 253
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 3 with 261 rules applied. Total rules applied 573 place count 191 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 575 place count 190 transition count 128
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 577 place count 190 transition count 126
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 579 place count 188 transition count 126
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 580 place count 187 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 581 place count 186 transition count 125
Applied a total of 581 rules in 115 ms. Remains 186 /493 variables (removed 307) and now considering 125/407 (removed 282) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 186/493 places, 125/407 transitions.
RANDOM walk for 40000 steps (841 resets) in 1152 ms. (34 steps per ms) remains 1/7 properties
BEST_FIRST walk for 229 steps (0 resets) in 9 ms. (22 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-15-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 208 stabilizing places and 180 stable transitions
Graph (complete) has 1066 edges and 493 vertex of which 492 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 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)))'
Support contains 2 out of 493 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 493/493 places, 407/407 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 488 transition count 402
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 488 transition count 402
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 484 transition count 398
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 484 transition count 398
Applied a total of 18 rules in 44 ms. Remains 484 /493 variables (removed 9) and now considering 398/407 (removed 9) transitions.
// Phase 1: matrix 398 rows 484 cols
[2024-06-01 07:12:22] [INFO ] Computed 99 invariants in 14 ms
[2024-06-01 07:12:22] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-06-01 07:12:22] [INFO ] Invariant cache hit.
[2024-06-01 07:12:22] [INFO ] Implicit Places using invariants and state equation in 644 ms returned [85, 86, 87]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 902 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 481/493 places, 398/407 transitions.
Applied a total of 0 rules in 10 ms. Remains 481 /481 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 956 ms. Remains : 481/493 places, 398/407 transitions.
Stuttering acceptance computed with spot in 224 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 72 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-15-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLCardinality-00 finished in 1242 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(G(p1)))))'
Support contains 4 out of 493 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 493/493 places, 407/407 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 490 transition count 404
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 490 transition count 404
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 488 transition count 402
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 488 transition count 402
Applied a total of 10 rules in 35 ms. Remains 488 /493 variables (removed 5) and now considering 402/407 (removed 5) transitions.
// Phase 1: matrix 402 rows 488 cols
[2024-06-01 07:12:23] [INFO ] Computed 99 invariants in 7 ms
[2024-06-01 07:12:23] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-06-01 07:12:23] [INFO ] Invariant cache hit.
[2024-06-01 07:12:24] [INFO ] Implicit Places using invariants and state equation in 525 ms returned [87, 88, 89]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 750 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 485/493 places, 402/407 transitions.
Applied a total of 0 rules in 7 ms. Remains 485 /485 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 792 ms. Remains : 485/493 places, 402/407 transitions.
Stuttering acceptance computed with spot in 218 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-15-LTLCardinality-02
Stuttering criterion allowed to conclude after 136 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-15-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLCardinality-02 finished in 1036 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 2 out of 493 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 493/493 places, 407/407 transitions.
Graph (trivial) has 230 edges and 493 vertex of which 6 / 493 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 1060 edges and 488 vertex of which 487 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 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 486 transition count 347
Reduce places removed 52 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 434 transition count 345
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 110 place count 432 transition count 345
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 103 Pre rules applied. Total rules applied 110 place count 432 transition count 242
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 3 with 225 rules applied. Total rules applied 335 place count 310 transition count 242
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 340 place count 305 transition count 237
Iterating global reduction 3 with 5 rules applied. Total rules applied 345 place count 305 transition count 237
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 3 with 262 rules applied. Total rules applied 607 place count 172 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 609 place count 171 transition count 112
Applied a total of 609 rules in 64 ms. Remains 171 /493 variables (removed 322) and now considering 112/407 (removed 295) transitions.
// Phase 1: matrix 112 rows 171 cols
[2024-06-01 07:12:24] [INFO ] Computed 76 invariants in 2 ms
[2024-06-01 07:12:24] [INFO ] Implicit Places using invariants in 117 ms returned [1, 2, 3, 4, 9, 10, 33, 34, 35, 36, 41, 42, 43, 47, 48, 49, 50, 51, 54, 55, 56, 145]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 120 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 149/493 places, 112/407 transitions.
Applied a total of 0 rules in 6 ms. Remains 149 /149 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 190 ms. Remains : 149/493 places, 112/407 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLCardinality-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-15-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLCardinality-03 finished in 238 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0&&G(p1))||(p0&&X(p2))))))'
Support contains 4 out of 493 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 493/493 places, 407/407 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 489 transition count 403
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 489 transition count 403
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 486 transition count 400
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 486 transition count 400
Applied a total of 14 rules in 22 ms. Remains 486 /493 variables (removed 7) and now considering 400/407 (removed 7) transitions.
// Phase 1: matrix 400 rows 486 cols
[2024-06-01 07:12:24] [INFO ] Computed 99 invariants in 5 ms
[2024-06-01 07:12:24] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-06-01 07:12:24] [INFO ] Invariant cache hit.
[2024-06-01 07:12:25] [INFO ] Implicit Places using invariants and state equation in 609 ms returned [85, 86, 87]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 809 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 483/493 places, 400/407 transitions.
Applied a total of 0 rules in 16 ms. Remains 483 /483 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 848 ms. Remains : 483/493 places, 400/407 transitions.
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : BusinessProcesses-PT-15-LTLCardinality-04
Stuttering criterion allowed to conclude after 139 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-15-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLCardinality-04 finished in 1094 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(G(p0)))))'
Support contains 2 out of 493 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 493/493 places, 407/407 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 489 transition count 403
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 489 transition count 403
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 485 transition count 399
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 485 transition count 399
Applied a total of 16 rules in 24 ms. Remains 485 /493 variables (removed 8) and now considering 399/407 (removed 8) transitions.
// Phase 1: matrix 399 rows 485 cols
[2024-06-01 07:12:25] [INFO ] Computed 99 invariants in 4 ms
[2024-06-01 07:12:25] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-06-01 07:12:25] [INFO ] Invariant cache hit.
[2024-06-01 07:12:26] [INFO ] Implicit Places using invariants and state equation in 452 ms returned [85, 86, 87]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 638 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 482/493 places, 399/407 transitions.
Applied a total of 0 rules in 8 ms. Remains 482 /482 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 672 ms. Remains : 482/493 places, 399/407 transitions.
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 62709 steps with 420 reset in 222 ms.
FORMULA BusinessProcesses-PT-15-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLCardinality-08 finished in 1057 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 493 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 493/493 places, 407/407 transitions.
Graph (trivial) has 231 edges and 493 vertex of which 6 / 493 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 1060 edges and 488 vertex of which 487 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 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 486 transition count 345
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 432 transition count 345
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 103 Pre rules applied. Total rules applied 110 place count 432 transition count 242
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 336 place count 309 transition count 242
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 341 place count 304 transition count 237
Iterating global reduction 2 with 5 rules applied. Total rules applied 346 place count 304 transition count 237
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 2 with 264 rules applied. Total rules applied 610 place count 170 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 612 place count 169 transition count 111
Applied a total of 612 rules in 46 ms. Remains 169 /493 variables (removed 324) and now considering 111/407 (removed 296) transitions.
// Phase 1: matrix 111 rows 169 cols
[2024-06-01 07:12:26] [INFO ] Computed 75 invariants in 3 ms
[2024-06-01 07:12:26] [INFO ] Implicit Places using invariants in 168 ms returned [1, 2, 3, 4, 5, 8, 9, 33, 34, 35, 36, 41, 42, 43, 47, 48, 49, 50, 51, 52, 53, 54]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 170 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 147/493 places, 111/407 transitions.
Applied a total of 0 rules in 5 ms. Remains 147 /147 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 223 ms. Remains : 147/493 places, 111/407 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLCardinality-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-15-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLCardinality-13 finished in 288 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)||X(F(p1))))'
Support contains 4 out of 493 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 493/493 places, 407/407 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 489 transition count 403
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 489 transition count 403
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 486 transition count 400
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 486 transition count 400
Applied a total of 14 rules in 23 ms. Remains 486 /493 variables (removed 7) and now considering 400/407 (removed 7) transitions.
// Phase 1: matrix 400 rows 486 cols
[2024-06-01 07:12:26] [INFO ] Computed 99 invariants in 5 ms
[2024-06-01 07:12:27] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-06-01 07:12:27] [INFO ] Invariant cache hit.
[2024-06-01 07:12:27] [INFO ] Implicit Places using invariants and state equation in 510 ms returned [85, 86, 87]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 715 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 483/493 places, 400/407 transitions.
Applied a total of 0 rules in 7 ms. Remains 483 /483 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 746 ms. Remains : 483/493 places, 400/407 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-15-LTLCardinality-14
Product exploration explored 100000 steps with 676 reset in 247 ms.
Product exploration explored 100000 steps with 673 reset in 321 ms.
Computed a total of 206 stabilizing places and 178 stable transitions
Graph (complete) has 1041 edges and 483 vertex of which 482 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 206 stabilizing places and 178 stable transitions
Detected a total of 206/483 stabilizing places and 178/400 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 188 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 40000 steps (265 resets) in 529 ms. (75 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (40 resets) in 298 ms. (133 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (48 resets) in 307 ms. (129 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (42 resets) in 131 ms. (303 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (47 resets) in 74 ms. (533 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (49 resets) in 61 ms. (645 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (42 resets) in 55 ms. (714 steps per ms) remains 3/6 properties
// Phase 1: matrix 400 rows 483 cols
[2024-06-01 07:12:29] [INFO ] Computed 96 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 127/131 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 223/354 variables, 52/58 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 112/466 variables, 34/92 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 0/92 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/477 variables, 4/96 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/477 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 396/873 variables, 477/573 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/873 variables, 0/573 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/882 variables, 5/578 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/882 variables, 0/578 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/883 variables, 1/579 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/883 variables, 0/579 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/883 variables, 0/579 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 883/883 variables, and 579 constraints, problems are : Problem set: 1 solved, 2 unsolved in 314 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 483/483 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 127/131 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 223/354 variables, 52/58 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 07:12:29] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:12:29] [INFO ] Deduced a trap composed of 80 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:12:29] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 9/67 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 0/67 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 112/466 variables, 34/101 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 1/102 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/466 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 11/477 variables, 4/106 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 0/106 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 396/873 variables, 477/583 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/873 variables, 2/585 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/873 variables, 5/590 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/873 variables, 0/590 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 9/882 variables, 5/595 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 87 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 42 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 69 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 74 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 81 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 51 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:12:33] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:12:33] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:12:33] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:12:33] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/882 variables, 13/608 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/882 variables, 0/608 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/883 variables, 1/609 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/883 variables, 0/609 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/883 variables, 0/609 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 883/883 variables, and 609 constraints, problems are : Problem set: 1 solved, 2 unsolved in 4183 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 483/483 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 28/28 constraints]
After SMT, in 4528ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 370 ms.
Support contains 4 out of 483 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 483/483 places, 400/400 transitions.
Graph (trivial) has 219 edges and 483 vertex of which 6 / 483 are part of one of the 1 SCC in 0 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 1034 edges and 478 vertex of which 477 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 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 477 transition count 343
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 428 transition count 343
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 100 place count 428 transition count 242
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 221 rules applied. Total rules applied 321 place count 308 transition count 242
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 2 with 265 rules applied. Total rules applied 586 place count 174 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 588 place count 173 transition count 115
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 590 place count 173 transition count 113
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 592 place count 171 transition count 113
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 593 place count 171 transition count 113
Applied a total of 593 rules in 84 ms. Remains 171 /483 variables (removed 312) and now considering 113/400 (removed 287) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 171/483 places, 113/400 transitions.
RANDOM walk for 162 steps (3 resets) in 7 ms. (20 steps per ms) remains 0/2 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p0)), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 443 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 307 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 329 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Support contains 4 out of 483 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 483/483 places, 400/400 transitions.
Graph (trivial) has 219 edges and 483 vertex of which 6 / 483 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1035 edges and 478 vertex of which 477 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 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 476 transition count 343
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 427 transition count 343
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 100 place count 427 transition count 242
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 221 rules applied. Total rules applied 321 place count 307 transition count 242
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 263 rules applied. Total rules applied 584 place count 174 transition count 112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 586 place count 173 transition count 116
Applied a total of 586 rules in 35 ms. Remains 173 /483 variables (removed 310) and now considering 116/400 (removed 284) transitions.
// Phase 1: matrix 116 rows 173 cols
[2024-06-01 07:12:35] [INFO ] Computed 74 invariants in 4 ms
[2024-06-01 07:12:35] [INFO ] Implicit Places using invariants in 160 ms returned [1, 2, 3, 4, 5, 6, 9, 10, 30, 31, 32, 33, 34, 41, 42, 43, 47, 48, 49, 50, 51, 52, 53, 54]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 163 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 149/483 places, 116/400 transitions.
Applied a total of 0 rules in 5 ms. Remains 149 /149 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 203 ms. Remains : 149/483 places, 116/400 transitions.
Computed a total of 34 stabilizing places and 26 stable transitions
Computed a total of 34 stabilizing places and 26 stable transitions
Detected a total of 34/149 stabilizing places and 26/116 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 180 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 307 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), false, false]
RANDOM walk for 40000 steps (7994 resets) in 773 ms. (51 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (2498 resets) in 62 ms. (634 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (2537 resets) in 58 ms. (678 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (2528 resets) in 85 ms. (465 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (2502 resets) in 58 ms. (678 steps per ms) remains 3/3 properties
// Phase 1: matrix 116 rows 149 cols
[2024-06-01 07:12:36] [INFO ] Computed 50 invariants in 4 ms
[2024-06-01 07:12:36] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf3 is UNSAT
At refinement iteration 1 (OVERLAPS) 45/49 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 66/115 variables, 33/36 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 25/140 variables, 10/46 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 7/147 variables, 4/50 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/50 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 115/262 variables, 147/197 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 5/202 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/262 variables, 0/202 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/264 variables, 2/204 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/264 variables, 0/204 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/264 variables, 0/204 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/265 variables, and 204 constraints, problems are : Problem set: 1 solved, 2 unsolved in 124 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 149/149 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 45/49 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 66/115 variables, 33/36 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 25/140 variables, 10/46 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 7/147 variables, 4/50 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/50 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 115/262 variables, 147/197 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 5/202 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/262 variables, 2/204 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/262 variables, 0/204 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/264 variables, 2/206 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/264 variables, 0/206 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/264 variables, 0/206 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/265 variables, and 206 constraints, problems are : Problem set: 1 solved, 2 unsolved in 181 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 149/149 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 314ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 65 ms.
Support contains 4 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 116/116 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 149 transition count 115
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 149 transition count 113
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 147 transition count 113
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 147 transition count 113
Applied a total of 6 rules in 11 ms. Remains 147 /149 variables (removed 2) and now considering 113/116 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 147/149 places, 113/116 transitions.
RANDOM walk for 148 steps (1 resets) in 4 ms. (29 steps per ms) remains 0/2 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p0)), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 15 factoid took 409 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 254 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 228 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 272 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Product exploration explored 100000 steps with 17782 reset in 219 ms.
Product exploration explored 100000 steps with 17900 reset in 240 ms.
Support contains 4 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 116/116 transitions.
Applied a total of 0 rules in 4 ms. Remains 149 /149 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2024-06-01 07:12:38] [INFO ] Invariant cache hit.
[2024-06-01 07:12:38] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-01 07:12:38] [INFO ] Invariant cache hit.
[2024-06-01 07:12:38] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:12:38] [INFO ] Implicit Places using invariants and state equation in 196 ms returned [3, 32, 34, 36, 38, 40, 42, 44, 51, 53, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 92, 94, 127, 129, 131, 133, 135, 141, 143]
Discarding 34 places :
Implicit Place search using SMT with State Equation took 325 ms to find 34 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/149 places, 116/116 transitions.
Graph (complete) has 316 edges and 115 vertex of which 106 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 106 transition count 101
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 95 transition count 101
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 93 transition count 98
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 93 transition count 98
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 93 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 29 place count 92 transition count 97
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 31 place count 90 transition count 95
Iterating global reduction 4 with 2 rules applied. Total rules applied 33 place count 90 transition count 95
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 49 place count 81 transition count 88
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 53 place count 79 transition count 86
Applied a total of 53 rules in 12 ms. Remains 79 /115 variables (removed 36) and now considering 86/116 (removed 30) transitions.
// Phase 1: matrix 86 rows 79 cols
[2024-06-01 07:12:38] [INFO ] Computed 11 invariants in 1 ms
[2024-06-01 07:12:38] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-01 07:12:38] [INFO ] Invariant cache hit.
[2024-06-01 07:12:38] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:12:38] [INFO ] Implicit Places using invariants and state equation in 88 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 135 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 78/149 places, 86/116 transitions.
Applied a total of 0 rules in 3 ms. Remains 78 /78 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 479 ms. Remains : 78/149 places, 86/116 transitions.
Treatment of property BusinessProcesses-PT-15-LTLCardinality-14 finished in 11998 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)||X(F(p1))))'
Found a Shortening insensitive property : BusinessProcesses-PT-15-LTLCardinality-14
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 493 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 493/493 places, 407/407 transitions.
Graph (trivial) has 226 edges and 493 vertex of which 6 / 493 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 1060 edges and 488 vertex of which 487 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 486 transition count 347
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 106 place count 434 transition count 347
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 106 place count 434 transition count 246
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 221 rules applied. Total rules applied 327 place count 314 transition count 246
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 331 place count 310 transition count 242
Iterating global reduction 2 with 4 rules applied. Total rules applied 335 place count 310 transition count 242
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 263 rules applied. Total rules applied 598 place count 177 transition count 112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 600 place count 176 transition count 116
Applied a total of 600 rules in 40 ms. Remains 176 /493 variables (removed 317) and now considering 116/407 (removed 291) transitions.
// Phase 1: matrix 116 rows 176 cols
[2024-06-01 07:12:39] [INFO ] Computed 77 invariants in 2 ms
[2024-06-01 07:12:39] [INFO ] Implicit Places using invariants in 106 ms returned [1, 2, 3, 4, 5, 6, 9, 10, 33, 34, 35, 36, 37, 44, 45, 46, 50, 51, 52, 53, 54, 55, 56, 57]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 107 ms to find 24 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 152/493 places, 116/407 transitions.
Applied a total of 0 rules in 4 ms. Remains 152 /152 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 151 ms. Remains : 152/493 places, 116/407 transitions.
Running random walk in product with property : BusinessProcesses-PT-15-LTLCardinality-14
Product exploration explored 100000 steps with 17768 reset in 174 ms.
Product exploration explored 100000 steps with 17811 reset in 194 ms.
Computed a total of 34 stabilizing places and 26 stable transitions
Computed a total of 34 stabilizing places and 26 stable transitions
Detected a total of 34/152 stabilizing places and 26/116 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 172 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 40000 steps (7917 resets) in 256 ms. (155 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (2532 resets) in 105 ms. (377 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (2558 resets) in 97 ms. (408 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (2501 resets) in 76 ms. (519 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (2538 resets) in 73 ms. (540 steps per ms) remains 3/3 properties
// Phase 1: matrix 116 rows 152 cols
[2024-06-01 07:12:40] [INFO ] Computed 53 invariants in 2 ms
[2024-06-01 07:12:40] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 51/55 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 64/119 variables, 32/37 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 30/149 variables, 15/52 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/52 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/150 variables, 1/53 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/53 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 115/265 variables, 150/203 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 5/208 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/208 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/267 variables, 2/210 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/267 variables, 0/210 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/267 variables, 0/210 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/268 variables, and 210 constraints, problems are : Problem set: 1 solved, 2 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 152/152 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 51/55 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 64/119 variables, 32/37 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 30/149 variables, 15/52 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/52 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/150 variables, 1/53 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/53 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 115/265 variables, 150/203 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 5/208 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 2/210 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 0/210 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/267 variables, 2/212 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/267 variables, 0/212 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/267 variables, 0/212 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 267/268 variables, and 212 constraints, problems are : Problem set: 1 solved, 2 unsolved in 171 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 152/152 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 319ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 39 ms.
Support contains 4 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 116/116 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 152 transition count 115
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 152 transition count 113
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 150 transition count 113
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 150 transition count 113
Applied a total of 6 rules in 15 ms. Remains 150 /152 variables (removed 2) and now considering 113/116 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 150/152 places, 113/116 transitions.
RANDOM walk for 159 steps (3 resets) in 5 ms. (26 steps per ms) remains 0/2 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p0)), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 393 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 236 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 242 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Support contains 4 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 116/116 transitions.
Applied a total of 0 rules in 4 ms. Remains 152 /152 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2024-06-01 07:12:41] [INFO ] Invariant cache hit.
[2024-06-01 07:12:41] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-01 07:12:41] [INFO ] Invariant cache hit.
[2024-06-01 07:12:41] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:12:41] [INFO ] Implicit Places using invariants and state equation in 183 ms returned [3, 4, 5, 6, 35, 37, 39, 41, 43, 45, 47, 54, 56, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 95, 97, 130, 132, 134, 136, 138, 144, 146]
Discarding 37 places :
Implicit Place search using SMT with State Equation took 282 ms to find 37 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/152 places, 116/116 transitions.
Graph (complete) has 316 edges and 115 vertex of which 106 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 106 transition count 101
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 95 transition count 101
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 93 transition count 98
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 93 transition count 98
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 93 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 29 place count 92 transition count 97
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 31 place count 90 transition count 95
Iterating global reduction 4 with 2 rules applied. Total rules applied 33 place count 90 transition count 95
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 49 place count 81 transition count 88
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 53 place count 79 transition count 86
Applied a total of 53 rules in 12 ms. Remains 79 /115 variables (removed 36) and now considering 86/116 (removed 30) transitions.
// Phase 1: matrix 86 rows 79 cols
[2024-06-01 07:12:41] [INFO ] Computed 11 invariants in 1 ms
[2024-06-01 07:12:41] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-01 07:12:41] [INFO ] Invariant cache hit.
[2024-06-01 07:12:42] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:12:42] [INFO ] Implicit Places using invariants and state equation in 102 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 156 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 78/152 places, 86/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 78 /78 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 456 ms. Remains : 78/152 places, 86/116 transitions.
Computed a total of 16 stabilizing places and 17 stable transitions
Computed a total of 16 stabilizing places and 17 stable transitions
Detected a total of 16/78 stabilizing places and 17/86 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 138 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 233 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), false, false]
RANDOM walk for 40000 steps (8001 resets) in 144 ms. (275 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (2582 resets) in 91 ms. (434 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40002 steps (2616 resets) in 53 ms. (740 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (2540 resets) in 44 ms. (888 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (2563 resets) in 40 ms. (975 steps per ms) remains 3/3 properties
// Phase 1: matrix 86 rows 78 cols
[2024-06-01 07:12:42] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 07:12:42] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 10/22 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 4/26 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 49/75 variables, 26/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/75 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf3 is UNSAT
At refinement iteration 10 (OVERLAPS) 65/140 variables, 39/76 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 1/77 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/140 variables, 2/79 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 0/79 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 17/157 variables, 9/88 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/157 variables, 0/88 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 4/161 variables, 3/91 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/161 variables, 0/91 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/163 variables, 1/92 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/163 variables, 0/92 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/163 variables, 0/92 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/164 variables, and 92 constraints, problems are : Problem set: 1 solved, 2 unsolved in 94 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 78/78 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/22 variables, 5/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/26 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 49/75 variables, 26/35 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 2/37 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/75 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 65/140 variables, 39/76 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 1/77 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/140 variables, 2/79 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 2/81 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/140 variables, 0/81 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 17/157 variables, 9/90 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/157 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 4/161 variables, 3/93 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/161 variables, 0/93 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/163 variables, 1/94 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/163 variables, 0/94 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/163 variables, 0/94 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/164 variables, and 94 constraints, problems are : Problem set: 1 solved, 2 unsolved in 125 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 78/78 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 223ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 46 ms.
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 86/86 transitions.
Graph (complete) has 213 edges and 78 vertex of which 76 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 76 transition count 83
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 76 transition count 81
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 8 place count 74 transition count 81
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 74 transition count 75
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 20 place count 68 transition count 75
Applied a total of 20 rules in 7 ms. Remains 68 /78 variables (removed 10) and now considering 75/86 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 68/78 places, 75/86 transitions.
RANDOM walk for 111 steps (4 resets) in 4 ms. (22 steps per ms) remains 0/2 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p0)), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 15 factoid took 401 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 241 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 228 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 243 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Product exploration explored 100000 steps with 18071 reset in 139 ms.
Product exploration explored 100000 steps with 18103 reset in 135 ms.
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 86/86 transitions.
Applied a total of 0 rules in 2 ms. Remains 78 /78 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2024-06-01 07:12:44] [INFO ] Invariant cache hit.
[2024-06-01 07:12:44] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-01 07:12:44] [INFO ] Invariant cache hit.
[2024-06-01 07:12:44] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 07:12:44] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2024-06-01 07:12:44] [INFO ] Redundant transitions in 1 ms returned []
Running 81 sub problems to find dead transitions.
[2024-06-01 07:12:44] [INFO ] Invariant cache hit.
[2024-06-01 07:12:44] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 81 unsolved
Problem TDEAD23 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
At refinement iteration 4 (OVERLAPS) 85/163 variables, 78/88 constraints. Problems are: Problem set: 11 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 4/92 constraints. Problems are: Problem set: 11 solved, 70 unsolved
[2024-06-01 07:12:45] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 2 ms to minimize.
[2024-06-01 07:12:45] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:12:45] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 3/95 constraints. Problems are: Problem set: 11 solved, 70 unsolved
[2024-06-01 07:12:45] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:12:45] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:12:45] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:12:45] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 4/99 constraints. Problems are: Problem set: 11 solved, 70 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/99 constraints. Problems are: Problem set: 11 solved, 70 unsolved
[2024-06-01 07:12:46] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/163 variables, 1/100 constraints. Problems are: Problem set: 11 solved, 70 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 0/100 constraints. Problems are: Problem set: 11 solved, 70 unsolved
At refinement iteration 11 (OVERLAPS) 0/163 variables, 0/100 constraints. Problems are: Problem set: 11 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/164 variables, and 100 constraints, problems are : Problem set: 11 solved, 70 unsolved in 2291 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 78/78 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 11 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 2/2 constraints. Problems are: Problem set: 11 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 8/10 constraints. Problems are: Problem set: 11 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/10 constraints. Problems are: Problem set: 11 solved, 70 unsolved
At refinement iteration 3 (OVERLAPS) 1/78 variables, 8/18 constraints. Problems are: Problem set: 11 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/18 constraints. Problems are: Problem set: 11 solved, 70 unsolved
At refinement iteration 5 (OVERLAPS) 85/163 variables, 78/96 constraints. Problems are: Problem set: 11 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 4/100 constraints. Problems are: Problem set: 11 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 70/170 constraints. Problems are: Problem set: 11 solved, 70 unsolved
[2024-06-01 07:12:47] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 1/171 constraints. Problems are: Problem set: 11 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 0/171 constraints. Problems are: Problem set: 11 solved, 70 unsolved
At refinement iteration 10 (OVERLAPS) 0/163 variables, 0/171 constraints. Problems are: Problem set: 11 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/164 variables, and 171 constraints, problems are : Problem set: 11 solved, 70 unsolved in 2393 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 78/78 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 70/81 constraints, Known Traps: 9/9 constraints]
After SMT, in 4723ms problems are : Problem set: 11 solved, 70 unsolved
Search for dead transitions found 11 dead transitions in 4725ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 78/78 places, 75/86 transitions.
Ensure Unique test removed 2 places
Applied a total of 0 rules in 2 ms. Remains 76 /78 variables (removed 2) and now considering 75/75 (removed 0) transitions.
[2024-06-01 07:12:49] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 4922 ms. Remains : 76/78 places, 75/86 transitions.
Treatment of property BusinessProcesses-PT-15-LTLCardinality-14 finished in 10378 ms.
[2024-06-01 07:12:49] [INFO ] Flatten gal took : 22 ms
[2024-06-01 07:12:49] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 07:12:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 493 places, 407 transitions and 1245 arcs took 5 ms.
Total runtime 66402 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA BusinessProcesses-PT-15-LTLCardinality-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717225969826

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name BusinessProcesses-PT-15-LTLCardinality-14
ltl formula formula --ltl=/tmp/1797/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 493 places, 407 transitions and 1245 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.110 real 0.010 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1797/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1797/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1797/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1797/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 495 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 494, there are 441 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~365!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 449
pnml2lts-mc( 0/ 4): unique states count: 1244
pnml2lts-mc( 0/ 4): unique transitions count: 9997
pnml2lts-mc( 0/ 4): - self-loop count: 30
pnml2lts-mc( 0/ 4): - claim dead count: 2197
pnml2lts-mc( 0/ 4): - claim found count: 76
pnml2lts-mc( 0/ 4): - claim success count: 1252
pnml2lts-mc( 0/ 4): - cum. max stack depth: 789
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1252 states 10016 transitions, fanout: 8.000
pnml2lts-mc( 0/ 4): Total exploration time 0.060 sec (0.060 sec minimum, 0.060 sec on average)
pnml2lts-mc( 0/ 4): States per second: 20867, Transitions per second: 166933
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 26.4 B/state, compr.: 1.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 410 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)

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-15"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BusinessProcesses-PT-15, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r472-tajo-171620399800563"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-15.tgz
mv BusinessProcesses-PT-15 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;