Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r512-smll-171654407000163.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PermAdmissibility-PT-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654407000163
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 11K Apr 12 09:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 12 09:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 52K Apr 12 09:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 268K Apr 12 09:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 12 09:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Apr 12 09:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113K Apr 12 09:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 575K Apr 12 09:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 336K May 18 16:43 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 PermAdmissibility-PT-02-LTLCardinality-00
FORMULA_NAME PermAdmissibility-PT-02-LTLCardinality-01
FORMULA_NAME PermAdmissibility-PT-02-LTLCardinality-02
FORMULA_NAME PermAdmissibility-PT-02-LTLCardinality-03
FORMULA_NAME PermAdmissibility-PT-02-LTLCardinality-04
FORMULA_NAME PermAdmissibility-PT-02-LTLCardinality-05
FORMULA_NAME PermAdmissibility-PT-02-LTLCardinality-06
FORMULA_NAME PermAdmissibility-PT-02-LTLCardinality-07
FORMULA_NAME PermAdmissibility-PT-02-LTLCardinality-08
FORMULA_NAME PermAdmissibility-PT-02-LTLCardinality-09
FORMULA_NAME PermAdmissibility-PT-02-LTLCardinality-10
FORMULA_NAME PermAdmissibility-PT-02-LTLCardinality-11
FORMULA_NAME PermAdmissibility-PT-02-LTLCardinality-12
FORMULA_NAME PermAdmissibility-PT-02-LTLCardinality-13
FORMULA_NAME PermAdmissibility-PT-02-LTLCardinality-14
FORMULA_NAME PermAdmissibility-PT-02-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717254233081

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-PT-02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:03:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 15:03:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:03:55] [INFO ] Load time of PNML (sax parser for PT used): 217 ms
[2024-06-01 15:03:55] [INFO ] Transformed 168 places.
[2024-06-01 15:03:55] [INFO ] Transformed 592 transitions.
[2024-06-01 15:03:55] [INFO ] Parsed PT model containing 168 places and 592 transitions and 3456 arcs in 548 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA PermAdmissibility-PT-02-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-02-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-02-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-02-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-02-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 78 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 130 transition count 592
Applied a total of 38 rules in 79 ms. Remains 130 /168 variables (removed 38) and now considering 592/592 (removed 0) transitions.
// Phase 1: matrix 592 rows 130 cols
[2024-06-01 15:03:56] [INFO ] Computed 19 invariants in 51 ms
[2024-06-01 15:03:56] [INFO ] Implicit Places using invariants in 569 ms returned []
[2024-06-01 15:03:56] [INFO ] Invariant cache hit.
[2024-06-01 15:03:57] [INFO ] Implicit Places using invariants and state equation in 937 ms returned []
Implicit Place search using SMT with State Equation took 1571 ms to find 0 implicit places.
Running 588 sub problems to find dead transitions.
[2024-06-01 15:03:57] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 2 (OVERLAPS) 25/128 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 15:04:04] [INFO ] Deduced a trap composed of 41 places in 302 ms of which 26 ms to minimize.
[2024-06-01 15:04:05] [INFO ] Deduced a trap composed of 22 places in 252 ms of which 4 ms to minimize.
[2024-06-01 15:04:05] [INFO ] Deduced a trap composed of 25 places in 210 ms of which 2 ms to minimize.
[2024-06-01 15:04:05] [INFO ] Deduced a trap composed of 27 places in 198 ms of which 2 ms to minimize.
[2024-06-01 15:04:05] [INFO ] Deduced a trap composed of 30 places in 211 ms of which 2 ms to minimize.
[2024-06-01 15:04:06] [INFO ] Deduced a trap composed of 26 places in 190 ms of which 2 ms to minimize.
[2024-06-01 15:04:06] [INFO ] Deduced a trap composed of 22 places in 179 ms of which 2 ms to minimize.
[2024-06-01 15:04:06] [INFO ] Deduced a trap composed of 22 places in 182 ms of which 2 ms to minimize.
[2024-06-01 15:04:06] [INFO ] Deduced a trap composed of 25 places in 193 ms of which 1 ms to minimize.
[2024-06-01 15:04:06] [INFO ] Deduced a trap composed of 22 places in 223 ms of which 3 ms to minimize.
[2024-06-01 15:04:07] [INFO ] Deduced a trap composed of 24 places in 281 ms of which 2 ms to minimize.
[2024-06-01 15:04:07] [INFO ] Deduced a trap composed of 23 places in 241 ms of which 3 ms to minimize.
[2024-06-01 15:04:07] [INFO ] Deduced a trap composed of 22 places in 291 ms of which 3 ms to minimize.
[2024-06-01 15:04:07] [INFO ] Deduced a trap composed of 36 places in 179 ms of which 2 ms to minimize.
[2024-06-01 15:04:08] [INFO ] Deduced a trap composed of 29 places in 157 ms of which 2 ms to minimize.
[2024-06-01 15:04:08] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 2 ms to minimize.
[2024-06-01 15:04:08] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 1 ms to minimize.
[2024-06-01 15:04:08] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 1 ms to minimize.
[2024-06-01 15:04:08] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 2 ms to minimize.
[2024-06-01 15:04:08] [INFO ] Deduced a trap composed of 40 places in 212 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 15:04:10] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 1 ms to minimize.
[2024-06-01 15:04:11] [INFO ] Deduced a trap composed of 27 places in 267 ms of which 3 ms to minimize.
[2024-06-01 15:04:11] [INFO ] Deduced a trap composed of 30 places in 176 ms of which 2 ms to minimize.
[2024-06-01 15:04:11] [INFO ] Deduced a trap composed of 30 places in 234 ms of which 2 ms to minimize.
[2024-06-01 15:04:11] [INFO ] Deduced a trap composed of 29 places in 232 ms of which 2 ms to minimize.
[2024-06-01 15:04:12] [INFO ] Deduced a trap composed of 23 places in 231 ms of which 2 ms to minimize.
[2024-06-01 15:04:12] [INFO ] Deduced a trap composed of 28 places in 292 ms of which 3 ms to minimize.
[2024-06-01 15:04:12] [INFO ] Deduced a trap composed of 25 places in 279 ms of which 3 ms to minimize.
[2024-06-01 15:04:12] [INFO ] Deduced a trap composed of 24 places in 228 ms of which 2 ms to minimize.
[2024-06-01 15:04:13] [INFO ] Deduced a trap composed of 24 places in 224 ms of which 3 ms to minimize.
[2024-06-01 15:04:13] [INFO ] Deduced a trap composed of 33 places in 140 ms of which 2 ms to minimize.
[2024-06-01 15:04:13] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 2 ms to minimize.
[2024-06-01 15:04:14] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 2 ms to minimize.
[2024-06-01 15:04:14] [INFO ] Deduced a trap composed of 20 places in 202 ms of which 2 ms to minimize.
[2024-06-01 15:04:15] [INFO ] Deduced a trap composed of 28 places in 210 ms of which 7 ms to minimize.
[2024-06-01 15:04:15] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 2 ms to minimize.
[2024-06-01 15:04:15] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 2 ms to minimize.
[2024-06-01 15:04:16] [INFO ] Deduced a trap composed of 34 places in 148 ms of which 2 ms to minimize.
[2024-06-01 15:04:16] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 19/58 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 15:04:18] [INFO ] Deduced a trap composed of 23 places in 253 ms of which 3 ms to minimize.
[2024-06-01 15:04:18] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 2 ms to minimize.
[2024-06-01 15:04:19] [INFO ] Deduced a trap composed of 29 places in 140 ms of which 2 ms to minimize.
[2024-06-01 15:04:20] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 2 ms to minimize.
[2024-06-01 15:04:21] [INFO ] Deduced a trap composed of 40 places in 237 ms of which 3 ms to minimize.
[2024-06-01 15:04:21] [INFO ] Deduced a trap composed of 34 places in 223 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 15:04:24] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 2 ms to minimize.
[2024-06-01 15:04:24] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 2 ms to minimize.
[2024-06-01 15:04:24] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 2 ms to minimize.
[2024-06-01 15:04:24] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 2 ms to minimize.
[2024-06-01 15:04:24] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 2 ms to minimize.
[2024-06-01 15:04:24] [INFO ] Deduced a trap composed of 35 places in 167 ms of which 2 ms to minimize.
[2024-06-01 15:04:25] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 2 ms to minimize.
[2024-06-01 15:04:25] [INFO ] Deduced a trap composed of 31 places in 238 ms of which 2 ms to minimize.
[2024-06-01 15:04:25] [INFO ] Deduced a trap composed of 21 places in 258 ms of which 2 ms to minimize.
[2024-06-01 15:04:26] [INFO ] Deduced a trap composed of 22 places in 240 ms of which 2 ms to minimize.
[2024-06-01 15:04:26] [INFO ] Deduced a trap composed of 26 places in 175 ms of which 2 ms to minimize.
[2024-06-01 15:04:26] [INFO ] Deduced a trap composed of 26 places in 182 ms of which 13 ms to minimize.
[2024-06-01 15:04:26] [INFO ] Deduced a trap composed of 21 places in 233 ms of which 2 ms to minimize.
[2024-06-01 15:04:26] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 2 ms to minimize.
[2024-06-01 15:04:27] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 2 ms to minimize.
[2024-06-01 15:04:27] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 1 ms to minimize.
[2024-06-01 15:04:27] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 2 ms to minimize.
[2024-06-01 15:04:28] [INFO ] Deduced a trap composed of 32 places in 287 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 18/82 constraints. Problems are: Problem set: 0 solved, 588 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 2.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 128/722 variables, and 82 constraints, problems are : Problem set: 0 solved, 588 unsolved in 30066 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/130 constraints, PredecessorRefiner: 588/588 constraints, Known Traps: 63/63 constraints]
Escalating to Integer solving :Problem set: 0 solved, 588 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 2 (OVERLAPS) 25/128 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 63/82 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 15:04:36] [INFO ] Deduced a trap composed of 26 places in 258 ms of which 3 ms to minimize.
[2024-06-01 15:04:36] [INFO ] Deduced a trap composed of 25 places in 253 ms of which 2 ms to minimize.
[2024-06-01 15:04:36] [INFO ] Deduced a trap composed of 23 places in 246 ms of which 2 ms to minimize.
[2024-06-01 15:04:37] [INFO ] Deduced a trap composed of 27 places in 298 ms of which 2 ms to minimize.
[2024-06-01 15:04:37] [INFO ] Deduced a trap composed of 27 places in 218 ms of which 2 ms to minimize.
[2024-06-01 15:04:38] [INFO ] Deduced a trap composed of 28 places in 221 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 6/88 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 15:04:42] [INFO ] Deduced a trap composed of 27 places in 189 ms of which 1 ms to minimize.
[2024-06-01 15:04:42] [INFO ] Deduced a trap composed of 27 places in 172 ms of which 1 ms to minimize.
[2024-06-01 15:04:42] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 2 ms to minimize.
[2024-06-01 15:04:42] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 1 ms to minimize.
[2024-06-01 15:04:42] [INFO ] Deduced a trap composed of 35 places in 208 ms of which 2 ms to minimize.
[2024-06-01 15:04:43] [INFO ] Deduced a trap composed of 32 places in 233 ms of which 2 ms to minimize.
[2024-06-01 15:04:43] [INFO ] Deduced a trap composed of 33 places in 237 ms of which 2 ms to minimize.
[2024-06-01 15:04:43] [INFO ] Deduced a trap composed of 39 places in 219 ms of which 2 ms to minimize.
[2024-06-01 15:04:43] [INFO ] Deduced a trap composed of 33 places in 232 ms of which 2 ms to minimize.
[2024-06-01 15:04:44] [INFO ] Deduced a trap composed of 39 places in 216 ms of which 2 ms to minimize.
[2024-06-01 15:04:44] [INFO ] Deduced a trap composed of 27 places in 204 ms of which 2 ms to minimize.
[2024-06-01 15:04:44] [INFO ] Deduced a trap composed of 38 places in 225 ms of which 2 ms to minimize.
[2024-06-01 15:04:44] [INFO ] Deduced a trap composed of 34 places in 207 ms of which 2 ms to minimize.
[2024-06-01 15:04:45] [INFO ] Deduced a trap composed of 30 places in 258 ms of which 3 ms to minimize.
[2024-06-01 15:04:45] [INFO ] Deduced a trap composed of 30 places in 310 ms of which 2 ms to minimize.
[2024-06-01 15:04:46] [INFO ] Deduced a trap composed of 30 places in 274 ms of which 2 ms to minimize.
[2024-06-01 15:04:46] [INFO ] Deduced a trap composed of 23 places in 296 ms of which 2 ms to minimize.
[2024-06-01 15:04:46] [INFO ] Deduced a trap composed of 31 places in 296 ms of which 3 ms to minimize.
[2024-06-01 15:04:47] [INFO ] Deduced a trap composed of 23 places in 306 ms of which 2 ms to minimize.
[2024-06-01 15:04:47] [INFO ] Deduced a trap composed of 24 places in 306 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 7 (OVERLAPS) 592/720 variables, 128/236 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/720 variables, 332/568 constraints. Problems are: Problem set: 0 solved, 588 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 720/722 variables, and 568 constraints, problems are : Problem set: 0 solved, 588 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 128/130 constraints, PredecessorRefiner: 332/588 constraints, Known Traps: 89/89 constraints]
After SMT, in 62235ms problems are : Problem set: 0 solved, 588 unsolved
Search for dead transitions found 0 dead transitions in 62285ms
Starting structural reductions in LTL mode, iteration 1 : 130/168 places, 592/592 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63992 ms. Remains : 130/168 places, 592/592 transitions.
Support contains 78 out of 130 places after structural reductions.
[2024-06-01 15:05:00] [INFO ] Flatten gal took : 207 ms
[2024-06-01 15:05:00] [INFO ] Flatten gal took : 128 ms
[2024-06-01 15:05:01] [INFO ] Input system was already deterministic with 592 transitions.
Support contains 77 out of 130 places (down from 78) after GAL structural reductions.
RANDOM walk for 40002 steps (849 resets) in 1374 ms. (29 steps per ms) remains 2/23 properties
BEST_FIRST walk for 40004 steps (252 resets) in 280 ms. (142 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (234 resets) in 415 ms. (96 steps per ms) remains 2/2 properties
[2024-06-01 15:05:01] [INFO ] Invariant cache hit.
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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 112/116 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 3 (OVERLAPS) 13/129 variables, 5/19 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp17 is UNSAT
After SMT solving in domain Real declared 721/722 variables, and 148 constraints, problems are : Problem set: 2 solved, 0 unsolved in 333 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 129/130 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 356ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
Computed a total of 130 stabilizing places and 592 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 130 transition count 592
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA PermAdmissibility-PT-02-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!(((p0||G(!p1)) U X(p2)))'
Support contains 20 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 592/592 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 104 transition count 592
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 39 place count 91 transition count 468
Iterating global reduction 1 with 13 rules applied. Total rules applied 52 place count 91 transition count 468
Applied a total of 52 rules in 35 ms. Remains 91 /130 variables (removed 39) and now considering 468/592 (removed 124) transitions.
// Phase 1: matrix 468 rows 91 cols
[2024-06-01 15:05:02] [INFO ] Computed 16 invariants in 11 ms
[2024-06-01 15:05:02] [INFO ] Implicit Places using invariants in 194 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 197 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/130 places, 468/592 transitions.
Applied a total of 0 rules in 12 ms. Remains 90 /90 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 245 ms. Remains : 90/130 places, 468/592 transitions.
Stuttering acceptance computed with spot in 490 ms :[(NOT p2), (NOT p2), (AND p1 (NOT p2)), (NOT p2), true, p1]
Running random walk in product with property : PermAdmissibility-PT-02-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-PT-02-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLCardinality-00 finished in 837 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 592/592 transitions.
Graph (complete) has 1235 edges and 130 vertex of which 104 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.7 ms
Discarding 26 places :
Also discarding 0 output transitions
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 27 place count 78 transition count 344
Iterating global reduction 0 with 26 rules applied. Total rules applied 53 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 77 place count 54 transition count 108
Iterating global reduction 0 with 24 rules applied. Total rules applied 101 place count 54 transition count 108
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 104 place count 51 transition count 84
Iterating global reduction 0 with 3 rules applied. Total rules applied 107 place count 51 transition count 84
Applied a total of 107 rules in 60 ms. Remains 51 /130 variables (removed 79) and now considering 84/592 (removed 508) transitions.
// Phase 1: matrix 84 rows 51 cols
[2024-06-01 15:05:03] [INFO ] Computed 16 invariants in 5 ms
[2024-06-01 15:05:03] [INFO ] Implicit Places using invariants in 92 ms returned [0, 5, 18, 25]
[2024-06-01 15:05:03] [INFO ] Actually due to overlaps returned [0, 5, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 96 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/130 places, 84/592 transitions.
Applied a total of 0 rules in 5 ms. Remains 48 /48 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 165 ms. Remains : 48/130 places, 84/592 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-02-LTLCardinality-02
Product exploration explored 100000 steps with 3030 reset in 625 ms.
Product exploration explored 100000 steps with 3030 reset in 330 ms.
Computed a total of 48 stabilizing places and 84 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 84
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 128 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
RANDOM walk for 158 steps (0 resets) in 14 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 154 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 84/84 transitions.
Applied a total of 0 rules in 4 ms. Remains 48 /48 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 48 cols
[2024-06-01 15:05:05] [INFO ] Computed 13 invariants in 2 ms
[2024-06-01 15:05:05] [INFO ] Implicit Places using invariants in 74 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 75 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/48 places, 84/84 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 46 transition count 83
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 46 transition count 82
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 45 transition count 82
Applied a total of 4 rules in 17 ms. Remains 45 /47 variables (removed 2) and now considering 82/84 (removed 2) transitions.
// Phase 1: matrix 82 rows 45 cols
[2024-06-01 15:05:05] [INFO ] Computed 12 invariants in 1 ms
[2024-06-01 15:05:05] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-01 15:05:05] [INFO ] Invariant cache hit.
[2024-06-01 15:05:05] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/48 places, 82/84 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 319 ms. Remains : 45/48 places, 82/84 transitions.
Computed a total of 45 stabilizing places and 82 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 45 transition count 82
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 107 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
RANDOM walk for 136 steps (0 resets) in 5 ms. (22 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 147 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3448 reset in 433 ms.
Product exploration explored 100000 steps with 3448 reset in 366 ms.
Support contains 1 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 82/82 transitions.
Applied a total of 0 rules in 4 ms. Remains 45 /45 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-06-01 15:05:06] [INFO ] Invariant cache hit.
[2024-06-01 15:05:06] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-01 15:05:06] [INFO ] Invariant cache hit.
[2024-06-01 15:05:07] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2024-06-01 15:05:07] [INFO ] Redundant transitions in 1 ms returned []
Running 78 sub problems to find dead transitions.
[2024-06-01 15:05:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 82/127 variables, 45/57 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 0/127 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 57 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1570 ms.
Refiners :[Generalized P Invariants (flows): 12/12 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 82/127 variables, 45/57 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 78/135 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 0/127 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 135 constraints, problems are : Problem set: 0 solved, 78 unsolved in 2769 ms.
Refiners :[Generalized P Invariants (flows): 12/12 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
After SMT, in 4391ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 4393ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4600 ms. Remains : 45/45 places, 82/82 transitions.
Treatment of property PermAdmissibility-PT-02-LTLCardinality-02 finished in 8095 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(((G(p0)||X(F(p1))) U X(p2))))'
Support contains 25 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 592/592 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 120 transition count 592
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 23 place count 107 transition count 468
Iterating global reduction 1 with 13 rules applied. Total rules applied 36 place count 107 transition count 468
Applied a total of 36 rules in 10 ms. Remains 107 /130 variables (removed 23) and now considering 468/592 (removed 124) transitions.
// Phase 1: matrix 468 rows 107 cols
[2024-06-01 15:05:11] [INFO ] Computed 18 invariants in 6 ms
[2024-06-01 15:05:11] [INFO ] Implicit Places using invariants in 210 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 213 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 106/130 places, 468/592 transitions.
Applied a total of 0 rules in 5 ms. Remains 106 /106 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 229 ms. Remains : 106/130 places, 468/592 transitions.
Stuttering acceptance computed with spot in 311 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-PT-02-LTLCardinality-03
Product exploration explored 100000 steps with 26198 reset in 444 ms.
Product exploration explored 100000 steps with 26118 reset in 372 ms.
Computed a total of 106 stabilizing places and 468 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 106 transition count 468
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p2 p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 22 factoid took 1260 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 240 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40002 steps (849 resets) in 599 ms. (66 steps per ms) remains 2/10 properties
BEST_FIRST walk for 40003 steps (247 resets) in 378 ms. (105 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (253 resets) in 417 ms. (95 steps per ms) remains 2/2 properties
// Phase 1: matrix 468 rows 106 cols
[2024-06-01 15:05:15] [INFO ] Computed 17 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 72/97 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 9/106 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 468/574 variables, 106/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/574 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 123 constraints, problems are : Problem set: 0 solved, 2 unsolved in 335 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf9 is UNSAT
At refinement iteration 1 (OVERLAPS) 72/97 variables, 12/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Int declared 106/574 variables, and 17 constraints, problems are : Problem set: 2 solved, 0 unsolved in 84 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 0/106 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 454ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p1)), (G (OR p0 p2 p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (OR p2 p1))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (AND (OR p0 (NOT p2)) (OR p0 (NOT p1))))), (F (NOT p1)), (F (NOT (OR (NOT p0) p2 p1)))]
Knowledge based reduction with 24 factoid took 3764 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 235 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 229 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Support contains 25 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 468/468 transitions.
Applied a total of 0 rules in 44 ms. Remains 106 /106 variables (removed 0) and now considering 468/468 (removed 0) transitions.
[2024-06-01 15:05:19] [INFO ] Invariant cache hit.
[2024-06-01 15:05:20] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-06-01 15:05:20] [INFO ] Invariant cache hit.
[2024-06-01 15:05:20] [INFO ] Implicit Places using invariants and state equation in 599 ms returned []
Implicit Place search using SMT with State Equation took 880 ms to find 0 implicit places.
[2024-06-01 15:05:20] [INFO ] Redundant transitions in 35 ms returned []
Running 464 sub problems to find dead transitions.
[2024-06-01 15:05:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 17/106 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-01 15:05:25] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 2 ms to minimize.
[2024-06-01 15:05:26] [INFO ] Deduced a trap composed of 27 places in 203 ms of which 1 ms to minimize.
[2024-06-01 15:05:26] [INFO ] Deduced a trap composed of 27 places in 176 ms of which 2 ms to minimize.
[2024-06-01 15:05:26] [INFO ] Deduced a trap composed of 26 places in 178 ms of which 2 ms to minimize.
[2024-06-01 15:05:26] [INFO ] Deduced a trap composed of 22 places in 206 ms of which 2 ms to minimize.
[2024-06-01 15:05:26] [INFO ] Deduced a trap composed of 34 places in 182 ms of which 1 ms to minimize.
[2024-06-01 15:05:27] [INFO ] Deduced a trap composed of 26 places in 179 ms of which 1 ms to minimize.
[2024-06-01 15:05:27] [INFO ] Deduced a trap composed of 21 places in 208 ms of which 2 ms to minimize.
[2024-06-01 15:05:27] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 2 ms to minimize.
[2024-06-01 15:05:27] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 1 ms to minimize.
[2024-06-01 15:05:27] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 1 ms to minimize.
[2024-06-01 15:05:28] [INFO ] Deduced a trap composed of 20 places in 183 ms of which 2 ms to minimize.
[2024-06-01 15:05:28] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 2 ms to minimize.
[2024-06-01 15:05:28] [INFO ] Deduced a trap composed of 25 places in 180 ms of which 2 ms to minimize.
[2024-06-01 15:05:28] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 1 ms to minimize.
[2024-06-01 15:05:28] [INFO ] Deduced a trap composed of 26 places in 143 ms of which 2 ms to minimize.
[2024-06-01 15:05:29] [INFO ] Deduced a trap composed of 26 places in 180 ms of which 1 ms to minimize.
[2024-06-01 15:05:29] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 1 ms to minimize.
[2024-06-01 15:05:29] [INFO ] Deduced a trap composed of 21 places in 180 ms of which 2 ms to minimize.
[2024-06-01 15:05:29] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-01 15:05:31] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 2 ms to minimize.
[2024-06-01 15:05:31] [INFO ] Deduced a trap composed of 22 places in 183 ms of which 2 ms to minimize.
[2024-06-01 15:05:32] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 2 ms to minimize.
[2024-06-01 15:05:32] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 2 ms to minimize.
[2024-06-01 15:05:32] [INFO ] Deduced a trap composed of 19 places in 224 ms of which 2 ms to minimize.
[2024-06-01 15:05:32] [INFO ] Deduced a trap composed of 25 places in 194 ms of which 2 ms to minimize.
[2024-06-01 15:05:32] [INFO ] Deduced a trap composed of 31 places in 220 ms of which 2 ms to minimize.
[2024-06-01 15:05:33] [INFO ] Deduced a trap composed of 31 places in 175 ms of which 2 ms to minimize.
[2024-06-01 15:05:33] [INFO ] Deduced a trap composed of 31 places in 185 ms of which 2 ms to minimize.
[2024-06-01 15:05:33] [INFO ] Deduced a trap composed of 18 places in 185 ms of which 1 ms to minimize.
[2024-06-01 15:05:33] [INFO ] Deduced a trap composed of 28 places in 190 ms of which 1 ms to minimize.
[2024-06-01 15:05:34] [INFO ] Deduced a trap composed of 21 places in 213 ms of which 2 ms to minimize.
[2024-06-01 15:05:34] [INFO ] Deduced a trap composed of 27 places in 166 ms of which 2 ms to minimize.
[2024-06-01 15:05:34] [INFO ] Deduced a trap composed of 26 places in 163 ms of which 2 ms to minimize.
[2024-06-01 15:05:34] [INFO ] Deduced a trap composed of 31 places in 164 ms of which 2 ms to minimize.
[2024-06-01 15:05:34] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 2 ms to minimize.
[2024-06-01 15:05:34] [INFO ] Deduced a trap composed of 25 places in 159 ms of which 2 ms to minimize.
[2024-06-01 15:05:35] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 1 ms to minimize.
[2024-06-01 15:05:35] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 2 ms to minimize.
[2024-06-01 15:05:35] [INFO ] Deduced a trap composed of 27 places in 178 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-01 15:05:36] [INFO ] Deduced a trap composed of 21 places in 167 ms of which 2 ms to minimize.
[2024-06-01 15:05:36] [INFO ] Deduced a trap composed of 26 places in 180 ms of which 1 ms to minimize.
[2024-06-01 15:05:37] [INFO ] Deduced a trap composed of 26 places in 177 ms of which 2 ms to minimize.
[2024-06-01 15:05:37] [INFO ] Deduced a trap composed of 31 places in 229 ms of which 2 ms to minimize.
[2024-06-01 15:05:37] [INFO ] Deduced a trap composed of 26 places in 212 ms of which 2 ms to minimize.
[2024-06-01 15:05:37] [INFO ] Deduced a trap composed of 24 places in 197 ms of which 2 ms to minimize.
[2024-06-01 15:05:38] [INFO ] Deduced a trap composed of 29 places in 241 ms of which 2 ms to minimize.
[2024-06-01 15:05:38] [INFO ] Deduced a trap composed of 22 places in 232 ms of which 2 ms to minimize.
[2024-06-01 15:05:38] [INFO ] Deduced a trap composed of 20 places in 262 ms of which 2 ms to minimize.
[2024-06-01 15:05:38] [INFO ] Deduced a trap composed of 25 places in 186 ms of which 2 ms to minimize.
[2024-06-01 15:05:39] [INFO ] Deduced a trap composed of 24 places in 182 ms of which 2 ms to minimize.
[2024-06-01 15:05:39] [INFO ] Deduced a trap composed of 23 places in 214 ms of which 3 ms to minimize.
[2024-06-01 15:05:39] [INFO ] Deduced a trap composed of 24 places in 201 ms of which 2 ms to minimize.
[2024-06-01 15:05:39] [INFO ] Deduced a trap composed of 25 places in 177 ms of which 3 ms to minimize.
[2024-06-01 15:05:39] [INFO ] Deduced a trap composed of 24 places in 201 ms of which 2 ms to minimize.
[2024-06-01 15:05:40] [INFO ] Deduced a trap composed of 25 places in 212 ms of which 2 ms to minimize.
[2024-06-01 15:05:40] [INFO ] Deduced a trap composed of 26 places in 207 ms of which 2 ms to minimize.
[2024-06-01 15:05:40] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 2 ms to minimize.
[2024-06-01 15:05:40] [INFO ] Deduced a trap composed of 26 places in 168 ms of which 2 ms to minimize.
[2024-06-01 15:05:40] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-01 15:05:42] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 2 ms to minimize.
[2024-06-01 15:05:42] [INFO ] Deduced a trap composed of 30 places in 178 ms of which 2 ms to minimize.
[2024-06-01 15:05:42] [INFO ] Deduced a trap composed of 27 places in 176 ms of which 2 ms to minimize.
[2024-06-01 15:05:42] [INFO ] Deduced a trap composed of 32 places in 180 ms of which 2 ms to minimize.
[2024-06-01 15:05:42] [INFO ] Deduced a trap composed of 32 places in 173 ms of which 2 ms to minimize.
[2024-06-01 15:05:43] [INFO ] Deduced a trap composed of 20 places in 186 ms of which 2 ms to minimize.
[2024-06-01 15:05:43] [INFO ] Deduced a trap composed of 23 places in 182 ms of which 2 ms to minimize.
[2024-06-01 15:05:43] [INFO ] Deduced a trap composed of 26 places in 190 ms of which 2 ms to minimize.
[2024-06-01 15:05:43] [INFO ] Deduced a trap composed of 28 places in 182 ms of which 2 ms to minimize.
[2024-06-01 15:05:44] [INFO ] Deduced a trap composed of 22 places in 230 ms of which 3 ms to minimize.
[2024-06-01 15:05:44] [INFO ] Deduced a trap composed of 22 places in 230 ms of which 2 ms to minimize.
[2024-06-01 15:05:44] [INFO ] Deduced a trap composed of 27 places in 243 ms of which 3 ms to minimize.
[2024-06-01 15:05:44] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 1 ms to minimize.
[2024-06-01 15:05:45] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 2 ms to minimize.
[2024-06-01 15:05:45] [INFO ] Deduced a trap composed of 29 places in 179 ms of which 1 ms to minimize.
[2024-06-01 15:05:45] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 1 ms to minimize.
[2024-06-01 15:05:45] [INFO ] Deduced a trap composed of 22 places in 161 ms of which 2 ms to minimize.
[2024-06-01 15:05:46] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 2 ms to minimize.
[2024-06-01 15:05:46] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 19/96 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-01 15:05:50] [INFO ] Deduced a trap composed of 21 places in 184 ms of which 2 ms to minimize.
[2024-06-01 15:05:50] [INFO ] Deduced a trap composed of 25 places in 217 ms of which 2 ms to minimize.
[2024-06-01 15:05:51] [INFO ] Deduced a trap composed of 22 places in 242 ms of which 2 ms to minimize.
[2024-06-01 15:05:51] [INFO ] Deduced a trap composed of 25 places in 235 ms of which 2 ms to minimize.
[2024-06-01 15:05:51] [INFO ] Deduced a trap composed of 25 places in 237 ms of which 2 ms to minimize.
[2024-06-01 15:05:52] [INFO ] Deduced a trap composed of 24 places in 236 ms of which 2 ms to minimize.
SMT process timed out in 31245ms, After SMT, problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 31253ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32223 ms. Remains : 106/106 places, 468/468 transitions.
Computed a total of 106 stabilizing places and 468 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 106 transition count 468
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p2 p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 1598 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
RANDOM walk for 40002 steps (847 resets) in 198 ms. (201 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (252 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
[2024-06-01 15:05:54] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 72/97 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/106 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 468/574 variables, 106/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/574 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 123 constraints, problems are : Problem set: 0 solved, 1 unsolved in 286 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Int declared 97/574 variables, and 12 constraints, problems are : Problem set: 1 solved, 0 unsolved in 60 ms.
Refiners :[Generalized P Invariants (flows): 12/17 constraints, State Equation: 0/106 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 359ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p2 p0 p1))]
False Knowledge obtained : [(F (NOT (AND (OR (NOT p2) p0) (OR p0 (NOT p1))))), (F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p2 p1))), (F (NOT (OR p2 p0 (NOT p1))))]
Knowledge based reduction with 17 factoid took 3827 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 235 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 227 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 223 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Product exploration explored 100000 steps with 5528 reset in 790 ms.
Product exploration explored 100000 steps with 5523 reset in 523 ms.
Support contains 25 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 468/468 transitions.
Applied a total of 0 rules in 17 ms. Remains 106 /106 variables (removed 0) and now considering 468/468 (removed 0) transitions.
[2024-06-01 15:06:00] [INFO ] Invariant cache hit.
[2024-06-01 15:06:00] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-06-01 15:06:00] [INFO ] Invariant cache hit.
[2024-06-01 15:06:01] [INFO ] Implicit Places using invariants and state equation in 968 ms returned []
Implicit Place search using SMT with State Equation took 1142 ms to find 0 implicit places.
[2024-06-01 15:06:01] [INFO ] Redundant transitions in 16 ms returned []
Running 464 sub problems to find dead transitions.
[2024-06-01 15:06:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 17/106 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-01 15:06:08] [INFO ] Deduced a trap composed of 23 places in 192 ms of which 2 ms to minimize.
[2024-06-01 15:06:08] [INFO ] Deduced a trap composed of 27 places in 213 ms of which 2 ms to minimize.
[2024-06-01 15:06:08] [INFO ] Deduced a trap composed of 27 places in 251 ms of which 3 ms to minimize.
[2024-06-01 15:06:08] [INFO ] Deduced a trap composed of 26 places in 222 ms of which 2 ms to minimize.
[2024-06-01 15:06:09] [INFO ] Deduced a trap composed of 22 places in 234 ms of which 2 ms to minimize.
[2024-06-01 15:06:09] [INFO ] Deduced a trap composed of 34 places in 229 ms of which 2 ms to minimize.
[2024-06-01 15:06:09] [INFO ] Deduced a trap composed of 26 places in 227 ms of which 1 ms to minimize.
[2024-06-01 15:06:09] [INFO ] Deduced a trap composed of 21 places in 210 ms of which 2 ms to minimize.
[2024-06-01 15:06:10] [INFO ] Deduced a trap composed of 25 places in 171 ms of which 1 ms to minimize.
[2024-06-01 15:06:10] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 1 ms to minimize.
[2024-06-01 15:06:10] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 2 ms to minimize.
[2024-06-01 15:06:10] [INFO ] Deduced a trap composed of 20 places in 188 ms of which 3 ms to minimize.
[2024-06-01 15:06:11] [INFO ] Deduced a trap composed of 31 places in 236 ms of which 2 ms to minimize.
[2024-06-01 15:06:11] [INFO ] Deduced a trap composed of 25 places in 238 ms of which 2 ms to minimize.
[2024-06-01 15:06:11] [INFO ] Deduced a trap composed of 26 places in 235 ms of which 2 ms to minimize.
[2024-06-01 15:06:11] [INFO ] Deduced a trap composed of 26 places in 250 ms of which 2 ms to minimize.
[2024-06-01 15:06:12] [INFO ] Deduced a trap composed of 26 places in 240 ms of which 2 ms to minimize.
[2024-06-01 15:06:12] [INFO ] Deduced a trap composed of 25 places in 208 ms of which 2 ms to minimize.
[2024-06-01 15:06:12] [INFO ] Deduced a trap composed of 21 places in 183 ms of which 2 ms to minimize.
[2024-06-01 15:06:12] [INFO ] Deduced a trap composed of 21 places in 203 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-01 15:06:15] [INFO ] Deduced a trap composed of 31 places in 218 ms of which 3 ms to minimize.
[2024-06-01 15:06:15] [INFO ] Deduced a trap composed of 22 places in 183 ms of which 1 ms to minimize.
[2024-06-01 15:06:15] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 2 ms to minimize.
[2024-06-01 15:06:16] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2024-06-01 15:06:16] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 1 ms to minimize.
[2024-06-01 15:06:16] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 2 ms to minimize.
[2024-06-01 15:06:16] [INFO ] Deduced a trap composed of 31 places in 249 ms of which 2 ms to minimize.
[2024-06-01 15:06:16] [INFO ] Deduced a trap composed of 31 places in 169 ms of which 2 ms to minimize.
[2024-06-01 15:06:16] [INFO ] Deduced a trap composed of 31 places in 192 ms of which 2 ms to minimize.
[2024-06-01 15:06:17] [INFO ] Deduced a trap composed of 18 places in 180 ms of which 2 ms to minimize.
[2024-06-01 15:06:17] [INFO ] Deduced a trap composed of 28 places in 181 ms of which 2 ms to minimize.
[2024-06-01 15:06:17] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 1 ms to minimize.
[2024-06-01 15:06:17] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 2 ms to minimize.
[2024-06-01 15:06:17] [INFO ] Deduced a trap composed of 26 places in 166 ms of which 1 ms to minimize.
[2024-06-01 15:06:18] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 1 ms to minimize.
[2024-06-01 15:06:18] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 2 ms to minimize.
[2024-06-01 15:06:18] [INFO ] Deduced a trap composed of 25 places in 165 ms of which 2 ms to minimize.
[2024-06-01 15:06:18] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 1 ms to minimize.
[2024-06-01 15:06:18] [INFO ] Deduced a trap composed of 25 places in 179 ms of which 2 ms to minimize.
[2024-06-01 15:06:19] [INFO ] Deduced a trap composed of 27 places in 180 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-01 15:06:19] [INFO ] Deduced a trap composed of 21 places in 169 ms of which 2 ms to minimize.
[2024-06-01 15:06:20] [INFO ] Deduced a trap composed of 26 places in 182 ms of which 1 ms to minimize.
[2024-06-01 15:06:20] [INFO ] Deduced a trap composed of 26 places in 177 ms of which 2 ms to minimize.
[2024-06-01 15:06:20] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 2 ms to minimize.
[2024-06-01 15:06:20] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 2 ms to minimize.
[2024-06-01 15:06:20] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 1 ms to minimize.
[2024-06-01 15:06:21] [INFO ] Deduced a trap composed of 29 places in 143 ms of which 1 ms to minimize.
[2024-06-01 15:06:21] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 2 ms to minimize.
[2024-06-01 15:06:21] [INFO ] Deduced a trap composed of 20 places in 209 ms of which 2 ms to minimize.
[2024-06-01 15:06:21] [INFO ] Deduced a trap composed of 25 places in 193 ms of which 2 ms to minimize.
[2024-06-01 15:06:21] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 2 ms to minimize.
[2024-06-01 15:06:22] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 2 ms to minimize.
[2024-06-01 15:06:22] [INFO ] Deduced a trap composed of 24 places in 209 ms of which 2 ms to minimize.
[2024-06-01 15:06:22] [INFO ] Deduced a trap composed of 25 places in 177 ms of which 2 ms to minimize.
[2024-06-01 15:06:22] [INFO ] Deduced a trap composed of 24 places in 222 ms of which 2 ms to minimize.
[2024-06-01 15:06:22] [INFO ] Deduced a trap composed of 25 places in 179 ms of which 2 ms to minimize.
[2024-06-01 15:06:23] [INFO ] Deduced a trap composed of 26 places in 177 ms of which 2 ms to minimize.
[2024-06-01 15:06:23] [INFO ] Deduced a trap composed of 25 places in 173 ms of which 3 ms to minimize.
[2024-06-01 15:06:23] [INFO ] Deduced a trap composed of 26 places in 169 ms of which 2 ms to minimize.
[2024-06-01 15:06:23] [INFO ] Deduced a trap composed of 31 places in 164 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-01 15:06:24] [INFO ] Deduced a trap composed of 24 places in 188 ms of which 1 ms to minimize.
[2024-06-01 15:06:25] [INFO ] Deduced a trap composed of 30 places in 182 ms of which 1 ms to minimize.
[2024-06-01 15:06:25] [INFO ] Deduced a trap composed of 27 places in 166 ms of which 1 ms to minimize.
[2024-06-01 15:06:25] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 1 ms to minimize.
[2024-06-01 15:06:25] [INFO ] Deduced a trap composed of 32 places in 196 ms of which 2 ms to minimize.
[2024-06-01 15:06:26] [INFO ] Deduced a trap composed of 20 places in 266 ms of which 2 ms to minimize.
[2024-06-01 15:06:26] [INFO ] Deduced a trap composed of 23 places in 207 ms of which 2 ms to minimize.
[2024-06-01 15:06:26] [INFO ] Deduced a trap composed of 26 places in 245 ms of which 2 ms to minimize.
[2024-06-01 15:06:26] [INFO ] Deduced a trap composed of 28 places in 233 ms of which 2 ms to minimize.
[2024-06-01 15:06:27] [INFO ] Deduced a trap composed of 22 places in 232 ms of which 3 ms to minimize.
[2024-06-01 15:06:27] [INFO ] Deduced a trap composed of 22 places in 237 ms of which 2 ms to minimize.
[2024-06-01 15:06:27] [INFO ] Deduced a trap composed of 27 places in 239 ms of which 2 ms to minimize.
[2024-06-01 15:06:27] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 2 ms to minimize.
[2024-06-01 15:06:28] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 1 ms to minimize.
[2024-06-01 15:06:28] [INFO ] Deduced a trap composed of 29 places in 178 ms of which 2 ms to minimize.
[2024-06-01 15:06:28] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 2 ms to minimize.
[2024-06-01 15:06:29] [INFO ] Deduced a trap composed of 22 places in 158 ms of which 2 ms to minimize.
[2024-06-01 15:06:29] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 2 ms to minimize.
[2024-06-01 15:06:29] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 19/96 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 106/574 variables, and 96 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 0/106 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 79/79 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 17/106 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 79/96 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-01 15:06:37] [INFO ] Deduced a trap composed of 28 places in 229 ms of which 2 ms to minimize.
[2024-06-01 15:06:37] [INFO ] Deduced a trap composed of 20 places in 230 ms of which 3 ms to minimize.
[2024-06-01 15:06:37] [INFO ] Deduced a trap composed of 24 places in 231 ms of which 2 ms to minimize.
[2024-06-01 15:06:37] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 2 ms to minimize.
[2024-06-01 15:06:38] [INFO ] Deduced a trap composed of 29 places in 156 ms of which 2 ms to minimize.
[2024-06-01 15:06:38] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 2 ms to minimize.
[2024-06-01 15:06:38] [INFO ] Deduced a trap composed of 24 places in 188 ms of which 2 ms to minimize.
[2024-06-01 15:06:38] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 1 ms to minimize.
[2024-06-01 15:06:39] [INFO ] Deduced a trap composed of 24 places in 206 ms of which 2 ms to minimize.
[2024-06-01 15:06:39] [INFO ] Deduced a trap composed of 24 places in 205 ms of which 2 ms to minimize.
[2024-06-01 15:06:39] [INFO ] Deduced a trap composed of 21 places in 237 ms of which 2 ms to minimize.
[2024-06-01 15:06:39] [INFO ] Deduced a trap composed of 20 places in 185 ms of which 1 ms to minimize.
[2024-06-01 15:06:40] [INFO ] Deduced a trap composed of 32 places in 197 ms of which 2 ms to minimize.
[2024-06-01 15:06:40] [INFO ] Deduced a trap composed of 22 places in 239 ms of which 2 ms to minimize.
[2024-06-01 15:06:40] [INFO ] Deduced a trap composed of 32 places in 238 ms of which 2 ms to minimize.
[2024-06-01 15:06:40] [INFO ] Deduced a trap composed of 28 places in 246 ms of which 2 ms to minimize.
[2024-06-01 15:06:41] [INFO ] Deduced a trap composed of 22 places in 263 ms of which 2 ms to minimize.
[2024-06-01 15:06:41] [INFO ] Deduced a trap composed of 28 places in 260 ms of which 2 ms to minimize.
[2024-06-01 15:06:41] [INFO ] Deduced a trap composed of 21 places in 245 ms of which 3 ms to minimize.
[2024-06-01 15:06:41] [INFO ] Deduced a trap composed of 28 places in 244 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-01 15:06:43] [INFO ] Deduced a trap composed of 24 places in 236 ms of which 2 ms to minimize.
[2024-06-01 15:06:43] [INFO ] Deduced a trap composed of 26 places in 196 ms of which 2 ms to minimize.
[2024-06-01 15:06:44] [INFO ] Deduced a trap composed of 22 places in 195 ms of which 2 ms to minimize.
[2024-06-01 15:06:44] [INFO ] Deduced a trap composed of 22 places in 214 ms of which 2 ms to minimize.
[2024-06-01 15:06:44] [INFO ] Deduced a trap composed of 22 places in 230 ms of which 2 ms to minimize.
[2024-06-01 15:06:44] [INFO ] Deduced a trap composed of 22 places in 166 ms of which 2 ms to minimize.
[2024-06-01 15:06:45] [INFO ] Deduced a trap composed of 21 places in 172 ms of which 2 ms to minimize.
[2024-06-01 15:06:45] [INFO ] Deduced a trap composed of 21 places in 179 ms of which 2 ms to minimize.
[2024-06-01 15:06:45] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 2 ms to minimize.
[2024-06-01 15:06:46] [INFO ] Deduced a trap composed of 22 places in 168 ms of which 1 ms to minimize.
[2024-06-01 15:06:46] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 1 ms to minimize.
[2024-06-01 15:06:46] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 1 ms to minimize.
[2024-06-01 15:06:46] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 1 ms to minimize.
[2024-06-01 15:06:47] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 14/130 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-01 15:06:49] [INFO ] Deduced a trap composed of 20 places in 226 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-01 15:06:52] [INFO ] Deduced a trap composed of 22 places in 183 ms of which 2 ms to minimize.
[2024-06-01 15:06:53] [INFO ] Deduced a trap composed of 30 places in 254 ms of which 2 ms to minimize.
[2024-06-01 15:06:53] [INFO ] Deduced a trap composed of 22 places in 251 ms of which 2 ms to minimize.
[2024-06-01 15:06:53] [INFO ] Deduced a trap composed of 28 places in 234 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 4/135 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-01 15:06:56] [INFO ] Deduced a trap composed of 24 places in 190 ms of which 2 ms to minimize.
[2024-06-01 15:06:57] [INFO ] Deduced a trap composed of 24 places in 247 ms of which 2 ms to minimize.
[2024-06-01 15:06:57] [INFO ] Deduced a trap composed of 25 places in 247 ms of which 2 ms to minimize.
[2024-06-01 15:06:57] [INFO ] Deduced a trap composed of 25 places in 253 ms of which 3 ms to minimize.
[2024-06-01 15:06:58] [INFO ] Deduced a trap composed of 24 places in 189 ms of which 1 ms to minimize.
[2024-06-01 15:06:58] [INFO ] Deduced a trap composed of 28 places in 250 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 6/141 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-01 15:07:01] [INFO ] Deduced a trap composed of 24 places in 204 ms of which 2 ms to minimize.
[2024-06-01 15:07:02] [INFO ] Deduced a trap composed of 21 places in 252 ms of which 2 ms to minimize.
[2024-06-01 15:07:02] [INFO ] Deduced a trap composed of 23 places in 222 ms of which 2 ms to minimize.
[2024-06-01 15:07:02] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 2 ms to minimize.
[2024-06-01 15:07:02] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 2 ms to minimize.
[2024-06-01 15:07:03] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 2 ms to minimize.
SMT process timed out in 61675ms, After SMT, problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 61685ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62871 ms. Remains : 106/106 places, 468/468 transitions.
Treatment of property PermAdmissibility-PT-02-LTLCardinality-03 finished in 111784 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||F(p1)))))'
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 592/592 transitions.
Graph (complete) has 1235 edges and 130 vertex of which 6 are kept as prefixes of interest. Removing 124 places using SCC suffix rule.5 ms
Discarding 124 places :
Also discarding 584 output transitions
Drop transitions (Output transitions of discarded places.) removed 584 transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 5 transition count 4
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 5 transition count 4
Applied a total of 3 rules in 10 ms. Remains 5 /130 variables (removed 125) and now considering 4/592 (removed 588) transitions.
// Phase 1: matrix 4 rows 5 cols
[2024-06-01 15:07:03] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 15:07:03] [INFO ] Implicit Places using invariants in 35 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/130 places, 4/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 47 ms. Remains : 4/130 places, 4/592 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-PT-02-LTLCardinality-04
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-02-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLCardinality-04 finished in 181 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G((p1||F(p2))))))'
Support contains 17 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 592/592 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 104 transition count 592
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 45 place count 85 transition count 372
Iterating global reduction 1 with 19 rules applied. Total rules applied 64 place count 85 transition count 372
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 74 place count 75 transition count 262
Iterating global reduction 1 with 10 rules applied. Total rules applied 84 place count 75 transition count 262
Applied a total of 84 rules in 12 ms. Remains 75 /130 variables (removed 55) and now considering 262/592 (removed 330) transitions.
// Phase 1: matrix 262 rows 75 cols
[2024-06-01 15:07:03] [INFO ] Computed 16 invariants in 4 ms
[2024-06-01 15:07:03] [INFO ] Implicit Places using invariants in 145 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 147 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/130 places, 262/592 transitions.
Applied a total of 0 rules in 3 ms. Remains 74 /74 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 162 ms. Remains : 74/130 places, 262/592 transitions.
Stuttering acceptance computed with spot in 273 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : PermAdmissibility-PT-02-LTLCardinality-05
Stuttering criterion allowed to conclude after 58320 steps with 4361 reset in 326 ms.
FORMULA PermAdmissibility-PT-02-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLCardinality-05 finished in 789 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||X(p1)))))'
Support contains 17 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 592/592 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 112 transition count 592
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 32 place count 98 transition count 368
Iterating global reduction 1 with 14 rules applied. Total rules applied 46 place count 98 transition count 368
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 60 place count 84 transition count 242
Iterating global reduction 1 with 14 rules applied. Total rules applied 74 place count 84 transition count 242
Applied a total of 74 rules in 7 ms. Remains 84 /130 variables (removed 46) and now considering 242/592 (removed 350) transitions.
// Phase 1: matrix 242 rows 84 cols
[2024-06-01 15:07:04] [INFO ] Computed 17 invariants in 3 ms
[2024-06-01 15:07:04] [INFO ] Implicit Places using invariants in 209 ms returned [0, 11, 39, 50]
[2024-06-01 15:07:04] [INFO ] Actually due to overlaps returned [0, 11, 39]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 211 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/130 places, 242/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 220 ms. Remains : 81/130 places, 242/592 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : PermAdmissibility-PT-02-LTLCardinality-06
Product exploration explored 100000 steps with 33333 reset in 188 ms.
Product exploration explored 100000 steps with 33333 reset in 221 ms.
Computed a total of 81 stabilizing places and 242 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 81 transition count 242
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 15 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-02-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-02-LTLCardinality-06 finished in 929 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 592/592 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 104 transition count 592
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 52 place count 78 transition count 344
Iterating global reduction 1 with 26 rules applied. Total rules applied 78 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 102 place count 54 transition count 108
Iterating global reduction 1 with 24 rules applied. Total rules applied 126 place count 54 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 129 place count 51 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 132 place count 51 transition count 84
Applied a total of 132 rules in 7 ms. Remains 51 /130 variables (removed 79) and now considering 84/592 (removed 508) transitions.
// Phase 1: matrix 84 rows 51 cols
[2024-06-01 15:07:05] [INFO ] Computed 16 invariants in 1 ms
[2024-06-01 15:07:05] [INFO ] Implicit Places using invariants in 135 ms returned [0, 5, 18, 25]
[2024-06-01 15:07:05] [INFO ] Actually due to overlaps returned [0, 5, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 137 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/130 places, 84/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 145 ms. Remains : 48/130 places, 84/592 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-02-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 226 steps with 6 reset in 1 ms.
FORMULA PermAdmissibility-PT-02-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLCardinality-09 finished in 305 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 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 592/592 transitions.
Graph (complete) has 1235 edges and 130 vertex of which 87 are kept as prefixes of interest. Removing 43 places using SCC suffix rule.4 ms
Discarding 43 places :
Also discarding 128 output transitions
Drop transitions (Output transitions of discarded places.) removed 128 transitions
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 13 place count 75 transition count 342
Iterating global reduction 0 with 12 rules applied. Total rules applied 25 place count 75 transition count 342
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 49 place count 51 transition count 106
Iterating global reduction 0 with 24 rules applied. Total rules applied 73 place count 51 transition count 106
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 75 place count 49 transition count 90
Iterating global reduction 0 with 2 rules applied. Total rules applied 77 place count 49 transition count 90
Applied a total of 77 rules in 18 ms. Remains 49 /130 variables (removed 81) and now considering 90/592 (removed 502) transitions.
// Phase 1: matrix 90 rows 49 cols
[2024-06-01 15:07:05] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 15:07:05] [INFO ] Implicit Places using invariants in 121 ms returned [0, 15, 23]
[2024-06-01 15:07:05] [INFO ] Actually due to overlaps returned [0, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 135 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/130 places, 90/592 transitions.
Applied a total of 0 rules in 3 ms. Remains 47 /47 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 156 ms. Remains : 47/130 places, 90/592 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-02-LTLCardinality-12
Product exploration explored 100000 steps with 3448 reset in 401 ms.
Product exploration explored 100000 steps with 3448 reset in 319 ms.
Computed a total of 47 stabilizing places and 90 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 47 transition count 90
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 135 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
RANDOM walk for 100 steps (0 resets) in 4 ms. (20 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 152 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Support contains 2 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 90/90 transitions.
Applied a total of 0 rules in 5 ms. Remains 47 /47 variables (removed 0) and now considering 90/90 (removed 0) transitions.
// Phase 1: matrix 90 rows 47 cols
[2024-06-01 15:07:06] [INFO ] Computed 12 invariants in 2 ms
[2024-06-01 15:07:07] [INFO ] Implicit Places using invariants in 237 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 254 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/47 places, 90/90 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 46 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 45 transition count 89
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 45 transition count 88
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 44 transition count 88
Applied a total of 4 rules in 8 ms. Remains 44 /46 variables (removed 2) and now considering 88/90 (removed 2) transitions.
// Phase 1: matrix 88 rows 44 cols
[2024-06-01 15:07:07] [INFO ] Computed 11 invariants in 1 ms
[2024-06-01 15:07:07] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-01 15:07:07] [INFO ] Invariant cache hit.
[2024-06-01 15:07:07] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/47 places, 88/90 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 586 ms. Remains : 44/47 places, 88/90 transitions.
Computed a total of 44 stabilizing places and 88 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 44 transition count 88
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 131 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
RANDOM walk for 100 steps (0 resets) in 4 ms. (20 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 155 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4000 reset in 369 ms.
Product exploration explored 100000 steps with 4000 reset in 344 ms.
Support contains 2 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 88/88 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-06-01 15:07:08] [INFO ] Invariant cache hit.
[2024-06-01 15:07:08] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-01 15:07:08] [INFO ] Invariant cache hit.
[2024-06-01 15:07:09] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2024-06-01 15:07:09] [INFO ] Redundant transitions in 1 ms returned []
Running 84 sub problems to find dead transitions.
[2024-06-01 15:07:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 88/131 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 1/132 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/132 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 55 constraints, problems are : Problem set: 0 solved, 84 unsolved in 2635 ms.
Refiners :[Generalized P Invariants (flows): 11/11 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 88/131 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 80/134 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 1/132 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 139 constraints, problems are : Problem set: 0 solved, 84 unsolved in 6013 ms.
Refiners :[Generalized P Invariants (flows): 11/11 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints]
After SMT, in 8705ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 8706ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8914 ms. Remains : 44/44 places, 88/88 transitions.
Treatment of property PermAdmissibility-PT-02-LTLCardinality-12 finished in 12268 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 592/592 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 105 transition count 592
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 49 place count 81 transition count 348
Iterating global reduction 1 with 24 rules applied. Total rules applied 73 place count 81 transition count 348
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 93 place count 61 transition count 144
Iterating global reduction 1 with 20 rules applied. Total rules applied 113 place count 61 transition count 144
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 114 place count 60 transition count 136
Iterating global reduction 1 with 1 rules applied. Total rules applied 115 place count 60 transition count 136
Applied a total of 115 rules in 7 ms. Remains 60 /130 variables (removed 70) and now considering 136/592 (removed 456) transitions.
// Phase 1: matrix 136 rows 60 cols
[2024-06-01 15:07:17] [INFO ] Computed 16 invariants in 2 ms
[2024-06-01 15:07:18] [INFO ] Implicit Places using invariants in 182 ms returned [0, 6, 22, 30]
[2024-06-01 15:07:18] [INFO ] Actually due to overlaps returned [0, 6, 22]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 184 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/130 places, 136/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 192 ms. Remains : 57/130 places, 136/592 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-02-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 146 ms.
Product exploration explored 100000 steps with 50000 reset in 195 ms.
Computed a total of 57 stabilizing places and 136 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 57 transition count 136
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 21 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-02-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-02-LTLCardinality-13 finished in 761 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((X(F(p0))&&F(p1)&&(p2||G(p1)))))'
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 592/592 transitions.
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 106 transition count 592
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 48 place count 82 transition count 348
Iterating global reduction 1 with 24 rules applied. Total rules applied 72 place count 82 transition count 348
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 91 place count 63 transition count 154
Iterating global reduction 1 with 19 rules applied. Total rules applied 110 place count 63 transition count 154
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 62 transition count 146
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 62 transition count 146
Applied a total of 112 rules in 8 ms. Remains 62 /130 variables (removed 68) and now considering 146/592 (removed 446) transitions.
// Phase 1: matrix 146 rows 62 cols
[2024-06-01 15:07:18] [INFO ] Computed 16 invariants in 1 ms
[2024-06-01 15:07:18] [INFO ] Implicit Places using invariants in 193 ms returned [0, 7, 23, 33]
[2024-06-01 15:07:18] [INFO ] Actually due to overlaps returned [0, 7, 23]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 197 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 59/130 places, 146/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 59 /59 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 208 ms. Remains : 59/130 places, 146/592 transitions.
Stuttering acceptance computed with spot in 352 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-PT-02-LTLCardinality-15
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-PT-02-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLCardinality-15 finished in 590 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)))'
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(((G(p0)||X(F(p1))) U X(p2))))'
Found a Lengthening insensitive property : PermAdmissibility-PT-02-LTLCardinality-03
Stuttering acceptance computed with spot in 258 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 25 out of 130 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 130/130 places, 592/592 transitions.
Graph (complete) has 1235 edges and 130 vertex of which 120 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 0 output transitions
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 14 place count 107 transition count 468
Iterating global reduction 0 with 13 rules applied. Total rules applied 27 place count 107 transition count 468
Applied a total of 27 rules in 23 ms. Remains 107 /130 variables (removed 23) and now considering 468/592 (removed 124) transitions.
// Phase 1: matrix 468 rows 107 cols
[2024-06-01 15:07:20] [INFO ] Computed 18 invariants in 6 ms
[2024-06-01 15:07:20] [INFO ] Implicit Places using invariants in 237 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 238 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 106/130 places, 468/592 transitions.
Applied a total of 0 rules in 8 ms. Remains 106 /106 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 269 ms. Remains : 106/130 places, 468/592 transitions.
Running random walk in product with property : PermAdmissibility-PT-02-LTLCardinality-03
Product exploration explored 100000 steps with 26269 reset in 315 ms.
Product exploration explored 100000 steps with 26255 reset in 324 ms.
Computed a total of 106 stabilizing places and 468 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 106 transition count 468
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p2 p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 22 factoid took 1116 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 231 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (841 resets) in 355 ms. (112 steps per ms) remains 2/10 properties
BEST_FIRST walk for 40003 steps (246 resets) in 146 ms. (272 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (254 resets) in 182 ms. (218 steps per ms) remains 2/2 properties
// Phase 1: matrix 468 rows 106 cols
[2024-06-01 15:07:22] [INFO ] Computed 17 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 72/97 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 9/106 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 468/574 variables, 106/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/574 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 123 constraints, problems are : Problem set: 0 solved, 2 unsolved in 328 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf9 is UNSAT
At refinement iteration 1 (OVERLAPS) 72/97 variables, 12/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Int declared 106/574 variables, and 17 constraints, problems are : Problem set: 2 solved, 0 unsolved in 55 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 0/106 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 407ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p1)), (G (OR p0 p2 p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (OR p2 p1))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (AND (OR p0 (NOT p2)) (OR p0 (NOT p1))))), (F (NOT p1)), (F (NOT (OR (NOT p0) p2 p1)))]
Knowledge based reduction with 24 factoid took 2585 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 177 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Support contains 25 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 468/468 transitions.
Applied a total of 0 rules in 12 ms. Remains 106 /106 variables (removed 0) and now considering 468/468 (removed 0) transitions.
[2024-06-01 15:07:26] [INFO ] Invariant cache hit.
[2024-06-01 15:07:26] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-06-01 15:07:26] [INFO ] Invariant cache hit.
[2024-06-01 15:07:27] [INFO ] Implicit Places using invariants and state equation in 1018 ms returned []
Implicit Place search using SMT with State Equation took 1270 ms to find 0 implicit places.
[2024-06-01 15:07:27] [INFO ] Redundant transitions in 3 ms returned []
Running 464 sub problems to find dead transitions.
[2024-06-01 15:07:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 17/106 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-01 15:07:33] [INFO ] Deduced a trap composed of 23 places in 261 ms of which 3 ms to minimize.
[2024-06-01 15:07:34] [INFO ] Deduced a trap composed of 27 places in 255 ms of which 3 ms to minimize.
[2024-06-01 15:07:34] [INFO ] Deduced a trap composed of 27 places in 214 ms of which 2 ms to minimize.
[2024-06-01 15:07:34] [INFO ] Deduced a trap composed of 26 places in 256 ms of which 2 ms to minimize.
[2024-06-01 15:07:34] [INFO ] Deduced a trap composed of 22 places in 207 ms of which 2 ms to minimize.
[2024-06-01 15:07:34] [INFO ] Deduced a trap composed of 34 places in 237 ms of which 2 ms to minimize.
[2024-06-01 15:07:35] [INFO ] Deduced a trap composed of 26 places in 301 ms of which 1 ms to minimize.
[2024-06-01 15:07:35] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 2 ms to minimize.
[2024-06-01 15:07:35] [INFO ] Deduced a trap composed of 25 places in 186 ms of which 2 ms to minimize.
[2024-06-01 15:07:36] [INFO ] Deduced a trap composed of 24 places in 226 ms of which 2 ms to minimize.
[2024-06-01 15:07:36] [INFO ] Deduced a trap composed of 24 places in 208 ms of which 2 ms to minimize.
[2024-06-01 15:07:36] [INFO ] Deduced a trap composed of 20 places in 239 ms of which 2 ms to minimize.
[2024-06-01 15:07:36] [INFO ] Deduced a trap composed of 31 places in 201 ms of which 1 ms to minimize.
[2024-06-01 15:07:36] [INFO ] Deduced a trap composed of 25 places in 182 ms of which 2 ms to minimize.
[2024-06-01 15:07:37] [INFO ] Deduced a trap composed of 26 places in 166 ms of which 2 ms to minimize.
[2024-06-01 15:07:37] [INFO ] Deduced a trap composed of 26 places in 187 ms of which 2 ms to minimize.
[2024-06-01 15:07:37] [INFO ] Deduced a trap composed of 26 places in 184 ms of which 2 ms to minimize.
[2024-06-01 15:07:37] [INFO ] Deduced a trap composed of 25 places in 185 ms of which 2 ms to minimize.
[2024-06-01 15:07:37] [INFO ] Deduced a trap composed of 21 places in 184 ms of which 2 ms to minimize.
[2024-06-01 15:07:38] [INFO ] Deduced a trap composed of 21 places in 206 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-01 15:07:41] [INFO ] Deduced a trap composed of 31 places in 224 ms of which 2 ms to minimize.
[2024-06-01 15:07:41] [INFO ] Deduced a trap composed of 22 places in 199 ms of which 1 ms to minimize.
[2024-06-01 15:07:41] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 1 ms to minimize.
[2024-06-01 15:07:41] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 2 ms to minimize.
[2024-06-01 15:07:42] [INFO ] Deduced a trap composed of 19 places in 173 ms of which 2 ms to minimize.
[2024-06-01 15:07:42] [INFO ] Deduced a trap composed of 25 places in 220 ms of which 2 ms to minimize.
[2024-06-01 15:07:42] [INFO ] Deduced a trap composed of 31 places in 245 ms of which 2 ms to minimize.
[2024-06-01 15:07:42] [INFO ] Deduced a trap composed of 31 places in 256 ms of which 2 ms to minimize.
[2024-06-01 15:07:43] [INFO ] Deduced a trap composed of 31 places in 238 ms of which 2 ms to minimize.
[2024-06-01 15:07:43] [INFO ] Deduced a trap composed of 18 places in 242 ms of which 2 ms to minimize.
[2024-06-01 15:07:43] [INFO ] Deduced a trap composed of 28 places in 252 ms of which 2 ms to minimize.
[2024-06-01 15:07:44] [INFO ] Deduced a trap composed of 21 places in 187 ms of which 2 ms to minimize.
[2024-06-01 15:07:44] [INFO ] Deduced a trap composed of 27 places in 203 ms of which 2 ms to minimize.
[2024-06-01 15:07:44] [INFO ] Deduced a trap composed of 26 places in 224 ms of which 3 ms to minimize.
[2024-06-01 15:07:44] [INFO ] Deduced a trap composed of 31 places in 225 ms of which 2 ms to minimize.
[2024-06-01 15:07:44] [INFO ] Deduced a trap composed of 24 places in 212 ms of which 1 ms to minimize.
[2024-06-01 15:07:45] [INFO ] Deduced a trap composed of 25 places in 214 ms of which 2 ms to minimize.
[2024-06-01 15:07:45] [INFO ] Deduced a trap composed of 24 places in 208 ms of which 2 ms to minimize.
[2024-06-01 15:07:45] [INFO ] Deduced a trap composed of 25 places in 267 ms of which 2 ms to minimize.
[2024-06-01 15:07:46] [INFO ] Deduced a trap composed of 27 places in 227 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-01 15:07:47] [INFO ] Deduced a trap composed of 21 places in 194 ms of which 2 ms to minimize.
[2024-06-01 15:07:47] [INFO ] Deduced a trap composed of 26 places in 248 ms of which 2 ms to minimize.
[2024-06-01 15:07:48] [INFO ] Deduced a trap composed of 26 places in 239 ms of which 2 ms to minimize.
[2024-06-01 15:07:48] [INFO ] Deduced a trap composed of 31 places in 226 ms of which 2 ms to minimize.
[2024-06-01 15:07:48] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 2 ms to minimize.
[2024-06-01 15:07:48] [INFO ] Deduced a trap composed of 24 places in 206 ms of which 2 ms to minimize.
[2024-06-01 15:07:48] [INFO ] Deduced a trap composed of 29 places in 175 ms of which 1 ms to minimize.
[2024-06-01 15:07:49] [INFO ] Deduced a trap composed of 22 places in 187 ms of which 2 ms to minimize.
[2024-06-01 15:07:49] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 1 ms to minimize.
[2024-06-01 15:07:49] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 2 ms to minimize.
[2024-06-01 15:07:49] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 1 ms to minimize.
[2024-06-01 15:07:49] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 1 ms to minimize.
[2024-06-01 15:07:49] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 1 ms to minimize.
[2024-06-01 15:07:50] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 1 ms to minimize.
[2024-06-01 15:07:50] [INFO ] Deduced a trap composed of 24 places in 213 ms of which 2 ms to minimize.
[2024-06-01 15:07:50] [INFO ] Deduced a trap composed of 25 places in 244 ms of which 2 ms to minimize.
[2024-06-01 15:07:50] [INFO ] Deduced a trap composed of 26 places in 240 ms of which 2 ms to minimize.
[2024-06-01 15:07:50] [INFO ] Deduced a trap composed of 25 places in 235 ms of which 2 ms to minimize.
[2024-06-01 15:07:51] [INFO ] Deduced a trap composed of 26 places in 239 ms of which 2 ms to minimize.
[2024-06-01 15:07:51] [INFO ] Deduced a trap composed of 31 places in 225 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-01 15:07:52] [INFO ] Deduced a trap composed of 24 places in 174 ms of which 2 ms to minimize.
[2024-06-01 15:07:52] [INFO ] Deduced a trap composed of 30 places in 230 ms of which 2 ms to minimize.
[2024-06-01 15:07:53] [INFO ] Deduced a trap composed of 27 places in 246 ms of which 3 ms to minimize.
[2024-06-01 15:07:53] [INFO ] Deduced a trap composed of 32 places in 267 ms of which 2 ms to minimize.
[2024-06-01 15:07:53] [INFO ] Deduced a trap composed of 32 places in 257 ms of which 2 ms to minimize.
[2024-06-01 15:07:54] [INFO ] Deduced a trap composed of 20 places in 273 ms of which 2 ms to minimize.
[2024-06-01 15:07:54] [INFO ] Deduced a trap composed of 23 places in 234 ms of which 3 ms to minimize.
[2024-06-01 15:07:54] [INFO ] Deduced a trap composed of 26 places in 248 ms of which 2 ms to minimize.
[2024-06-01 15:07:55] [INFO ] Deduced a trap composed of 28 places in 231 ms of which 2 ms to minimize.
[2024-06-01 15:07:55] [INFO ] Deduced a trap composed of 22 places in 210 ms of which 1 ms to minimize.
[2024-06-01 15:07:55] [INFO ] Deduced a trap composed of 22 places in 220 ms of which 2 ms to minimize.
[2024-06-01 15:07:55] [INFO ] Deduced a trap composed of 27 places in 172 ms of which 2 ms to minimize.
[2024-06-01 15:07:56] [INFO ] Deduced a trap composed of 21 places in 187 ms of which 4 ms to minimize.
[2024-06-01 15:07:56] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 1 ms to minimize.
[2024-06-01 15:07:56] [INFO ] Deduced a trap composed of 29 places in 181 ms of which 2 ms to minimize.
[2024-06-01 15:07:57] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 1 ms to minimize.
[2024-06-01 15:07:57] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 2 ms to minimize.
[2024-06-01 15:07:57] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 2 ms to minimize.
[2024-06-01 15:07:57] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 106/574 variables, and 96 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 0/106 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 79/79 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 17/106 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 79/96 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-01 15:08:02] [INFO ] Deduced a trap composed of 28 places in 232 ms of which 2 ms to minimize.
[2024-06-01 15:08:02] [INFO ] Deduced a trap composed of 20 places in 248 ms of which 2 ms to minimize.
[2024-06-01 15:08:03] [INFO ] Deduced a trap composed of 24 places in 239 ms of which 2 ms to minimize.
[2024-06-01 15:08:03] [INFO ] Deduced a trap composed of 24 places in 240 ms of which 2 ms to minimize.
[2024-06-01 15:08:03] [INFO ] Deduced a trap composed of 29 places in 232 ms of which 2 ms to minimize.
[2024-06-01 15:08:03] [INFO ] Deduced a trap composed of 23 places in 253 ms of which 2 ms to minimize.
[2024-06-01 15:08:04] [INFO ] Deduced a trap composed of 24 places in 251 ms of which 2 ms to minimize.
[2024-06-01 15:08:04] [INFO ] Deduced a trap composed of 25 places in 210 ms of which 2 ms to minimize.
[2024-06-01 15:08:04] [INFO ] Deduced a trap composed of 24 places in 211 ms of which 2 ms to minimize.
[2024-06-01 15:08:04] [INFO ] Deduced a trap composed of 24 places in 216 ms of which 2 ms to minimize.
[2024-06-01 15:08:05] [INFO ] Deduced a trap composed of 21 places in 260 ms of which 2 ms to minimize.
[2024-06-01 15:08:05] [INFO ] Deduced a trap composed of 20 places in 267 ms of which 2 ms to minimize.
[2024-06-01 15:08:05] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 2 ms to minimize.
[2024-06-01 15:08:06] [INFO ] Deduced a trap composed of 22 places in 242 ms of which 2 ms to minimize.
[2024-06-01 15:08:06] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 2 ms to minimize.
[2024-06-01 15:08:06] [INFO ] Deduced a trap composed of 28 places in 248 ms of which 3 ms to minimize.
[2024-06-01 15:08:06] [INFO ] Deduced a trap composed of 22 places in 244 ms of which 2 ms to minimize.
[2024-06-01 15:08:07] [INFO ] Deduced a trap composed of 28 places in 252 ms of which 2 ms to minimize.
[2024-06-01 15:08:07] [INFO ] Deduced a trap composed of 21 places in 239 ms of which 2 ms to minimize.
[2024-06-01 15:08:07] [INFO ] Deduced a trap composed of 28 places in 245 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-01 15:08:09] [INFO ] Deduced a trap composed of 24 places in 205 ms of which 2 ms to minimize.
[2024-06-01 15:08:09] [INFO ] Deduced a trap composed of 26 places in 246 ms of which 2 ms to minimize.
[2024-06-01 15:08:10] [INFO ] Deduced a trap composed of 22 places in 228 ms of which 2 ms to minimize.
[2024-06-01 15:08:10] [INFO ] Deduced a trap composed of 22 places in 251 ms of which 2 ms to minimize.
[2024-06-01 15:08:10] [INFO ] Deduced a trap composed of 22 places in 248 ms of which 2 ms to minimize.
[2024-06-01 15:08:10] [INFO ] Deduced a trap composed of 22 places in 206 ms of which 2 ms to minimize.
[2024-06-01 15:08:11] [INFO ] Deduced a trap composed of 21 places in 169 ms of which 1 ms to minimize.
[2024-06-01 15:08:11] [INFO ] Deduced a trap composed of 21 places in 177 ms of which 2 ms to minimize.
[2024-06-01 15:08:11] [INFO ] Deduced a trap composed of 22 places in 176 ms of which 2 ms to minimize.
[2024-06-01 15:08:12] [INFO ] Deduced a trap composed of 22 places in 161 ms of which 2 ms to minimize.
[2024-06-01 15:08:12] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 2 ms to minimize.
[2024-06-01 15:08:12] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 1 ms to minimize.
[2024-06-01 15:08:12] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 2 ms to minimize.
[2024-06-01 15:08:13] [INFO ] Deduced a trap composed of 22 places in 176 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 14/130 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-01 15:08:15] [INFO ] Deduced a trap composed of 20 places in 238 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-01 15:08:19] [INFO ] Deduced a trap composed of 22 places in 193 ms of which 2 ms to minimize.
[2024-06-01 15:08:19] [INFO ] Deduced a trap composed of 30 places in 254 ms of which 3 ms to minimize.
[2024-06-01 15:08:19] [INFO ] Deduced a trap composed of 22 places in 195 ms of which 2 ms to minimize.
[2024-06-01 15:08:20] [INFO ] Deduced a trap composed of 28 places in 246 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 4/135 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-01 15:08:23] [INFO ] Deduced a trap composed of 24 places in 234 ms of which 2 ms to minimize.
[2024-06-01 15:08:23] [INFO ] Deduced a trap composed of 24 places in 252 ms of which 2 ms to minimize.
[2024-06-01 15:08:23] [INFO ] Deduced a trap composed of 25 places in 245 ms of which 2 ms to minimize.
[2024-06-01 15:08:24] [INFO ] Deduced a trap composed of 25 places in 251 ms of which 2 ms to minimize.
[2024-06-01 15:08:24] [INFO ] Deduced a trap composed of 24 places in 208 ms of which 2 ms to minimize.
[2024-06-01 15:08:24] [INFO ] Deduced a trap composed of 28 places in 259 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 6/141 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-01 15:08:27] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 2 ms to minimize.
[2024-06-01 15:08:27] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 1 ms to minimize.
[2024-06-01 15:08:28] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 1 ms to minimize.
[2024-06-01 15:08:28] [INFO ] Deduced a trap composed of 30 places in 145 ms of which 1 ms to minimize.
SMT process timed out in 61071ms, After SMT, problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 61077ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62368 ms. Remains : 106/106 places, 468/468 transitions.
Computed a total of 106 stabilizing places and 468 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 106 transition count 468
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p2 p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 1063 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 206 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
RANDOM walk for 40002 steps (850 resets) in 210 ms. (189 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40002 steps (250 resets) in 219 ms. (181 steps per ms) remains 1/1 properties
[2024-06-01 15:08:30] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 72/97 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/106 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 468/574 variables, 106/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/574 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 123 constraints, problems are : Problem set: 0 solved, 1 unsolved in 291 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Int declared 97/574 variables, and 12 constraints, problems are : Problem set: 1 solved, 0 unsolved in 39 ms.
Refiners :[Generalized P Invariants (flows): 12/17 constraints, State Equation: 0/106 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 346ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p2 p0 p1))]
False Knowledge obtained : [(F (NOT (AND (OR (NOT p2) p0) (OR p0 (NOT p1))))), (F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p2 p1))), (F (NOT (OR p2 p0 (NOT p1))))]
Knowledge based reduction with 17 factoid took 2559 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 175 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 164 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Product exploration explored 100000 steps with 5530 reset in 845 ms.
Product exploration explored 100000 steps with 5553 reset in 518 ms.
Support contains 25 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 468/468 transitions.
Applied a total of 0 rules in 11 ms. Remains 106 /106 variables (removed 0) and now considering 468/468 (removed 0) transitions.
[2024-06-01 15:08:34] [INFO ] Invariant cache hit.
[2024-06-01 15:08:34] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-06-01 15:08:34] [INFO ] Invariant cache hit.
[2024-06-01 15:08:35] [INFO ] Implicit Places using invariants and state equation in 611 ms returned []
Implicit Place search using SMT with State Equation took 785 ms to find 0 implicit places.
[2024-06-01 15:08:35] [INFO ] Redundant transitions in 5 ms returned []
Running 464 sub problems to find dead transitions.
[2024-06-01 15:08:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 17/106 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-01 15:08:41] [INFO ] Deduced a trap composed of 23 places in 253 ms of which 2 ms to minimize.
[2024-06-01 15:08:41] [INFO ] Deduced a trap composed of 27 places in 187 ms of which 2 ms to minimize.
[2024-06-01 15:08:42] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 2 ms to minimize.
[2024-06-01 15:08:42] [INFO ] Deduced a trap composed of 26 places in 187 ms of which 2 ms to minimize.
[2024-06-01 15:08:42] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 1 ms to minimize.
[2024-06-01 15:08:42] [INFO ] Deduced a trap composed of 34 places in 132 ms of which 1 ms to minimize.
[2024-06-01 15:08:42] [INFO ] Deduced a trap composed of 26 places in 176 ms of which 2 ms to minimize.
[2024-06-01 15:08:43] [INFO ] Deduced a trap composed of 21 places in 173 ms of which 2 ms to minimize.
[2024-06-01 15:08:43] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 1 ms to minimize.
[2024-06-01 15:08:43] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 1 ms to minimize.
[2024-06-01 15:08:43] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 1 ms to minimize.
[2024-06-01 15:08:43] [INFO ] Deduced a trap composed of 20 places in 191 ms of which 2 ms to minimize.
[2024-06-01 15:08:44] [INFO ] Deduced a trap composed of 31 places in 173 ms of which 2 ms to minimize.
[2024-06-01 15:08:44] [INFO ] Deduced a trap composed of 25 places in 194 ms of which 2 ms to minimize.
[2024-06-01 15:08:44] [INFO ] Deduced a trap composed of 26 places in 191 ms of which 2 ms to minimize.
[2024-06-01 15:08:44] [INFO ] Deduced a trap composed of 26 places in 169 ms of which 2 ms to minimize.
[2024-06-01 15:08:44] [INFO ] Deduced a trap composed of 26 places in 263 ms of which 2 ms to minimize.
[2024-06-01 15:08:45] [INFO ] Deduced a trap composed of 25 places in 252 ms of which 2 ms to minimize.
[2024-06-01 15:08:45] [INFO ] Deduced a trap composed of 21 places in 239 ms of which 2 ms to minimize.
[2024-06-01 15:08:45] [INFO ] Deduced a trap composed of 21 places in 277 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-01 15:08:48] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 2 ms to minimize.
[2024-06-01 15:08:48] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 1 ms to minimize.
[2024-06-01 15:08:48] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 2 ms to minimize.
[2024-06-01 15:08:49] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 2 ms to minimize.
[2024-06-01 15:08:49] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 1 ms to minimize.
[2024-06-01 15:08:49] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 2 ms to minimize.
[2024-06-01 15:08:49] [INFO ] Deduced a trap composed of 31 places in 180 ms of which 1 ms to minimize.
[2024-06-01 15:08:49] [INFO ] Deduced a trap composed of 31 places in 205 ms of which 2 ms to minimize.
[2024-06-01 15:08:50] [INFO ] Deduced a trap composed of 31 places in 211 ms of which 2 ms to minimize.
[2024-06-01 15:08:50] [INFO ] Deduced a trap composed of 18 places in 206 ms of which 2 ms to minimize.
[2024-06-01 15:08:50] [INFO ] Deduced a trap composed of 28 places in 188 ms of which 2 ms to minimize.
[2024-06-01 15:08:50] [INFO ] Deduced a trap composed of 21 places in 174 ms of which 1 ms to minimize.
[2024-06-01 15:08:51] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 1 ms to minimize.
[2024-06-01 15:08:51] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 1 ms to minimize.
[2024-06-01 15:08:51] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 1 ms to minimize.
[2024-06-01 15:08:51] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 1 ms to minimize.
[2024-06-01 15:08:51] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 1 ms to minimize.
[2024-06-01 15:08:51] [INFO ] Deduced a trap composed of 24 places in 209 ms of which 2 ms to minimize.
[2024-06-01 15:08:52] [INFO ] Deduced a trap composed of 25 places in 281 ms of which 2 ms to minimize.
[2024-06-01 15:08:52] [INFO ] Deduced a trap composed of 27 places in 230 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-01 15:08:54] [INFO ] Deduced a trap composed of 21 places in 232 ms of which 2 ms to minimize.
[2024-06-01 15:08:54] [INFO ] Deduced a trap composed of 26 places in 252 ms of which 2 ms to minimize.
[2024-06-01 15:08:54] [INFO ] Deduced a trap composed of 26 places in 255 ms of which 1 ms to minimize.
[2024-06-01 15:08:54] [INFO ] Deduced a trap composed of 31 places in 225 ms of which 2 ms to minimize.
[2024-06-01 15:08:55] [INFO ] Deduced a trap composed of 26 places in 219 ms of which 1 ms to minimize.
[2024-06-01 15:08:55] [INFO ] Deduced a trap composed of 24 places in 174 ms of which 2 ms to minimize.
[2024-06-01 15:08:55] [INFO ] Deduced a trap composed of 29 places in 207 ms of which 2 ms to minimize.
[2024-06-01 15:08:55] [INFO ] Deduced a trap composed of 22 places in 207 ms of which 2 ms to minimize.
[2024-06-01 15:08:56] [INFO ] Deduced a trap composed of 20 places in 245 ms of which 2 ms to minimize.
[2024-06-01 15:08:56] [INFO ] Deduced a trap composed of 25 places in 202 ms of which 2 ms to minimize.
[2024-06-01 15:08:56] [INFO ] Deduced a trap composed of 24 places in 207 ms of which 2 ms to minimize.
[2024-06-01 15:08:56] [INFO ] Deduced a trap composed of 23 places in 218 ms of which 2 ms to minimize.
[2024-06-01 15:08:57] [INFO ] Deduced a trap composed of 24 places in 224 ms of which 2 ms to minimize.
[2024-06-01 15:08:57] [INFO ] Deduced a trap composed of 25 places in 230 ms of which 2 ms to minimize.
[2024-06-01 15:08:57] [INFO ] Deduced a trap composed of 24 places in 242 ms of which 2 ms to minimize.
[2024-06-01 15:08:57] [INFO ] Deduced a trap composed of 25 places in 252 ms of which 2 ms to minimize.
[2024-06-01 15:08:58] [INFO ] Deduced a trap composed of 26 places in 181 ms of which 2 ms to minimize.
[2024-06-01 15:08:58] [INFO ] Deduced a trap composed of 25 places in 224 ms of which 2 ms to minimize.
[2024-06-01 15:08:58] [INFO ] Deduced a trap composed of 26 places in 220 ms of which 2 ms to minimize.
[2024-06-01 15:08:58] [INFO ] Deduced a trap composed of 31 places in 232 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-01 15:09:00] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 2 ms to minimize.
[2024-06-01 15:09:00] [INFO ] Deduced a trap composed of 30 places in 184 ms of which 2 ms to minimize.
[2024-06-01 15:09:00] [INFO ] Deduced a trap composed of 27 places in 186 ms of which 2 ms to minimize.
[2024-06-01 15:09:00] [INFO ] Deduced a trap composed of 32 places in 209 ms of which 2 ms to minimize.
[2024-06-01 15:09:01] [INFO ] Deduced a trap composed of 32 places in 205 ms of which 2 ms to minimize.
[2024-06-01 15:09:01] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 1 ms to minimize.
[2024-06-01 15:09:01] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 2 ms to minimize.
[2024-06-01 15:09:01] [INFO ] Deduced a trap composed of 26 places in 236 ms of which 2 ms to minimize.
[2024-06-01 15:09:01] [INFO ] Deduced a trap composed of 28 places in 233 ms of which 2 ms to minimize.
[2024-06-01 15:09:02] [INFO ] Deduced a trap composed of 22 places in 238 ms of which 2 ms to minimize.
[2024-06-01 15:09:02] [INFO ] Deduced a trap composed of 22 places in 240 ms of which 2 ms to minimize.
[2024-06-01 15:09:02] [INFO ] Deduced a trap composed of 27 places in 260 ms of which 2 ms to minimize.
[2024-06-01 15:09:03] [INFO ] Deduced a trap composed of 21 places in 193 ms of which 1 ms to minimize.
[2024-06-01 15:09:03] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 1 ms to minimize.
[2024-06-01 15:09:03] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 2 ms to minimize.
[2024-06-01 15:09:03] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 1 ms to minimize.
[2024-06-01 15:09:03] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 1 ms to minimize.
[2024-06-01 15:09:03] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2024-06-01 15:09:04] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 19/96 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 106/574 variables, and 96 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 0/106 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 79/79 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 17/106 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 79/96 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-01 15:09:09] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 2 ms to minimize.
[2024-06-01 15:09:09] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 1 ms to minimize.
[2024-06-01 15:09:09] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 2 ms to minimize.
[2024-06-01 15:09:10] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 1 ms to minimize.
[2024-06-01 15:09:10] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 2 ms to minimize.
[2024-06-01 15:09:10] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 1 ms to minimize.
[2024-06-01 15:09:10] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 2 ms to minimize.
[2024-06-01 15:09:10] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 1 ms to minimize.
[2024-06-01 15:09:10] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 2 ms to minimize.
[2024-06-01 15:09:11] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 1 ms to minimize.
[2024-06-01 15:09:11] [INFO ] Deduced a trap composed of 21 places in 162 ms of which 2 ms to minimize.
[2024-06-01 15:09:11] [INFO ] Deduced a trap composed of 20 places in 163 ms of which 2 ms to minimize.
[2024-06-01 15:09:11] [INFO ] Deduced a trap composed of 32 places in 150 ms of which 2 ms to minimize.
[2024-06-01 15:09:11] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 2 ms to minimize.
[2024-06-01 15:09:12] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 1 ms to minimize.
[2024-06-01 15:09:12] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 1 ms to minimize.
[2024-06-01 15:09:12] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 1 ms to minimize.
[2024-06-01 15:09:12] [INFO ] Deduced a trap composed of 28 places in 150 ms of which 1 ms to minimize.
[2024-06-01 15:09:12] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 1 ms to minimize.
[2024-06-01 15:09:12] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-01 15:09:13] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 1 ms to minimize.
[2024-06-01 15:09:14] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 2 ms to minimize.
[2024-06-01 15:09:14] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 2 ms to minimize.
[2024-06-01 15:09:14] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 1 ms to minimize.
[2024-06-01 15:09:14] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 1 ms to minimize.
[2024-06-01 15:09:14] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 1 ms to minimize.
[2024-06-01 15:09:14] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 1 ms to minimize.
[2024-06-01 15:09:15] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 1 ms to minimize.
[2024-06-01 15:09:15] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 1 ms to minimize.
[2024-06-01 15:09:15] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 1 ms to minimize.
[2024-06-01 15:09:15] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 1 ms to minimize.
[2024-06-01 15:09:15] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-06-01 15:09:15] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2024-06-01 15:09:16] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 14/130 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-01 15:09:17] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-01 15:09:20] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 1 ms to minimize.
[2024-06-01 15:09:20] [INFO ] Deduced a trap composed of 30 places in 153 ms of which 1 ms to minimize.
[2024-06-01 15:09:20] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 1 ms to minimize.
[2024-06-01 15:09:20] [INFO ] Deduced a trap composed of 28 places in 143 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 4/135 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-01 15:09:22] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 1 ms to minimize.
[2024-06-01 15:09:22] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 1 ms to minimize.
[2024-06-01 15:09:23] [INFO ] Deduced a trap composed of 25 places in 145 ms of which 1 ms to minimize.
[2024-06-01 15:09:23] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 1 ms to minimize.
[2024-06-01 15:09:23] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 1 ms to minimize.
[2024-06-01 15:09:23] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 6/141 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-01 15:09:25] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 1 ms to minimize.
[2024-06-01 15:09:25] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 1 ms to minimize.
[2024-06-01 15:09:26] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 1 ms to minimize.
[2024-06-01 15:09:26] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 1 ms to minimize.
[2024-06-01 15:09:26] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 1 ms to minimize.
[2024-06-01 15:09:26] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 1 ms to minimize.
[2024-06-01 15:09:26] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 1 ms to minimize.
[2024-06-01 15:09:27] [INFO ] Deduced a trap composed of 25 places in 148 ms of which 2 ms to minimize.
[2024-06-01 15:09:27] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 9/150 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-01 15:09:29] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 1 ms to minimize.
[2024-06-01 15:09:29] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 1 ms to minimize.
[2024-06-01 15:09:29] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 1 ms to minimize.
[2024-06-01 15:09:29] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 1 ms to minimize.
[2024-06-01 15:09:29] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 2 ms to minimize.
[2024-06-01 15:09:30] [INFO ] Deduced a trap composed of 28 places in 147 ms of which 2 ms to minimize.
[2024-06-01 15:09:30] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 1 ms to minimize.
[2024-06-01 15:09:30] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 1 ms to minimize.
[2024-06-01 15:09:30] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 9/159 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-01 15:09:32] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 1 ms to minimize.
[2024-06-01 15:09:33] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-06-01 15:09:35] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 1 ms to minimize.
[2024-06-01 15:09:35] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 3 ms to minimize.
[2024-06-01 15:09:35] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 1 ms to minimize.
[2024-06-01 15:09:35] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 1 ms to minimize.
[2024-06-01 15:09:36] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 1 ms to minimize.
[2024-06-01 15:09:36] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 2 ms to minimize.
[2024-06-01 15:09:36] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 1 ms to minimize.
[2024-06-01 15:09:36] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 2 ms to minimize.
[2024-06-01 15:09:36] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 106/574 variables, and 170 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 0/106 constraints, PredecessorRefiner: 0/464 constraints, Known Traps: 153/153 constraints]
After SMT, in 61264ms problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 61273ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62085 ms. Remains : 106/106 places, 468/468 transitions.
Treatment of property PermAdmissibility-PT-02-LTLCardinality-03 finished in 137358 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)))'
[2024-06-01 15:09:37] [INFO ] Flatten gal took : 55 ms
[2024-06-01 15:09:37] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 15:09:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 130 places, 592 transitions and 3152 arcs took 9 ms.
Total runtime 341852 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : PermAdmissibility-PT-02-LTLCardinality-02
FORMULA PermAdmissibility-PT-02-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : PermAdmissibility-PT-02-LTLCardinality-12

