Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 17K Apr 11 16:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Apr 11 16:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K Apr 11 16:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 146K Apr 11 16:53 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 49K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 11 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 104K Apr 11 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 539K Apr 11 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K 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 717K 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-S02J04T08-LTLFireability-00
FORMULA_NAME PolyORBLF-PT-S02J04T08-LTLFireability-01
FORMULA_NAME PolyORBLF-PT-S02J04T08-LTLFireability-02
FORMULA_NAME PolyORBLF-PT-S02J04T08-LTLFireability-03
FORMULA_NAME PolyORBLF-PT-S02J04T08-LTLFireability-04
FORMULA_NAME PolyORBLF-PT-S02J04T08-LTLFireability-05
FORMULA_NAME PolyORBLF-PT-S02J04T08-LTLFireability-06
FORMULA_NAME PolyORBLF-PT-S02J04T08-LTLFireability-07
FORMULA_NAME PolyORBLF-PT-S02J04T08-LTLFireability-08
FORMULA_NAME PolyORBLF-PT-S02J04T08-LTLFireability-09
FORMULA_NAME PolyORBLF-PT-S02J04T08-LTLFireability-10
FORMULA_NAME PolyORBLF-PT-S02J04T08-LTLFireability-11
FORMULA_NAME PolyORBLF-PT-S02J04T08-LTLFireability-12
FORMULA_NAME PolyORBLF-PT-S02J04T08-LTLFireability-13
FORMULA_NAME PolyORBLF-PT-S02J04T08-LTLFireability-14
FORMULA_NAME PolyORBLF-PT-S02J04T08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717252363968

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J04T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:32:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 14:32:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:32:47] [INFO ] Load time of PNML (sax parser for PT used): 353 ms
[2024-06-01 14:32:47] [INFO ] Transformed 614 places.
[2024-06-01 14:32:47] [INFO ] Transformed 1242 transitions.
[2024-06-01 14:32:47] [INFO ] Parsed PT model containing 614 places and 1242 transitions and 5732 arcs in 624 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 140 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 1114/1114 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 612 transition count 1114
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 606 transition count 1108
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 606 transition count 1108
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 600 transition count 1102
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 600 transition count 1102
Applied a total of 26 rules in 219 ms. Remains 600 /614 variables (removed 14) and now considering 1102/1114 (removed 12) transitions.
Running 1100 sub problems to find dead transitions.
[2024-06-01 14:32:48] [INFO ] Flow matrix only has 1086 transitions (discarded 16 similar events)
// Phase 1: matrix 1086 rows 600 cols
[2024-06-01 14:32:48] [INFO ] Computed 48 invariants in 80 ms
[2024-06-01 14:32:48] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 14:33:01] [INFO ] Deduced a trap composed of 66 places in 251 ms of which 24 ms to minimize.
[2024-06-01 14:33:01] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 3 ms to minimize.
[2024-06-01 14:33:01] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:33:01] [INFO ] Deduced a trap composed of 66 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:33:01] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:33:01] [INFO ] Deduced a trap composed of 64 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:33:01] [INFO ] Deduced a trap composed of 64 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:33:02] [INFO ] Deduced a trap composed of 163 places in 230 ms of which 10 ms to minimize.
[2024-06-01 14:33:02] [INFO ] Deduced a trap composed of 298 places in 242 ms of which 3 ms to minimize.
[2024-06-01 14:33:02] [INFO ] Deduced a trap composed of 63 places in 37 ms of which 0 ms to minimize.
[2024-06-01 14:33:02] [INFO ] Deduced a trap composed of 64 places in 35 ms of which 1 ms to minimize.
[2024-06-01 14:33:03] [INFO ] Deduced a trap composed of 398 places in 268 ms of which 4 ms to minimize.
[2024-06-01 14:33:03] [INFO ] Deduced a trap composed of 329 places in 269 ms of which 4 ms to minimize.
[2024-06-01 14:33:03] [INFO ] Deduced a trap composed of 409 places in 247 ms of which 3 ms to minimize.
[2024-06-01 14:33:04] [INFO ] Deduced a trap composed of 320 places in 270 ms of which 3 ms to minimize.
[2024-06-01 14:33:04] [INFO ] Deduced a trap composed of 295 places in 233 ms of which 4 ms to minimize.
[2024-06-01 14:33:05] [INFO ] Deduced a trap composed of 79 places in 175 ms of which 3 ms to minimize.
[2024-06-01 14:33:05] [INFO ] Deduced a trap composed of 324 places in 325 ms of which 5 ms to minimize.
[2024-06-01 14:33:06] [INFO ] Deduced a trap composed of 269 places in 328 ms of which 5 ms to minimize.
[2024-06-01 14:33:09] [INFO ] Deduced a trap composed of 54 places in 306 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/598 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 598/1686 variables, and 66 constraints, problems are : Problem set: 0 solved, 1100 unsolved in 20080 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 34/36 constraints, State Equation: 0/600 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1100/1100 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/598 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/1686 variables, and 66 constraints, problems are : Problem set: 0 solved, 1100 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 34/36 constraints, State Equation: 0/600 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1100 constraints, Known Traps: 20/20 constraints]
After SMT, in 42608ms problems are : Problem set: 0 solved, 1100 unsolved
Search for dead transitions found 0 dead transitions in 42700ms
[2024-06-01 14:33:30] [INFO ] Flow matrix only has 1086 transitions (discarded 16 similar events)
[2024-06-01 14:33:30] [INFO ] Invariant cache hit.
[2024-06-01 14:33:31] [INFO ] Implicit Places using invariants in 671 ms returned [108, 181, 289, 301, 422, 490, 518, 530]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 693 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 592/614 places, 1102/1114 transitions.
Applied a total of 0 rules in 14 ms. Remains 592 /592 variables (removed 0) and now considering 1102/1102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43724 ms. Remains : 592/614 places, 1102/1114 transitions.
Support contains 140 out of 592 places after structural reductions.
[2024-06-01 14:33:32] [INFO ] Flatten gal took : 220 ms
[2024-06-01 14:33:32] [INFO ] Flatten gal took : 144 ms
[2024-06-01 14:33:32] [INFO ] Input system was already deterministic with 1102 transitions.
RANDOM walk for 40000 steps (11 resets) in 2045 ms. (19 steps per ms) remains 1/19 properties
BEST_FIRST walk for 40001 steps (9 resets) in 188 ms. (211 steps per ms) remains 1/1 properties
[2024-06-01 14:33:33] [INFO ] Flow matrix only has 1086 transitions (discarded 16 similar events)
// Phase 1: matrix 1086 rows 592 cols
[2024-06-01 14:33:33] [INFO ] Computed 40 invariants in 29 ms
[2024-06-01 14:33:33] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 442/506 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/506 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 45/551 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/589 variables, 17/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:33:34] [INFO ] Deduced a trap composed of 64 places in 325 ms of which 6 ms to minimize.
[2024-06-01 14:33:34] [INFO ] Deduced a trap composed of 64 places in 247 ms of which 12 ms to minimize.
[2024-06-01 14:33:34] [INFO ] Deduced a trap composed of 67 places in 174 ms of which 2 ms to minimize.
[2024-06-01 14:33:34] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 1 ms to minimize.
[2024-06-01 14:33:34] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:33:34] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/589 variables, 6/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:33:34] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/589 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/589 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/590 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/590 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1676/1678 variables, and 636 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2221 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 590/592 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 442/506 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/506 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 45/551 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/589 variables, 17/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/589 variables, 7/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/589 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/590 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/590 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1676/1678 variables, and 636 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1350 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 590/592 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 3620ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 125 ms.
Support contains 8 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1102/1102 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 592 transition count 1042
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 120 place count 532 transition count 1042
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 120 place count 532 transition count 978
Deduced a syphon composed of 64 places in 3 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 248 place count 468 transition count 978
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 250 place count 466 transition count 976
Iterating global reduction 2 with 2 rules applied. Total rules applied 252 place count 466 transition count 976
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 380 place count 402 transition count 912
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 384 place count 398 transition count 908
Iterating global reduction 2 with 4 rules applied. Total rules applied 388 place count 398 transition count 908
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 404 place count 398 transition count 892
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 420 place count 382 transition count 892
Applied a total of 420 rules in 211 ms. Remains 382 /592 variables (removed 210) and now considering 892/1102 (removed 210) transitions.
Running 890 sub problems to find dead transitions.
[2024-06-01 14:33:37] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
// Phase 1: matrix 876 rows 382 cols
[2024-06-01 14:33:37] [INFO ] Computed 40 invariants in 30 ms
[2024-06-01 14:33:37] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/380 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/380 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 890 unsolved
[2024-06-01 14:33:44] [INFO ] Deduced a trap composed of 38 places in 131 ms of which 2 ms to minimize.
[2024-06-01 14:33:44] [INFO ] Deduced a trap composed of 41 places in 190 ms of which 2 ms to minimize.
[2024-06-01 14:33:45] [INFO ] Deduced a trap composed of 34 places in 187 ms of which 2 ms to minimize.
[2024-06-01 14:33:45] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 1 ms to minimize.
[2024-06-01 14:33:45] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 2 ms to minimize.
[2024-06-01 14:33:45] [INFO ] Deduced a trap composed of 38 places in 184 ms of which 2 ms to minimize.
[2024-06-01 14:33:45] [INFO ] Deduced a trap composed of 55 places in 155 ms of which 3 ms to minimize.
[2024-06-01 14:33:45] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 4 ms to minimize.
[2024-06-01 14:33:45] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:33:46] [INFO ] Deduced a trap composed of 38 places in 280 ms of which 3 ms to minimize.
[2024-06-01 14:33:46] [INFO ] Deduced a trap composed of 39 places in 268 ms of which 3 ms to minimize.
[2024-06-01 14:33:46] [INFO ] Deduced a trap composed of 65 places in 243 ms of which 2 ms to minimize.
[2024-06-01 14:33:47] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 2 ms to minimize.
[2024-06-01 14:33:47] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 3 ms to minimize.
[2024-06-01 14:33:48] [INFO ] Deduced a trap composed of 218 places in 265 ms of which 4 ms to minimize.
[2024-06-01 14:33:48] [INFO ] Deduced a trap composed of 144 places in 216 ms of which 3 ms to minimize.
[2024-06-01 14:33:50] [INFO ] Deduced a trap composed of 137 places in 203 ms of which 3 ms to minimize.
[2024-06-01 14:33:52] [INFO ] Deduced a trap composed of 140 places in 231 ms of which 3 ms to minimize.
[2024-06-01 14:33:52] [INFO ] Deduced a trap composed of 150 places in 219 ms of which 3 ms to minimize.
[2024-06-01 14:33:52] [INFO ] Deduced a trap composed of 161 places in 245 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 890 unsolved
[2024-06-01 14:33:57] [INFO ] Deduced a trap composed of 125 places in 211 ms of which 3 ms to minimize.
[2024-06-01 14:33:58] [INFO ] Deduced a trap composed of 180 places in 212 ms of which 3 ms to minimize.
[2024-06-01 14:33:59] [INFO ] Deduced a trap composed of 166 places in 191 ms of which 3 ms to minimize.
[2024-06-01 14:33:59] [INFO ] Deduced a trap composed of 124 places in 206 ms of which 4 ms to minimize.
[2024-06-01 14:33:59] [INFO ] Deduced a trap composed of 161 places in 172 ms of which 2 ms to minimize.
SMT process timed out in 22090ms, After SMT, problems are : Problem set: 0 solved, 890 unsolved
Search for dead transitions found 0 dead transitions in 22105ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22320 ms. Remains : 382/592 places, 892/1102 transitions.
RANDOM walk for 40000 steps (13 resets) in 749 ms. (53 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (11 resets) in 500 ms. (79 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 242764 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :0 out of 1
Probabilistic random walk after 242764 steps, saw 147285 distinct states, run finished after 3005 ms. (steps per millisecond=80 ) properties seen :0
[2024-06-01 14:34:02] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2024-06-01 14:34:02] [INFO ] Invariant cache hit.
[2024-06-01 14:34:02] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 270/278 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/299 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/307 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 69/376 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:34:03] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 2 ms to minimize.
[2024-06-01 14:34:03] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 2 ms to minimize.
[2024-06-01 14:34:03] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 2 ms to minimize.
[2024-06-01 14:34:03] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 2 ms to minimize.
[2024-06-01 14:34:03] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 4 ms to minimize.
[2024-06-01 14:34:03] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:34:03] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/379 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/380 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/380 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 876/1256 variables, 380/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1256 variables, 96/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1256 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 2/1258 variables, 2/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1258 variables, 1/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1258 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1258 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1258/1258 variables, and 525 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2633 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 382/382 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 270/278 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/299 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/307 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 69/376 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 7/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:34:05] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/379 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/380 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/380 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 876/1256 variables, 380/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1256 variables, 96/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1256 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1256 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/1258 variables, 2/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1258 variables, 1/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1258 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1258 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1258/1258 variables, and 527 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1660 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 382/382 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 4333ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 227 ms.
Support contains 8 out of 382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 892/892 transitions.
Applied a total of 0 rules in 30 ms. Remains 382 /382 variables (removed 0) and now considering 892/892 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 382/382 places, 892/892 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 892/892 transitions.
Applied a total of 0 rules in 28 ms. Remains 382 /382 variables (removed 0) and now considering 892/892 (removed 0) transitions.
[2024-06-01 14:34:07] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2024-06-01 14:34:07] [INFO ] Invariant cache hit.
[2024-06-01 14:34:08] [INFO ] Implicit Places using invariants in 595 ms returned []
[2024-06-01 14:34:08] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2024-06-01 14:34:08] [INFO ] Invariant cache hit.
[2024-06-01 14:34:08] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:34:12] [INFO ] Implicit Places using invariants and state equation in 4374 ms returned []
Implicit Place search using SMT with State Equation took 4971 ms to find 0 implicit places.
[2024-06-01 14:34:12] [INFO ] Redundant transitions in 61 ms returned []
Running 890 sub problems to find dead transitions.
[2024-06-01 14:34:12] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2024-06-01 14:34:12] [INFO ] Invariant cache hit.
[2024-06-01 14:34:12] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/380 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/380 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 890 unsolved
[2024-06-01 14:34:19] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 2 ms to minimize.
[2024-06-01 14:34:19] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 2 ms to minimize.
[2024-06-01 14:34:19] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 2 ms to minimize.
[2024-06-01 14:34:19] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 2 ms to minimize.
[2024-06-01 14:34:19] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:34:19] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 0 ms to minimize.
[2024-06-01 14:34:19] [INFO ] Deduced a trap composed of 38 places in 27 ms of which 1 ms to minimize.
[2024-06-01 14:34:19] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:34:19] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:34:19] [INFO ] Deduced a trap composed of 66 places in 172 ms of which 2 ms to minimize.
[2024-06-01 14:34:20] [INFO ] Deduced a trap composed of 134 places in 132 ms of which 2 ms to minimize.
[2024-06-01 14:34:20] [INFO ] Deduced a trap composed of 218 places in 142 ms of which 2 ms to minimize.
[2024-06-01 14:34:21] [INFO ] Deduced a trap composed of 127 places in 148 ms of which 2 ms to minimize.
[2024-06-01 14:34:23] [INFO ] Deduced a trap composed of 132 places in 243 ms of which 3 ms to minimize.
[2024-06-01 14:34:24] [INFO ] Deduced a trap composed of 162 places in 181 ms of which 2 ms to minimize.
[2024-06-01 14:34:24] [INFO ] Deduced a trap composed of 133 places in 244 ms of which 3 ms to minimize.
[2024-06-01 14:34:25] [INFO ] Deduced a trap composed of 184 places in 210 ms of which 2 ms to minimize.
[2024-06-01 14:34:26] [INFO ] Deduced a trap composed of 55 places in 117 ms of which 2 ms to minimize.
[2024-06-01 14:34:26] [INFO ] Deduced a trap composed of 168 places in 253 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 19/57 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 890 unsolved
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD891 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/382 variables, 2/59 constraints. Problems are: Problem set: 88 solved, 802 unsolved
[2024-06-01 14:34:41] [INFO ] Deduced a trap composed of 131 places in 244 ms of which 3 ms to minimize.
[2024-06-01 14:34:41] [INFO ] Deduced a trap composed of 72 places in 126 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 382/1258 variables, and 61 constraints, problems are : Problem set: 88 solved, 802 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/382 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 890/890 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 88 solved, 802 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/380 variables, 14/14 constraints. Problems are: Problem set: 88 solved, 802 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/380 variables, 24/38 constraints. Problems are: Problem set: 88 solved, 802 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 19/57 constraints. Problems are: Problem set: 88 solved, 802 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 0/57 constraints. Problems are: Problem set: 88 solved, 802 unsolved
At refinement iteration 4 (OVERLAPS) 2/382 variables, 2/59 constraints. Problems are: Problem set: 88 solved, 802 unsolved
SMT process timed out in 61581ms, After SMT, problems are : Problem set: 88 solved, 802 unsolved
Search for dead transitions found 88 dead transitions in 61595ms
Found 88 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 88 transitions
Dead transitions reduction (with SMT) removed 88 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 382/382 places, 804/892 transitions.
Reduce places removed 2 places and 16 transitions.
Graph (complete) has 2376 edges and 380 vertex of which 8 are kept as prefixes of interest. Removing 372 places using SCC suffix rule.4 ms
Discarding 372 places :
Also discarding 780 output transitions
Drop transitions (Output transitions of discarded places.) removed 780 transitions
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 8 transition count 8
Reduce places removed 0 places and 8 transitions.
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 3 rules in 36 ms. Remains 8 /382 variables (removed 374) and now considering 0/804 (removed 804) transitions.
[2024-06-01 14:35:14] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 14:35:14] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-01 14:35:14] [INFO ] Invariant cache hit.
[2024-06-01 14:35:14] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 8/382 places, 0/892 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 66815 ms. Remains : 8/382 places, 0/892 transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 8 out of 592 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 592/592 places, 1102/1102 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 590 transition count 1100
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 590 transition count 1100
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 588 transition count 1098
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 588 transition count 1098
Applied a total of 8 rules in 37 ms. Remains 588 /592 variables (removed 4) and now considering 1098/1102 (removed 4) transitions.
Running 1096 sub problems to find dead transitions.
[2024-06-01 14:35:14] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 588 cols
[2024-06-01 14:35:14] [INFO ] Computed 40 invariants in 18 ms
[2024-06-01 14:35:14] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 14:35:25] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 3 ms to minimize.
[2024-06-01 14:35:25] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 2 ms to minimize.
[2024-06-01 14:35:25] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:35:25] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:35:26] [INFO ] Deduced a trap composed of 64 places in 121 ms of which 2 ms to minimize.
[2024-06-01 14:35:26] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:35:26] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:35:26] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 2 ms to minimize.
[2024-06-01 14:35:26] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:35:27] [INFO ] Deduced a trap composed of 114 places in 229 ms of which 3 ms to minimize.
[2024-06-01 14:35:27] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 3 ms to minimize.
[2024-06-01 14:35:27] [INFO ] Deduced a trap composed of 406 places in 315 ms of which 4 ms to minimize.
[2024-06-01 14:35:28] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 2 ms to minimize.
[2024-06-01 14:35:28] [INFO ] Deduced a trap composed of 300 places in 361 ms of which 4 ms to minimize.
[2024-06-01 14:35:30] [INFO ] Deduced a trap composed of 294 places in 222 ms of which 3 ms to minimize.
[2024-06-01 14:35:30] [INFO ] Deduced a trap composed of 299 places in 321 ms of which 5 ms to minimize.
[2024-06-01 14:35:31] [INFO ] Deduced a trap composed of 269 places in 291 ms of which 4 ms to minimize.
[2024-06-01 14:35:32] [INFO ] Deduced a trap composed of 323 places in 226 ms of which 3 ms to minimize.
[2024-06-01 14:35:32] [INFO ] Deduced a trap composed of 339 places in 225 ms of which 3 ms to minimize.
[2024-06-01 14:35:32] [INFO ] Deduced a trap composed of 305 places in 229 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 58 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1096 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 Int declared 586/1670 variables, and 58 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 20/20 constraints]
After SMT, in 41391ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41403ms
[2024-06-01 14:35:56] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 14:35:56] [INFO ] Invariant cache hit.
[2024-06-01 14:35:56] [INFO ] Implicit Places using invariants in 433 ms returned []
[2024-06-01 14:35:56] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 14:35:56] [INFO ] Invariant cache hit.
[2024-06-01 14:35:57] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:36:04] [INFO ] Implicit Places using invariants and state equation in 7942 ms returned []
Implicit Place search using SMT with State Equation took 8377 ms to find 0 implicit places.
Running 1096 sub problems to find dead transitions.
[2024-06-01 14:36:04] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 14:36:04] [INFO ] Invariant cache hit.
[2024-06-01 14:36:04] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 14:36:15] [INFO ] Deduced a trap composed of 19 places in 205 ms of which 3 ms to minimize.
[2024-06-01 14:36:15] [INFO ] Deduced a trap composed of 64 places in 105 ms of which 2 ms to minimize.
[2024-06-01 14:36:15] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:36:15] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 2 ms to minimize.
[2024-06-01 14:36:15] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:36:15] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:36:16] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:36:16] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 2 ms to minimize.
[2024-06-01 14:36:16] [INFO ] Deduced a trap composed of 64 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:36:16] [INFO ] Deduced a trap composed of 162 places in 235 ms of which 3 ms to minimize.
[2024-06-01 14:36:17] [INFO ] Deduced a trap composed of 396 places in 240 ms of which 3 ms to minimize.
[2024-06-01 14:36:17] [INFO ] Deduced a trap composed of 394 places in 237 ms of which 4 ms to minimize.
[2024-06-01 14:36:18] [INFO ] Deduced a trap composed of 79 places in 134 ms of which 2 ms to minimize.
[2024-06-01 14:36:18] [INFO ] Deduced a trap composed of 326 places in 298 ms of which 4 ms to minimize.
[2024-06-01 14:36:18] [INFO ] Deduced a trap composed of 269 places in 290 ms of which 4 ms to minimize.
[2024-06-01 14:36:20] [INFO ] Deduced a trap composed of 269 places in 316 ms of which 4 ms to minimize.
[2024-06-01 14:36:21] [INFO ] Deduced a trap composed of 3 places in 302 ms of which 4 ms to minimize.
[2024-06-01 14:36:22] [INFO ] Deduced a trap composed of 302 places in 237 ms of which 3 ms to minimize.
[2024-06-01 14:36:22] [INFO ] Deduced a trap composed of 294 places in 285 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 19/57 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 14:36:35] [INFO ] Deduced a trap composed of 54 places in 332 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 58 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 14:37:01] [INFO ] Deduced a trap composed of 374 places in 334 ms of which 5 ms to minimize.
[2024-06-01 14:37:03] [INFO ] Deduced a trap composed of 355 places in 248 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 22/22 constraints]
After SMT, in 61531ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 61545ms
Starting structural reductions in LTL mode, iteration 1 : 588/592 places, 1098/1102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111370 ms. Remains : 588/592 places, 1098/1102 transitions.
Stuttering acceptance computed with spot in 360 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J04T08-LTLFireability-00
Entered a terminal (fully accepting) state of product in 62 steps with 0 reset in 4 ms.
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T08-LTLFireability-00 finished in 111816 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(X(F((p0 U (!X(p0) U p1)))))))'
Support contains 9 out of 592 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 : 592/592 places, 1102/1102 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 592 transition count 1074
Reduce places removed 28 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 44 rules applied. Total rules applied 72 place count 564 transition count 1058
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 88 place count 548 transition count 1058
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 88 place count 548 transition count 986
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 232 place count 476 transition count 986
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 234 place count 474 transition count 984
Iterating global reduction 3 with 2 rules applied. Total rules applied 236 place count 474 transition count 984
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 316 place count 434 transition count 944
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 320 place count 430 transition count 940
Iterating global reduction 3 with 4 rules applied. Total rules applied 324 place count 430 transition count 940
Applied a total of 324 rules in 185 ms. Remains 430 /592 variables (removed 162) and now considering 940/1102 (removed 162) transitions.
Running 938 sub problems to find dead transitions.
[2024-06-01 14:37:06] [INFO ] Flow matrix only has 924 transitions (discarded 16 similar events)
// Phase 1: matrix 924 rows 430 cols
[2024-06-01 14:37:06] [INFO ] Computed 40 invariants in 23 ms
[2024-06-01 14:37:06] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 938 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 938 unsolved
[2024-06-01 14:37:13] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
[2024-06-01 14:37:13] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:37:13] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 1 ms to minimize.
[2024-06-01 14:37:13] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 0 ms to minimize.
[2024-06-01 14:37:13] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:37:13] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 0 ms to minimize.
[2024-06-01 14:37:13] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:37:13] [INFO ] Deduced a trap composed of 70 places in 246 ms of which 3 ms to minimize.
[2024-06-01 14:37:14] [INFO ] Deduced a trap composed of 95 places in 203 ms of which 3 ms to minimize.
[2024-06-01 14:37:14] [INFO ] Deduced a trap composed of 45 places in 33 ms of which 0 ms to minimize.
[2024-06-01 14:37:14] [INFO ] Deduced a trap composed of 178 places in 198 ms of which 2 ms to minimize.
[2024-06-01 14:37:14] [INFO ] Deduced a trap composed of 166 places in 200 ms of which 6 ms to minimize.
[2024-06-01 14:37:14] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 2 ms to minimize.
[2024-06-01 14:37:15] [INFO ] Deduced a trap composed of 63 places in 135 ms of which 2 ms to minimize.
[2024-06-01 14:37:16] [INFO ] Deduced a trap composed of 156 places in 190 ms of which 3 ms to minimize.
[2024-06-01 14:37:16] [INFO ] Deduced a trap composed of 190 places in 184 ms of which 2 ms to minimize.
[2024-06-01 14:37:16] [INFO ] Deduced a trap composed of 158 places in 191 ms of which 3 ms to minimize.
[2024-06-01 14:37:17] [INFO ] Deduced a trap composed of 266 places in 180 ms of which 2 ms to minimize.
[2024-06-01 14:37:23] [INFO ] Deduced a trap composed of 234 places in 233 ms of which 3 ms to minimize.
[2024-06-01 14:37:23] [INFO ] Deduced a trap composed of 207 places in 195 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/428 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 938 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 428/1354 variables, and 58 constraints, problems are : Problem set: 0 solved, 938 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/430 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 938/938 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 938 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 938 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 938 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/428 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 938 unsolved
[2024-06-01 14:37:45] [INFO ] Deduced a trap composed of 173 places in 277 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 428/1354 variables, and 59 constraints, problems are : Problem set: 0 solved, 938 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/430 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/938 constraints, Known Traps: 21/21 constraints]
After SMT, in 41390ms problems are : Problem set: 0 solved, 938 unsolved
Search for dead transitions found 0 dead transitions in 41413ms
[2024-06-01 14:37:48] [INFO ] Flow matrix only has 924 transitions (discarded 16 similar events)
[2024-06-01 14:37:48] [INFO ] Invariant cache hit.
[2024-06-01 14:37:48] [INFO ] Implicit Places using invariants in 388 ms returned []
[2024-06-01 14:37:48] [INFO ] Flow matrix only has 924 transitions (discarded 16 similar events)
[2024-06-01 14:37:48] [INFO ] Invariant cache hit.
[2024-06-01 14:37:49] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:37:54] [INFO ] Implicit Places using invariants and state equation in 5969 ms returned []
Implicit Place search using SMT with State Equation took 6360 ms to find 0 implicit places.
[2024-06-01 14:37:54] [INFO ] Redundant transitions in 21 ms returned []
Running 938 sub problems to find dead transitions.
[2024-06-01 14:37:54] [INFO ] Flow matrix only has 924 transitions (discarded 16 similar events)
[2024-06-01 14:37:54] [INFO ] Invariant cache hit.
[2024-06-01 14:37:54] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 938 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 938 unsolved
[2024-06-01 14:38:01] [INFO ] Deduced a trap composed of 49 places in 240 ms of which 4 ms to minimize.
[2024-06-01 14:38:01] [INFO ] Deduced a trap composed of 85 places in 222 ms of which 3 ms to minimize.
[2024-06-01 14:38:01] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:38:01] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:38:01] [INFO ] Deduced a trap composed of 44 places in 32 ms of which 0 ms to minimize.
[2024-06-01 14:38:01] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 1 ms to minimize.
[2024-06-01 14:38:01] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 0 ms to minimize.
[2024-06-01 14:38:01] [INFO ] Deduced a trap composed of 44 places in 32 ms of which 0 ms to minimize.
[2024-06-01 14:38:02] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 0 ms to minimize.
[2024-06-01 14:38:02] [INFO ] Deduced a trap composed of 45 places in 30 ms of which 0 ms to minimize.
[2024-06-01 14:38:02] [INFO ] Deduced a trap composed of 19 places in 183 ms of which 2 ms to minimize.
[2024-06-01 14:38:02] [INFO ] Deduced a trap composed of 268 places in 191 ms of which 3 ms to minimize.
[2024-06-01 14:38:02] [INFO ] Deduced a trap composed of 63 places in 132 ms of which 2 ms to minimize.
[2024-06-01 14:38:03] [INFO ] Deduced a trap composed of 177 places in 210 ms of which 2 ms to minimize.
[2024-06-01 14:38:03] [INFO ] Deduced a trap composed of 158 places in 219 ms of which 3 ms to minimize.
[2024-06-01 14:38:05] [INFO ] Deduced a trap composed of 282 places in 235 ms of which 4 ms to minimize.
[2024-06-01 14:38:05] [INFO ] Deduced a trap composed of 278 places in 205 ms of which 4 ms to minimize.
[2024-06-01 14:38:06] [INFO ] Deduced a trap composed of 222 places in 163 ms of which 3 ms to minimize.
[2024-06-01 14:38:06] [INFO ] Deduced a trap composed of 184 places in 170 ms of which 2 ms to minimize.
[2024-06-01 14:38:06] [INFO ] Deduced a trap composed of 174 places in 226 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/428 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 938 unsolved
[2024-06-01 14:38:08] [INFO ] Deduced a trap composed of 173 places in 244 ms of which 3 ms to minimize.
[2024-06-01 14:38:15] [INFO ] Deduced a trap composed of 235 places in 240 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/428 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 938 unsolved
[2024-06-01 14:38:22] [INFO ] Deduced a trap composed of 193 places in 170 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 428/1354 variables, and 61 constraints, problems are : Problem set: 0 solved, 938 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/430 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 938/938 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 938 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 938 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 938 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/428 variables, 23/61 constraints. Problems are: Problem set: 0 solved, 938 unsolved
[2024-06-01 14:38:32] [INFO ] Deduced a trap composed of 217 places in 254 ms of which 3 ms to minimize.
[2024-06-01 14:38:38] [INFO ] Deduced a trap composed of 204 places in 223 ms of which 3 ms to minimize.
[2024-06-01 14:38:39] [INFO ] Deduced a trap composed of 198 places in 215 ms of which 3 ms to minimize.
[2024-06-01 14:38:39] [INFO ] Deduced a trap composed of 219 places in 190 ms of which 2 ms to minimize.
[2024-06-01 14:38:39] [INFO ] Deduced a trap composed of 185 places in 209 ms of which 3 ms to minimize.
[2024-06-01 14:38:47] [INFO ] Deduced a trap composed of 162 places in 235 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/428 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 938 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 428/1354 variables, and 67 constraints, problems are : Problem set: 0 solved, 938 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/430 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/938 constraints, Known Traps: 29/29 constraints]
After SMT, in 61258ms problems are : Problem set: 0 solved, 938 unsolved
Search for dead transitions found 0 dead transitions in 61270ms
Starting structural reductions in SI_LTL mode, iteration 1 : 430/592 places, 940/1102 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 109263 ms. Remains : 430/592 places, 940/1102 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S02J04T08-LTLFireability-01
Product exploration explored 100000 steps with 10797 reset in 615 ms.
Product exploration explored 100000 steps with 10957 reset in 430 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 p1), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 153 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 12 steps (0 resets) in 5 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
[2024-06-01 14:38:57] [INFO ] Flow matrix only has 924 transitions (discarded 16 similar events)
[2024-06-01 14:38:57] [INFO ] Invariant cache hit.
[2024-06-01 14:38:57] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-06-01 14:38:57] [INFO ] [Real]Absence check using 12 positive and 28 generalized place invariants in 62 ms returned sat
[2024-06-01 14:38:59] [INFO ] [Real]Absence check using state equation in 1229 ms returned sat
[2024-06-01 14:38:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:38:59] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-06-01 14:38:59] [INFO ] [Nat]Absence check using 12 positive and 28 generalized place invariants in 46 ms returned sat
[2024-06-01 14:39:00] [INFO ] [Nat]Absence check using state equation in 1283 ms returned sat
[2024-06-01 14:39:00] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:39:01] [INFO ] [Nat]Added 96 Read/Feed constraints in 228 ms returned sat
[2024-06-01 14:39:01] [INFO ] Deduced a trap composed of 44 places in 110 ms of which 1 ms to minimize.
[2024-06-01 14:39:01] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:39:02] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 1 ms to minimize.
[2024-06-01 14:39:02] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:39:02] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:39:03] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:39:03] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2374 ms
[2024-06-01 14:39:03] [INFO ] Computed and/alt/rep : 402/1341/394 causal constraints (skipped 528 transitions) in 96 ms.
[2024-06-01 14:39:06] [INFO ] Added : 133 causal constraints over 27 iterations in 3164 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 9 out of 430 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 : 430/430 places, 940/940 transitions.
Applied a total of 0 rules in 33 ms. Remains 430 /430 variables (removed 0) and now considering 940/940 (removed 0) transitions.
Running 938 sub problems to find dead transitions.
[2024-06-01 14:39:06] [INFO ] Flow matrix only has 924 transitions (discarded 16 similar events)
[2024-06-01 14:39:06] [INFO ] Invariant cache hit.
[2024-06-01 14:39:06] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 938 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 938 unsolved
[2024-06-01 14:39:14] [INFO ] Deduced a trap composed of 49 places in 237 ms of which 3 ms to minimize.
[2024-06-01 14:39:14] [INFO ] Deduced a trap composed of 85 places in 236 ms of which 2 ms to minimize.
[2024-06-01 14:39:14] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:39:14] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:39:14] [INFO ] Deduced a trap composed of 44 places in 27 ms of which 0 ms to minimize.
[2024-06-01 14:39:14] [INFO ] Deduced a trap composed of 46 places in 28 ms of which 1 ms to minimize.
[2024-06-01 14:39:14] [INFO ] Deduced a trap composed of 44 places in 31 ms of which 0 ms to minimize.
[2024-06-01 14:39:15] [INFO ] Deduced a trap composed of 44 places in 31 ms of which 0 ms to minimize.
[2024-06-01 14:39:15] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:39:15] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:39:15] [INFO ] Deduced a trap composed of 19 places in 188 ms of which 2 ms to minimize.
[2024-06-01 14:39:15] [INFO ] Deduced a trap composed of 268 places in 223 ms of which 3 ms to minimize.
[2024-06-01 14:39:16] [INFO ] Deduced a trap composed of 63 places in 129 ms of which 2 ms to minimize.
[2024-06-01 14:39:16] [INFO ] Deduced a trap composed of 177 places in 218 ms of which 3 ms to minimize.
[2024-06-01 14:39:16] [INFO ] Deduced a trap composed of 158 places in 240 ms of which 3 ms to minimize.
[2024-06-01 14:39:18] [INFO ] Deduced a trap composed of 282 places in 210 ms of which 3 ms to minimize.
[2024-06-01 14:39:18] [INFO ] Deduced a trap composed of 278 places in 216 ms of which 3 ms to minimize.
[2024-06-01 14:39:19] [INFO ] Deduced a trap composed of 222 places in 261 ms of which 3 ms to minimize.
[2024-06-01 14:39:20] [INFO ] Deduced a trap composed of 184 places in 221 ms of which 3 ms to minimize.
[2024-06-01 14:39:20] [INFO ] Deduced a trap composed of 174 places in 209 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/428 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 938 unsolved
[2024-06-01 14:39:21] [INFO ] Deduced a trap composed of 173 places in 242 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 1.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 1.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 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 5.0)
(s43 (/ 2.0 3.0))
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 (/ 1.0 3.0))
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 5.0)
(s179 (/ 2.0 3.0))
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 9.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 (/ 1.0 3.0))
(s281 1.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 1.0)
(s352 0.0)
(s353 (/ 1.0 3.0))
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 1.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 (/ 8.0 3.0))
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 428/1354 variables, and 59 constraints, problems are : Problem set: 0 solved, 938 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/430 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 938/938 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 938 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 938 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 938 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/428 variables, 21/59 constraints. Problems are: Problem set: 0 solved, 938 unsolved
[2024-06-01 14:39:34] [INFO ] Deduced a trap composed of 174 places in 247 ms of which 3 ms to minimize.
[2024-06-01 14:39:34] [INFO ] Deduced a trap composed of 228 places in 200 ms of which 2 ms to minimize.
[2024-06-01 14:39:40] [INFO ] Deduced a trap composed of 203 places in 228 ms of which 3 ms to minimize.
[2024-06-01 14:39:41] [INFO ] Deduced a trap composed of 197 places in 242 ms of which 2 ms to minimize.
[2024-06-01 14:39:46] [INFO ] Deduced a trap composed of 242 places in 205 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/428 variables, 5/64 constraints. Problems are: Problem set: 0 solved, 938 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 428/1354 variables, and 64 constraints, problems are : Problem set: 0 solved, 938 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/430 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/938 constraints, Known Traps: 26/26 constraints]
After SMT, in 41690ms problems are : Problem set: 0 solved, 938 unsolved
Search for dead transitions found 0 dead transitions in 41705ms
[2024-06-01 14:39:48] [INFO ] Flow matrix only has 924 transitions (discarded 16 similar events)
[2024-06-01 14:39:48] [INFO ] Invariant cache hit.
[2024-06-01 14:39:49] [INFO ] Implicit Places using invariants in 524 ms returned []
[2024-06-01 14:39:49] [INFO ] Flow matrix only has 924 transitions (discarded 16 similar events)
[2024-06-01 14:39:49] [INFO ] Invariant cache hit.
[2024-06-01 14:39:49] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:39:54] [INFO ] Implicit Places using invariants and state equation in 5035 ms returned []
Implicit Place search using SMT with State Equation took 5571 ms to find 0 implicit places.
[2024-06-01 14:39:54] [INFO ] Redundant transitions in 64 ms returned []
Running 938 sub problems to find dead transitions.
[2024-06-01 14:39:54] [INFO ] Flow matrix only has 924 transitions (discarded 16 similar events)
[2024-06-01 14:39:54] [INFO ] Invariant cache hit.
[2024-06-01 14:39:54] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 938 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 938 unsolved
[2024-06-01 14:40:01] [INFO ] Deduced a trap composed of 49 places in 152 ms of which 2 ms to minimize.
[2024-06-01 14:40:01] [INFO ] Deduced a trap composed of 85 places in 243 ms of which 3 ms to minimize.
[2024-06-01 14:40:01] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:40:01] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:40:01] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 0 ms to minimize.
[2024-06-01 14:40:01] [INFO ] Deduced a trap composed of 46 places in 31 ms of which 0 ms to minimize.
[2024-06-01 14:40:01] [INFO ] Deduced a trap composed of 44 places in 31 ms of which 0 ms to minimize.
[2024-06-01 14:40:01] [INFO ] Deduced a trap composed of 44 places in 29 ms of which 0 ms to minimize.
[2024-06-01 14:40:01] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 0 ms to minimize.
[2024-06-01 14:40:01] [INFO ] Deduced a trap composed of 45 places in 30 ms of which 0 ms to minimize.
[2024-06-01 14:40:02] [INFO ] Deduced a trap composed of 19 places in 193 ms of which 1 ms to minimize.
[2024-06-01 14:40:02] [INFO ] Deduced a trap composed of 268 places in 209 ms of which 2 ms to minimize.
[2024-06-01 14:40:02] [INFO ] Deduced a trap composed of 63 places in 97 ms of which 2 ms to minimize.
[2024-06-01 14:40:03] [INFO ] Deduced a trap composed of 177 places in 162 ms of which 3 ms to minimize.
[2024-06-01 14:40:03] [INFO ] Deduced a trap composed of 158 places in 236 ms of which 3 ms to minimize.
[2024-06-01 14:40:05] [INFO ] Deduced a trap composed of 282 places in 245 ms of which 3 ms to minimize.
[2024-06-01 14:40:05] [INFO ] Deduced a trap composed of 278 places in 176 ms of which 2 ms to minimize.
[2024-06-01 14:40:06] [INFO ] Deduced a trap composed of 222 places in 207 ms of which 2 ms to minimize.
[2024-06-01 14:40:06] [INFO ] Deduced a trap composed of 184 places in 225 ms of which 3 ms to minimize.
[2024-06-01 14:40:06] [INFO ] Deduced a trap composed of 174 places in 186 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/428 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 938 unsolved
[2024-06-01 14:40:08] [INFO ] Deduced a trap composed of 173 places in 183 ms of which 2 ms to minimize.
[2024-06-01 14:40:15] [INFO ] Deduced a trap composed of 235 places in 235 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/428 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 938 unsolved
[2024-06-01 14:40:21] [INFO ] Deduced a trap composed of 193 places in 173 ms of which 2 ms to minimize.
[2024-06-01 14:40:25] [INFO ] Deduced a trap composed of 173 places in 249 ms of which 4 ms to minimize.
SMT process timed out in 31764ms, After SMT, problems are : Problem set: 0 solved, 938 unsolved
Search for dead transitions found 0 dead transitions in 31783ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 79173 ms. Remains : 430/430 places, 940/940 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 : [(NOT p1), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 10 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
[2024-06-01 14:40:26] [INFO ] Flow matrix only has 924 transitions (discarded 16 similar events)
[2024-06-01 14:40:26] [INFO ] Invariant cache hit.
[2024-06-01 14:40:26] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-06-01 14:40:27] [INFO ] [Real]Absence check using 12 positive and 28 generalized place invariants in 95 ms returned sat
[2024-06-01 14:40:28] [INFO ] [Real]Absence check using state equation in 1452 ms returned sat
[2024-06-01 14:40:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:40:28] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-06-01 14:40:28] [INFO ] [Nat]Absence check using 12 positive and 28 generalized place invariants in 46 ms returned sat
[2024-06-01 14:40:30] [INFO ] [Nat]Absence check using state equation in 1288 ms returned sat
[2024-06-01 14:40:30] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:40:30] [INFO ] [Nat]Added 96 Read/Feed constraints in 233 ms returned sat
[2024-06-01 14:40:30] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:40:30] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:40:31] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 13 ms to minimize.
[2024-06-01 14:40:31] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 0 ms to minimize.
[2024-06-01 14:40:31] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:40:31] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:40:32] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1658 ms
[2024-06-01 14:40:32] [INFO ] Computed and/alt/rep : 402/1341/394 causal constraints (skipped 528 transitions) in 84 ms.
[2024-06-01 14:40:34] [INFO ] Added : 133 causal constraints over 27 iterations in 2709 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 10674 reset in 465 ms.
Product exploration explored 100000 steps with 10604 reset in 468 ms.
Support contains 9 out of 430 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 430/430 places, 940/940 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 430 transition count 932
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 422 transition count 932
Applied a total of 16 rules in 22 ms. Remains 422 /430 variables (removed 8) and now considering 932/940 (removed 8) transitions.
Running 930 sub problems to find dead transitions.
[2024-06-01 14:40:35] [INFO ] Flow matrix only has 916 transitions (discarded 16 similar events)
// Phase 1: matrix 916 rows 422 cols
[2024-06-01 14:40:35] [INFO ] Computed 40 invariants in 16 ms
[2024-06-01 14:40:35] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 930 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-06-01 14:40:41] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 0 ms to minimize.
[2024-06-01 14:40:41] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:40:41] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:40:41] [INFO ] Deduced a trap composed of 44 places in 155 ms of which 2 ms to minimize.
[2024-06-01 14:40:42] [INFO ] Deduced a trap composed of 103 places in 152 ms of which 3 ms to minimize.
[2024-06-01 14:40:42] [INFO ] Deduced a trap composed of 105 places in 148 ms of which 2 ms to minimize.
[2024-06-01 14:40:42] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:40:42] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 0 ms to minimize.
[2024-06-01 14:40:42] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 0 ms to minimize.
[2024-06-01 14:40:42] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 0 ms to minimize.
[2024-06-01 14:40:42] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 2 ms to minimize.
[2024-06-01 14:40:42] [INFO ] Deduced a trap composed of 258 places in 156 ms of which 2 ms to minimize.
[2024-06-01 14:40:43] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 4 ms to minimize.
[2024-06-01 14:40:43] [INFO ] Deduced a trap composed of 154 places in 232 ms of which 5 ms to minimize.
[2024-06-01 14:40:44] [INFO ] Deduced a trap composed of 166 places in 199 ms of which 2 ms to minimize.
[2024-06-01 14:40:44] [INFO ] Deduced a trap composed of 189 places in 145 ms of which 2 ms to minimize.
[2024-06-01 14:40:44] [INFO ] Deduced a trap composed of 160 places in 155 ms of which 2 ms to minimize.
[2024-06-01 14:40:44] [INFO ] Deduced a trap composed of 158 places in 239 ms of which 3 ms to minimize.
[2024-06-01 14:40:45] [INFO ] Deduced a trap composed of 151 places in 222 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 19/57 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-06-01 14:40:52] [INFO ] Deduced a trap composed of 195 places in 190 ms of which 2 ms to minimize.
[2024-06-01 14:40:52] [INFO ] Deduced a trap composed of 195 places in 164 ms of which 2 ms to minimize.
[2024-06-01 14:40:56] [INFO ] Deduced a trap composed of 42 places in 238 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/1338 variables, and 60 constraints, problems are : Problem set: 0 solved, 930 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/422 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 930/930 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 930 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 930 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 930 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-06-01 14:41:09] [INFO ] Deduced a trap composed of 190 places in 232 ms of which 5 ms to minimize.
[2024-06-01 14:41:10] [INFO ] Deduced a trap composed of 190 places in 162 ms of which 2 ms to minimize.
[2024-06-01 14:41:10] [INFO ] Deduced a trap composed of 191 places in 166 ms of which 2 ms to minimize.
[2024-06-01 14:41:10] [INFO ] Deduced a trap composed of 177 places in 162 ms of which 3 ms to minimize.
[2024-06-01 14:41:10] [INFO ] Deduced a trap composed of 223 places in 215 ms of which 3 ms to minimize.
[2024-06-01 14:41:11] [INFO ] Deduced a trap composed of 197 places in 202 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/1338 variables, and 66 constraints, problems are : Problem set: 0 solved, 930 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/422 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/930 constraints, Known Traps: 28/28 constraints]
After SMT, in 41085ms problems are : Problem set: 0 solved, 930 unsolved
Search for dead transitions found 0 dead transitions in 41093ms
[2024-06-01 14:41:16] [INFO ] Flow matrix only has 916 transitions (discarded 16 similar events)
[2024-06-01 14:41:16] [INFO ] Invariant cache hit.
[2024-06-01 14:41:17] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-06-01 14:41:17] [INFO ] Flow matrix only has 916 transitions (discarded 16 similar events)
[2024-06-01 14:41:17] [INFO ] Invariant cache hit.
[2024-06-01 14:41:17] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:41:22] [INFO ] Implicit Places using invariants and state equation in 5085 ms returned []
Implicit Place search using SMT with State Equation took 5422 ms to find 0 implicit places.
[2024-06-01 14:41:22] [INFO ] Redundant transitions in 35 ms returned []
Running 930 sub problems to find dead transitions.
[2024-06-01 14:41:22] [INFO ] Flow matrix only has 916 transitions (discarded 16 similar events)
[2024-06-01 14:41:22] [INFO ] Invariant cache hit.
[2024-06-01 14:41:22] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 930 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-06-01 14:41:28] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 0 ms to minimize.
[2024-06-01 14:41:28] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:41:28] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:41:28] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:41:28] [INFO ] Deduced a trap composed of 83 places in 236 ms of which 3 ms to minimize.
[2024-06-01 14:41:29] [INFO ] Deduced a trap composed of 44 places in 208 ms of which 2 ms to minimize.
[2024-06-01 14:41:29] [INFO ] Deduced a trap composed of 43 places in 159 ms of which 2 ms to minimize.
[2024-06-01 14:41:29] [INFO ] Deduced a trap composed of 43 places in 238 ms of which 3 ms to minimize.
[2024-06-01 14:41:29] [INFO ] Deduced a trap composed of 43 places in 210 ms of which 3 ms to minimize.
[2024-06-01 14:41:29] [INFO ] Deduced a trap composed of 158 places in 146 ms of which 2 ms to minimize.
[2024-06-01 14:41:29] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 1 ms to minimize.
[2024-06-01 14:41:30] [INFO ] Deduced a trap composed of 166 places in 144 ms of which 2 ms to minimize.
[2024-06-01 14:41:30] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 2 ms to minimize.
[2024-06-01 14:41:31] [INFO ] Deduced a trap composed of 211 places in 153 ms of which 3 ms to minimize.
[2024-06-01 14:41:31] [INFO ] Deduced a trap composed of 290 places in 169 ms of which 2 ms to minimize.
[2024-06-01 14:41:31] [INFO ] Deduced a trap composed of 227 places in 243 ms of which 3 ms to minimize.
[2024-06-01 14:41:31] [INFO ] Deduced a trap composed of 241 places in 166 ms of which 2 ms to minimize.
[2024-06-01 14:41:32] [INFO ] Deduced a trap composed of 178 places in 152 ms of which 2 ms to minimize.
[2024-06-01 14:41:33] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 2 ms to minimize.
[2024-06-01 14:41:33] [INFO ] Deduced a trap composed of 258 places in 133 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-06-01 14:41:34] [INFO ] Deduced a trap composed of 54 places in 313 ms of which 3 ms to minimize.
[2024-06-01 14:41:41] [INFO ] Deduced a trap composed of 145 places in 232 ms of which 3 ms to minimize.
[2024-06-01 14:41:41] [INFO ] Deduced a trap composed of 238 places in 152 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-06-01 14:41:51] [INFO ] Deduced a trap composed of 226 places in 171 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/1338 variables, and 62 constraints, problems are : Problem set: 0 solved, 930 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/422 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 930/930 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 930 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 930 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 930 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 24/62 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-06-01 14:42:00] [INFO ] Deduced a trap composed of 173 places in 265 ms of which 3 ms to minimize.
[2024-06-01 14:42:06] [INFO ] Deduced a trap composed of 185 places in 217 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/1338 variables, and 64 constraints, problems are : Problem set: 0 solved, 930 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/422 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/930 constraints, Known Traps: 26/26 constraints]
After SMT, in 61071ms problems are : Problem set: 0 solved, 930 unsolved
Search for dead transitions found 0 dead transitions in 61085ms
Starting structural reductions in SI_LTL mode, iteration 1 : 422/430 places, 932/940 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 107667 ms. Remains : 422/430 places, 932/940 transitions.
Treatment of property PolyORBLF-PT-S02J04T08-LTLFireability-01 finished in 317390 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((F(p0)&&X((!p0 U (p1||G(!p0)))))))'
Support contains 17 out of 592 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 592/592 places, 1102/1102 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 590 transition count 1100
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 590 transition count 1100
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 588 transition count 1098
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 588 transition count 1098
Applied a total of 8 rules in 36 ms. Remains 588 /592 variables (removed 4) and now considering 1098/1102 (removed 4) transitions.
Running 1096 sub problems to find dead transitions.
[2024-06-01 14:42:23] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 588 cols
[2024-06-01 14:42:23] [INFO ] Computed 40 invariants in 25 ms
[2024-06-01 14:42:23] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 14:42:33] [INFO ] Deduced a trap composed of 19 places in 197 ms of which 3 ms to minimize.
[2024-06-01 14:42:33] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 2 ms to minimize.
[2024-06-01 14:42:33] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 0 ms to minimize.
[2024-06-01 14:42:33] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:42:34] [INFO ] Deduced a trap composed of 64 places in 110 ms of which 2 ms to minimize.
[2024-06-01 14:42:34] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:42:34] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:42:34] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 2 ms to minimize.
[2024-06-01 14:42:34] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:42:34] [INFO ] Deduced a trap composed of 114 places in 234 ms of which 4 ms to minimize.
[2024-06-01 14:42:35] [INFO ] Deduced a trap composed of 162 places in 377 ms of which 3 ms to minimize.
[2024-06-01 14:42:35] [INFO ] Deduced a trap composed of 406 places in 328 ms of which 4 ms to minimize.
[2024-06-01 14:42:36] [INFO ] Deduced a trap composed of 79 places in 118 ms of which 1 ms to minimize.
[2024-06-01 14:42:36] [INFO ] Deduced a trap composed of 300 places in 201 ms of which 3 ms to minimize.
[2024-06-01 14:42:38] [INFO ] Deduced a trap composed of 294 places in 319 ms of which 4 ms to minimize.
[2024-06-01 14:42:38] [INFO ] Deduced a trap composed of 299 places in 303 ms of which 4 ms to minimize.
[2024-06-01 14:42:39] [INFO ] Deduced a trap composed of 269 places in 271 ms of which 4 ms to minimize.
[2024-06-01 14:42:40] [INFO ] Deduced a trap composed of 323 places in 291 ms of which 4 ms to minimize.
[2024-06-01 14:42:40] [INFO ] Deduced a trap composed of 339 places in 261 ms of which 4 ms to minimize.
[2024-06-01 14:42:40] [INFO ] Deduced a trap composed of 305 places in 249 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 58 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 58 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 20/20 constraints]
After SMT, in 41176ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41200ms
[2024-06-01 14:43:05] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 14:43:05] [INFO ] Invariant cache hit.
[2024-06-01 14:43:05] [INFO ] Implicit Places using invariants in 592 ms returned []
[2024-06-01 14:43:05] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 14:43:05] [INFO ] Invariant cache hit.
[2024-06-01 14:43:06] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:43:14] [INFO ] Implicit Places using invariants and state equation in 9111 ms returned []
Implicit Place search using SMT with State Equation took 9719 ms to find 0 implicit places.
Running 1096 sub problems to find dead transitions.
[2024-06-01 14:43:14] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 14:43:14] [INFO ] Invariant cache hit.
[2024-06-01 14:43:14] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 14:43:24] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 2 ms to minimize.
[2024-06-01 14:43:24] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 1 ms to minimize.
[2024-06-01 14:43:24] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:43:24] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 0 ms to minimize.
[2024-06-01 14:43:24] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:43:25] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:43:25] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:43:25] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:43:25] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 0 ms to minimize.
[2024-06-01 14:43:25] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 3 ms to minimize.
[2024-06-01 14:43:26] [INFO ] Deduced a trap composed of 396 places in 274 ms of which 3 ms to minimize.
[2024-06-01 14:43:26] [INFO ] Deduced a trap composed of 394 places in 212 ms of which 3 ms to minimize.
[2024-06-01 14:43:26] [INFO ] Deduced a trap composed of 79 places in 115 ms of which 2 ms to minimize.
[2024-06-01 14:43:27] [INFO ] Deduced a trap composed of 326 places in 197 ms of which 3 ms to minimize.
[2024-06-01 14:43:27] [INFO ] Deduced a trap composed of 269 places in 221 ms of which 3 ms to minimize.
[2024-06-01 14:43:28] [INFO ] Deduced a trap composed of 269 places in 206 ms of which 3 ms to minimize.
[2024-06-01 14:43:29] [INFO ] Deduced a trap composed of 3 places in 203 ms of which 3 ms to minimize.
[2024-06-01 14:43:30] [INFO ] Deduced a trap composed of 302 places in 217 ms of which 3 ms to minimize.
[2024-06-01 14:43:30] [INFO ] Deduced a trap composed of 294 places in 212 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 19/57 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 14:43:42] [INFO ] Deduced a trap composed of 54 places in 212 ms of which 3 ms to minimize.
[2024-06-01 14:43:44] [INFO ] Deduced a trap composed of 123 places in 201 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 59 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 21/59 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 14:44:04] [INFO ] Deduced a trap composed of 337 places in 259 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 22/22 constraints]
After SMT, in 61348ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 61357ms
Starting structural reductions in LTL mode, iteration 1 : 588/592 places, 1098/1102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112317 ms. Remains : 588/592 places, 1098/1102 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S02J04T08-LTLFireability-04
Product exploration explored 100000 steps with 3265 reset in 337 ms.
Product exploration explored 100000 steps with 3336 reset in 379 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) p1), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 122 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 228 steps (0 resets) in 6 ms. (32 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 9 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
[2024-06-01 14:44:17] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 14:44:17] [INFO ] Invariant cache hit.
[2024-06-01 14:44:18] [INFO ] [Real]Absence check using 16 positive place invariants in 26 ms returned sat
[2024-06-01 14:44:18] [INFO ] [Real]Absence check using 16 positive and 24 generalized place invariants in 74 ms returned sat
[2024-06-01 14:44:19] [INFO ] [Real]Absence check using state equation in 1385 ms returned sat
[2024-06-01 14:44:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:44:20] [INFO ] [Nat]Absence check using 16 positive place invariants in 24 ms returned sat
[2024-06-01 14:44:20] [INFO ] [Nat]Absence check using 16 positive and 24 generalized place invariants in 38 ms returned sat
[2024-06-01 14:44:24] [INFO ] [Nat]Absence check using state equation in 4267 ms returned unknown
Could not prove EG (NOT p0)
Support contains 8 out of 588 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 : 588/588 places, 1098/1098 transitions.
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 588 transition count 1058
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 548 transition count 1050
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 96 place count 540 transition count 1050
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 96 place count 540 transition count 986
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 224 place count 476 transition count 986
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 336 place count 420 transition count 930
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 342 place count 414 transition count 924
Iterating global reduction 3 with 6 rules applied. Total rules applied 348 place count 414 transition count 924
Applied a total of 348 rules in 106 ms. Remains 414 /588 variables (removed 174) and now considering 924/1098 (removed 174) transitions.
Running 922 sub problems to find dead transitions.
[2024-06-01 14:44:24] [INFO ] Flow matrix only has 908 transitions (discarded 16 similar events)
// Phase 1: matrix 908 rows 414 cols
[2024-06-01 14:44:24] [INFO ] Computed 40 invariants in 17 ms
[2024-06-01 14:44:24] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/412 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 14:44:30] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 0 ms to minimize.
[2024-06-01 14:44:30] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:44:30] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:44:30] [INFO ] Deduced a trap composed of 43 places in 33 ms of which 1 ms to minimize.
[2024-06-01 14:44:30] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 1 ms to minimize.
[2024-06-01 14:44:30] [INFO ] Deduced a trap composed of 43 places in 29 ms of which 0 ms to minimize.
[2024-06-01 14:44:31] [INFO ] Deduced a trap composed of 50 places in 194 ms of which 2 ms to minimize.
[2024-06-01 14:44:31] [INFO ] Deduced a trap composed of 99 places in 190 ms of which 2 ms to minimize.
[2024-06-01 14:44:31] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 2 ms to minimize.
[2024-06-01 14:44:31] [INFO ] Deduced a trap composed of 170 places in 207 ms of which 2 ms to minimize.
[2024-06-01 14:44:31] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:44:31] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:44:32] [INFO ] Deduced a trap composed of 48 places in 132 ms of which 2 ms to minimize.
[2024-06-01 14:44:32] [INFO ] Deduced a trap composed of 158 places in 168 ms of which 3 ms to minimize.
[2024-06-01 14:44:34] [INFO ] Deduced a trap composed of 264 places in 234 ms of which 4 ms to minimize.
[2024-06-01 14:44:34] [INFO ] Deduced a trap composed of 250 places in 169 ms of which 2 ms to minimize.
[2024-06-01 14:44:34] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 2 ms to minimize.
[2024-06-01 14:44:38] [INFO ] Deduced a trap composed of 151 places in 242 ms of which 3 ms to minimize.
[2024-06-01 14:44:38] [INFO ] Deduced a trap composed of 201 places in 231 ms of which 3 ms to minimize.
[2024-06-01 14:44:39] [INFO ] Deduced a trap composed of 149 places in 265 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 14:44:45] [INFO ] Deduced a trap composed of 157 places in 154 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 412/1322 variables, and 59 constraints, problems are : Problem set: 0 solved, 922 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/414 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 922 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/412 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 21/59 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 14:44:56] [INFO ] Deduced a trap composed of 193 places in 176 ms of which 2 ms to minimize.
[2024-06-01 14:45:00] [INFO ] Deduced a trap composed of 186 places in 234 ms of which 2 ms to minimize.
[2024-06-01 14:45:02] [INFO ] Deduced a trap composed of 139 places in 172 ms of which 2 ms to minimize.
[2024-06-01 14:45:02] [INFO ] Deduced a trap composed of 178 places in 165 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 412/1322 variables, and 63 constraints, problems are : Problem set: 0 solved, 922 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/414 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/922 constraints, Known Traps: 25/25 constraints]
After SMT, in 41318ms problems are : Problem set: 0 solved, 922 unsolved
Search for dead transitions found 0 dead transitions in 41329ms
[2024-06-01 14:45:05] [INFO ] Flow matrix only has 908 transitions (discarded 16 similar events)
[2024-06-01 14:45:05] [INFO ] Invariant cache hit.
[2024-06-01 14:45:06] [INFO ] Implicit Places using invariants in 448 ms returned []
[2024-06-01 14:45:06] [INFO ] Flow matrix only has 908 transitions (discarded 16 similar events)
[2024-06-01 14:45:06] [INFO ] Invariant cache hit.
[2024-06-01 14:45:07] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:45:12] [INFO ] Implicit Places using invariants and state equation in 5843 ms returned []
Implicit Place search using SMT with State Equation took 6317 ms to find 0 implicit places.
[2024-06-01 14:45:12] [INFO ] Redundant transitions in 11 ms returned []
Running 922 sub problems to find dead transitions.
[2024-06-01 14:45:12] [INFO ] Flow matrix only has 908 transitions (discarded 16 similar events)
[2024-06-01 14:45:12] [INFO ] Invariant cache hit.
[2024-06-01 14:45:12] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/412 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 14:45:18] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:45:18] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:45:18] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 0 ms to minimize.
[2024-06-01 14:45:18] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 0 ms to minimize.
[2024-06-01 14:45:18] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 0 ms to minimize.
[2024-06-01 14:45:18] [INFO ] Deduced a trap composed of 93 places in 162 ms of which 2 ms to minimize.
[2024-06-01 14:45:18] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 0 ms to minimize.
[2024-06-01 14:45:18] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:45:18] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 1 ms to minimize.
[2024-06-01 14:45:18] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:45:19] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 1 ms to minimize.
[2024-06-01 14:45:19] [INFO ] Deduced a trap composed of 158 places in 149 ms of which 2 ms to minimize.
[2024-06-01 14:45:21] [INFO ] Deduced a trap composed of 262 places in 230 ms of which 3 ms to minimize.
[2024-06-01 14:45:23] [INFO ] Deduced a trap composed of 166 places in 183 ms of which 3 ms to minimize.
[2024-06-01 14:45:25] [INFO ] Deduced a trap composed of 171 places in 152 ms of which 3 ms to minimize.
[2024-06-01 14:45:25] [INFO ] Deduced a trap composed of 175 places in 179 ms of which 2 ms to minimize.
[2024-06-01 14:45:27] [INFO ] Deduced a trap composed of 203 places in 153 ms of which 2 ms to minimize.
[2024-06-01 14:45:27] [INFO ] Deduced a trap composed of 185 places in 155 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 14:45:33] [INFO ] Deduced a trap composed of 62 places in 174 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 412/1322 variables, and 57 constraints, problems are : Problem set: 0 solved, 922 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/414 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 922 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/412 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 19/57 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 14:45:58] [INFO ] Deduced a trap composed of 192 places in 203 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 412/1322 variables, and 58 constraints, problems are : Problem set: 0 solved, 922 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/414 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/922 constraints, Known Traps: 20/20 constraints]
After SMT, in 61193ms problems are : Problem set: 0 solved, 922 unsolved
Search for dead transitions found 0 dead transitions in 61201ms
Starting structural reductions in SI_LTL mode, iteration 1 : 414/588 places, 924/1098 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 108988 ms. Remains : 414/588 places, 924/1098 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 155 steps (0 resets) in 5 ms. (25 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
[2024-06-01 14:46:13] [INFO ] Flow matrix only has 908 transitions (discarded 16 similar events)
[2024-06-01 14:46:13] [INFO ] Invariant cache hit.
[2024-06-01 14:46:14] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-06-01 14:46:14] [INFO ] [Real]Absence check using 12 positive and 28 generalized place invariants in 74 ms returned sat
[2024-06-01 14:46:15] [INFO ] [Real]Absence check using state equation in 1218 ms returned sat
[2024-06-01 14:46:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:46:16] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-06-01 14:46:16] [INFO ] [Nat]Absence check using 12 positive and 28 generalized place invariants in 56 ms returned sat
[2024-06-01 14:46:17] [INFO ] [Nat]Absence check using state equation in 1129 ms returned sat
[2024-06-01 14:46:17] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:46:17] [INFO ] [Nat]Added 96 Read/Feed constraints in 438 ms returned sat
[2024-06-01 14:46:17] [INFO ] Deduced a trap composed of 50 places in 273 ms of which 3 ms to minimize.
[2024-06-01 14:46:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 395 ms
[2024-06-01 14:46:18] [INFO ] Computed and/alt/rep : 386/1325/378 causal constraints (skipped 528 transitions) in 72 ms.
[2024-06-01 14:46:22] [INFO ] Added : 201 causal constraints over 41 iterations in 3968 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2434 reset in 383 ms.
Product exploration explored 100000 steps with 2436 reset in 396 ms.
Support contains 8 out of 414 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 414/414 places, 924/924 transitions.
Applied a total of 0 rules in 14 ms. Remains 414 /414 variables (removed 0) and now considering 924/924 (removed 0) transitions.
Running 922 sub problems to find dead transitions.
[2024-06-01 14:46:22] [INFO ] Flow matrix only has 908 transitions (discarded 16 similar events)
[2024-06-01 14:46:22] [INFO ] Invariant cache hit.
[2024-06-01 14:46:22] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/412 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 14:46:29] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:46:29] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:46:29] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 1 ms to minimize.
[2024-06-01 14:46:29] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 0 ms to minimize.
[2024-06-01 14:46:30] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:46:30] [INFO ] Deduced a trap composed of 93 places in 257 ms of which 3 ms to minimize.
[2024-06-01 14:46:30] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 0 ms to minimize.
[2024-06-01 14:46:30] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 0 ms to minimize.
[2024-06-01 14:46:30] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 2 ms to minimize.
[2024-06-01 14:46:31] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:46:31] [INFO ] Deduced a trap composed of 31 places in 158 ms of which 2 ms to minimize.
[2024-06-01 14:46:32] [INFO ] Deduced a trap composed of 158 places in 208 ms of which 5 ms to minimize.
[2024-06-01 14:46:33] [INFO ] Deduced a trap composed of 262 places in 186 ms of which 2 ms to minimize.
[2024-06-01 14:46:35] [INFO ] Deduced a trap composed of 166 places in 164 ms of which 2 ms to minimize.
[2024-06-01 14:46:37] [INFO ] Deduced a trap composed of 171 places in 162 ms of which 2 ms to minimize.
[2024-06-01 14:46:37] [INFO ] Deduced a trap composed of 175 places in 183 ms of which 2 ms to minimize.
[2024-06-01 14:46:38] [INFO ] Deduced a trap composed of 203 places in 198 ms of which 2 ms to minimize.
[2024-06-01 14:46:39] [INFO ] Deduced a trap composed of 185 places in 176 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 412/1322 variables, and 56 constraints, problems are : Problem set: 0 solved, 922 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/414 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 922 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/412 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 14:46:57] [INFO ] Deduced a trap composed of 62 places in 169 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 412/1322 variables, and 57 constraints, problems are : Problem set: 0 solved, 922 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/414 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/922 constraints, Known Traps: 19/19 constraints]
After SMT, in 41325ms problems are : Problem set: 0 solved, 922 unsolved
Search for dead transitions found 0 dead transitions in 41333ms
[2024-06-01 14:47:04] [INFO ] Flow matrix only has 908 transitions (discarded 16 similar events)
[2024-06-01 14:47:04] [INFO ] Invariant cache hit.
[2024-06-01 14:47:04] [INFO ] Implicit Places using invariants in 374 ms returned []
[2024-06-01 14:47:04] [INFO ] Flow matrix only has 908 transitions (discarded 16 similar events)
[2024-06-01 14:47:04] [INFO ] Invariant cache hit.
[2024-06-01 14:47:05] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:47:12] [INFO ] Implicit Places using invariants and state equation in 7638 ms returned []
Implicit Place search using SMT with State Equation took 8027 ms to find 0 implicit places.
[2024-06-01 14:47:12] [INFO ] Redundant transitions in 25 ms returned []
Running 922 sub problems to find dead transitions.
[2024-06-01 14:47:12] [INFO ] Flow matrix only has 908 transitions (discarded 16 similar events)
[2024-06-01 14:47:12] [INFO ] Invariant cache hit.
[2024-06-01 14:47:12] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/412 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 14:47:18] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:47:18] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:47:18] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:47:18] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 0 ms to minimize.
[2024-06-01 14:47:18] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 0 ms to minimize.
[2024-06-01 14:47:18] [INFO ] Deduced a trap composed of 93 places in 175 ms of which 2 ms to minimize.
[2024-06-01 14:47:18] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 0 ms to minimize.
[2024-06-01 14:47:18] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:47:19] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 2 ms to minimize.
[2024-06-01 14:47:19] [INFO ] Deduced a trap composed of 44 places in 24 ms of which 0 ms to minimize.
[2024-06-01 14:47:19] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 2 ms to minimize.
[2024-06-01 14:47:19] [INFO ] Deduced a trap composed of 158 places in 151 ms of which 2 ms to minimize.
[2024-06-01 14:47:21] [INFO ] Deduced a trap composed of 262 places in 153 ms of which 2 ms to minimize.
[2024-06-01 14:47:22] [INFO ] Deduced a trap composed of 166 places in 169 ms of which 6 ms to minimize.
[2024-06-01 14:47:24] [INFO ] Deduced a trap composed of 171 places in 151 ms of which 2 ms to minimize.
[2024-06-01 14:47:25] [INFO ] Deduced a trap composed of 175 places in 176 ms of which 2 ms to minimize.
[2024-06-01 14:47:26] [INFO ] Deduced a trap composed of 203 places in 194 ms of which 2 ms to minimize.
[2024-06-01 14:47:27] [INFO ] Deduced a trap composed of 185 places in 161 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 14:47:33] [INFO ] Deduced a trap composed of 62 places in 155 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 412/1322 variables, and 57 constraints, problems are : Problem set: 0 solved, 922 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/414 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 922 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/412 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 19/57 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 14:47:58] [INFO ] Deduced a trap composed of 192 places in 177 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 412/1322 variables, and 58 constraints, problems are : Problem set: 0 solved, 922 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/414 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/922 constraints, Known Traps: 20/20 constraints]
After SMT, in 61358ms problems are : Problem set: 0 solved, 922 unsolved
Search for dead transitions found 0 dead transitions in 61371ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 110784 ms. Remains : 414/414 places, 924/924 transitions.
Treatment of property PolyORBLF-PT-S02J04T08-LTLFireability-04 finished in 349970 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)))'
Support contains 10 out of 592 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 592/592 places, 1102/1102 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 592 transition count 1058
Reduce places removed 44 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 52 rules applied. Total rules applied 96 place count 548 transition count 1050
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 104 place count 540 transition count 1050
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 104 place count 540 transition count 978
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 248 place count 468 transition count 978
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 250 place count 466 transition count 976
Iterating global reduction 3 with 2 rules applied. Total rules applied 252 place count 466 transition count 976
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 332 place count 426 transition count 936
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 336 place count 422 transition count 932
Iterating global reduction 3 with 4 rules applied. Total rules applied 340 place count 422 transition count 932
Applied a total of 340 rules in 56 ms. Remains 422 /592 variables (removed 170) and now considering 932/1102 (removed 170) transitions.
Running 930 sub problems to find dead transitions.
[2024-06-01 14:48:13] [INFO ] Flow matrix only has 916 transitions (discarded 16 similar events)
// Phase 1: matrix 916 rows 422 cols
[2024-06-01 14:48:13] [INFO ] Computed 40 invariants in 20 ms
[2024-06-01 14:48:13] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 930 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-06-01 14:48:20] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:48:20] [INFO ] Deduced a trap composed of 81 places in 231 ms of which 2 ms to minimize.
[2024-06-01 14:48:20] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:48:20] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:48:20] [INFO ] Deduced a trap composed of 44 places in 155 ms of which 1 ms to minimize.
[2024-06-01 14:48:21] [INFO ] Deduced a trap composed of 19 places in 183 ms of which 2 ms to minimize.
[2024-06-01 14:48:21] [INFO ] Deduced a trap composed of 43 places in 28 ms of which 1 ms to minimize.
[2024-06-01 14:48:21] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 0 ms to minimize.
[2024-06-01 14:48:21] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 0 ms to minimize.
[2024-06-01 14:48:21] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:48:21] [INFO ] Deduced a trap composed of 258 places in 196 ms of which 3 ms to minimize.
[2024-06-01 14:48:21] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 2 ms to minimize.
[2024-06-01 14:48:22] [INFO ] Deduced a trap composed of 188 places in 153 ms of which 2 ms to minimize.
[2024-06-01 14:48:22] [INFO ] Deduced a trap composed of 164 places in 167 ms of which 2 ms to minimize.
[2024-06-01 14:48:23] [INFO ] Deduced a trap composed of 260 places in 181 ms of which 3 ms to minimize.
[2024-06-01 14:48:23] [INFO ] Deduced a trap composed of 158 places in 208 ms of which 3 ms to minimize.
[2024-06-01 14:48:24] [INFO ] Deduced a trap composed of 168 places in 174 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-06-01 14:48:30] [INFO ] Deduced a trap composed of 48 places in 152 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/1338 variables, and 56 constraints, problems are : Problem set: 0 solved, 930 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/422 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 930/930 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 930 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 930 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 930 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-06-01 14:48:41] [INFO ] Deduced a trap composed of 207 places in 176 ms of which 2 ms to minimize.
[2024-06-01 14:48:41] [INFO ] Deduced a trap composed of 209 places in 182 ms of which 2 ms to minimize.
[2024-06-01 14:48:49] [INFO ] Deduced a trap composed of 204 places in 164 ms of which 2 ms to minimize.
[2024-06-01 14:48:51] [INFO ] Deduced a trap composed of 140 places in 180 ms of which 3 ms to minimize.
[2024-06-01 14:48:51] [INFO ] Deduced a trap composed of 185 places in 194 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/1338 variables, and 61 constraints, problems are : Problem set: 0 solved, 930 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/422 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/930 constraints, Known Traps: 23/23 constraints]
After SMT, in 41234ms problems are : Problem set: 0 solved, 930 unsolved
Search for dead transitions found 0 dead transitions in 41242ms
[2024-06-01 14:48:55] [INFO ] Flow matrix only has 916 transitions (discarded 16 similar events)
[2024-06-01 14:48:55] [INFO ] Invariant cache hit.
[2024-06-01 14:48:55] [INFO ] Implicit Places using invariants in 363 ms returned []
[2024-06-01 14:48:55] [INFO ] Flow matrix only has 916 transitions (discarded 16 similar events)
[2024-06-01 14:48:55] [INFO ] Invariant cache hit.
[2024-06-01 14:48:55] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:48:59] [INFO ] Implicit Places using invariants and state equation in 3781 ms returned []
Implicit Place search using SMT with State Equation took 4148 ms to find 0 implicit places.
[2024-06-01 14:48:59] [INFO ] Redundant transitions in 31 ms returned []
Running 930 sub problems to find dead transitions.
[2024-06-01 14:48:59] [INFO ] Flow matrix only has 916 transitions (discarded 16 similar events)
[2024-06-01 14:48:59] [INFO ] Invariant cache hit.
[2024-06-01 14:48:59] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 930 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-06-01 14:49:05] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:49:05] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:49:05] [INFO ] Deduced a trap composed of 43 places in 29 ms of which 0 ms to minimize.
[2024-06-01 14:49:05] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 0 ms to minimize.
[2024-06-01 14:49:06] [INFO ] Deduced a trap composed of 187 places in 185 ms of which 3 ms to minimize.
[2024-06-01 14:49:06] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 0 ms to minimize.
[2024-06-01 14:49:06] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 2 ms to minimize.
[2024-06-01 14:49:06] [INFO ] Deduced a trap composed of 44 places in 192 ms of which 2 ms to minimize.
[2024-06-01 14:49:06] [INFO ] Deduced a trap composed of 43 places in 174 ms of which 2 ms to minimize.
[2024-06-01 14:49:07] [INFO ] Deduced a trap composed of 43 places in 181 ms of which 3 ms to minimize.
[2024-06-01 14:49:07] [INFO ] Deduced a trap composed of 180 places in 199 ms of which 2 ms to minimize.
[2024-06-01 14:49:07] [INFO ] Deduced a trap composed of 166 places in 188 ms of which 2 ms to minimize.
[2024-06-01 14:49:07] [INFO ] Deduced a trap composed of 258 places in 168 ms of which 2 ms to minimize.
[2024-06-01 14:49:08] [INFO ] Deduced a trap composed of 81 places in 118 ms of which 2 ms to minimize.
[2024-06-01 14:49:08] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 1 ms to minimize.
[2024-06-01 14:49:08] [INFO ] Deduced a trap composed of 149 places in 187 ms of which 2 ms to minimize.
[2024-06-01 14:49:08] [INFO ] Deduced a trap composed of 158 places in 165 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 930 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 930 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD575 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/422 variables, 2/57 constraints. Problems are: Problem set: 88 solved, 842 unsolved
[2024-06-01 14:49:28] [INFO ] Deduced a trap composed of 154 places in 244 ms of which 3 ms to minimize.
[2024-06-01 14:49:29] [INFO ] Deduced a trap composed of 195 places in 252 ms of which 3 ms to minimize.
[2024-06-01 14:49:29] [INFO ] Deduced a trap composed of 184 places in 205 ms of which 3 ms to minimize.
[2024-06-01 14:49:29] [INFO ] Deduced a trap composed of 220 places in 158 ms of which 3 ms to minimize.
[2024-06-01 14:49:30] [INFO ] Deduced a trap composed of 146 places in 222 ms of which 3 ms to minimize.
[2024-06-01 14:49:30] [INFO ] Deduced a trap composed of 122 places in 167 ms of which 3 ms to minimize.
SMT process timed out in 31304ms, After SMT, problems are : Problem set: 88 solved, 842 unsolved
Search for dead transitions found 88 dead transitions in 31318ms
Found 88 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 88 transitions
Dead transitions reduction (with SMT) removed 88 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 422/592 places, 844/1102 transitions.
Reduce places removed 2 places and 16 transitions.
Reduce places removed 16 places and 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 404 transition count 812
Applied a total of 16 rules in 37 ms. Remains 404 /422 variables (removed 18) and now considering 812/844 (removed 32) transitions.
[2024-06-01 14:49:30] [INFO ] Flow matrix only has 796 transitions (discarded 16 similar events)
// Phase 1: matrix 796 rows 404 cols
[2024-06-01 14:49:30] [INFO ] Computed 40 invariants in 9 ms
[2024-06-01 14:49:31] [INFO ] Implicit Places using invariants in 429 ms returned []
[2024-06-01 14:49:31] [INFO ] Flow matrix only has 796 transitions (discarded 16 similar events)
[2024-06-01 14:49:31] [INFO ] Invariant cache hit.
[2024-06-01 14:49:31] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:49:35] [INFO ] Implicit Places using invariants and state equation in 4901 ms returned []
Implicit Place search using SMT with State Equation took 5348 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 404/592 places, 812/1102 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 82200 ms. Remains : 404/592 places, 812/1102 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J04T08-LTLFireability-05
Product exploration explored 100000 steps with 2489 reset in 431 ms.
Product exploration explored 100000 steps with 2526 reset in 400 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 (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 141 steps (0 resets) in 5 ms. (23 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
[2024-06-01 14:49:37] [INFO ] Flow matrix only has 796 transitions (discarded 16 similar events)
[2024-06-01 14:49:37] [INFO ] Invariant cache hit.
[2024-06-01 14:49:37] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-06-01 14:49:37] [INFO ] [Real]Absence check using 12 positive and 28 generalized place invariants in 100 ms returned sat
[2024-06-01 14:49:38] [INFO ] [Real]Absence check using state equation in 568 ms returned sat
[2024-06-01 14:49:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:49:38] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2024-06-01 14:49:38] [INFO ] [Nat]Absence check using 12 positive and 28 generalized place invariants in 46 ms returned sat
[2024-06-01 14:49:40] [INFO ] [Nat]Absence check using state equation in 1213 ms returned sat
[2024-06-01 14:49:40] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:49:40] [INFO ] [Nat]Added 96 Read/Feed constraints in 151 ms returned sat
[2024-06-01 14:49:40] [INFO ] Deduced a trap composed of 41 places in 198 ms of which 2 ms to minimize.
[2024-06-01 14:49:40] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 1 ms to minimize.
[2024-06-01 14:49:40] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 2 ms to minimize.
[2024-06-01 14:49:40] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 1 ms to minimize.
[2024-06-01 14:49:41] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 1 ms to minimize.
[2024-06-01 14:49:41] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 0 ms to minimize.
[2024-06-01 14:49:41] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:49:41] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1150 ms
[2024-06-01 14:49:41] [INFO ] Computed and/alt/rep : 378/1317/370 causal constraints (skipped 424 transitions) in 39 ms.
[2024-06-01 14:49:42] [INFO ] Added : 174 causal constraints over 36 iterations in 1606 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 10 out of 404 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 404/404 places, 812/812 transitions.
Applied a total of 0 rules in 16 ms. Remains 404 /404 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Running 810 sub problems to find dead transitions.
[2024-06-01 14:49:42] [INFO ] Flow matrix only has 796 transitions (discarded 16 similar events)
[2024-06-01 14:49:42] [INFO ] Invariant cache hit.
[2024-06-01 14:49:42] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:49:48] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:49:48] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:49:48] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:49:48] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:49:48] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:49:48] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:49:48] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:49:48] [INFO ] Deduced a trap composed of 63 places in 148 ms of which 2 ms to minimize.
[2024-06-01 14:49:48] [INFO ] Deduced a trap composed of 140 places in 208 ms of which 3 ms to minimize.
[2024-06-01 14:49:48] [INFO ] Deduced a trap composed of 29 places in 150 ms of which 3 ms to minimize.
[2024-06-01 14:49:49] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:49:49] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 2 ms to minimize.
[2024-06-01 14:49:49] [INFO ] Deduced a trap composed of 269 places in 206 ms of which 3 ms to minimize.
[2024-06-01 14:49:49] [INFO ] Deduced a trap composed of 235 places in 208 ms of which 2 ms to minimize.
[2024-06-01 14:49:50] [INFO ] Deduced a trap composed of 210 places in 177 ms of which 3 ms to minimize.
[2024-06-01 14:49:50] [INFO ] Deduced a trap composed of 223 places in 192 ms of which 2 ms to minimize.
[2024-06-01 14:49:50] [INFO ] Deduced a trap composed of 216 places in 175 ms of which 3 ms to minimize.
[2024-06-01 14:49:50] [INFO ] Deduced a trap composed of 130 places in 148 ms of which 2 ms to minimize.
[2024-06-01 14:49:50] [INFO ] Deduced a trap composed of 238 places in 153 ms of which 2 ms to minimize.
[2024-06-01 14:49:50] [INFO ] Deduced a trap composed of 223 places in 128 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:49:51] [INFO ] Deduced a trap composed of 215 places in 182 ms of which 2 ms to minimize.
[2024-06-01 14:49:52] [INFO ] Deduced a trap composed of 229 places in 167 ms of which 3 ms to minimize.
[2024-06-01 14:49:52] [INFO ] Deduced a trap composed of 232 places in 178 ms of which 3 ms to minimize.
[2024-06-01 14:49:52] [INFO ] Deduced a trap composed of 239 places in 169 ms of which 2 ms to minimize.
[2024-06-01 14:49:52] [INFO ] Deduced a trap composed of 237 places in 159 ms of which 3 ms to minimize.
[2024-06-01 14:49:52] [INFO ] Deduced a trap composed of 241 places in 171 ms of which 3 ms to minimize.
[2024-06-01 14:49:53] [INFO ] Deduced a trap composed of 119 places in 191 ms of which 2 ms to minimize.
[2024-06-01 14:49:53] [INFO ] Deduced a trap composed of 222 places in 178 ms of which 2 ms to minimize.
[2024-06-01 14:49:53] [INFO ] Deduced a trap composed of 224 places in 130 ms of which 2 ms to minimize.
[2024-06-01 14:49:54] [INFO ] Deduced a trap composed of 227 places in 191 ms of which 3 ms to minimize.
[2024-06-01 14:49:54] [INFO ] Deduced a trap composed of 130 places in 142 ms of which 2 ms to minimize.
[2024-06-01 14:49:54] [INFO ] Deduced a trap composed of 130 places in 139 ms of which 2 ms to minimize.
[2024-06-01 14:49:54] [INFO ] Deduced a trap composed of 230 places in 150 ms of which 2 ms to minimize.
[2024-06-01 14:49:54] [INFO ] Deduced a trap composed of 205 places in 151 ms of which 2 ms to minimize.
[2024-06-01 14:49:54] [INFO ] Deduced a trap composed of 217 places in 149 ms of which 2 ms to minimize.
[2024-06-01 14:49:55] [INFO ] Deduced a trap composed of 231 places in 179 ms of which 2 ms to minimize.
[2024-06-01 14:49:55] [INFO ] Deduced a trap composed of 214 places in 183 ms of which 2 ms to minimize.
[2024-06-01 14:49:55] [INFO ] Deduced a trap composed of 208 places in 141 ms of which 2 ms to minimize.
[2024-06-01 14:49:56] [INFO ] Deduced a trap composed of 152 places in 191 ms of which 3 ms to minimize.
[2024-06-01 14:49:57] [INFO ] Deduced a trap composed of 232 places in 202 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:50:02] [INFO ] Deduced a trap composed of 54 places in 150 ms of which 2 ms to minimize.
[2024-06-01 14:50:02] [INFO ] Deduced a trap composed of 116 places in 177 ms of which 3 ms to minimize.
[2024-06-01 14:50:02] [INFO ] Deduced a trap composed of 116 places in 178 ms of which 3 ms to minimize.
[2024-06-01 14:50:03] [INFO ] Deduced a trap composed of 211 places in 158 ms of which 2 ms to minimize.
[2024-06-01 14:50:03] [INFO ] Deduced a trap composed of 231 places in 167 ms of which 3 ms to minimize.
[2024-06-01 14:50:03] [INFO ] Deduced a trap composed of 219 places in 163 ms of which 2 ms to minimize.
[2024-06-01 14:50:03] [INFO ] Deduced a trap composed of 234 places in 160 ms of which 2 ms to minimize.
[2024-06-01 14:50:03] [INFO ] Deduced a trap composed of 212 places in 182 ms of which 2 ms to minimize.
SMT process timed out in 20846ms, After SMT, problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 20854ms
[2024-06-01 14:50:03] [INFO ] Flow matrix only has 796 transitions (discarded 16 similar events)
[2024-06-01 14:50:03] [INFO ] Invariant cache hit.
[2024-06-01 14:50:04] [INFO ] Implicit Places using invariants in 304 ms returned []
[2024-06-01 14:50:04] [INFO ] Flow matrix only has 796 transitions (discarded 16 similar events)
[2024-06-01 14:50:04] [INFO ] Invariant cache hit.
[2024-06-01 14:50:04] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:50:09] [INFO ] Implicit Places using invariants and state equation in 5119 ms returned []
Implicit Place search using SMT with State Equation took 5441 ms to find 0 implicit places.
[2024-06-01 14:50:09] [INFO ] Redundant transitions in 25 ms returned []
Running 810 sub problems to find dead transitions.
[2024-06-01 14:50:09] [INFO ] Flow matrix only has 796 transitions (discarded 16 similar events)
[2024-06-01 14:50:09] [INFO ] Invariant cache hit.
[2024-06-01 14:50:09] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:50:14] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 2 ms to minimize.
[2024-06-01 14:50:14] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:50:14] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 0 ms to minimize.
[2024-06-01 14:50:15] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 0 ms to minimize.
[2024-06-01 14:50:15] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:50:15] [INFO ] Deduced a trap composed of 42 places in 31 ms of which 0 ms to minimize.
[2024-06-01 14:50:15] [INFO ] Deduced a trap composed of 41 places in 28 ms of which 0 ms to minimize.
[2024-06-01 14:50:15] [INFO ] Deduced a trap composed of 63 places in 201 ms of which 3 ms to minimize.
[2024-06-01 14:50:15] [INFO ] Deduced a trap composed of 140 places in 185 ms of which 3 ms to minimize.
[2024-06-01 14:50:15] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 2 ms to minimize.
[2024-06-01 14:50:15] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:50:16] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 2 ms to minimize.
[2024-06-01 14:50:16] [INFO ] Deduced a trap composed of 269 places in 220 ms of which 3 ms to minimize.
[2024-06-01 14:50:16] [INFO ] Deduced a trap composed of 235 places in 200 ms of which 3 ms to minimize.
[2024-06-01 14:50:16] [INFO ] Deduced a trap composed of 210 places in 152 ms of which 2 ms to minimize.
[2024-06-01 14:50:17] [INFO ] Deduced a trap composed of 223 places in 205 ms of which 2 ms to minimize.
[2024-06-01 14:50:17] [INFO ] Deduced a trap composed of 216 places in 181 ms of which 3 ms to minimize.
[2024-06-01 14:50:17] [INFO ] Deduced a trap composed of 130 places in 190 ms of which 4 ms to minimize.
[2024-06-01 14:50:17] [INFO ] Deduced a trap composed of 238 places in 190 ms of which 3 ms to minimize.
[2024-06-01 14:50:17] [INFO ] Deduced a trap composed of 223 places in 151 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:50:18] [INFO ] Deduced a trap composed of 215 places in 210 ms of which 3 ms to minimize.
[2024-06-01 14:50:19] [INFO ] Deduced a trap composed of 229 places in 209 ms of which 3 ms to minimize.
[2024-06-01 14:50:19] [INFO ] Deduced a trap composed of 232 places in 265 ms of which 6 ms to minimize.
[2024-06-01 14:50:19] [INFO ] Deduced a trap composed of 239 places in 221 ms of which 3 ms to minimize.
[2024-06-01 14:50:19] [INFO ] Deduced a trap composed of 237 places in 169 ms of which 2 ms to minimize.
[2024-06-01 14:50:20] [INFO ] Deduced a trap composed of 241 places in 197 ms of which 3 ms to minimize.
[2024-06-01 14:50:20] [INFO ] Deduced a trap composed of 119 places in 192 ms of which 3 ms to minimize.
[2024-06-01 14:50:20] [INFO ] Deduced a trap composed of 222 places in 172 ms of which 2 ms to minimize.
[2024-06-01 14:50:20] [INFO ] Deduced a trap composed of 224 places in 171 ms of which 2 ms to minimize.
[2024-06-01 14:50:21] [INFO ] Deduced a trap composed of 227 places in 159 ms of which 2 ms to minimize.
[2024-06-01 14:50:21] [INFO ] Deduced a trap composed of 130 places in 152 ms of which 3 ms to minimize.
[2024-06-01 14:50:21] [INFO ] Deduced a trap composed of 130 places in 152 ms of which 3 ms to minimize.
[2024-06-01 14:50:21] [INFO ] Deduced a trap composed of 230 places in 150 ms of which 3 ms to minimize.
[2024-06-01 14:50:21] [INFO ] Deduced a trap composed of 205 places in 146 ms of which 2 ms to minimize.
[2024-06-01 14:50:21] [INFO ] Deduced a trap composed of 217 places in 178 ms of which 2 ms to minimize.
[2024-06-01 14:50:22] [INFO ] Deduced a trap composed of 231 places in 169 ms of which 2 ms to minimize.
[2024-06-01 14:50:22] [INFO ] Deduced a trap composed of 214 places in 163 ms of which 3 ms to minimize.
[2024-06-01 14:50:22] [INFO ] Deduced a trap composed of 208 places in 149 ms of which 2 ms to minimize.
[2024-06-01 14:50:23] [INFO ] Deduced a trap composed of 152 places in 149 ms of which 3 ms to minimize.
[2024-06-01 14:50:24] [INFO ] Deduced a trap composed of 232 places in 158 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:50:29] [INFO ] Deduced a trap composed of 54 places in 175 ms of which 2 ms to minimize.
[2024-06-01 14:50:30] [INFO ] Deduced a trap composed of 116 places in 215 ms of which 2 ms to minimize.
[2024-06-01 14:50:30] [INFO ] Deduced a trap composed of 116 places in 211 ms of which 3 ms to minimize.
[2024-06-01 14:50:30] [INFO ] Deduced a trap composed of 211 places in 215 ms of which 3 ms to minimize.
[2024-06-01 14:50:30] [INFO ] Deduced a trap composed of 231 places in 198 ms of which 2 ms to minimize.
[2024-06-01 14:50:31] [INFO ] Deduced a trap composed of 219 places in 160 ms of which 3 ms to minimize.
[2024-06-01 14:50:31] [INFO ] Deduced a trap composed of 234 places in 157 ms of which 2 ms to minimize.
[2024-06-01 14:50:31] [INFO ] Deduced a trap composed of 212 places in 153 ms of which 2 ms to minimize.
[2024-06-01 14:50:31] [INFO ] Deduced a trap composed of 223 places in 140 ms of which 3 ms to minimize.
[2024-06-01 14:50:32] [INFO ] Deduced a trap composed of 130 places in 225 ms of which 3 ms to minimize.
[2024-06-01 14:50:32] [INFO ] Deduced a trap composed of 223 places in 209 ms of which 3 ms to minimize.
[2024-06-01 14:50:33] [INFO ] Deduced a trap composed of 220 places in 233 ms of which 3 ms to minimize.
[2024-06-01 14:50:33] [INFO ] Deduced a trap composed of 236 places in 167 ms of which 3 ms to minimize.
[2024-06-01 14:50:33] [INFO ] Deduced a trap composed of 116 places in 185 ms of which 2 ms to minimize.
[2024-06-01 14:50:33] [INFO ] Deduced a trap composed of 218 places in 178 ms of which 2 ms to minimize.
[2024-06-01 14:50:34] [INFO ] Deduced a trap composed of 241 places in 136 ms of which 2 ms to minimize.
[2024-06-01 14:50:35] [INFO ] Deduced a trap composed of 228 places in 150 ms of which 2 ms to minimize.
[2024-06-01 14:50:35] [INFO ] Deduced a trap composed of 234 places in 207 ms of which 3 ms to minimize.
[2024-06-01 14:50:35] [INFO ] Deduced a trap composed of 232 places in 160 ms of which 2 ms to minimize.
[2024-06-01 14:50:36] [INFO ] Deduced a trap composed of 238 places in 130 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:50:37] [INFO ] Deduced a trap composed of 233 places in 135 ms of which 2 ms to minimize.
[2024-06-01 14:50:37] [INFO ] Deduced a trap composed of 238 places in 141 ms of which 2 ms to minimize.
[2024-06-01 14:50:40] [INFO ] Deduced a trap composed of 225 places in 138 ms of which 2 ms to minimize.
SMT process timed out in 31151ms, After SMT, problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 31168ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 57516 ms. Remains : 404/404 places, 812/812 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
[2024-06-01 14:50:40] [INFO ] Flow matrix only has 796 transitions (discarded 16 similar events)
[2024-06-01 14:50:40] [INFO ] Invariant cache hit.
[2024-06-01 14:50:41] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-06-01 14:50:41] [INFO ] [Real]Absence check using 12 positive and 28 generalized place invariants in 90 ms returned sat
[2024-06-01 14:50:41] [INFO ] [Real]Absence check using state equation in 594 ms returned sat
[2024-06-01 14:50:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:50:42] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-06-01 14:50:42] [INFO ] [Nat]Absence check using 12 positive and 28 generalized place invariants in 37 ms returned sat
[2024-06-01 14:50:43] [INFO ] [Nat]Absence check using state equation in 1221 ms returned sat
[2024-06-01 14:50:43] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:50:43] [INFO ] [Nat]Added 96 Read/Feed constraints in 64 ms returned sat
[2024-06-01 14:50:43] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 1 ms to minimize.
[2024-06-01 14:50:43] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 2 ms to minimize.
[2024-06-01 14:50:44] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 1 ms to minimize.
[2024-06-01 14:50:44] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:50:44] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:50:44] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:50:44] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 0 ms to minimize.
[2024-06-01 14:50:44] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1045 ms
[2024-06-01 14:50:44] [INFO ] Computed and/alt/rep : 378/1317/370 causal constraints (skipped 424 transitions) in 45 ms.
[2024-06-01 14:50:46] [INFO ] Added : 174 causal constraints over 36 iterations in 1926 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2495 reset in 316 ms.
Product exploration explored 100000 steps with 2508 reset in 319 ms.
Support contains 10 out of 404 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 404/404 places, 812/812 transitions.
Applied a total of 0 rules in 10 ms. Remains 404 /404 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Running 810 sub problems to find dead transitions.
[2024-06-01 14:50:47] [INFO ] Flow matrix only has 796 transitions (discarded 16 similar events)
[2024-06-01 14:50:47] [INFO ] Invariant cache hit.
[2024-06-01 14:50:47] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:50:52] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:50:52] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 0 ms to minimize.
[2024-06-01 14:50:52] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:50:52] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:50:52] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 0 ms to minimize.
[2024-06-01 14:50:52] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:50:53] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 0 ms to minimize.
[2024-06-01 14:50:53] [INFO ] Deduced a trap composed of 63 places in 162 ms of which 2 ms to minimize.
[2024-06-01 14:50:53] [INFO ] Deduced a trap composed of 140 places in 173 ms of which 2 ms to minimize.
[2024-06-01 14:50:53] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 1 ms to minimize.
[2024-06-01 14:50:53] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 0 ms to minimize.
[2024-06-01 14:50:53] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 2 ms to minimize.
[2024-06-01 14:50:54] [INFO ] Deduced a trap composed of 269 places in 184 ms of which 2 ms to minimize.
[2024-06-01 14:50:54] [INFO ] Deduced a trap composed of 235 places in 176 ms of which 2 ms to minimize.
[2024-06-01 14:50:54] [INFO ] Deduced a trap composed of 210 places in 164 ms of which 2 ms to minimize.
[2024-06-01 14:50:54] [INFO ] Deduced a trap composed of 223 places in 185 ms of which 2 ms to minimize.
[2024-06-01 14:50:55] [INFO ] Deduced a trap composed of 216 places in 156 ms of which 2 ms to minimize.
[2024-06-01 14:50:55] [INFO ] Deduced a trap composed of 130 places in 165 ms of which 2 ms to minimize.
[2024-06-01 14:50:55] [INFO ] Deduced a trap composed of 238 places in 164 ms of which 2 ms to minimize.
[2024-06-01 14:50:55] [INFO ] Deduced a trap composed of 223 places in 164 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:50:56] [INFO ] Deduced a trap composed of 215 places in 257 ms of which 2 ms to minimize.
[2024-06-01 14:50:56] [INFO ] Deduced a trap composed of 229 places in 157 ms of which 2 ms to minimize.
[2024-06-01 14:50:56] [INFO ] Deduced a trap composed of 232 places in 153 ms of which 2 ms to minimize.
[2024-06-01 14:50:57] [INFO ] Deduced a trap composed of 239 places in 184 ms of which 2 ms to minimize.
[2024-06-01 14:50:57] [INFO ] Deduced a trap composed of 237 places in 151 ms of which 2 ms to minimize.
[2024-06-01 14:50:57] [INFO ] Deduced a trap composed of 241 places in 150 ms of which 2 ms to minimize.
[2024-06-01 14:50:57] [INFO ] Deduced a trap composed of 119 places in 163 ms of which 2 ms to minimize.
[2024-06-01 14:50:57] [INFO ] Deduced a trap composed of 222 places in 141 ms of which 2 ms to minimize.
[2024-06-01 14:50:58] [INFO ] Deduced a trap composed of 224 places in 170 ms of which 3 ms to minimize.
[2024-06-01 14:50:58] [INFO ] Deduced a trap composed of 227 places in 171 ms of which 2 ms to minimize.
[2024-06-01 14:50:58] [INFO ] Deduced a trap composed of 130 places in 169 ms of which 2 ms to minimize.
[2024-06-01 14:50:58] [INFO ] Deduced a trap composed of 130 places in 166 ms of which 2 ms to minimize.
[2024-06-01 14:50:58] [INFO ] Deduced a trap composed of 230 places in 173 ms of which 2 ms to minimize.
[2024-06-01 14:50:59] [INFO ] Deduced a trap composed of 205 places in 175 ms of which 2 ms to minimize.
[2024-06-01 14:50:59] [INFO ] Deduced a trap composed of 217 places in 163 ms of which 2 ms to minimize.
[2024-06-01 14:50:59] [INFO ] Deduced a trap composed of 231 places in 166 ms of which 2 ms to minimize.
[2024-06-01 14:50:59] [INFO ] Deduced a trap composed of 214 places in 159 ms of which 2 ms to minimize.
[2024-06-01 14:51:00] [INFO ] Deduced a trap composed of 208 places in 179 ms of which 2 ms to minimize.
[2024-06-01 14:51:00] [INFO ] Deduced a trap composed of 152 places in 167 ms of which 2 ms to minimize.
[2024-06-01 14:51:01] [INFO ] Deduced a trap composed of 232 places in 136 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:51:06] [INFO ] Deduced a trap composed of 54 places in 198 ms of which 3 ms to minimize.
[2024-06-01 14:51:06] [INFO ] Deduced a trap composed of 116 places in 148 ms of which 2 ms to minimize.
[2024-06-01 14:51:07] [INFO ] Deduced a trap composed of 116 places in 172 ms of which 2 ms to minimize.
[2024-06-01 14:51:07] [INFO ] Deduced a trap composed of 211 places in 142 ms of which 2 ms to minimize.
[2024-06-01 14:51:07] [INFO ] Deduced a trap composed of 231 places in 162 ms of which 2 ms to minimize.
[2024-06-01 14:51:07] [INFO ] Deduced a trap composed of 219 places in 172 ms of which 3 ms to minimize.
[2024-06-01 14:51:08] [INFO ] Deduced a trap composed of 234 places in 169 ms of which 3 ms to minimize.
[2024-06-01 14:51:08] [INFO ] Deduced a trap composed of 212 places in 156 ms of which 2 ms to minimize.
[2024-06-01 14:51:08] [INFO ] Deduced a trap composed of 223 places in 152 ms of which 2 ms to minimize.
SMT process timed out in 21097ms, After SMT, problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 21103ms
[2024-06-01 14:51:08] [INFO ] Flow matrix only has 796 transitions (discarded 16 similar events)
[2024-06-01 14:51:08] [INFO ] Invariant cache hit.
[2024-06-01 14:51:08] [INFO ] Implicit Places using invariants in 432 ms returned []
[2024-06-01 14:51:08] [INFO ] Flow matrix only has 796 transitions (discarded 16 similar events)
[2024-06-01 14:51:08] [INFO ] Invariant cache hit.
[2024-06-01 14:51:09] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:51:13] [INFO ] Implicit Places using invariants and state equation in 4648 ms returned []
Implicit Place search using SMT with State Equation took 5096 ms to find 0 implicit places.
[2024-06-01 14:51:13] [INFO ] Redundant transitions in 20 ms returned []
Running 810 sub problems to find dead transitions.
[2024-06-01 14:51:13] [INFO ] Flow matrix only has 796 transitions (discarded 16 similar events)
[2024-06-01 14:51:13] [INFO ] Invariant cache hit.
[2024-06-01 14:51:13] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:51:18] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:51:18] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 0 ms to minimize.
[2024-06-01 14:51:18] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:51:18] [INFO ] Deduced a trap composed of 41 places in 34 ms of which 1 ms to minimize.
[2024-06-01 14:51:18] [INFO ] Deduced a trap composed of 42 places in 31 ms of which 0 ms to minimize.
[2024-06-01 14:51:18] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:51:18] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:51:19] [INFO ] Deduced a trap composed of 63 places in 156 ms of which 2 ms to minimize.
[2024-06-01 14:51:19] [INFO ] Deduced a trap composed of 140 places in 220 ms of which 3 ms to minimize.
[2024-06-01 14:51:19] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 2 ms to minimize.
[2024-06-01 14:51:19] [INFO ] Deduced a trap composed of 41 places in 29 ms of which 1 ms to minimize.
[2024-06-01 14:51:19] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 1 ms to minimize.
[2024-06-01 14:51:20] [INFO ] Deduced a trap composed of 269 places in 200 ms of which 3 ms to minimize.
[2024-06-01 14:51:20] [INFO ] Deduced a trap composed of 235 places in 177 ms of which 3 ms to minimize.
[2024-06-01 14:51:20] [INFO ] Deduced a trap composed of 210 places in 182 ms of which 2 ms to minimize.
[2024-06-01 14:51:20] [INFO ] Deduced a trap composed of 223 places in 207 ms of which 2 ms to minimize.
[2024-06-01 14:51:21] [INFO ] Deduced a trap composed of 216 places in 155 ms of which 2 ms to minimize.
[2024-06-01 14:51:21] [INFO ] Deduced a trap composed of 130 places in 166 ms of which 3 ms to minimize.
[2024-06-01 14:51:21] [INFO ] Deduced a trap composed of 238 places in 160 ms of which 2 ms to minimize.
[2024-06-01 14:51:21] [INFO ] Deduced a trap composed of 223 places in 145 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:51:22] [INFO ] Deduced a trap composed of 215 places in 227 ms of which 3 ms to minimize.
[2024-06-01 14:51:22] [INFO ] Deduced a trap composed of 229 places in 146 ms of which 2 ms to minimize.
[2024-06-01 14:51:22] [INFO ] Deduced a trap composed of 232 places in 155 ms of which 3 ms to minimize.
[2024-06-01 14:51:23] [INFO ] Deduced a trap composed of 239 places in 217 ms of which 3 ms to minimize.
[2024-06-01 14:51:23] [INFO ] Deduced a trap composed of 237 places in 184 ms of which 3 ms to minimize.
[2024-06-01 14:51:23] [INFO ] Deduced a trap composed of 241 places in 213 ms of which 2 ms to minimize.
[2024-06-01 14:51:23] [INFO ] Deduced a trap composed of 119 places in 160 ms of which 2 ms to minimize.
[2024-06-01 14:51:23] [INFO ] Deduced a trap composed of 222 places in 143 ms of which 2 ms to minimize.
[2024-06-01 14:51:24] [INFO ] Deduced a trap composed of 224 places in 188 ms of which 3 ms to minimize.
[2024-06-01 14:51:24] [INFO ] Deduced a trap composed of 227 places in 222 ms of which 3 ms to minimize.
[2024-06-01 14:51:24] [INFO ] Deduced a trap composed of 130 places in 153 ms of which 2 ms to minimize.
[2024-06-01 14:51:24] [INFO ] Deduced a trap composed of 130 places in 150 ms of which 2 ms to minimize.
[2024-06-01 14:51:24] [INFO ] Deduced a trap composed of 230 places in 147 ms of which 2 ms to minimize.
[2024-06-01 14:51:25] [INFO ] Deduced a trap composed of 205 places in 211 ms of which 3 ms to minimize.
[2024-06-01 14:51:25] [INFO ] Deduced a trap composed of 217 places in 183 ms of which 3 ms to minimize.
[2024-06-01 14:51:25] [INFO ] Deduced a trap composed of 231 places in 144 ms of which 2 ms to minimize.
[2024-06-01 14:51:25] [INFO ] Deduced a trap composed of 214 places in 234 ms of which 3 ms to minimize.
[2024-06-01 14:51:26] [INFO ] Deduced a trap composed of 208 places in 184 ms of which 3 ms to minimize.
[2024-06-01 14:51:26] [INFO ] Deduced a trap composed of 152 places in 135 ms of which 2 ms to minimize.
[2024-06-01 14:51:27] [INFO ] Deduced a trap composed of 232 places in 194 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:51:32] [INFO ] Deduced a trap composed of 54 places in 227 ms of which 3 ms to minimize.
[2024-06-01 14:51:33] [INFO ] Deduced a trap composed of 116 places in 140 ms of which 2 ms to minimize.
[2024-06-01 14:51:33] [INFO ] Deduced a trap composed of 116 places in 136 ms of which 3 ms to minimize.
[2024-06-01 14:51:33] [INFO ] Deduced a trap composed of 211 places in 210 ms of which 3 ms to minimize.
[2024-06-01 14:51:33] [INFO ] Deduced a trap composed of 231 places in 150 ms of which 2 ms to minimize.
[2024-06-01 14:51:34] [INFO ] Deduced a trap composed of 219 places in 138 ms of which 2 ms to minimize.
[2024-06-01 14:51:34] [INFO ] Deduced a trap composed of 234 places in 209 ms of which 3 ms to minimize.
[2024-06-01 14:51:34] [INFO ] Deduced a trap composed of 212 places in 151 ms of which 2 ms to minimize.
[2024-06-01 14:51:34] [INFO ] Deduced a trap composed of 223 places in 160 ms of which 2 ms to minimize.
[2024-06-01 14:51:35] [INFO ] Deduced a trap composed of 130 places in 218 ms of which 3 ms to minimize.
[2024-06-01 14:51:35] [INFO ] Deduced a trap composed of 223 places in 139 ms of which 2 ms to minimize.
[2024-06-01 14:51:35] [INFO ] Deduced a trap composed of 220 places in 136 ms of which 3 ms to minimize.
[2024-06-01 14:51:35] [INFO ] Deduced a trap composed of 236 places in 150 ms of which 2 ms to minimize.
[2024-06-01 14:51:36] [INFO ] Deduced a trap composed of 116 places in 141 ms of which 3 ms to minimize.
[2024-06-01 14:51:36] [INFO ] Deduced a trap composed of 218 places in 140 ms of which 2 ms to minimize.
[2024-06-01 14:51:37] [INFO ] Deduced a trap composed of 241 places in 145 ms of which 2 ms to minimize.
[2024-06-01 14:51:37] [INFO ] Deduced a trap composed of 228 places in 186 ms of which 3 ms to minimize.
[2024-06-01 14:51:37] [INFO ] Deduced a trap composed of 234 places in 187 ms of which 3 ms to minimize.
[2024-06-01 14:51:37] [INFO ] Deduced a trap composed of 232 places in 177 ms of which 2 ms to minimize.
[2024-06-01 14:51:39] [INFO ] Deduced a trap composed of 238 places in 218 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:51:40] [INFO ] Deduced a trap composed of 233 places in 207 ms of which 3 ms to minimize.
[2024-06-01 14:51:40] [INFO ] Deduced a trap composed of 238 places in 187 ms of which 3 ms to minimize.
[2024-06-01 14:51:43] [INFO ] Deduced a trap composed of 225 places in 228 ms of which 3 ms to minimize.
[2024-06-01 14:51:43] [INFO ] Deduced a trap composed of 232 places in 184 ms of which 3 ms to minimize.
[2024-06-01 14:51:43] [INFO ] Deduced a trap composed of 244 places in 181 ms of which 3 ms to minimize.
[2024-06-01 14:51:43] [INFO ] Deduced a trap composed of 240 places in 178 ms of which 2 ms to minimize.
[2024-06-01 14:51:43] [INFO ] Deduced a trap composed of 236 places in 152 ms of which 3 ms to minimize.
[2024-06-01 14:51:43] [INFO ] Deduced a trap composed of 237 places in 164 ms of which 2 ms to minimize.
[2024-06-01 14:51:44] [INFO ] Deduced a trap composed of 236 places in 136 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 402/1200 variables, and 100 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 20/28 constraints, State Equation: 0/404 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 69/69 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 69/100 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:51:48] [INFO ] Deduced a trap composed of 2 places in 225 ms of which 3 ms to minimize.
[2024-06-01 14:51:49] [INFO ] Deduced a trap composed of 3 places in 185 ms of which 3 ms to minimize.
[2024-06-01 14:51:49] [INFO ] Deduced a trap composed of 194 places in 198 ms of which 3 ms to minimize.
[2024-06-01 14:51:49] [INFO ] Deduced a trap composed of 221 places in 186 ms of which 3 ms to minimize.
[2024-06-01 14:51:49] [INFO ] Deduced a trap composed of 198 places in 160 ms of which 2 ms to minimize.
[2024-06-01 14:51:49] [INFO ] Deduced a trap composed of 3 places in 160 ms of which 3 ms to minimize.
[2024-06-01 14:51:50] [INFO ] Deduced a trap composed of 212 places in 153 ms of which 2 ms to minimize.
[2024-06-01 14:51:50] [INFO ] Deduced a trap composed of 3 places in 190 ms of which 2 ms to minimize.
[2024-06-01 14:51:50] [INFO ] Deduced a trap composed of 28 places in 172 ms of which 2 ms to minimize.
[2024-06-01 14:51:50] [INFO ] Deduced a trap composed of 195 places in 171 ms of which 3 ms to minimize.
[2024-06-01 14:51:51] [INFO ] Deduced a trap composed of 176 places in 191 ms of which 2 ms to minimize.
[2024-06-01 14:51:51] [INFO ] Deduced a trap composed of 226 places in 174 ms of which 3 ms to minimize.
[2024-06-01 14:51:51] [INFO ] Deduced a trap composed of 224 places in 172 ms of which 2 ms to minimize.
[2024-06-01 14:51:51] [INFO ] Deduced a trap composed of 235 places in 165 ms of which 2 ms to minimize.
[2024-06-01 14:51:52] [INFO ] Deduced a trap composed of 208 places in 174 ms of which 2 ms to minimize.
[2024-06-01 14:51:52] [INFO ] Deduced a trap composed of 217 places in 158 ms of which 2 ms to minimize.
[2024-06-01 14:51:52] [INFO ] Deduced a trap composed of 216 places in 169 ms of which 3 ms to minimize.
[2024-06-01 14:51:52] [INFO ] Deduced a trap composed of 211 places in 197 ms of which 3 ms to minimize.
[2024-06-01 14:51:52] [INFO ] Deduced a trap composed of 224 places in 141 ms of which 2 ms to minimize.
[2024-06-01 14:51:52] [INFO ] Deduced a trap composed of 250 places in 143 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:51:56] [INFO ] Deduced a trap composed of 182 places in 256 ms of which 3 ms to minimize.
[2024-06-01 14:51:56] [INFO ] Deduced a trap composed of 205 places in 208 ms of which 3 ms to minimize.
[2024-06-01 14:51:56] [INFO ] Deduced a trap composed of 218 places in 194 ms of which 2 ms to minimize.
[2024-06-01 14:51:56] [INFO ] Deduced a trap composed of 209 places in 173 ms of which 2 ms to minimize.
[2024-06-01 14:51:57] [INFO ] Deduced a trap composed of 184 places in 182 ms of which 2 ms to minimize.
[2024-06-01 14:51:57] [INFO ] Deduced a trap composed of 195 places in 165 ms of which 2 ms to minimize.
[2024-06-01 14:51:57] [INFO ] Deduced a trap composed of 165 places in 158 ms of which 2 ms to minimize.
[2024-06-01 14:51:57] [INFO ] Deduced a trap composed of 219 places in 131 ms of which 2 ms to minimize.
[2024-06-01 14:51:57] [INFO ] Deduced a trap composed of 217 places in 147 ms of which 2 ms to minimize.
[2024-06-01 14:51:58] [INFO ] Deduced a trap composed of 168 places in 154 ms of which 2 ms to minimize.
[2024-06-01 14:51:58] [INFO ] Deduced a trap composed of 199 places in 166 ms of which 2 ms to minimize.
[2024-06-01 14:51:58] [INFO ] Deduced a trap composed of 211 places in 148 ms of which 2 ms to minimize.
[2024-06-01 14:51:58] [INFO ] Deduced a trap composed of 253 places in 163 ms of which 2 ms to minimize.
[2024-06-01 14:51:59] [INFO ] Deduced a trap composed of 211 places in 136 ms of which 2 ms to minimize.
[2024-06-01 14:51:59] [INFO ] Deduced a trap composed of 197 places in 157 ms of which 2 ms to minimize.
[2024-06-01 14:52:00] [INFO ] Deduced a trap composed of 218 places in 159 ms of which 2 ms to minimize.
[2024-06-01 14:52:00] [INFO ] Deduced a trap composed of 181 places in 139 ms of which 2 ms to minimize.
[2024-06-01 14:52:00] [INFO ] Deduced a trap composed of 214 places in 137 ms of which 2 ms to minimize.
[2024-06-01 14:52:00] [INFO ] Deduced a trap composed of 235 places in 153 ms of which 2 ms to minimize.
[2024-06-01 14:52:01] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 14:52:04] [INFO ] Deduced a trap composed of 240 places in 157 ms of which 2 ms to minimize.
[2024-06-01 14:52:11] [INFO ] Deduced a trap composed of 169 places in 165 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 402/1200 variables, and 142 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 20/28 constraints, State Equation: 0/404 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 111/111 constraints]
After SMT, in 61024ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 61032ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 87277 ms. Remains : 404/404 places, 812/812 transitions.
Treatment of property PolyORBLF-PT-S02J04T08-LTLFireability-05 finished in 240793 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(!p0) U X(p1))&&G(p2))))'
Support contains 67 out of 592 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 592/592 places, 1102/1102 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 590 transition count 1100
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 590 transition count 1100
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 588 transition count 1098
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 588 transition count 1098
Applied a total of 8 rules in 15 ms. Remains 588 /592 variables (removed 4) and now considering 1098/1102 (removed 4) transitions.
Running 1096 sub problems to find dead transitions.
[2024-06-01 14:52:14] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 588 cols
[2024-06-01 14:52:14] [INFO ] Computed 40 invariants in 11 ms
[2024-06-01 14:52:14] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 14:52:24] [INFO ] Deduced a trap composed of 19 places in 170 ms of which 3 ms to minimize.
[2024-06-01 14:52:24] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
[2024-06-01 14:52:25] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:52:25] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:52:25] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 2 ms to minimize.
[2024-06-01 14:52:25] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:52:25] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:52:25] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:52:25] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 0 ms to minimize.
[2024-06-01 14:52:26] [INFO ] Deduced a trap composed of 114 places in 221 ms of which 3 ms to minimize.
[2024-06-01 14:52:26] [INFO ] Deduced a trap composed of 162 places in 265 ms of which 4 ms to minimize.
[2024-06-01 14:52:26] [INFO ] Deduced a trap composed of 406 places in 234 ms of which 3 ms to minimize.
[2024-06-01 14:52:27] [INFO ] Deduced a trap composed of 79 places in 134 ms of which 2 ms to minimize.
[2024-06-01 14:52:27] [INFO ] Deduced a trap composed of 300 places in 259 ms of which 3 ms to minimize.
[2024-06-01 14:52:29] [INFO ] Deduced a trap composed of 294 places in 330 ms of which 4 ms to minimize.
[2024-06-01 14:52:30] [INFO ] Deduced a trap composed of 299 places in 315 ms of which 4 ms to minimize.
[2024-06-01 14:52:30] [INFO ] Deduced a trap composed of 269 places in 286 ms of which 3 ms to minimize.
[2024-06-01 14:52:32] [INFO ] Deduced a trap composed of 323 places in 312 ms of which 4 ms to minimize.
[2024-06-01 14:52:32] [INFO ] Deduced a trap composed of 339 places in 256 ms of which 3 ms to minimize.
[2024-06-01 14:52:32] [INFO ] Deduced a trap composed of 305 places in 234 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 58 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 14:52:55] [INFO ] Deduced a trap composed of 337 places in 324 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 59 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 21/21 constraints]
After SMT, in 41282ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41292ms
[2024-06-01 14:52:55] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 14:52:55] [INFO ] Invariant cache hit.
[2024-06-01 14:52:56] [INFO ] Implicit Places using invariants in 575 ms returned []
[2024-06-01 14:52:56] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 14:52:56] [INFO ] Invariant cache hit.
[2024-06-01 14:52:57] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:53:05] [INFO ] Implicit Places using invariants and state equation in 8952 ms returned []
Implicit Place search using SMT with State Equation took 9542 ms to find 0 implicit places.
Running 1096 sub problems to find dead transitions.
[2024-06-01 14:53:05] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 14:53:05] [INFO ] Invariant cache hit.
[2024-06-01 14:53:05] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 14:53:15] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 3 ms to minimize.
[2024-06-01 14:53:15] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 1 ms to minimize.
[2024-06-01 14:53:15] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:53:16] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:53:16] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:53:16] [INFO ] Deduced a trap composed of 64 places in 33 ms of which 1 ms to minimize.
[2024-06-01 14:53:16] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:53:16] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:53:16] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:53:17] [INFO ] Deduced a trap composed of 162 places in 206 ms of which 2 ms to minimize.
[2024-06-01 14:53:17] [INFO ] Deduced a trap composed of 396 places in 243 ms of which 3 ms to minimize.
[2024-06-01 14:53:17] [INFO ] Deduced a trap composed of 394 places in 214 ms of which 3 ms to minimize.
[2024-06-01 14:53:18] [INFO ] Deduced a trap composed of 79 places in 143 ms of which 2 ms to minimize.
[2024-06-01 14:53:18] [INFO ] Deduced a trap composed of 326 places in 209 ms of which 3 ms to minimize.
[2024-06-01 14:53:18] [INFO ] Deduced a trap composed of 269 places in 230 ms of which 3 ms to minimize.
[2024-06-01 14:53:19] [INFO ] Deduced a trap composed of 269 places in 224 ms of which 3 ms to minimize.
[2024-06-01 14:53:21] [INFO ] Deduced a trap composed of 3 places in 276 ms of which 3 ms to minimize.
[2024-06-01 14:53:21] [INFO ] Deduced a trap composed of 302 places in 211 ms of which 2 ms to minimize.
[2024-06-01 14:53:22] [INFO ] Deduced a trap composed of 294 places in 221 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 19/57 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 14:53:34] [INFO ] Deduced a trap composed of 54 places in 237 ms of which 3 ms to minimize.
[2024-06-01 14:53:36] [INFO ] Deduced a trap composed of 123 places in 197 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 59 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 21/59 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 14:53:54] [INFO ] Deduced a trap composed of 337 places in 220 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 22/22 constraints]
After SMT, in 61255ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 61264ms
Starting structural reductions in LTL mode, iteration 1 : 588/592 places, 1098/1102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112117 ms. Remains : 588/592 places, 1098/1102 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true, (NOT p2), (NOT p1), (AND p0 (NOT p1)), p0]
Running random walk in product with property : PolyORBLF-PT-S02J04T08-LTLFireability-07
Entered a terminal (fully accepting) state of product in 23 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T08-LTLFireability-07 finished in 112355 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(G(p1)))))'
Support contains 3 out of 592 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 592/592 places, 1102/1102 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 590 transition count 1100
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 590 transition count 1100
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 588 transition count 1098
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 588 transition count 1098
Applied a total of 8 rules in 16 ms. Remains 588 /592 variables (removed 4) and now considering 1098/1102 (removed 4) transitions.
Running 1096 sub problems to find dead transitions.
[2024-06-01 14:54:06] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 14:54:06] [INFO ] Invariant cache hit.
[2024-06-01 14:54:06] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 14:54:17] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 3 ms to minimize.
[2024-06-01 14:54:17] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 1 ms to minimize.
[2024-06-01 14:54:17] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
[2024-06-01 14:54:17] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
[2024-06-01 14:54:17] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:54:17] [INFO ] Deduced a trap composed of 64 places in 34 ms of which 1 ms to minimize.
[2024-06-01 14:54:18] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:54:18] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:54:18] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:54:18] [INFO ] Deduced a trap composed of 162 places in 243 ms of which 3 ms to minimize.
[2024-06-01 14:54:19] [INFO ] Deduced a trap composed of 396 places in 214 ms of which 3 ms to minimize.
[2024-06-01 14:54:19] [INFO ] Deduced a trap composed of 394 places in 228 ms of which 3 ms to minimize.
[2024-06-01 14:54:19] [INFO ] Deduced a trap composed of 79 places in 130 ms of which 2 ms to minimize.
[2024-06-01 14:54:20] [INFO ] Deduced a trap composed of 326 places in 231 ms of which 3 ms to minimize.
[2024-06-01 14:54:20] [INFO ] Deduced a trap composed of 269 places in 244 ms of which 3 ms to minimize.
[2024-06-01 14:54:21] [INFO ] Deduced a trap composed of 269 places in 256 ms of which 3 ms to minimize.
[2024-06-01 14:54:23] [INFO ] Deduced a trap composed of 3 places in 220 ms of which 3 ms to minimize.
[2024-06-01 14:54:23] [INFO ] Deduced a trap composed of 302 places in 230 ms of which 3 ms to minimize.
[2024-06-01 14:54:24] [INFO ] Deduced a trap composed of 294 places in 228 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 57 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 19/57 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 14:54:48] [INFO ] Deduced a trap composed of 375 places in 235 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 58 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 20/20 constraints]
After SMT, in 41234ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41244ms
[2024-06-01 14:54:48] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 14:54:48] [INFO ] Invariant cache hit.
[2024-06-01 14:54:48] [INFO ] Implicit Places using invariants in 456 ms returned []
[2024-06-01 14:54:48] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 14:54:48] [INFO ] Invariant cache hit.
[2024-06-01 14:54:49] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:54:55] [INFO ] Implicit Places using invariants and state equation in 6851 ms returned []
Implicit Place search using SMT with State Equation took 7309 ms to find 0 implicit places.
Running 1096 sub problems to find dead transitions.
[2024-06-01 14:54:55] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-06-01 14:54:55] [INFO ] Invariant cache hit.
[2024-06-01 14:54:55] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 14:55:06] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 2 ms to minimize.
[2024-06-01 14:55:06] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2024-06-01 14:55:06] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:55:06] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:55:06] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 2 ms to minimize.
[2024-06-01 14:55:06] [INFO ] Deduced a trap composed of 64 places in 43 ms of which 0 ms to minimize.
[2024-06-01 14:55:06] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:55:07] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 2 ms to minimize.
[2024-06-01 14:55:07] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:55:07] [INFO ] Deduced a trap composed of 162 places in 240 ms of which 4 ms to minimize.
[2024-06-01 14:55:08] [INFO ] Deduced a trap composed of 396 places in 305 ms of which 3 ms to minimize.
[2024-06-01 14:55:08] [INFO ] Deduced a trap composed of 394 places in 321 ms of which 4 ms to minimize.
[2024-06-01 14:55:09] [INFO ] Deduced a trap composed of 79 places in 101 ms of which 2 ms to minimize.
[2024-06-01 14:55:09] [INFO ] Deduced a trap composed of 326 places in 205 ms of which 3 ms to minimize.
[2024-06-01 14:55:09] [INFO ] Deduced a trap composed of 269 places in 217 ms of which 3 ms to minimize.
[2024-06-01 14:55:10] [INFO ] Deduced a trap composed of 269 places in 193 ms of which 3 ms to minimize.
[2024-06-01 14:55:12] [INFO ] Deduced a trap composed of 3 places in 192 ms of which 3 ms to minimize.
[2024-06-01 14:55:12] [INFO ] Deduced a trap composed of 302 places in 323 ms of which 5 ms to minimize.
[2024-06-01 14:55:13] [INFO ] Deduced a trap composed of 294 places in 226 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 19/57 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 14:55:26] [INFO ] Deduced a trap composed of 54 places in 320 ms of which 5 ms to minimize.
SMT process timed out in 31143ms, After SMT, problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 31153ms
Starting structural reductions in LTL mode, iteration 1 : 588/592 places, 1098/1102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 79728 ms. Remains : 588/592 places, 1098/1102 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S02J04T08-LTLFireability-09
Stuttering criterion allowed to conclude after 8902 steps with 5 reset in 29 ms.
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T08-LTLFireability-09 finished in 79905 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' '!((!p0 U (G(!p0)||(!p0&&(G(!p1)||X(p2))))))'
Support contains 8 out of 592 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 592/592 places, 1102/1102 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 591 transition count 1101
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 591 transition count 1101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 590 transition count 1100
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 590 transition count 1100
Applied a total of 4 rules in 16 ms. Remains 590 /592 variables (removed 2) and now considering 1100/1102 (removed 2) transitions.
Running 1098 sub problems to find dead transitions.
[2024-06-01 14:55:26] [INFO ] Flow matrix only has 1084 transitions (discarded 16 similar events)
// Phase 1: matrix 1084 rows 590 cols
[2024-06-01 14:55:26] [INFO ] Computed 40 invariants in 14 ms
[2024-06-01 14:55:26] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/588 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/588 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-06-01 14:55:36] [INFO ] Deduced a trap composed of 19 places in 167 ms of which 3 ms to minimize.
[2024-06-01 14:55:36] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 2 ms to minimize.
[2024-06-01 14:55:36] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:55:36] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:55:36] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:55:36] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:55:36] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:55:36] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:55:37] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 2 ms to minimize.
[2024-06-01 14:55:37] [INFO ] Deduced a trap composed of 170 places in 273 ms of which 4 ms to minimize.
[2024-06-01 14:55:38] [INFO ] Deduced a trap composed of 396 places in 329 ms of which 4 ms to minimize.
[2024-06-01 14:55:38] [INFO ] Deduced a trap composed of 339 places in 300 ms of which 5 ms to minimize.
[2024-06-01 14:55:38] [INFO ] Deduced a trap composed of 321 places in 192 ms of which 3 ms to minimize.
[2024-06-01 14:55:39] [INFO ] Deduced a trap composed of 326 places in 206 ms of which 3 ms to minimize.
[2024-06-01 14:55:39] [INFO ] Deduced a trap composed of 173 places in 295 ms of which 4 ms to minimize.
[2024-06-01 14:55:40] [INFO ] Deduced a trap composed of 63 places in 113 ms of which 2 ms to minimize.
[2024-06-01 14:55:42] [INFO ] Deduced a trap composed of 291 places in 192 ms of which 3 ms to minimize.
[2024-06-01 14:55:42] [INFO ] Deduced a trap composed of 289 places in 280 ms of which 4 ms to minimize.
[2024-06-01 14:55:42] [INFO ] Deduced a trap composed of 54 places in 211 ms of which 3 ms to minimize.
[2024-06-01 14:55:43] [INFO ] Deduced a trap composed of 296 places in 205 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/588 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-06-01 14:55:44] [INFO ] Deduced a trap composed of 295 places in 195 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 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 588/1674 variables, and 58 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/590 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1098/1098 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1098 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/588 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/588 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/588 variables, 21/58 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-06-01 14:56:04] [INFO ] Deduced a trap composed of 339 places in 214 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 588/1674 variables, and 59 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/590 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1098 constraints, Known Traps: 22/22 constraints]
After SMT, in 40997ms problems are : Problem set: 0 solved, 1098 unsolved
Search for dead transitions found 0 dead transitions in 41006ms
[2024-06-01 14:56:07] [INFO ] Flow matrix only has 1084 transitions (discarded 16 similar events)
[2024-06-01 14:56:07] [INFO ] Invariant cache hit.
[2024-06-01 14:56:08] [INFO ] Implicit Places using invariants in 451 ms returned []
[2024-06-01 14:56:08] [INFO ] Flow matrix only has 1084 transitions (discarded 16 similar events)
[2024-06-01 14:56:08] [INFO ] Invariant cache hit.
[2024-06-01 14:56:08] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:56:17] [INFO ] Implicit Places using invariants and state equation in 9371 ms returned []
Implicit Place search using SMT with State Equation took 9837 ms to find 0 implicit places.
Running 1098 sub problems to find dead transitions.
[2024-06-01 14:56:17] [INFO ] Flow matrix only has 1084 transitions (discarded 16 similar events)
[2024-06-01 14:56:17] [INFO ] Invariant cache hit.
[2024-06-01 14:56:17] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/588 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/588 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-06-01 14:56:27] [INFO ] Deduced a trap composed of 64 places in 116 ms of which 2 ms to minimize.
[2024-06-01 14:56:27] [INFO ] Deduced a trap composed of 64 places in 170 ms of which 2 ms to minimize.
[2024-06-01 14:56:27] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 2 ms to minimize.
[2024-06-01 14:56:27] [INFO ] Deduced a trap composed of 64 places in 34 ms of which 0 ms to minimize.
[2024-06-01 14:56:27] [INFO ] Deduced a trap composed of 64 places in 33 ms of which 0 ms to minimize.
[2024-06-01 14:56:28] [INFO ] Deduced a trap composed of 64 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:56:28] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:56:28] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:56:28] [INFO ] Deduced a trap composed of 66 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:56:28] [INFO ] Deduced a trap composed of 184 places in 179 ms of which 3 ms to minimize.
[2024-06-01 14:56:29] [INFO ] Deduced a trap composed of 396 places in 189 ms of which 2 ms to minimize.
[2024-06-01 14:56:29] [INFO ] Deduced a trap composed of 395 places in 248 ms of which 3 ms to minimize.
[2024-06-01 14:56:29] [INFO ] Deduced a trap composed of 47 places in 126 ms of which 2 ms to minimize.
[2024-06-01 14:56:30] [INFO ] Deduced a trap composed of 326 places in 250 ms of which 4 ms to minimize.
[2024-06-01 14:56:30] [INFO ] Deduced a trap composed of 277 places in 242 ms of which 3 ms to minimize.
[2024-06-01 14:56:31] [INFO ] Deduced a trap composed of 296 places in 239 ms of which 3 ms to minimize.
[2024-06-01 14:56:31] [INFO ] Deduced a trap composed of 276 places in 225 ms of which 4 ms to minimize.
[2024-06-01 14:56:31] [INFO ] Deduced a trap composed of 3 places in 234 ms of which 3 ms to minimize.
[2024-06-01 14:56:33] [INFO ] Deduced a trap composed of 167 places in 243 ms of which 3 ms to minimize.
[2024-06-01 14:56:34] [INFO ] Deduced a trap composed of 356 places in 237 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/588 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-06-01 14:56:37] [INFO ] Deduced a trap composed of 331 places in 242 ms of which 3 ms to minimize.
[2024-06-01 14:56:37] [INFO ] Deduced a trap composed of 320 places in 244 ms of which 4 ms to minimize.
[2024-06-01 14:56:37] [INFO ] Deduced a trap composed of 348 places in 248 ms of which 3 ms to minimize.
[2024-06-01 14:56:38] [INFO ] Deduced a trap composed of 308 places in 247 ms of which 3 ms to minimize.
[2024-06-01 14:56:40] [INFO ] Deduced a trap composed of 54 places in 243 ms of which 4 ms to minimize.
[2024-06-01 14:56:40] [INFO ] Deduced a trap composed of 309 places in 264 ms of which 3 ms to minimize.
[2024-06-01 14:56:41] [INFO ] Deduced a trap composed of 296 places in 266 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 588/1674 variables, and 64 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/590 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1098/1098 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1098 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/588 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/588 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/588 variables, 27/64 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 588/1674 variables, and 64 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/590 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1098 constraints, Known Traps: 27/27 constraints]
After SMT, in 61500ms problems are : Problem set: 0 solved, 1098 unsolved
Search for dead transitions found 0 dead transitions in 61515ms
Starting structural reductions in LTL mode, iteration 1 : 590/592 places, 1100/1102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112381 ms. Remains : 590/592 places, 1100/1102 transitions.
Stuttering acceptance computed with spot in 136 ms :[true, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2) p1), p1]
Running random walk in product with property : PolyORBLF-PT-S02J04T08-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 408 ms.
Product exploration explored 100000 steps with 50000 reset in 397 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) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (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 17 factoid took 40 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S02J04T08-LTLFireability-11 finished in 113392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 592 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 592/592 places, 1102/1102 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 591 transition count 1101
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 591 transition count 1101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 590 transition count 1100
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 590 transition count 1100
Applied a total of 4 rules in 29 ms. Remains 590 /592 variables (removed 2) and now considering 1100/1102 (removed 2) transitions.
Running 1098 sub problems to find dead transitions.
[2024-06-01 14:57:20] [INFO ] Flow matrix only has 1084 transitions (discarded 16 similar events)
// Phase 1: matrix 1084 rows 590 cols
[2024-06-01 14:57:20] [INFO ] Computed 40 invariants in 10 ms
[2024-06-01 14:57:20] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/588 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/588 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-06-01 14:57:29] [INFO ] Deduced a trap composed of 66 places in 179 ms of which 3 ms to minimize.
[2024-06-01 14:57:29] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 2 ms to minimize.
[2024-06-01 14:57:30] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 2 ms to minimize.
[2024-06-01 14:57:30] [INFO ] Deduced a trap composed of 64 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:57:30] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:57:30] [INFO ] Deduced a trap composed of 64 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:57:30] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 0 ms to minimize.
[2024-06-01 14:57:30] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 1 ms to minimize.
[2024-06-01 14:57:30] [INFO ] Deduced a trap composed of 64 places in 222 ms of which 3 ms to minimize.
[2024-06-01 14:57:31] [INFO ] Deduced a trap composed of 173 places in 229 ms of which 11 ms to minimize.
[2024-06-01 14:57:31] [INFO ] Deduced a trap composed of 410 places in 265 ms of which 3 ms to minimize.
[2024-06-01 14:57:31] [INFO ] Deduced a trap composed of 396 places in 236 ms of which 3 ms to minimize.
[2024-06-01 14:57:32] [INFO ] Deduced a trap composed of 79 places in 138 ms of which 1 ms to minimize.
[2024-06-01 14:57:32] [INFO ] Deduced a trap composed of 308 places in 239 ms of which 3 ms to minimize.
[2024-06-01 14:57:33] [INFO ] Deduced a trap composed of 139 places in 237 ms of which 3 ms to minimize.
[2024-06-01 14:57:34] [INFO ] Deduced a trap composed of 331 places in 220 ms of which 3 ms to minimize.
[2024-06-01 14:57:34] [INFO ] Deduced a trap composed of 312 places in 249 ms of which 3 ms to minimize.
[2024-06-01 14:57:34] [INFO ] Deduced a trap composed of 320 places in 220 ms of which 3 ms to minimize.
[2024-06-01 14:57:35] [INFO ] Deduced a trap composed of 311 places in 220 ms of which 3 ms to minimize.
[2024-06-01 14:57:35] [INFO ] Deduced a trap composed of 296 places in 238 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/588 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-06-01 14:57:39] [INFO ] Deduced a trap composed of 309 places in 232 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 588/1674 variables, and 58 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/590 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1098/1098 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1098 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/588 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/588 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/588 variables, 21/58 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-06-01 14:57:56] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:57:56] [INFO ] Deduced a trap composed of 54 places in 288 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 588/1674 variables, and 60 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/590 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1098 constraints, Known Traps: 23/23 constraints]
After SMT, in 41125ms problems are : Problem set: 0 solved, 1098 unsolved
Search for dead transitions found 0 dead transitions in 41135ms
[2024-06-01 14:58:01] [INFO ] Flow matrix only has 1084 transitions (discarded 16 similar events)
[2024-06-01 14:58:01] [INFO ] Invariant cache hit.
[2024-06-01 14:58:01] [INFO ] Implicit Places using invariants in 449 ms returned []
[2024-06-01 14:58:01] [INFO ] Flow matrix only has 1084 transitions (discarded 16 similar events)
[2024-06-01 14:58:01] [INFO ] Invariant cache hit.
[2024-06-01 14:58:02] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:58:09] [INFO ] Implicit Places using invariants and state equation in 7138 ms returned []
Implicit Place search using SMT with State Equation took 7601 ms to find 0 implicit places.
Running 1098 sub problems to find dead transitions.
[2024-06-01 14:58:09] [INFO ] Flow matrix only has 1084 transitions (discarded 16 similar events)
[2024-06-01 14:58:09] [INFO ] Invariant cache hit.
[2024-06-01 14:58:09] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/588 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/588 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-06-01 14:58:18] [INFO ] Deduced a trap composed of 64 places in 142 ms of which 2 ms to minimize.
[2024-06-01 14:58:18] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 2 ms to minimize.
[2024-06-01 14:58:18] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:58:18] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 0 ms to minimize.
[2024-06-01 14:58:18] [INFO ] Deduced a trap composed of 66 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:58:18] [INFO ] Deduced a trap composed of 64 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:58:18] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:58:18] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 3 ms to minimize.
[2024-06-01 14:58:19] [INFO ] Deduced a trap composed of 64 places in 230 ms of which 3 ms to minimize.
[2024-06-01 14:58:19] [INFO ] Deduced a trap composed of 289 places in 223 ms of which 3 ms to minimize.
[2024-06-01 14:58:19] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:58:19] [INFO ] Deduced a trap composed of 54 places in 230 ms of which 3 ms to minimize.
[2024-06-01 14:58:20] [INFO ] Deduced a trap composed of 396 places in 208 ms of which 4 ms to minimize.
[2024-06-01 14:58:21] [INFO ] Deduced a trap composed of 79 places in 145 ms of which 2 ms to minimize.
[2024-06-01 14:58:21] [INFO ] Deduced a trap composed of 116 places in 200 ms of which 3 ms to minimize.
[2024-06-01 14:58:21] [INFO ] Deduced a trap composed of 329 places in 237 ms of which 3 ms to minimize.
[2024-06-01 14:58:22] [INFO ] Deduced a trap composed of 319 places in 219 ms of which 3 ms to minimize.
[2024-06-01 14:58:22] [INFO ] Deduced a trap composed of 320 places in 218 ms of which 3 ms to minimize.
[2024-06-01 14:58:23] [INFO ] Deduced a trap composed of 298 places in 223 ms of which 3 ms to minimize.
[2024-06-01 14:58:23] [INFO ] Deduced a trap composed of 310 places in 212 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/588 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-06-01 14:58:26] [INFO ] Deduced a trap composed of 286 places in 239 ms of which 3 ms to minimize.
[2024-06-01 14:58:26] [INFO ] Deduced a trap composed of 296 places in 220 ms of which 3 ms to minimize.
[2024-06-01 14:58:30] [INFO ] Deduced a trap composed of 295 places in 224 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/588 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 588/1674 variables, and 60 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/590 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1098/1098 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1098 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/588 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/588 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/588 variables, 23/60 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-06-01 14:59:01] [INFO ] Deduced a trap composed of 339 places in 208 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 588/1674 variables, and 61 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/590 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1098 constraints, Known Traps: 24/24 constraints]
After SMT, in 61252ms problems are : Problem set: 0 solved, 1098 unsolved
Search for dead transitions found 0 dead transitions in 61263ms
Starting structural reductions in LTL mode, iteration 1 : 590/592 places, 1100/1102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110033 ms. Remains : 590/592 places, 1100/1102 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J04T08-LTLFireability-12
Entered a terminal (fully accepting) state of product in 166 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T08-LTLFireability-12 finished in 110198 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 4 out of 592 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 592/592 places, 1102/1102 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 592 transition count 1042
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 120 place count 532 transition count 1042
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 120 place count 532 transition count 978
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 248 place count 468 transition count 978
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 250 place count 466 transition count 976
Iterating global reduction 2 with 2 rules applied. Total rules applied 252 place count 466 transition count 976
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 360 place count 412 transition count 922
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 364 place count 408 transition count 918
Iterating global reduction 2 with 4 rules applied. Total rules applied 368 place count 408 transition count 918
Applied a total of 368 rules in 81 ms. Remains 408 /592 variables (removed 184) and now considering 918/1102 (removed 184) transitions.
Running 916 sub problems to find dead transitions.
[2024-06-01 14:59:10] [INFO ] Flow matrix only has 902 transitions (discarded 16 similar events)
// Phase 1: matrix 902 rows 408 cols
[2024-06-01 14:59:10] [INFO ] Computed 40 invariants in 7 ms
[2024-06-01 14:59:10] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 916 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 23/38 constraints. Problems are: Problem set: 0 solved, 916 unsolved
[2024-06-01 14:59:16] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 2 ms to minimize.
[2024-06-01 14:59:16] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:59:16] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 0 ms to minimize.
[2024-06-01 14:59:16] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 0 ms to minimize.
[2024-06-01 14:59:16] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:59:16] [INFO ] Deduced a trap composed of 83 places in 251 ms of which 2 ms to minimize.
[2024-06-01 14:59:17] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 2 ms to minimize.
[2024-06-01 14:59:17] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 1 ms to minimize.
[2024-06-01 14:59:17] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 2 ms to minimize.
[2024-06-01 14:59:17] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:59:17] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:59:17] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 0 ms to minimize.
[2024-06-01 14:59:17] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 2 ms to minimize.
[2024-06-01 14:59:18] [INFO ] Deduced a trap composed of 149 places in 191 ms of which 2 ms to minimize.
[2024-06-01 14:59:18] [INFO ] Deduced a trap composed of 184 places in 178 ms of which 2 ms to minimize.
[2024-06-01 14:59:18] [INFO ] Deduced a trap composed of 144 places in 182 ms of which 2 ms to minimize.
[2024-06-01 14:59:19] [INFO ] Deduced a trap composed of 204 places in 178 ms of which 2 ms to minimize.
[2024-06-01 14:59:19] [INFO ] Deduced a trap composed of 133 places in 188 ms of which 2 ms to minimize.
[2024-06-01 14:59:19] [INFO ] Deduced a trap composed of 160 places in 179 ms of which 2 ms to minimize.
[2024-06-01 14:59:19] [INFO ] Deduced a trap composed of 153 places in 176 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 916 unsolved
[2024-06-01 14:59:20] [INFO ] Deduced a trap composed of 174 places in 169 ms of which 3 ms to minimize.
[2024-06-01 14:59:21] [INFO ] Deduced a trap composed of 205 places in 159 ms of which 2 ms to minimize.
[2024-06-01 14:59:21] [INFO ] Deduced a trap composed of 150 places in 168 ms of which 2 ms to minimize.
[2024-06-01 14:59:23] [INFO ] Deduced a trap composed of 244 places in 240 ms of which 2 ms to minimize.
[2024-06-01 14:59:23] [INFO ] Deduced a trap composed of 46 places in 173 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 916 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 406/1310 variables, and 63 constraints, problems are : Problem set: 0 solved, 916 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/408 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 916/916 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 916 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 916 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 23/38 constraints. Problems are: Problem set: 0 solved, 916 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 25/63 constraints. Problems are: Problem set: 0 solved, 916 unsolved
[2024-06-01 14:59:45] [INFO ] Deduced a trap composed of 162 places in 165 ms of which 2 ms to minimize.
[2024-06-01 14:59:46] [INFO ] Deduced a trap composed of 41 places in 165 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 916 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/1310 variables, and 65 constraints, problems are : Problem set: 0 solved, 916 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/408 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/916 constraints, Known Traps: 27/27 constraints]
After SMT, in 41132ms problems are : Problem set: 0 solved, 916 unsolved
Search for dead transitions found 0 dead transitions in 41139ms
[2024-06-01 14:59:51] [INFO ] Flow matrix only has 902 transitions (discarded 16 similar events)
[2024-06-01 14:59:51] [INFO ] Invariant cache hit.
[2024-06-01 14:59:52] [INFO ] Implicit Places using invariants in 488 ms returned []
[2024-06-01 14:59:52] [INFO ] Flow matrix only has 902 transitions (discarded 16 similar events)
[2024-06-01 14:59:52] [INFO ] Invariant cache hit.
[2024-06-01 14:59:52] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:59:58] [INFO ] Implicit Places using invariants and state equation in 6014 ms returned []
Implicit Place search using SMT with State Equation took 6518 ms to find 0 implicit places.
[2024-06-01 14:59:58] [INFO ] Redundant transitions in 33 ms returned []
Running 916 sub problems to find dead transitions.
[2024-06-01 14:59:58] [INFO ] Flow matrix only has 902 transitions (discarded 16 similar events)
[2024-06-01 14:59:58] [INFO ] Invariant cache hit.
[2024-06-01 14:59:58] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 916 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 23/38 constraints. Problems are: Problem set: 0 solved, 916 unsolved
[2024-06-01 15:00:04] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:00:04] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 0 ms to minimize.
[2024-06-01 15:00:04] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 0 ms to minimize.
[2024-06-01 15:00:04] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 0 ms to minimize.
[2024-06-01 15:00:05] [INFO ] Deduced a trap composed of 83 places in 154 ms of which 2 ms to minimize.
[2024-06-01 15:00:05] [INFO ] Deduced a trap composed of 42 places in 25 ms of which 0 ms to minimize.
[2024-06-01 15:00:05] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 0 ms to minimize.
[2024-06-01 15:00:05] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 1 ms to minimize.
[2024-06-01 15:00:05] [INFO ] Deduced a trap composed of 41 places in 168 ms of which 2 ms to minimize.
[2024-06-01 15:00:05] [INFO ] Deduced a trap composed of 60 places in 196 ms of which 2 ms to minimize.
[2024-06-01 15:00:05] [INFO ] Deduced a trap composed of 153 places in 167 ms of which 2 ms to minimize.
[2024-06-01 15:00:06] [INFO ] Deduced a trap composed of 25 places in 252 ms of which 14 ms to minimize.
[2024-06-01 15:00:06] [INFO ] Deduced a trap composed of 64 places in 139 ms of which 1 ms to minimize.
[2024-06-01 15:00:07] [INFO ] Deduced a trap composed of 221 places in 207 ms of which 2 ms to minimize.
[2024-06-01 15:00:07] [INFO ] Deduced a trap composed of 150 places in 165 ms of which 2 ms to minimize.
[2024-06-01 15:00:07] [INFO ] Deduced a trap composed of 244 places in 147 ms of which 2 ms to minimize.
[2024-06-01 15:00:08] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 1 ms to minimize.
[2024-06-01 15:00:12] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 2 ms to minimize.
[2024-06-01 15:00:12] [INFO ] Deduced a trap composed of 149 places in 167 ms of which 2 ms to minimize.
[2024-06-01 15:00:13] [INFO ] Deduced a trap composed of 177 places in 168 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 916 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 916 unsolved
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD585 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/408 variables, 2/60 constraints. Problems are: Problem set: 88 solved, 828 unsolved
[2024-06-01 15:00:27] [INFO ] Deduced a trap composed of 171 places in 188 ms of which 2 ms to minimize.
[2024-06-01 15:00:27] [INFO ] Deduced a trap composed of 58 places in 168 ms of which 3 ms to minimize.
[2024-06-01 15:00:28] [INFO ] Deduced a trap composed of 170 places in 161 ms of which 2 ms to minimize.
[2024-06-01 15:00:28] [INFO ] Deduced a trap composed of 171 places in 144 ms of which 2 ms to minimize.
[2024-06-01 15:00:28] [INFO ] Deduced a trap composed of 168 places in 210 ms of which 2 ms to minimize.
[2024-06-01 15:00:29] [INFO ] Deduced a trap composed of 47 places in 173 ms of which 2 ms to minimize.
SMT process timed out in 31700ms, After SMT, problems are : Problem set: 88 solved, 828 unsolved
Search for dead transitions found 88 dead transitions in 31717ms
Found 88 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 88 transitions
Dead transitions reduction (with SMT) removed 88 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 408/592 places, 830/1102 transitions.
Reduce places removed 2 places and 16 transitions.
Reduce places removed 16 places and 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 390 transition count 798
Applied a total of 16 rules in 14 ms. Remains 390 /408 variables (removed 18) and now considering 798/830 (removed 32) transitions.
[2024-06-01 15:00:29] [INFO ] Flow matrix only has 782 transitions (discarded 16 similar events)
// Phase 1: matrix 782 rows 390 cols
[2024-06-01 15:00:29] [INFO ] Computed 40 invariants in 7 ms
[2024-06-01 15:00:30] [INFO ] Implicit Places using invariants in 451 ms returned []
[2024-06-01 15:00:30] [INFO ] Flow matrix only has 782 transitions (discarded 16 similar events)
[2024-06-01 15:00:30] [INFO ] Invariant cache hit.
[2024-06-01 15:00:30] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 15:00:34] [INFO ] Implicit Places using invariants and state equation in 4381 ms returned []
Implicit Place search using SMT with State Equation took 4834 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 390/592 places, 798/1102 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 84354 ms. Remains : 390/592 places, 798/1102 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J04T08-LTLFireability-13
Stuttering criterion allowed to conclude after 1694 steps with 2 reset in 13 ms.
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T08-LTLFireability-13 finished in 84435 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||G(p1)))))'
Support contains 3 out of 592 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 592/592 places, 1102/1102 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 592 transition count 1042
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 120 place count 532 transition count 1042
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 120 place count 532 transition count 978
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 248 place count 468 transition count 978
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 250 place count 466 transition count 976
Iterating global reduction 2 with 2 rules applied. Total rules applied 252 place count 466 transition count 976
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 380 place count 402 transition count 912
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 384 place count 398 transition count 908
Iterating global reduction 2 with 4 rules applied. Total rules applied 388 place count 398 transition count 908
Applied a total of 388 rules in 47 ms. Remains 398 /592 variables (removed 194) and now considering 908/1102 (removed 194) transitions.
Running 906 sub problems to find dead transitions.
[2024-06-01 15:00:34] [INFO ] Flow matrix only has 892 transitions (discarded 16 similar events)
// Phase 1: matrix 892 rows 398 cols
[2024-06-01 15:00:34] [INFO ] Computed 40 invariants in 12 ms
[2024-06-01 15:00:34] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/396 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 906 unsolved
[2024-06-01 15:00:41] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 1 ms to minimize.
[2024-06-01 15:00:41] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 2 ms to minimize.
[2024-06-01 15:00:41] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-06-01 15:00:41] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-06-01 15:00:41] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 0 ms to minimize.
[2024-06-01 15:00:41] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:00:41] [INFO ] Deduced a trap composed of 41 places in 170 ms of which 3 ms to minimize.
[2024-06-01 15:00:41] [INFO ] Deduced a trap composed of 75 places in 150 ms of which 2 ms to minimize.
[2024-06-01 15:00:41] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:00:42] [INFO ] Deduced a trap composed of 154 places in 202 ms of which 2 ms to minimize.
[2024-06-01 15:00:42] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 2 ms to minimize.
[2024-06-01 15:00:42] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 2 ms to minimize.
[2024-06-01 15:00:43] [INFO ] Deduced a trap composed of 142 places in 196 ms of which 3 ms to minimize.
[2024-06-01 15:00:45] [INFO ] Deduced a trap composed of 234 places in 186 ms of which 3 ms to minimize.
[2024-06-01 15:00:48] [INFO ] Deduced a trap composed of 187 places in 161 ms of which 3 ms to minimize.
[2024-06-01 15:00:48] [INFO ] Deduced a trap composed of 167 places in 228 ms of which 3 ms to minimize.
[2024-06-01 15:00:49] [INFO ] Deduced a trap composed of 188 places in 237 ms of which 3 ms to minimize.
[2024-06-01 15:00:50] [INFO ] Deduced a trap composed of 169 places in 229 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 18/55 constraints. Problems are: Problem set: 0 solved, 906 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 396/1290 variables, and 55 constraints, problems are : Problem set: 0 solved, 906 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/398 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 906/906 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 906 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/396 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 18/55 constraints. Problems are: Problem set: 0 solved, 906 unsolved
[2024-06-01 15:01:06] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 396/1290 variables, and 56 constraints, problems are : Problem set: 0 solved, 906 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/398 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/906 constraints, Known Traps: 19/19 constraints]
After SMT, in 41144ms problems are : Problem set: 0 solved, 906 unsolved
Search for dead transitions found 0 dead transitions in 41153ms
[2024-06-01 15:01:16] [INFO ] Flow matrix only has 892 transitions (discarded 16 similar events)
[2024-06-01 15:01:16] [INFO ] Invariant cache hit.
[2024-06-01 15:01:16] [INFO ] Implicit Places using invariants in 365 ms returned []
[2024-06-01 15:01:16] [INFO ] Flow matrix only has 892 transitions (discarded 16 similar events)
[2024-06-01 15:01:16] [INFO ] Invariant cache hit.
[2024-06-01 15:01:17] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 15:01:22] [INFO ] Implicit Places using invariants and state equation in 5586 ms returned []
Implicit Place search using SMT with State Equation took 5995 ms to find 0 implicit places.
[2024-06-01 15:01:22] [INFO ] Redundant transitions in 22 ms returned []
Running 906 sub problems to find dead transitions.
[2024-06-01 15:01:22] [INFO ] Flow matrix only has 892 transitions (discarded 16 similar events)
[2024-06-01 15:01:22] [INFO ] Invariant cache hit.
[2024-06-01 15:01:22] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/396 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 906 unsolved
[2024-06-01 15:01:27] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-06-01 15:01:28] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 0 ms to minimize.
[2024-06-01 15:01:28] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-06-01 15:01:28] [INFO ] Deduced a trap composed of 58 places in 201 ms of which 2 ms to minimize.
[2024-06-01 15:01:28] [INFO ] Deduced a trap composed of 71 places in 194 ms of which 2 ms to minimize.
[2024-06-01 15:01:28] [INFO ] Deduced a trap composed of 41 places in 28 ms of which 0 ms to minimize.
[2024-06-01 15:01:28] [INFO ] Deduced a trap composed of 40 places in 157 ms of which 2 ms to minimize.
[2024-06-01 15:01:29] [INFO ] Deduced a trap composed of 156 places in 182 ms of which 2 ms to minimize.
[2024-06-01 15:01:29] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 2 ms to minimize.
[2024-06-01 15:01:29] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-06-01 15:01:29] [INFO ] Deduced a trap composed of 40 places in 173 ms of which 3 ms to minimize.
[2024-06-01 15:01:29] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 2 ms to minimize.
[2024-06-01 15:01:29] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 2 ms to minimize.
[2024-06-01 15:01:30] [INFO ] Deduced a trap composed of 142 places in 242 ms of which 3 ms to minimize.
[2024-06-01 15:01:30] [INFO ] Deduced a trap composed of 167 places in 199 ms of which 2 ms to minimize.
[2024-06-01 15:01:31] [INFO ] Deduced a trap composed of 234 places in 145 ms of which 3 ms to minimize.
[2024-06-01 15:01:36] [INFO ] Deduced a trap composed of 154 places in 215 ms of which 2 ms to minimize.
[2024-06-01 15:01:36] [INFO ] Deduced a trap composed of 134 places in 165 ms of which 2 ms to minimize.
[2024-06-01 15:01:36] [INFO ] Deduced a trap composed of 123 places in 160 ms of which 2 ms to minimize.
[2024-06-01 15:01:37] [INFO ] Deduced a trap composed of 169 places in 160 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 906 unsolved
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD529 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/398 variables, 3/60 constraints. Problems are: Problem set: 88 solved, 818 unsolved
[2024-06-01 15:01:51] [INFO ] Deduced a trap composed of 99 places in 164 ms of which 2 ms to minimize.
[2024-06-01 15:01:52] [INFO ] Deduced a trap composed of 139 places in 207 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 398/1290 variables, and 62 constraints, problems are : Problem set: 88 solved, 818 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/398 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 906/906 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 88 solved, 818 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 14/14 constraints. Problems are: Problem set: 88 solved, 818 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/396 variables, 23/37 constraints. Problems are: Problem set: 88 solved, 818 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 20/57 constraints. Problems are: Problem set: 88 solved, 818 unsolved
[2024-06-01 15:01:58] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-06-01 15:02:05] [INFO ] Deduced a trap composed of 188 places in 169 ms of which 2 ms to minimize.
[2024-06-01 15:02:05] [INFO ] Deduced a trap composed of 167 places in 168 ms of which 2 ms to minimize.
[2024-06-01 15:02:07] [INFO ] Deduced a trap composed of 149 places in 158 ms of which 2 ms to minimize.
[2024-06-01 15:02:07] [INFO ] Deduced a trap composed of 194 places in 169 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 5/62 constraints. Problems are: Problem set: 88 solved, 818 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 0/62 constraints. Problems are: Problem set: 88 solved, 818 unsolved
SMT process timed out in 61087ms, After SMT, problems are : Problem set: 88 solved, 818 unsolved
Search for dead transitions found 88 dead transitions in 61100ms
Found 88 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 88 transitions
Dead transitions reduction (with SMT) removed 88 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 398/592 places, 820/1102 transitions.
Reduce places removed 2 places and 16 transitions.
Reduce places removed 16 places and 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 380 transition count 788
Applied a total of 16 rules in 18 ms. Remains 380 /398 variables (removed 18) and now considering 788/820 (removed 32) transitions.
[2024-06-01 15:02:23] [INFO ] Flow matrix only has 772 transitions (discarded 16 similar events)
// Phase 1: matrix 772 rows 380 cols
[2024-06-01 15:02:23] [INFO ] Computed 40 invariants in 7 ms
[2024-06-01 15:02:23] [INFO ] Implicit Places using invariants in 310 ms returned []
[2024-06-01 15:02:23] [INFO ] Flow matrix only has 772 transitions (discarded 16 similar events)
[2024-06-01 15:02:23] [INFO ] Invariant cache hit.
[2024-06-01 15:02:23] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 15:02:28] [INFO ] Implicit Places using invariants and state equation in 4580 ms returned []
Implicit Place search using SMT with State Equation took 4917 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 380/592 places, 788/1102 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 113267 ms. Remains : 380/592 places, 788/1102 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S02J04T08-LTLFireability-14
Product exploration explored 100000 steps with 50 reset in 444 ms.
Stack based approach found an accepted trace after 24157 steps with 14 reset with depth 2736 and stack size 2704 in 108 ms.
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-PT-S02J04T08-LTLFireability-14 finished in 113907 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(X(F((p0 U (!X(p0) U p1)))))))'
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((F(p0)&&X((!p0 U (p1||G(!p0)))))))'
Found a Shortening insensitive property : PolyORBLF-PT-S02J04T08-LTLFireability-04
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1))]
Support contains 17 out of 592 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 592/592 places, 1102/1102 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 592 transition count 1058
Reduce places removed 44 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 52 rules applied. Total rules applied 96 place count 548 transition count 1050
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 104 place count 540 transition count 1050
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 104 place count 540 transition count 986
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 232 place count 476 transition count 986
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 234 place count 474 transition count 984
Iterating global reduction 3 with 2 rules applied. Total rules applied 236 place count 474 transition count 984
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 348 place count 418 transition count 928
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 352 place count 414 transition count 924
Iterating global reduction 3 with 4 rules applied. Total rules applied 356 place count 414 transition count 924
Applied a total of 356 rules in 46 ms. Remains 414 /592 variables (removed 178) and now considering 924/1102 (removed 178) transitions.
Running 922 sub problems to find dead transitions.
[2024-06-01 15:02:29] [INFO ] Flow matrix only has 908 transitions (discarded 16 similar events)
// Phase 1: matrix 908 rows 414 cols
[2024-06-01 15:02:29] [INFO ] Computed 40 invariants in 12 ms
[2024-06-01 15:02:29] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/412 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 15:02:35] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 1 ms to minimize.
[2024-06-01 15:02:35] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:02:35] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:02:35] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 1 ms to minimize.
[2024-06-01 15:02:35] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 1 ms to minimize.
[2024-06-01 15:02:35] [INFO ] Deduced a trap composed of 101 places in 142 ms of which 2 ms to minimize.
[2024-06-01 15:02:35] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 0 ms to minimize.
[2024-06-01 15:02:35] [INFO ] Deduced a trap composed of 42 places in 139 ms of which 2 ms to minimize.
[2024-06-01 15:02:35] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 1 ms to minimize.
[2024-06-01 15:02:36] [INFO ] Deduced a trap composed of 43 places in 24 ms of which 0 ms to minimize.
[2024-06-01 15:02:36] [INFO ] Deduced a trap composed of 271 places in 253 ms of which 3 ms to minimize.
[2024-06-01 15:02:36] [INFO ] Deduced a trap composed of 43 places in 175 ms of which 2 ms to minimize.
[2024-06-01 15:02:37] [INFO ] Deduced a trap composed of 158 places in 160 ms of which 2 ms to minimize.
[2024-06-01 15:02:37] [INFO ] Deduced a trap composed of 250 places in 158 ms of which 3 ms to minimize.
[2024-06-01 15:02:42] [INFO ] Deduced a trap composed of 171 places in 159 ms of which 2 ms to minimize.
[2024-06-01 15:02:42] [INFO ] Deduced a trap composed of 170 places in 247 ms of which 3 ms to minimize.
[2024-06-01 15:02:42] [INFO ] Deduced a trap composed of 184 places in 211 ms of which 3 ms to minimize.
[2024-06-01 15:02:44] [INFO ] Deduced a trap composed of 181 places in 233 ms of which 2 ms to minimize.
[2024-06-01 15:02:44] [INFO ] Deduced a trap composed of 197 places in 230 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 19/57 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 15:02:48] [INFO ] Deduced a trap composed of 168 places in 162 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 412/1322 variables, and 58 constraints, problems are : Problem set: 0 solved, 922 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/414 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 922 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/412 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 412/1322 variables, and 58 constraints, problems are : Problem set: 0 solved, 922 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/414 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/922 constraints, Known Traps: 20/20 constraints]
After SMT, in 41225ms problems are : Problem set: 0 solved, 922 unsolved
Search for dead transitions found 0 dead transitions in 41232ms
[2024-06-01 15:03:10] [INFO ] Flow matrix only has 908 transitions (discarded 16 similar events)
[2024-06-01 15:03:10] [INFO ] Invariant cache hit.
[2024-06-01 15:03:10] [INFO ] Implicit Places using invariants in 381 ms returned []
[2024-06-01 15:03:10] [INFO ] Flow matrix only has 908 transitions (discarded 16 similar events)
[2024-06-01 15:03:10] [INFO ] Invariant cache hit.
[2024-06-01 15:03:11] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 15:03:14] [INFO ] Implicit Places using invariants and state equation in 3987 ms returned []
Implicit Place search using SMT with State Equation took 4370 ms to find 0 implicit places.
Running 922 sub problems to find dead transitions.
[2024-06-01 15:03:14] [INFO ] Flow matrix only has 908 transitions (discarded 16 similar events)
[2024-06-01 15:03:14] [INFO ] Invariant cache hit.
[2024-06-01 15:03:14] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/412 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 15:03:21] [INFO ] Deduced a trap composed of 42 places in 229 ms of which 3 ms to minimize.
[2024-06-01 15:03:21] [INFO ] Deduced a trap composed of 123 places in 200 ms of which 3 ms to minimize.
[2024-06-01 15:03:22] [INFO ] Deduced a trap composed of 87 places in 194 ms of which 3 ms to minimize.
[2024-06-01 15:03:22] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 1 ms to minimize.
[2024-06-01 15:03:22] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 0 ms to minimize.
[2024-06-01 15:03:22] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:03:22] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 0 ms to minimize.
[2024-06-01 15:03:22] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 2 ms to minimize.
[2024-06-01 15:03:22] [INFO ] Deduced a trap composed of 155 places in 237 ms of which 3 ms to minimize.
[2024-06-01 15:03:22] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 0 ms to minimize.
[2024-06-01 15:03:22] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 0 ms to minimize.
[2024-06-01 15:03:23] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 0 ms to minimize.
[2024-06-01 15:03:23] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 1 ms to minimize.
[2024-06-01 15:03:23] [INFO ] Deduced a trap composed of 149 places in 167 ms of which 2 ms to minimize.
[2024-06-01 15:03:24] [INFO ] Deduced a trap composed of 210 places in 172 ms of which 2 ms to minimize.
[2024-06-01 15:03:24] [INFO ] Deduced a trap composed of 158 places in 187 ms of which 2 ms to minimize.
[2024-06-01 15:03:25] [INFO ] Deduced a trap composed of 252 places in 229 ms of which 2 ms to minimize.
[2024-06-01 15:03:29] [INFO ] Deduced a trap composed of 250 places in 256 ms of which 2 ms to minimize.
[2024-06-01 15:03:29] [INFO ] Deduced a trap composed of 62 places in 173 ms of which 2 ms to minimize.
[2024-06-01 15:03:31] [INFO ] Deduced a trap composed of 185 places in 144 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 15:03:37] [INFO ] Deduced a trap composed of 166 places in 188 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 412/1322 variables, and 59 constraints, problems are : Problem set: 0 solved, 922 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/414 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 922 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/412 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 21/59 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD552 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/414 variables, 2/61 constraints. Problems are: Problem set: 88 solved, 834 unsolved
[2024-06-01 15:04:15] [INFO ] Deduced a trap composed of 155 places in 255 ms of which 18 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 414/1322 variables, and 62 constraints, problems are : Problem set: 88 solved, 834 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/414 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/922 constraints, Known Traps: 22/22 constraints]
After SMT, in 61252ms problems are : Problem set: 88 solved, 834 unsolved
Search for dead transitions found 88 dead transitions in 61260ms
Found 88 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 88 transitions
Dead transitions reduction (with SMT) removed 88 transitions
Starting structural reductions in LI_LTL mode, iteration 1 : 414/592 places, 836/1102 transitions.
Reduce places removed 2 places and 16 transitions.
Reduce places removed 16 places and 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 396 transition count 804
Applied a total of 16 rules in 25 ms. Remains 396 /414 variables (removed 18) and now considering 804/836 (removed 32) transitions.
[2024-06-01 15:04:16] [INFO ] Flow matrix only has 788 transitions (discarded 16 similar events)
// Phase 1: matrix 788 rows 396 cols
[2024-06-01 15:04:16] [INFO ] Computed 40 invariants in 10 ms
[2024-06-01 15:04:16] [INFO ] Implicit Places using invariants in 411 ms returned []
[2024-06-01 15:04:16] [INFO ] Flow matrix only has 788 transitions (discarded 16 similar events)
[2024-06-01 15:04:16] [INFO ] Invariant cache hit.
[2024-06-01 15:04:17] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 15:04:19] [INFO ] Implicit Places using invariants and state equation in 2861 ms returned []
Implicit Place search using SMT with State Equation took 3301 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 396/592 places, 804/1102 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 110239 ms. Remains : 396/592 places, 804/1102 transitions.
Running random walk in product with property : PolyORBLF-PT-S02J04T08-LTLFireability-04
Product exploration explored 100000 steps with 4644 reset in 429 ms.
Product exploration explored 100000 steps with 4665 reset in 480 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) p1), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 139 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 173 steps (0 resets) in 6 ms. (24 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 9 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
[2024-06-01 15:04:20] [INFO ] Flow matrix only has 788 transitions (discarded 16 similar events)
[2024-06-01 15:04:20] [INFO ] Invariant cache hit.
[2024-06-01 15:04:21] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-06-01 15:04:21] [INFO ] [Real]Absence check using 12 positive and 28 generalized place invariants in 52 ms returned sat
[2024-06-01 15:04:22] [INFO ] [Real]Absence check using state equation in 796 ms returned sat
[2024-06-01 15:04:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:04:22] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-06-01 15:04:22] [INFO ] [Nat]Absence check using 12 positive and 28 generalized place invariants in 30 ms returned sat
[2024-06-01 15:04:23] [INFO ] [Nat]Absence check using state equation in 1012 ms returned sat
[2024-06-01 15:04:23] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 15:04:23] [INFO ] [Nat]Added 96 Read/Feed constraints in 113 ms returned sat
[2024-06-01 15:04:23] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 1 ms to minimize.
[2024-06-01 15:04:23] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 1 ms to minimize.
[2024-06-01 15:04:24] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 1 ms to minimize.
[2024-06-01 15:04:24] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 1 ms to minimize.
[2024-06-01 15:04:24] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 0 ms to minimize.
[2024-06-01 15:04:24] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 1 ms to minimize.
[2024-06-01 15:04:24] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 0 ms to minimize.
[2024-06-01 15:04:24] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1085 ms
[2024-06-01 15:04:24] [INFO ] Computed and/alt/rep : 370/1309/362 causal constraints (skipped 424 transitions) in 58 ms.
[2024-06-01 15:04:27] [INFO ] Added : 200 causal constraints over 40 iterations in 2609 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 396 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 : 396/396 places, 804/804 transitions.
Applied a total of 0 rules in 16 ms. Remains 396 /396 variables (removed 0) and now considering 804/804 (removed 0) transitions.
Running 802 sub problems to find dead transitions.
[2024-06-01 15:04:27] [INFO ] Flow matrix only has 788 transitions (discarded 16 similar events)
[2024-06-01 15:04:27] [INFO ] Invariant cache hit.
[2024-06-01 15:04:27] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 802 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 802 unsolved
[2024-06-01 15:04:32] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:04:32] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-06-01 15:04:32] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 1 ms to minimize.
[2024-06-01 15:04:32] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 0 ms to minimize.
[2024-06-01 15:04:32] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:04:32] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 0 ms to minimize.
[2024-06-01 15:04:32] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 0 ms to minimize.
[2024-06-01 15:04:33] [INFO ] Deduced a trap composed of 206 places in 158 ms of which 2 ms to minimize.
[2024-06-01 15:04:33] [INFO ] Deduced a trap composed of 200 places in 127 ms of which 2 ms to minimize.
[2024-06-01 15:04:33] [INFO ] Deduced a trap composed of 77 places in 158 ms of which 2 ms to minimize.
[2024-06-01 15:04:33] [INFO ] Deduced a trap composed of 199 places in 141 ms of which 2 ms to minimize.
[2024-06-01 15:04:33] [INFO ] Deduced a trap composed of 220 places in 164 ms of which 2 ms to minimize.
[2024-06-01 15:04:33] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
[2024-06-01 15:04:34] [INFO ] Deduced a trap composed of 191 places in 149 ms of which 2 ms to minimize.
[2024-06-01 15:04:34] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 2 ms to minimize.
[2024-06-01 15:04:34] [INFO ] Deduced a trap composed of 258 places in 133 ms of which 3 ms to minimize.
[2024-06-01 15:04:34] [INFO ] Deduced a trap composed of 213 places in 209 ms of which 3 ms to minimize.
[2024-06-01 15:04:34] [INFO ] Deduced a trap composed of 223 places in 146 ms of which 2 ms to minimize.
[2024-06-01 15:04:34] [INFO ] Deduced a trap composed of 204 places in 145 ms of which 2 ms to minimize.
[2024-06-01 15:04:34] [INFO ] Deduced a trap composed of 224 places in 132 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 802 unsolved
[2024-06-01 15:04:35] [INFO ] Deduced a trap composed of 192 places in 135 ms of which 2 ms to minimize.
[2024-06-01 15:04:35] [INFO ] Deduced a trap composed of 50 places in 194 ms of which 3 ms to minimize.
[2024-06-01 15:04:36] [INFO ] Deduced a trap composed of 140 places in 214 ms of which 3 ms to minimize.
[2024-06-01 15:04:36] [INFO ] Deduced a trap composed of 206 places in 152 ms of which 2 ms to minimize.
[2024-06-01 15:04:37] [INFO ] Deduced a trap composed of 215 places in 234 ms of which 3 ms to minimize.
[2024-06-01 15:04:37] [INFO ] Deduced a trap composed of 220 places in 192 ms of which 3 ms to minimize.
[2024-06-01 15:04:37] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 1 ms to minimize.
[2024-06-01 15:04:37] [INFO ] Deduced a trap composed of 189 places in 196 ms of which 3 ms to minimize.
[2024-06-01 15:04:37] [INFO ] Deduced a trap composed of 210 places in 189 ms of which 2 ms to minimize.
[2024-06-01 15:04:38] [INFO ] Deduced a trap composed of 262 places in 184 ms of which 3 ms to minimize.
[2024-06-01 15:04:38] [INFO ] Deduced a trap composed of 224 places in 182 ms of which 3 ms to minimize.
[2024-06-01 15:04:38] [INFO ] Deduced a trap composed of 231 places in 184 ms of which 2 ms to minimize.
[2024-06-01 15:04:38] [INFO ] Deduced a trap composed of 244 places in 164 ms of which 2 ms to minimize.
[2024-06-01 15:04:38] [INFO ] Deduced a trap composed of 265 places in 141 ms of which 2 ms to minimize.
[2024-06-01 15:04:38] [INFO ] Deduced a trap composed of 231 places in 139 ms of which 2 ms to minimize.
[2024-06-01 15:04:39] [INFO ] Deduced a trap composed of 130 places in 206 ms of which 3 ms to minimize.
[2024-06-01 15:04:39] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 1 ms to minimize.
[2024-06-01 15:04:39] [INFO ] Deduced a trap composed of 189 places in 127 ms of which 2 ms to minimize.
[2024-06-01 15:04:39] [INFO ] Deduced a trap composed of 179 places in 142 ms of which 2 ms to minimize.
[2024-06-01 15:04:39] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 802 unsolved
[2024-06-01 15:04:44] [INFO ] Deduced a trap composed of 232 places in 150 ms of which 1 ms to minimize.
[2024-06-01 15:04:45] [INFO ] Deduced a trap composed of 206 places in 145 ms of which 2 ms to minimize.
[2024-06-01 15:04:45] [INFO ] Deduced a trap composed of 224 places in 142 ms of which 2 ms to minimize.
[2024-06-01 15:04:46] [INFO ] Deduced a trap composed of 215 places in 147 ms of which 2 ms to minimize.
[2024-06-01 15:04:46] [INFO ] Deduced a trap composed of 139 places in 157 ms of which 2 ms to minimize.
[2024-06-01 15:04:46] [INFO ] Deduced a trap composed of 116 places in 153 ms of which 2 ms to minimize.
[2024-06-01 15:04:47] [INFO ] Deduced a trap composed of 206 places in 134 ms of which 2 ms to minimize.
[2024-06-01 15:04:47] [INFO ] Deduced a trap composed of 214 places in 158 ms of which 2 ms to minimize.
[2024-06-01 15:04:47] [INFO ] Deduced a trap composed of 214 places in 153 ms of which 2 ms to minimize.
[2024-06-01 15:04:48] [INFO ] Deduced a trap composed of 219 places in 150 ms of which 2 ms to minimize.
[2024-06-01 15:04:48] [INFO ] Deduced a trap composed of 221 places in 147 ms of which 2 ms to minimize.
[2024-06-01 15:04:48] [INFO ] Deduced a trap composed of 216 places in 153 ms of which 2 ms to minimize.
[2024-06-01 15:04:48] [INFO ] Deduced a trap composed of 214 places in 146 ms of which 2 ms to minimize.
SMT process timed out in 21195ms, After SMT, problems are : Problem set: 0 solved, 802 unsolved
Search for dead transitions found 0 dead transitions in 21205ms
[2024-06-01 15:04:48] [INFO ] Flow matrix only has 788 transitions (discarded 16 similar events)
[2024-06-01 15:04:48] [INFO ] Invariant cache hit.
[2024-06-01 15:04:48] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-06-01 15:04:48] [INFO ] Flow matrix only has 788 transitions (discarded 16 similar events)
[2024-06-01 15:04:48] [INFO ] Invariant cache hit.
[2024-06-01 15:04:49] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 15:04:51] [INFO ] Implicit Places using invariants and state equation in 2949 ms returned []
Implicit Place search using SMT with State Equation took 3267 ms to find 0 implicit places.
[2024-06-01 15:04:51] [INFO ] Redundant transitions in 8 ms returned []
Running 802 sub problems to find dead transitions.
[2024-06-01 15:04:51] [INFO ] Flow matrix only has 788 transitions (discarded 16 similar events)
[2024-06-01 15:04:51] [INFO ] Invariant cache hit.
[2024-06-01 15:04:51] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 802 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 802 unsolved
[2024-06-01 15:04:56] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 0 ms to minimize.
[2024-06-01 15:04:56] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-06-01 15:04:56] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 0 ms to minimize.
[2024-06-01 15:04:56] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 0 ms to minimize.
[2024-06-01 15:04:57] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-06-01 15:04:57] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 0 ms to minimize.
[2024-06-01 15:04:57] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2024-06-01 15:04:57] [INFO ] Deduced a trap composed of 206 places in 189 ms of which 2 ms to minimize.
[2024-06-01 15:04:57] [INFO ] Deduced a trap composed of 200 places in 153 ms of which 2 ms to minimize.
[2024-06-01 15:04:57] [INFO ] Deduced a trap composed of 77 places in 163 ms of which 2 ms to minimize.
[2024-06-01 15:04:57] [INFO ] Deduced a trap composed of 199 places in 143 ms of which 2 ms to minimize.
[2024-06-01 15:04:58] [INFO ] Deduced a trap composed of 220 places in 158 ms of which 2 ms to minimize.
[2024-06-01 15:04:58] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:04:58] [INFO ] Deduced a trap composed of 191 places in 152 ms of which 2 ms to minimize.
[2024-06-01 15:04:58] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 2 ms to minimize.
[2024-06-01 15:04:58] [INFO ] Deduced a trap composed of 258 places in 156 ms of which 2 ms to minimize.
[2024-06-01 15:04:58] [INFO ] Deduced a trap composed of 213 places in 153 ms of which 2 ms to minimize.
[2024-06-01 15:04:59] [INFO ] Deduced a trap composed of 223 places in 152 ms of which 2 ms to minimize.
[2024-06-01 15:04:59] [INFO ] Deduced a trap composed of 204 places in 130 ms of which 1 ms to minimize.
[2024-06-01 15:04:59] [INFO ] Deduced a trap composed of 224 places in 162 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 802 unsolved
[2024-06-01 15:04:59] [INFO ] Deduced a trap composed of 192 places in 131 ms of which 2 ms to minimize.
[2024-06-01 15:05:00] [INFO ] Deduced a trap composed of 50 places in 139 ms of which 2 ms to minimize.
[2024-06-01 15:05:00] [INFO ] Deduced a trap composed of 140 places in 155 ms of which 2 ms to minimize.
[2024-06-01 15:05:00] [INFO ] Deduced a trap composed of 206 places in 147 ms of which 2 ms to minimize.
[2024-06-01 15:05:00] [INFO ] Deduced a trap composed of 215 places in 161 ms of which 2 ms to minimize.
[2024-06-01 15:05:01] [INFO ] Deduced a trap composed of 220 places in 151 ms of which 2 ms to minimize.
[2024-06-01 15:05:01] [INFO ] Deduced a trap composed of 46 places in 88 ms of which 1 ms to minimize.
[2024-06-01 15:05:01] [INFO ] Deduced a trap composed of 189 places in 158 ms of which 2 ms to minimize.
[2024-06-01 15:05:01] [INFO ] Deduced a trap composed of 210 places in 146 ms of which 2 ms to minimize.
[2024-06-01 15:05:01] [INFO ] Deduced a trap composed of 262 places in 157 ms of which 1 ms to minimize.
[2024-06-01 15:05:01] [INFO ] Deduced a trap composed of 224 places in 141 ms of which 2 ms to minimize.
[2024-06-01 15:05:02] [INFO ] Deduced a trap composed of 231 places in 150 ms of which 2 ms to minimize.
[2024-06-01 15:05:02] [INFO ] Deduced a trap composed of 244 places in 168 ms of which 2 ms to minimize.
[2024-06-01 15:05:02] [INFO ] Deduced a trap composed of 265 places in 141 ms of which 15 ms to minimize.
[2024-06-01 15:05:02] [INFO ] Deduced a trap composed of 231 places in 141 ms of which 2 ms to minimize.
[2024-06-01 15:05:02] [INFO ] Deduced a trap composed of 130 places in 160 ms of which 2 ms to minimize.
[2024-06-01 15:05:02] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2024-06-01 15:05:03] [INFO ] Deduced a trap composed of 189 places in 129 ms of which 2 ms to minimize.
[2024-06-01 15:05:03] [INFO ] Deduced a trap composed of 179 places in 152 ms of which 2 ms to minimize.
[2024-06-01 15:05:03] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 802 unsolved
[2024-06-01 15:05:08] [INFO ] Deduced a trap composed of 232 places in 157 ms of which 2 ms to minimize.
[2024-06-01 15:05:09] [INFO ] Deduced a trap composed of 206 places in 164 ms of which 2 ms to minimize.
[2024-06-01 15:05:09] [INFO ] Deduced a trap composed of 224 places in 164 ms of which 3 ms to minimize.
[2024-06-01 15:05:09] [INFO ] Deduced a trap composed of 215 places in 164 ms of which 2 ms to minimize.
[2024-06-01 15:05:09] [INFO ] Deduced a trap composed of 139 places in 154 ms of which 2 ms to minimize.
[2024-06-01 15:05:10] [INFO ] Deduced a trap composed of 116 places in 173 ms of which 2 ms to minimize.
[2024-06-01 15:05:11] [INFO ] Deduced a trap composed of 206 places in 132 ms of which 2 ms to minimize.
[2024-06-01 15:05:11] [INFO ] Deduced a trap composed of 214 places in 173 ms of which 2 ms to minimize.
[2024-06-01 15:05:11] [INFO ] Deduced a trap composed of 214 places in 162 ms of which 2 ms to minimize.
[2024-06-01 15:05:12] [INFO ] Deduced a trap composed of 219 places in 170 ms of which 3 ms to minimize.
[2024-06-01 15:05:12] [INFO ] Deduced a trap composed of 221 places in 202 ms of which 3 ms to minimize.
[2024-06-01 15:05:12] [INFO ] Deduced a trap composed of 216 places in 182 ms of which 2 ms to minimize.
[2024-06-01 15:05:12] [INFO ] Deduced a trap composed of 214 places in 215 ms of which 3 ms to minimize.
[2024-06-01 15:05:13] [INFO ] Deduced a trap composed of 130 places in 186 ms of which 2 ms to minimize.
[2024-06-01 15:05:14] [INFO ] Deduced a trap composed of 194 places in 179 ms of which 2 ms to minimize.
[2024-06-01 15:05:15] [INFO ] Deduced a trap composed of 177 places in 176 ms of which 3 ms to minimize.
[2024-06-01 15:05:15] [INFO ] Deduced a trap composed of 191 places in 160 ms of which 2 ms to minimize.
[2024-06-01 15:05:16] [INFO ] Deduced a trap composed of 179 places in 160 ms of which 2 ms to minimize.
[2024-06-01 15:05:16] [INFO ] Deduced a trap composed of 208 places in 175 ms of which 2 ms to minimize.
[2024-06-01 15:05:16] [INFO ] Deduced a trap composed of 192 places in 163 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 802 unsolved
[2024-06-01 15:05:17] [INFO ] Deduced a trap composed of 186 places in 153 ms of which 2 ms to minimize.
[2024-06-01 15:05:18] [INFO ] Deduced a trap composed of 199 places in 229 ms of which 3 ms to minimize.
[2024-06-01 15:05:18] [INFO ] Deduced a trap composed of 116 places in 166 ms of which 3 ms to minimize.
[2024-06-01 15:05:18] [INFO ] Deduced a trap composed of 211 places in 156 ms of which 2 ms to minimize.
[2024-06-01 15:05:18] [INFO ] Deduced a trap composed of 118 places in 158 ms of which 2 ms to minimize.
[2024-06-01 15:05:18] [INFO ] Deduced a trap composed of 199 places in 158 ms of which 2 ms to minimize.
[2024-06-01 15:05:19] [INFO ] Deduced a trap composed of 119 places in 158 ms of which 2 ms to minimize.
[2024-06-01 15:05:19] [INFO ] Deduced a trap composed of 119 places in 155 ms of which 2 ms to minimize.
[2024-06-01 15:05:19] [INFO ] Deduced a trap composed of 205 places in 153 ms of which 2 ms to minimize.
[2024-06-01 15:05:19] [INFO ] Deduced a trap composed of 200 places in 203 ms of which 3 ms to minimize.
[2024-06-01 15:05:19] [INFO ] Deduced a trap composed of 223 places in 160 ms of which 2 ms to minimize.
[2024-06-01 15:05:19] [INFO ] Deduced a trap composed of 232 places in 159 ms of which 2 ms to minimize.
[2024-06-01 15:05:20] [INFO ] Deduced a trap composed of 237 places in 143 ms of which 3 ms to minimize.
[2024-06-01 15:05:20] [INFO ] Deduced a trap composed of 185 places in 218 ms of which 3 ms to minimize.
[2024-06-01 15:05:21] [INFO ] Deduced a trap composed of 130 places in 218 ms of which 3 ms to minimize.
[2024-06-01 15:05:22] [INFO ] Deduced a trap composed of 202 places in 178 ms of which 3 ms to minimize.
[2024-06-01 15:05:22] [INFO ] Deduced a trap composed of 197 places in 184 ms of which 2 ms to minimize.
[2024-06-01 15:05:22] [INFO ] Deduced a trap composed of 186 places in 182 ms of which 3 ms to minimize.
[2024-06-01 15:05:22] [INFO ] Deduced a trap composed of 197 places in 169 ms of which 2 ms to minimize.
[2024-06-01 15:05:22] [INFO ] Deduced a trap composed of 190 places in 154 ms of which 2 ms to minimize.
SMT process timed out in 31018ms, After SMT, problems are : Problem set: 0 solved, 802 unsolved
Search for dead transitions found 0 dead transitions in 31026ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 55533 ms. Remains : 396/396 places, 804/804 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 165 steps (0 resets) in 6 ms. (23 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
[2024-06-01 15:05:23] [INFO ] Flow matrix only has 788 transitions (discarded 16 similar events)
[2024-06-01 15:05:23] [INFO ] Invariant cache hit.
[2024-06-01 15:05:23] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-06-01 15:05:23] [INFO ] [Real]Absence check using 12 positive and 28 generalized place invariants in 54 ms returned sat
[2024-06-01 15:05:24] [INFO ] [Real]Absence check using state equation in 769 ms returned sat
[2024-06-01 15:05:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:05:24] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2024-06-01 15:05:24] [INFO ] [Nat]Absence check using 12 positive and 28 generalized place invariants in 34 ms returned sat
[2024-06-01 15:05:25] [INFO ] [Nat]Absence check using state equation in 803 ms returned sat
[2024-06-01 15:05:25] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 15:05:25] [INFO ] [Nat]Added 96 Read/Feed constraints in 82 ms returned sat
[2024-06-01 15:05:25] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:05:25] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
[2024-06-01 15:05:25] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-06-01 15:05:25] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 0 ms to minimize.
[2024-06-01 15:05:26] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:05:26] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-06-01 15:05:26] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:05:26] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 776 ms
[2024-06-01 15:05:26] [INFO ] Computed and/alt/rep : 370/1309/362 causal constraints (skipped 424 transitions) in 63 ms.
[2024-06-01 15:05:28] [INFO ] Added : 200 causal constraints over 40 iterations in 1981 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2437 reset in 296 ms.
Product exploration explored 100000 steps with 2427 reset in 311 ms.
Support contains 8 out of 396 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 396/396 places, 804/804 transitions.
Applied a total of 0 rules in 9 ms. Remains 396 /396 variables (removed 0) and now considering 804/804 (removed 0) transitions.
Running 802 sub problems to find dead transitions.
[2024-06-01 15:05:29] [INFO ] Flow matrix only has 788 transitions (discarded 16 similar events)
[2024-06-01 15:05:29] [INFO ] Invariant cache hit.
[2024-06-01 15:05:29] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 802 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 802 unsolved
[2024-06-01 15:05:33] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-06-01 15:05:33] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-06-01 15:05:33] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2024-06-01 15:05:33] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 0 ms to minimize.
[2024-06-01 15:05:33] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 0 ms to minimize.
[2024-06-01 15:05:33] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 1 ms to minimize.
[2024-06-01 15:05:33] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 0 ms to minimize.
[2024-06-01 15:05:34] [INFO ] Deduced a trap composed of 206 places in 162 ms of which 2 ms to minimize.
[2024-06-01 15:05:34] [INFO ] Deduced a trap composed of 200 places in 146 ms of which 1 ms to minimize.
[2024-06-01 15:05:34] [INFO ] Deduced a trap composed of 77 places in 148 ms of which 2 ms to minimize.
[2024-06-01 15:05:34] [INFO ] Deduced a trap composed of 199 places in 162 ms of which 2 ms to minimize.
[2024-06-01 15:05:34] [INFO ] Deduced a trap composed of 220 places in 137 ms of which 2 ms to minimize.
[2024-06-01 15:05:34] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 0 ms to minimize.
[2024-06-01 15:05:35] [INFO ] Deduced a trap composed of 191 places in 144 ms of which 2 ms to minimize.
[2024-06-01 15:05:35] [INFO ] Deduced a trap composed of 37 places in 166 ms of which 1 ms to minimize.
[2024-06-01 15:05:35] [INFO ] Deduced a trap composed of 258 places in 144 ms of which 2 ms to minimize.
[2024-06-01 15:05:35] [INFO ] Deduced a trap composed of 213 places in 150 ms of which 2 ms to minimize.
[2024-06-01 15:05:35] [INFO ] Deduced a trap composed of 223 places in 156 ms of which 3 ms to minimize.
[2024-06-01 15:05:35] [INFO ] Deduced a trap composed of 204 places in 154 ms of which 2 ms to minimize.
[2024-06-01 15:05:36] [INFO ] Deduced a trap composed of 224 places in 168 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 802 unsolved
[2024-06-01 15:05:36] [INFO ] Deduced a trap composed of 192 places in 222 ms of which 3 ms to minimize.
[2024-06-01 15:05:36] [INFO ] Deduced a trap composed of 50 places in 206 ms of which 3 ms to minimize.
[2024-06-01 15:05:37] [INFO ] Deduced a trap composed of 140 places in 188 ms of which 2 ms to minimize.
[2024-06-01 15:05:37] [INFO ] Deduced a trap composed of 206 places in 219 ms of which 2 ms to minimize.
[2024-06-01 15:05:37] [INFO ] Deduced a trap composed of 215 places in 212 ms of which 3 ms to minimize.
[2024-06-01 15:05:38] [INFO ] Deduced a trap composed of 220 places in 188 ms of which 3 ms to minimize.
[2024-06-01 15:05:38] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 2 ms to minimize.
[2024-06-01 15:05:38] [INFO ] Deduced a trap composed of 189 places in 205 ms of which 2 ms to minimize.
[2024-06-01 15:05:38] [INFO ] Deduced a trap composed of 210 places in 191 ms of which 3 ms to minimize.
[2024-06-01 15:05:38] [INFO ] Deduced a trap composed of 262 places in 187 ms of which 3 ms to minimize.
[2024-06-01 15:05:39] [INFO ] Deduced a trap composed of 224 places in 183 ms of which 3 ms to minimize.
[2024-06-01 15:05:39] [INFO ] Deduced a trap composed of 231 places in 174 ms of which 3 ms to minimize.
[2024-06-01 15:05:39] [INFO ] Deduced a trap composed of 244 places in 153 ms of which 2 ms to minimize.
[2024-06-01 15:05:39] [INFO ] Deduced a trap composed of 265 places in 137 ms of which 2 ms to minimize.
[2024-06-01 15:05:39] [INFO ] Deduced a trap composed of 231 places in 212 ms of which 3 ms to minimize.
[2024-06-01 15:05:40] [INFO ] Deduced a trap composed of 130 places in 192 ms of which 3 ms to minimize.
[2024-06-01 15:05:40] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 2 ms to minimize.
[2024-06-01 15:05:40] [INFO ] Deduced a trap composed of 189 places in 130 ms of which 2 ms to minimize.
[2024-06-01 15:05:40] [INFO ] Deduced a trap composed of 179 places in 182 ms of which 3 ms to minimize.
[2024-06-01 15:05:40] [INFO ] Deduced a trap composed of 19 places in 183 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 802 unsolved
[2024-06-01 15:05:46] [INFO ] Deduced a trap composed of 232 places in 208 ms of which 3 ms to minimize.
[2024-06-01 15:05:47] [INFO ] Deduced a trap composed of 206 places in 215 ms of which 3 ms to minimize.
[2024-06-01 15:05:47] [INFO ] Deduced a trap composed of 224 places in 203 ms of which 3 ms to minimize.
[2024-06-01 15:05:47] [INFO ] Deduced a trap composed of 215 places in 216 ms of which 3 ms to minimize.
[2024-06-01 15:05:48] [INFO ] Deduced a trap composed of 139 places in 182 ms of which 3 ms to minimize.
[2024-06-01 15:05:48] [INFO ] Deduced a trap composed of 116 places in 155 ms of which 2 ms to minimize.
[2024-06-01 15:05:49] [INFO ] Deduced a trap composed of 206 places in 221 ms of which 3 ms to minimize.
[2024-06-01 15:05:49] [INFO ] Deduced a trap composed of 214 places in 187 ms of which 3 ms to minimize.
[2024-06-01 15:05:49] [INFO ] Deduced a trap composed of 214 places in 197 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 394/1184 variables, and 86 constraints, problems are : Problem set: 0 solved, 802 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/396 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 802/802 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 802 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 802 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 802 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 49/86 constraints. Problems are: Problem set: 0 solved, 802 unsolved
[2024-06-01 15:05:53] [INFO ] Deduced a trap composed of 212 places in 210 ms of which 2 ms to minimize.
[2024-06-01 15:05:53] [INFO ] Deduced a trap composed of 190 places in 190 ms of which 3 ms to minimize.
[2024-06-01 15:05:53] [INFO ] Deduced a trap composed of 207 places in 185 ms of which 2 ms to minimize.
[2024-06-01 15:05:53] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-06-01 15:05:54] [INFO ] Deduced a trap composed of 181 places in 178 ms of which 2 ms to minimize.
[2024-06-01 15:05:54] [INFO ] Deduced a trap composed of 185 places in 196 ms of which 2 ms to minimize.
[2024-06-01 15:05:55] [INFO ] Deduced a trap composed of 182 places in 159 ms of which 2 ms to minimize.
[2024-06-01 15:05:55] [INFO ] Deduced a trap composed of 209 places in 158 ms of which 2 ms to minimize.
[2024-06-01 15:05:55] [INFO ] Deduced a trap composed of 180 places in 156 ms of which 2 ms to minimize.
[2024-06-01 15:05:55] [INFO ] Deduced a trap composed of 194 places in 154 ms of which 2 ms to minimize.
[2024-06-01 15:05:56] [INFO ] Deduced a trap composed of 187 places in 152 ms of which 2 ms to minimize.
[2024-06-01 15:05:56] [INFO ] Deduced a trap composed of 207 places in 193 ms of which 3 ms to minimize.
[2024-06-01 15:05:57] [INFO ] Deduced a trap composed of 144 places in 131 ms of which 1 ms to minimize.
[2024-06-01 15:05:58] [INFO ] Deduced a trap composed of 175 places in 130 ms of which 2 ms to minimize.
[2024-06-01 15:05:58] [INFO ] Deduced a trap composed of 198 places in 143 ms of which 2 ms to minimize.
[2024-06-01 15:05:58] [INFO ] Deduced a trap composed of 194 places in 144 ms of which 2 ms to minimize.
[2024-06-01 15:05:58] [INFO ] Deduced a trap composed of 196 places in 182 ms of which 2 ms to minimize.
[2024-06-01 15:05:59] [INFO ] Deduced a trap composed of 191 places in 172 ms of which 2 ms to minimize.
[2024-06-01 15:05:59] [INFO ] Deduced a trap composed of 221 places in 129 ms of which 2 ms to minimize.
[2024-06-01 15:05:59] [INFO ] Deduced a trap composed of 230 places in 154 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 802 unsolved
[2024-06-01 15:06:02] [INFO ] Deduced a trap composed of 205 places in 169 ms of which 2 ms to minimize.
[2024-06-01 15:06:02] [INFO ] Deduced a trap composed of 189 places in 201 ms of which 3 ms to minimize.
[2024-06-01 15:06:03] [INFO ] Deduced a trap composed of 215 places in 146 ms of which 2 ms to minimize.
[2024-06-01 15:06:04] [INFO ] Deduced a trap composed of 169 places in 225 ms of which 2 ms to minimize.
[2024-06-01 15:06:04] [INFO ] Deduced a trap composed of 197 places in 157 ms of which 1 ms to minimize.
[2024-06-01 15:06:04] [INFO ] Deduced a trap composed of 202 places in 156 ms of which 2 ms to minimize.
[2024-06-01 15:06:04] [INFO ] Deduced a trap composed of 214 places in 169 ms of which 2 ms to minimize.
[2024-06-01 15:06:04] [INFO ] Deduced a trap composed of 204 places in 164 ms of which 2 ms to minimize.
[2024-06-01 15:06:04] [INFO ] Deduced a trap composed of 191 places in 158 ms of which 2 ms to minimize.
[2024-06-01 15:06:05] [INFO ] Deduced a trap composed of 249 places in 195 ms of which 2 ms to minimize.
[2024-06-01 15:06:05] [INFO ] Deduced a trap composed of 217 places in 162 ms of which 2 ms to minimize.
[2024-06-01 15:06:05] [INFO ] Deduced a trap composed of 222 places in 160 ms of which 2 ms to minimize.
[2024-06-01 15:06:05] [INFO ] Deduced a trap composed of 215 places in 178 ms of which 2 ms to minimize.
[2024-06-01 15:06:05] [INFO ] Deduced a trap composed of 181 places in 166 ms of which 2 ms to minimize.
[2024-06-01 15:06:06] [INFO ] Deduced a trap composed of 204 places in 164 ms of which 2 ms to minimize.
[2024-06-01 15:06:06] [INFO ] Deduced a trap composed of 221 places in 191 ms of which 2 ms to minimize.
[2024-06-01 15:06:06] [INFO ] Deduced a trap composed of 183 places in 163 ms of which 2 ms to minimize.
[2024-06-01 15:06:06] [INFO ] Deduced a trap composed of 207 places in 160 ms of which 2 ms to minimize.
[2024-06-01 15:06:07] [INFO ] Deduced a trap composed of 194 places in 164 ms of which 2 ms to minimize.
[2024-06-01 15:06:07] [INFO ] Deduced a trap composed of 185 places in 121 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 802 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/1184 variables, and 126 constraints, problems are : Problem set: 0 solved, 802 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/396 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/802 constraints, Known Traps: 89/89 constraints]
After SMT, in 40745ms problems are : Problem set: 0 solved, 802 unsolved
Search for dead transitions found 0 dead transitions in 40752ms
[2024-06-01 15:06:09] [INFO ] Flow matrix only has 788 transitions (discarded 16 similar events)
[2024-06-01 15:06:09] [INFO ] Invariant cache hit.
[2024-06-01 15:06:10] [INFO ] Implicit Places using invariants in 369 ms returned []
[2024-06-01 15:06:10] [INFO ] Flow matrix only has 788 transitions (discarded 16 similar events)
[2024-06-01 15:06:10] [INFO ] Invariant cache hit.
[2024-06-01 15:06:10] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 15:06:13] [INFO ] Implicit Places using invariants and state equation in 3103 ms returned []
Implicit Place search using SMT with State Equation took 3473 ms to find 0 implicit places.
[2024-06-01 15:06:13] [INFO ] Redundant transitions in 14 ms returned []
Running 802 sub problems to find dead transitions.
[2024-06-01 15:06:13] [INFO ] Flow matrix only has 788 transitions (discarded 16 similar events)
[2024-06-01 15:06:13] [INFO ] Invariant cache hit.
[2024-06-01 15:06:13] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 802 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 802 unsolved
[2024-06-01 15:06:18] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-06-01 15:06:18] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-06-01 15:06:18] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 0 ms to minimize.
[2024-06-01 15:06:18] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 0 ms to minimize.
[2024-06-01 15:06:18] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:06:18] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-06-01 15:06:18] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 0 ms to minimize.
[2024-06-01 15:06:18] [INFO ] Deduced a trap composed of 206 places in 168 ms of which 2 ms to minimize.
[2024-06-01 15:06:18] [INFO ] Deduced a trap composed of 200 places in 156 ms of which 2 ms to minimize.
[2024-06-01 15:06:19] [INFO ] Deduced a trap composed of 77 places in 269 ms of which 2 ms to minimize.
[2024-06-01 15:06:19] [INFO ] Deduced a trap composed of 199 places in 153 ms of which 2 ms to minimize.
[2024-06-01 15:06:19] [INFO ] Deduced a trap composed of 220 places in 159 ms of which 2 ms to minimize.
[2024-06-01 15:06:19] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 3 ms to minimize.
[2024-06-01 15:06:19] [INFO ] Deduced a trap composed of 191 places in 156 ms of which 2 ms to minimize.
[2024-06-01 15:06:19] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 2 ms to minimize.
[2024-06-01 15:06:20] [INFO ] Deduced a trap composed of 258 places in 165 ms of which 2 ms to minimize.
[2024-06-01 15:06:20] [INFO ] Deduced a trap composed of 213 places in 177 ms of which 2 ms to minimize.
[2024-06-01 15:06:20] [INFO ] Deduced a trap composed of 223 places in 172 ms of which 2 ms to minimize.
[2024-06-01 15:06:20] [INFO ] Deduced a trap composed of 204 places in 168 ms of which 2 ms to minimize.
[2024-06-01 15:06:20] [INFO ] Deduced a trap composed of 224 places in 160 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 802 unsolved
[2024-06-01 15:06:21] [INFO ] Deduced a trap composed of 192 places in 135 ms of which 2 ms to minimize.
[2024-06-01 15:06:21] [INFO ] Deduced a trap composed of 50 places in 158 ms of which 2 ms to minimize.
[2024-06-01 15:06:21] [INFO ] Deduced a trap composed of 140 places in 162 ms of which 2 ms to minimize.
[2024-06-01 15:06:22] [INFO ] Deduced a trap composed of 206 places in 158 ms of which 2 ms to minimize.
[2024-06-01 15:06:22] [INFO ] Deduced a trap composed of 215 places in 164 ms of which 2 ms to minimize.
[2024-06-01 15:06:22] [INFO ] Deduced a trap composed of 220 places in 165 ms of which 2 ms to minimize.
[2024-06-01 15:06:22] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 2 ms to minimize.
[2024-06-01 15:06:23] [INFO ] Deduced a trap composed of 189 places in 182 ms of which 2 ms to minimize.
[2024-06-01 15:06:23] [INFO ] Deduced a trap composed of 210 places in 168 ms of which 2 ms to minimize.
[2024-06-01 15:06:23] [INFO ] Deduced a trap composed of 262 places in 155 ms of which 2 ms to minimize.
[2024-06-01 15:06:23] [INFO ] Deduced a trap composed of 224 places in 158 ms of which 3 ms to minimize.
[2024-06-01 15:06:23] [INFO ] Deduced a trap composed of 231 places in 172 ms of which 2 ms to minimize.
[2024-06-01 15:06:23] [INFO ] Deduced a trap composed of 244 places in 154 ms of which 2 ms to minimize.
[2024-06-01 15:06:24] [INFO ] Deduced a trap composed of 265 places in 152 ms of which 2 ms to minimize.
[2024-06-01 15:06:24] [INFO ] Deduced a trap composed of 231 places in 158 ms of which 2 ms to minimize.
[2024-06-01 15:06:24] [INFO ] Deduced a trap composed of 130 places in 159 ms of which 3 ms to minimize.
[2024-06-01 15:06:24] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 2 ms to minimize.
[2024-06-01 15:06:24] [INFO ] Deduced a trap composed of 189 places in 151 ms of which 2 ms to minimize.
[2024-06-01 15:06:25] [INFO ] Deduced a trap composed of 179 places in 154 ms of which 2 ms to minimize.
[2024-06-01 15:06:25] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 802 unsolved
[2024-06-01 15:06:30] [INFO ] Deduced a trap composed of 232 places in 151 ms of which 2 ms to minimize.
[2024-06-01 15:06:31] [INFO ] Deduced a trap composed of 206 places in 141 ms of which 3 ms to minimize.
[2024-06-01 15:06:31] [INFO ] Deduced a trap composed of 224 places in 165 ms of which 3 ms to minimize.
[2024-06-01 15:06:32] [INFO ] Deduced a trap composed of 215 places in 140 ms of which 2 ms to minimize.
[2024-06-01 15:06:32] [INFO ] Deduced a trap composed of 139 places in 154 ms of which 2 ms to minimize.
[2024-06-01 15:06:32] [INFO ] Deduced a trap composed of 116 places in 152 ms of which 2 ms to minimize.
[2024-06-01 15:06:33] [INFO ] Deduced a trap composed of 206 places in 141 ms of which 2 ms to minimize.
[2024-06-01 15:06:33] [INFO ] Deduced a trap composed of 214 places in 145 ms of which 2 ms to minimize.
[2024-06-01 15:06:33] [INFO ] Deduced a trap composed of 214 places in 151 ms of which 2 ms to minimize.
[2024-06-01 15:06:34] [INFO ] Deduced a trap composed of 219 places in 146 ms of which 2 ms to minimize.
[2024-06-01 15:06:34] [INFO ] Deduced a trap composed of 221 places in 157 ms of which 3 ms to minimize.
[2024-06-01 15:06:34] [INFO ] Deduced a trap composed of 216 places in 146 ms of which 2 ms to minimize.
[2024-06-01 15:06:34] [INFO ] Deduced a trap composed of 214 places in 150 ms of which 2 ms to minimize.
[2024-06-01 15:06:34] [INFO ] Deduced a trap composed of 130 places in 138 ms of which 2 ms to minimize.
[2024-06-01 15:06:36] [INFO ] Deduced a trap composed of 194 places in 149 ms of which 2 ms to minimize.
[2024-06-01 15:06:36] [INFO ] Deduced a trap composed of 177 places in 135 ms of which 2 ms to minimize.
[2024-06-01 15:06:37] [INFO ] Deduced a trap composed of 191 places in 145 ms of which 2 ms to minimize.
[2024-06-01 15:06:37] [INFO ] Deduced a trap composed of 179 places in 155 ms of which 2 ms to minimize.
[2024-06-01 15:06:37] [INFO ] Deduced a trap composed of 208 places in 147 ms of which 2 ms to minimize.
[2024-06-01 15:06:37] [INFO ] Deduced a trap composed of 192 places in 161 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 802 unsolved
[2024-06-01 15:06:38] [INFO ] Deduced a trap composed of 186 places in 130 ms of which 2 ms to minimize.
[2024-06-01 15:06:39] [INFO ] Deduced a trap composed of 199 places in 147 ms of which 2 ms to minimize.
[2024-06-01 15:06:39] [INFO ] Deduced a trap composed of 116 places in 151 ms of which 2 ms to minimize.
[2024-06-01 15:06:39] [INFO ] Deduced a trap composed of 211 places in 155 ms of which 2 ms to minimize.
[2024-06-01 15:06:39] [INFO ] Deduced a trap composed of 118 places in 152 ms of which 2 ms to minimize.
[2024-06-01 15:06:39] [INFO ] Deduced a trap composed of 199 places in 153 ms of which 2 ms to minimize.
[2024-06-01 15:06:40] [INFO ] Deduced a trap composed of 119 places in 162 ms of which 2 ms to minimize.
[2024-06-01 15:06:40] [INFO ] Deduced a trap composed of 119 places in 149 ms of which 2 ms to minimize.
[2024-06-01 15:06:40] [INFO ] Deduced a trap composed of 205 places in 166 ms of which 2 ms to minimize.
[2024-06-01 15:06:40] [INFO ] Deduced a trap composed of 200 places in 166 ms of which 2 ms to minimize.
[2024-06-01 15:06:40] [INFO ] Deduced a trap composed of 223 places in 151 ms of which 2 ms to minimize.
[2024-06-01 15:06:40] [INFO ] Deduced a trap composed of 232 places in 188 ms of which 2 ms to minimize.
[2024-06-01 15:06:41] [INFO ] Deduced a trap composed of 237 places in 147 ms of which 2 ms to minimize.
[2024-06-01 15:06:41] [INFO ] Deduced a trap composed of 185 places in 158 ms of which 2 ms to minimize.
[2024-06-01 15:06:42] [INFO ] Deduced a trap composed of 130 places in 133 ms of which 2 ms to minimize.
[2024-06-01 15:06:42] [INFO ] Deduced a trap composed of 202 places in 149 ms of which 2 ms to minimize.
[2024-06-01 15:06:42] [INFO ] Deduced a trap composed of 197 places in 143 ms of which 2 ms to minimize.
[2024-06-01 15:06:43] [INFO ] Deduced a trap composed of 186 places in 142 ms of which 2 ms to minimize.
[2024-06-01 15:06:43] [INFO ] Deduced a trap composed of 197 places in 161 ms of which 2 ms to minimize.
[2024-06-01 15:06:43] [INFO ] Deduced a trap composed of 190 places in 149 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 802 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 394/1184 variables, and 117 constraints, problems are : Problem set: 0 solved, 802 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/396 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 802/802 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 802 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 802 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 802 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 80/117 constraints. Problems are: Problem set: 0 solved, 802 unsolved
[2024-06-01 15:06:48] [INFO ] Deduced a trap composed of 197 places in 145 ms of which 2 ms to minimize.
[2024-06-01 15:06:48] [INFO ] Deduced a trap composed of 198 places in 183 ms of which 2 ms to minimize.
[2024-06-01 15:06:48] [INFO ] Deduced a trap composed of 167 places in 152 ms of which 3 ms to minimize.
[2024-06-01 15:06:49] [INFO ] Deduced a trap composed of 211 places in 168 ms of which 2 ms to minimize.
[2024-06-01 15:06:49] [INFO ] Deduced a trap composed of 192 places in 171 ms of which 3 ms to minimize.
[2024-06-01 15:06:49] [INFO ] Deduced a trap composed of 208 places in 168 ms of which 2 ms to minimize.
[2024-06-01 15:06:49] [INFO ] Deduced a trap composed of 188 places in 177 ms of which 2 ms to minimize.
[2024-06-01 15:06:49] [INFO ] Deduced a trap composed of 187 places in 178 ms of which 2 ms to minimize.
[2024-06-01 15:06:50] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-06-01 15:06:50] [INFO ] Deduced a trap composed of 171 places in 159 ms of which 2 ms to minimize.
[2024-06-01 15:06:51] [INFO ] Deduced a trap composed of 200 places in 160 ms of which 2 ms to minimize.
[2024-06-01 15:06:51] [INFO ] Deduced a trap composed of 198 places in 170 ms of which 2 ms to minimize.
[2024-06-01 15:06:51] [INFO ] Deduced a trap composed of 211 places in 150 ms of which 2 ms to minimize.
[2024-06-01 15:06:51] [INFO ] Deduced a trap composed of 183 places in 168 ms of which 3 ms to minimize.
[2024-06-01 15:06:51] [INFO ] Deduced a trap composed of 193 places in 166 ms of which 2 ms to minimize.
[2024-06-01 15:06:52] [INFO ] Deduced a trap composed of 194 places in 164 ms of which 2 ms to minimize.
[2024-06-01 15:06:52] [INFO ] Deduced a trap composed of 175 places in 158 ms of which 2 ms to minimize.
[2024-06-01 15:06:52] [INFO ] Deduced a trap composed of 203 places in 155 ms of which 2 ms to minimize.
[2024-06-01 15:06:52] [INFO ] Deduced a trap composed of 198 places in 168 ms of which 2 ms to minimize.
[2024-06-01 15:06:52] [INFO ] Deduced a trap composed of 203 places in 162 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 802 unsolved
[2024-06-01 15:06:57] [INFO ] Deduced a trap composed of 197 places in 155 ms of which 2 ms to minimize.
[2024-06-01 15:06:57] [INFO ] Deduced a trap composed of 170 places in 171 ms of which 2 ms to minimize.
[2024-06-01 15:06:57] [INFO ] Deduced a trap composed of 243 places in 165 ms of which 2 ms to minimize.
[2024-06-01 15:06:57] [INFO ] Deduced a trap composed of 200 places in 152 ms of which 2 ms to minimize.
[2024-06-01 15:06:59] [INFO ] Deduced a trap composed of 212 places in 164 ms of which 2 ms to minimize.
[2024-06-01 15:06:59] [INFO ] Deduced a trap composed of 180 places in 156 ms of which 2 ms to minimize.
[2024-06-01 15:07:00] [INFO ] Deduced a trap composed of 167 places in 140 ms of which 2 ms to minimize.
[2024-06-01 15:07:02] [INFO ] Deduced a trap composed of 186 places in 137 ms of which 2 ms to minimize.
[2024-06-01 15:07:02] [INFO ] Deduced a trap composed of 204 places in 158 ms of which 2 ms to minimize.
[2024-06-01 15:07:02] [INFO ] Deduced a trap composed of 174 places in 150 ms of which 2 ms to minimize.
[2024-06-01 15:07:03] [INFO ] Deduced a trap composed of 197 places in 149 ms of which 2 ms to minimize.
[2024-06-01 15:07:04] [INFO ] Deduced a trap composed of 201 places in 160 ms of which 2 ms to minimize.
[2024-06-01 15:07:04] [INFO ] Deduced a trap composed of 175 places in 139 ms of which 2 ms to minimize.
[2024-06-01 15:07:04] [INFO ] Deduced a trap composed of 211 places in 164 ms of which 2 ms to minimize.
[2024-06-01 15:07:04] [INFO ] Deduced a trap composed of 212 places in 149 ms of which 2 ms to minimize.
[2024-06-01 15:07:04] [INFO ] Deduced a trap composed of 217 places in 163 ms of which 2 ms to minimize.
[2024-06-01 15:07:04] [INFO ] Deduced a trap composed of 217 places in 160 ms of which 2 ms to minimize.
[2024-06-01 15:07:05] [INFO ] Deduced a trap composed of 210 places in 169 ms of which 2 ms to minimize.
[2024-06-01 15:07:05] [INFO ] Deduced a trap composed of 235 places in 174 ms of which 2 ms to minimize.
[2024-06-01 15:07:05] [INFO ] Deduced a trap composed of 232 places in 215 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 802 unsolved
[2024-06-01 15:07:10] [INFO ] Deduced a trap composed of 193 places in 202 ms of which 2 ms to minimize.
[2024-06-01 15:07:10] [INFO ] Deduced a trap composed of 189 places in 185 ms of which 2 ms to minimize.
[2024-06-01 15:07:10] [INFO ] Deduced a trap composed of 198 places in 197 ms of which 3 ms to minimize.
[2024-06-01 15:07:11] [INFO ] Deduced a trap composed of 190 places in 228 ms of which 2 ms to minimize.
[2024-06-01 15:07:11] [INFO ] Deduced a trap composed of 187 places in 151 ms of which 2 ms to minimize.
[2024-06-01 15:07:11] [INFO ] Deduced a trap composed of 269 places in 171 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/1184 variables, and 163 constraints, problems are : Problem set: 0 solved, 802 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/396 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/802 constraints, Known Traps: 126/126 constraints]
After SMT, in 60810ms problems are : Problem set: 0 solved, 802 unsolved
Search for dead transitions found 0 dead transitions in 60820ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 105078 ms. Remains : 396/396 places, 804/804 transitions.
Treatment of property PolyORBLF-PT-S02J04T08-LTLFireability-04 finished in 285093 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)))'
[2024-06-01 15:07:14] [INFO ] Flatten gal took : 98 ms
[2024-06-01 15:07:14] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2024-06-01 15:07:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 592 places, 1102 transitions and 4778 arcs took 12 ms.
Total runtime 2067680 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-01 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-04 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : PolyORBLF-PT-S02J04T08-LTLFireability-05

