fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r516-tajo-171654446700252
Last Updated
July 7, 2024

About the Execution of LTSMin+red for PolyORBLF-PT-S02J06T08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3475.831 1104055.00 2293146.00 194.90 F?FFFFTTFFFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654446700252.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBLF-PT-S02J06T08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446700252
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 24K Apr 11 17:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 138K Apr 11 17:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 30K Apr 11 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 163K Apr 11 17:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 13K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 35K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 48K Apr 11 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 251K Apr 11 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 58K Apr 11 17:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 295K Apr 11 17:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 807K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717253205643

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J06T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:46:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 14:46:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:46:47] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2024-06-01 14:46:47] [INFO ] Transformed 690 places.
[2024-06-01 14:46:47] [INFO ] Transformed 1434 transitions.
[2024-06-01 14:46:47] [INFO ] Parsed PT model containing 690 places and 1434 transitions and 6564 arcs in 217 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 244 out of 690 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 682 transition count 1298
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 682 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 674 transition count 1290
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 674 transition count 1290
Applied a total of 32 rules in 87 ms. Remains 674 /690 variables (removed 16) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2024-06-01 14:46:47] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 674 cols
[2024-06-01 14:46:47] [INFO ] Computed 54 invariants in 95 ms
[2024-06-01 14:46:47] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 35/49 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 14:47:02] [INFO ] Deduced a trap composed of 160 places in 545 ms of which 54 ms to minimize.
[2024-06-01 14:47:02] [INFO ] Deduced a trap composed of 159 places in 577 ms of which 4 ms to minimize.
[2024-06-01 14:47:04] [INFO ] Deduced a trap composed of 333 places in 283 ms of which 10 ms to minimize.
[2024-06-01 14:47:04] [INFO ] Deduced a trap composed of 327 places in 241 ms of which 4 ms to minimize.
[2024-06-01 14:47:04] [INFO ] Deduced a trap composed of 326 places in 282 ms of which 6 ms to minimize.
[2024-06-01 14:47:05] [INFO ] Deduced a trap composed of 319 places in 199 ms of which 4 ms to minimize.
[2024-06-01 14:47:05] [INFO ] Deduced a trap composed of 66 places in 100 ms of which 2 ms to minimize.
[2024-06-01 14:47:05] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2024-06-01 14:47:07] [INFO ] Deduced a trap composed of 47 places in 111 ms of which 1 ms to minimize.
[2024-06-01 14:47:08] [INFO ] Deduced a trap composed of 54 places in 329 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/1948 variables, and 59 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20092 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 35/40 constraints, State Equation: 0/674 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 35/49 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 10/59 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 14:47:17] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 0 ms to minimize.
[2024-06-01 14:47:17] [INFO ] Deduced a trap composed of 71 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:47:17] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:47:17] [INFO ] Deduced a trap composed of 72 places in 93 ms of which 2 ms to minimize.
[2024-06-01 14:47:17] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:47:18] [INFO ] Deduced a trap composed of 71 places in 64 ms of which 2 ms to minimize.
[2024-06-01 14:47:21] [INFO ] Deduced a trap composed of 114 places in 324 ms of which 5 ms to minimize.
[2024-06-01 14:47:25] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:47:27] [INFO ] Deduced a trap composed of 306 places in 355 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/1948 variables, and 68 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 35/40 constraints, State Equation: 0/674 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 19/19 constraints]
After SMT, in 42117ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 42160ms
[2024-06-01 14:47:29] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 14:47:29] [INFO ] Invariant cache hit.
[2024-06-01 14:47:30] [INFO ] Implicit Places using invariants in 475 ms returned [68, 290, 343, 459, 483, 563, 570]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 490 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 667/690 places, 1290/1306 transitions.
Applied a total of 0 rules in 10 ms. Remains 667 /667 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42789 ms. Remains : 667/690 places, 1290/1306 transitions.
Support contains 244 out of 667 places after structural reductions.
[2024-06-01 14:47:30] [INFO ] Flatten gal took : 153 ms
[2024-06-01 14:47:30] [INFO ] Flatten gal took : 155 ms
[2024-06-01 14:47:31] [INFO ] Input system was already deterministic with 1290 transitions.
Support contains 243 out of 667 places (down from 244) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 29 to 28
RANDOM walk for 40000 steps (13 resets) in 1907 ms. (20 steps per ms) remains 4/28 properties
BEST_FIRST walk for 40001 steps (11 resets) in 647 ms. (61 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 370 ms. (107 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (13 resets) in 161 ms. (246 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 227 ms. (175 steps per ms) remains 4/4 properties
[2024-06-01 14:47:32] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 667 cols
[2024-06-01 14:47:32] [INFO ] Computed 47 invariants in 34 ms
[2024-06-01 14:47:32] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 140/211 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/213 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 5 (OVERLAPS) 424/637 variables, 22/28 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/637 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 6/643 variables, 6/34 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/643 variables, 0/34 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp28 is UNSAT
At refinement iteration 9 (OVERLAPS) 22/665 variables, 12/46 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/665 variables, 0/46 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1274/1939 variables, 665/711 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1939 variables, 96/807 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1939 variables, 0/807 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/1941 variables, 2/809 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1941 variables, 1/810 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1941 variables, 0/810 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1941 variables, 0/810 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1941/1941 variables, and 810 constraints, problems are : Problem set: 2 solved, 2 unsolved in 2006 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 667/667 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 320/323 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 111/434 variables, 8/13 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/434 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/436 variables, 1/14 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 0/14 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 226/662 variables, 29/43 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 14:47:34] [INFO ] Deduced a trap composed of 72 places in 278 ms of which 5 ms to minimize.
[2024-06-01 14:47:35] [INFO ] Deduced a trap composed of 72 places in 277 ms of which 4 ms to minimize.
[2024-06-01 14:47:35] [INFO ] Deduced a trap composed of 72 places in 177 ms of which 3 ms to minimize.
[2024-06-01 14:47:35] [INFO ] Deduced a trap composed of 72 places in 148 ms of which 3 ms to minimize.
[2024-06-01 14:47:35] [INFO ] Deduced a trap composed of 73 places in 116 ms of which 2 ms to minimize.
[2024-06-01 14:47:35] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:47:35] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/662 variables, 7/50 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/662 variables, 0/50 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3/665 variables, 3/53 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/665 variables, 0/53 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1274/1939 variables, 665/718 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1939/1941 variables, and 814 constraints, problems are : Problem set: 2 solved, 2 unsolved in 3441 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 665/667 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 7/7 constraints]
After SMT, in 5592ms problems are : Problem set: 2 solved, 2 unsolved
Parikh walk visited 0 properties in 974 ms.
Support contains 3 out of 667 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 667/667 places, 1290/1290 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 665 transition count 1236
Reduce places removed 54 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 55 rules applied. Total rules applied 111 place count 611 transition count 1235
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 112 place count 610 transition count 1235
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 112 place count 610 transition count 1155
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 272 place count 530 transition count 1155
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 400 place count 466 transition count 1091
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 403 place count 463 transition count 1088
Iterating global reduction 3 with 3 rules applied. Total rules applied 406 place count 463 transition count 1088
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 3 with 16 rules applied. Total rules applied 422 place count 463 transition count 1072
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 438 place count 447 transition count 1072
Applied a total of 438 rules in 242 ms. Remains 447 /667 variables (removed 220) and now considering 1072/1290 (removed 218) transitions.
Running 1070 sub problems to find dead transitions.
[2024-06-01 14:47:39] [INFO ] Flow matrix only has 1056 transitions (discarded 16 similar events)
// Phase 1: matrix 1056 rows 447 cols
[2024-06-01 14:47:39] [INFO ] Computed 45 invariants in 23 ms
[2024-06-01 14:47:39] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1070 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 28/43 constraints. Problems are: Problem set: 0 solved, 1070 unsolved
[2024-06-01 14:47:47] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:47:47] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:47:47] [INFO ] Deduced a trap composed of 44 places in 32 ms of which 0 ms to minimize.
[2024-06-01 14:47:47] [INFO ] Deduced a trap composed of 45 places in 33 ms of which 1 ms to minimize.
[2024-06-01 14:47:47] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:47:48] [INFO ] Deduced a trap composed of 55 places in 182 ms of which 3 ms to minimize.
[2024-06-01 14:47:48] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:47:48] [INFO ] Deduced a trap composed of 45 places in 37 ms of which 2 ms to minimize.
[2024-06-01 14:47:48] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 6 ms to minimize.
[2024-06-01 14:47:48] [INFO ] Deduced a trap composed of 169 places in 212 ms of which 3 ms to minimize.
[2024-06-01 14:47:48] [INFO ] Deduced a trap composed of 150 places in 198 ms of which 2 ms to minimize.
[2024-06-01 14:47:51] [INFO ] Deduced a trap composed of 44 places in 267 ms of which 3 ms to minimize.
[2024-06-01 14:47:51] [INFO ] Deduced a trap composed of 65 places in 249 ms of which 3 ms to minimize.
[2024-06-01 14:47:52] [INFO ] Deduced a trap composed of 19 places in 208 ms of which 3 ms to minimize.
[2024-06-01 14:47:54] [INFO ] Deduced a trap composed of 179 places in 295 ms of which 4 ms to minimize.
[2024-06-01 14:47:55] [INFO ] Deduced a trap composed of 178 places in 243 ms of which 3 ms to minimize.
[2024-06-01 14:47:56] [INFO ] Deduced a trap composed of 180 places in 308 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 17/60 constraints. Problems are: Problem set: 0 solved, 1070 unsolved
[2024-06-01 14:48:00] [INFO ] Deduced a trap composed of 166 places in 272 ms of which 3 ms to minimize.
[2024-06-01 14:48:00] [INFO ] Deduced a trap composed of 160 places in 246 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 445/1503 variables, and 62 constraints, problems are : Problem set: 0 solved, 1070 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/447 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1070/1070 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1070 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1070 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 28/43 constraints. Problems are: Problem set: 0 solved, 1070 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 19/62 constraints. Problems are: Problem set: 0 solved, 1070 unsolved
[2024-06-01 14:48:14] [INFO ] Deduced a trap composed of 281 places in 259 ms of which 4 ms to minimize.
[2024-06-01 14:48:20] [INFO ] Deduced a trap composed of 184 places in 298 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 445/1503 variables, and 64 constraints, problems are : Problem set: 0 solved, 1070 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/447 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1070 constraints, Known Traps: 21/21 constraints]
After SMT, in 42170ms problems are : Problem set: 0 solved, 1070 unsolved
Search for dead transitions found 0 dead transitions in 42202ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42448 ms. Remains : 447/667 places, 1072/1290 transitions.
RANDOM walk for 40000 steps (26 resets) in 954 ms. (41 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (10 resets) in 240 ms. (165 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (11 resets) in 226 ms. (176 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 160139 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 2
Probabilistic random walk after 160139 steps, saw 98786 distinct states, run finished after 3009 ms. (steps per millisecond=53 ) properties seen :0
[2024-06-01 14:48:24] [INFO ] Flow matrix only has 1056 transitions (discarded 16 similar events)
[2024-06-01 14:48:24] [INFO ] Invariant cache hit.
[2024-06-01 14:48:24] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 38/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 341/382 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/382 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 13/395 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 49/444 variables, 25/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 14:48:25] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 2 ms to minimize.
[2024-06-01 14:48:25] [INFO ] Deduced a trap composed of 45 places in 112 ms of which 2 ms to minimize.
[2024-06-01 14:48:25] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 1 ms to minimize.
[2024-06-01 14:48:25] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 2 ms to minimize.
[2024-06-01 14:48:25] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:48:25] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/445 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/445 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1056/1501 variables, 445/495 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1501 variables, 96/591 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1501 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 2/1503 variables, 2/593 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1503 variables, 1/594 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1503 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1503 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1503/1503 variables, and 594 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4895 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 447/447 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 38/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 341/382 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/382 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 13/395 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 49/444 variables, 25/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 14:48:29] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/445 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/445 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1501/1503 variables, and 496 constraints, problems are : Problem set: 0 solved, 2 unsolved in 45018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 445/447 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 49933ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 447 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 1072/1072 transitions.
Applied a total of 0 rules in 27 ms. Remains 447 /447 variables (removed 0) and now considering 1072/1072 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 447/447 places, 1072/1072 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 1072/1072 transitions.
Applied a total of 0 rules in 23 ms. Remains 447 /447 variables (removed 0) and now considering 1072/1072 (removed 0) transitions.
[2024-06-01 14:49:14] [INFO ] Flow matrix only has 1056 transitions (discarded 16 similar events)
[2024-06-01 14:49:14] [INFO ] Invariant cache hit.
[2024-06-01 14:49:15] [INFO ] Implicit Places using invariants in 437 ms returned [114]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 441 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 446/447 places, 1072/1072 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 445 transition count 1071
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 445 transition count 1071
Applied a total of 2 rules in 28 ms. Remains 445 /446 variables (removed 1) and now considering 1071/1072 (removed 1) transitions.
[2024-06-01 14:49:15] [INFO ] Flow matrix only has 1055 transitions (discarded 16 similar events)
// Phase 1: matrix 1055 rows 445 cols
[2024-06-01 14:49:15] [INFO ] Computed 44 invariants in 11 ms
[2024-06-01 14:49:15] [INFO ] Implicit Places using invariants in 498 ms returned []
[2024-06-01 14:49:15] [INFO ] Flow matrix only has 1055 transitions (discarded 16 similar events)
[2024-06-01 14:49:15] [INFO ] Invariant cache hit.
[2024-06-01 14:49:16] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:49:21] [INFO ] Implicit Places using invariants and state equation in 5820 ms returned []
Implicit Place search using SMT with State Equation took 6325 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 445/447 places, 1071/1072 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6817 ms. Remains : 445/447 places, 1071/1072 transitions.
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-15 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(((!p0 U p1)||F(G(p2)))))))'
Support contains 30 out of 667 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 667/667 places, 1290/1290 transitions.
Applied a total of 0 rules in 11 ms. Remains 667 /667 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Running 1288 sub problems to find dead transitions.
[2024-06-01 14:49:21] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 667 cols
[2024-06-01 14:49:21] [INFO ] Computed 47 invariants in 36 ms
[2024-06-01 14:49:21] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/663 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/663 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 14:49:35] [INFO ] Deduced a trap composed of 73 places in 117 ms of which 3 ms to minimize.
[2024-06-01 14:49:35] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 2 ms to minimize.
[2024-06-01 14:49:35] [INFO ] Deduced a trap composed of 72 places in 85 ms of which 7 ms to minimize.
[2024-06-01 14:49:36] [INFO ] Deduced a trap composed of 165 places in 324 ms of which 6 ms to minimize.
[2024-06-01 14:49:36] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:49:36] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 0 ms to minimize.
[2024-06-01 14:49:36] [INFO ] Deduced a trap composed of 73 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:49:37] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 2 ms to minimize.
[2024-06-01 14:49:37] [INFO ] Deduced a trap composed of 72 places in 383 ms of which 5 ms to minimize.
[2024-06-01 14:49:38] [INFO ] Deduced a trap composed of 326 places in 354 ms of which 5 ms to minimize.
[2024-06-01 14:49:38] [INFO ] Deduced a trap composed of 47 places in 178 ms of which 2 ms to minimize.
[2024-06-01 14:49:39] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 3 ms to minimize.
[2024-06-01 14:49:39] [INFO ] Deduced a trap composed of 357 places in 288 ms of which 4 ms to minimize.
[2024-06-01 14:49:42] [INFO ] Deduced a trap composed of 54 places in 298 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 663/1941 variables, and 57 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 30/34 constraints, State Equation: 0/667 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/663 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/663 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/663 variables, 14/57 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 663/1941 variables, and 57 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20053 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 30/34 constraints, State Equation: 0/667 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 14/14 constraints]
After SMT, in 42285ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 42303ms
[2024-06-01 14:50:04] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 14:50:04] [INFO ] Invariant cache hit.
[2024-06-01 14:50:04] [INFO ] Implicit Places using invariants in 766 ms returned [178]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 771 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 666/667 places, 1290/1290 transitions.
Applied a total of 0 rules in 17 ms. Remains 666 /666 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43111 ms. Remains : 666/667 places, 1290/1290 transitions.
Stuttering acceptance computed with spot in 461 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PolyORBLF-PT-S02J06T08-LTLFireability-00
Stuttering criterion allowed to conclude after 1627 steps with 0 reset in 42 ms.
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T08-LTLFireability-00 finished in 43690 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((X(F(p1))||p0))))'
Support contains 20 out of 667 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 667/667 places, 1290/1290 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 665 transition count 1242
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 617 transition count 1242
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 96 place count 617 transition count 1162
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 256 place count 537 transition count 1162
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 384 place count 473 transition count 1098
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 387 place count 470 transition count 1095
Iterating global reduction 2 with 3 rules applied. Total rules applied 390 place count 470 transition count 1095
Applied a total of 390 rules in 102 ms. Remains 470 /667 variables (removed 197) and now considering 1095/1290 (removed 195) transitions.
Running 1093 sub problems to find dead transitions.
[2024-06-01 14:50:05] [INFO ] Flow matrix only has 1079 transitions (discarded 16 similar events)
// Phase 1: matrix 1079 rows 470 cols
[2024-06-01 14:50:05] [INFO ] Computed 45 invariants in 22 ms
[2024-06-01 14:50:05] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1093 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 31/43 constraints. Problems are: Problem set: 0 solved, 1093 unsolved
[2024-06-01 14:50:14] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:50:14] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:50:14] [INFO ] Deduced a trap composed of 47 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:50:14] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:50:14] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:50:14] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:50:15] [INFO ] Deduced a trap composed of 48 places in 211 ms of which 2 ms to minimize.
[2024-06-01 14:50:15] [INFO ] Deduced a trap composed of 185 places in 210 ms of which 2 ms to minimize.
[2024-06-01 14:50:15] [INFO ] Deduced a trap composed of 166 places in 261 ms of which 3 ms to minimize.
[2024-06-01 14:50:15] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:50:16] [INFO ] Deduced a trap composed of 36 places in 293 ms of which 4 ms to minimize.
[2024-06-01 14:50:16] [INFO ] Deduced a trap composed of 101 places in 232 ms of which 3 ms to minimize.
[2024-06-01 14:50:16] [INFO ] Deduced a trap composed of 183 places in 238 ms of which 4 ms to minimize.
[2024-06-01 14:50:17] [INFO ] Deduced a trap composed of 190 places in 244 ms of which 3 ms to minimize.
[2024-06-01 14:50:18] [INFO ] Deduced a trap composed of 39 places in 177 ms of which 2 ms to minimize.
[2024-06-01 14:50:22] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 2 ms to minimize.
[2024-06-01 14:50:24] [INFO ] Deduced a trap composed of 171 places in 284 ms of which 3 ms to minimize.
[2024-06-01 14:50:26] [INFO ] Deduced a trap composed of 211 places in 266 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 468/1549 variables, and 61 constraints, problems are : Problem set: 0 solved, 1093 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/470 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1093/1093 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1093 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1093 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 31/43 constraints. Problems are: Problem set: 0 solved, 1093 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/468 variables, 18/61 constraints. Problems are: Problem set: 0 solved, 1093 unsolved
[2024-06-01 14:50:40] [INFO ] Deduced a trap composed of 208 places in 357 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 468/1549 variables, and 62 constraints, problems are : Problem set: 0 solved, 1093 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/470 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1093 constraints, Known Traps: 19/19 constraints]
After SMT, in 41879ms problems are : Problem set: 0 solved, 1093 unsolved
Search for dead transitions found 0 dead transitions in 41896ms
[2024-06-01 14:50:47] [INFO ] Flow matrix only has 1079 transitions (discarded 16 similar events)
[2024-06-01 14:50:47] [INFO ] Invariant cache hit.
[2024-06-01 14:50:48] [INFO ] Implicit Places using invariants in 575 ms returned [119]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 579 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 469/667 places, 1095/1290 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 468 transition count 1094
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 468 transition count 1094
Applied a total of 2 rules in 34 ms. Remains 468 /469 variables (removed 1) and now considering 1094/1095 (removed 1) transitions.
[2024-06-01 14:50:48] [INFO ] Flow matrix only has 1078 transitions (discarded 16 similar events)
// Phase 1: matrix 1078 rows 468 cols
[2024-06-01 14:50:48] [INFO ] Computed 44 invariants in 11 ms
[2024-06-01 14:50:48] [INFO ] Implicit Places using invariants in 409 ms returned []
[2024-06-01 14:50:48] [INFO ] Flow matrix only has 1078 transitions (discarded 16 similar events)
[2024-06-01 14:50:48] [INFO ] Invariant cache hit.
[2024-06-01 14:50:49] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:50:55] [INFO ] Implicit Places using invariants and state equation in 6876 ms returned []
Implicit Place search using SMT with State Equation took 7303 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 468/667 places, 1094/1290 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 49918 ms. Remains : 468/667 places, 1094/1290 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S02J06T08-LTLFireability-01
Product exploration explored 100000 steps with 3720 reset in 703 ms.
Product exploration explored 100000 steps with 3712 reset in 659 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 129 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 131 steps (0 resets) in 8 ms. (14 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 195 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 14:50:57] [INFO ] Flow matrix only has 1078 transitions (discarded 16 similar events)
[2024-06-01 14:50:57] [INFO ] Invariant cache hit.
[2024-06-01 14:50:58] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-06-01 14:50:58] [INFO ] [Real]Absence check using 12 positive and 32 generalized place invariants in 102 ms returned sat
[2024-06-01 14:51:00] [INFO ] [Real]Absence check using state equation in 1733 ms returned sat
[2024-06-01 14:51:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:51:00] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-06-01 14:51:00] [INFO ] [Nat]Absence check using 12 positive and 32 generalized place invariants in 61 ms returned sat
[2024-06-01 14:51:04] [INFO ] [Nat]Absence check using state equation in 4048 ms returned sat
[2024-06-01 14:51:04] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:51:05] [INFO ] [Nat]Added 96 Read/Feed constraints in 934 ms returned sat
[2024-06-01 14:51:05] [INFO ] Deduced a trap composed of 47 places in 106 ms of which 2 ms to minimize.
[2024-06-01 14:51:07] [INFO ] Deduced a trap composed of 47 places in 93 ms of which 2 ms to minimize.
[2024-06-01 14:51:07] [INFO ] Deduced a trap composed of 48 places in 102 ms of which 1 ms to minimize.
[2024-06-01 14:51:07] [INFO ] Deduced a trap composed of 48 places in 96 ms of which 2 ms to minimize.
[2024-06-01 14:51:08] [INFO ] Deduced a trap composed of 48 places in 100 ms of which 2 ms to minimize.
[2024-06-01 14:51:09] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 1 ms to minimize.
[2024-06-01 14:51:09] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:51:09] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3681 ms
[2024-06-01 14:51:09] [INFO ] Computed and/alt/rep : 424/1501/416 causal constraints (skipped 660 transitions) in 135 ms.
[2024-06-01 14:51:13] [INFO ] Added : 127 causal constraints over 26 iterations in 4225 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 20 out of 468 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 468/468 places, 1094/1094 transitions.
Applied a total of 0 rules in 42 ms. Remains 468 /468 variables (removed 0) and now considering 1094/1094 (removed 0) transitions.
Running 1092 sub problems to find dead transitions.
[2024-06-01 14:51:13] [INFO ] Flow matrix only has 1078 transitions (discarded 16 similar events)
[2024-06-01 14:51:13] [INFO ] Invariant cache hit.
[2024-06-01 14:51:13] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
[2024-06-01 14:51:22] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:51:22] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 2 ms to minimize.
[2024-06-01 14:51:22] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:51:23] [INFO ] Deduced a trap composed of 48 places in 255 ms of which 4 ms to minimize.
[2024-06-01 14:51:23] [INFO ] Deduced a trap composed of 166 places in 239 ms of which 3 ms to minimize.
[2024-06-01 14:51:23] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 0 ms to minimize.
[2024-06-01 14:51:23] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:51:23] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:51:23] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:51:24] [INFO ] Deduced a trap composed of 179 places in 268 ms of which 3 ms to minimize.
[2024-06-01 14:51:26] [INFO ] Deduced a trap composed of 83 places in 281 ms of which 3 ms to minimize.
[2024-06-01 14:51:26] [INFO ] Deduced a trap composed of 39 places in 198 ms of which 3 ms to minimize.
[2024-06-01 14:51:30] [INFO ] Deduced a trap composed of 19 places in 170 ms of which 3 ms to minimize.
[2024-06-01 14:51:32] [INFO ] Deduced a trap composed of 160 places in 209 ms of which 2 ms to minimize.
[2024-06-01 14:51:34] [INFO ] Deduced a trap composed of 206 places in 306 ms of which 3 ms to minimize.
[2024-06-01 14:51:34] [INFO ] Deduced a trap composed of 182 places in 323 ms of which 3 ms to minimize.
[2024-06-01 14:51:35] [INFO ] Deduced a trap composed of 212 places in 257 ms of which 3 ms to minimize.
[2024-06-01 14:51:35] [INFO ] Deduced a trap composed of 197 places in 261 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/1546 variables, and 60 constraints, problems are : Problem set: 0 solved, 1092 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/468 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1092/1092 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1092 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/1546 variables, and 60 constraints, problems are : Problem set: 0 solved, 1092 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/468 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1092 constraints, Known Traps: 18/18 constraints]
After SMT, in 41846ms problems are : Problem set: 0 solved, 1092 unsolved
Search for dead transitions found 0 dead transitions in 41867ms
[2024-06-01 14:51:55] [INFO ] Flow matrix only has 1078 transitions (discarded 16 similar events)
[2024-06-01 14:51:55] [INFO ] Invariant cache hit.
[2024-06-01 14:51:56] [INFO ] Implicit Places using invariants in 567 ms returned []
[2024-06-01 14:51:56] [INFO ] Flow matrix only has 1078 transitions (discarded 16 similar events)
[2024-06-01 14:51:56] [INFO ] Invariant cache hit.
[2024-06-01 14:51:57] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:52:02] [INFO ] Implicit Places using invariants and state equation in 6546 ms returned []
Implicit Place search using SMT with State Equation took 7115 ms to find 0 implicit places.
[2024-06-01 14:52:02] [INFO ] Redundant transitions in 100 ms returned []
Running 1092 sub problems to find dead transitions.
[2024-06-01 14:52:02] [INFO ] Flow matrix only has 1078 transitions (discarded 16 similar events)
[2024-06-01 14:52:02] [INFO ] Invariant cache hit.
[2024-06-01 14:52:02] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
[2024-06-01 14:52:11] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 2 ms to minimize.
[2024-06-01 14:52:11] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:52:11] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:52:11] [INFO ] Deduced a trap composed of 48 places in 292 ms of which 3 ms to minimize.
[2024-06-01 14:52:11] [INFO ] Deduced a trap composed of 166 places in 257 ms of which 4 ms to minimize.
[2024-06-01 14:52:12] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:52:12] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:52:12] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:52:12] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:52:12] [INFO ] Deduced a trap composed of 179 places in 289 ms of which 4 ms to minimize.
[2024-06-01 14:52:14] [INFO ] Deduced a trap composed of 83 places in 223 ms of which 3 ms to minimize.
[2024-06-01 14:52:14] [INFO ] Deduced a trap composed of 39 places in 161 ms of which 2 ms to minimize.
[2024-06-01 14:52:18] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 6 ms to minimize.
[2024-06-01 14:52:21] [INFO ] Deduced a trap composed of 160 places in 277 ms of which 3 ms to minimize.
[2024-06-01 14:52:22] [INFO ] Deduced a trap composed of 206 places in 279 ms of which 4 ms to minimize.
[2024-06-01 14:52:22] [INFO ] Deduced a trap composed of 182 places in 268 ms of which 4 ms to minimize.
[2024-06-01 14:52:23] [INFO ] Deduced a trap composed of 212 places in 270 ms of which 3 ms to minimize.
[2024-06-01 14:52:23] [INFO ] Deduced a trap composed of 197 places in 239 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
[2024-06-01 14:52:34] [INFO ] Deduced a trap composed of 211 places in 296 ms of which 4 ms to minimize.
SMT process timed out in 31982ms, After SMT, problems are : Problem set: 0 solved, 1092 unsolved
Search for dead transitions found 0 dead transitions in 32005ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 81150 ms. Remains : 468/468 places, 1094/1094 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 95 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 810 steps (0 resets) in 17 ms. (45 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 178 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 14:52:35] [INFO ] Flow matrix only has 1078 transitions (discarded 16 similar events)
[2024-06-01 14:52:35] [INFO ] Invariant cache hit.
[2024-06-01 14:52:35] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-06-01 14:52:36] [INFO ] [Real]Absence check using 12 positive and 32 generalized place invariants in 92 ms returned sat
[2024-06-01 14:52:37] [INFO ] [Real]Absence check using state equation in 1581 ms returned sat
[2024-06-01 14:52:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:52:38] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-06-01 14:52:38] [INFO ] [Nat]Absence check using 12 positive and 32 generalized place invariants in 61 ms returned sat
[2024-06-01 14:52:43] [INFO ] [Nat]Absence check using state equation in 4809 ms returned sat
[2024-06-01 14:52:43] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:52:43] [INFO ] [Nat]Added 96 Read/Feed constraints in 674 ms returned sat
[2024-06-01 14:52:43] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:52:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 419 ms
[2024-06-01 14:52:44] [INFO ] Computed and/alt/rep : 424/1501/416 causal constraints (skipped 660 transitions) in 91 ms.
[2024-06-01 14:52:46] [INFO ] Added : 99 causal constraints over 20 iterations in 2553 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3715 reset in 700 ms.
Product exploration explored 100000 steps with 3721 reset in 519 ms.
Support contains 20 out of 468 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 468/468 places, 1094/1094 transitions.
Applied a total of 0 rules in 41 ms. Remains 468 /468 variables (removed 0) and now considering 1094/1094 (removed 0) transitions.
Running 1092 sub problems to find dead transitions.
[2024-06-01 14:52:48] [INFO ] Flow matrix only has 1078 transitions (discarded 16 similar events)
[2024-06-01 14:52:48] [INFO ] Invariant cache hit.
[2024-06-01 14:52:48] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
[2024-06-01 14:52:56] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 2 ms to minimize.
[2024-06-01 14:52:56] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 1 ms to minimize.
[2024-06-01 14:52:57] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:52:57] [INFO ] Deduced a trap composed of 48 places in 287 ms of which 4 ms to minimize.
[2024-06-01 14:52:57] [INFO ] Deduced a trap composed of 166 places in 254 ms of which 4 ms to minimize.
[2024-06-01 14:52:57] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:52:57] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:52:57] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:52:58] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:52:58] [INFO ] Deduced a trap composed of 179 places in 304 ms of which 3 ms to minimize.
[2024-06-01 14:53:00] [INFO ] Deduced a trap composed of 83 places in 261 ms of which 4 ms to minimize.
[2024-06-01 14:53:00] [INFO ] Deduced a trap composed of 39 places in 180 ms of which 3 ms to minimize.
[2024-06-01 14:53:04] [INFO ] Deduced a trap composed of 19 places in 205 ms of which 2 ms to minimize.
[2024-06-01 14:53:06] [INFO ] Deduced a trap composed of 160 places in 275 ms of which 4 ms to minimize.
[2024-06-01 14:53:08] [INFO ] Deduced a trap composed of 206 places in 287 ms of which 4 ms to minimize.
[2024-06-01 14:53:08] [INFO ] Deduced a trap composed of 182 places in 345 ms of which 5 ms to minimize.
[2024-06-01 14:53:09] [INFO ] Deduced a trap composed of 212 places in 311 ms of which 3 ms to minimize.
[2024-06-01 14:53:09] [INFO ] Deduced a trap composed of 197 places in 321 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/1546 variables, and 60 constraints, problems are : Problem set: 0 solved, 1092 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/468 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1092/1092 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1092 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/1546 variables, and 60 constraints, problems are : Problem set: 0 solved, 1092 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/468 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1092 constraints, Known Traps: 18/18 constraints]
After SMT, in 41903ms problems are : Problem set: 0 solved, 1092 unsolved
Search for dead transitions found 0 dead transitions in 41924ms
[2024-06-01 14:53:30] [INFO ] Flow matrix only has 1078 transitions (discarded 16 similar events)
[2024-06-01 14:53:30] [INFO ] Invariant cache hit.
[2024-06-01 14:53:30] [INFO ] Implicit Places using invariants in 571 ms returned []
[2024-06-01 14:53:30] [INFO ] Flow matrix only has 1078 transitions (discarded 16 similar events)
[2024-06-01 14:53:30] [INFO ] Invariant cache hit.
[2024-06-01 14:53:31] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:53:37] [INFO ] Implicit Places using invariants and state equation in 6703 ms returned []
Implicit Place search using SMT with State Equation took 7278 ms to find 0 implicit places.
[2024-06-01 14:53:37] [INFO ] Redundant transitions in 87 ms returned []
Running 1092 sub problems to find dead transitions.
[2024-06-01 14:53:37] [INFO ] Flow matrix only has 1078 transitions (discarded 16 similar events)
[2024-06-01 14:53:37] [INFO ] Invariant cache hit.
[2024-06-01 14:53:37] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
[2024-06-01 14:53:46] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 2 ms to minimize.
[2024-06-01 14:53:46] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 1 ms to minimize.
[2024-06-01 14:53:46] [INFO ] Deduced a trap composed of 47 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:53:46] [INFO ] Deduced a trap composed of 48 places in 247 ms of which 4 ms to minimize.
[2024-06-01 14:53:46] [INFO ] Deduced a trap composed of 166 places in 257 ms of which 4 ms to minimize.
[2024-06-01 14:53:46] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 2 ms to minimize.
[2024-06-01 14:53:47] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 2 ms to minimize.
[2024-06-01 14:53:47] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:53:47] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:53:47] [INFO ] Deduced a trap composed of 179 places in 308 ms of which 4 ms to minimize.
[2024-06-01 14:53:49] [INFO ] Deduced a trap composed of 83 places in 317 ms of which 5 ms to minimize.
[2024-06-01 14:53:50] [INFO ] Deduced a trap composed of 39 places in 194 ms of which 2 ms to minimize.
[2024-06-01 14:53:53] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 2 ms to minimize.
[2024-06-01 14:53:56] [INFO ] Deduced a trap composed of 160 places in 255 ms of which 3 ms to minimize.
[2024-06-01 14:53:57] [INFO ] Deduced a trap composed of 206 places in 269 ms of which 3 ms to minimize.
[2024-06-01 14:53:57] [INFO ] Deduced a trap composed of 182 places in 284 ms of which 4 ms to minimize.
[2024-06-01 14:53:58] [INFO ] Deduced a trap composed of 212 places in 266 ms of which 4 ms to minimize.
[2024-06-01 14:53:58] [INFO ] Deduced a trap composed of 197 places in 303 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/1546 variables, and 60 constraints, problems are : Problem set: 0 solved, 1092 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/468 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1092/1092 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1092 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
[2024-06-01 14:54:35] [INFO ] Deduced a trap composed of 294 places in 269 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/1546 variables, and 61 constraints, problems are : Problem set: 0 solved, 1092 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/468 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1092 constraints, Known Traps: 19/19 constraints]
After SMT, in 61987ms problems are : Problem set: 0 solved, 1092 unsolved
Search for dead transitions found 0 dead transitions in 62002ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 111350 ms. Remains : 468/468 places, 1094/1094 transitions.
Treatment of property PolyORBLF-PT-S02J06T08-LTLFireability-01 finished in 274151 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(p1)||p0)))'
Support contains 18 out of 667 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 667/667 places, 1290/1290 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 665 transition count 1250
Reduce places removed 40 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 48 rules applied. Total rules applied 88 place count 625 transition count 1242
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 96 place count 617 transition count 1242
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 96 place count 617 transition count 1162
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 256 place count 537 transition count 1162
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 352 place count 489 transition count 1114
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 355 place count 486 transition count 1111
Iterating global reduction 3 with 3 rules applied. Total rules applied 358 place count 486 transition count 1111
Applied a total of 358 rules in 154 ms. Remains 486 /667 variables (removed 181) and now considering 1111/1290 (removed 179) transitions.
Running 1109 sub problems to find dead transitions.
[2024-06-01 14:54:39] [INFO ] Flow matrix only has 1095 transitions (discarded 16 similar events)
// Phase 1: matrix 1095 rows 486 cols
[2024-06-01 14:54:39] [INFO ] Computed 45 invariants in 33 ms
[2024-06-01 14:54:39] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/484 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/484 variables, 29/43 constraints. Problems are: Problem set: 0 solved, 1109 unsolved
[2024-06-01 14:54:49] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:54:49] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:54:49] [INFO ] Deduced a trap composed of 49 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:54:49] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 0 ms to minimize.
[2024-06-01 14:54:49] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:54:49] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:54:49] [INFO ] Deduced a trap composed of 31 places in 186 ms of which 2 ms to minimize.
[2024-06-01 14:54:49] [INFO ] Deduced a trap composed of 50 places in 36 ms of which 0 ms to minimize.
[2024-06-01 14:54:49] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:54:50] [INFO ] Deduced a trap composed of 189 places in 292 ms of which 4 ms to minimize.
[2024-06-01 14:54:50] [INFO ] Deduced a trap composed of 174 places in 326 ms of which 4 ms to minimize.
[2024-06-01 14:54:51] [INFO ] Deduced a trap composed of 201 places in 292 ms of which 4 ms to minimize.
[2024-06-01 14:54:51] [INFO ] Deduced a trap composed of 185 places in 241 ms of which 4 ms to minimize.
[2024-06-01 14:54:52] [INFO ] Deduced a trap composed of 72 places in 166 ms of which 2 ms to minimize.
[2024-06-01 14:54:53] [INFO ] Deduced a trap composed of 93 places in 312 ms of which 4 ms to minimize.
[2024-06-01 14:54:55] [INFO ] Deduced a trap composed of 50 places in 297 ms of which 3 ms to minimize.
[2024-06-01 14:54:59] [INFO ] Deduced a trap composed of 19 places in 210 ms of which 3 ms to minimize.
[2024-06-01 14:55:01] [INFO ] Deduced a trap composed of 216 places in 260 ms of which 6 ms to minimize.
SMT process timed out in 21850ms, After SMT, problems are : Problem set: 0 solved, 1109 unsolved
Search for dead transitions found 0 dead transitions in 21876ms
[2024-06-01 14:55:01] [INFO ] Flow matrix only has 1095 transitions (discarded 16 similar events)
[2024-06-01 14:55:01] [INFO ] Invariant cache hit.
[2024-06-01 14:55:02] [INFO ] Implicit Places using invariants in 568 ms returned [127]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 570 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 485/667 places, 1111/1290 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 484 transition count 1110
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 484 transition count 1110
Applied a total of 2 rules in 29 ms. Remains 484 /485 variables (removed 1) and now considering 1110/1111 (removed 1) transitions.
[2024-06-01 14:55:02] [INFO ] Flow matrix only has 1094 transitions (discarded 16 similar events)
// Phase 1: matrix 1094 rows 484 cols
[2024-06-01 14:55:02] [INFO ] Computed 44 invariants in 13 ms
[2024-06-01 14:55:02] [INFO ] Implicit Places using invariants in 451 ms returned []
[2024-06-01 14:55:02] [INFO ] Flow matrix only has 1094 transitions (discarded 16 similar events)
[2024-06-01 14:55:02] [INFO ] Invariant cache hit.
[2024-06-01 14:55:03] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:55:13] [INFO ] Implicit Places using invariants and state equation in 10801 ms returned []
Implicit Place search using SMT with State Equation took 11257 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 484/667 places, 1110/1290 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 33901 ms. Remains : 484/667 places, 1110/1290 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S02J06T08-LTLFireability-02
Stuttering criterion allowed to conclude after 1034 steps with 19 reset in 5 ms.
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T08-LTLFireability-02 finished in 33998 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&(X(F(p2))||p1))))'
Support contains 28 out of 667 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 667/667 places, 1290/1290 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 665 transition count 1290
Applied a total of 2 rules in 23 ms. Remains 665 /667 variables (removed 2) and now considering 1290/1290 (removed 0) transitions.
Running 1288 sub problems to find dead transitions.
[2024-06-01 14:55:13] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 665 cols
[2024-06-01 14:55:13] [INFO ] Computed 45 invariants in 33 ms
[2024-06-01 14:55:13] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/663 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/663 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 14:55:25] [INFO ] Deduced a trap composed of 72 places in 111 ms of which 2 ms to minimize.
[2024-06-01 14:55:25] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:55:26] [INFO ] Deduced a trap composed of 159 places in 386 ms of which 4 ms to minimize.
[2024-06-01 14:55:26] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:55:26] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 2 ms to minimize.
[2024-06-01 14:55:26] [INFO ] Deduced a trap composed of 73 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:55:26] [INFO ] Deduced a trap composed of 72 places in 85 ms of which 1 ms to minimize.
[2024-06-01 14:55:26] [INFO ] Deduced a trap composed of 73 places in 79 ms of which 1 ms to minimize.
[2024-06-01 14:55:27] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:55:28] [INFO ] Deduced a trap composed of 350 places in 408 ms of which 5 ms to minimize.
[2024-06-01 14:55:29] [INFO ] Deduced a trap composed of 326 places in 415 ms of which 5 ms to minimize.
[2024-06-01 14:55:30] [INFO ] Deduced a trap composed of 74 places in 446 ms of which 5 ms to minimize.
[2024-06-01 14:55:31] [INFO ] Deduced a trap composed of 348 places in 385 ms of which 4 ms to minimize.
[2024-06-01 14:55:32] [INFO ] Deduced a trap composed of 19 places in 331 ms of which 3 ms to minimize.
[2024-06-01 14:55:32] [INFO ] Deduced a trap composed of 337 places in 404 ms of which 5 ms to minimize.
[2024-06-01 14:55:33] [INFO ] Deduced a trap composed of 47 places in 201 ms of which 3 ms to minimize.
[2024-06-01 14:55:33] [INFO ] Deduced a trap composed of 368 places in 365 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 663/1939 variables, and 59 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/31 constraints, State Equation: 0/665 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/663 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/663 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/663 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 14:55:52] [INFO ] Deduced a trap composed of 389 places in 400 ms of which 5 ms to minimize.
[2024-06-01 14:55:54] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:55:55] [INFO ] Deduced a trap composed of 475 places in 429 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 663/1939 variables, and 62 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/31 constraints, State Equation: 0/665 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 20/20 constraints]
After SMT, in 42199ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 42220ms
[2024-06-01 14:55:55] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 14:55:55] [INFO ] Invariant cache hit.
[2024-06-01 14:55:56] [INFO ] Implicit Places using invariants in 678 ms returned [178]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 681 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 664/667 places, 1290/1290 transitions.
Applied a total of 0 rules in 10 ms. Remains 664 /664 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42941 ms. Remains : 664/667 places, 1290/1290 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : PolyORBLF-PT-S02J06T08-LTLFireability-03
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T08-LTLFireability-03 finished in 43168 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0)||(!p0&&F(!p1)))))'
Support contains 16 out of 667 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 667/667 places, 1290/1290 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 665 transition count 1290
Applied a total of 2 rules in 10 ms. Remains 665 /667 variables (removed 2) and now considering 1290/1290 (removed 0) transitions.
Running 1288 sub problems to find dead transitions.
[2024-06-01 14:55:56] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 14:55:56] [INFO ] Invariant cache hit.
[2024-06-01 14:55:56] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/663 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/663 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 14:56:10] [INFO ] Deduced a trap composed of 159 places in 343 ms of which 5 ms to minimize.
[2024-06-01 14:56:10] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 2 ms to minimize.
[2024-06-01 14:56:10] [INFO ] Deduced a trap composed of 72 places in 89 ms of which 2 ms to minimize.
[2024-06-01 14:56:11] [INFO ] Deduced a trap composed of 72 places in 85 ms of which 2 ms to minimize.
[2024-06-01 14:56:11] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:56:11] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:56:11] [INFO ] Deduced a trap composed of 73 places in 56 ms of which 2 ms to minimize.
[2024-06-01 14:56:12] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:56:13] [INFO ] Deduced a trap composed of 72 places in 390 ms of which 5 ms to minimize.
[2024-06-01 14:56:13] [INFO ] Deduced a trap composed of 337 places in 343 ms of which 5 ms to minimize.
[2024-06-01 14:56:13] [INFO ] Deduced a trap composed of 19 places in 342 ms of which 5 ms to minimize.
[2024-06-01 14:56:14] [INFO ] Deduced a trap composed of 326 places in 380 ms of which 5 ms to minimize.
[2024-06-01 14:56:16] [INFO ] Deduced a trap composed of 141 places in 234 ms of which 3 ms to minimize.
[2024-06-01 14:56:17] [INFO ] Deduced a trap composed of 329 places in 383 ms of which 5 ms to minimize.
[2024-06-01 14:56:18] [INFO ] Deduced a trap composed of 329 places in 348 ms of which 5 ms to minimize.
[2024-06-01 14:56:18] [INFO ] Deduced a trap composed of 375 places in 318 ms of which 3 ms to minimize.
[2024-06-01 14:56:18] [INFO ] Deduced a trap composed of 388 places in 305 ms of which 3 ms to minimize.
SMT process timed out in 22049ms, After SMT, problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 22068ms
[2024-06-01 14:56:18] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 14:56:18] [INFO ] Invariant cache hit.
[2024-06-01 14:56:19] [INFO ] Implicit Places using invariants in 755 ms returned [178]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 758 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 664/667 places, 1290/1290 transitions.
Applied a total of 0 rules in 10 ms. Remains 664 /664 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 22850 ms. Remains : 664/667 places, 1290/1290 transitions.
Stuttering acceptance computed with spot in 180 ms :[true, p1, p0, p0, (AND p1 p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T08-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 554 ms.
Product exploration explored 100000 steps with 50000 reset in 508 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 26 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S02J06T08-LTLFireability-06 finished in 24151 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 11 out of 667 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 667/667 places, 1290/1290 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 665 transition count 1234
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 609 transition count 1234
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 112 place count 609 transition count 1154
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 272 place count 529 transition count 1154
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 368 place count 481 transition count 1106
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 371 place count 478 transition count 1103
Iterating global reduction 2 with 3 rules applied. Total rules applied 374 place count 478 transition count 1103
Applied a total of 374 rules in 67 ms. Remains 478 /667 variables (removed 189) and now considering 1103/1290 (removed 187) transitions.
Running 1101 sub problems to find dead transitions.
[2024-06-01 14:56:21] [INFO ] Flow matrix only has 1087 transitions (discarded 16 similar events)
// Phase 1: matrix 1087 rows 478 cols
[2024-06-01 14:56:21] [INFO ] Computed 45 invariants in 28 ms
[2024-06-01 14:56:21] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/476 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/476 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-06-01 14:56:30] [INFO ] Deduced a trap composed of 49 places in 91 ms of which 2 ms to minimize.
[2024-06-01 14:56:30] [INFO ] Deduced a trap composed of 48 places in 80 ms of which 2 ms to minimize.
[2024-06-01 14:56:31] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:56:31] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:56:31] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:56:31] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 0 ms to minimize.
[2024-06-01 14:56:31] [INFO ] Deduced a trap composed of 39 places in 188 ms of which 2 ms to minimize.
[2024-06-01 14:56:31] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 3 ms to minimize.
[2024-06-01 14:56:31] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:56:32] [INFO ] Deduced a trap composed of 167 places in 252 ms of which 2 ms to minimize.
[2024-06-01 14:56:32] [INFO ] Deduced a trap composed of 182 places in 334 ms of which 4 ms to minimize.
[2024-06-01 14:56:33] [INFO ] Deduced a trap composed of 171 places in 271 ms of which 4 ms to minimize.
[2024-06-01 14:56:35] [INFO ] Deduced a trap composed of 19 places in 198 ms of which 2 ms to minimize.
[2024-06-01 14:56:36] [INFO ] Deduced a trap composed of 41 places in 278 ms of which 4 ms to minimize.
[2024-06-01 14:56:36] [INFO ] Deduced a trap composed of 81 places in 268 ms of which 4 ms to minimize.
[2024-06-01 14:56:37] [INFO ] Deduced a trap composed of 182 places in 300 ms of which 4 ms to minimize.
[2024-06-01 14:56:41] [INFO ] Deduced a trap composed of 227 places in 283 ms of which 4 ms to minimize.
[2024-06-01 14:56:42] [INFO ] Deduced a trap composed of 219 places in 280 ms of which 3 ms to minimize.
[2024-06-01 14:56:43] [INFO ] Deduced a trap composed of 170 places in 259 ms of which 3 ms to minimize.
SMT process timed out in 22005ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 22020ms
[2024-06-01 14:56:43] [INFO ] Flow matrix only has 1087 transitions (discarded 16 similar events)
[2024-06-01 14:56:43] [INFO ] Invariant cache hit.
[2024-06-01 14:56:43] [INFO ] Implicit Places using invariants in 454 ms returned [121]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 457 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 477/667 places, 1103/1290 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 476 transition count 1102
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 476 transition count 1102
Applied a total of 2 rules in 22 ms. Remains 476 /477 variables (removed 1) and now considering 1102/1103 (removed 1) transitions.
[2024-06-01 14:56:43] [INFO ] Flow matrix only has 1086 transitions (discarded 16 similar events)
// Phase 1: matrix 1086 rows 476 cols
[2024-06-01 14:56:43] [INFO ] Computed 44 invariants in 14 ms
[2024-06-01 14:56:44] [INFO ] Implicit Places using invariants in 499 ms returned []
[2024-06-01 14:56:44] [INFO ] Flow matrix only has 1086 transitions (discarded 16 similar events)
[2024-06-01 14:56:44] [INFO ] Invariant cache hit.
[2024-06-01 14:56:44] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:56:54] [INFO ] Implicit Places using invariants and state equation in 10271 ms returned []
Implicit Place search using SMT with State Equation took 10772 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 476/667 places, 1102/1290 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 33341 ms. Remains : 476/667 places, 1102/1290 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T08-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 424 ms.
Product exploration explored 100000 steps with 50000 reset in 602 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 22 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S02J06T08-LTLFireability-07 finished in 34482 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&(X(p2)||p1))))'
Support contains 8 out of 667 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 667/667 places, 1290/1290 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 665 transition count 1290
Applied a total of 2 rules in 17 ms. Remains 665 /667 variables (removed 2) and now considering 1290/1290 (removed 0) transitions.
Running 1288 sub problems to find dead transitions.
[2024-06-01 14:56:55] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 665 cols
[2024-06-01 14:56:55] [INFO ] Computed 45 invariants in 27 ms
[2024-06-01 14:56:55] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/663 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/663 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 14:57:09] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:57:09] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 2 ms to minimize.
[2024-06-01 14:57:09] [INFO ] Deduced a trap composed of 159 places in 349 ms of which 4 ms to minimize.
[2024-06-01 14:57:09] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 2 ms to minimize.
[2024-06-01 14:57:09] [INFO ] Deduced a trap composed of 72 places in 84 ms of which 2 ms to minimize.
[2024-06-01 14:57:09] [INFO ] Deduced a trap composed of 73 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:57:09] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:57:09] [INFO ] Deduced a trap composed of 73 places in 63 ms of which 2 ms to minimize.
[2024-06-01 14:57:10] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 2 ms to minimize.
[2024-06-01 14:57:11] [INFO ] Deduced a trap composed of 350 places in 421 ms of which 5 ms to minimize.
[2024-06-01 14:57:12] [INFO ] Deduced a trap composed of 326 places in 378 ms of which 4 ms to minimize.
[2024-06-01 14:57:13] [INFO ] Deduced a trap composed of 74 places in 437 ms of which 5 ms to minimize.
[2024-06-01 14:57:14] [INFO ] Deduced a trap composed of 348 places in 386 ms of which 6 ms to minimize.
[2024-06-01 14:57:14] [INFO ] Deduced a trap composed of 19 places in 348 ms of which 4 ms to minimize.
[2024-06-01 14:57:15] [INFO ] Deduced a trap composed of 337 places in 373 ms of which 4 ms to minimize.
[2024-06-01 14:57:16] [INFO ] Deduced a trap composed of 47 places in 210 ms of which 3 ms to minimize.
[2024-06-01 14:57:16] [INFO ] Deduced a trap composed of 368 places in 421 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 663/1939 variables, and 59 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/31 constraints, State Equation: 0/665 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/663 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/663 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/663 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 14:57:34] [INFO ] Deduced a trap composed of 389 places in 297 ms of which 4 ms to minimize.
[2024-06-01 14:57:36] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:57:37] [INFO ] Deduced a trap composed of 475 places in 366 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 663/1939 variables, and 62 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/31 constraints, State Equation: 0/665 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 20/20 constraints]
After SMT, in 42001ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 42020ms
[2024-06-01 14:57:37] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 14:57:37] [INFO ] Invariant cache hit.
[2024-06-01 14:57:38] [INFO ] Implicit Places using invariants in 748 ms returned [178]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 750 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 664/667 places, 1290/1290 transitions.
Applied a total of 0 rules in 10 ms. Remains 664 /664 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42803 ms. Remains : 664/667 places, 1290/1290 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), true]
Running random walk in product with property : PolyORBLF-PT-S02J06T08-LTLFireability-09
Stuttering criterion allowed to conclude after 9180 steps with 23 reset in 51 ms.
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T08-LTLFireability-09 finished in 43061 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)))&&X(X(G(!p1)))))'
Support contains 3 out of 667 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 667/667 places, 1290/1290 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 665 transition count 1290
Applied a total of 2 rules in 15 ms. Remains 665 /667 variables (removed 2) and now considering 1290/1290 (removed 0) transitions.
Running 1288 sub problems to find dead transitions.
[2024-06-01 14:57:38] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 14:57:38] [INFO ] Invariant cache hit.
[2024-06-01 14:57:38] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/663 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/663 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 14:57:51] [INFO ] Deduced a trap composed of 159 places in 328 ms of which 4 ms to minimize.
[2024-06-01 14:57:51] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:57:51] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 2 ms to minimize.
[2024-06-01 14:57:51] [INFO ] Deduced a trap composed of 72 places in 88 ms of which 2 ms to minimize.
[2024-06-01 14:57:51] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:57:51] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:57:52] [INFO ] Deduced a trap composed of 73 places in 61 ms of which 2 ms to minimize.
[2024-06-01 14:57:52] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:57:53] [INFO ] Deduced a trap composed of 72 places in 356 ms of which 4 ms to minimize.
[2024-06-01 14:57:53] [INFO ] Deduced a trap composed of 337 places in 299 ms of which 4 ms to minimize.
[2024-06-01 14:57:54] [INFO ] Deduced a trap composed of 19 places in 270 ms of which 3 ms to minimize.
[2024-06-01 14:57:54] [INFO ] Deduced a trap composed of 326 places in 250 ms of which 4 ms to minimize.
[2024-06-01 14:57:56] [INFO ] Deduced a trap composed of 141 places in 197 ms of which 3 ms to minimize.
[2024-06-01 14:57:57] [INFO ] Deduced a trap composed of 329 places in 398 ms of which 5 ms to minimize.
[2024-06-01 14:57:58] [INFO ] Deduced a trap composed of 329 places in 343 ms of which 5 ms to minimize.
[2024-06-01 14:57:58] [INFO ] Deduced a trap composed of 375 places in 405 ms of which 3 ms to minimize.
[2024-06-01 14:57:58] [INFO ] Deduced a trap composed of 388 places in 317 ms of which 3 ms to minimize.
[2024-06-01 14:57:59] [INFO ] Deduced a trap composed of 47 places in 203 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 663/1939 variables, and 60 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/31 constraints, State Equation: 0/665 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/663 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/663 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/663 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 14:58:15] [INFO ] Deduced a trap composed of 498 places in 353 ms of which 5 ms to minimize.
[2024-06-01 14:58:15] [INFO ] Deduced a trap composed of 472 places in 324 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 663/1939 variables, and 62 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/31 constraints, State Equation: 0/665 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 20/20 constraints]
After SMT, in 41861ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 41878ms
[2024-06-01 14:58:20] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 14:58:20] [INFO ] Invariant cache hit.
[2024-06-01 14:58:21] [INFO ] Implicit Places using invariants in 653 ms returned [178]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 655 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 664/667 places, 1290/1290 transitions.
Applied a total of 0 rules in 12 ms. Remains 664 /664 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42564 ms. Remains : 664/667 places, 1290/1290 transitions.
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p0) p1), p1, (AND (NOT p0) (NOT p1)), p1, true]
Running random walk in product with property : PolyORBLF-PT-S02J06T08-LTLFireability-10
Stuttering criterion allowed to conclude after 4934 steps with 3 reset in 34 ms.
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T08-LTLFireability-10 finished in 42814 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)&&(G(F(p2)) U p0)))))'
Support contains 2 out of 667 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 667/667 places, 1290/1290 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 665 transition count 1235
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 110 place count 610 transition count 1235
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 110 place count 610 transition count 1155
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 270 place count 530 transition count 1155
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 396 place count 467 transition count 1092
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 399 place count 464 transition count 1089
Iterating global reduction 2 with 3 rules applied. Total rules applied 402 place count 464 transition count 1089
Applied a total of 402 rules in 83 ms. Remains 464 /667 variables (removed 203) and now considering 1089/1290 (removed 201) transitions.
Running 1087 sub problems to find dead transitions.
[2024-06-01 14:58:21] [INFO ] Flow matrix only has 1073 transitions (discarded 16 similar events)
// Phase 1: matrix 1073 rows 464 cols
[2024-06-01 14:58:21] [INFO ] Computed 45 invariants in 24 ms
[2024-06-01 14:58:21] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1087 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 29/43 constraints. Problems are: Problem set: 0 solved, 1087 unsolved
[2024-06-01 14:58:30] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 1 ms to minimize.
[2024-06-01 14:58:30] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:58:30] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:58:30] [INFO ] Deduced a trap composed of 66 places in 215 ms of which 2 ms to minimize.
[2024-06-01 14:58:30] [INFO ] Deduced a trap composed of 47 places in 38 ms of which 0 ms to minimize.
[2024-06-01 14:58:30] [INFO ] Deduced a trap composed of 47 places in 38 ms of which 0 ms to minimize.
[2024-06-01 14:58:31] [INFO ] Deduced a trap composed of 48 places in 267 ms of which 3 ms to minimize.
[2024-06-01 14:58:31] [INFO ] Deduced a trap composed of 158 places in 253 ms of which 3 ms to minimize.
[2024-06-01 14:58:31] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 0 ms to minimize.
[2024-06-01 14:58:31] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:58:33] [INFO ] Deduced a trap composed of 133 places in 156 ms of which 2 ms to minimize.
[2024-06-01 14:58:33] [INFO ] Deduced a trap composed of 73 places in 264 ms of which 3 ms to minimize.
[2024-06-01 14:58:33] [INFO ] Deduced a trap composed of 31 places in 169 ms of which 2 ms to minimize.
[2024-06-01 14:58:34] [INFO ] Deduced a trap composed of 166 places in 253 ms of which 3 ms to minimize.
[2024-06-01 14:58:34] [INFO ] Deduced a trap composed of 26 places in 184 ms of which 2 ms to minimize.
[2024-06-01 14:58:35] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 3 ms to minimize.
[2024-06-01 14:58:38] [INFO ] Deduced a trap composed of 300 places in 271 ms of which 3 ms to minimize.
[2024-06-01 14:58:39] [INFO ] Deduced a trap composed of 291 places in 244 ms of which 3 ms to minimize.
[2024-06-01 14:58:39] [INFO ] Deduced a trap composed of 298 places in 279 ms of which 4 ms to minimize.
[2024-06-01 14:58:40] [INFO ] Deduced a trap composed of 204 places in 249 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1087 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1537 variables, and 63 constraints, problems are : Problem set: 0 solved, 1087 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/464 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1087/1087 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1087 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1087 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 29/43 constraints. Problems are: Problem set: 0 solved, 1087 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1087 unsolved
[2024-06-01 14:58:52] [INFO ] Deduced a trap composed of 213 places in 301 ms of which 4 ms to minimize.
[2024-06-01 14:58:52] [INFO ] Deduced a trap composed of 224 places in 302 ms of which 3 ms to minimize.
[2024-06-01 14:58:52] [INFO ] Deduced a trap composed of 183 places in 335 ms of which 2 ms to minimize.
[2024-06-01 14:58:53] [INFO ] Deduced a trap composed of 230 places in 280 ms of which 4 ms to minimize.
[2024-06-01 14:58:53] [INFO ] Deduced a trap composed of 214 places in 281 ms of which 3 ms to minimize.
[2024-06-01 14:58:53] [INFO ] Deduced a trap composed of 200 places in 307 ms of which 3 ms to minimize.
[2024-06-01 14:58:55] [INFO ] Deduced a trap composed of 218 places in 332 ms of which 3 ms to minimize.
[2024-06-01 14:58:55] [INFO ] Deduced a trap composed of 201 places in 293 ms of which 3 ms to minimize.
[2024-06-01 14:58:56] [INFO ] Deduced a trap composed of 216 places in 291 ms of which 3 ms to minimize.
[2024-06-01 14:58:56] [INFO ] Deduced a trap composed of 201 places in 266 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/1537 variables, and 73 constraints, problems are : Problem set: 0 solved, 1087 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/464 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1087 constraints, Known Traps: 30/30 constraints]
After SMT, in 41985ms problems are : Problem set: 0 solved, 1087 unsolved
Search for dead transitions found 0 dead transitions in 42001ms
[2024-06-01 14:59:03] [INFO ] Flow matrix only has 1073 transitions (discarded 16 similar events)
[2024-06-01 14:59:03] [INFO ] Invariant cache hit.
[2024-06-01 14:59:03] [INFO ] Implicit Places using invariants in 389 ms returned [120]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 391 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 463/667 places, 1089/1290 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 462 transition count 1088
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 462 transition count 1088
Applied a total of 2 rules in 22 ms. Remains 462 /463 variables (removed 1) and now considering 1088/1089 (removed 1) transitions.
[2024-06-01 14:59:03] [INFO ] Flow matrix only has 1072 transitions (discarded 16 similar events)
// Phase 1: matrix 1072 rows 462 cols
[2024-06-01 14:59:03] [INFO ] Computed 44 invariants in 11 ms
[2024-06-01 14:59:04] [INFO ] Implicit Places using invariants in 607 ms returned []
[2024-06-01 14:59:04] [INFO ] Flow matrix only has 1072 transitions (discarded 16 similar events)
[2024-06-01 14:59:04] [INFO ] Invariant cache hit.
[2024-06-01 14:59:06] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:59:17] [INFO ] Implicit Places using invariants and state equation in 12858 ms returned []
Implicit Place search using SMT with State Equation took 13466 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 462/667 places, 1088/1290 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 55966 ms. Remains : 462/667 places, 1088/1290 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T08-LTLFireability-11
Stuttering criterion allowed to conclude after 2304 steps with 10 reset in 10 ms.
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T08-LTLFireability-11 finished in 56052 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((X(F(p1))||p0))))'
[2024-06-01 14:59:17] [INFO ] Flatten gal took : 94 ms
[2024-06-01 14:59:17] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 14:59:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 667 places, 1290 transitions and 5622 arcs took 10 ms.
Total runtime 750921 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : PolyORBLF-PT-S02J06T08-LTLFireability-01