BK_STOP 1717255116334

--------------------
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 PermAdmissibility-PT-02-LTLCardinality-02
ltl formula formula --ltl=/tmp/3204/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 130 places, 592 transitions and 3152 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.080 real 0.020 user 0.030 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3204/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3204/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3204/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3204/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 105 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 131, there are 596 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( 2/ 4): ~33 levels ~10000 states ~20108 transitions
pnml2lts-mc( 2/ 4): ~33 levels ~20000 states ~42536 transitions
pnml2lts-mc( 2/ 4): ~33 levels ~40000 states ~103644 transitions
pnml2lts-mc( 3/ 4): ~33 levels ~80000 states ~171344 transitions
pnml2lts-mc( 3/ 4): ~33 levels ~160000 states ~385040 transitions
pnml2lts-mc( 3/ 4): ~33 levels ~320000 states ~814816 transitions
pnml2lts-mc( 3/ 4): ~33 levels ~640000 states ~1759672 transitions
pnml2lts-mc( 3/ 4): ~33 levels ~1280000 states ~4320884 transitions
pnml2lts-mc( 3/ 4): ~33 levels ~2560000 states ~9739684 transitions
pnml2lts-mc( 3/ 4): ~33 levels ~5120000 states ~19930908 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 9770582
pnml2lts-mc( 0/ 4): unique states count: 9770690
pnml2lts-mc( 0/ 4): unique transitions count: 40076909
pnml2lts-mc( 0/ 4): - self-loop count: 30903
pnml2lts-mc( 0/ 4): - claim dead count: 30275007
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 9770694
pnml2lts-mc( 0/ 4): - cum. max stack depth: 132
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 9770694 states 40076931 transitions, fanout: 4.102
pnml2lts-mc( 0/ 4): Total exploration time 89.560 sec (89.530 sec minimum, 89.543 sec on average)
pnml2lts-mc( 0/ 4): States per second: 109097, Transitions per second: 447487
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 138.5MB, 14.9 B/state, compr.: 2.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 29.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 604 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 138.5MB (~256.0MB paged-in)
ltl formula name PermAdmissibility-PT-02-LTLCardinality-03
ltl formula formula --ltl=/tmp/3204/ltl_1_
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 130 places, 592 transitions and 3152 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.070 real 0.010 user 0.030 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3204/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3204/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3204/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3204/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 106 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 131, there are 605 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( 2/ 4): ~22 levels ~10000 states ~16652 transitions
pnml2lts-mc( 2/ 4): ~22 levels ~20000 states ~28068 transitions
pnml2lts-mc( 2/ 4): ~22 levels ~40000 states ~51748 transitions
pnml2lts-mc( 2/ 4): ~22 levels ~80000 states ~107964 transitions
pnml2lts-mc( 2/ 4): ~22 levels ~160000 states ~207132 transitions
pnml2lts-mc( 2/ 4): ~22 levels ~320000 states ~414452 transitions
pnml2lts-mc( 2/ 4): ~22 levels ~640000 states ~823928 transitions
pnml2lts-mc( 0/ 4): ~22 levels ~1280000 states ~1693472 transitions
pnml2lts-mc( 1/ 4): ~22 levels ~2560000 states ~3430932 transitions
pnml2lts-mc( 0/ 4): ~22 levels ~5120000 states ~6981108 transitions
pnml2lts-mc( 0/ 4): ~22 levels ~10240000 states ~13538956 transitions
pnml2lts-mc( 0/ 4): ~22 levels ~20480000 states ~27821248 transitions
pnml2lts-mc( 2/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33553930
pnml2lts-mc( 0/ 4): unique states count: 33554002
pnml2lts-mc( 0/ 4): unique transitions count: 47688339
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 14133910
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33554007
pnml2lts-mc( 0/ 4): - cum. max stack depth: 88
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33554007 states 47688392 transitions, fanout: 1.421
pnml2lts-mc( 0/ 4): Total exploration time 338.050 sec (337.950 sec minimum, 337.995 sec on average)
pnml2lts-mc( 0/ 4): States per second: 99258, Transitions per second: 141069
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 264.1MB, 8.3 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/12.0%
pnml2lts-mc( 0/ 4): Stored 604 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 264.1MB (~256.0MB paged-in)
ltl formula name PermAdmissibility-PT-02-LTLCardinality-12
ltl formula formula --ltl=/tmp/3204/ltl_2_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 130 places, 592 transitions and 3152 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.070 real 0.000 user 0.040 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3204/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3204/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3204/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3204/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 105 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 131, there are 596 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( 2/ 4): ~33 levels ~10000 states ~24496 transitions
pnml2lts-mc( 0/ 4): ~33 levels ~20000 states ~50848 transitions
pnml2lts-mc( 1/ 4): ~33 levels ~40000 states ~116292 transitions
pnml2lts-mc( 1/ 4): ~33 levels ~80000 states ~241424 transitions
pnml2lts-mc( 1/ 4): ~33 levels ~160000 states ~492048 transitions
pnml2lts-mc( 1/ 4): ~33 levels ~320000 states ~1007248 transitions
pnml2lts-mc( 1/ 4): ~33 levels ~640000 states ~2017456 transitions
pnml2lts-mc( 1/ 4): ~33 levels ~1280000 states ~4176116 transitions
pnml2lts-mc( 1/ 4): ~33 levels ~2560000 states ~8399572 transitions
pnml2lts-mc( 1/ 4): ~33 levels ~5120000 states ~16746924 transitions
pnml2lts-mc( 1/ 4): ~33 levels ~10240000 states ~36545736 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 12860083
pnml2lts-mc( 0/ 4): unique states count: 12860181
pnml2lts-mc( 0/ 4): unique transitions count: 45401336
pnml2lts-mc( 0/ 4): - self-loop count: 27677
pnml2lts-mc( 0/ 4): - claim dead count: 32513115
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 12860184
pnml2lts-mc( 0/ 4): - cum. max stack depth: 132
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 12860184 states 45401348 transitions, fanout: 3.530
pnml2lts-mc( 0/ 4): Total exploration time 109.330 sec (109.250 sec minimum, 109.283 sec on average)
pnml2lts-mc( 0/ 4): States per second: 117627, Transitions per second: 415269
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 162.1MB, 13.2 B/state, compr.: 2.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 38.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 604 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 162.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="PermAdmissibility-PT-02"
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 PermAdmissibility-PT-02, 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 r512-smll-171654407000163"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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