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.r476-tall-171620505200108.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 CANInsertWithFailure-PT-020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505200108
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.1M
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 172K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 12 08:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 12 08:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 2.6M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717186755190

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-020
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:19:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 20:19:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:19:16] [INFO ] Load time of PNML (sax parser for PT used): 294 ms
[2024-05-31 20:19:16] [INFO ] Transformed 1044 places.
[2024-05-31 20:19:16] [INFO ] Transformed 2520 transitions.
[2024-05-31 20:19:16] [INFO ] Parsed PT model containing 1044 places and 2520 transitions and 6800 arcs in 415 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-020-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-020-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-020-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-020-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 1044 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1044/1044 places, 2520/2520 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1043 transition count 2520
Applied a total of 1 rules in 112 ms. Remains 1043 /1044 variables (removed 1) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2024-05-31 20:19:17] [INFO ] Computed 22 invariants in 82 ms
[2024-05-31 20:19:17] [INFO ] Implicit Places using invariants in 528 ms returned []
[2024-05-31 20:19:17] [INFO ] Invariant cache hit.
[2024-05-31 20:19:18] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-31 20:19:20] [INFO ] Implicit Places using invariants and state equation in 2736 ms returned []
Implicit Place search using SMT with State Equation took 3303 ms to find 0 implicit places.
Running 2500 sub problems to find dead transitions.
[2024-05-31 20:19:20] [INFO ] Invariant cache hit.
[2024-05-31 20:19:20] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1042 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2500 unsolved
SMT process timed out in 31124ms, After SMT, problems are : Problem set: 0 solved, 2500 unsolved
Search for dead transitions found 0 dead transitions in 31167ms
Starting structural reductions in LTL mode, iteration 1 : 1043/1044 places, 2520/2520 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34624 ms. Remains : 1043/1044 places, 2520/2520 transitions.
Support contains 37 out of 1043 places after structural reductions.
[2024-05-31 20:19:51] [INFO ] Flatten gal took : 153 ms
[2024-05-31 20:19:52] [INFO ] Flatten gal took : 91 ms
[2024-05-31 20:19:52] [INFO ] Input system was already deterministic with 2520 transitions.
Support contains 35 out of 1043 places (down from 37) after GAL structural reductions.
RANDOM walk for 40000 steps (86 resets) in 2091 ms. (19 steps per ms) remains 2/26 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 101 ms. (392 steps per ms) remains 1/2 properties
[2024-05-31 20:19:53] [INFO ] Invariant cache hit.
[2024-05-31 20:19:53] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1000/1003 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:19:53] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 11 ms to minimize.
[2024-05-31 20:19:53] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 2 ms to minimize.
[2024-05-31 20:19:53] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2024-05-31 20:19:53] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 2 ms to minimize.
[2024-05-31 20:19:53] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:19:53] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:19:53] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2024-05-31 20:19:53] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:19:53] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2024-05-31 20:19:53] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:19:53] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:19:53] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2024-05-31 20:19:54] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2024-05-31 20:19:54] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1003 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 36/1039 variables, 18/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1039 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1041 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:19:54] [INFO ] Deduced a trap composed of 70 places in 411 ms of which 6 ms to minimize.
[2024-05-31 20:19:55] [INFO ] Deduced a trap composed of 55 places in 469 ms of which 6 ms to minimize.
[2024-05-31 20:19:55] [INFO ] Deduced a trap composed of 46 places in 386 ms of which 5 ms to minimize.
[2024-05-31 20:19:55] [INFO ] Deduced a trap composed of 55 places in 365 ms of which 5 ms to minimize.
[2024-05-31 20:19:56] [INFO ] Deduced a trap composed of 45 places in 343 ms of which 5 ms to minimize.
[2024-05-31 20:19:56] [INFO ] Deduced a trap composed of 46 places in 293 ms of which 4 ms to minimize.
[2024-05-31 20:19:56] [INFO ] Deduced a trap composed of 41 places in 283 ms of which 4 ms to minimize.
[2024-05-31 20:19:57] [INFO ] Deduced a trap composed of 51 places in 280 ms of which 5 ms to minimize.
[2024-05-31 20:19:57] [INFO ] Deduced a trap composed of 41 places in 253 ms of which 4 ms to minimize.
[2024-05-31 20:19:57] [INFO ] Deduced a trap composed of 44 places in 265 ms of which 4 ms to minimize.
[2024-05-31 20:19:57] [INFO ] Deduced a trap composed of 49 places in 223 ms of which 4 ms to minimize.
[2024-05-31 20:19:58] [INFO ] Deduced a trap composed of 43 places in 196 ms of which 4 ms to minimize.
SMT process timed out in 5206ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 139 rules applied. Total rules applied 139 place count 1043 transition count 2381
Reduce places removed 139 places and 0 transitions.
Iterating post reduction 1 with 139 rules applied. Total rules applied 278 place count 904 transition count 2381
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: 379
Deduced a syphon composed of 379 places in 1 ms
Reduce places removed 379 places and 0 transitions.
Iterating global reduction 2 with 758 rules applied. Total rules applied 1036 place count 525 transition count 2002
Drop transitions (Redundant composition of simpler transitions.) removed 342 transitions
Redundant transition composition rules discarded 342 transitions
Iterating global reduction 2 with 342 rules applied. Total rules applied 1378 place count 525 transition count 1660
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1380 place count 525 transition count 1658
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1382 place count 523 transition count 1658
Partial Free-agglomeration rule applied 420 times.
Drop transitions (Partial Free agglomeration) removed 420 transitions
Iterating global reduction 3 with 420 rules applied. Total rules applied 1802 place count 523 transition count 1658
Applied a total of 1802 rules in 333 ms. Remains 523 /1043 variables (removed 520) and now considering 1658/2520 (removed 862) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 334 ms. Remains : 523/1043 places, 1658/2520 transitions.
RANDOM walk for 40000 steps (421 resets) in 348 ms. (114 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (16 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 475552 steps, run timeout after 3001 ms. (steps per millisecond=158 ) properties seen :0 out of 1
Probabilistic random walk after 475552 steps, saw 60802 distinct states, run finished after 3004 ms. (steps per millisecond=158 ) properties seen :0
// Phase 1: matrix 1658 rows 523 cols
[2024-05-31 20:20:01] [INFO ] Computed 22 invariants in 23 ms
[2024-05-31 20:20:01] [INFO ] State equation strengthened by 1595 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 480/483 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:20:01] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/483 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/483 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 36/519 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/521 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:20:02] [INFO ] Deduced a trap composed of 30 places in 223 ms of which 3 ms to minimize.
[2024-05-31 20:20:02] [INFO ] Deduced a trap composed of 26 places in 204 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/521 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/521 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1658/2179 variables, 521/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2179 variables, 1595/2141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2179 variables, 0/2141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/2181 variables, 2/2143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2181 variables, 0/2143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2181 variables, 0/2143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2181/2181 variables, and 2143 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1179 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 523/523 constraints, ReadFeed: 1595/1595 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 480/483 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/483 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:20:03] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-05-31 20:20:03] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-05-31 20:20:03] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-05-31 20:20:03] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
[2024-05-31 20:20:03] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-05-31 20:20:03] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
[2024-05-31 20:20:03] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-31 20:20:03] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
[2024-05-31 20:20:03] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
[2024-05-31 20:20:03] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-31 20:20:03] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-31 20:20:03] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-31 20:20:03] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
[2024-05-31 20:20:03] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-31 20:20:03] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/483 variables, 15/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 36/519 variables, 18/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/519 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/521 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/521 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:20:03] [INFO ] Deduced a trap composed of 30 places in 177 ms of which 3 ms to minimize.
[2024-05-31 20:20:03] [INFO ] Deduced a trap composed of 26 places in 181 ms of which 3 ms to minimize.
[2024-05-31 20:20:04] [INFO ] Deduced a trap composed of 26 places in 193 ms of which 3 ms to minimize.
[2024-05-31 20:20:04] [INFO ] Deduced a trap composed of 25 places in 182 ms of which 3 ms to minimize.
[2024-05-31 20:20:04] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 3 ms to minimize.
[2024-05-31 20:20:04] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 3 ms to minimize.
[2024-05-31 20:20:04] [INFO ] Deduced a trap composed of 28 places in 169 ms of which 3 ms to minimize.
[2024-05-31 20:20:04] [INFO ] Deduced a trap composed of 30 places in 137 ms of which 2 ms to minimize.
[2024-05-31 20:20:05] [INFO ] Deduced a trap composed of 29 places in 150 ms of which 2 ms to minimize.
[2024-05-31 20:20:05] [INFO ] Deduced a trap composed of 28 places in 144 ms of which 3 ms to minimize.
[2024-05-31 20:20:05] [INFO ] Deduced a trap composed of 30 places in 135 ms of which 2 ms to minimize.
[2024-05-31 20:20:05] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 2 ms to minimize.
[2024-05-31 20:20:05] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 3 ms to minimize.
[2024-05-31 20:20:05] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 2 ms to minimize.
[2024-05-31 20:20:05] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 2 ms to minimize.
[2024-05-31 20:20:06] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 2 ms to minimize.
[2024-05-31 20:20:06] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 2 ms to minimize.
[2024-05-31 20:20:06] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 2 ms to minimize.
[2024-05-31 20:20:06] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
[2024-05-31 20:20:06] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/521 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:20:06] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 2 ms to minimize.
[2024-05-31 20:20:06] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 2 ms to minimize.
[2024-05-31 20:20:06] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2024-05-31 20:20:06] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-05-31 20:20:07] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/521 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/521 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1658/2179 variables, 521/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2179 variables, 1595/2181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2179 variables, 1/2182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2179 variables, 0/2182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/2181 variables, 2/2184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2181 variables, 0/2184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2181 variables, 0/2184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2181/2181 variables, and 2184 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4792 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 523/523 constraints, ReadFeed: 1595/1595 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 43/43 constraints]
After SMT, in 6030ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 3 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1658/1658 transitions.
Applied a total of 0 rules in 48 ms. Remains 523 /523 variables (removed 0) and now considering 1658/1658 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 523/523 places, 1658/1658 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1658/1658 transitions.
Applied a total of 0 rules in 31 ms. Remains 523 /523 variables (removed 0) and now considering 1658/1658 (removed 0) transitions.
[2024-05-31 20:20:07] [INFO ] Invariant cache hit.
[2024-05-31 20:20:08] [INFO ] Implicit Places using invariants in 375 ms returned []
[2024-05-31 20:20:08] [INFO ] Invariant cache hit.
[2024-05-31 20:20:08] [INFO ] State equation strengthened by 1595 read => feed constraints.
[2024-05-31 20:20:12] [INFO ] Implicit Places using invariants and state equation in 4453 ms returned []
Implicit Place search using SMT with State Equation took 4830 ms to find 0 implicit places.
[2024-05-31 20:20:12] [INFO ] Redundant transitions in 116 ms returned []
Running 1638 sub problems to find dead transitions.
[2024-05-31 20:20:12] [INFO ] Invariant cache hit.
[2024-05-31 20:20:12] [INFO ] State equation strengthened by 1595 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/522 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/522 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
[2024-05-31 20:20:26] [INFO ] Deduced a trap composed of 2 places in 222 ms of which 3 ms to minimize.
[2024-05-31 20:20:26] [INFO ] Deduced a trap composed of 25 places in 199 ms of which 3 ms to minimize.
[2024-05-31 20:20:27] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 2 ms to minimize.
[2024-05-31 20:20:27] [INFO ] Deduced a trap composed of 28 places in 186 ms of which 2 ms to minimize.
[2024-05-31 20:20:27] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 3 ms to minimize.
[2024-05-31 20:20:27] [INFO ] Deduced a trap composed of 30 places in 158 ms of which 2 ms to minimize.
[2024-05-31 20:20:27] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 2 ms to minimize.
[2024-05-31 20:20:27] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 2 ms to minimize.
[2024-05-31 20:20:28] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 3 ms to minimize.
[2024-05-31 20:20:28] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 2 ms to minimize.
[2024-05-31 20:20:28] [INFO ] Deduced a trap composed of 30 places in 134 ms of which 2 ms to minimize.
[2024-05-31 20:20:28] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 2 ms to minimize.
[2024-05-31 20:20:28] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 2 ms to minimize.
[2024-05-31 20:20:28] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 2 ms to minimize.
[2024-05-31 20:20:28] [INFO ] Deduced a trap composed of 29 places in 138 ms of which 2 ms to minimize.
[2024-05-31 20:20:29] [INFO ] Deduced a trap composed of 29 places in 140 ms of which 2 ms to minimize.
[2024-05-31 20:20:29] [INFO ] Deduced a trap composed of 42 places in 155 ms of which 2 ms to minimize.
[2024-05-31 20:20:29] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 2 ms to minimize.
[2024-05-31 20:20:29] [INFO ] Deduced a trap composed of 29 places in 154 ms of which 4 ms to minimize.
[2024-05-31 20:20:29] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/522 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
[2024-05-31 20:20:30] [INFO ] Deduced a trap composed of 25 places in 199 ms of which 5 ms to minimize.
[2024-05-31 20:20:30] [INFO ] Deduced a trap composed of 26 places in 171 ms of which 3 ms to minimize.
[2024-05-31 20:20:30] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 3 ms to minimize.
[2024-05-31 20:20:30] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 2 ms to minimize.
[2024-05-31 20:20:30] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 3 ms to minimize.
[2024-05-31 20:20:30] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 3 ms to minimize.
[2024-05-31 20:20:31] [INFO ] Deduced a trap composed of 26 places in 143 ms of which 2 ms to minimize.
[2024-05-31 20:20:31] [INFO ] Deduced a trap composed of 29 places in 143 ms of which 2 ms to minimize.
[2024-05-31 20:20:31] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 2 ms to minimize.
[2024-05-31 20:20:31] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 2 ms to minimize.
[2024-05-31 20:20:31] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 2 ms to minimize.
[2024-05-31 20:20:31] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 2 ms to minimize.
[2024-05-31 20:20:31] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2024-05-31 20:20:32] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 2 ms to minimize.
[2024-05-31 20:20:32] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2024-05-31 20:20:32] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 3 ms to minimize.
[2024-05-31 20:20:32] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-31 20:20:32] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 2 ms to minimize.
[2024-05-31 20:20:32] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-31 20:20:32] [INFO ] Deduced a trap composed of 25 places in 215 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/522 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 522/2181 variables, and 62 constraints, problems are : Problem set: 0 solved, 1638 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/523 constraints, ReadFeed: 0/1595 constraints, PredecessorRefiner: 1638/1638 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1638 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/522 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/522 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/522 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
[2024-05-31 20:20:45] [INFO ] Deduced a trap composed of 33 places in 146 ms of which 3 ms to minimize.
[2024-05-31 20:20:45] [INFO ] Deduced a trap composed of 25 places in 139 ms of which 2 ms to minimize.
[2024-05-31 20:20:45] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 2 ms to minimize.
[2024-05-31 20:20:45] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 2 ms to minimize.
[2024-05-31 20:20:45] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 2 ms to minimize.
[2024-05-31 20:20:46] [INFO ] Deduced a trap composed of 28 places in 154 ms of which 2 ms to minimize.
[2024-05-31 20:20:46] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 3 ms to minimize.
[2024-05-31 20:20:46] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 2 ms to minimize.
[2024-05-31 20:20:46] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 1 ms to minimize.
[2024-05-31 20:20:46] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 2 ms to minimize.
[2024-05-31 20:20:46] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 1 ms to minimize.
[2024-05-31 20:20:46] [INFO ] Deduced a trap composed of 30 places in 138 ms of which 2 ms to minimize.
[2024-05-31 20:20:47] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 2 ms to minimize.
[2024-05-31 20:20:47] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 2 ms to minimize.
[2024-05-31 20:20:47] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 2 ms to minimize.
[2024-05-31 20:20:47] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 2 ms to minimize.
[2024-05-31 20:20:47] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 2 ms to minimize.
[2024-05-31 20:20:47] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 2 ms to minimize.
[2024-05-31 20:20:47] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 2 ms to minimize.
[2024-05-31 20:20:48] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/522 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
[2024-05-31 20:20:48] [INFO ] Deduced a trap composed of 29 places in 170 ms of which 3 ms to minimize.
[2024-05-31 20:20:48] [INFO ] Deduced a trap composed of 28 places in 162 ms of which 3 ms to minimize.
[2024-05-31 20:20:48] [INFO ] Deduced a trap composed of 30 places in 153 ms of which 2 ms to minimize.
[2024-05-31 20:20:49] [INFO ] Deduced a trap composed of 29 places in 153 ms of which 2 ms to minimize.
[2024-05-31 20:20:49] [INFO ] Deduced a trap composed of 30 places in 153 ms of which 3 ms to minimize.
[2024-05-31 20:20:49] [INFO ] Deduced a trap composed of 34 places in 157 ms of which 2 ms to minimize.
[2024-05-31 20:20:49] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 2 ms to minimize.
[2024-05-31 20:20:49] [INFO ] Deduced a trap composed of 29 places in 144 ms of which 2 ms to minimize.
[2024-05-31 20:20:49] [INFO ] Deduced a trap composed of 26 places in 143 ms of which 2 ms to minimize.
[2024-05-31 20:20:50] [INFO ] Deduced a trap composed of 30 places in 135 ms of which 2 ms to minimize.
[2024-05-31 20:20:50] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 2 ms to minimize.
[2024-05-31 20:20:50] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 2 ms to minimize.
[2024-05-31 20:20:50] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 2 ms to minimize.
[2024-05-31 20:20:50] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 2 ms to minimize.
[2024-05-31 20:20:50] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 2 ms to minimize.
[2024-05-31 20:20:50] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 1 ms to minimize.
[2024-05-31 20:20:50] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 1 ms to minimize.
[2024-05-31 20:20:51] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 2 ms to minimize.
[2024-05-31 20:20:51] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 1 ms to minimize.
[2024-05-31 20:20:51] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
[2024-05-31 20:20:51] [INFO ] Deduced a trap composed of 26 places in 161 ms of which 2 ms to minimize.
[2024-05-31 20:20:51] [INFO ] Deduced a trap composed of 26 places in 140 ms of which 1 ms to minimize.
[2024-05-31 20:20:52] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 2 ms to minimize.
[2024-05-31 20:20:52] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 2 ms to minimize.
[2024-05-31 20:20:52] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 1 ms to minimize.
[2024-05-31 20:20:52] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 1 ms to minimize.
[2024-05-31 20:20:52] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 1 ms to minimize.
[2024-05-31 20:20:52] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 1 ms to minimize.
[2024-05-31 20:20:52] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 1 ms to minimize.
[2024-05-31 20:20:52] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2024-05-31 20:20:53] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-05-31 20:20:53] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-05-31 20:20:53] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-05-31 20:20:53] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-31 20:20:53] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 1 ms to minimize.
[2024-05-31 20:20:53] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-05-31 20:20:53] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 2 ms to minimize.
[2024-05-31 20:20:53] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-31 20:20:53] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-05-31 20:20:53] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
[2024-05-31 20:20:54] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 2 ms to minimize.
[2024-05-31 20:20:54] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 1 ms to minimize.
[2024-05-31 20:20:54] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 2 ms to minimize.
[2024-05-31 20:20:54] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
[2024-05-31 20:20:54] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 2 ms to minimize.
[2024-05-31 20:20:54] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 2 ms to minimize.
[2024-05-31 20:20:54] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 1 ms to minimize.
[2024-05-31 20:20:55] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 2 ms to minimize.
[2024-05-31 20:20:55] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 2 ms to minimize.
[2024-05-31 20:20:55] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 2 ms to minimize.
[2024-05-31 20:20:55] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 2 ms to minimize.
[2024-05-31 20:20:55] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:20:55] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2024-05-31 20:20:55] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 2 ms to minimize.
[2024-05-31 20:20:55] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 1 ms to minimize.
[2024-05-31 20:20:56] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 1 ms to minimize.
[2024-05-31 20:20:56] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 2 ms to minimize.
[2024-05-31 20:20:56] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 1 ms to minimize.
[2024-05-31 20:20:56] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 1 ms to minimize.
[2024-05-31 20:20:56] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
[2024-05-31 20:20:56] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 2 ms to minimize.
[2024-05-31 20:20:57] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 3 ms to minimize.
[2024-05-31 20:20:57] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 3 ms to minimize.
[2024-05-31 20:20:57] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 2 ms to minimize.
[2024-05-31 20:20:57] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 3 ms to minimize.
[2024-05-31 20:20:57] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 2 ms to minimize.
[2024-05-31 20:20:57] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 2 ms to minimize.
[2024-05-31 20:20:57] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 1 ms to minimize.
[2024-05-31 20:20:58] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 2 ms to minimize.
[2024-05-31 20:20:58] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 2 ms to minimize.
[2024-05-31 20:20:58] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 1 ms to minimize.
[2024-05-31 20:20:58] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 1 ms to minimize.
[2024-05-31 20:20:58] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 2 ms to minimize.
[2024-05-31 20:20:58] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 1 ms to minimize.
[2024-05-31 20:20:58] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
[2024-05-31 20:20:58] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2024-05-31 20:20:58] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-05-31 20:20:59] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-31 20:20:59] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-05-31 20:20:59] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/522 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
[2024-05-31 20:20:59] [INFO ] Deduced a trap composed of 25 places in 196 ms of which 3 ms to minimize.
[2024-05-31 20:20:59] [INFO ] Deduced a trap composed of 30 places in 186 ms of which 3 ms to minimize.
[2024-05-31 20:21:00] [INFO ] Deduced a trap composed of 29 places in 178 ms of which 4 ms to minimize.
[2024-05-31 20:21:00] [INFO ] Deduced a trap composed of 29 places in 176 ms of which 3 ms to minimize.
[2024-05-31 20:21:00] [INFO ] Deduced a trap composed of 29 places in 167 ms of which 2 ms to minimize.
[2024-05-31 20:21:00] [INFO ] Deduced a trap composed of 27 places in 169 ms of which 2 ms to minimize.
[2024-05-31 20:21:00] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 3 ms to minimize.
[2024-05-31 20:21:01] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 2 ms to minimize.
[2024-05-31 20:21:01] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 2 ms to minimize.
[2024-05-31 20:21:01] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 2 ms to minimize.
[2024-05-31 20:21:01] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 2 ms to minimize.
[2024-05-31 20:21:01] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 2 ms to minimize.
[2024-05-31 20:21:01] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 1 ms to minimize.
[2024-05-31 20:21:01] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 1 ms to minimize.
[2024-05-31 20:21:01] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-05-31 20:21:02] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
[2024-05-31 20:21:02] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-05-31 20:21:02] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2024-05-31 20:21:02] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-05-31 20:21:02] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/522 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
[2024-05-31 20:21:03] [INFO ] Deduced a trap composed of 30 places in 186 ms of which 3 ms to minimize.
[2024-05-31 20:21:03] [INFO ] Deduced a trap composed of 32 places in 177 ms of which 3 ms to minimize.
[2024-05-31 20:21:03] [INFO ] Deduced a trap composed of 31 places in 192 ms of which 3 ms to minimize.
[2024-05-31 20:21:03] [INFO ] Deduced a trap composed of 31 places in 193 ms of which 3 ms to minimize.
[2024-05-31 20:21:03] [INFO ] Deduced a trap composed of 33 places in 177 ms of which 3 ms to minimize.
[2024-05-31 20:21:03] [INFO ] Deduced a trap composed of 25 places in 174 ms of which 3 ms to minimize.
[2024-05-31 20:21:04] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 3 ms to minimize.
[2024-05-31 20:21:04] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 2 ms to minimize.
[2024-05-31 20:21:04] [INFO ] Deduced a trap composed of 26 places in 150 ms of which 2 ms to minimize.
[2024-05-31 20:21:04] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 2 ms to minimize.
[2024-05-31 20:21:04] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 2 ms to minimize.
[2024-05-31 20:21:04] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 2 ms to minimize.
[2024-05-31 20:21:05] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 2 ms to minimize.
[2024-05-31 20:21:05] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 2 ms to minimize.
[2024-05-31 20:21:05] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 2 ms to minimize.
[2024-05-31 20:21:05] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 2 ms to minimize.
[2024-05-31 20:21:05] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 2 ms to minimize.
[2024-05-31 20:21:05] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 1 ms to minimize.
[2024-05-31 20:21:05] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 2 ms to minimize.
[2024-05-31 20:21:05] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/522 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
[2024-05-31 20:21:06] [INFO ] Deduced a trap composed of 25 places in 188 ms of which 3 ms to minimize.
[2024-05-31 20:21:06] [INFO ] Deduced a trap composed of 27 places in 176 ms of which 3 ms to minimize.
[2024-05-31 20:21:07] [INFO ] Deduced a trap composed of 25 places in 184 ms of which 3 ms to minimize.
[2024-05-31 20:21:07] [INFO ] Deduced a trap composed of 26 places in 168 ms of which 3 ms to minimize.
[2024-05-31 20:21:07] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 2 ms to minimize.
[2024-05-31 20:21:07] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 3 ms to minimize.
[2024-05-31 20:21:07] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 3 ms to minimize.
[2024-05-31 20:21:07] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 2 ms to minimize.
[2024-05-31 20:21:07] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 3 ms to minimize.
[2024-05-31 20:21:08] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 2 ms to minimize.
[2024-05-31 20:21:08] [INFO ] Deduced a trap composed of 28 places in 155 ms of which 3 ms to minimize.
[2024-05-31 20:21:08] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 2 ms to minimize.
[2024-05-31 20:21:08] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 2 ms to minimize.
[2024-05-31 20:21:08] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 2 ms to minimize.
[2024-05-31 20:21:08] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 2 ms to minimize.
[2024-05-31 20:21:08] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 1 ms to minimize.
[2024-05-31 20:21:09] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 2 ms to minimize.
[2024-05-31 20:21:09] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 2 ms to minimize.
[2024-05-31 20:21:09] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 1 ms to minimize.
[2024-05-31 20:21:09] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/522 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
[2024-05-31 20:21:10] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 2 ms to minimize.
[2024-05-31 20:21:10] [INFO ] Deduced a trap composed of 28 places in 150 ms of which 2 ms to minimize.
[2024-05-31 20:21:10] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 1 ms to minimize.
[2024-05-31 20:21:10] [INFO ] Deduced a trap composed of 40 places in 127 ms of which 2 ms to minimize.
[2024-05-31 20:21:10] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 1 ms to minimize.
[2024-05-31 20:21:11] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 2 ms to minimize.
[2024-05-31 20:21:11] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 2 ms to minimize.
[2024-05-31 20:21:11] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 2 ms to minimize.
[2024-05-31 20:21:11] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 1 ms to minimize.
[2024-05-31 20:21:11] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 2 ms to minimize.
[2024-05-31 20:21:11] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 2 ms to minimize.
[2024-05-31 20:21:12] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 1 ms to minimize.
[2024-05-31 20:21:12] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 1 ms to minimize.
[2024-05-31 20:21:12] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 1 ms to minimize.
[2024-05-31 20:21:12] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 1 ms to minimize.
[2024-05-31 20:21:12] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 2 ms to minimize.
[2024-05-31 20:21:12] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 2 ms to minimize.
[2024-05-31 20:21:12] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 2 ms to minimize.
[2024-05-31 20:21:12] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 2 ms to minimize.
[2024-05-31 20:21:13] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/522 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 522/2181 variables, and 242 constraints, problems are : Problem set: 0 solved, 1638 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/523 constraints, ReadFeed: 0/1595 constraints, PredecessorRefiner: 0/1638 constraints, Known Traps: 220/220 constraints]
After SMT, in 60996ms problems are : Problem set: 0 solved, 1638 unsolved
Search for dead transitions found 0 dead transitions in 61013ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66005 ms. Remains : 523/523 places, 1658/1658 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1531 edges and 523 vertex of which 437 / 523 are part of one of the 2 SCC in 3 ms
Free SCC test removed 435 places
Drop transitions (Empty/Sink Transition effects.) removed 1154 transitions
Ensure Unique test removed 409 transitions
Reduce isomorphic transitions removed 1563 transitions.
Graph (complete) has 217 edges and 88 vertex of which 31 are kept as prefixes of interest. Removing 57 places using SCC suffix rule.0 ms
Discarding 57 places :
Also discarding 18 output transitions
Drop transitions (Output transitions of discarded places.) removed 18 transitions
Drop transitions (Empty/Sink Transition effects.) removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 41 place count 31 transition count 38
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 59 place count 13 transition count 20
Iterating global reduction 1 with 18 rules applied. Total rules applied 77 place count 13 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 79 place count 12 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 82 place count 12 transition count 16
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 84 place count 12 transition count 14
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 87 place count 10 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 9 transition count 12
Applied a total of 88 rules in 24 ms. Remains 9 /523 variables (removed 514) and now considering 12/1658 (removed 1646) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 12 rows 9 cols
[2024-05-31 20:21:13] [INFO ] Computed 1 invariants in 0 ms
[2024-05-31 20:21:13] [INFO ] [Real]Absence check using 1 positive place invariants in 11 ms returned sat
[2024-05-31 20:21:13] [INFO ] After 7ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 20:21:13] [INFO ] After 39ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-05-31 20:21:13] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 187 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CANInsertWithFailure-PT-020-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CANInsertWithFailure-PT-020-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 82 stabilizing places and 140 stable transitions
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((F(p1)&&p0)))&&(G(p2)||X(p3))))'
Support contains 6 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 22 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2024-05-31 20:21:14] [INFO ] Computed 22 invariants in 35 ms
[2024-05-31 20:21:15] [INFO ] Implicit Places using invariants in 631 ms returned []
[2024-05-31 20:21:15] [INFO ] Invariant cache hit.
[2024-05-31 20:21:15] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-31 20:21:18] [INFO ] Implicit Places using invariants and state equation in 3689 ms returned []
Implicit Place search using SMT with State Equation took 4339 ms to find 0 implicit places.
Running 2500 sub problems to find dead transitions.
[2024-05-31 20:21:18] [INFO ] Invariant cache hit.
[2024-05-31 20:21:18] [INFO ] State equation strengthened by 780 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1042 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2500 unsolved
SMT process timed out in 30896ms, After SMT, problems are : Problem set: 0 solved, 2500 unsolved
Search for dead transitions found 0 dead transitions in 30925ms
Finished structural reductions in LTL mode , in 1 iterations and 35306 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 381 ms :[(OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1)), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p1), true, (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-01
Stuttering criterion allowed to conclude after 968 steps with 1 reset in 31 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-01 finished in 35802 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 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 139 rules applied. Total rules applied 139 place count 1043 transition count 2381
Reduce places removed 139 places and 0 transitions.
Iterating post reduction 1 with 139 rules applied. Total rules applied 278 place count 904 transition count 2381
Performed 380 Post agglomeration using F-continuation condition.Transition count delta: 380
Deduced a syphon composed of 380 places in 2 ms
Reduce places removed 380 places and 0 transitions.
Iterating global reduction 2 with 760 rules applied. Total rules applied 1038 place count 524 transition count 2001
Drop transitions (Redundant composition of simpler transitions.) removed 342 transitions
Redundant transition composition rules discarded 342 transitions
Iterating global reduction 2 with 342 rules applied. Total rules applied 1380 place count 524 transition count 1659
Applied a total of 1380 rules in 155 ms. Remains 524 /1043 variables (removed 519) and now considering 1659/2520 (removed 861) transitions.
// Phase 1: matrix 1659 rows 524 cols
[2024-05-31 20:21:50] [INFO ] Computed 22 invariants in 27 ms
[2024-05-31 20:21:50] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-05-31 20:21:50] [INFO ] Invariant cache hit.
[2024-05-31 20:21:50] [INFO ] State equation strengthened by 1178 read => feed constraints.
[2024-05-31 20:21:52] [INFO ] Implicit Places using invariants and state equation in 1817 ms returned []
Implicit Place search using SMT with State Equation took 2065 ms to find 0 implicit places.
[2024-05-31 20:21:52] [INFO ] Redundant transitions in 82 ms returned []
Running 1639 sub problems to find dead transitions.
[2024-05-31 20:21:52] [INFO ] Invariant cache hit.
[2024-05-31 20:21:52] [INFO ] State equation strengthened by 1178 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/523 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/523 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-31 20:22:06] [INFO ] Deduced a trap composed of 2 places in 198 ms of which 3 ms to minimize.
[2024-05-31 20:22:06] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-05-31 20:22:06] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-05-31 20:22:06] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2024-05-31 20:22:06] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-05-31 20:22:06] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-05-31 20:22:06] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 2 ms to minimize.
[2024-05-31 20:22:06] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-31 20:22:06] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-31 20:22:06] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-31 20:22:06] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:22:06] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-31 20:22:06] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:22:07] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 2 ms to minimize.
[2024-05-31 20:22:07] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 2 ms to minimize.
[2024-05-31 20:22:07] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 1 ms to minimize.
[2024-05-31 20:22:07] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2024-05-31 20:22:07] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2024-05-31 20:22:07] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2024-05-31 20:22:07] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/523 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-31 20:22:08] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 1 ms to minimize.
[2024-05-31 20:22:08] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 2 ms to minimize.
[2024-05-31 20:22:08] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 2 ms to minimize.
[2024-05-31 20:22:08] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 2 ms to minimize.
[2024-05-31 20:22:08] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 2 ms to minimize.
[2024-05-31 20:22:08] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 2 ms to minimize.
[2024-05-31 20:22:08] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 2 ms to minimize.
[2024-05-31 20:22:09] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 1 ms to minimize.
[2024-05-31 20:22:09] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 1 ms to minimize.
[2024-05-31 20:22:09] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 1 ms to minimize.
[2024-05-31 20:22:09] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 1 ms to minimize.
[2024-05-31 20:22:09] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-05-31 20:22:09] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 2 ms to minimize.
[2024-05-31 20:22:09] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2024-05-31 20:22:09] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2024-05-31 20:22:09] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-05-31 20:22:09] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-31 20:22:09] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-31 20:22:09] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 0 ms to minimize.
[2024-05-31 20:22:10] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 17.0)
(s1 1.0)
(s3 0.0)
(s4 1.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 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 1.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/523 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 523/2183 variables, and 62 constraints, problems are : Problem set: 0 solved, 1639 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/524 constraints, ReadFeed: 0/1178 constraints, PredecessorRefiner: 1639/1639 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1639 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/523 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/523 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/523 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-31 20:22:24] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:22:24] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 0 ms to minimize.
[2024-05-31 20:22:24] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:22:24] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-05-31 20:22:24] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-31 20:22:24] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2024-05-31 20:22:24] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:22:25] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 0 ms to minimize.
[2024-05-31 20:22:25] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 0 ms to minimize.
[2024-05-31 20:22:25] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-31 20:22:26] [INFO ] Deduced a trap composed of 27 places in 250 ms of which 3 ms to minimize.
[2024-05-31 20:22:26] [INFO ] Deduced a trap composed of 33 places in 228 ms of which 3 ms to minimize.
[2024-05-31 20:22:26] [INFO ] Deduced a trap composed of 26 places in 233 ms of which 3 ms to minimize.
[2024-05-31 20:22:26] [INFO ] Deduced a trap composed of 26 places in 223 ms of which 3 ms to minimize.
[2024-05-31 20:22:27] [INFO ] Deduced a trap composed of 26 places in 230 ms of which 3 ms to minimize.
[2024-05-31 20:22:27] [INFO ] Deduced a trap composed of 26 places in 217 ms of which 3 ms to minimize.
[2024-05-31 20:22:27] [INFO ] Deduced a trap composed of 29 places in 226 ms of which 3 ms to minimize.
[2024-05-31 20:22:27] [INFO ] Deduced a trap composed of 26 places in 229 ms of which 3 ms to minimize.
[2024-05-31 20:22:28] [INFO ] Deduced a trap composed of 26 places in 227 ms of which 3 ms to minimize.
[2024-05-31 20:22:28] [INFO ] Deduced a trap composed of 28 places in 235 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/523 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-31 20:22:28] [INFO ] Deduced a trap composed of 29 places in 182 ms of which 3 ms to minimize.
[2024-05-31 20:22:29] [INFO ] Deduced a trap composed of 31 places in 206 ms of which 3 ms to minimize.
[2024-05-31 20:22:29] [INFO ] Deduced a trap composed of 26 places in 210 ms of which 2 ms to minimize.
[2024-05-31 20:22:29] [INFO ] Deduced a trap composed of 27 places in 205 ms of which 2 ms to minimize.
[2024-05-31 20:22:29] [INFO ] Deduced a trap composed of 26 places in 231 ms of which 3 ms to minimize.
[2024-05-31 20:22:30] [INFO ] Deduced a trap composed of 30 places in 201 ms of which 3 ms to minimize.
[2024-05-31 20:22:30] [INFO ] Deduced a trap composed of 30 places in 198 ms of which 3 ms to minimize.
[2024-05-31 20:22:30] [INFO ] Deduced a trap composed of 26 places in 191 ms of which 3 ms to minimize.
[2024-05-31 20:22:30] [INFO ] Deduced a trap composed of 26 places in 182 ms of which 3 ms to minimize.
[2024-05-31 20:22:30] [INFO ] Deduced a trap composed of 26 places in 191 ms of which 3 ms to minimize.
[2024-05-31 20:22:31] [INFO ] Deduced a trap composed of 26 places in 193 ms of which 2 ms to minimize.
[2024-05-31 20:22:31] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 3 ms to minimize.
[2024-05-31 20:22:31] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 2 ms to minimize.
[2024-05-31 20:22:31] [INFO ] Deduced a trap composed of 28 places in 162 ms of which 2 ms to minimize.
[2024-05-31 20:22:31] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 2 ms to minimize.
[2024-05-31 20:22:31] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 2 ms to minimize.
[2024-05-31 20:22:32] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 2 ms to minimize.
[2024-05-31 20:22:32] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 2 ms to minimize.
[2024-05-31 20:22:32] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 2 ms to minimize.
[2024-05-31 20:22:32] [INFO ] Deduced a trap composed of 28 places in 179 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/523 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-31 20:22:33] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 1 ms to minimize.
[2024-05-31 20:22:33] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 2 ms to minimize.
[2024-05-31 20:22:33] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 2 ms to minimize.
[2024-05-31 20:22:33] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 1 ms to minimize.
[2024-05-31 20:22:33] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 2 ms to minimize.
[2024-05-31 20:22:34] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 2 ms to minimize.
[2024-05-31 20:22:34] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 2 ms to minimize.
[2024-05-31 20:22:34] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 3 ms to minimize.
[2024-05-31 20:22:34] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 2 ms to minimize.
[2024-05-31 20:22:34] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 2 ms to minimize.
[2024-05-31 20:22:34] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 2 ms to minimize.
[2024-05-31 20:22:34] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 1 ms to minimize.
[2024-05-31 20:22:35] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 2 ms to minimize.
[2024-05-31 20:22:35] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 2 ms to minimize.
[2024-05-31 20:22:35] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 2 ms to minimize.
[2024-05-31 20:22:35] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2024-05-31 20:22:35] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 1 ms to minimize.
[2024-05-31 20:22:35] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 2 ms to minimize.
[2024-05-31 20:22:35] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 2 ms to minimize.
[2024-05-31 20:22:35] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/523 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-31 20:22:36] [INFO ] Deduced a trap composed of 43 places in 133 ms of which 2 ms to minimize.
[2024-05-31 20:22:36] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 2 ms to minimize.
[2024-05-31 20:22:36] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 7 ms to minimize.
[2024-05-31 20:22:36] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 1 ms to minimize.
[2024-05-31 20:22:36] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 2 ms to minimize.
[2024-05-31 20:22:36] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
[2024-05-31 20:22:36] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 1 ms to minimize.
[2024-05-31 20:22:37] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 1 ms to minimize.
[2024-05-31 20:22:37] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-05-31 20:22:37] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2024-05-31 20:22:37] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 2 ms to minimize.
[2024-05-31 20:22:37] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 2 ms to minimize.
[2024-05-31 20:22:37] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-31 20:22:37] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-31 20:22:37] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:22:37] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:22:37] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-05-31 20:22:37] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-31 20:22:38] [INFO ] Deduced a trap composed of 30 places in 197 ms of which 3 ms to minimize.
[2024-05-31 20:22:38] [INFO ] Deduced a trap composed of 29 places in 183 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-31 20:22:39] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 2 ms to minimize.
[2024-05-31 20:22:39] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 1 ms to minimize.
[2024-05-31 20:22:39] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 2 ms to minimize.
[2024-05-31 20:22:39] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 3 ms to minimize.
[2024-05-31 20:22:39] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 2 ms to minimize.
[2024-05-31 20:22:39] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 2 ms to minimize.
[2024-05-31 20:22:40] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
[2024-05-31 20:22:40] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 2 ms to minimize.
[2024-05-31 20:22:40] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 1 ms to minimize.
[2024-05-31 20:22:40] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 1 ms to minimize.
[2024-05-31 20:22:40] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 2 ms to minimize.
[2024-05-31 20:22:40] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 1 ms to minimize.
[2024-05-31 20:22:40] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 2 ms to minimize.
[2024-05-31 20:22:40] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 2 ms to minimize.
[2024-05-31 20:22:40] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 1 ms to minimize.
[2024-05-31 20:22:41] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 1 ms to minimize.
[2024-05-31 20:22:41] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 1 ms to minimize.
[2024-05-31 20:22:41] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2024-05-31 20:22:41] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2024-05-31 20:22:41] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/523 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-31 20:22:42] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 1 ms to minimize.
[2024-05-31 20:22:42] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 1 ms to minimize.
[2024-05-31 20:22:42] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 1 ms to minimize.
[2024-05-31 20:22:42] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 1 ms to minimize.
[2024-05-31 20:22:42] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 1 ms to minimize.
[2024-05-31 20:22:42] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 2 ms to minimize.
[2024-05-31 20:22:42] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 1 ms to minimize.
[2024-05-31 20:22:42] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 2 ms to minimize.
[2024-05-31 20:22:42] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 2 ms to minimize.
[2024-05-31 20:22:43] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2024-05-31 20:22:43] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
[2024-05-31 20:22:43] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
[2024-05-31 20:22:43] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-05-31 20:22:43] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 2 ms to minimize.
[2024-05-31 20:22:43] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 2 ms to minimize.
[2024-05-31 20:22:43] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-05-31 20:22:43] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2024-05-31 20:22:43] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-05-31 20:22:43] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 3 ms to minimize.
[2024-05-31 20:22:43] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/523 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-31 20:22:44] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-05-31 20:22:44] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:22:44] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 0 ms to minimize.
[2024-05-31 20:22:44] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-05-31 20:22:45] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-31 20:22:45] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-31 20:22:45] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:22:45] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 0 ms to minimize.
[2024-05-31 20:22:45] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2024-05-31 20:22:45] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:22:45] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:22:45] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-31 20:22:45] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-31 20:22:45] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-05-31 20:22:45] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-31 20:22:45] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:22:45] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-31 20:22:45] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:22:45] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:22:45] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/523 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-31 20:22:46] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-31 20:22:46] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 0 ms to minimize.
[2024-05-31 20:22:46] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:22:46] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-05-31 20:22:46] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-05-31 20:22:46] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-31 20:22:47] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:22:47] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 0 ms to minimize.
[2024-05-31 20:22:47] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 0 ms to minimize.
[2024-05-31 20:22:47] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 0 ms to minimize.
[2024-05-31 20:22:47] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:22:47] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 0 ms to minimize.
[2024-05-31 20:22:47] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-31 20:22:47] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
[2024-05-31 20:22:47] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-05-31 20:22:47] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-31 20:22:47] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 0 ms to minimize.
[2024-05-31 20:22:47] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 2 ms to minimize.
[2024-05-31 20:22:47] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-05-31 20:22:47] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/523 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-31 20:22:48] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 1 ms to minimize.
[2024-05-31 20:22:48] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2024-05-31 20:22:48] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-31 20:22:48] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-05-31 20:22:49] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2024-05-31 20:22:49] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2024-05-31 20:22:49] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-05-31 20:22:49] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-31 20:22:49] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-05-31 20:22:49] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2024-05-31 20:22:49] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-05-31 20:22:49] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-31 20:22:49] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 1 ms to minimize.
[2024-05-31 20:22:49] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 2 ms to minimize.
[2024-05-31 20:22:49] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2024-05-31 20:22:49] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-05-31 20:22:50] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-31 20:22:50] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:22:50] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-05-31 20:22:50] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/523 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-31 20:22:51] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 1 ms to minimize.
[2024-05-31 20:22:51] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2024-05-31 20:22:51] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 3 ms to minimize.
[2024-05-31 20:22:51] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-05-31 20:22:51] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-05-31 20:22:51] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 1 ms to minimize.
[2024-05-31 20:22:51] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2024-05-31 20:22:51] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:22:51] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 1 ms to minimize.
[2024-05-31 20:22:52] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2024-05-31 20:22:52] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 2 ms to minimize.
[2024-05-31 20:22:52] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 0 ms to minimize.
[2024-05-31 20:22:52] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-05-31 20:22:52] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-31 20:22:52] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 0 ms to minimize.
[2024-05-31 20:22:52] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 2 ms to minimize.
[2024-05-31 20:22:52] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 1 ms to minimize.
[2024-05-31 20:22:52] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-05-31 20:22:52] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-05-31 20:22:52] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/523 variables, 20/262 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 523/2183 variables, and 262 constraints, problems are : Problem set: 0 solved, 1639 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/524 constraints, ReadFeed: 0/1178 constraints, PredecessorRefiner: 0/1639 constraints, Known Traps: 240/240 constraints]
After SMT, in 60649ms problems are : Problem set: 0 solved, 1639 unsolved
Search for dead transitions found 0 dead transitions in 60666ms
Starting structural reductions in SI_LTL mode, iteration 1 : 524/1043 places, 1659/2520 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62981 ms. Remains : 524/1043 places, 1659/2520 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-06
Product exploration explored 100000 steps with 963 reset in 500 ms.
Stack based approach found an accepted trace after 18831 steps with 184 reset with depth 109 and stack size 109 in 95 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-06 finished in 63640 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(p1)||p0)))))'
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 21 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2024-05-31 20:22:53] [INFO ] Computed 22 invariants in 38 ms
[2024-05-31 20:22:54] [INFO ] Implicit Places using invariants in 347 ms returned []
[2024-05-31 20:22:54] [INFO ] Invariant cache hit.
[2024-05-31 20:22:54] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-31 20:22:57] [INFO ] Implicit Places using invariants and state equation in 3403 ms returned []
Implicit Place search using SMT with State Equation took 3753 ms to find 0 implicit places.
Running 2500 sub problems to find dead transitions.
[2024-05-31 20:22:57] [INFO ] Invariant cache hit.
[2024-05-31 20:22:57] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1042 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2500 unsolved
SMT process timed out in 30846ms, After SMT, problems are : Problem set: 0 solved, 2500 unsolved
Search for dead transitions found 0 dead transitions in 30866ms
Finished structural reductions in LTL mode , in 1 iterations and 34650 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-07
Product exploration explored 100000 steps with 33333 reset in 483 ms.
Product exploration explored 100000 steps with 33333 reset in 433 ms.
Computed a total of 82 stabilizing places and 140 stable transitions
Computed a total of 82 stabilizing places and 140 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 19 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-020-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-07 finished in 35816 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&(X(p1)||G(p2))))'
Support contains 5 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 20 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
[2024-05-31 20:23:29] [INFO ] Invariant cache hit.
[2024-05-31 20:23:29] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-31 20:23:30] [INFO ] Invariant cache hit.
[2024-05-31 20:23:30] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-31 20:23:33] [INFO ] Implicit Places using invariants and state equation in 3335 ms returned []
Implicit Place search using SMT with State Equation took 3655 ms to find 0 implicit places.
Running 2500 sub problems to find dead transitions.
[2024-05-31 20:23:33] [INFO ] Invariant cache hit.
[2024-05-31 20:23:33] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1042 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2500 unsolved
SMT process timed out in 30896ms, After SMT, problems are : Problem set: 0 solved, 2500 unsolved
Search for dead transitions found 0 dead transitions in 30922ms
Finished structural reductions in LTL mode , in 1 iterations and 34607 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-08
Stuttering criterion allowed to conclude after 560 steps with 0 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-08 finished in 34856 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)&&X(G(p2))))'
Support contains 6 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 20 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
[2024-05-31 20:24:04] [INFO ] Invariant cache hit.
[2024-05-31 20:24:04] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-05-31 20:24:04] [INFO ] Invariant cache hit.
[2024-05-31 20:24:05] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-31 20:24:08] [INFO ] Implicit Places using invariants and state equation in 3668 ms returned []
Implicit Place search using SMT with State Equation took 3982 ms to find 0 implicit places.
Running 2500 sub problems to find dead transitions.
[2024-05-31 20:24:08] [INFO ] Invariant cache hit.
[2024-05-31 20:24:08] [INFO ] State equation strengthened by 780 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1042 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2500 unsolved
SMT process timed out in 30879ms, After SMT, problems are : Problem set: 0 solved, 2500 unsolved
Search for dead transitions found 0 dead transitions in 30901ms
Finished structural reductions in LTL mode , in 1 iterations and 34920 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), true]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-10
Entered a terminal (fully accepting) state of product in 704 steps with 1 reset in 3 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-10 finished in 35118 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||G(p1)||(p2&&G(!p1)))))'
Support contains 4 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 1043 transition count 2382
Reduce places removed 138 places and 0 transitions.
Iterating post reduction 1 with 138 rules applied. Total rules applied 276 place count 905 transition count 2382
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 276 place count 905 transition count 2381
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 278 place count 904 transition count 2381
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: 379
Deduced a syphon composed of 379 places in 0 ms
Reduce places removed 379 places and 0 transitions.
Iterating global reduction 2 with 758 rules applied. Total rules applied 1036 place count 525 transition count 2002
Drop transitions (Redundant composition of simpler transitions.) removed 342 transitions
Redundant transition composition rules discarded 342 transitions
Iterating global reduction 2 with 342 rules applied. Total rules applied 1378 place count 525 transition count 1660
Applied a total of 1378 rules in 112 ms. Remains 525 /1043 variables (removed 518) and now considering 1660/2520 (removed 860) transitions.
// Phase 1: matrix 1660 rows 525 cols
[2024-05-31 20:24:39] [INFO ] Computed 22 invariants in 12 ms
[2024-05-31 20:24:40] [INFO ] Implicit Places using invariants in 588 ms returned []
[2024-05-31 20:24:40] [INFO ] Invariant cache hit.
[2024-05-31 20:24:40] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2024-05-31 20:24:42] [INFO ] Implicit Places using invariants and state equation in 1790 ms returned []
Implicit Place search using SMT with State Equation took 2384 ms to find 0 implicit places.
[2024-05-31 20:24:42] [INFO ] Redundant transitions in 33 ms returned []
Running 1640 sub problems to find dead transitions.
[2024-05-31 20:24:42] [INFO ] Invariant cache hit.
[2024-05-31 20:24:42] [INFO ] State equation strengthened by 1177 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/524 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/524 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-31 20:24:55] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:24:55] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-31 20:24:56] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:24:56] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-31 20:24:56] [INFO ] Deduced a trap composed of 3 places in 174 ms of which 3 ms to minimize.
[2024-05-31 20:24:56] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-05-31 20:24:56] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2024-05-31 20:24:56] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2024-05-31 20:24:56] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2024-05-31 20:24:56] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2024-05-31 20:24:56] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2024-05-31 20:24:56] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 2 ms to minimize.
[2024-05-31 20:24:56] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:24:56] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 2 ms to minimize.
[2024-05-31 20:24:57] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:24:57] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-05-31 20:24:57] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:24:57] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:24:57] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:24:57] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/524 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-31 20:24:57] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-31 20:24:58] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-31 20:24:58] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 0 ms to minimize.
[2024-05-31 20:24:58] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:24:58] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:24:58] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-05-31 20:24:58] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-31 20:24:58] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:24:58] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:24:58] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-31 20:24:58] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 1 ms to minimize.
[2024-05-31 20:24:58] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 1 ms to minimize.
[2024-05-31 20:24:58] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 2 ms to minimize.
[2024-05-31 20:24:58] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 1 ms to minimize.
[2024-05-31 20:24:59] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 1 ms to minimize.
[2024-05-31 20:24:59] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2024-05-31 20:24:59] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 1 ms to minimize.
[2024-05-31 20:24:59] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 1 ms to minimize.
[2024-05-31 20:24:59] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 2 ms to minimize.
[2024-05-31 20:24:59] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/524 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 524/2185 variables, and 62 constraints, problems are : Problem set: 0 solved, 1640 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/525 constraints, ReadFeed: 0/1177 constraints, PredecessorRefiner: 1640/1640 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1640 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/524 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/524 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/524 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-31 20:25:14] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:25:14] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-05-31 20:25:14] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-05-31 20:25:14] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-31 20:25:14] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 1 ms to minimize.
[2024-05-31 20:25:14] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 0 ms to minimize.
[2024-05-31 20:25:14] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2024-05-31 20:25:14] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 0 ms to minimize.
[2024-05-31 20:25:15] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2024-05-31 20:25:15] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:25:15] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 0 ms to minimize.
[2024-05-31 20:25:15] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-05-31 20:25:15] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:25:15] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:25:15] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 0 ms to minimize.
[2024-05-31 20:25:15] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-05-31 20:25:15] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-05-31 20:25:15] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-31 20:25:15] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-31 20:25:15] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/524 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-31 20:25:16] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 1 ms to minimize.
[2024-05-31 20:25:16] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 1 ms to minimize.
[2024-05-31 20:25:16] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 2 ms to minimize.
[2024-05-31 20:25:16] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 1 ms to minimize.
[2024-05-31 20:25:16] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-05-31 20:25:16] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 1 ms to minimize.
[2024-05-31 20:25:17] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-31 20:25:17] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2024-05-31 20:25:17] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2024-05-31 20:25:17] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-05-31 20:25:17] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
[2024-05-31 20:25:17] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2024-05-31 20:25:17] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 1 ms to minimize.
[2024-05-31 20:25:17] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 2 ms to minimize.
[2024-05-31 20:25:17] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 2 ms to minimize.
[2024-05-31 20:25:17] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 1 ms to minimize.
[2024-05-31 20:25:18] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 1 ms to minimize.
[2024-05-31 20:25:18] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 1 ms to minimize.
[2024-05-31 20:25:18] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 2 ms to minimize.
[2024-05-31 20:25:18] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/524 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-31 20:25:18] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
[2024-05-31 20:25:18] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2024-05-31 20:25:18] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 2 ms to minimize.
[2024-05-31 20:25:19] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
[2024-05-31 20:25:19] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 1 ms to minimize.
[2024-05-31 20:25:19] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 4 ms to minimize.
[2024-05-31 20:25:19] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-05-31 20:25:19] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 2 ms to minimize.
[2024-05-31 20:25:19] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 2 ms to minimize.
[2024-05-31 20:25:19] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-31 20:25:19] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:25:19] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-31 20:25:19] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-31 20:25:20] [INFO ] Deduced a trap composed of 28 places in 196 ms of which 3 ms to minimize.
[2024-05-31 20:25:20] [INFO ] Deduced a trap composed of 26 places in 205 ms of which 3 ms to minimize.
[2024-05-31 20:25:20] [INFO ] Deduced a trap composed of 26 places in 202 ms of which 3 ms to minimize.
[2024-05-31 20:25:20] [INFO ] Deduced a trap composed of 29 places in 198 ms of which 3 ms to minimize.
[2024-05-31 20:25:21] [INFO ] Deduced a trap composed of 32 places in 200 ms of which 3 ms to minimize.
[2024-05-31 20:25:21] [INFO ] Deduced a trap composed of 32 places in 204 ms of which 3 ms to minimize.
[2024-05-31 20:25:21] [INFO ] Deduced a trap composed of 26 places in 201 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-31 20:25:22] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 1 ms to minimize.
[2024-05-31 20:25:22] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2024-05-31 20:25:22] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 2 ms to minimize.
[2024-05-31 20:25:22] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2024-05-31 20:25:22] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2024-05-31 20:25:22] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 2 ms to minimize.
[2024-05-31 20:25:22] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
[2024-05-31 20:25:22] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2024-05-31 20:25:23] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
[2024-05-31 20:25:23] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2024-05-31 20:25:23] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2024-05-31 20:25:23] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-05-31 20:25:23] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:25:23] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-05-31 20:25:23] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 2 ms to minimize.
[2024-05-31 20:25:23] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 2 ms to minimize.
[2024-05-31 20:25:23] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 2 ms to minimize.
[2024-05-31 20:25:24] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 2 ms to minimize.
[2024-05-31 20:25:24] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 2 ms to minimize.
[2024-05-31 20:25:24] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-31 20:25:25] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 1 ms to minimize.
[2024-05-31 20:25:25] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 1 ms to minimize.
[2024-05-31 20:25:25] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 2 ms to minimize.
[2024-05-31 20:25:25] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 1 ms to minimize.
[2024-05-31 20:25:25] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 1 ms to minimize.
[2024-05-31 20:25:25] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 16 ms to minimize.
[2024-05-31 20:25:25] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-05-31 20:25:25] [INFO ] Deduced a trap composed of 26 places in 144 ms of which 2 ms to minimize.
[2024-05-31 20:25:25] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 2 ms to minimize.
[2024-05-31 20:25:26] [INFO ] Deduced a trap composed of 33 places in 136 ms of which 2 ms to minimize.
[2024-05-31 20:25:26] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 1 ms to minimize.
[2024-05-31 20:25:26] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 1 ms to minimize.
[2024-05-31 20:25:26] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 1 ms to minimize.
[2024-05-31 20:25:26] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 1 ms to minimize.
[2024-05-31 20:25:26] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2024-05-31 20:25:26] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-31 20:25:26] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:25:26] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-31 20:25:26] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:25:27] [INFO ] Deduced a trap composed of 26 places in 221 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/524 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-31 20:25:28] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 2 ms to minimize.
[2024-05-31 20:25:28] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 2 ms to minimize.
[2024-05-31 20:25:29] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 2 ms to minimize.
[2024-05-31 20:25:29] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 1 ms to minimize.
[2024-05-31 20:25:29] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 1 ms to minimize.
[2024-05-31 20:25:29] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 1 ms to minimize.
[2024-05-31 20:25:29] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 1 ms to minimize.
[2024-05-31 20:25:29] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 1 ms to minimize.
[2024-05-31 20:25:29] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 1 ms to minimize.
[2024-05-31 20:25:29] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
[2024-05-31 20:25:29] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 1 ms to minimize.
[2024-05-31 20:25:30] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2024-05-31 20:25:30] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:25:30] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:25:30] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-05-31 20:25:30] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:25:31] [INFO ] Deduced a trap composed of 26 places in 230 ms of which 3 ms to minimize.
[2024-05-31 20:25:32] [INFO ] Deduced a trap composed of 26 places in 229 ms of which 3 ms to minimize.
[2024-05-31 20:25:32] [INFO ] Deduced a trap composed of 26 places in 229 ms of which 3 ms to minimize.
[2024-05-31 20:25:32] [INFO ] Deduced a trap composed of 31 places in 225 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/524 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-31 20:25:33] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-31 20:25:33] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 0 ms to minimize.
[2024-05-31 20:25:33] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:25:33] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:25:33] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-31 20:25:33] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:25:33] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:25:33] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:25:33] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-31 20:25:33] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-31 20:25:34] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2024-05-31 20:25:34] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2024-05-31 20:25:34] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
[2024-05-31 20:25:34] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-31 20:25:34] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:25:34] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-31 20:25:34] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:25:34] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-05-31 20:25:34] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-31 20:25:34] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/524 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-31 20:25:35] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:25:35] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2024-05-31 20:25:35] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:25:35] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-31 20:25:36] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:25:36] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-31 20:25:36] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-31 20:25:36] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 2 ms to minimize.
[2024-05-31 20:25:36] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
[2024-05-31 20:25:36] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2024-05-31 20:25:36] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-05-31 20:25:36] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-31 20:25:36] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-05-31 20:25:36] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-31 20:25:36] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2024-05-31 20:25:36] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2024-05-31 20:25:37] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2024-05-31 20:25:37] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2024-05-31 20:25:37] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-05-31 20:25:37] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/524 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-31 20:25:38] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:25:38] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:25:38] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 1 ms to minimize.
[2024-05-31 20:25:38] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 2 ms to minimize.
[2024-05-31 20:25:38] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 1 ms to minimize.
[2024-05-31 20:25:38] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 1 ms to minimize.
[2024-05-31 20:25:38] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 2 ms to minimize.
[2024-05-31 20:25:39] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 1 ms to minimize.
[2024-05-31 20:25:39] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 1 ms to minimize.
[2024-05-31 20:25:39] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2024-05-31 20:25:39] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 2 ms to minimize.
[2024-05-31 20:25:39] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
[2024-05-31 20:25:39] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-05-31 20:25:39] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-05-31 20:25:39] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:25:39] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-05-31 20:25:39] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 0 ms to minimize.
[2024-05-31 20:25:39] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-31 20:25:39] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-31 20:25:39] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/524 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-31 20:25:40] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-05-31 20:25:41] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 0 ms to minimize.
[2024-05-31 20:25:41] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-31 20:25:41] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-31 20:25:41] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2024-05-31 20:25:41] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-05-31 20:25:41] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-31 20:25:41] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 0 ms to minimize.
[2024-05-31 20:25:41] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 0 ms to minimize.
[2024-05-31 20:25:41] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-31 20:25:41] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 0 ms to minimize.
[2024-05-31 20:25:41] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 0 ms to minimize.
[2024-05-31 20:25:41] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:25:41] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 0 ms to minimize.
[2024-05-31 20:25:41] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 524/2185 variables, and 257 constraints, problems are : Problem set: 0 solved, 1640 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/525 constraints, ReadFeed: 0/1177 constraints, PredecessorRefiner: 0/1640 constraints, Known Traps: 235/235 constraints]
After SMT, in 60584ms problems are : Problem set: 0 solved, 1640 unsolved
Search for dead transitions found 0 dead transitions in 60600ms
Starting structural reductions in SI_LTL mode, iteration 1 : 525/1043 places, 1660/2520 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63177 ms. Remains : 525/1043 places, 1660/2520 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, (AND (NOT p0) (NOT p1) (NOT p2)), (OR p1 (AND (NOT p0) (NOT p2))), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1672 steps with 15 reset in 11 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-12 finished in 63365 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(p1 U G(p0)))))'
Support contains 4 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 22 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2024-05-31 20:25:43] [INFO ] Computed 22 invariants in 34 ms
[2024-05-31 20:25:43] [INFO ] Implicit Places using invariants in 344 ms returned []
[2024-05-31 20:25:43] [INFO ] Invariant cache hit.
[2024-05-31 20:25:44] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-31 20:25:47] [INFO ] Implicit Places using invariants and state equation in 3709 ms returned []
Implicit Place search using SMT with State Equation took 4054 ms to find 0 implicit places.
Running 2500 sub problems to find dead transitions.
[2024-05-31 20:25:47] [INFO ] Invariant cache hit.
[2024-05-31 20:25:47] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1042 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2500 unsolved
SMT process timed out in 30914ms, After SMT, problems are : Problem set: 0 solved, 2500 unsolved
Search for dead transitions found 0 dead transitions in 30937ms
Finished structural reductions in LTL mode , in 1 iterations and 35024 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-14 finished in 35259 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)&&X((!p1 U (p2||G(!p1)))))))'
Support contains 4 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 15 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
[2024-05-31 20:26:18] [INFO ] Invariant cache hit.
[2024-05-31 20:26:18] [INFO ] Implicit Places using invariants in 360 ms returned []
[2024-05-31 20:26:18] [INFO ] Invariant cache hit.
[2024-05-31 20:26:19] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-31 20:26:22] [INFO ] Implicit Places using invariants and state equation in 3547 ms returned []
Implicit Place search using SMT with State Equation took 3913 ms to find 0 implicit places.
Running 2500 sub problems to find dead transitions.
[2024-05-31 20:26:22] [INFO ] Invariant cache hit.
[2024-05-31 20:26:22] [INFO ] State equation strengthened by 780 read => feed constraints.
(s452 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
At refinement iteration 0 (INCLUDED_ONLY) 0/1042 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2500 unsolved
SMT process timed out in 30948ms, After SMT, problems are : Problem set: 0 solved, 2500 unsolved
Search for dead transitions found 0 dead transitions in 30971ms
Finished structural reductions in LTL mode , in 1 iterations and 34911 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-15
Stuttering criterion allowed to conclude after 404 steps with 2 reset in 4 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-15 finished in 35111 ms.
All properties solved by simple procedures.
Total runtime 456932 ms.
ITS solved all properties within timeout

BK_STOP 1717187213420

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="CANInsertWithFailure-PT-020"
export BK_EXAMINATION="LTLFireability"
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 CANInsertWithFailure-PT-020, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r476-tall-171620505200108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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