BK_STOP 1717254309698

--------------------
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
mcc2024
ltl formula name PolyORBLF-PT-S02J06T08-LTLFireability-01
ltl formula formula --ltl=/tmp/1955/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 667 places, 1290 transitions and 5622 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.170 real 0.060 user 0.050 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1955/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1955/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1955/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1955/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 681 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 668, there are 1373 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~49 levels ~10000 states ~23280 transitions
pnml2lts-mc( 0/ 4): ~49 levels ~20000 states ~48388 transitions
pnml2lts-mc( 0/ 4): ~49 levels ~40000 states ~98772 transitions
pnml2lts-mc( 0/ 4): ~49 levels ~80000 states ~273868 transitions
pnml2lts-mc( 0/ 4): ~125 levels ~160000 states ~650256 transitions
pnml2lts-mc( 0/ 4): ~125 levels ~320000 states ~1388732 transitions
pnml2lts-mc( 0/ 4): ~129 levels ~640000 states ~2954660 transitions
pnml2lts-mc( 0/ 4): ~133 levels ~1280000 states ~5857296 transitions
pnml2lts-mc( 0/ 4): ~133 levels ~2560000 states ~11775564 transitions
pnml2lts-mc( 0/ 4): ~133 levels ~5120000 states ~24709616 transitions
pnml2lts-mc( 2/ 4): ~211 levels ~10240000 states ~46202680 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 13543550
pnml2lts-mc( 0/ 4): unique states count: 13544140
pnml2lts-mc( 0/ 4): unique transitions count: 66376535
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 52832786
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 13545101
pnml2lts-mc( 0/ 4): - cum. max stack depth: 676
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 13545101 states 66384428 transitions, fanout: 4.901
pnml2lts-mc( 0/ 4): Total exploration time 350.860 sec (350.840 sec minimum, 350.845 sec on average)
pnml2lts-mc( 0/ 4): States per second: 38605, Transitions per second: 189205
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 167.3MB, 13.0 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 40.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1320 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 167.3MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S02J06T08"
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 PolyORBLF-PT-S02J06T08, 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 r516-tajo-171654446700252"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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