BK_STOP 1717255029921

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name PolyORBLF-PT-S02J04T08-LTLFireability-01
ltl formula formula --ltl=/tmp/6015/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 592 places, 1102 transitions and 4778 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.320 real 0.030 user 0.050 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/6015/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/6015/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/6015/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/6015/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 607 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 593, there are 1107 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~93 levels ~10000 states ~34224 transitions
pnml2lts-mc( 2/ 4): ~93 levels ~20000 states ~80168 transitions
pnml2lts-mc( 2/ 4): ~98 levels ~40000 states ~162800 transitions
pnml2lts-mc( 2/ 4): ~98 levels ~80000 states ~347420 transitions
pnml2lts-mc( 2/ 4): ~98 levels ~160000 states ~706088 transitions
pnml2lts-mc( 2/ 4): ~98 levels ~320000 states ~1452408 transitions
pnml2lts-mc( 2/ 4): ~98 levels ~640000 states ~2952664 transitions
pnml2lts-mc( 2/ 4): ~98 levels ~1280000 states ~5986544 transitions
pnml2lts-mc( 2/ 4): ~176 levels ~2560000 states ~11788632 transitions
pnml2lts-mc( 2/ 4): ~264 levels ~5120000 states ~23669992 transitions
pnml2lts-mc( 1/ 4): ~190 levels ~10240000 states ~50885812 transitions
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~251!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 13997196
pnml2lts-mc( 0/ 4): unique states count: 13999060
pnml2lts-mc( 0/ 4): unique transitions count: 66330325
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 52329427
pnml2lts-mc( 0/ 4): - claim found count: 2
pnml2lts-mc( 0/ 4): - claim success count: 13999543
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1932
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 13999543 states 66332862 transitions, fanout: 4.738
pnml2lts-mc( 0/ 4): Total exploration time 289.480 sec (289.470 sec minimum, 289.478 sec on average)
pnml2lts-mc( 0/ 4): States per second: 48361, Transitions per second: 229145
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 153.6MB, 11.5 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 41.0%/73.0%
pnml2lts-mc( 0/ 4): Stored 1132 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 153.6MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S02J04T08-LTLFireability-04
ltl formula formula --ltl=/tmp/6015/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 592 places, 1102 transitions and 4778 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.150 real 0.050 user 0.050 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/6015/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/6015/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/6015/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/6015/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 606 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 593, there are 1137 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~61 levels ~10000 states ~12240 transitions
pnml2lts-mc( 3/ 4): ~61 levels ~20000 states ~25056 transitions
pnml2lts-mc( 3/ 4): ~61 levels ~40000 states ~53904 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 66199
pnml2lts-mc( 0/ 4): unique states count: 66199
pnml2lts-mc( 0/ 4): unique transitions count: 89510
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 23421
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 66386
pnml2lts-mc( 0/ 4): - cum. max stack depth: 266
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 66386 states 90036 transitions, fanout: 1.356
pnml2lts-mc( 0/ 4): Total exploration time 1.580 sec (1.580 sec minimum, 1.580 sec on average)
pnml2lts-mc( 0/ 4): States per second: 42016, Transitions per second: 56985
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.3MB, 19.9 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 1132 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.3MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S02J04T08-LTLFireability-05
ltl formula formula --ltl=/tmp/6015/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 592 places, 1102 transitions and 4778 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.150 real 0.070 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/6015/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/6015/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/6015/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/6015/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 607 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 593, there are 1109 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~39 levels ~10000 states ~34084 transitions
pnml2lts-mc( 1/ 4): ~39 levels ~20000 states ~73072 transitions
pnml2lts-mc( 2/ 4): ~39 levels ~40000 states ~150700 transitions
pnml2lts-mc( 0/ 4): ~91 levels ~80000 states ~324992 transitions
pnml2lts-mc( 0/ 4): ~130 levels ~160000 states ~653988 transitions
pnml2lts-mc( 0/ 4): ~134 levels ~320000 states ~1265524 transitions
pnml2lts-mc( 0/ 4): ~134 levels ~640000 states ~2530056 transitions
pnml2lts-mc( 0/ 4): ~134 levels ~1280000 states ~5495600 transitions
pnml2lts-mc( 0/ 4): ~134 levels ~2560000 states ~11350764 transitions
pnml2lts-mc( 0/ 4): ~138 levels ~5120000 states ~23321192 transitions
pnml2lts-mc( 0/ 4): ~178 levels ~10240000 states ~48223744 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 11737674
pnml2lts-mc( 0/ 4): unique states count: 11738203
pnml2lts-mc( 0/ 4): unique transitions count: 56256689
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 44520519
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 11740121
pnml2lts-mc( 0/ 4): - cum. max stack depth: 756
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 11740121 states 56267133 transitions, fanout: 4.793
pnml2lts-mc( 0/ 4): Total exploration time 302.160 sec (302.130 sec minimum, 302.140 sec on average)
pnml2lts-mc( 0/ 4): States per second: 38854, Transitions per second: 186216
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 153.6MB, 13.7 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 34.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1132 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 153.6MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S02J04T08"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBLF-PT-S02J04T08, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654446600228"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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