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.r290-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 itstools
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 r290-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 1716915742009

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J06T08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-28 17:02:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 17:02:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 17:02:23] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2024-05-28 17:02:23] [INFO ] Transformed 690 places.
[2024-05-28 17:02:23] [INFO ] Transformed 1434 transitions.
[2024-05-28 17:02:23] [INFO ] Parsed PT model containing 690 places and 1434 transitions and 6564 arcs in 293 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 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 224 ms. Remains 674 /690 variables (removed 16) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2024-05-28 17:02:24] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 674 cols
[2024-05-28 17:02:24] [INFO ] Computed 54 invariants in 102 ms
[2024-05-28 17:02:24] [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-05-28 17:02:39] [INFO ] Deduced a trap composed of 160 places in 350 ms of which 49 ms to minimize.
[2024-05-28 17:02:40] [INFO ] Deduced a trap composed of 159 places in 258 ms of which 5 ms to minimize.
[2024-05-28 17:02:41] [INFO ] Deduced a trap composed of 333 places in 817 ms of which 11 ms to minimize.
[2024-05-28 17:02:42] [INFO ] Deduced a trap composed of 327 places in 206 ms of which 3 ms to minimize.
[2024-05-28 17:02:42] [INFO ] Deduced a trap composed of 326 places in 253 ms of which 3 ms to minimize.
[2024-05-28 17:02:43] [INFO ] Deduced a trap composed of 319 places in 201 ms of which 3 ms to minimize.
[2024-05-28 17:02:43] [INFO ] Deduced a trap composed of 66 places in 79 ms of which 1 ms to minimize.
[2024-05-28 17:02:43] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 14 ms to minimize.
[2024-05-28 17:02:45] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 1 ms to minimize.
[2024-05-28 17:02:45] [INFO ] Deduced a trap composed of 54 places in 209 ms of which 3 ms to minimize.
[2024-05-28 17:02:46] [INFO ] Deduced a trap composed of 114 places in 215 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/1948 variables, and 60 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20082 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: 11/11 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, 11/60 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 17:03:00] [INFO ] Deduced a trap composed of 71 places in 211 ms of which 3 ms to minimize.
[2024-05-28 17:03:00] [INFO ] Deduced a trap composed of 71 places in 102 ms of which 1 ms to minimize.
[2024-05-28 17:03:00] [INFO ] Deduced a trap composed of 71 places in 95 ms of which 2 ms to minimize.
[2024-05-28 17:03:00] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 1 ms to minimize.
[2024-05-28 17:03:00] [INFO ] Deduced a trap composed of 71 places in 98 ms of which 1 ms to minimize.
[2024-05-28 17:03:01] [INFO ] Deduced a trap composed of 71 places in 67 ms of which 1 ms to minimize.
[2024-05-28 17:03:01] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 1 ms to minimize.
[2024-05-28 17:03:02] [INFO ] Deduced a trap composed of 300 places in 398 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 20051 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 43041ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 43135ms
[2024-05-28 17:03:07] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 17:03:07] [INFO ] Invariant cache hit.
[2024-05-28 17:03:07] [INFO ] Implicit Places using invariants in 639 ms returned [68, 290, 343, 459, 483, 563, 570]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 654 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 44153 ms. Remains : 667/690 places, 1290/1306 transitions.
Support contains 244 out of 667 places after structural reductions.
[2024-05-28 17:03:08] [INFO ] Flatten gal took : 249 ms
[2024-05-28 17:03:08] [INFO ] Flatten gal took : 89 ms
[2024-05-28 17:03:08] [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 (14 resets) in 1657 ms. (24 steps per ms) remains 4/28 properties
BEST_FIRST walk for 40001 steps (8 resets) in 409 ms. (97 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 391 ms. (102 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (9 resets) in 273 ms. (145 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 242 ms. (164 steps per ms) remains 4/4 properties
[2024-05-28 17:03:10] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 667 cols
[2024-05-28 17:03:10] [INFO ] Computed 47 invariants in 37 ms
[2024-05-28 17:03:10] [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
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1939/1941 variables, and 711 constraints, problems are : Problem set: 2 solved, 2 unsolved in 2335 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 665/667 constraints, ReadFeed: 0/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-05-28 17:03:13] [INFO ] Deduced a trap composed of 72 places in 322 ms of which 7 ms to minimize.
[2024-05-28 17:03:13] [INFO ] Deduced a trap composed of 72 places in 254 ms of which 17 ms to minimize.
[2024-05-28 17:03:13] [INFO ] Deduced a trap composed of 72 places in 206 ms of which 2 ms to minimize.
[2024-05-28 17:03:13] [INFO ] Deduced a trap composed of 72 places in 143 ms of which 2 ms to minimize.
[2024-05-28 17:03:13] [INFO ] Deduced a trap composed of 73 places in 205 ms of which 2 ms to minimize.
[2024-05-28 17:03:13] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 2 ms to minimize.
[2024-05-28 17:03:14] [INFO ] Deduced a trap composed of 72 places in 46 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
At refinement iteration 13 (INCLUDED_ONLY) 0/1939 variables, 96/814 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1939 variables, 2/816 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1939 variables, 0/816 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/1941 variables, 2/818 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1941 variables, 1/819 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-28 17:03:16] [INFO ] Deduced a trap composed of 19 places in 332 ms of which 4 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1941 variables, 1/820 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1941 variables, 0/820 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1941 variables, 0/820 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1941/1941 variables, and 820 constraints, problems are : Problem set: 2 solved, 2 unsolved in 5009 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: 2/4 constraints, Known Traps: 8/8 constraints]
After SMT, in 7464ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 234 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 2 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 3 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 310 ms. Remains 447 /667 variables (removed 220) and now considering 1072/1290 (removed 218) transitions.
Running 1070 sub problems to find dead transitions.
[2024-05-28 17:03:18] [INFO ] Flow matrix only has 1056 transitions (discarded 16 similar events)
// Phase 1: matrix 1056 rows 447 cols
[2024-05-28 17:03:18] [INFO ] Computed 45 invariants in 60 ms
[2024-05-28 17:03:18] [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-05-28 17:03:27] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 2 ms to minimize.
[2024-05-28 17:03:27] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 1 ms to minimize.
[2024-05-28 17:03:27] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-05-28 17:03:27] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2024-05-28 17:03:27] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 0 ms to minimize.
[2024-05-28 17:03:27] [INFO ] Deduced a trap composed of 55 places in 193 ms of which 3 ms to minimize.
[2024-05-28 17:03:27] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-05-28 17:03:28] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 4 ms to minimize.
[2024-05-28 17:03:28] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
[2024-05-28 17:03:28] [INFO ] Deduced a trap composed of 169 places in 260 ms of which 4 ms to minimize.
[2024-05-28 17:03:28] [INFO ] Deduced a trap composed of 150 places in 226 ms of which 3 ms to minimize.
[2024-05-28 17:03:31] [INFO ] Deduced a trap composed of 44 places in 253 ms of which 3 ms to minimize.
[2024-05-28 17:03:31] [INFO ] Deduced a trap composed of 65 places in 249 ms of which 3 ms to minimize.
[2024-05-28 17:03:32] [INFO ] Deduced a trap composed of 19 places in 188 ms of which 2 ms to minimize.
[2024-05-28 17:03:34] [INFO ] Deduced a trap composed of 179 places in 192 ms of which 2 ms to minimize.
[2024-05-28 17:03:35] [INFO ] Deduced a trap composed of 178 places in 257 ms of which 2 ms to minimize.
[2024-05-28 17:03:36] [INFO ] Deduced a trap composed of 180 places in 248 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-05-28 17:03:40] [INFO ] Deduced a trap composed of 166 places in 204 ms of which 2 ms to minimize.
SMT process timed out in 22433ms, After SMT, problems are : Problem set: 0 solved, 1070 unsolved
Search for dead transitions found 0 dead transitions in 22448ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22762 ms. Remains : 447/667 places, 1072/1290 transitions.
RANDOM walk for 40000 steps (15 resets) in 440 ms. (90 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (14 resets) in 289 ms. (137 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (14 resets) in 188 ms. (211 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 159467 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 2
Probabilistic random walk after 159467 steps, saw 98409 distinct states, run finished after 3005 ms. (steps per millisecond=53 ) properties seen :0
[2024-05-28 17:03:43] [INFO ] Flow matrix only has 1056 transitions (discarded 16 similar events)
[2024-05-28 17:03:43] [INFO ] Invariant cache hit.
[2024-05-28 17:03:43] [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-05-28 17:03:44] [INFO ] Deduced a trap composed of 44 places in 186 ms of which 3 ms to minimize.
[2024-05-28 17:03:44] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 2 ms to minimize.
[2024-05-28 17:03:44] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 1 ms to minimize.
[2024-05-28 17:03:44] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 1 ms to minimize.
[2024-05-28 17:03:44] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 1 ms to minimize.
[2024-05-28 17:03:44] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 2 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 5838 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-05-28 17:03:49] [INFO ] Deduced a trap composed of 45 places in 63 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 45024 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 50877ms 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 35 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 35 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 26 ms. Remains 447 /447 variables (removed 0) and now considering 1072/1072 (removed 0) transitions.
[2024-05-28 17:04:34] [INFO ] Flow matrix only has 1056 transitions (discarded 16 similar events)
[2024-05-28 17:04:34] [INFO ] Invariant cache hit.
[2024-05-28 17:04:35] [INFO ] Implicit Places using invariants in 495 ms returned [114]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 498 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 37 ms. Remains 445 /446 variables (removed 1) and now considering 1071/1072 (removed 1) transitions.
[2024-05-28 17:04:35] [INFO ] Flow matrix only has 1055 transitions (discarded 16 similar events)
// Phase 1: matrix 1055 rows 445 cols
[2024-05-28 17:04:35] [INFO ] Computed 44 invariants in 15 ms
[2024-05-28 17:04:35] [INFO ] Implicit Places using invariants in 595 ms returned []
[2024-05-28 17:04:35] [INFO ] Flow matrix only has 1055 transitions (discarded 16 similar events)
[2024-05-28 17:04:35] [INFO ] Invariant cache hit.
[2024-05-28 17:04:36] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 17:04:41] [INFO ] Implicit Places using invariants and state equation in 5678 ms returned []
Implicit Place search using SMT with State Equation took 6276 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 6837 ms. Remains : 445/447 places, 1071/1072 transitions.
RANDOM walk for 40000 steps (24 resets) in 361 ms. (110 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (12 resets) in 148 ms. (268 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (13 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 134616 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 2
Probabilistic random walk after 134616 steps, saw 83421 distinct states, run finished after 3002 ms. (steps per millisecond=44 ) properties seen :0
[2024-05-28 17:04:44] [INFO ] Flow matrix only has 1055 transitions (discarded 16 similar events)
[2024-05-28 17:04:44] [INFO ] Invariant cache hit.
[2024-05-28 17:04:44] [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) 249/252 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 75/327 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/331 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 110/441 variables, 25/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 17:04:45] [INFO ] Deduced a trap composed of 45 places in 286 ms of which 3 ms to minimize.
[2024-05-28 17:04:45] [INFO ] Deduced a trap composed of 44 places in 277 ms of which 3 ms to minimize.
[2024-05-28 17:04:45] [INFO ] Deduced a trap composed of 45 places in 274 ms of which 3 ms to minimize.
[2024-05-28 17:04:46] [INFO ] Deduced a trap composed of 44 places in 288 ms of which 4 ms to minimize.
[2024-05-28 17:04:46] [INFO ] Deduced a trap composed of 44 places in 220 ms of which 3 ms to minimize.
[2024-05-28 17:04:46] [INFO ] Deduced a trap composed of 44 places in 210 ms of which 2 ms to minimize.
[2024-05-28 17:04:46] [INFO ] Deduced a trap composed of 160 places in 247 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/441 variables, 7/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 17:04:46] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/441 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/441 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/443 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1055/1498 variables, 443/494 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1498 variables, 96/590 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1498 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/1500 variables, 2/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1500 variables, 1/593 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1500 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1500 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1500/1500 variables, and 593 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5332 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 445/445 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 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) 249/252 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 75/327 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/331 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 110/441 variables, 25/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/441 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/441 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/443 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1055/1498 variables, 443/494 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1498 variables, 96/590 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1498 variables, 2/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1498 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/1500 variables, 2/594 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1500 variables, 1/595 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1500 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1500 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1500/1500 variables, and 595 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4182 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 445/445 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints]
After SMT, in 9528ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 869 ms.
Support contains 3 out of 445 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 445/445 places, 1071/1071 transitions.
Applied a total of 0 rules in 21 ms. Remains 445 /445 variables (removed 0) and now considering 1071/1071 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 445/445 places, 1071/1071 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 445/445 places, 1071/1071 transitions.
Applied a total of 0 rules in 20 ms. Remains 445 /445 variables (removed 0) and now considering 1071/1071 (removed 0) transitions.
[2024-05-28 17:04:55] [INFO ] Flow matrix only has 1055 transitions (discarded 16 similar events)
[2024-05-28 17:04:55] [INFO ] Invariant cache hit.
[2024-05-28 17:04:55] [INFO ] Implicit Places using invariants in 429 ms returned []
[2024-05-28 17:04:55] [INFO ] Flow matrix only has 1055 transitions (discarded 16 similar events)
[2024-05-28 17:04:55] [INFO ] Invariant cache hit.
[2024-05-28 17:04:56] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 17:05:01] [INFO ] Implicit Places using invariants and state equation in 6240 ms returned []
Implicit Place search using SMT with State Equation took 6676 ms to find 0 implicit places.
[2024-05-28 17:05:01] [INFO ] Redundant transitions in 105 ms returned []
Running 1069 sub problems to find dead transitions.
[2024-05-28 17:05:02] [INFO ] Flow matrix only has 1055 transitions (discarded 16 similar events)
[2024-05-28 17:05:02] [INFO ] Invariant cache hit.
[2024-05-28 17:05:02] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/443 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
[2024-05-28 17:05:10] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 2 ms to minimize.
[2024-05-28 17:05:10] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 1 ms to minimize.
[2024-05-28 17:05:10] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 2 ms to minimize.
[2024-05-28 17:05:10] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-05-28 17:05:10] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 0 ms to minimize.
[2024-05-28 17:05:10] [INFO ] Deduced a trap composed of 44 places in 32 ms of which 1 ms to minimize.
[2024-05-28 17:05:10] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 1 ms to minimize.
[2024-05-28 17:05:10] [INFO ] Deduced a trap composed of 45 places in 126 ms of which 2 ms to minimize.
[2024-05-28 17:05:10] [INFO ] Deduced a trap composed of 188 places in 119 ms of which 2 ms to minimize.
[2024-05-28 17:05:11] [INFO ] Deduced a trap composed of 170 places in 222 ms of which 3 ms to minimize.
[2024-05-28 17:05:12] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 2 ms to minimize.
[2024-05-28 17:05:14] [INFO ] Deduced a trap composed of 54 places in 285 ms of which 3 ms to minimize.
[2024-05-28 17:05:14] [INFO ] Deduced a trap composed of 65 places in 253 ms of which 3 ms to minimize.
[2024-05-28 17:05:17] [INFO ] Deduced a trap composed of 179 places in 264 ms of which 3 ms to minimize.
[2024-05-28 17:05:18] [INFO ] Deduced a trap composed of 198 places in 313 ms of which 4 ms to minimize.
[2024-05-28 17:05:18] [INFO ] Deduced a trap composed of 182 places in 277 ms of which 3 ms to minimize.
[2024-05-28 17:05:19] [INFO ] Deduced a trap composed of 150 places in 292 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
[2024-05-28 17:05:24] [INFO ] Deduced a trap composed of 160 places in 303 ms of which 4 ms to minimize.
[2024-05-28 17:05:31] [INFO ] Deduced a trap composed of 171 places in 292 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/443 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 443/1500 variables, and 60 constraints, problems are : Problem set: 0 solved, 1069 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/445 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1069/1069 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1069 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/443 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 1069 unsolved
[2024-05-28 17:05:41] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-05-28 17:05:43] [INFO ] Deduced a trap composed of 196 places in 341 ms of which 3 ms to minimize.
[2024-05-28 17:05:44] [INFO ] Deduced a trap composed of 195 places in 334 ms of which 3 ms to minimize.
[2024-05-28 17:05:44] [INFO ] Deduced a trap composed of 198 places in 317 ms of which 3 ms to minimize.
[2024-05-28 17:05:44] [INFO ] Deduced a trap composed of 209 places in 297 ms of which 4 ms to minimize.
[2024-05-28 17:05:45] [INFO ] Deduced a trap composed of 188 places in 309 ms of which 4 ms to minimize.
[2024-05-28 17:05:45] [INFO ] Deduced a trap composed of 211 places in 299 ms of which 3 ms to minimize.
[2024-05-28 17:05:45] [INFO ] Deduced a trap composed of 184 places in 279 ms of which 4 ms to minimize.
[2024-05-28 17:05:54] [INFO ] Deduced a trap composed of 161 places in 325 ms of which 3 ms to minimize.
[2024-05-28 17:05:55] [INFO ] Deduced a trap composed of 178 places in 367 ms of which 4 ms to minimize.
[2024-05-28 17:06:03] [INFO ] Deduced a trap composed of 265 places in 272 ms of which 3 ms to minimize.
[2024-05-28 17:06:03] [INFO ] Deduced a trap composed of 292 places in 303 ms of which 5 ms to minimize.
[2024-05-28 17:06:04] [INFO ] Deduced a trap composed of 290 places in 276 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 443/1500 variables, and 73 constraints, problems are : Problem set: 0 solved, 1069 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/445 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1069 constraints, Known Traps: 32/32 constraints]
After SMT, in 62049ms problems are : Problem set: 0 solved, 1069 unsolved
Search for dead transitions found 0 dead transitions in 62066ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68885 ms. Remains : 445/445 places, 1071/1071 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-05-28 17:06:04] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 667 cols
[2024-05-28 17:06:04] [INFO ] Computed 47 invariants in 41 ms
[2024-05-28 17:06:04] [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-05-28 17:06:17] [INFO ] Deduced a trap composed of 73 places in 116 ms of which 2 ms to minimize.
[2024-05-28 17:06:17] [INFO ] Deduced a trap composed of 72 places in 102 ms of which 1 ms to minimize.
[2024-05-28 17:06:17] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
[2024-05-28 17:06:17] [INFO ] Deduced a trap composed of 165 places in 358 ms of which 5 ms to minimize.
[2024-05-28 17:06:17] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 1 ms to minimize.
[2024-05-28 17:06:17] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 1 ms to minimize.
[2024-05-28 17:06:18] [INFO ] Deduced a trap composed of 73 places in 69 ms of which 1 ms to minimize.
[2024-05-28 17:06:19] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 1 ms to minimize.
[2024-05-28 17:06:19] [INFO ] Deduced a trap composed of 72 places in 371 ms of which 4 ms to minimize.
[2024-05-28 17:06:19] [INFO ] Deduced a trap composed of 326 places in 339 ms of which 5 ms to minimize.
[2024-05-28 17:06:20] [INFO ] Deduced a trap composed of 47 places in 235 ms of which 4 ms to minimize.
[2024-05-28 17:06:21] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 3 ms to minimize.
[2024-05-28 17:06:21] [INFO ] Deduced a trap composed of 357 places in 415 ms of which 5 ms to minimize.
[2024-05-28 17:06:24] [INFO ] Deduced a trap composed of 54 places in 375 ms of which 5 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 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: 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 20032 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 42008ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 42024ms
[2024-05-28 17:06:46] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 17:06:46] [INFO ] Invariant cache hit.
[2024-05-28 17:06:47] [INFO ] Implicit Places using invariants in 749 ms returned [178]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 752 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 12 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 42806 ms. Remains : 666/667 places, 1290/1290 transitions.
Stuttering acceptance computed with spot in 393 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 10186 steps with 0 reset in 124 ms.
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T08-LTLFireability-00 finished in 43400 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 0 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 76 ms. Remains 470 /667 variables (removed 197) and now considering 1095/1290 (removed 195) transitions.
Running 1093 sub problems to find dead transitions.
[2024-05-28 17:06:47] [INFO ] Flow matrix only has 1079 transitions (discarded 16 similar events)
// Phase 1: matrix 1079 rows 470 cols
[2024-05-28 17:06:47] [INFO ] Computed 45 invariants in 17 ms
[2024-05-28 17:06:47] [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-05-28 17:06:55] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 1 ms to minimize.
[2024-05-28 17:06:55] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2024-05-28 17:06:55] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 1 ms to minimize.
[2024-05-28 17:06:56] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
[2024-05-28 17:06:56] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
[2024-05-28 17:06:56] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 1 ms to minimize.
[2024-05-28 17:06:56] [INFO ] Deduced a trap composed of 48 places in 309 ms of which 3 ms to minimize.
[2024-05-28 17:06:57] [INFO ] Deduced a trap composed of 185 places in 288 ms of which 4 ms to minimize.
[2024-05-28 17:06:57] [INFO ] Deduced a trap composed of 166 places in 278 ms of which 4 ms to minimize.
[2024-05-28 17:06:57] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 1 ms to minimize.
[2024-05-28 17:06:57] [INFO ] Deduced a trap composed of 36 places in 308 ms of which 4 ms to minimize.
[2024-05-28 17:06:58] [INFO ] Deduced a trap composed of 101 places in 281 ms of which 4 ms to minimize.
[2024-05-28 17:06:58] [INFO ] Deduced a trap composed of 183 places in 315 ms of which 3 ms to minimize.
[2024-05-28 17:06:59] [INFO ] Deduced a trap composed of 190 places in 301 ms of which 4 ms to minimize.
[2024-05-28 17:07:00] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 2 ms to minimize.
[2024-05-28 17:07:04] [INFO ] Deduced a trap composed of 19 places in 206 ms of which 3 ms to minimize.
[2024-05-28 17:07:06] [INFO ] Deduced a trap composed of 171 places in 275 ms of which 3 ms to minimize.
[2024-05-28 17:07:07] [INFO ] Deduced a trap composed of 211 places in 293 ms of which 3 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 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: 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-05-28 17:07:21] [INFO ] Deduced a trap composed of 208 places in 281 ms of which 5 ms to minimize.
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 41735ms problems are : Problem set: 0 solved, 1093 unsolved
Search for dead transitions found 0 dead transitions in 41744ms
[2024-05-28 17:07:29] [INFO ] Flow matrix only has 1079 transitions (discarded 16 similar events)
[2024-05-28 17:07:29] [INFO ] Invariant cache hit.
[2024-05-28 17:07:30] [INFO ] Implicit Places using invariants in 591 ms returned [119]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 594 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 37 ms. Remains 468 /469 variables (removed 1) and now considering 1094/1095 (removed 1) transitions.
[2024-05-28 17:07:30] [INFO ] Flow matrix only has 1078 transitions (discarded 16 similar events)
// Phase 1: matrix 1078 rows 468 cols
[2024-05-28 17:07:30] [INFO ] Computed 44 invariants in 29 ms
[2024-05-28 17:07:30] [INFO ] Implicit Places using invariants in 607 ms returned []
[2024-05-28 17:07:30] [INFO ] Flow matrix only has 1078 transitions (discarded 16 similar events)
[2024-05-28 17:07:30] [INFO ] Invariant cache hit.
[2024-05-28 17:07:32] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 17:07:37] [INFO ] Implicit Places using invariants and state equation in 6522 ms returned []
Implicit Place search using SMT with State Equation took 7134 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 49589 ms. Remains : 468/667 places, 1094/1290 transitions.
Stuttering acceptance computed with spot in 104 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 3712 reset in 876 ms.
Product exploration explored 100000 steps with 3707 reset in 696 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 124 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))]
RANDOM walk for 201 steps (0 resets) in 11 ms. (16 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 268 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 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-28 17:07:39] [INFO ] Flow matrix only has 1078 transitions (discarded 16 similar events)
[2024-05-28 17:07:39] [INFO ] Invariant cache hit.
[2024-05-28 17:07:40] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-05-28 17:07:40] [INFO ] [Real]Absence check using 12 positive and 32 generalized place invariants in 130 ms returned sat
[2024-05-28 17:07:42] [INFO ] [Real]Absence check using state equation in 1627 ms returned sat
[2024-05-28 17:07:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:07:43] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-05-28 17:07:43] [INFO ] [Nat]Absence check using 12 positive and 32 generalized place invariants in 72 ms returned sat
[2024-05-28 17:07:47] [INFO ] [Nat]Absence check using state equation in 4054 ms returned sat
[2024-05-28 17:07:47] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 17:07:48] [INFO ] [Nat]Added 96 Read/Feed constraints in 914 ms returned sat
[2024-05-28 17:07:48] [INFO ] Deduced a trap composed of 47 places in 137 ms of which 2 ms to minimize.
[2024-05-28 17:07:49] [INFO ] Deduced a trap composed of 47 places in 113 ms of which 2 ms to minimize.
[2024-05-28 17:07:49] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 1 ms to minimize.
[2024-05-28 17:07:49] [INFO ] Deduced a trap composed of 48 places in 264 ms of which 2 ms to minimize.
[2024-05-28 17:07:51] [INFO ] Trap strengthening (SAT) tested/added 4/4 trap constraints in 3072 ms
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 43 ms. Remains 468 /468 variables (removed 0) and now considering 1094/1094 (removed 0) transitions.
Running 1092 sub problems to find dead transitions.
[2024-05-28 17:07:51] [INFO ] Flow matrix only has 1078 transitions (discarded 16 similar events)
[2024-05-28 17:07:51] [INFO ] Invariant cache hit.
[2024-05-28 17:07:51] [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-05-28 17:08:00] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 2 ms to minimize.
[2024-05-28 17:08:00] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 1 ms to minimize.
[2024-05-28 17:08:00] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 0 ms to minimize.
[2024-05-28 17:08:01] [INFO ] Deduced a trap composed of 48 places in 334 ms of which 4 ms to minimize.
[2024-05-28 17:08:01] [INFO ] Deduced a trap composed of 166 places in 265 ms of which 3 ms to minimize.
[2024-05-28 17:08:01] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 1 ms to minimize.
[2024-05-28 17:08:01] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 0 ms to minimize.
[2024-05-28 17:08:01] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-05-28 17:08:01] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2024-05-28 17:08:02] [INFO ] Deduced a trap composed of 179 places in 316 ms of which 3 ms to minimize.
[2024-05-28 17:08:04] [INFO ] Deduced a trap composed of 83 places in 255 ms of which 3 ms to minimize.
[2024-05-28 17:08:04] [INFO ] Deduced a trap composed of 39 places in 167 ms of which 3 ms to minimize.
[2024-05-28 17:08:08] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 5 ms to minimize.
[2024-05-28 17:08:10] [INFO ] Deduced a trap composed of 160 places in 290 ms of which 4 ms to minimize.
[2024-05-28 17:08:12] [INFO ] Deduced a trap composed of 206 places in 298 ms of which 3 ms to minimize.
[2024-05-28 17:08:12] [INFO ] Deduced a trap composed of 182 places in 265 ms of which 3 ms to minimize.
[2024-05-28 17:08:12] [INFO ] Deduced a trap composed of 212 places in 273 ms of which 3 ms to minimize.
[2024-05-28 17:08:13] [INFO ] Deduced a trap composed of 197 places in 293 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 20022 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 20026 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 42081ms problems are : Problem set: 0 solved, 1092 unsolved
Search for dead transitions found 0 dead transitions in 42103ms
[2024-05-28 17:08:33] [INFO ] Flow matrix only has 1078 transitions (discarded 16 similar events)
[2024-05-28 17:08:33] [INFO ] Invariant cache hit.
[2024-05-28 17:08:34] [INFO ] Implicit Places using invariants in 566 ms returned []
[2024-05-28 17:08:34] [INFO ] Flow matrix only has 1078 transitions (discarded 16 similar events)
[2024-05-28 17:08:34] [INFO ] Invariant cache hit.
[2024-05-28 17:08:35] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 17:08:40] [INFO ] Implicit Places using invariants and state equation in 6411 ms returned []
Implicit Place search using SMT with State Equation took 6981 ms to find 0 implicit places.
[2024-05-28 17:08:40] [INFO ] Redundant transitions in 78 ms returned []
Running 1092 sub problems to find dead transitions.
[2024-05-28 17:08:40] [INFO ] Flow matrix only has 1078 transitions (discarded 16 similar events)
[2024-05-28 17:08:40] [INFO ] Invariant cache hit.
[2024-05-28 17:08:40] [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-05-28 17:08:49] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 2 ms to minimize.
[2024-05-28 17:08:49] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 2 ms to minimize.
[2024-05-28 17:08:49] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-05-28 17:08:49] [INFO ] Deduced a trap composed of 48 places in 301 ms of which 4 ms to minimize.
[2024-05-28 17:08:50] [INFO ] Deduced a trap composed of 166 places in 248 ms of which 3 ms to minimize.
[2024-05-28 17:08:50] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
[2024-05-28 17:08:50] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 1 ms to minimize.
[2024-05-28 17:08:50] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 1 ms to minimize.
[2024-05-28 17:08:50] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 0 ms to minimize.
[2024-05-28 17:08:51] [INFO ] Deduced a trap composed of 179 places in 251 ms of which 3 ms to minimize.
[2024-05-28 17:08:52] [INFO ] Deduced a trap composed of 83 places in 293 ms of which 5 ms to minimize.
[2024-05-28 17:08:53] [INFO ] Deduced a trap composed of 39 places in 212 ms of which 2 ms to minimize.
[2024-05-28 17:08:57] [INFO ] Deduced a trap composed of 19 places in 211 ms of which 3 ms to minimize.
[2024-05-28 17:08:59] [INFO ] Deduced a trap composed of 160 places in 289 ms of which 4 ms to minimize.
[2024-05-28 17:09:01] [INFO ] Deduced a trap composed of 206 places in 294 ms of which 3 ms to minimize.
[2024-05-28 17:09:01] [INFO ] Deduced a trap composed of 182 places in 297 ms of which 3 ms to minimize.
[2024-05-28 17:09:01] [INFO ] Deduced a trap composed of 212 places in 288 ms of which 3 ms to minimize.
[2024-05-28 17:09:02] [INFO ] Deduced a trap composed of 197 places in 308 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 30022 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-05-28 17:09:37] [INFO ] Deduced a trap composed of 294 places in 314 ms of which 4 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 30025 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 62044ms problems are : Problem set: 0 solved, 1092 unsolved
Search for dead transitions found 0 dead transitions in 62060ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 111284 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 126 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 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1174 steps (0 resets) in 39 ms. (29 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 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-28 17:09:43] [INFO ] Flow matrix only has 1078 transitions (discarded 16 similar events)
[2024-05-28 17:09:43] [INFO ] Invariant cache hit.
[2024-05-28 17:09:44] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-05-28 17:09:44] [INFO ] [Real]Absence check using 12 positive and 32 generalized place invariants in 101 ms returned sat
[2024-05-28 17:09:45] [INFO ] [Real]Absence check using state equation in 1745 ms returned sat
[2024-05-28 17:09:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:09:46] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-05-28 17:09:46] [INFO ] [Nat]Absence check using 12 positive and 32 generalized place invariants in 70 ms returned sat
[2024-05-28 17:09:51] [INFO ] [Nat]Absence check using state equation in 4495 ms returned sat
[2024-05-28 17:09:51] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 17:09:51] [INFO ] [Nat]Added 96 Read/Feed constraints in 638 ms returned sat
[2024-05-28 17:09:52] [INFO ] Deduced a trap composed of 47 places in 110 ms of which 2 ms to minimize.
[2024-05-28 17:09:52] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 1 ms to minimize.
[2024-05-28 17:09:52] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 0 ms to minimize.
[2024-05-28 17:09:53] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-05-28 17:09:54] [INFO ] Trap strengthening (SAT) tested/added 4/4 trap constraints in 2982 ms
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3726 reset in 612 ms.
Product exploration explored 100000 steps with 3703 reset in 836 ms.
Built C files in :
/tmp/ltsmin6701429569617687345
[2024-05-28 17:09:56] [INFO ] Computing symmetric may disable matrix : 1094 transitions.
[2024-05-28 17:09:56] [INFO ] Computation of Complete disable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:09:56] [INFO ] Computing symmetric may enable matrix : 1094 transitions.
[2024-05-28 17:09:56] [INFO ] Computation of Complete enable matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:09:56] [INFO ] Computing Do-Not-Accords matrix : 1094 transitions.
[2024-05-28 17:09:56] [INFO ] Computation of Completed DNA matrix. took 69 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:09:56] [INFO ] Built C files in 438ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6701429569617687345
Running compilation step : cd /tmp/ltsmin6701429569617687345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6701429569617687345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6701429569617687345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
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 29 ms. Remains 468 /468 variables (removed 0) and now considering 1094/1094 (removed 0) transitions.
Running 1092 sub problems to find dead transitions.
[2024-05-28 17:10:00] [INFO ] Flow matrix only has 1078 transitions (discarded 16 similar events)
[2024-05-28 17:10:00] [INFO ] Invariant cache hit.
[2024-05-28 17:10:00] [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-05-28 17:10:08] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 1 ms to minimize.
[2024-05-28 17:10:08] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 1 ms to minimize.
[2024-05-28 17:10:08] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 1 ms to minimize.
[2024-05-28 17:10:09] [INFO ] Deduced a trap composed of 48 places in 264 ms of which 3 ms to minimize.
[2024-05-28 17:10:09] [INFO ] Deduced a trap composed of 166 places in 228 ms of which 3 ms to minimize.
[2024-05-28 17:10:09] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
[2024-05-28 17:10:09] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 0 ms to minimize.
[2024-05-28 17:10:09] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 0 ms to minimize.
[2024-05-28 17:10:09] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
[2024-05-28 17:10:10] [INFO ] Deduced a trap composed of 179 places in 293 ms of which 4 ms to minimize.
[2024-05-28 17:10:11] [INFO ] Deduced a trap composed of 83 places in 195 ms of which 2 ms to minimize.
[2024-05-28 17:10:12] [INFO ] Deduced a trap composed of 39 places in 192 ms of which 2 ms to minimize.
[2024-05-28 17:10:15] [INFO ] Deduced a trap composed of 19 places in 205 ms of which 3 ms to minimize.
[2024-05-28 17:10:18] [INFO ] Deduced a trap composed of 160 places in 206 ms of which 3 ms to minimize.
[2024-05-28 17:10:19] [INFO ] Deduced a trap composed of 206 places in 202 ms of which 3 ms to minimize.
[2024-05-28 17:10:20] [INFO ] Deduced a trap composed of 182 places in 301 ms of which 3 ms to minimize.
[2024-05-28 17:10:20] [INFO ] Deduced a trap composed of 212 places in 280 ms of which 4 ms to minimize.
[2024-05-28 17:10:20] [INFO ] Deduced a trap composed of 197 places in 202 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 20023 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 20035 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 42124ms problems are : Problem set: 0 solved, 1092 unsolved
Search for dead transitions found 0 dead transitions in 42162ms
[2024-05-28 17:10:42] [INFO ] Flow matrix only has 1078 transitions (discarded 16 similar events)
[2024-05-28 17:10:42] [INFO ] Invariant cache hit.
[2024-05-28 17:10:42] [INFO ] Implicit Places using invariants in 628 ms returned []
[2024-05-28 17:10:42] [INFO ] Flow matrix only has 1078 transitions (discarded 16 similar events)
[2024-05-28 17:10:42] [INFO ] Invariant cache hit.
[2024-05-28 17:10:44] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 17:10:49] [INFO ] Implicit Places using invariants and state equation in 6826 ms returned []
Implicit Place search using SMT with State Equation took 7464 ms to find 0 implicit places.
[2024-05-28 17:10:49] [INFO ] Redundant transitions in 41 ms returned []
Running 1092 sub problems to find dead transitions.
[2024-05-28 17:10:49] [INFO ] Flow matrix only has 1078 transitions (discarded 16 similar events)
[2024-05-28 17:10:49] [INFO ] Invariant cache hit.
[2024-05-28 17:10:49] [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-05-28 17:10:58] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 1 ms to minimize.
[2024-05-28 17:10:58] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 1 ms to minimize.
[2024-05-28 17:10:58] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 1 ms to minimize.
[2024-05-28 17:10:58] [INFO ] Deduced a trap composed of 48 places in 215 ms of which 2 ms to minimize.
[2024-05-28 17:10:59] [INFO ] Deduced a trap composed of 166 places in 200 ms of which 3 ms to minimize.
[2024-05-28 17:10:59] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
[2024-05-28 17:10:59] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 1 ms to minimize.
[2024-05-28 17:10:59] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 0 ms to minimize.
[2024-05-28 17:10:59] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 0 ms to minimize.
[2024-05-28 17:11:00] [INFO ] Deduced a trap composed of 179 places in 262 ms of which 3 ms to minimize.
[2024-05-28 17:11:01] [INFO ] Deduced a trap composed of 83 places in 201 ms of which 3 ms to minimize.
[2024-05-28 17:11:01] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 2 ms to minimize.
[2024-05-28 17:11:04] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 3 ms to minimize.
[2024-05-28 17:11:06] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 3 ms to minimize.
[2024-05-28 17:11:08] [INFO ] Deduced a trap composed of 206 places in 202 ms of which 3 ms to minimize.
[2024-05-28 17:11:08] [INFO ] Deduced a trap composed of 182 places in 199 ms of which 2 ms to minimize.
[2024-05-28 17:11:08] [INFO ] Deduced a trap composed of 212 places in 197 ms of which 3 ms to minimize.
[2024-05-28 17:11:08] [INFO ] Deduced a trap composed of 197 places in 204 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-05-28 17:11:19] [INFO ] Deduced a trap composed of 211 places in 267 ms of which 3 ms to minimize.
[2024-05-28 17:11:19] [INFO ] Deduced a trap composed of 213 places in 257 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 2/62 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 62 constraints, problems are : Problem set: 0 solved, 1092 unsolved in 30019 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: 20/20 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, 20/62 constraints. Problems are: Problem set: 0 solved, 1092 unsolved
[2024-05-28 17:11:41] [INFO ] Deduced a trap composed of 292 places in 226 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/1546 variables, and 63 constraints, problems are : Problem set: 0 solved, 1092 unsolved in 30024 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: 21/21 constraints]
After SMT, in 62035ms problems are : Problem set: 0 solved, 1092 unsolved
Search for dead transitions found 0 dead transitions in 62048ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 111795 ms. Remains : 468/468 places, 1094/1094 transitions.
Built C files in :
/tmp/ltsmin4088684453246072689
[2024-05-28 17:11:51] [INFO ] Computing symmetric may disable matrix : 1094 transitions.
[2024-05-28 17:11:51] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:11:51] [INFO ] Computing symmetric may enable matrix : 1094 transitions.
[2024-05-28 17:11:51] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:11:51] [INFO ] Computing Do-Not-Accords matrix : 1094 transitions.
[2024-05-28 17:11:51] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:11:51] [INFO ] Built C files in 190ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4088684453246072689
Running compilation step : cd /tmp/ltsmin4088684453246072689;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4088684453246072689;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4088684453246072689;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 17:11:55] [INFO ] Flatten gal took : 77 ms
[2024-05-28 17:11:55] [INFO ] Flatten gal took : 64 ms
[2024-05-28 17:11:55] [INFO ] Time to serialize gal into /tmp/LTL2292724230101388989.gal : 15 ms
[2024-05-28 17:11:55] [INFO ] Time to serialize properties into /tmp/LTL4169303255178112513.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2292724230101388989.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17189906387604582994.hoa' '-atoms' '/tmp/LTL4169303255178112513.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4169303255178112513.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17189906387604582994.hoa
Detected timeout of ITS tools.
[2024-05-28 17:12:10] [INFO ] Flatten gal took : 124 ms
[2024-05-28 17:12:10] [INFO ] Flatten gal took : 51 ms
[2024-05-28 17:12:10] [INFO ] Time to serialize gal into /tmp/LTL12927395584098979919.gal : 11 ms
[2024-05-28 17:12:10] [INFO ] Time to serialize properties into /tmp/LTL7337329644696278264.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12927395584098979919.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7337329644696278264.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G((((((X(F("(((((NoSigAbort>=1)&&(Abort_Check_Sources_B_6>=1))||((Abort_Check_Sources_B_2>=1)&&(NoSigAbort>=1)))||(((Abort_Check_...1472
Formula 0 simplified : G(F(!"((((((cSources>=9)&&(ProcessingEvt_5>=1))&&(ModifiedSrc_2>=1))||(((cSources>=9)&&(ProcessingEvt_1>=1))&&(ModifiedSrc_2>=1)))||...1456
Detected timeout of ITS tools.
[2024-05-28 17:12:25] [INFO ] Flatten gal took : 50 ms
[2024-05-28 17:12:25] [INFO ] Applying decomposition
[2024-05-28 17:12:25] [INFO ] Flatten gal took : 86 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11863745139543055397.txt' '-o' '/tmp/graph11863745139543055397.bin' '-w' '/tmp/graph11863745139543055397.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11863745139543055397.bin' '-l' '-1' '-v' '-w' '/tmp/graph11863745139543055397.weights' '-q' '0' '-e' '0.001'
[2024-05-28 17:12:26] [INFO ] Decomposing Gal with order
[2024-05-28 17:12:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 17:12:26] [INFO ] Removed a total of 1071 redundant transitions.
[2024-05-28 17:12:26] [INFO ] Flatten gal took : 400 ms
[2024-05-28 17:12:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 414 labels/synchronizations in 56 ms.
[2024-05-28 17:12:26] [INFO ] Time to serialize gal into /tmp/LTL14978661283528360025.gal : 37 ms
[2024-05-28 17:12:26] [INFO ] Time to serialize properties into /tmp/LTL8718523562720855440.ltl : 26 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14978661283528360025.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8718523562720855440.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G((((((X(F("(((((i7.u30.NoSigAbort>=1)&&(i7.u30.Abort_Check_Sources_B_6>=1))||((i7.u30.Abort_Check_Sources_B_2>=1)&&(i7.u30.NoSig...1920
Formula 0 simplified : G(F(!"((((((i5.u18.cSources>=9)&&(i5.u18.ProcessingEvt_5>=1))&&(i5.u18.ModifiedSrc_2>=1))||(((i5.u18.cSources>=9)&&(i5.u18.Processin...1904
Detected timeout of ITS tools.
Treatment of property PolyORBLF-PT-S02J06T08-LTLFireability-01 finished in 354185 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 0 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 69 ms. Remains 486 /667 variables (removed 181) and now considering 1111/1290 (removed 179) transitions.
Running 1109 sub problems to find dead transitions.
[2024-05-28 17:12:42] [INFO ] Flow matrix only has 1095 transitions (discarded 16 similar events)
// Phase 1: matrix 1095 rows 486 cols
[2024-05-28 17:12:42] [INFO ] Computed 45 invariants in 11 ms
[2024-05-28 17:12:42] [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-05-28 17:12:51] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 2 ms to minimize.
[2024-05-28 17:12:51] [INFO ] Deduced a trap composed of 49 places in 36 ms of which 0 ms to minimize.
[2024-05-28 17:12:51] [INFO ] Deduced a trap composed of 49 places in 31 ms of which 0 ms to minimize.
[2024-05-28 17:12:51] [INFO ] Deduced a trap composed of 50 places in 36 ms of which 3 ms to minimize.
[2024-05-28 17:12:51] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 1 ms to minimize.
[2024-05-28 17:12:51] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
[2024-05-28 17:12:51] [INFO ] Deduced a trap composed of 31 places in 201 ms of which 3 ms to minimize.
[2024-05-28 17:12:52] [INFO ] Deduced a trap composed of 50 places in 40 ms of which 1 ms to minimize.
[2024-05-28 17:12:52] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 1 ms to minimize.
[2024-05-28 17:12:52] [INFO ] Deduced a trap composed of 189 places in 242 ms of which 3 ms to minimize.
[2024-05-28 17:12:52] [INFO ] Deduced a trap composed of 174 places in 287 ms of which 3 ms to minimize.
[2024-05-28 17:12:53] [INFO ] Deduced a trap composed of 201 places in 298 ms of which 3 ms to minimize.
[2024-05-28 17:12:53] [INFO ] Deduced a trap composed of 185 places in 253 ms of which 3 ms to minimize.
[2024-05-28 17:12:54] [INFO ] Deduced a trap composed of 72 places in 186 ms of which 2 ms to minimize.
[2024-05-28 17:12:55] [INFO ] Deduced a trap composed of 93 places in 297 ms of which 4 ms to minimize.
[2024-05-28 17:12:57] [INFO ] Deduced a trap composed of 50 places in 253 ms of which 3 ms to minimize.
[2024-05-28 17:13:00] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 2 ms to minimize.
[2024-05-28 17:13:02] [INFO ] Deduced a trap composed of 216 places in 196 ms of which 2 ms to minimize.
[2024-05-28 17:13:03] [INFO ] Deduced a trap composed of 195 places in 216 ms of which 3 ms to minimize.
[2024-05-28 17:13:03] [INFO ] Deduced a trap composed of 226 places in 229 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/484 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1109 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 484/1581 variables, and 63 constraints, problems are : Problem set: 0 solved, 1109 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/486 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1109/1109 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1109 unsolved
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
At refinement iteration 2 (INCLUDED_ONLY) 0/484 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1109 unsolved
[2024-05-28 17:13:10] [INFO ] Deduced a trap composed of 209 places in 207 ms of which 4 ms to minimize.
[2024-05-28 17:13:10] [INFO ] Deduced a trap composed of 209 places in 184 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 484/1581 variables, and 65 constraints, problems are : Problem set: 0 solved, 1109 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/486 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1109 constraints, Known Traps: 22/22 constraints]
After SMT, in 41738ms problems are : Problem set: 0 solved, 1109 unsolved
Search for dead transitions found 0 dead transitions in 41747ms
[2024-05-28 17:13:23] [INFO ] Flow matrix only has 1095 transitions (discarded 16 similar events)
[2024-05-28 17:13:23] [INFO ] Invariant cache hit.
[2024-05-28 17:13:24] [INFO ] Implicit Places using invariants in 450 ms returned [127]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 453 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 25 ms. Remains 484 /485 variables (removed 1) and now considering 1110/1111 (removed 1) transitions.
[2024-05-28 17:13:24] [INFO ] Flow matrix only has 1094 transitions (discarded 16 similar events)
// Phase 1: matrix 1094 rows 484 cols
[2024-05-28 17:13:24] [INFO ] Computed 44 invariants in 12 ms
[2024-05-28 17:13:24] [INFO ] Implicit Places using invariants in 529 ms returned []
[2024-05-28 17:13:24] [INFO ] Flow matrix only has 1094 transitions (discarded 16 similar events)
[2024-05-28 17:13:24] [INFO ] Invariant cache hit.
[2024-05-28 17:13:25] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 17:13:35] [INFO ] Implicit Places using invariants and state equation in 10385 ms returned []
Implicit Place search using SMT with State Equation took 10930 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 53228 ms. Remains : 484/667 places, 1110/1290 transitions.
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S02J06T08-LTLFireability-02
Stuttering criterion allowed to conclude after 1255 steps with 25 reset in 6 ms.
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T08-LTLFireability-02 finished in 53298 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 8 ms. Remains 665 /667 variables (removed 2) and now considering 1290/1290 (removed 0) transitions.
Running 1288 sub problems to find dead transitions.
[2024-05-28 17:13:35] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 665 cols
[2024-05-28 17:13:35] [INFO ] Computed 45 invariants in 12 ms
[2024-05-28 17:13:35] [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-05-28 17:13:47] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 1 ms to minimize.
[2024-05-28 17:13:47] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 0 ms to minimize.
[2024-05-28 17:13:47] [INFO ] Deduced a trap composed of 159 places in 259 ms of which 4 ms to minimize.
[2024-05-28 17:13:47] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 1 ms to minimize.
[2024-05-28 17:13:47] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 1 ms to minimize.
[2024-05-28 17:13:47] [INFO ] Deduced a trap composed of 73 places in 54 ms of which 1 ms to minimize.
[2024-05-28 17:13:48] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
[2024-05-28 17:13:48] [INFO ] Deduced a trap composed of 73 places in 50 ms of which 1 ms to minimize.
[2024-05-28 17:13:48] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
[2024-05-28 17:13:49] [INFO ] Deduced a trap composed of 350 places in 291 ms of which 3 ms to minimize.
[2024-05-28 17:13:49] [INFO ] Deduced a trap composed of 326 places in 242 ms of which 3 ms to minimize.
[2024-05-28 17:13:50] [INFO ] Deduced a trap composed of 74 places in 280 ms of which 4 ms to minimize.
[2024-05-28 17:13:51] [INFO ] Deduced a trap composed of 348 places in 263 ms of which 5 ms to minimize.
[2024-05-28 17:13:51] [INFO ] Deduced a trap composed of 19 places in 290 ms of which 3 ms to minimize.
[2024-05-28 17:13:52] [INFO ] Deduced a trap composed of 337 places in 230 ms of which 4 ms to minimize.
[2024-05-28 17:13:52] [INFO ] Deduced a trap composed of 47 places in 157 ms of which 3 ms to minimize.
[2024-05-28 17:13:52] [INFO ] Deduced a trap composed of 368 places in 250 ms of which 4 ms to minimize.
[2024-05-28 17:13:54] [INFO ] Deduced a trap composed of 259 places in 234 ms of which 4 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 20020 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-05-28 17:14:13] [INFO ] Deduced a trap composed of 362 places in 384 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 663/1939 variables, and 61 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20063 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: 19/19 constraints]
After SMT, in 41729ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 41740ms
[2024-05-28 17:14:17] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 17:14:17] [INFO ] Invariant cache hit.
[2024-05-28 17:14:17] [INFO ] Implicit Places using invariants in 622 ms returned [178]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 636 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 7 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 42394 ms. Remains : 664/667 places, 1290/1290 transitions.
Stuttering acceptance computed with spot in 179 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 0 ms.
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T08-LTLFireability-03 finished in 42591 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 18 ms. Remains 665 /667 variables (removed 2) and now considering 1290/1290 (removed 0) transitions.
Running 1288 sub problems to find dead transitions.
[2024-05-28 17:14:17] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 17:14:17] [INFO ] Invariant cache hit.
[2024-05-28 17:14:17] [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-05-28 17:14:31] [INFO ] Deduced a trap composed of 159 places in 335 ms of which 3 ms to minimize.
[2024-05-28 17:14:31] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 1 ms to minimize.
[2024-05-28 17:14:31] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 2 ms to minimize.
[2024-05-28 17:14:31] [INFO ] Deduced a trap composed of 72 places in 60 ms of which 1 ms to minimize.
[2024-05-28 17:14:31] [INFO ] Deduced a trap composed of 72 places in 40 ms of which 1 ms to minimize.
[2024-05-28 17:14:31] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 2 ms to minimize.
[2024-05-28 17:14:32] [INFO ] Deduced a trap composed of 73 places in 64 ms of which 1 ms to minimize.
[2024-05-28 17:14:32] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 1 ms to minimize.
[2024-05-28 17:14:33] [INFO ] Deduced a trap composed of 72 places in 429 ms of which 5 ms to minimize.
[2024-05-28 17:14:33] [INFO ] Deduced a trap composed of 337 places in 395 ms of which 5 ms to minimize.
[2024-05-28 17:14:34] [INFO ] Deduced a trap composed of 19 places in 293 ms of which 4 ms to minimize.
[2024-05-28 17:14:34] [INFO ] Deduced a trap composed of 326 places in 273 ms of which 4 ms to minimize.
[2024-05-28 17:14:36] [INFO ] Deduced a trap composed of 141 places in 199 ms of which 3 ms to minimize.
[2024-05-28 17:14:37] [INFO ] Deduced a trap composed of 329 places in 380 ms of which 5 ms to minimize.
[2024-05-28 17:14:38] [INFO ] Deduced a trap composed of 329 places in 359 ms of which 5 ms to minimize.
[2024-05-28 17:14:38] [INFO ] Deduced a trap composed of 375 places in 319 ms of which 3 ms to minimize.
[2024-05-28 17:14:38] [INFO ] Deduced a trap composed of 388 places in 296 ms of which 4 ms to minimize.
[2024-05-28 17:14:39] [INFO ] Deduced a trap composed of 47 places in 200 ms of which 3 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 20022 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-05-28 17:14:56] [INFO ] Deduced a trap composed of 498 places in 338 ms of which 4 ms to minimize.
[2024-05-28 17:14:56] [INFO ] Deduced a trap composed of 472 places in 261 ms of which 3 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 20022 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 41915ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 41937ms
[2024-05-28 17:14:59] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 17:14:59] [INFO ] Invariant cache hit.
[2024-05-28 17:15:00] [INFO ] Implicit Places using invariants in 558 ms returned [178]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 560 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 8 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 42528 ms. Remains : 664/667 places, 1290/1290 transitions.
Stuttering acceptance computed with spot in 182 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 466 ms.
Product exploration explored 100000 steps with 50000 reset in 470 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 40 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 43709 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 0 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 57 ms. Remains 478 /667 variables (removed 189) and now considering 1103/1290 (removed 187) transitions.
Running 1101 sub problems to find dead transitions.
[2024-05-28 17:15:01] [INFO ] Flow matrix only has 1087 transitions (discarded 16 similar events)
// Phase 1: matrix 1087 rows 478 cols
[2024-05-28 17:15:01] [INFO ] Computed 45 invariants in 28 ms
[2024-05-28 17:15:01] [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-05-28 17:15:11] [INFO ] Deduced a trap composed of 49 places in 111 ms of which 2 ms to minimize.
[2024-05-28 17:15:11] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 1 ms to minimize.
[2024-05-28 17:15:11] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 1 ms to minimize.
[2024-05-28 17:15:11] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 0 ms to minimize.
[2024-05-28 17:15:11] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 1 ms to minimize.
[2024-05-28 17:15:11] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 1 ms to minimize.
[2024-05-28 17:15:12] [INFO ] Deduced a trap composed of 39 places in 210 ms of which 2 ms to minimize.
[2024-05-28 17:15:12] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 1 ms to minimize.
[2024-05-28 17:15:12] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 1 ms to minimize.
[2024-05-28 17:15:12] [INFO ] Deduced a trap composed of 167 places in 308 ms of which 4 ms to minimize.
[2024-05-28 17:15:13] [INFO ] Deduced a trap composed of 182 places in 263 ms of which 2 ms to minimize.
[2024-05-28 17:15:13] [INFO ] Deduced a trap composed of 171 places in 215 ms of which 2 ms to minimize.
[2024-05-28 17:15:15] [INFO ] Deduced a trap composed of 19 places in 191 ms of which 3 ms to minimize.
[2024-05-28 17:15:16] [INFO ] Deduced a trap composed of 41 places in 287 ms of which 4 ms to minimize.
[2024-05-28 17:15:16] [INFO ] Deduced a trap composed of 81 places in 255 ms of which 4 ms to minimize.
[2024-05-28 17:15:17] [INFO ] Deduced a trap composed of 182 places in 289 ms of which 3 ms to minimize.
[2024-05-28 17:15:22] [INFO ] Deduced a trap composed of 227 places in 233 ms of which 2 ms to minimize.
[2024-05-28 17:15:23] [INFO ] Deduced a trap composed of 219 places in 181 ms of which 2 ms to minimize.
[2024-05-28 17:15:23] [INFO ] Deduced a trap composed of 170 places in 199 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 476/1565 variables, and 61 constraints, problems are : Problem set: 0 solved, 1101 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/31 constraints, State Equation: 0/478 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1101/1101 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1101 unsolved
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
At refinement iteration 2 (INCLUDED_ONLY) 0/476 variables, 19/61 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-28 17:15:30] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2024-05-28 17:15:31] [INFO ] Deduced a trap composed of 322 places in 265 ms of which 4 ms to minimize.
[2024-05-28 17:15:32] [INFO ] Deduced a trap composed of 321 places in 248 ms of which 3 ms to minimize.
[2024-05-28 17:15:35] [INFO ] Deduced a trap composed of 212 places in 303 ms of which 3 ms to minimize.
[2024-05-28 17:15:36] [INFO ] Deduced a trap composed of 221 places in 269 ms of which 3 ms to minimize.
[2024-05-28 17:15:36] [INFO ] Deduced a trap composed of 183 places in 269 ms of which 4 ms to minimize.
[2024-05-28 17:15:36] [INFO ] Deduced a trap composed of 202 places in 256 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 476/1565 variables, and 68 constraints, problems are : Problem set: 0 solved, 1101 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/31 constraints, State Equation: 0/478 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1101 constraints, Known Traps: 26/26 constraints]
After SMT, in 42283ms problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 42296ms
[2024-05-28 17:15:43] [INFO ] Flow matrix only has 1087 transitions (discarded 16 similar events)
[2024-05-28 17:15:43] [INFO ] Invariant cache hit.
[2024-05-28 17:15:44] [INFO ] Implicit Places using invariants in 404 ms returned [121]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 419 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 34 ms. Remains 476 /477 variables (removed 1) and now considering 1102/1103 (removed 1) transitions.
[2024-05-28 17:15:44] [INFO ] Flow matrix only has 1086 transitions (discarded 16 similar events)
// Phase 1: matrix 1086 rows 476 cols
[2024-05-28 17:15:44] [INFO ] Computed 44 invariants in 10 ms
[2024-05-28 17:15:44] [INFO ] Implicit Places using invariants in 455 ms returned []
[2024-05-28 17:15:44] [INFO ] Flow matrix only has 1086 transitions (discarded 16 similar events)
[2024-05-28 17:15:44] [INFO ] Invariant cache hit.
[2024-05-28 17:15:45] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 17:15:55] [INFO ] Implicit Places using invariants and state equation in 10314 ms returned []
Implicit Place search using SMT with State Equation took 10784 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 53593 ms. Remains : 476/667 places, 1102/1290 transitions.
Stuttering acceptance computed with spot in 58 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 473 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 11 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 54589 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 8 ms. Remains 665 /667 variables (removed 2) and now considering 1290/1290 (removed 0) transitions.
Running 1288 sub problems to find dead transitions.
[2024-05-28 17:15:56] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 665 cols
[2024-05-28 17:15:56] [INFO ] Computed 45 invariants in 16 ms
[2024-05-28 17:15: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-05-28 17:16:08] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 1 ms to minimize.
[2024-05-28 17:16:08] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
[2024-05-28 17:16:08] [INFO ] Deduced a trap composed of 159 places in 264 ms of which 3 ms to minimize.
[2024-05-28 17:16:08] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 1 ms to minimize.
[2024-05-28 17:16:08] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 1 ms to minimize.
[2024-05-28 17:16:09] [INFO ] Deduced a trap composed of 73 places in 53 ms of which 0 ms to minimize.
[2024-05-28 17:16:09] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 0 ms to minimize.
[2024-05-28 17:16:09] [INFO ] Deduced a trap composed of 73 places in 56 ms of which 1 ms to minimize.
[2024-05-28 17:16:09] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 1 ms to minimize.
[2024-05-28 17:16:10] [INFO ] Deduced a trap composed of 350 places in 246 ms of which 3 ms to minimize.
[2024-05-28 17:16:10] [INFO ] Deduced a trap composed of 326 places in 260 ms of which 4 ms to minimize.
[2024-05-28 17:16:11] [INFO ] Deduced a trap composed of 74 places in 307 ms of which 3 ms to minimize.
[2024-05-28 17:16:12] [INFO ] Deduced a trap composed of 348 places in 241 ms of which 4 ms to minimize.
[2024-05-28 17:16:12] [INFO ] Deduced a trap composed of 19 places in 254 ms of which 3 ms to minimize.
[2024-05-28 17:16:13] [INFO ] Deduced a trap composed of 337 places in 248 ms of which 4 ms to minimize.
[2024-05-28 17:16:13] [INFO ] Deduced a trap composed of 47 places in 142 ms of which 2 ms to minimize.
[2024-05-28 17:16:14] [INFO ] Deduced a trap composed of 368 places in 274 ms of which 3 ms to minimize.
[2024-05-28 17:16:16] [INFO ] Deduced a trap composed of 259 places in 258 ms of which 3 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 20024 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-05-28 17:16:35] [INFO ] Deduced a trap composed of 362 places in 269 ms of which 3 ms to minimize.
[2024-05-28 17:16:38] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 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 41965ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 41976ms
[2024-05-28 17:16:38] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 17:16:38] [INFO ] Invariant cache hit.
[2024-05-28 17:16:38] [INFO ] Implicit Places using invariants in 534 ms returned [178]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 550 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 8 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 42546 ms. Remains : 664/667 places, 1290/1290 transitions.
Stuttering acceptance computed with spot in 114 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 7735 steps with 24 reset in 25 ms.
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T08-LTLFireability-09 finished in 42699 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 9 ms. Remains 665 /667 variables (removed 2) and now considering 1290/1290 (removed 0) transitions.
Running 1288 sub problems to find dead transitions.
[2024-05-28 17:16:38] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 17:16:38] [INFO ] Invariant cache hit.
[2024-05-28 17:16: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-05-28 17:16:53] [INFO ] Deduced a trap composed of 159 places in 294 ms of which 3 ms to minimize.
[2024-05-28 17:16:53] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 1 ms to minimize.
[2024-05-28 17:16:53] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 1 ms to minimize.
[2024-05-28 17:16:53] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 1 ms to minimize.
[2024-05-28 17:16:53] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 1 ms to minimize.
[2024-05-28 17:16:53] [INFO ] Deduced a trap composed of 72 places in 37 ms of which 1 ms to minimize.
[2024-05-28 17:16:53] [INFO ] Deduced a trap composed of 73 places in 69 ms of which 1 ms to minimize.
[2024-05-28 17:16:54] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 1 ms to minimize.
[2024-05-28 17:16:55] [INFO ] Deduced a trap composed of 72 places in 384 ms of which 6 ms to minimize.
[2024-05-28 17:16:55] [INFO ] Deduced a trap composed of 337 places in 367 ms of which 4 ms to minimize.
[2024-05-28 17:16:55] [INFO ] Deduced a trap composed of 19 places in 252 ms of which 3 ms to minimize.
[2024-05-28 17:16:56] [INFO ] Deduced a trap composed of 326 places in 238 ms of which 3 ms to minimize.
[2024-05-28 17:16:57] [INFO ] Deduced a trap composed of 141 places in 231 ms of which 3 ms to minimize.
[2024-05-28 17:16:58] [INFO ] Deduced a trap composed of 329 places in 243 ms of which 3 ms to minimize.
[2024-05-28 17:16:59] [INFO ] Deduced a trap composed of 329 places in 249 ms of which 3 ms to minimize.
[2024-05-28 17:16:59] [INFO ] Deduced a trap composed of 375 places in 252 ms of which 4 ms to minimize.
[2024-05-28 17:16:59] [INFO ] Deduced a trap composed of 388 places in 265 ms of which 4 ms to minimize.
[2024-05-28 17:17:00] [INFO ] Deduced a trap composed of 47 places in 127 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-05-28 17:17:17] [INFO ] Deduced a trap composed of 498 places in 284 ms of which 3 ms to minimize.
[2024-05-28 17:17:17] [INFO ] Deduced a trap composed of 472 places in 378 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 20023 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 42200ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 42212ms
[2024-05-28 17:17:21] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 17:17:21] [INFO ] Invariant cache hit.
[2024-05-28 17:17:21] [INFO ] Implicit Places using invariants in 591 ms returned [178]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 606 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 8 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 42837 ms. Remains : 664/667 places, 1290/1290 transitions.
Stuttering acceptance computed with spot in 166 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 1781 steps with 1 reset in 6 ms.
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T08-LTLFireability-10 finished in 43027 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 0 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 49 ms. Remains 464 /667 variables (removed 203) and now considering 1089/1290 (removed 201) transitions.
Running 1087 sub problems to find dead transitions.
[2024-05-28 17:17:21] [INFO ] Flow matrix only has 1073 transitions (discarded 16 similar events)
// Phase 1: matrix 1073 rows 464 cols
[2024-05-28 17:17:21] [INFO ] Computed 45 invariants in 14 ms
[2024-05-28 17:17: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-05-28 17:17:30] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 2 ms to minimize.
[2024-05-28 17:17:30] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-05-28 17:17:30] [INFO ] Deduced a trap composed of 46 places in 31 ms of which 0 ms to minimize.
[2024-05-28 17:17:30] [INFO ] Deduced a trap composed of 66 places in 191 ms of which 2 ms to minimize.
[2024-05-28 17:17:31] [INFO ] Deduced a trap composed of 47 places in 34 ms of which 0 ms to minimize.
[2024-05-28 17:17:31] [INFO ] Deduced a trap composed of 47 places in 31 ms of which 1 ms to minimize.
[2024-05-28 17:17:31] [INFO ] Deduced a trap composed of 48 places in 262 ms of which 3 ms to minimize.
[2024-05-28 17:17:31] [INFO ] Deduced a trap composed of 158 places in 239 ms of which 3 ms to minimize.
[2024-05-28 17:17:31] [INFO ] Deduced a trap composed of 46 places in 33 ms of which 1 ms to minimize.
[2024-05-28 17:17:31] [INFO ] Deduced a trap composed of 48 places in 36 ms of which 1 ms to minimize.
[2024-05-28 17:17:33] [INFO ] Deduced a trap composed of 133 places in 192 ms of which 2 ms to minimize.
[2024-05-28 17:17:33] [INFO ] Deduced a trap composed of 73 places in 244 ms of which 3 ms to minimize.
[2024-05-28 17:17:33] [INFO ] Deduced a trap composed of 31 places in 172 ms of which 2 ms to minimize.
[2024-05-28 17:17:34] [INFO ] Deduced a trap composed of 166 places in 265 ms of which 4 ms to minimize.
[2024-05-28 17:17:35] [INFO ] Deduced a trap composed of 26 places in 179 ms of which 2 ms to minimize.
[2024-05-28 17:17:35] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 2 ms to minimize.
[2024-05-28 17:17:39] [INFO ] Deduced a trap composed of 300 places in 267 ms of which 3 ms to minimize.
[2024-05-28 17:17:39] [INFO ] Deduced a trap composed of 291 places in 238 ms of which 4 ms to minimize.
[2024-05-28 17:17:40] [INFO ] Deduced a trap composed of 298 places in 285 ms of which 3 ms to minimize.
[2024-05-28 17:17:41] [INFO ] Deduced a trap composed of 204 places in 298 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
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1537 variables, and 63 constraints, problems are : Problem set: 0 solved, 1087 unsolved in 20021 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-05-28 17:17:52] [INFO ] Deduced a trap composed of 213 places in 308 ms of which 4 ms to minimize.
[2024-05-28 17:17:53] [INFO ] Deduced a trap composed of 224 places in 309 ms of which 9 ms to minimize.
[2024-05-28 17:17:53] [INFO ] Deduced a trap composed of 183 places in 276 ms of which 3 ms to minimize.
[2024-05-28 17:17:53] [INFO ] Deduced a trap composed of 230 places in 306 ms of which 4 ms to minimize.
[2024-05-28 17:17:54] [INFO ] Deduced a trap composed of 214 places in 260 ms of which 2 ms to minimize.
[2024-05-28 17:17:54] [INFO ] Deduced a trap composed of 200 places in 234 ms of which 3 ms to minimize.
[2024-05-28 17:17:56] [INFO ] Deduced a trap composed of 218 places in 319 ms of which 4 ms to minimize.
[2024-05-28 17:17:56] [INFO ] Deduced a trap composed of 201 places in 267 ms of which 4 ms to minimize.
[2024-05-28 17:17:56] [INFO ] Deduced a trap composed of 216 places in 273 ms of which 3 ms to minimize.
[2024-05-28 17:17:57] [INFO ] Deduced a trap composed of 201 places in 259 ms of which 3 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 20027 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 41718ms problems are : Problem set: 0 solved, 1087 unsolved
Search for dead transitions found 0 dead transitions in 41728ms
[2024-05-28 17:18:03] [INFO ] Flow matrix only has 1073 transitions (discarded 16 similar events)
[2024-05-28 17:18:03] [INFO ] Invariant cache hit.
[2024-05-28 17:18:04] [INFO ] Implicit Places using invariants in 381 ms returned [120]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 384 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 20 ms. Remains 462 /463 variables (removed 1) and now considering 1088/1089 (removed 1) transitions.
[2024-05-28 17:18:04] [INFO ] Flow matrix only has 1072 transitions (discarded 16 similar events)
// Phase 1: matrix 1072 rows 462 cols
[2024-05-28 17:18:04] [INFO ] Computed 44 invariants in 17 ms
[2024-05-28 17:18:04] [INFO ] Implicit Places using invariants in 570 ms returned []
[2024-05-28 17:18:04] [INFO ] Flow matrix only has 1072 transitions (discarded 16 similar events)
[2024-05-28 17:18:04] [INFO ] Invariant cache hit.
[2024-05-28 17:18:07] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 17:18:16] [INFO ] Implicit Places using invariants and state equation in 12329 ms returned []
Implicit Place search using SMT with State Equation took 12902 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 55085 ms. Remains : 462/667 places, 1088/1290 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T08-LTLFireability-11
Stuttering criterion allowed to conclude after 2789 steps with 14 reset in 25 ms.
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T08-LTLFireability-11 finished in 55175 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-05-28 17:18:17] [INFO ] Flatten gal took : 36 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7285361913085060527
[2024-05-28 17:18:17] [INFO ] Computing symmetric may disable matrix : 1290 transitions.
[2024-05-28 17:18:17] [INFO ] Applying decomposition
[2024-05-28 17:18:17] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:18:17] [INFO ] Computing symmetric may enable matrix : 1290 transitions.
[2024-05-28 17:18:17] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:18:17] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9556135971663994673.txt' '-o' '/tmp/graph9556135971663994673.bin' '-w' '/tmp/graph9556135971663994673.weights'
[2024-05-28 17:18:17] [INFO ] Computing Do-Not-Accords matrix : 1290 transitions.
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9556135971663994673.bin' '-l' '-1' '-v' '-w' '/tmp/graph9556135971663994673.weights' '-q' '0' '-e' '0.001'
[2024-05-28 17:18:17] [INFO ] Decomposing Gal with order
[2024-05-28 17:18:17] [INFO ] Computation of Completed DNA matrix. took 37 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:18:17] [INFO ] Built C files in 313ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7285361913085060527
Running compilation step : cd /tmp/ltsmin7285361913085060527;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-28 17:18:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 17:18:17] [INFO ] Removed a total of 1133 redundant transitions.
[2024-05-28 17:18:17] [INFO ] Flatten gal took : 171 ms
[2024-05-28 17:18:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 267 labels/synchronizations in 57 ms.
[2024-05-28 17:18:17] [INFO ] Time to serialize gal into /tmp/LTLFireability10123814908009764503.gal : 23 ms
[2024-05-28 17:18:17] [INFO ] Time to serialize properties into /tmp/LTLFireability1934976075529337512.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10123814908009764503.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1934976075529337512.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G(("(((((((i7.u69.cSources>=9)&&(i7.u89.ProcessingEvt_6>=1))&&(i7.u69.ModifiedSrc_1>=1))||(((i7.u69.cSources>=9)&&(i7.u69.Modifie...1952
Formula 0 simplified : G(F!"(((((((i7.u69.cSources>=9)&&(i7.u89.ProcessingEvt_6>=1))&&(i7.u69.ModifiedSrc_1>=1))||(((i7.u69.cSources>=9)&&(i7.u69.ModifiedS...1942
Compilation finished in 6580 ms.
Running link step : cd /tmp/ltsmin7285361913085060527;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 127 ms.
Running LTSmin : cd /tmp/ltsmin7285361913085060527;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X(<>((LTLAPp1==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
LTSmin run took 14555 ms.
FORMULA PolyORBLF-PT-S02J06T08-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 975635 ms.

BK_STOP 1716916718977

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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:
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
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 itstools"
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 r290-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 ;