MCC'2024- Execution of r579-smll-171734921200084

About the Execution of LTSMin+red for MedleyA-PT-11

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
904.584	435605.00	519406.00	1417.20	FFFFTFFFFFFTFFFF	normal

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.r579-smll-171734921200084.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 MedleyA-PT-11, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r579-smll-171734921200084
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.1K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 160K Jun 2 16:33 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 MedleyA-PT-11-LTLFireability-00
FORMULA_NAME MedleyA-PT-11-LTLFireability-01
FORMULA_NAME MedleyA-PT-11-LTLFireability-02
FORMULA_NAME MedleyA-PT-11-LTLFireability-03
FORMULA_NAME MedleyA-PT-11-LTLFireability-04
FORMULA_NAME MedleyA-PT-11-LTLFireability-05
FORMULA_NAME MedleyA-PT-11-LTLFireability-06
FORMULA_NAME MedleyA-PT-11-LTLFireability-07
FORMULA_NAME MedleyA-PT-11-LTLFireability-08
FORMULA_NAME MedleyA-PT-11-LTLFireability-09
FORMULA_NAME MedleyA-PT-11-LTLFireability-10
FORMULA_NAME MedleyA-PT-11-LTLFireability-11
FORMULA_NAME MedleyA-PT-11-LTLFireability-12
FORMULA_NAME MedleyA-PT-11-LTLFireability-13
FORMULA_NAME MedleyA-PT-11-LTLFireability-14
FORMULA_NAME MedleyA-PT-11-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717356297082

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:24:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 19:24:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:25:00] [INFO ] Load time of PNML (sax parser for PT used): 221 ms
[2024-06-02 19:25:00] [INFO ] Transformed 150 places.
[2024-06-02 19:25:00] [INFO ] Transformed 478 transitions.
[2024-06-02 19:25:00] [INFO ] Found NUPN structural information;
[2024-06-02 19:25:00] [INFO ] Parsed PT model containing 150 places and 478 transitions and 2705 arcs in 584 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
FORMULA MedleyA-PT-11-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 469/469 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 117 transition count 421
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 117 transition count 421
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 72 place count 111 transition count 389
Iterating global reduction 0 with 6 rules applied. Total rules applied 78 place count 111 transition count 389
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 110 transition count 385
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 110 transition count 385
Applied a total of 80 rules in 113 ms. Remains 110 /150 variables (removed 40) and now considering 385/469 (removed 84) transitions.
[2024-06-02 19:25:00] [INFO ] Flow matrix only has 313 transitions (discarded 72 similar events)
// Phase 1: matrix 313 rows 110 cols
[2024-06-02 19:25:00] [INFO ] Computed 23 invariants in 37 ms
[2024-06-02 19:25:01] [INFO ] Implicit Places using invariants in 447 ms returned []
[2024-06-02 19:25:01] [INFO ] Flow matrix only has 313 transitions (discarded 72 similar events)
[2024-06-02 19:25:01] [INFO ] Invariant cache hit.
[2024-06-02 19:25:01] [INFO ] State equation strengthened by 158 read => feed constraints.
[2024-06-02 19:25:01] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 1054 ms to find 0 implicit places.
Running 384 sub problems to find dead transitions.
[2024-06-02 19:25:01] [INFO ] Flow matrix only has 313 transitions (discarded 72 similar events)
[2024-06-02 19:25:01] [INFO ] Invariant cache hit.
[2024-06-02 19:25:01] [INFO ] State equation strengthened by 158 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/110 variables, 9/23 constraints. Problems are: Problem set: 108 solved, 276 unsolved
[2024-06-02 19:25:07] [INFO ] Deduced a trap composed of 20 places in 168 ms of which 25 ms to minimize.
[2024-06-02 19:25:07] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 2 ms to minimize.
[2024-06-02 19:25:07] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
[2024-06-02 19:25:07] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 2 ms to minimize.
[2024-06-02 19:25:08] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 2 ms to minimize.
[2024-06-02 19:25:08] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 2 ms to minimize.
[2024-06-02 19:25:08] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 3 ms to minimize.
[2024-06-02 19:25:08] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 3 ms to minimize.
[2024-06-02 19:25:08] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 2 ms to minimize.
[2024-06-02 19:25:08] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 2 ms to minimize.
[2024-06-02 19:25:08] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-06-02 19:25:09] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-06-02 19:25:09] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 2 ms to minimize.
[2024-06-02 19:25:09] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 3 ms to minimize.
[2024-06-02 19:25:09] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-06-02 19:25:09] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-06-02 19:25:10] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-06-02 19:25:10] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 2 ms to minimize.
[2024-06-02 19:25:10] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 2 ms to minimize.
[2024-06-02 19:25:10] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 20/43 constraints. Problems are: Problem set: 108 solved, 276 unsolved
[2024-06-02 19:25:12] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 2 ms to minimize.
[2024-06-02 19:25:12] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 3 ms to minimize.
[2024-06-02 19:25:12] [INFO ] Deduced a trap composed of 30 places in 153 ms of which 2 ms to minimize.
[2024-06-02 19:25:12] [INFO ] Deduced a trap composed of 56 places in 105 ms of which 2 ms to minimize.
[2024-06-02 19:25:12] [INFO ] Deduced a trap composed of 55 places in 142 ms of which 3 ms to minimize.
[2024-06-02 19:25:13] [INFO ] Deduced a trap composed of 44 places in 127 ms of which 2 ms to minimize.
[2024-06-02 19:25:13] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 2 ms to minimize.
[2024-06-02 19:25:13] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 2 ms to minimize.
[2024-06-02 19:25:13] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 2 ms to minimize.
[2024-06-02 19:25:13] [INFO ] Deduced a trap composed of 53 places in 171 ms of which 3 ms to minimize.
[2024-06-02 19:25:13] [INFO ] Deduced a trap composed of 20 places in 146 ms of which 2 ms to minimize.
[2024-06-02 19:25:14] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 3 ms to minimize.
[2024-06-02 19:25:14] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 2 ms to minimize.
[2024-06-02 19:25:14] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 3 ms to minimize.
[2024-06-02 19:25:14] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 6 ms to minimize.
[2024-06-02 19:25:14] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 1 ms to minimize.
[2024-06-02 19:25:14] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 17/60 constraints. Problems are: Problem set: 108 solved, 276 unsolved
[2024-06-02 19:25:15] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 2 ms to minimize.
[2024-06-02 19:25:15] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 2 ms to minimize.
[2024-06-02 19:25:16] [INFO ] Deduced a trap composed of 52 places in 107 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 3/63 constraints. Problems are: Problem set: 108 solved, 276 unsolved
[2024-06-02 19:25:18] [INFO ] Deduced a trap composed of 34 places in 147 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 1/64 constraints. Problems are: Problem set: 108 solved, 276 unsolved
[2024-06-02 19:25:21] [INFO ] Deduced a trap composed of 50 places in 129 ms of which 3 ms to minimize.
[2024-06-02 19:25:21] [INFO ] Deduced a trap composed of 48 places in 130 ms of which 2 ms to minimize.
[2024-06-02 19:25:21] [INFO ] Deduced a trap composed of 46 places in 164 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 3/67 constraints. Problems are: Problem set: 108 solved, 276 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 0/67 constraints. Problems are: Problem set: 108 solved, 276 unsolved
At refinement iteration 9 (OVERLAPS) 313/423 variables, 110/177 constraints. Problems are: Problem set: 108 solved, 276 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 158/335 constraints. Problems are: Problem set: 108 solved, 276 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 0/335 constraints. Problems are: Problem set: 108 solved, 276 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 423/423 variables, and 335 constraints, problems are : Problem set: 108 solved, 276 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 110/110 constraints, ReadFeed: 158/158 constraints, PredecessorRefiner: 384/384 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 108 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 14/14 constraints. Problems are: Problem set: 108 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/14 constraints. Problems are: Problem set: 108 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 1/110 variables, 9/23 constraints. Problems are: Problem set: 108 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 44/67 constraints. Problems are: Problem set: 108 solved, 276 unsolved
[2024-06-02 19:25:35] [INFO ] Deduced a trap composed of 49 places in 166 ms of which 3 ms to minimize.
[2024-06-02 19:25:35] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 2/69 constraints. Problems are: Problem set: 108 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/69 constraints. Problems are: Problem set: 108 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 313/423 variables, 110/179 constraints. Problems are: Problem set: 108 solved, 276 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 158/337 constraints. Problems are: Problem set: 108 solved, 276 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 276/613 constraints. Problems are: Problem set: 108 solved, 276 unsolved
[2024-06-02 19:25:56] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 3 ms to minimize.
[2024-06-02 19:25:57] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 2/615 constraints. Problems are: Problem set: 108 solved, 276 unsolved
[2024-06-02 19:26:02] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/423 variables, and 616 constraints, problems are : Problem set: 108 solved, 276 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 110/110 constraints, ReadFeed: 158/158 constraints, PredecessorRefiner: 276/384 constraints, Known Traps: 49/49 constraints]
After SMT, in 61323ms problems are : Problem set: 108 solved, 276 unsolved
Search for dead transitions found 108 dead transitions in 61381ms
Found 108 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 108 transitions
Dead transitions reduction (with SMT) removed 108 transitions
Starting structural reductions in LTL mode, iteration 1 : 110/150 places, 277/469 transitions.
Applied a total of 0 rules in 5 ms. Remains 110 /110 variables (removed 0) and now considering 277/277 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62610 ms. Remains : 110/150 places, 277/469 transitions.
Support contains 46 out of 110 places after structural reductions.
[2024-06-02 19:26:03] [INFO ] Flatten gal took : 114 ms
[2024-06-02 19:26:03] [INFO ] Flatten gal took : 51 ms
[2024-06-02 19:26:03] [INFO ] Input system was already deterministic with 277 transitions.
Support contains 43 out of 110 places (down from 46) after GAL structural reductions.
RANDOM walk for 40000 steps (3132 resets) in 2685 ms. (14 steps per ms) remains 20/27 properties
BEST_FIRST walk for 4002 steps (54 resets) in 39 ms. (100 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (34 resets) in 33 ms. (117 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (47 resets) in 34 ms. (114 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (57 resets) in 41 ms. (95 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (53 resets) in 47 ms. (83 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (64 resets) in 32 ms. (121 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (52 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (53 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (54 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (54 resets) in 36 ms. (108 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (48 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (55 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (51 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (52 resets) in 35 ms. (111 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (62 resets) in 27 ms. (142 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (52 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (46 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (55 resets) in 29 ms. (133 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (47 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (46 resets) in 31 ms. (125 steps per ms) remains 20/20 properties
// Phase 1: matrix 277 rows 110 cols
[2024-06-02 19:26:05] [INFO ] Computed 23 invariants in 9 ms
[2024-06-02 19:26:05] [INFO ] State equation strengthened by 122 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
At refinement iteration 1 (OVERLAPS) 30/67 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 18 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
At refinement iteration 3 (OVERLAPS) 39/106 variables, 13/22 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/22 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 3/109 variables, 1/23 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/23 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 276/385 variables, 109/132 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 122/254 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 0/254 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 2/387 variables, 1/255 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 0/255 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 0/387 variables, 0/255 constraints. Problems are: Problem set: 7 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 255 constraints, problems are : Problem set: 7 solved, 13 unsolved in 824 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 110/110 constraints, ReadFeed: 122/122 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 33/59 variables, 7/7 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 4/63 variables, 2/9 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/9 constraints. Problems are: Problem set: 7 solved, 13 unsolved
Problem AtomicPropp22 is UNSAT
At refinement iteration 5 (OVERLAPS) 43/106 variables, 13/22 constraints. Problems are: Problem set: 8 solved, 12 unsolved
[2024-06-02 19:26:06] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 2 ms to minimize.
[2024-06-02 19:26:06] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 3 ms to minimize.
[2024-06-02 19:26:06] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2024-06-02 19:26:06] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2024-06-02 19:26:06] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 1 ms to minimize.
[2024-06-02 19:26:06] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 2 ms to minimize.
[2024-06-02 19:26:06] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 17 ms to minimize.
[2024-06-02 19:26:06] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:26:06] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 9/31 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/31 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 3/109 variables, 1/32 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 0/32 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 276/385 variables, 109/141 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/385 variables, 122/263 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/385 variables, 7/270 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/385 variables, 0/270 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 2/387 variables, 1/271 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/387 variables, 5/276 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/387 variables, 0/276 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 0/387 variables, 0/276 constraints. Problems are: Problem set: 8 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 276 constraints, problems are : Problem set: 8 solved, 12 unsolved in 2935 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 110/110 constraints, ReadFeed: 122/122 constraints, PredecessorRefiner: 12/20 constraints, Known Traps: 9/9 constraints]
After SMT, in 3837ms problems are : Problem set: 8 solved, 12 unsolved
Parikh walk visited 6 properties in 5973 ms.
Support contains 12 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 277/277 transitions.
Graph (complete) has 545 edges and 110 vertex of which 109 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 107 transition count 276
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 11 place count 99 transition count 247
Iterating global reduction 1 with 8 rules applied. Total rules applied 19 place count 99 transition count 247
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 98 transition count 242
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 98 transition count 242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 97 transition count 238
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 97 transition count 238
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 25 place count 96 transition count 237
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 94 transition count 245
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 1 with 13 rules applied. Total rules applied 42 place count 94 transition count 232
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 93 transition count 231
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 91 transition count 254
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 1 with 14 rules applied. Total rules applied 62 place count 91 transition count 365
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 97 place count 77 transition count 344
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 99 place count 77 transition count 342
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 104 place count 77 transition count 342
Applied a total of 104 rules in 236 ms. Remains 77 /110 variables (removed 33) and now considering 342/277 (removed -65) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 238 ms. Remains : 77/110 places, 342/277 transitions.
RANDOM walk for 40000 steps (5592 resets) in 555 ms. (71 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40002 steps (1043 resets) in 138 ms. (287 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40001 steps (1106 resets) in 140 ms. (283 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (1171 resets) in 116 ms. (341 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1170 resets) in 104 ms. (380 steps per ms) remains 3/3 properties
// Phase 1: matrix 342 rows 77 cols
[2024-06-02 19:26:15] [INFO ] Computed 21 invariants in 4 ms
[2024-06-02 19:26:15] [INFO ] State equation strengthened by 175 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 30/36 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 19/55 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 19/74 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/76 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 342/418 variables, 76/97 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 175/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/419 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/419 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/419 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 419/419 variables, and 273 constraints, problems are : Problem set: 0 solved, 3 unsolved in 249 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 77/77 constraints, ReadFeed: 175/175 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 30/36 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 19/55 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 19:26:15] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 19/74 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 19:26:15] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/74 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/76 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/76 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 342/418 variables, 76/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 175/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 2/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/418 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 1/419 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/419 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/419 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/419 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 419/419 variables, and 278 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1511 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 77/77 constraints, ReadFeed: 175/175 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 1782ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 1 properties in 801 ms.
Support contains 5 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 342/342 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 75 transition count 339
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 75 transition count 339
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 74 transition count 319
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 74 transition count 319
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 74 transition count 318
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 73 transition count 318
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 73 transition count 477
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 16 place count 69 transition count 477
Applied a total of 16 rules in 76 ms. Remains 69 /77 variables (removed 8) and now considering 477/342 (removed -135) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 69/77 places, 477/342 transitions.
RANDOM walk for 40000 steps (6617 resets) in 1845 ms. (21 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (1334 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
[2024-06-02 19:26:18] [INFO ] Flow matrix only has 465 transitions (discarded 12 similar events)
// Phase 1: matrix 465 rows 69 cols
[2024-06-02 19:26:18] [INFO ] Computed 21 invariants in 4 ms
[2024-06-02 19:26:18] [INFO ] State equation strengthened by 232 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/27 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/49 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/66 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/68 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/68 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 465/533 variables, 68/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/533 variables, 232/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/533 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/534 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/534 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/534 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 322 constraints, problems are : Problem set: 0 solved, 1 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 69/69 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/27 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/49 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/66 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/68 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/68 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 465/533 variables, 68/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/533 variables, 232/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/533 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/534 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/534 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/534 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/534 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 534/534 variables, and 323 constraints, problems are : Problem set: 0 solved, 1 unsolved in 517 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 69/69 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 831ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 5 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 477/477 transitions.
Applied a total of 0 rules in 16 ms. Remains 69 /69 variables (removed 0) and now considering 477/477 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 69/69 places, 477/477 transitions.
RANDOM walk for 40000 steps (6590 resets) in 432 ms. (92 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1294 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 53262 steps, run visited all 1 properties in 337 ms. (steps per millisecond=158 )
Probabilistic random walk after 53262 steps, saw 12521 distinct states, run finished after 347 ms. (steps per millisecond=153 ) properties seen :1
FORMULA MedleyA-PT-11-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA MedleyA-PT-11-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 8 atomic propositions for a total of 10 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-11-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 17 stabilizing places and 111 stable transitions
Graph (complete) has 719 edges and 110 vertex of which 109 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
FORMULA MedleyA-PT-11-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 3 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 277/277 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 107 transition count 277
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 13 place count 97 transition count 245
Iterating global reduction 1 with 10 rules applied. Total rules applied 23 place count 97 transition count 245
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 94 transition count 228
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 94 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 93 transition count 224
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 93 transition count 224
Applied a total of 31 rules in 18 ms. Remains 93 /110 variables (removed 17) and now considering 224/277 (removed 53) transitions.
// Phase 1: matrix 224 rows 93 cols
[2024-06-02 19:26:20] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 19:26:20] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-06-02 19:26:20] [INFO ] Invariant cache hit.
[2024-06-02 19:26:20] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-06-02 19:26:20] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
Running 223 sub problems to find dead transitions.
[2024-06-02 19:26:20] [INFO ] Invariant cache hit.
[2024-06-02 19:26:20] [INFO ] State equation strengthened by 108 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-02 19:26:24] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-06-02 19:26:24] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 2 ms to minimize.
[2024-06-02 19:26:24] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 2 ms to minimize.
[2024-06-02 19:26:24] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-02 19:26:26] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (OVERLAPS) 224/317 variables, 93/118 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 108/226 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (OVERLAPS) 0/317 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 226 constraints, problems are : Problem set: 0 solved, 223 unsolved in 16375 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 93/93 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-02 19:26:40] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (OVERLAPS) 224/317 variables, 93/119 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 108/227 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 223/450 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (OVERLAPS) 0/317 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 450 constraints, problems are : Problem set: 0 solved, 223 unsolved in 16725 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 93/93 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 6/6 constraints]
After SMT, in 33453ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 33459ms
Starting structural reductions in LTL mode, iteration 1 : 93/110 places, 224/277 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33913 ms. Remains : 93/110 places, 224/277 transitions.
Stuttering acceptance computed with spot in 464 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-11-LTLFireability-00
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 2 ms.
FORMULA MedleyA-PT-11-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-11-LTLFireability-00 finished in 34476 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&&X(p1))))'
Support contains 2 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 277/277 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 107 transition count 277
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 14 place count 96 transition count 240
Iterating global reduction 1 with 11 rules applied. Total rules applied 25 place count 96 transition count 240
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 92 transition count 219
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 92 transition count 219
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 91 transition count 215
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 91 transition count 215
Applied a total of 35 rules in 18 ms. Remains 91 /110 variables (removed 19) and now considering 215/277 (removed 62) transitions.
// Phase 1: matrix 215 rows 91 cols
[2024-06-02 19:26:54] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 19:26:55] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-06-02 19:26:55] [INFO ] Invariant cache hit.
[2024-06-02 19:26:55] [INFO ] State equation strengthened by 105 read => feed constraints.
[2024-06-02 19:26:55] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2024-06-02 19:26:55] [INFO ] Invariant cache hit.
[2024-06-02 19:26:55] [INFO ] State equation strengthened by 105 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-02 19:26:58] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-06-02 19:26:58] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/306 variables, 91/113 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 105/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 218 constraints, problems are : Problem set: 0 solved, 214 unsolved in 11605 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/306 variables, 91/113 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 105/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 214/432 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (OVERLAPS) 0/306 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 432 constraints, problems are : Problem set: 0 solved, 214 unsolved in 14926 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 2/2 constraints]
After SMT, in 26797ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 26802ms
Starting structural reductions in LTL mode, iteration 1 : 91/110 places, 215/277 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27313 ms. Remains : 91/110 places, 215/277 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-11-LTLFireability-05
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-11-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-11-LTLFireability-05 finished in 27479 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(G(p0))&&F(p1)))))'
Support contains 3 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 277/277 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 107 transition count 277
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 13 place count 97 transition count 245
Iterating global reduction 1 with 10 rules applied. Total rules applied 23 place count 97 transition count 245
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 94 transition count 228
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 94 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 93 transition count 224
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 93 transition count 224
Applied a total of 31 rules in 15 ms. Remains 93 /110 variables (removed 17) and now considering 224/277 (removed 53) transitions.
// Phase 1: matrix 224 rows 93 cols
[2024-06-02 19:27:22] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 19:27:22] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-06-02 19:27:22] [INFO ] Invariant cache hit.
[2024-06-02 19:27:22] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-06-02 19:27:22] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
Running 223 sub problems to find dead transitions.
[2024-06-02 19:27:22] [INFO ] Invariant cache hit.
[2024-06-02 19:27:22] [INFO ] State equation strengthened by 108 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-02 19:27:26] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-06-02 19:27:26] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 2 ms to minimize.
[2024-06-02 19:27:26] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 2 ms to minimize.
[2024-06-02 19:27:26] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-02 19:27:28] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (OVERLAPS) 224/317 variables, 93/118 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 108/226 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (OVERLAPS) 0/317 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 226 constraints, problems are : Problem set: 0 solved, 223 unsolved in 14616 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 93/93 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-02 19:27:40] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (OVERLAPS) 224/317 variables, 93/119 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 108/227 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 223/450 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (OVERLAPS) 0/317 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 450 constraints, problems are : Problem set: 0 solved, 223 unsolved in 16142 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 93/93 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 6/6 constraints]
After SMT, in 31061ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 31065ms
Starting structural reductions in LTL mode, iteration 1 : 93/110 places, 224/277 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31553 ms. Remains : 93/110 places, 224/277 transitions.
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-11-LTLFireability-06
Stuttering criterion allowed to conclude after 33 steps with 2 reset in 2 ms.
FORMULA MedleyA-PT-11-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-11-LTLFireability-06 finished in 31820 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 4 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 277/277 transitions.
Graph (complete) has 719 edges and 110 vertex of which 109 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 3 places
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 12 place count 95 transition count 239
Iterating global reduction 0 with 11 rules applied. Total rules applied 23 place count 95 transition count 239
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 27 place count 91 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 31 place count 91 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 32 place count 90 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 33 place count 90 transition count 214
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 35 place count 89 transition count 213
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 45 place count 84 transition count 242
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 65 place count 84 transition count 222
Applied a total of 65 rules in 54 ms. Remains 84 /110 variables (removed 26) and now considering 222/277 (removed 55) transitions.
// Phase 1: matrix 222 rows 84 cols
[2024-06-02 19:27:54] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 19:27:54] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-02 19:27:54] [INFO ] Invariant cache hit.
[2024-06-02 19:27:54] [INFO ] State equation strengthened by 113 read => feed constraints.
[2024-06-02 19:27:54] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
[2024-06-02 19:27:54] [INFO ] Redundant transitions in 17 ms returned []
Running 218 sub problems to find dead transitions.
[2024-06-02 19:27:54] [INFO ] Invariant cache hit.
[2024-06-02 19:27:54] [INFO ] State equation strengthened by 113 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-02 19:27:57] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-06-02 19:27:57] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-06-02 19:27:57] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 222/306 variables, 84/107 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 113/220 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 220 constraints, problems are : Problem set: 0 solved, 218 unsolved in 11024 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 84/84 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 222/306 variables, 84/107 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 113/220 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 218/438 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (OVERLAPS) 0/306 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 438 constraints, problems are : Problem set: 0 solved, 218 unsolved in 13187 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 84/84 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 3/3 constraints]
After SMT, in 24502ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 24508ms
Starting structural reductions in SI_LTL mode, iteration 1 : 84/110 places, 222/277 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24982 ms. Remains : 84/110 places, 222/277 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-11-LTLFireability-07
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-11-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-11-LTLFireability-07 finished in 25041 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)) U G(p1)))'
Support contains 6 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 277/277 transitions.
Graph (complete) has 719 edges and 110 vertex of which 109 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 3 places
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 11 place count 96 transition count 245
Iterating global reduction 0 with 10 rules applied. Total rules applied 21 place count 96 transition count 245
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 25 place count 92 transition count 224
Iterating global reduction 0 with 4 rules applied. Total rules applied 29 place count 92 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 30 place count 91 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 31 place count 91 transition count 220
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 33 place count 90 transition count 219
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 41 place count 86 transition count 246
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 57 place count 86 transition count 230
Applied a total of 57 rules in 28 ms. Remains 86 /110 variables (removed 24) and now considering 230/277 (removed 47) transitions.
// Phase 1: matrix 230 rows 86 cols
[2024-06-02 19:28:19] [INFO ] Computed 20 invariants in 5 ms
[2024-06-02 19:28:19] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 19:28:19] [INFO ] Invariant cache hit.
[2024-06-02 19:28:19] [INFO ] State equation strengthened by 115 read => feed constraints.
[2024-06-02 19:28:19] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
[2024-06-02 19:28:19] [INFO ] Redundant transitions in 18 ms returned []
Running 226 sub problems to find dead transitions.
[2024-06-02 19:28:19] [INFO ] Invariant cache hit.
[2024-06-02 19:28:19] [INFO ] State equation strengthened by 115 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-06-02 19:28:21] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 2 ms to minimize.
[2024-06-02 19:28:22] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-06-02 19:28:22] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (OVERLAPS) 230/316 variables, 86/109 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 115/224 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (OVERLAPS) 0/316 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 224 constraints, problems are : Problem set: 0 solved, 226 unsolved in 11005 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (OVERLAPS) 230/316 variables, 86/109 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 115/224 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 226/450 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (OVERLAPS) 0/316 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 450 constraints, problems are : Problem set: 0 solved, 226 unsolved in 16374 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 3/3 constraints]
After SMT, in 27677ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 27682ms
Starting structural reductions in SI_LTL mode, iteration 1 : 86/110 places, 230/277 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 28113 ms. Remains : 86/110 places, 230/277 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), p0]
Running random walk in product with property : MedleyA-PT-11-LTLFireability-10
Stuttering criterion allowed to conclude after 420 steps with 135 reset in 10 ms.
FORMULA MedleyA-PT-11-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-11-LTLFireability-10 finished in 28213 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) U X(p1))||F(p2))))'
Support contains 6 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 277/277 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 107 transition count 277
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 11 place count 99 transition count 251
Iterating global reduction 1 with 8 rules applied. Total rules applied 19 place count 99 transition count 251
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 95 transition count 230
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 95 transition count 230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 94 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 94 transition count 226
Applied a total of 29 rules in 8 ms. Remains 94 /110 variables (removed 16) and now considering 226/277 (removed 51) transitions.
// Phase 1: matrix 226 rows 94 cols
[2024-06-02 19:28:47] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 19:28:47] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 19:28:47] [INFO ] Invariant cache hit.
[2024-06-02 19:28:47] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-06-02 19:28:47] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2024-06-02 19:28:47] [INFO ] Invariant cache hit.
[2024-06-02 19:28:47] [INFO ] State equation strengthened by 108 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-02 19:28:50] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
[2024-06-02 19:28:50] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-06-02 19:28:50] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-06-02 19:28:51] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-06-02 19:28:51] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-02 19:28:53] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 2 ms to minimize.
[2024-06-02 19:28:53] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 226/320 variables, 94/121 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 108/229 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (OVERLAPS) 0/320 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 229 constraints, problems are : Problem set: 0 solved, 225 unsolved in 16628 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 94/94 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (OVERLAPS) 226/320 variables, 94/121 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 108/229 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 225/454 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (OVERLAPS) 0/320 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 454 constraints, problems are : Problem set: 0 solved, 225 unsolved in 18361 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 94/94 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 7/7 constraints]
After SMT, in 35163ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 35166ms
Starting structural reductions in LTL mode, iteration 1 : 94/110 places, 226/277 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35514 ms. Remains : 94/110 places, 226/277 transitions.
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : MedleyA-PT-11-LTLFireability-13
Stuttering criterion allowed to conclude after 22 steps with 1 reset in 0 ms.
FORMULA MedleyA-PT-11-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-11-LTLFireability-13 finished in 35767 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(G(p1)))))'
Support contains 6 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 277/277 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 107 transition count 277
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 14 place count 96 transition count 240
Iterating global reduction 1 with 11 rules applied. Total rules applied 25 place count 96 transition count 240
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 92 transition count 219
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 92 transition count 219
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 91 transition count 215
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 91 transition count 215
Applied a total of 35 rules in 5 ms. Remains 91 /110 variables (removed 19) and now considering 215/277 (removed 62) transitions.
// Phase 1: matrix 215 rows 91 cols
[2024-06-02 19:29:23] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 19:29:23] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-02 19:29:23] [INFO ] Invariant cache hit.
[2024-06-02 19:29:23] [INFO ] State equation strengthened by 105 read => feed constraints.
[2024-06-02 19:29:23] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2024-06-02 19:29:23] [INFO ] Invariant cache hit.
[2024-06-02 19:29:23] [INFO ] State equation strengthened by 105 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-02 19:29:26] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-06-02 19:29:26] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/306 variables, 91/113 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 105/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 218 constraints, problems are : Problem set: 0 solved, 214 unsolved in 10128 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/306 variables, 91/113 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 105/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 214/432 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (OVERLAPS) 0/306 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 432 constraints, problems are : Problem set: 0 solved, 214 unsolved in 14416 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 2/2 constraints]
After SMT, in 24813ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 24817ms
Starting structural reductions in LTL mode, iteration 1 : 91/110 places, 215/277 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25082 ms. Remains : 91/110 places, 215/277 transitions.
Stuttering acceptance computed with spot in 267 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-11-LTLFireability-14
Product exploration explored 100000 steps with 7816 reset in 674 ms.
Product exploration explored 100000 steps with 7810 reset in 445 ms.
Computed a total of 12 stabilizing places and 92 stable transitions
Graph (complete) has 523 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 12 stabilizing places and 92 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 111 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (3120 resets) in 450 ms. (88 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (601 resets) in 258 ms. (154 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (548 resets) in 90 ms. (439 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (53 resets) in 145 ms. (274 steps per ms) remains 3/3 properties
[2024-06-02 19:29:50] [INFO ] Invariant cache hit.
[2024-06-02 19:29:50] [INFO ] State equation strengthened by 105 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 29/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 43/78 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 12/90 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 214/304 variables, 90/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 105/215 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/306 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/306 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/306 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 216 constraints, problems are : Problem set: 0 solved, 3 unsolved in 216 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 29/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 43/78 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 12/90 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 214/304 variables, 90/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 105/215 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/304 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/306 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/306 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/306 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/306 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 219 constraints, problems are : Problem set: 0 solved, 3 unsolved in 507 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 737ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 195 ms.
Support contains 6 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 215/215 transitions.
Graph (complete) has 405 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 85 transition count 243
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 31 place count 85 transition count 223
Free-agglomeration rule (complex) applied 17 times with reduction of 4 identical transitions.
Iterating global reduction 0 with 17 rules applied. Total rules applied 48 place count 85 transition count 370
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 87 place count 68 transition count 348
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 68 transition count 348
Applied a total of 88 rules in 34 ms. Remains 68 /91 variables (removed 23) and now considering 348/215 (removed -133) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 68/91 places, 348/215 transitions.
RANDOM walk for 40000 steps (4968 resets) in 362 ms. (110 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (60 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
// Phase 1: matrix 348 rows 68 cols
[2024-06-02 19:29:51] [INFO ] Computed 20 invariants in 8 ms
[2024-06-02 19:29:51] [INFO ] State equation strengthened by 171 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/29 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/58 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/68 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 348/416 variables, 68/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 171/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/416 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/29 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/58 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/68 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 348/416 variables, 68/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 171/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/416 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 416/416 variables, and 260 constraints, problems are : Problem set: 0 solved, 1 unsolved in 334 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 574ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 6 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 348/348 transitions.
Applied a total of 0 rules in 11 ms. Remains 68 /68 variables (removed 0) and now considering 348/348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 68/68 places, 348/348 transitions.
RANDOM walk for 40000 steps (4923 resets) in 244 ms. (163 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (48 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1195844 steps, run timeout after 3001 ms. (steps per millisecond=398 ) properties seen :0 out of 1
Probabilistic random walk after 1195844 steps, saw 224760 distinct states, run finished after 3007 ms. (steps per millisecond=397 ) properties seen :0
[2024-06-02 19:29:55] [INFO ] Invariant cache hit.
[2024-06-02 19:29:55] [INFO ] State equation strengthened by 171 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/29 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/58 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/68 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 348/416 variables, 68/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 171/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/416 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 196 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/29 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/58 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/68 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 348/416 variables, 68/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 171/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/416 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 416/416 variables, and 260 constraints, problems are : Problem set: 0 solved, 1 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 500ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 6 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 348/348 transitions.
Applied a total of 0 rules in 11 ms. Remains 68 /68 variables (removed 0) and now considering 348/348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 68/68 places, 348/348 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 348/348 transitions.
Applied a total of 0 rules in 10 ms. Remains 68 /68 variables (removed 0) and now considering 348/348 (removed 0) transitions.
[2024-06-02 19:29:55] [INFO ] Invariant cache hit.
[2024-06-02 19:29:55] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-02 19:29:55] [INFO ] Invariant cache hit.
[2024-06-02 19:29:56] [INFO ] State equation strengthened by 171 read => feed constraints.
[2024-06-02 19:29:56] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
[2024-06-02 19:29:56] [INFO ] Redundant transitions in 11 ms returned []
Running 344 sub problems to find dead transitions.
[2024-06-02 19:29:56] [INFO ] Invariant cache hit.
[2024-06-02 19:29:56] [INFO ] State equation strengthened by 171 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 2 (OVERLAPS) 1/68 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-06-02 19:29:59] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2024-06-02 19:30:00] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 2 ms to minimize.
[2024-06-02 19:30:00] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 2 ms to minimize.
[2024-06-02 19:30:00] [INFO ] Deduced a trap composed of 26 places in 162 ms of which 2 ms to minimize.
[2024-06-02 19:30:00] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 1 ms to minimize.
[2024-06-02 19:30:00] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 2 ms to minimize.
[2024-06-02 19:30:00] [INFO ] Deduced a trap composed of 17 places in 178 ms of which 2 ms to minimize.
[2024-06-02 19:30:01] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 5 (OVERLAPS) 348/416 variables, 68/96 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 171/267 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 8 (OVERLAPS) 0/416 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 344 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 267 constraints, problems are : Problem set: 0 solved, 344 unsolved in 21211 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 344/344 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 344 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 2 (OVERLAPS) 1/68 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-06-02 19:30:20] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 6 (OVERLAPS) 348/416 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 171/268 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 344/612 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-06-02 19:30:32] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2024-06-02 19:30:33] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 2/614 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 344 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/416 variables, and 614 constraints, problems are : Problem set: 0 solved, 344 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 344/344 constraints, Known Traps: 11/11 constraints]
After SMT, in 52071ms problems are : Problem set: 0 solved, 344 unsolved
Search for dead transitions found 0 dead transitions in 52078ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52693 ms. Remains : 68/68 places, 348/348 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 403 edges and 68 vertex of which 60 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 60 transition count 291
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 60 transition count 289
Free-agglomeration rule (complex) applied 2 times with reduction of 30 identical transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 60 transition count 315
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 64 place count 58 transition count 315
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 69 place count 58 transition count 315
Applied a total of 69 rules in 47 ms. Remains 58 /68 variables (removed 10) and now considering 315/348 (removed 33) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 315 rows 58 cols
[2024-06-02 19:30:48] [INFO ] Computed 15 invariants in 4 ms
[2024-06-02 19:30:48] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 19:30:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 19:30:48] [INFO ] [Nat]Absence check using 10 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 19:30:48] [INFO ] After 157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 19:30:48] [INFO ] After 197ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 19:30:48] [INFO ] After 284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 405 ms.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT p1))]
Knowledge based reduction with 8 factoid took 377 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 268 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 215/215 transitions.
Applied a total of 0 rules in 1 ms. Remains 91 /91 variables (removed 0) and now considering 215/215 (removed 0) transitions.
// Phase 1: matrix 215 rows 91 cols
[2024-06-02 19:30:49] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 19:30:49] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-02 19:30:49] [INFO ] Invariant cache hit.
[2024-06-02 19:30:50] [INFO ] State equation strengthened by 105 read => feed constraints.
[2024-06-02 19:30:50] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2024-06-02 19:30:50] [INFO ] Invariant cache hit.
[2024-06-02 19:30:50] [INFO ] State equation strengthened by 105 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-02 19:30:53] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 2 ms to minimize.
[2024-06-02 19:30:53] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/306 variables, 91/113 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 105/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 218 constraints, problems are : Problem set: 0 solved, 214 unsolved in 9480 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/306 variables, 91/113 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 105/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 214/432 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (OVERLAPS) 0/306 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 432 constraints, problems are : Problem set: 0 solved, 214 unsolved in 13884 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 2/2 constraints]
After SMT, in 23602ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 23607ms
Finished structural reductions in LTL mode , in 1 iterations and 24008 ms. Remains : 91/91 places, 215/215 transitions.
Computed a total of 12 stabilizing places and 92 stable transitions
Graph (complete) has 523 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 12 stabilizing places and 92 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 97 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (3130 resets) in 212 ms. (187 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (583 resets) in 69 ms. (571 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (540 resets) in 57 ms. (689 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (81 resets) in 54 ms. (727 steps per ms) remains 3/3 properties
[2024-06-02 19:31:14] [INFO ] Invariant cache hit.
[2024-06-02 19:31:14] [INFO ] State equation strengthened by 105 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 29/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 43/78 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 12/90 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 214/304 variables, 90/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 105/215 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/306 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/306 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/306 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 216 constraints, problems are : Problem set: 0 solved, 3 unsolved in 255 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 29/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 43/78 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 12/90 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 214/304 variables, 90/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 105/215 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/304 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/306 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/306 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/306 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/306 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 219 constraints, problems are : Problem set: 0 solved, 3 unsolved in 565 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 850ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 117 ms.
Support contains 6 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 215/215 transitions.
Graph (complete) has 405 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 85 transition count 243
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 31 place count 85 transition count 223
Free-agglomeration rule (complex) applied 17 times with reduction of 4 identical transitions.
Iterating global reduction 0 with 17 rules applied. Total rules applied 48 place count 85 transition count 370
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 87 place count 68 transition count 348
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 68 transition count 348
Applied a total of 88 rules in 53 ms. Remains 68 /91 variables (removed 23) and now considering 348/215 (removed -133) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 68/91 places, 348/215 transitions.
RANDOM walk for 40000 steps (4951 resets) in 235 ms. (169 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (76 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1079985 steps, run timeout after 3001 ms. (steps per millisecond=359 ) properties seen :0 out of 1
Probabilistic random walk after 1079985 steps, saw 201649 distinct states, run finished after 3001 ms. (steps per millisecond=359 ) properties seen :0
// Phase 1: matrix 348 rows 68 cols
[2024-06-02 19:31:18] [INFO ] Computed 20 invariants in 8 ms
[2024-06-02 19:31:18] [INFO ] State equation strengthened by 171 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/29 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/58 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/68 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 348/416 variables, 68/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 171/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/416 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 250 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/29 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/58 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/68 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 348/416 variables, 68/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 171/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/416 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 416/416 variables, and 260 constraints, problems are : Problem set: 0 solved, 1 unsolved in 411 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 677ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 6 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 348/348 transitions.
Applied a total of 0 rules in 13 ms. Remains 68 /68 variables (removed 0) and now considering 348/348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 68/68 places, 348/348 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 348/348 transitions.
Applied a total of 0 rules in 14 ms. Remains 68 /68 variables (removed 0) and now considering 348/348 (removed 0) transitions.
[2024-06-02 19:31:19] [INFO ] Invariant cache hit.
[2024-06-02 19:31:19] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-06-02 19:31:19] [INFO ] Invariant cache hit.
[2024-06-02 19:31:19] [INFO ] State equation strengthened by 171 read => feed constraints.
[2024-06-02 19:31:19] [INFO ] Implicit Places using invariants and state equation in 524 ms returned []
Implicit Place search using SMT with State Equation took 690 ms to find 0 implicit places.
[2024-06-02 19:31:19] [INFO ] Redundant transitions in 10 ms returned []
Running 344 sub problems to find dead transitions.
[2024-06-02 19:31:19] [INFO ] Invariant cache hit.
[2024-06-02 19:31:19] [INFO ] State equation strengthened by 171 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 2 (OVERLAPS) 1/68 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-06-02 19:31:23] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 2 ms to minimize.
[2024-06-02 19:31:23] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 1 ms to minimize.
[2024-06-02 19:31:23] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 2 ms to minimize.
[2024-06-02 19:31:23] [INFO ] Deduced a trap composed of 26 places in 159 ms of which 2 ms to minimize.
[2024-06-02 19:31:24] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 2 ms to minimize.
[2024-06-02 19:31:24] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 1 ms to minimize.
[2024-06-02 19:31:24] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 1 ms to minimize.
[2024-06-02 19:31:25] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 5 (OVERLAPS) 348/416 variables, 68/96 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 171/267 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 8 (OVERLAPS) 0/416 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 344 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 267 constraints, problems are : Problem set: 0 solved, 344 unsolved in 19772 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 344/344 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 344 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 2 (OVERLAPS) 1/68 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-06-02 19:31:42] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 6 (OVERLAPS) 348/416 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 171/268 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 344/612 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-06-02 19:31:52] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-06-02 19:31:53] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 2/614 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 344 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/416 variables, and 614 constraints, problems are : Problem set: 0 solved, 344 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 344/344 constraints, Known Traps: 11/11 constraints]
After SMT, in 50643ms problems are : Problem set: 0 solved, 344 unsolved
Search for dead transitions found 0 dead transitions in 50649ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51373 ms. Remains : 68/68 places, 348/348 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 403 edges and 68 vertex of which 60 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 60 transition count 291
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 60 transition count 289
Free-agglomeration rule (complex) applied 2 times with reduction of 30 identical transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 60 transition count 315
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 64 place count 58 transition count 315
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 69 place count 58 transition count 315
Applied a total of 69 rules in 31 ms. Remains 58 /68 variables (removed 10) and now considering 315/348 (removed 33) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 315 rows 58 cols
[2024-06-02 19:32:10] [INFO ] Computed 15 invariants in 2 ms
[2024-06-02 19:32:10] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 19:32:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 19:32:10] [INFO ] [Nat]Absence check using 10 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 19:32:10] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 19:32:10] [INFO ] After 207ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 19:32:10] [INFO ] After 282ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 362 ms.
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 379 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 263 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 256 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 7863 reset in 438 ms.
Entered a terminal (fully accepting) state of product in 19910 steps with 1553 reset in 92 ms.
FORMULA MedleyA-PT-11-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-11-LTLFireability-14 finished in 169374 ms.
All properties solved by simple procedures.
Total runtime 432960 ms.
ITS solved all properties within timeout

BK_STOP 1717356732687

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="MedleyA-PT-11"
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 MedleyA-PT-11, 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 r579-smll-171734921200084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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