Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-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 itstools
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 r290-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 1716913372428

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J04T08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-28 16:22:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 16:22:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 16:22:54] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2024-05-28 16:22:54] [INFO ] Transformed 614 places.
[2024-05-28 16:22:54] [INFO ] Transformed 1242 transitions.
[2024-05-28 16:22:54] [INFO ] Parsed PT model containing 614 places and 1242 transitions and 5732 arcs in 207 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 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 97 ms. Remains 600 /614 variables (removed 14) and now considering 1102/1114 (removed 12) transitions.
Running 1100 sub problems to find dead transitions.
[2024-05-28 16:22:54] [INFO ] Flow matrix only has 1086 transitions (discarded 16 similar events)
// Phase 1: matrix 1086 rows 600 cols
[2024-05-28 16:22:54] [INFO ] Computed 48 invariants in 56 ms
[2024-05-28 16:22:54] [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-05-28 16:23:05] [INFO ] Deduced a trap composed of 66 places in 217 ms of which 27 ms to minimize.
[2024-05-28 16:23:06] [INFO ] Deduced a trap composed of 19 places in 193 ms of which 3 ms to minimize.
[2024-05-28 16:23:06] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:23:06] [INFO ] Deduced a trap composed of 66 places in 42 ms of which 1 ms to minimize.
[2024-05-28 16:23:06] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:23:06] [INFO ] Deduced a trap composed of 64 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:23:06] [INFO ] Deduced a trap composed of 64 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:23:06] [INFO ] Deduced a trap composed of 163 places in 211 ms of which 4 ms to minimize.
[2024-05-28 16:23:07] [INFO ] Deduced a trap composed of 298 places in 245 ms of which 4 ms to minimize.
[2024-05-28 16:23:07] [INFO ] Deduced a trap composed of 63 places in 40 ms of which 0 ms to minimize.
[2024-05-28 16:23:07] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:23:08] [INFO ] Deduced a trap composed of 398 places in 313 ms of which 5 ms to minimize.
[2024-05-28 16:23:08] [INFO ] Deduced a trap composed of 329 places in 278 ms of which 4 ms to minimize.
[2024-05-28 16:23:08] [INFO ] Deduced a trap composed of 409 places in 320 ms of which 4 ms to minimize.
[2024-05-28 16:23:09] [INFO ] Deduced a trap composed of 320 places in 288 ms of which 4 ms to minimize.
[2024-05-28 16:23:09] [INFO ] Deduced a trap composed of 295 places in 286 ms of which 5 ms to minimize.
[2024-05-28 16:23:10] [INFO ] Deduced a trap composed of 79 places in 173 ms of which 3 ms to minimize.
[2024-05-28 16:23:10] [INFO ] Deduced a trap composed of 324 places in 377 ms of which 5 ms to minimize.
[2024-05-28 16:23:11] [INFO ] Deduced a trap composed of 269 places in 354 ms of which 4 ms to minimize.
[2024-05-28 16:23:14] [INFO ] Deduced a trap composed of 54 places in 334 ms of which 5 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
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 598/1686 variables, and 66 constraints, problems are : Problem set: 0 solved, 1100 unsolved in 20023 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 41723ms problems are : Problem set: 0 solved, 1100 unsolved
Search for dead transitions found 0 dead transitions in 41763ms
[2024-05-28 16:23:36] [INFO ] Flow matrix only has 1086 transitions (discarded 16 similar events)
[2024-05-28 16:23:36] [INFO ] Invariant cache hit.
[2024-05-28 16:23:36] [INFO ] Implicit Places using invariants in 582 ms returned [108, 181, 289, 301, 422, 490, 518, 530]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 596 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 24 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 42524 ms. Remains : 592/614 places, 1102/1114 transitions.
Support contains 140 out of 592 places after structural reductions.
[2024-05-28 16:23:37] [INFO ] Flatten gal took : 190 ms
[2024-05-28 16:23:37] [INFO ] Flatten gal took : 102 ms
[2024-05-28 16:23:37] [INFO ] Input system was already deterministic with 1102 transitions.
RANDOM walk for 40000 steps (13 resets) in 1527 ms. (26 steps per ms) remains 1/19 properties
BEST_FIRST walk for 40001 steps (9 resets) in 274 ms. (145 steps per ms) remains 1/1 properties
[2024-05-28 16:23:38] [INFO ] Flow matrix only has 1086 transitions (discarded 16 similar events)
// Phase 1: matrix 1086 rows 592 cols
[2024-05-28 16:23:38] [INFO ] Computed 40 invariants in 28 ms
[2024-05-28 16:23:38] [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-05-28 16:23:38] [INFO ] Deduced a trap composed of 64 places in 159 ms of which 3 ms to minimize.
[2024-05-28 16:23:38] [INFO ] Deduced a trap composed of 64 places in 113 ms of which 2 ms to minimize.
[2024-05-28 16:23:38] [INFO ] Deduced a trap composed of 67 places in 90 ms of which 1 ms to minimize.
[2024-05-28 16:23:38] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 1 ms to minimize.
[2024-05-28 16:23:38] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:23:38] [INFO ] Deduced a trap composed of 64 places in 38 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-05-28 16:23:38] [INFO ] Deduced a trap composed of 64 places in 39 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 1641 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 1583 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 3269ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 98 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 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 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 5 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 257 ms. Remains 382 /592 variables (removed 210) and now considering 892/1102 (removed 210) transitions.
Running 890 sub problems to find dead transitions.
[2024-05-28 16:23:41] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
// Phase 1: matrix 876 rows 382 cols
[2024-05-28 16:23:41] [INFO ] Computed 40 invariants in 19 ms
[2024-05-28 16:23:41] [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-05-28 16:23:48] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 3 ms to minimize.
[2024-05-28 16:23:48] [INFO ] Deduced a trap composed of 41 places in 172 ms of which 2 ms to minimize.
[2024-05-28 16:23:48] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 3 ms to minimize.
[2024-05-28 16:23:48] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:23:49] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:23:49] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 2 ms to minimize.
[2024-05-28 16:23:49] [INFO ] Deduced a trap composed of 55 places in 105 ms of which 3 ms to minimize.
[2024-05-28 16:23:49] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:23:49] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:23:49] [INFO ] Deduced a trap composed of 38 places in 264 ms of which 3 ms to minimize.
[2024-05-28 16:23:50] [INFO ] Deduced a trap composed of 39 places in 209 ms of which 3 ms to minimize.
[2024-05-28 16:23:50] [INFO ] Deduced a trap composed of 65 places in 215 ms of which 3 ms to minimize.
[2024-05-28 16:23:50] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 2 ms to minimize.
[2024-05-28 16:23:50] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 1 ms to minimize.
[2024-05-28 16:23:51] [INFO ] Deduced a trap composed of 218 places in 219 ms of which 2 ms to minimize.
[2024-05-28 16:23:52] [INFO ] Deduced a trap composed of 144 places in 226 ms of which 3 ms to minimize.
[2024-05-28 16:23:53] [INFO ] Deduced a trap composed of 137 places in 206 ms of which 2 ms to minimize.
[2024-05-28 16:23:55] [INFO ] Deduced a trap composed of 140 places in 267 ms of which 3 ms to minimize.
[2024-05-28 16:23:56] [INFO ] Deduced a trap composed of 150 places in 271 ms of which 3 ms to minimize.
[2024-05-28 16:23:56] [INFO ] Deduced a trap composed of 161 places in 252 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-05-28 16:24:01] [INFO ] Deduced a trap composed of 125 places in 227 ms of which 3 ms to minimize.
[2024-05-28 16:24:03] [INFO ] Deduced a trap composed of 180 places in 252 ms of which 3 ms to minimize.
[2024-05-28 16:24:03] [INFO ] Deduced a trap composed of 166 places in 231 ms of which 3 ms to minimize.
[2024-05-28 16:24:03] [INFO ] Deduced a trap composed of 124 places in 222 ms of which 3 ms to minimize.
SMT process timed out in 22220ms, After SMT, problems are : Problem set: 0 solved, 890 unsolved
Search for dead transitions found 0 dead transitions in 22237ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22498 ms. Remains : 382/592 places, 892/1102 transitions.
RANDOM walk for 40000 steps (17 resets) in 436 ms. (91 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (10 resets) in 182 ms. (218 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 252915 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 1
Probabilistic random walk after 252915 steps, saw 152780 distinct states, run finished after 3008 ms. (steps per millisecond=84 ) properties seen :0
[2024-05-28 16:24:07] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2024-05-28 16:24:07] [INFO ] Invariant cache hit.
[2024-05-28 16:24:07] [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-05-28 16:24:07] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 2 ms to minimize.
[2024-05-28 16:24:07] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 2 ms to minimize.
[2024-05-28 16:24:07] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 2 ms to minimize.
[2024-05-28 16:24:07] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 2 ms to minimize.
[2024-05-28 16:24:07] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:24:07] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:24:07] [INFO ] Deduced a trap composed of 39 places in 36 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 2565 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-05-28 16:24:09] [INFO ] Deduced a trap composed of 38 places in 49 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 1590 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 4167ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 261 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 36 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 36 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 31 ms. Remains 382 /382 variables (removed 0) and now considering 892/892 (removed 0) transitions.
[2024-05-28 16:24:11] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2024-05-28 16:24:11] [INFO ] Invariant cache hit.
[2024-05-28 16:24:12] [INFO ] Implicit Places using invariants in 523 ms returned []
[2024-05-28 16:24:12] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2024-05-28 16:24:12] [INFO ] Invariant cache hit.
[2024-05-28 16:24:12] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 16:24:16] [INFO ] Implicit Places using invariants and state equation in 4477 ms returned []
Implicit Place search using SMT with State Equation took 5002 ms to find 0 implicit places.
[2024-05-28 16:24:16] [INFO ] Redundant transitions in 47 ms returned []
Running 890 sub problems to find dead transitions.
[2024-05-28 16:24:16] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2024-05-28 16:24:16] [INFO ] Invariant cache hit.
[2024-05-28 16:24:16] [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-05-28 16:24:23] [INFO ] Deduced a trap composed of 19 places in 225 ms of which 2 ms to minimize.
[2024-05-28 16:24:23] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 2 ms to minimize.
[2024-05-28 16:24:23] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:24:23] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 6 ms to minimize.
[2024-05-28 16:24:23] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 2 ms to minimize.
[2024-05-28 16:24:23] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:24:23] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:24:24] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:24:24] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:24:24] [INFO ] Deduced a trap composed of 66 places in 260 ms of which 3 ms to minimize.
[2024-05-28 16:24:25] [INFO ] Deduced a trap composed of 134 places in 257 ms of which 3 ms to minimize.
[2024-05-28 16:24:26] [INFO ] Deduced a trap composed of 218 places in 260 ms of which 3 ms to minimize.
[2024-05-28 16:24:26] [INFO ] Deduced a trap composed of 127 places in 238 ms of which 3 ms to minimize.
[2024-05-28 16:24:30] [INFO ] Deduced a trap composed of 132 places in 244 ms of which 3 ms to minimize.
[2024-05-28 16:24:30] [INFO ] Deduced a trap composed of 162 places in 229 ms of which 3 ms to minimize.
[2024-05-28 16:24:30] [INFO ] Deduced a trap composed of 133 places in 198 ms of which 2 ms to minimize.
[2024-05-28 16:24:32] [INFO ] Deduced a trap composed of 184 places in 269 ms of which 3 ms to minimize.
[2024-05-28 16:24:32] [INFO ] Deduced a trap composed of 55 places in 135 ms of which 2 ms to minimize.
[2024-05-28 16:24:33] [INFO ] Deduced a trap composed of 168 places in 231 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
SMT process timed out in 31999ms, After SMT, problems are : Problem set: 0 solved, 890 unsolved
Search for dead transitions found 0 dead transitions in 32021ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37116 ms. Remains : 382/382 places, 892/892 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 382 transition count 876
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 32 place count 374 transition count 908
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 1 with 32 rules applied. Total rules applied 64 place count 374 transition count 876
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 72 place count 374 transition count 868
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 80 place count 366 transition count 868
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 88 place count 366 transition count 860
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 96 place count 358 transition count 860
Applied a total of 96 rules in 98 ms. Remains 358 /382 variables (removed 24) and now considering 860/892 (removed 32) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 860 rows 358 cols
[2024-05-28 16:24:48] [INFO ] Computed 40 invariants in 15 ms
[2024-05-28 16:24:48] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2024-05-28 16:24:48] [INFO ] [Real]Absence check using 15 positive and 25 generalized place invariants in 24 ms returned sat
[2024-05-28 16:24:49] [INFO ] After 694ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 16:24:49] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-05-28 16:24:49] [INFO ] [Nat]Absence check using 15 positive and 25 generalized place invariants in 17 ms returned sat
[2024-05-28 16:24:50] [INFO ] After 609ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 16:24:50] [INFO ] After 712ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-28 16:24:50] [INFO ] After 862ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1702 ms.
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 67 ms. Remains 588 /592 variables (removed 4) and now considering 1098/1102 (removed 4) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-28 16:24:50] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 588 cols
[2024-05-28 16:24:50] [INFO ] Computed 40 invariants in 14 ms
[2024-05-28 16:24:50] [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-05-28 16:25:02] [INFO ] Deduced a trap composed of 19 places in 217 ms of which 7 ms to minimize.
[2024-05-28 16:25:02] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 1 ms to minimize.
[2024-05-28 16:25:02] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:25:02] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 5 ms to minimize.
[2024-05-28 16:25:02] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 2 ms to minimize.
[2024-05-28 16:25:02] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 2 ms to minimize.
[2024-05-28 16:25:03] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:25:03] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 1 ms to minimize.
[2024-05-28 16:25:03] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:25:03] [INFO ] Deduced a trap composed of 114 places in 254 ms of which 3 ms to minimize.
[2024-05-28 16:25:04] [INFO ] Deduced a trap composed of 162 places in 412 ms of which 4 ms to minimize.
[2024-05-28 16:25:04] [INFO ] Deduced a trap composed of 406 places in 352 ms of which 5 ms to minimize.
[2024-05-28 16:25:05] [INFO ] Deduced a trap composed of 79 places in 194 ms of which 3 ms to minimize.
[2024-05-28 16:25:06] [INFO ] Deduced a trap composed of 300 places in 356 ms of which 4 ms to minimize.
[2024-05-28 16:25:08] [INFO ] Deduced a trap composed of 294 places in 352 ms of which 5 ms to minimize.
[2024-05-28 16:25:09] [INFO ] Deduced a trap composed of 299 places in 358 ms of which 4 ms to minimize.
[2024-05-28 16:25:09] [INFO ] Deduced a trap composed of 269 places in 313 ms of which 4 ms to minimize.
[2024-05-28 16:25:11] [INFO ] Deduced a trap composed of 323 places in 322 ms of which 5 ms to minimize.
[2024-05-28 16:25:11] [INFO ] Deduced a trap composed of 339 places in 265 ms of which 4 ms to minimize.
[2024-05-28 16:25:11] [INFO ] Deduced a trap composed of 305 places in 222 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 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: 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 20021 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 41521ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41539ms
[2024-05-28 16:25:32] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 16:25:32] [INFO ] Invariant cache hit.
[2024-05-28 16:25:33] [INFO ] Implicit Places using invariants in 697 ms returned []
[2024-05-28 16:25:33] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 16:25:33] [INFO ] Invariant cache hit.
[2024-05-28 16:25:33] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 16:25:41] [INFO ] Implicit Places using invariants and state equation in 8630 ms returned []
Implicit Place search using SMT with State Equation took 9330 ms to find 0 implicit places.
Running 1096 sub problems to find dead transitions.
[2024-05-28 16:25:41] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 16:25:41] [INFO ] Invariant cache hit.
[2024-05-28 16:25:41] [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-05-28 16:25:52] [INFO ] Deduced a trap composed of 19 places in 204 ms of which 3 ms to minimize.
[2024-05-28 16:25:52] [INFO ] Deduced a trap composed of 64 places in 109 ms of which 3 ms to minimize.
[2024-05-28 16:25:53] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 1 ms to minimize.
[2024-05-28 16:25:53] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 2 ms to minimize.
[2024-05-28 16:25:53] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 1 ms to minimize.
[2024-05-28 16:25:53] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:25:53] [INFO ] Deduced a trap composed of 64 places in 104 ms of which 1 ms to minimize.
[2024-05-28 16:25:54] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 2 ms to minimize.
[2024-05-28 16:25:54] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:25:54] [INFO ] Deduced a trap composed of 162 places in 321 ms of which 4 ms to minimize.
[2024-05-28 16:25:55] [INFO ] Deduced a trap composed of 396 places in 323 ms of which 4 ms to minimize.
[2024-05-28 16:25:55] [INFO ] Deduced a trap composed of 394 places in 258 ms of which 4 ms to minimize.
[2024-05-28 16:25:56] [INFO ] Deduced a trap composed of 79 places in 197 ms of which 3 ms to minimize.
[2024-05-28 16:25:57] [INFO ] Deduced a trap composed of 326 places in 345 ms of which 4 ms to minimize.
[2024-05-28 16:25:57] [INFO ] Deduced a trap composed of 269 places in 303 ms of which 4 ms to minimize.
[2024-05-28 16:25:59] [INFO ] Deduced a trap composed of 269 places in 303 ms of which 4 ms to minimize.
[2024-05-28 16:26:01] [INFO ] Deduced a trap composed of 3 places in 342 ms of which 5 ms to minimize.
[2024-05-28 16:26:02] [INFO ] Deduced a trap composed of 302 places in 331 ms of which 5 ms to minimize.
[2024-05-28 16:26:02] [INFO ] Deduced a trap composed of 294 places in 315 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 19/57 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 57 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30026 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-05-28 16:26:34] [INFO ] Deduced a trap composed of 375 places in 284 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 30026 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 61300ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 61323ms
Starting structural reductions in LTL mode, iteration 1 : 588/592 places, 1098/1102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112269 ms. Remains : 588/592 places, 1098/1102 transitions.
Stuttering acceptance computed with spot in 315 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 5 ms.
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T08-LTLFireability-00 finished in 112671 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 110 ms. Remains 430 /592 variables (removed 162) and now considering 940/1102 (removed 162) transitions.
Running 938 sub problems to find dead transitions.
[2024-05-28 16:26:43] [INFO ] Flow matrix only has 924 transitions (discarded 16 similar events)
// Phase 1: matrix 924 rows 430 cols
[2024-05-28 16:26:43] [INFO ] Computed 40 invariants in 17 ms
[2024-05-28 16:26:43] [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-05-28 16:26:50] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 2 ms to minimize.
[2024-05-28 16:26:50] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:26:50] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 1 ms to minimize.
[2024-05-28 16:26:50] [INFO ] Deduced a trap composed of 45 places in 37 ms of which 0 ms to minimize.
[2024-05-28 16:26:50] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 1 ms to minimize.
[2024-05-28 16:26:50] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 0 ms to minimize.
[2024-05-28 16:26:50] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:26:51] [INFO ] Deduced a trap composed of 70 places in 238 ms of which 3 ms to minimize.
[2024-05-28 16:26:51] [INFO ] Deduced a trap composed of 95 places in 211 ms of which 3 ms to minimize.
[2024-05-28 16:26:51] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:26:51] [INFO ] Deduced a trap composed of 178 places in 257 ms of which 3 ms to minimize.
[2024-05-28 16:26:52] [INFO ] Deduced a trap composed of 166 places in 239 ms of which 4 ms to minimize.
[2024-05-28 16:26:52] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 3 ms to minimize.
[2024-05-28 16:26:52] [INFO ] Deduced a trap composed of 63 places in 155 ms of which 2 ms to minimize.
[2024-05-28 16:26:53] [INFO ] Deduced a trap composed of 156 places in 265 ms of which 3 ms to minimize.
[2024-05-28 16:26:54] [INFO ] Deduced a trap composed of 190 places in 242 ms of which 3 ms to minimize.
[2024-05-28 16:26:54] [INFO ] Deduced a trap composed of 158 places in 213 ms of which 3 ms to minimize.
[2024-05-28 16:26:56] [INFO ] Deduced a trap composed of 266 places in 265 ms of which 4 ms to minimize.
[2024-05-28 16:27:01] [INFO ] Deduced a trap composed of 234 places in 241 ms of which 3 ms to minimize.
[2024-05-28 16:27:02] [INFO ] Deduced a trap composed of 207 places in 213 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/428 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 938 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.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 8.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 1.0)
(s41 0.0)
(s42 8.0)
(s43 0.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 0.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 0.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 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 1.0)
(s100 0.0)
(s101 0.0)
(s102 0.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 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)timeout
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 58 constraints, problems are : Problem set: 0 solved, 938 unsolved in 20020 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-05-28 16:27:23] [INFO ] Deduced a trap composed of 173 places in 262 ms of which 3 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 20030 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 41412ms problems are : Problem set: 0 solved, 938 unsolved
Search for dead transitions found 0 dead transitions in 41425ms
[2024-05-28 16:27:24] [INFO ] Flow matrix only has 924 transitions (discarded 16 similar events)
[2024-05-28 16:27:24] [INFO ] Invariant cache hit.
[2024-05-28 16:27:25] [INFO ] Implicit Places using invariants in 439 ms returned []
[2024-05-28 16:27:25] [INFO ] Flow matrix only has 924 transitions (discarded 16 similar events)
[2024-05-28 16:27:25] [INFO ] Invariant cache hit.
[2024-05-28 16:27:25] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 16:27:32] [INFO ] Implicit Places using invariants and state equation in 6821 ms returned []
Implicit Place search using SMT with State Equation took 7264 ms to find 0 implicit places.
[2024-05-28 16:27:32] [INFO ] Redundant transitions in 44 ms returned []
Running 938 sub problems to find dead transitions.
[2024-05-28 16:27:32] [INFO ] Flow matrix only has 924 transitions (discarded 16 similar events)
[2024-05-28 16:27:32] [INFO ] Invariant cache hit.
[2024-05-28 16:27:32] [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-05-28 16:27:39] [INFO ] Deduced a trap composed of 49 places in 222 ms of which 3 ms to minimize.
[2024-05-28 16:27:39] [INFO ] Deduced a trap composed of 85 places in 183 ms of which 3 ms to minimize.
[2024-05-28 16:27:39] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:27:39] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 4 ms to minimize.
[2024-05-28 16:27:39] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:27:39] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 0 ms to minimize.
[2024-05-28 16:27:39] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:27:40] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:27:40] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:27:40] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:27:40] [INFO ] Deduced a trap composed of 19 places in 228 ms of which 3 ms to minimize.
[2024-05-28 16:27:40] [INFO ] Deduced a trap composed of 268 places in 234 ms of which 3 ms to minimize.
[2024-05-28 16:27:41] [INFO ] Deduced a trap composed of 63 places in 157 ms of which 3 ms to minimize.
[2024-05-28 16:27:42] [INFO ] Deduced a trap composed of 177 places in 272 ms of which 3 ms to minimize.
[2024-05-28 16:27:42] [INFO ] Deduced a trap composed of 158 places in 264 ms of which 3 ms to minimize.
[2024-05-28 16:27:44] [INFO ] Deduced a trap composed of 282 places in 234 ms of which 3 ms to minimize.
[2024-05-28 16:27:44] [INFO ] Deduced a trap composed of 278 places in 209 ms of which 3 ms to minimize.
[2024-05-28 16:27:45] [INFO ] Deduced a trap composed of 222 places in 249 ms of which 4 ms to minimize.
[2024-05-28 16:27:46] [INFO ] Deduced a trap composed of 184 places in 257 ms of which 4 ms to minimize.
[2024-05-28 16:27:46] [INFO ] Deduced a trap composed of 174 places in 253 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/428 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 938 unsolved
[2024-05-28 16:27:48] [INFO ] Deduced a trap composed of 173 places in 252 ms of which 3 ms to minimize.
[2024-05-28 16:27:56] [INFO ] Deduced a trap composed of 235 places in 187 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
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 428/1354 variables, and 60 constraints, problems are : Problem set: 0 solved, 938 unsolved in 30034 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: 22/22 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, 22/60 constraints. Problems are: Problem set: 0 solved, 938 unsolved
[2024-05-28 16:28:10] [INFO ] Deduced a trap composed of 221 places in 290 ms of which 4 ms to minimize.
[2024-05-28 16:28:11] [INFO ] Deduced a trap composed of 192 places in 257 ms of which 3 ms to minimize.
[2024-05-28 16:28:11] [INFO ] Deduced a trap composed of 196 places in 254 ms of which 3 ms to minimize.
[2024-05-28 16:28:13] [INFO ] Deduced a trap composed of 212 places in 247 ms of which 3 ms to minimize.
[2024-05-28 16:28:13] [INFO ] Deduced a trap composed of 193 places in 229 ms of which 3 ms to minimize.
[2024-05-28 16:28:13] [INFO ] Deduced a trap composed of 198 places in 253 ms of which 4 ms to minimize.
[2024-05-28 16:28:13] [INFO ] Deduced a trap composed of 197 places in 222 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/428 variables, 7/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 30020 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 61467ms problems are : Problem set: 0 solved, 938 unsolved
Search for dead transitions found 0 dead transitions in 61489ms
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 110353 ms. Remains : 430/592 places, 940/1102 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S02J04T08-LTLFireability-01
Product exploration explored 100000 steps with 10799 reset in 541 ms.
Product exploration explored 100000 steps with 10778 reset in 420 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 158 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 84 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 9 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 196 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 82 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (NOT p1)]
[2024-05-28 16:28:35] [INFO ] Flow matrix only has 924 transitions (discarded 16 similar events)
[2024-05-28 16:28:35] [INFO ] Invariant cache hit.
[2024-05-28 16:28:35] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-05-28 16:28:36] [INFO ] [Real]Absence check using 12 positive and 28 generalized place invariants in 118 ms returned sat
[2024-05-28 16:28:37] [INFO ] [Real]Absence check using state equation in 1709 ms returned sat
[2024-05-28 16:28:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:28:38] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-05-28 16:28:38] [INFO ] [Nat]Absence check using 12 positive and 28 generalized place invariants in 78 ms returned sat
[2024-05-28 16:28:40] [INFO ] [Nat]Absence check using state equation in 1613 ms returned sat
[2024-05-28 16:28:40] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 16:28:40] [INFO ] [Nat]Added 96 Read/Feed constraints in 272 ms returned sat
[2024-05-28 16:28:40] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 1 ms to minimize.
[2024-05-28 16:28:40] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 1 ms to minimize.
[2024-05-28 16:28:41] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 2 ms to minimize.
[2024-05-28 16:28:41] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:28:41] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:28:42] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:28:42] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2516 ms
[2024-05-28 16:28:43] [INFO ] Computed and/alt/rep : 402/1341/394 causal constraints (skipped 528 transitions) in 107 ms.
[2024-05-28 16:28:46] [INFO ] Added : 133 causal constraints over 27 iterations in 3629 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 41 ms. Remains 430 /430 variables (removed 0) and now considering 940/940 (removed 0) transitions.
Running 938 sub problems to find dead transitions.
[2024-05-28 16:28:46] [INFO ] Flow matrix only has 924 transitions (discarded 16 similar events)
[2024-05-28 16:28:46] [INFO ] Invariant cache hit.
[2024-05-28 16:28:46] [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-05-28 16:28:53] [INFO ] Deduced a trap composed of 49 places in 242 ms of which 3 ms to minimize.
[2024-05-28 16:28:54] [INFO ] Deduced a trap composed of 85 places in 224 ms of which 3 ms to minimize.
[2024-05-28 16:28:54] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:28:54] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:28:54] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:28:54] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:28:54] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:28:54] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:28:54] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:28:54] [INFO ] Deduced a trap composed of 45 places in 37 ms of which 0 ms to minimize.
[2024-05-28 16:28:55] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 3 ms to minimize.
[2024-05-28 16:28:55] [INFO ] Deduced a trap composed of 268 places in 188 ms of which 3 ms to minimize.
[2024-05-28 16:28:55] [INFO ] Deduced a trap composed of 63 places in 131 ms of which 2 ms to minimize.
[2024-05-28 16:28:56] [INFO ] Deduced a trap composed of 177 places in 259 ms of which 3 ms to minimize.
[2024-05-28 16:28:56] [INFO ] Deduced a trap composed of 158 places in 221 ms of which 3 ms to minimize.
[2024-05-28 16:28:58] [INFO ] Deduced a trap composed of 282 places in 239 ms of which 4 ms to minimize.
[2024-05-28 16:28:59] [INFO ] Deduced a trap composed of 278 places in 266 ms of which 3 ms to minimize.
[2024-05-28 16:29:00] [INFO ] Deduced a trap composed of 222 places in 254 ms of which 3 ms to minimize.
[2024-05-28 16:29:00] [INFO ] Deduced a trap composed of 184 places in 219 ms of which 3 ms to minimize.
[2024-05-28 16:29:00] [INFO ] Deduced a trap composed of 174 places in 219 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-05-28 16:29:03] [INFO ] Deduced a trap composed of 173 places in 263 ms of which 3 ms to minimize.
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 20034 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-05-28 16:29:15] [INFO ] Deduced a trap composed of 174 places in 265 ms of which 3 ms to minimize.
[2024-05-28 16:29:15] [INFO ] Deduced a trap composed of 228 places in 243 ms of which 3 ms to minimize.
[2024-05-28 16:29:22] [INFO ] Deduced a trap composed of 203 places in 277 ms of which 3 ms to minimize.
[2024-05-28 16:29:22] [INFO ] Deduced a trap composed of 197 places in 215 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 428/1354 variables, and 63 constraints, problems are : Problem set: 0 solved, 938 unsolved in 20017 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: 25/25 constraints]
After SMT, in 41630ms problems are : Problem set: 0 solved, 938 unsolved
Search for dead transitions found 0 dead transitions in 41648ms
[2024-05-28 16:29:28] [INFO ] Flow matrix only has 924 transitions (discarded 16 similar events)
[2024-05-28 16:29:28] [INFO ] Invariant cache hit.
[2024-05-28 16:29:28] [INFO ] Implicit Places using invariants in 399 ms returned []
[2024-05-28 16:29:28] [INFO ] Flow matrix only has 924 transitions (discarded 16 similar events)
[2024-05-28 16:29:28] [INFO ] Invariant cache hit.
[2024-05-28 16:29:29] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 16:29:35] [INFO ] Implicit Places using invariants and state equation in 6427 ms returned []
Implicit Place search using SMT with State Equation took 6828 ms to find 0 implicit places.
[2024-05-28 16:29:35] [INFO ] Redundant transitions in 10 ms returned []
Running 938 sub problems to find dead transitions.
[2024-05-28 16:29:35] [INFO ] Flow matrix only has 924 transitions (discarded 16 similar events)
[2024-05-28 16:29:35] [INFO ] Invariant cache hit.
[2024-05-28 16:29:35] [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-05-28 16:29:42] [INFO ] Deduced a trap composed of 49 places in 252 ms of which 3 ms to minimize.
[2024-05-28 16:29:43] [INFO ] Deduced a trap composed of 85 places in 223 ms of which 5 ms to minimize.
[2024-05-28 16:29:43] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 2 ms to minimize.
[2024-05-28 16:29:43] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:29:43] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:29:43] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:29:43] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:29:43] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 2 ms to minimize.
[2024-05-28 16:29:43] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:29:43] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:29:44] [INFO ] Deduced a trap composed of 19 places in 211 ms of which 3 ms to minimize.
[2024-05-28 16:29:44] [INFO ] Deduced a trap composed of 268 places in 250 ms of which 4 ms to minimize.
[2024-05-28 16:29:44] [INFO ] Deduced a trap composed of 63 places in 152 ms of which 3 ms to minimize.
[2024-05-28 16:29:45] [INFO ] Deduced a trap composed of 177 places in 257 ms of which 4 ms to minimize.
[2024-05-28 16:29:45] [INFO ] Deduced a trap composed of 158 places in 217 ms of which 3 ms to minimize.
[2024-05-28 16:29:47] [INFO ] Deduced a trap composed of 282 places in 245 ms of which 3 ms to minimize.
[2024-05-28 16:29:48] [INFO ] Deduced a trap composed of 278 places in 217 ms of which 3 ms to minimize.
[2024-05-28 16:29:49] [INFO ] Deduced a trap composed of 222 places in 259 ms of which 3 ms to minimize.
[2024-05-28 16:29:49] [INFO ] Deduced a trap composed of 184 places in 230 ms of which 4 ms to minimize.
[2024-05-28 16:29:49] [INFO ] Deduced a trap composed of 174 places in 226 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/428 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 938 unsolved
[2024-05-28 16:29:51] [INFO ] Deduced a trap composed of 173 places in 200 ms of which 2 ms to minimize.
[2024-05-28 16:30:00] [INFO ] Deduced a trap composed of 235 places in 172 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
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 428/1354 variables, and 60 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: 938/938 constraints, Known Traps: 22/22 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, 22/60 constraints. Problems are: Problem set: 0 solved, 938 unsolved
[2024-05-28 16:30:13] [INFO ] Deduced a trap composed of 221 places in 286 ms of which 4 ms to minimize.
[2024-05-28 16:30:14] [INFO ] Deduced a trap composed of 192 places in 258 ms of which 3 ms to minimize.
[2024-05-28 16:30:14] [INFO ] Deduced a trap composed of 196 places in 232 ms of which 3 ms to minimize.
[2024-05-28 16:30:15] [INFO ] Deduced a trap composed of 212 places in 264 ms of which 3 ms to minimize.
[2024-05-28 16:30:15] [INFO ] Deduced a trap composed of 193 places in 188 ms of which 3 ms to minimize.
[2024-05-28 16:30:15] [INFO ] Deduced a trap composed of 198 places in 223 ms of which 3 ms to minimize.
[2024-05-28 16:30:16] [INFO ] Deduced a trap composed of 197 places in 220 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/428 variables, 7/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 30037 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 61549ms problems are : Problem set: 0 solved, 938 unsolved
Search for dead transitions found 0 dead transitions in 61560ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 110104 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 205 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 104 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 8 steps (0 resets) in 4 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 182 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 92 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1)]
[2024-05-28 16:30:37] [INFO ] Flow matrix only has 924 transitions (discarded 16 similar events)
[2024-05-28 16:30:37] [INFO ] Invariant cache hit.
[2024-05-28 16:30:38] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-05-28 16:30:38] [INFO ] [Real]Absence check using 12 positive and 28 generalized place invariants in 85 ms returned sat
[2024-05-28 16:30:39] [INFO ] [Real]Absence check using state equation in 1579 ms returned sat
[2024-05-28 16:30:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:30:40] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-28 16:30:40] [INFO ] [Nat]Absence check using 12 positive and 28 generalized place invariants in 53 ms returned sat
[2024-05-28 16:30:41] [INFO ] [Nat]Absence check using state equation in 1622 ms returned sat
[2024-05-28 16:30:41] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 16:30:42] [INFO ] [Nat]Added 96 Read/Feed constraints in 277 ms returned sat
[2024-05-28 16:30:42] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:30:42] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 1 ms to minimize.
[2024-05-28 16:30:43] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 2 ms to minimize.
[2024-05-28 16:30:43] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 3 ms to minimize.
[2024-05-28 16:30:43] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:30:44] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 1 ms to minimize.
[2024-05-28 16:30:44] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2802 ms
[2024-05-28 16:30:45] [INFO ] Computed and/alt/rep : 402/1341/394 causal constraints (skipped 528 transitions) in 141 ms.
[2024-05-28 16:30:48] [INFO ] Added : 133 causal constraints over 27 iterations in 3257 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 10568 reset in 545 ms.
Product exploration explored 100000 steps with 10774 reset in 481 ms.
Built C files in :
/tmp/ltsmin13738789928426602090
[2024-05-28 16:30:49] [INFO ] Computing symmetric may disable matrix : 940 transitions.
[2024-05-28 16:30:49] [INFO ] Computation of Complete disable matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:30:49] [INFO ] Computing symmetric may enable matrix : 940 transitions.
[2024-05-28 16:30:49] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:30:49] [INFO ] Computing Do-Not-Accords matrix : 940 transitions.
[2024-05-28 16:30:49] [INFO ] Computation of Completed DNA matrix. took 59 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:30:49] [INFO ] Built C files in 345ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13738789928426602090
Running compilation step : cd /tmp/ltsmin13738789928426602090;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13738789928426602090;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13738789928426602090;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 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 23 ms. Remains 422 /430 variables (removed 8) and now considering 932/940 (removed 8) transitions.
Running 930 sub problems to find dead transitions.
[2024-05-28 16:30:52] [INFO ] Flow matrix only has 916 transitions (discarded 16 similar events)
// Phase 1: matrix 916 rows 422 cols
[2024-05-28 16:30:52] [INFO ] Computed 40 invariants in 20 ms
[2024-05-28 16:30:52] [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-05-28 16:30:59] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:30:59] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:30:59] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-05-28 16:31:00] [INFO ] Deduced a trap composed of 44 places in 263 ms of which 2 ms to minimize.
[2024-05-28 16:31:00] [INFO ] Deduced a trap composed of 103 places in 202 ms of which 2 ms to minimize.
[2024-05-28 16:31:00] [INFO ] Deduced a trap composed of 105 places in 164 ms of which 2 ms to minimize.
[2024-05-28 16:31:00] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 0 ms to minimize.
[2024-05-28 16:31:00] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:31:00] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:31:00] [INFO ] Deduced a trap composed of 43 places in 28 ms of which 1 ms to minimize.
[2024-05-28 16:31:01] [INFO ] Deduced a trap composed of 19 places in 221 ms of which 3 ms to minimize.
[2024-05-28 16:31:01] [INFO ] Deduced a trap composed of 258 places in 189 ms of which 2 ms to minimize.
[2024-05-28 16:31:01] [INFO ] Deduced a trap composed of 39 places in 216 ms of which 2 ms to minimize.
[2024-05-28 16:31:02] [INFO ] Deduced a trap composed of 154 places in 271 ms of which 4 ms to minimize.
[2024-05-28 16:31:03] [INFO ] Deduced a trap composed of 166 places in 238 ms of which 4 ms to minimize.
[2024-05-28 16:31:03] [INFO ] Deduced a trap composed of 189 places in 224 ms of which 3 ms to minimize.
[2024-05-28 16:31:03] [INFO ] Deduced a trap composed of 160 places in 224 ms of which 3 ms to minimize.
[2024-05-28 16:31:03] [INFO ] Deduced a trap composed of 158 places in 222 ms of which 2 ms to minimize.
[2024-05-28 16:31:05] [INFO ] Deduced a trap composed of 151 places in 247 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 19/57 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-05-28 16:31:13] [INFO ] Deduced a trap composed of 195 places in 252 ms of which 3 ms to minimize.
[2024-05-28 16:31:13] [INFO ] Deduced a trap composed of 195 places in 221 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/1338 variables, and 59 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: 21/21 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, 21/59 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-05-28 16:31:25] [INFO ] Deduced a trap composed of 196 places in 166 ms of which 10 ms to minimize.
[2024-05-28 16:31:26] [INFO ] Deduced a trap composed of 194 places in 237 ms of which 3 ms to minimize.
[2024-05-28 16:31:26] [INFO ] Deduced a trap composed of 189 places in 217 ms of which 3 ms to minimize.
[2024-05-28 16:31:26] [INFO ] Deduced a trap composed of 200 places in 175 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 4/63 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 63 constraints, problems are : Problem set: 0 solved, 930 unsolved in 20022 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: 25/25 constraints]
After SMT, in 41342ms problems are : Problem set: 0 solved, 930 unsolved
Search for dead transitions found 0 dead transitions in 41351ms
[2024-05-28 16:31:34] [INFO ] Flow matrix only has 916 transitions (discarded 16 similar events)
[2024-05-28 16:31:34] [INFO ] Invariant cache hit.
[2024-05-28 16:31:34] [INFO ] Implicit Places using invariants in 515 ms returned []
[2024-05-28 16:31:34] [INFO ] Flow matrix only has 916 transitions (discarded 16 similar events)
[2024-05-28 16:31:34] [INFO ] Invariant cache hit.
[2024-05-28 16:31:35] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 16:31:41] [INFO ] Implicit Places using invariants and state equation in 6848 ms returned []
Implicit Place search using SMT with State Equation took 7367 ms to find 0 implicit places.
[2024-05-28 16:31:41] [INFO ] Redundant transitions in 10 ms returned []
Running 930 sub problems to find dead transitions.
[2024-05-28 16:31:41] [INFO ] Flow matrix only has 916 transitions (discarded 16 similar events)
[2024-05-28 16:31:41] [INFO ] Invariant cache hit.
[2024-05-28 16:31:41] [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-05-28 16:31:47] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:31:47] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:31:47] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:31:47] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 1 ms to minimize.
[2024-05-28 16:31:48] [INFO ] Deduced a trap composed of 83 places in 182 ms of which 2 ms to minimize.
[2024-05-28 16:31:48] [INFO ] Deduced a trap composed of 44 places in 196 ms of which 3 ms to minimize.
[2024-05-28 16:31:48] [INFO ] Deduced a trap composed of 43 places in 180 ms of which 3 ms to minimize.
[2024-05-28 16:31:48] [INFO ] Deduced a trap composed of 43 places in 181 ms of which 3 ms to minimize.
[2024-05-28 16:31:48] [INFO ] Deduced a trap composed of 43 places in 175 ms of which 3 ms to minimize.
[2024-05-28 16:31:49] [INFO ] Deduced a trap composed of 158 places in 179 ms of which 2 ms to minimize.
[2024-05-28 16:31:49] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 2 ms to minimize.
[2024-05-28 16:31:49] [INFO ] Deduced a trap composed of 166 places in 180 ms of which 3 ms to minimize.
[2024-05-28 16:31:49] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 3 ms to minimize.
[2024-05-28 16:31:51] [INFO ] Deduced a trap composed of 211 places in 275 ms of which 3 ms to minimize.
[2024-05-28 16:31:51] [INFO ] Deduced a trap composed of 290 places in 248 ms of which 4 ms to minimize.
[2024-05-28 16:31:51] [INFO ] Deduced a trap composed of 227 places in 248 ms of which 3 ms to minimize.
[2024-05-28 16:31:51] [INFO ] Deduced a trap composed of 241 places in 238 ms of which 3 ms to minimize.
[2024-05-28 16:31:52] [INFO ] Deduced a trap composed of 178 places in 244 ms of which 4 ms to minimize.
[2024-05-28 16:31:54] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 3 ms to minimize.
[2024-05-28 16:31:55] [INFO ] Deduced a trap composed of 258 places in 232 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-05-28 16:31:56] [INFO ] Deduced a trap composed of 54 places in 243 ms of which 3 ms to minimize.
[2024-05-28 16:32:04] [INFO ] Deduced a trap composed of 145 places in 152 ms of which 2 ms to minimize.
[2024-05-28 16:32:04] [INFO ] Deduced a trap composed of 238 places in 234 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 3/61 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 61 constraints, problems are : Problem set: 0 solved, 930 unsolved in 30019 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: 23/23 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, 23/61 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-05-28 16:32:19] [INFO ] Deduced a trap composed of 189 places in 159 ms of which 2 ms to minimize.
[2024-05-28 16:32:24] [INFO ] Deduced a trap composed of 203 places in 206 ms of which 4 ms to minimize.
[2024-05-28 16:32:24] [INFO ] Deduced a trap composed of 179 places in 265 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 3/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 30017 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 61145ms problems are : Problem set: 0 solved, 930 unsolved
Search for dead transitions found 0 dead transitions in 61156ms
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 109919 ms. Remains : 422/430 places, 932/940 transitions.
Built C files in :
/tmp/ltsmin1574659801135131123
[2024-05-28 16:32:42] [INFO ] Computing symmetric may disable matrix : 932 transitions.
[2024-05-28 16:32:42] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:32:42] [INFO ] Computing symmetric may enable matrix : 932 transitions.
[2024-05-28 16:32:42] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:32:42] [INFO ] Computing Do-Not-Accords matrix : 932 transitions.
[2024-05-28 16:32:42] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:32:42] [INFO ] Built C files in 179ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1574659801135131123
Running compilation step : cd /tmp/ltsmin1574659801135131123;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1574659801135131123;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1574659801135131123;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 16:32:46] [INFO ] Flatten gal took : 85 ms
[2024-05-28 16:32:46] [INFO ] Flatten gal took : 54 ms
[2024-05-28 16:32:46] [INFO ] Time to serialize gal into /tmp/LTL522207196495212674.gal : 22 ms
[2024-05-28 16:32:46] [INFO ] Time to serialize properties into /tmp/LTL10496727366600028508.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL522207196495212674.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6382775479290002078.hoa' '-atoms' '/tmp/LTL10496727366600028508.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL10496727366600028508.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6382775479290002078.hoa
Detected timeout of ITS tools.
[2024-05-28 16:33:01] [INFO ] Flatten gal took : 80 ms
[2024-05-28 16:33:01] [INFO ] Flatten gal took : 79 ms
[2024-05-28 16:33:01] [INFO ] Time to serialize gal into /tmp/LTL10892923285149553667.gal : 12 ms
[2024-05-28 16:33:01] [INFO ] Time to serialize properties into /tmp/LTL3363463302422447624.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10892923285149553667.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3363463302422447624.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(X(F(("(((((P_1095>=1)&&(P_1113_1>=1))||((P_1095>=1)&&(P_1113_6>=1)))||(((P_1113_3>=1)&&(P_1095>=1))||((P_1113_2>=1)&&(P_1095>=1...904
Formula 0 simplified : FG(!"(((((Check_Sources_E_1>=1)&&(ORB_Lock>=1))||((Check_Sources_E_6>=1)&&(ORB_Lock>=1)))||(((ORB_Lock>=1)&&(Check_Sources_E_7>=1))|...975
Detected timeout of ITS tools.
[2024-05-28 16:33:16] [INFO ] Flatten gal took : 69 ms
[2024-05-28 16:33:16] [INFO ] Applying decomposition
[2024-05-28 16:33:16] [INFO ] Flatten gal took : 53 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4624337170662685527.txt' '-o' '/tmp/graph4624337170662685527.bin' '-w' '/tmp/graph4624337170662685527.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4624337170662685527.bin' '-l' '-1' '-v' '-w' '/tmp/graph4624337170662685527.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:33:17] [INFO ] Decomposing Gal with order
[2024-05-28 16:33:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:33:17] [INFO ] Removed a total of 748 redundant transitions.
[2024-05-28 16:33:17] [INFO ] Flatten gal took : 324 ms
[2024-05-28 16:33:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 508 labels/synchronizations in 61 ms.
[2024-05-28 16:33:17] [INFO ] Time to serialize gal into /tmp/LTL17637638926344133048.gal : 18 ms
[2024-05-28 16:33:17] [INFO ] Time to serialize properties into /tmp/LTL12041102283620703371.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17637638926344133048.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12041102283620703371.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(G(X(F(("(((((i0.u2.P_1095>=1)&&(i0.u2.P_1113_1>=1))||((i0.u2.P_1095>=1)&&(i0.u2.P_1113_6>=1)))||(((i0.u2.P_1113_3>=1)&&(i0.u2.P_1...1200
Formula 0 simplified : FG(!"(((((i0.u2.Check_Sources_E_1>=1)&&(i4.u34.ORB_Lock>=1))||((i0.u2.Check_Sources_E_6>=1)&&(i4.u34.ORB_Lock>=1)))||(((i4.u34.ORB_L...1279
Detected timeout of ITS tools.
Treatment of property PolyORBLF-PT-S02J04T08-LTLFireability-01 finished in 409365 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 18 ms. Remains 588 /592 variables (removed 4) and now considering 1098/1102 (removed 4) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-28 16:33:32] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 588 cols
[2024-05-28 16:33:32] [INFO ] Computed 40 invariants in 28 ms
[2024-05-28 16:33:32] [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-05-28 16:33:45] [INFO ] Deduced a trap composed of 19 places in 223 ms of which 30 ms to minimize.
[2024-05-28 16:33:45] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 1 ms to minimize.
[2024-05-28 16:33:45] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
[2024-05-28 16:33:45] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2024-05-28 16:33:46] [INFO ] Deduced a trap composed of 64 places in 128 ms of which 3 ms to minimize.
[2024-05-28 16:33:46] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 2 ms to minimize.
[2024-05-28 16:33:46] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:33:47] [INFO ] Deduced a trap composed of 64 places in 112 ms of which 1 ms to minimize.
[2024-05-28 16:33:47] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 2 ms to minimize.
[2024-05-28 16:33:47] [INFO ] Deduced a trap composed of 114 places in 325 ms of which 5 ms to minimize.
[2024-05-28 16:33:47] [INFO ] Deduced a trap composed of 162 places in 297 ms of which 4 ms to minimize.
[2024-05-28 16:33:48] [INFO ] Deduced a trap composed of 406 places in 335 ms of which 4 ms to minimize.
[2024-05-28 16:33:49] [INFO ] Deduced a trap composed of 79 places in 184 ms of which 3 ms to minimize.
[2024-05-28 16:33:49] [INFO ] Deduced a trap composed of 300 places in 287 ms of which 4 ms to minimize.
[2024-05-28 16:33:51] [INFO ] Deduced a trap composed of 294 places in 228 ms of which 3 ms to minimize.
[2024-05-28 16:33:51] [INFO ] Deduced a trap composed of 299 places in 233 ms of which 4 ms to minimize.
[2024-05-28 16:33:52] [INFO ] Deduced a trap composed of 269 places in 212 ms of which 4 ms to minimize.
[2024-05-28 16:33:53] [INFO ] Deduced a trap composed of 323 places in 244 ms of which 3 ms to minimize.
[2024-05-28 16:33:53] [INFO ] Deduced a trap composed of 339 places in 231 ms of which 3 ms to minimize.
[2024-05-28 16:33:53] [INFO ] Deduced a trap composed of 305 places in 239 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 20025 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: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 9)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 1)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 5)
(s59 0)
(s60 0)
(s61 1)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 1)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 1)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 1)
(s110 0)
(s111 1)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 1)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 1)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 1)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 1)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 1)
(s240 0)
(s241 5)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 1)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 1)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 1)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 9)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 1)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 1)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 1)
(s383 1)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 1)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 1)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 1)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 1)
(s483 0)
(s484 0)
(s485 0)
(s486 1)
(s487 0)
(s488 1)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 timeout
0 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 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: 0/1096 constraints, Known Traps: 20/20 constraints]
After SMT, in 41454ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41464ms
[2024-05-28 16:34:14] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 16:34:14] [INFO ] Invariant cache hit.
[2024-05-28 16:34:14] [INFO ] Implicit Places using invariants in 707 ms returned []
[2024-05-28 16:34:14] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 16:34:14] [INFO ] Invariant cache hit.
[2024-05-28 16:34:15] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 16:34:25] [INFO ] Implicit Places using invariants and state equation in 10493 ms returned []
Implicit Place search using SMT with State Equation took 11203 ms to find 0 implicit places.
Running 1096 sub problems to find dead transitions.
[2024-05-28 16:34:25] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 16:34:25] [INFO ] Invariant cache hit.
[2024-05-28 16:34:25] [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-05-28 16:34:36] [INFO ] Deduced a trap composed of 19 places in 216 ms of which 4 ms to minimize.
[2024-05-28 16:34:36] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 1 ms to minimize.
[2024-05-28 16:34:36] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 2 ms to minimize.
[2024-05-28 16:34:36] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-05-28 16:34:36] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 2 ms to minimize.
[2024-05-28 16:34:37] [INFO ] Deduced a trap composed of 64 places in 36 ms of which 1 ms to minimize.
[2024-05-28 16:34:37] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:34:37] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:34:37] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:34:37] [INFO ] Deduced a trap composed of 162 places in 214 ms of which 3 ms to minimize.
[2024-05-28 16:34:38] [INFO ] Deduced a trap composed of 396 places in 189 ms of which 3 ms to minimize.
[2024-05-28 16:34:38] [INFO ] Deduced a trap composed of 394 places in 308 ms of which 4 ms to minimize.
[2024-05-28 16:34:39] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 2 ms to minimize.
[2024-05-28 16:34:39] [INFO ] Deduced a trap composed of 326 places in 354 ms of which 5 ms to minimize.
[2024-05-28 16:34:40] [INFO ] Deduced a trap composed of 269 places in 312 ms of which 4 ms to minimize.
[2024-05-28 16:34:41] [INFO ] Deduced a trap composed of 269 places in 318 ms of which 5 ms to minimize.
[2024-05-28 16:34:43] [INFO ] Deduced a trap composed of 3 places in 307 ms of which 4 ms to minimize.
[2024-05-28 16:34:44] [INFO ] Deduced a trap composed of 302 places in 309 ms of which 3 ms to minimize.
[2024-05-28 16:34:44] [INFO ] Deduced a trap composed of 294 places in 313 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 19/57 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 57 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: 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-05-28 16:35:19] [INFO ] Deduced a trap composed of 375 places in 295 ms of which 5 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 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: 0/1096 constraints, Known Traps: 20/20 constraints]
After SMT, in 61525ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 61535ms
Starting structural reductions in LTL mode, iteration 1 : 588/592 places, 1098/1102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 114226 ms. Remains : 588/592 places, 1098/1102 transitions.
Stuttering acceptance computed with spot in 152 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 3251 reset in 334 ms.
Product exploration explored 100000 steps with 3284 reset in 349 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 136 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 85 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 220 steps (0 resets) in 7 ms. (27 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 138 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 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
[2024-05-28 16:35:28] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 16:35:28] [INFO ] Invariant cache hit.
[2024-05-28 16:35:28] [INFO ] [Real]Absence check using 16 positive place invariants in 23 ms returned sat
[2024-05-28 16:35:28] [INFO ] [Real]Absence check using 16 positive and 24 generalized place invariants in 63 ms returned sat
[2024-05-28 16:35:30] [INFO ] [Real]Absence check using state equation in 1517 ms returned sat
[2024-05-28 16:35:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:35:31] [INFO ] [Nat]Absence check using 16 positive place invariants in 34 ms returned sat
[2024-05-28 16:35:31] [INFO ] [Nat]Absence check using 16 positive and 24 generalized place invariants in 57 ms returned sat
[2024-05-28 16:35:34] [INFO ] [Nat]Absence check using state equation in 3790 ms returned sat
[2024-05-28 16:35:34] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 16:35:35] [INFO ] [Nat]Added 96 Read/Feed constraints in 1022 ms returned sat
[2024-05-28 16:35:36] [INFO ] Deduced a trap composed of 64 places in 353 ms of which 5 ms to minimize.
[2024-05-28 16:35:36] [INFO ] Deduced a trap composed of 64 places in 315 ms of which 4 ms to minimize.
[2024-05-28 16:35:37] [INFO ] Deduced a trap composed of 64 places in 348 ms of which 4 ms to minimize.
[2024-05-28 16:35:37] [INFO ] Deduced a trap composed of 64 places in 338 ms of which 5 ms to minimize.
[2024-05-28 16:35:37] [INFO ] Deduced a trap composed of 98 places in 259 ms of which 3 ms to minimize.
[2024-05-28 16:35:38] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 1 ms to minimize.
[2024-05-28 16:35:38] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2282 ms
[2024-05-28 16:35:38] [INFO ] Computed and/alt/rep : 712/2573/704 causal constraints (skipped 376 transitions) in 97 ms.
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 0 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 0 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 67 ms. Remains 414 /588 variables (removed 174) and now considering 924/1098 (removed 174) transitions.
Running 922 sub problems to find dead transitions.
[2024-05-28 16:35:45] [INFO ] Flow matrix only has 908 transitions (discarded 16 similar events)
// Phase 1: matrix 908 rows 414 cols
[2024-05-28 16:35:45] [INFO ] Computed 40 invariants in 12 ms
[2024-05-28 16:35:45] [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-05-28 16:35:52] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:35:52] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 1 ms to minimize.
[2024-05-28 16:35:52] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:35:52] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 1 ms to minimize.
[2024-05-28 16:35:52] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 1 ms to minimize.
[2024-05-28 16:35:52] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 0 ms to minimize.
[2024-05-28 16:35:52] [INFO ] Deduced a trap composed of 50 places in 231 ms of which 3 ms to minimize.
[2024-05-28 16:35:53] [INFO ] Deduced a trap composed of 99 places in 210 ms of which 3 ms to minimize.
[2024-05-28 16:35:53] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 3 ms to minimize.
[2024-05-28 16:35:53] [INFO ] Deduced a trap composed of 170 places in 217 ms of which 4 ms to minimize.
[2024-05-28 16:35:53] [INFO ] Deduced a trap composed of 44 places in 32 ms of which 1 ms to minimize.
[2024-05-28 16:35:53] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:35:54] [INFO ] Deduced a trap composed of 48 places in 152 ms of which 2 ms to minimize.
[2024-05-28 16:35:55] [INFO ] Deduced a trap composed of 158 places in 257 ms of which 3 ms to minimize.
[2024-05-28 16:35:57] [INFO ] Deduced a trap composed of 264 places in 320 ms of which 2 ms to minimize.
[2024-05-28 16:35:57] [INFO ] Deduced a trap composed of 250 places in 188 ms of which 3 ms to minimize.
[2024-05-28 16:35:57] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 2 ms to minimize.
[2024-05-28 16:36:02] [INFO ] Deduced a trap composed of 151 places in 227 ms of which 3 ms to minimize.
[2024-05-28 16:36:02] [INFO ] Deduced a trap composed of 201 places in 210 ms of which 3 ms to minimize.
[2024-05-28 16:36:02] [INFO ] Deduced a trap composed of 149 places in 250 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
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 20025 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
[2024-05-28 16:36:19] [INFO ] Deduced a trap composed of 197 places in 280 ms of which 4 ms to minimize.
[2024-05-28 16:36:19] [INFO ] Deduced a trap composed of 165 places in 240 ms of which 3 ms to minimize.
[2024-05-28 16:36:26] [INFO ] Deduced a trap composed of 202 places in 172 ms of which 2 ms to minimize.
[2024-05-28 16:36:26] [INFO ] Deduced a trap composed of 185 places in 229 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 412/1322 variables, and 62 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: 24/24 constraints]
After SMT, in 41327ms problems are : Problem set: 0 solved, 922 unsolved
Search for dead transitions found 0 dead transitions in 41337ms
[2024-05-28 16:36:26] [INFO ] Flow matrix only has 908 transitions (discarded 16 similar events)
[2024-05-28 16:36:26] [INFO ] Invariant cache hit.
[2024-05-28 16:36:27] [INFO ] Implicit Places using invariants in 372 ms returned []
[2024-05-28 16:36:27] [INFO ] Flow matrix only has 908 transitions (discarded 16 similar events)
[2024-05-28 16:36:27] [INFO ] Invariant cache hit.
[2024-05-28 16:36:28] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 16:36:34] [INFO ] Implicit Places using invariants and state equation in 6753 ms returned []
Implicit Place search using SMT with State Equation took 7126 ms to find 0 implicit places.
[2024-05-28 16:36:34] [INFO ] Redundant transitions in 28 ms returned []
Running 922 sub problems to find dead transitions.
[2024-05-28 16:36:34] [INFO ] Flow matrix only has 908 transitions (discarded 16 similar events)
[2024-05-28 16:36:34] [INFO ] Invariant cache hit.
[2024-05-28 16:36:34] [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-05-28 16:36:40] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:36:40] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 0 ms to minimize.
[2024-05-28 16:36:40] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:36:40] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 0 ms to minimize.
[2024-05-28 16:36:41] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 0 ms to minimize.
[2024-05-28 16:36:41] [INFO ] Deduced a trap composed of 93 places in 170 ms of which 3 ms to minimize.
[2024-05-28 16:36:41] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:36:41] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 0 ms to minimize.
[2024-05-28 16:36:41] [INFO ] Deduced a trap composed of 19 places in 179 ms of which 3 ms to minimize.
[2024-05-28 16:36:41] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:36:42] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 2 ms to minimize.
[2024-05-28 16:36:42] [INFO ] Deduced a trap composed of 158 places in 174 ms of which 2 ms to minimize.
[2024-05-28 16:36:44] [INFO ] Deduced a trap composed of 262 places in 150 ms of which 2 ms to minimize.
[2024-05-28 16:36:45] [INFO ] Deduced a trap composed of 166 places in 193 ms of which 6 ms to minimize.
[2024-05-28 16:36:48] [INFO ] Deduced a trap composed of 171 places in 161 ms of which 3 ms to minimize.
[2024-05-28 16:36:48] [INFO ] Deduced a trap composed of 175 places in 241 ms of which 3 ms to minimize.
[2024-05-28 16:36:49] [INFO ] Deduced a trap composed of 203 places in 240 ms of which 3 ms to minimize.
[2024-05-28 16:36:50] [INFO ] Deduced a trap composed of 185 places in 224 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
[2024-05-28 16:36:57] [INFO ] Deduced a trap composed of 62 places in 205 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
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 30025 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-05-28 16:37:21] [INFO ] Deduced a trap composed of 192 places in 186 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 30020 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 61412ms problems are : Problem set: 0 solved, 922 unsolved
Search for dead transitions found 0 dead transitions in 61424ms
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 109993 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 94 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 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 162 steps (0 resets) in 7 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 79 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 94 ms :[(NOT p0), (NOT p0)]
[2024-05-28 16:37:35] [INFO ] Flow matrix only has 908 transitions (discarded 16 similar events)
[2024-05-28 16:37:35] [INFO ] Invariant cache hit.
[2024-05-28 16:37:36] [INFO ] [Real]Absence check using 12 positive place invariants in 15 ms returned sat
[2024-05-28 16:37:36] [INFO ] [Real]Absence check using 12 positive and 28 generalized place invariants in 52 ms returned sat
[2024-05-28 16:37:37] [INFO ] [Real]Absence check using state equation in 1434 ms returned sat
[2024-05-28 16:37:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:37:38] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-28 16:37:38] [INFO ] [Nat]Absence check using 12 positive and 28 generalized place invariants in 60 ms returned sat
[2024-05-28 16:37:39] [INFO ] [Nat]Absence check using state equation in 1150 ms returned sat
[2024-05-28 16:37:39] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 16:37:39] [INFO ] [Nat]Added 96 Read/Feed constraints in 266 ms returned sat
[2024-05-28 16:37:39] [INFO ] Deduced a trap composed of 50 places in 220 ms of which 3 ms to minimize.
[2024-05-28 16:37:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 307 ms
[2024-05-28 16:37:40] [INFO ] Computed and/alt/rep : 386/1325/378 causal constraints (skipped 528 transitions) in 58 ms.
[2024-05-28 16:37:43] [INFO ] Added : 201 causal constraints over 41 iterations in 3861 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2437 reset in 352 ms.
Product exploration explored 100000 steps with 2437 reset in 362 ms.
Built C files in :
/tmp/ltsmin17713015433708097924
[2024-05-28 16:37:44] [INFO ] Computing symmetric may disable matrix : 924 transitions.
[2024-05-28 16:37:44] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:37:44] [INFO ] Computing symmetric may enable matrix : 924 transitions.
[2024-05-28 16:37:44] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:37:44] [INFO ] Computing Do-Not-Accords matrix : 924 transitions.
[2024-05-28 16:37:44] [INFO ] Computation of Completed DNA matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:37:44] [INFO ] Built C files in 237ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17713015433708097924
Running compilation step : cd /tmp/ltsmin17713015433708097924;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17713015433708097924;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17713015433708097924;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 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 22 ms. Remains 414 /414 variables (removed 0) and now considering 924/924 (removed 0) transitions.
Running 922 sub problems to find dead transitions.
[2024-05-28 16:37:48] [INFO ] Flow matrix only has 908 transitions (discarded 16 similar events)
[2024-05-28 16:37:48] [INFO ] Invariant cache hit.
[2024-05-28 16:37:48] [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-05-28 16:37:54] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:37:54] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-05-28 16:37:54] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 0 ms to minimize.
[2024-05-28 16:37:54] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 1 ms to minimize.
[2024-05-28 16:37:54] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 3 ms to minimize.
[2024-05-28 16:37:55] [INFO ] Deduced a trap composed of 93 places in 181 ms of which 3 ms to minimize.
[2024-05-28 16:37:55] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:37:55] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:37:55] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 3 ms to minimize.
[2024-05-28 16:37:55] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 2 ms to minimize.
[2024-05-28 16:37:55] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 1 ms to minimize.
[2024-05-28 16:37:56] [INFO ] Deduced a trap composed of 158 places in 145 ms of which 2 ms to minimize.
[2024-05-28 16:37:58] [INFO ] Deduced a trap composed of 262 places in 228 ms of which 3 ms to minimize.
[2024-05-28 16:37:59] [INFO ] Deduced a trap composed of 166 places in 223 ms of which 3 ms to minimize.
[2024-05-28 16:38:02] [INFO ] Deduced a trap composed of 171 places in 222 ms of which 3 ms to minimize.
[2024-05-28 16:38:02] [INFO ] Deduced a trap composed of 175 places in 245 ms of which 3 ms to minimize.
[2024-05-28 16:38:03] [INFO ] Deduced a trap composed of 203 places in 242 ms of which 3 ms to minimize.
[2024-05-28 16:38:04] [INFO ] Deduced a trap composed of 185 places in 234 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 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: 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-05-28 16:38:25] [INFO ] Deduced a trap composed of 62 places in 147 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 20023 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 41406ms problems are : Problem set: 0 solved, 922 unsolved
Search for dead transitions found 0 dead transitions in 41422ms
[2024-05-28 16:38:29] [INFO ] Flow matrix only has 908 transitions (discarded 16 similar events)
[2024-05-28 16:38:29] [INFO ] Invariant cache hit.
[2024-05-28 16:38:29] [INFO ] Implicit Places using invariants in 518 ms returned []
[2024-05-28 16:38:29] [INFO ] Flow matrix only has 908 transitions (discarded 16 similar events)
[2024-05-28 16:38:29] [INFO ] Invariant cache hit.
[2024-05-28 16:38:30] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 16:38:37] [INFO ] Implicit Places using invariants and state equation in 7516 ms returned []
Implicit Place search using SMT with State Equation took 8037 ms to find 0 implicit places.
[2024-05-28 16:38:37] [INFO ] Redundant transitions in 10 ms returned []
Running 922 sub problems to find dead transitions.
[2024-05-28 16:38:37] [INFO ] Flow matrix only has 908 transitions (discarded 16 similar events)
[2024-05-28 16:38:37] [INFO ] Invariant cache hit.
[2024-05-28 16:38:37] [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-05-28 16:38:44] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:38:44] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:38:44] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 0 ms to minimize.
[2024-05-28 16:38:44] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:38:44] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:38:45] [INFO ] Deduced a trap composed of 93 places in 216 ms of which 3 ms to minimize.
[2024-05-28 16:38:45] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 0 ms to minimize.
[2024-05-28 16:38:45] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:38:45] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 3 ms to minimize.
[2024-05-28 16:38:45] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 0 ms to minimize.
[2024-05-28 16:38:45] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 2 ms to minimize.
[2024-05-28 16:38:46] [INFO ] Deduced a trap composed of 158 places in 263 ms of which 2 ms to minimize.
[2024-05-28 16:38:48] [INFO ] Deduced a trap composed of 262 places in 144 ms of which 2 ms to minimize.
[2024-05-28 16:38:49] [INFO ] Deduced a trap composed of 166 places in 138 ms of which 2 ms to minimize.
[2024-05-28 16:38:51] [INFO ] Deduced a trap composed of 171 places in 219 ms of which 2 ms to minimize.
[2024-05-28 16:38:52] [INFO ] Deduced a trap composed of 175 places in 207 ms of which 3 ms to minimize.
[2024-05-28 16:38:53] [INFO ] Deduced a trap composed of 203 places in 240 ms of which 3 ms to minimize.
[2024-05-28 16:38:54] [INFO ] Deduced a trap composed of 185 places in 225 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
[2024-05-28 16:39:02] [INFO ] Deduced a trap composed of 62 places in 217 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 Real declared 412/1322 variables, and 57 constraints, problems are : Problem set: 0 solved, 922 unsolved in 30015 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-05-28 16:39:24] [INFO ] Deduced a trap composed of 192 places in 244 ms of which 4 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 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: 0/922 constraints, Known Traps: 20/20 constraints]
After SMT, in 61447ms problems are : Problem set: 0 solved, 922 unsolved
Search for dead transitions found 0 dead transitions in 61457ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 110976 ms. Remains : 414/414 places, 924/924 transitions.
Built C files in :
/tmp/ltsmin6949781372236072230
[2024-05-28 16:39:38] [INFO ] Computing symmetric may disable matrix : 924 transitions.
[2024-05-28 16:39:38] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:39:38] [INFO ] Computing symmetric may enable matrix : 924 transitions.
[2024-05-28 16:39:38] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:39:39] [INFO ] Computing Do-Not-Accords matrix : 924 transitions.
[2024-05-28 16:39:39] [INFO ] Computation of Completed DNA matrix. took 46 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:39:39] [INFO ] Built C files in 231ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6949781372236072230
Running compilation step : cd /tmp/ltsmin6949781372236072230;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6949781372236072230;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6949781372236072230;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 16:39:42] [INFO ] Flatten gal took : 63 ms
[2024-05-28 16:39:42] [INFO ] Flatten gal took : 50 ms
[2024-05-28 16:39:42] [INFO ] Time to serialize gal into /tmp/LTL8383424381072580894.gal : 9 ms
[2024-05-28 16:39:42] [INFO ] Time to serialize properties into /tmp/LTL4049294300557975011.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8383424381072580894.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14434420283838455953.hoa' '-atoms' '/tmp/LTL4049294300557975011.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4049294300557975011.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14434420283838455953.hoa
Detected timeout of ITS tools.
[2024-05-28 16:39:57] [INFO ] Flatten gal took : 56 ms
[2024-05-28 16:39:57] [INFO ] Flatten gal took : 46 ms
[2024-05-28 16:39:57] [INFO ] Time to serialize gal into /tmp/LTL9821704330200177832.gal : 8 ms
[2024-05-28 16:39:57] [INFO ] Time to serialize properties into /tmp/LTL18405627524358198297.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9821704330200177832.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18405627524358198297.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((F("((((NotifyEventSourceAddedB_1>=1)||(NotifyEventSourceAddedB_3>=1))||((NotifyEventSourceAddedB_4>=1)||(NotifyEventSourceAddedB...1539
Formula 0 simplified : G(G!"((((NotifyEventSourceAddedB_1>=1)||(NotifyEventSourceAddedB_3>=1))||((NotifyEventSourceAddedB_4>=1)||(NotifyEventSourceAddedB_5...1246
Detected timeout of ITS tools.
[2024-05-28 16:40:12] [INFO ] Flatten gal took : 64 ms
[2024-05-28 16:40:12] [INFO ] Applying decomposition
[2024-05-28 16:40:12] [INFO ] Flatten gal took : 47 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4088530484117948726.txt' '-o' '/tmp/graph4088530484117948726.bin' '-w' '/tmp/graph4088530484117948726.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4088530484117948726.bin' '-l' '-1' '-v' '-w' '/tmp/graph4088530484117948726.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:40:12] [INFO ] Decomposing Gal with order
[2024-05-28 16:40:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:40:13] [INFO ] Removed a total of 760 redundant transitions.
[2024-05-28 16:40:13] [INFO ] Flatten gal took : 102 ms
[2024-05-28 16:40:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 221 labels/synchronizations in 28 ms.
[2024-05-28 16:40:13] [INFO ] Time to serialize gal into /tmp/LTL3341028601766422229.gal : 15 ms
[2024-05-28 16:40:13] [INFO ] Time to serialize properties into /tmp/LTL2993834975880568971.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3341028601766422229.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2993834975880568971.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F((F("((((i6.u26.NotifyEventSourceAddedB_1>=1)||(i6.u18.NotifyEventSourceAddedB_3>=1))||((i6.u31.NotifyEventSourceAddedB_4>=1)||(i6...1863
Formula 0 simplified : G(G!"((((i6.u26.NotifyEventSourceAddedB_1>=1)||(i6.u18.NotifyEventSourceAddedB_3>=1))||((i6.u31.NotifyEventSourceAddedB_4>=1)||(i6.u...1517
Detected timeout of ITS tools.
Treatment of property PolyORBLF-PT-S02J04T08-LTLFireability-04 finished in 415520 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(F(p1))||p0)))'
Support contains 18 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 19 ms. Remains 588 /592 variables (removed 4) and now considering 1098/1102 (removed 4) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-28 16:40:28] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 588 cols
[2024-05-28 16:40:28] [INFO ] Computed 40 invariants in 10 ms
[2024-05-28 16:40:28] [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-05-28 16:40:38] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 2 ms to minimize.
[2024-05-28 16:40:38] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:40:38] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:40:38] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:40:38] [INFO ] Deduced a trap composed of 64 places in 110 ms of which 3 ms to minimize.
[2024-05-28 16:40:38] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 1 ms to minimize.
[2024-05-28 16:40:39] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:40:39] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 1 ms to minimize.
[2024-05-28 16:40:39] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:40:39] [INFO ] Deduced a trap composed of 114 places in 306 ms of which 4 ms to minimize.
[2024-05-28 16:40:40] [INFO ] Deduced a trap composed of 162 places in 382 ms of which 4 ms to minimize.
[2024-05-28 16:40:40] [INFO ] Deduced a trap composed of 406 places in 331 ms of which 5 ms to minimize.
[2024-05-28 16:40:41] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 2 ms to minimize.
[2024-05-28 16:40:41] [INFO ] Deduced a trap composed of 300 places in 207 ms of which 3 ms to minimize.
[2024-05-28 16:40:42] [INFO ] Deduced a trap composed of 294 places in 192 ms of which 4 ms to minimize.
[2024-05-28 16:40:43] [INFO ] Deduced a trap composed of 299 places in 210 ms of which 3 ms to minimize.
[2024-05-28 16:40:43] [INFO ] Deduced a trap composed of 269 places in 208 ms of which 3 ms to minimize.
[2024-05-28 16:40:44] [INFO ] Deduced a trap composed of 323 places in 206 ms of which 3 ms to minimize.
[2024-05-28 16:40:44] [INFO ] Deduced a trap composed of 339 places in 228 ms of which 3 ms to minimize.
[2024-05-28 16:40:45] [INFO ] Deduced a trap composed of 305 places in 212 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 20021 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 20025 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 41123ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41133ms
[2024-05-28 16:41:09] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 16:41:09] [INFO ] Invariant cache hit.
[2024-05-28 16:41:09] [INFO ] Implicit Places using invariants in 583 ms returned []
[2024-05-28 16:41:09] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 16:41:09] [INFO ] Invariant cache hit.
[2024-05-28 16:41:10] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 16:41:20] [INFO ] Implicit Places using invariants and state equation in 10920 ms returned []
Implicit Place search using SMT with State Equation took 11506 ms to find 0 implicit places.
Running 1096 sub problems to find dead transitions.
[2024-05-28 16:41:20] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 16:41:20] [INFO ] Invariant cache hit.
[2024-05-28 16:41:20] [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-05-28 16:41:33] [INFO ] Deduced a trap composed of 19 places in 212 ms of which 4 ms to minimize.
[2024-05-28 16:41:33] [INFO ] Deduced a trap composed of 64 places in 134 ms of which 2 ms to minimize.
[2024-05-28 16:41:33] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 2 ms to minimize.
[2024-05-28 16:41:33] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
[2024-05-28 16:41:33] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 2 ms to minimize.
[2024-05-28 16:41:34] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:41:34] [INFO ] Deduced a trap composed of 64 places in 197 ms of which 1 ms to minimize.
[2024-05-28 16:41:34] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 2 ms to minimize.
[2024-05-28 16:41:34] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:41:35] [INFO ] Deduced a trap composed of 162 places in 294 ms of which 4 ms to minimize.
[2024-05-28 16:41:35] [INFO ] Deduced a trap composed of 396 places in 284 ms of which 4 ms to minimize.
[2024-05-28 16:41:35] [INFO ] Deduced a trap composed of 394 places in 264 ms of which 4 ms to minimize.
[2024-05-28 16:41:36] [INFO ] Deduced a trap composed of 79 places in 168 ms of which 5 ms to minimize.
[2024-05-28 16:41:37] [INFO ] Deduced a trap composed of 326 places in 282 ms of which 3 ms to minimize.
[2024-05-28 16:41:37] [INFO ] Deduced a trap composed of 269 places in 262 ms of which 3 ms to minimize.
[2024-05-28 16:41:38] [INFO ] Deduced a trap composed of 269 places in 323 ms of which 5 ms to minimize.
[2024-05-28 16:41:40] [INFO ] Deduced a trap composed of 3 places in 302 ms of which 4 ms to minimize.
[2024-05-28 16:41:40] [INFO ] Deduced a trap composed of 302 places in 300 ms of which 4 ms to minimize.
[2024-05-28 16:41:41] [INFO ] Deduced a trap composed of 294 places in 303 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 19/57 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
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 586/1670 variables, and 57 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30026 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-05-28 16:42:11] [INFO ] Deduced a trap composed of 375 places in 274 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 30042 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 61148ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 61162ms
Starting structural reductions in LTL mode, iteration 1 : 588/592 places, 1098/1102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113825 ms. Remains : 588/592 places, 1098/1102 transitions.
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S02J04T08-LTLFireability-05
Product exploration explored 100000 steps with 1751 reset in 455 ms.
Product exploration explored 100000 steps with 1739 reset in 436 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 111 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 204 steps (0 resets) in 7 ms. (25 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 5 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 81 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (NOT p1)]
[2024-05-28 16:42:23] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 16:42:23] [INFO ] Invariant cache hit.
[2024-05-28 16:42:24] [INFO ] [Real]Absence check using 16 positive place invariants in 17 ms returned sat
[2024-05-28 16:42:24] [INFO ] [Real]Absence check using 16 positive and 24 generalized place invariants in 108 ms returned sat
[2024-05-28 16:42:27] [INFO ] [Real]Absence check using state equation in 2528 ms returned sat
[2024-05-28 16:42:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:42:27] [INFO ] [Nat]Absence check using 16 positive place invariants in 58 ms returned sat
[2024-05-28 16:42:27] [INFO ] [Nat]Absence check using 16 positive and 24 generalized place invariants in 38 ms returned sat
[2024-05-28 16:42:31] [INFO ] [Nat]Absence check using state equation in 3338 ms returned sat
[2024-05-28 16:42:31] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 16:42:32] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 16:42:32] [INFO ] [Nat]Added 96 Read/Feed constraints in 1707 ms returned sat
[2024-05-28 16:42:32] [INFO ] Deduced a trap composed of 64 places in 118 ms of which 2 ms to minimize.
[2024-05-28 16:42:33] [INFO ] Deduced a trap composed of 65 places in 101 ms of which 2 ms to minimize.
[2024-05-28 16:42:33] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
[2024-05-28 16:42:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 785 ms
[2024-05-28 16:42:33] [INFO ] Computed and/alt/rep : 712/2573/704 causal constraints (skipped 376 transitions) in 95 ms.
[2024-05-28 16:42:39] [INFO ] Added : 237 causal constraints over 48 iterations in 5823 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 10 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 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 96 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 240 place count 468 transition count 978
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 320 place count 428 transition count 938
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 326 place count 422 transition count 932
Iterating global reduction 3 with 6 rules applied. Total rules applied 332 place count 422 transition count 932
Applied a total of 332 rules in 83 ms. Remains 422 /588 variables (removed 166) and now considering 932/1098 (removed 166) transitions.
Running 930 sub problems to find dead transitions.
[2024-05-28 16:42:39] [INFO ] Flow matrix only has 916 transitions (discarded 16 similar events)
// Phase 1: matrix 916 rows 422 cols
[2024-05-28 16:42:39] [INFO ] Computed 40 invariants in 29 ms
[2024-05-28 16:42:39] [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-05-28 16:42:46] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 1 ms to minimize.
[2024-05-28 16:42:46] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:42:46] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 0 ms to minimize.
[2024-05-28 16:42:46] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:42:46] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:42:46] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 0 ms to minimize.
[2024-05-28 16:42:46] [INFO ] Deduced a trap composed of 44 places in 247 ms of which 3 ms to minimize.
[2024-05-28 16:42:46] [INFO ] Deduced a trap composed of 102 places in 234 ms of which 3 ms to minimize.
[2024-05-28 16:42:47] [INFO ] Deduced a trap composed of 43 places in 196 ms of which 3 ms to minimize.
[2024-05-28 16:42:47] [INFO ] Deduced a trap composed of 47 places in 196 ms of which 2 ms to minimize.
[2024-05-28 16:42:47] [INFO ] Deduced a trap composed of 258 places in 176 ms of which 3 ms to minimize.
[2024-05-28 16:42:47] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 2 ms to minimize.
[2024-05-28 16:42:48] [INFO ] Deduced a trap composed of 158 places in 205 ms of which 2 ms to minimize.
[2024-05-28 16:42:54] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 2 ms to minimize.
[2024-05-28 16:42:55] [INFO ] Deduced a trap composed of 149 places in 262 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-05-28 16:42:57] [INFO ] Deduced a trap composed of 151 places in 235 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/1338 variables, and 54 constraints, problems are : Problem set: 0 solved, 930 unsolved in 20037 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: 16/16 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, 16/54 constraints. Problems are: Problem set: 0 solved, 930 unsolved
[2024-05-28 16:43:07] [INFO ] Deduced a trap composed of 195 places in 282 ms of which 4 ms to minimize.
[2024-05-28 16:43:07] [INFO ] Deduced a trap composed of 190 places in 242 ms of which 3 ms to minimize.
[2024-05-28 16:43:09] [INFO ] Deduced a trap composed of 201 places in 246 ms of which 4 ms to minimize.
[2024-05-28 16:43:09] [INFO ] Deduced a trap composed of 205 places in 246 ms of which 5 ms to minimize.
[2024-05-28 16:43:09] [INFO ] Deduced a trap composed of 271 places in 237 ms of which 3 ms to minimize.
[2024-05-28 16:43:09] [INFO ] Deduced a trap composed of 219 places in 214 ms of which 3 ms to minimize.
[2024-05-28 16:43:15] [INFO ] Deduced a trap composed of 206 places in 277 ms of which 3 ms to minimize.
[2024-05-28 16:43:18] [INFO ] Deduced a trap composed of 54 places in 237 ms of which 3 ms to minimize.
[2024-05-28 16:43:18] [INFO ] Deduced a trap composed of 150 places in 211 ms of which 3 ms to minimize.
[2024-05-28 16:43:18] [INFO ] Deduced a trap composed of 185 places in 230 ms of which 3 ms to minimize.
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 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: 26/26 constraints]
After SMT, in 41339ms problems are : Problem set: 0 solved, 930 unsolved
Search for dead transitions found 0 dead transitions in 41363ms
[2024-05-28 16:43:20] [INFO ] Flow matrix only has 916 transitions (discarded 16 similar events)
[2024-05-28 16:43:20] [INFO ] Invariant cache hit.
[2024-05-28 16:43:21] [INFO ] Implicit Places using invariants in 486 ms returned []
[2024-05-28 16:43:21] [INFO ] Flow matrix only has 916 transitions (discarded 16 similar events)
[2024-05-28 16:43:21] [INFO ] Invariant cache hit.
[2024-05-28 16:43:21] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 16:43:25] [INFO ] Implicit Places using invariants and state equation in 4079 ms returned []
Implicit Place search using SMT with State Equation took 4569 ms to find 0 implicit places.
[2024-05-28 16:43:25] [INFO ] Redundant transitions in 10 ms returned []
Running 930 sub problems to find dead transitions.
[2024-05-28 16:43:25] [INFO ] Flow matrix only has 916 transitions (discarded 16 similar events)
[2024-05-28 16:43:25] [INFO ] Invariant cache hit.
[2024-05-28 16:43:25] [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-05-28 16:43:32] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 1 ms to minimize.
[2024-05-28 16:43:32] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:43:32] [INFO ] Deduced a trap composed of 43 places in 30 ms of which 1 ms to minimize.
[2024-05-28 16:43:32] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:43:32] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:43:33] [INFO ] Deduced a trap composed of 102 places in 202 ms of which 3 ms to minimize.
[2024-05-28 16:43:33] [INFO ] Deduced a trap composed of 43 places in 30 ms of which 0 ms to minimize.
[2024-05-28 16:43:33] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:43:33] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:43:33] [INFO ] Deduced a trap composed of 19 places in 173 ms of which 2 ms to minimize.
[2024-05-28 16:43:34] [INFO ] Deduced a trap composed of 158 places in 219 ms of which 3 ms to minimize.
[2024-05-28 16:43:34] [INFO ] Deduced a trap composed of 63 places in 138 ms of which 2 ms to minimize.
[2024-05-28 16:43:36] [INFO ] Deduced a trap composed of 166 places in 241 ms of which 4 ms to minimize.
[2024-05-28 16:43:36] [INFO ] Deduced a trap composed of 272 places in 209 ms of which 3 ms to minimize.
[2024-05-28 16:43:38] [INFO ] Deduced a trap composed of 180 places in 272 ms of which 3 ms to minimize.
[2024-05-28 16:43:38] [INFO ] Deduced a trap composed of 236 places in 265 ms of which 3 ms to minimize.
[2024-05-28 16:43:41] [INFO ] Deduced a trap composed of 258 places in 188 ms of which 2 ms to minimize.
[2024-05-28 16:43:43] [INFO ] Deduced a trap composed of 232 places in 233 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 930 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 930 unsolved
SMT process timed out in 31301ms, After SMT, problems are : Problem set: 0 solved, 930 unsolved
Search for dead transitions found 0 dead transitions in 31319ms
Starting structural reductions in SI_LTL mode, iteration 1 : 422/588 places, 932/1098 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 77362 ms. Remains : 422/588 places, 932/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 p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 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 59 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 144 steps (0 resets) in 5 ms. (24 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 154 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 103 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), (NOT p1)]
[2024-05-28 16:43:57] [INFO ] Flow matrix only has 916 transitions (discarded 16 similar events)
[2024-05-28 16:43:57] [INFO ] Invariant cache hit.
[2024-05-28 16:43:57] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-28 16:43:57] [INFO ] [Real]Absence check using 13 positive and 27 generalized place invariants in 66 ms returned sat
[2024-05-28 16:43:58] [INFO ] [Real]Absence check using state equation in 859 ms returned sat
[2024-05-28 16:43:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:43:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-28 16:43:59] [INFO ] [Nat]Absence check using 13 positive and 27 generalized place invariants in 46 ms returned sat
[2024-05-28 16:44:03] [INFO ] [Nat]Absence check using state equation in 3902 ms returned sat
[2024-05-28 16:44:03] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 16:44:03] [INFO ] [Nat]Added 96 Read/Feed constraints in 506 ms returned sat
[2024-05-28 16:44:03] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 1 ms to minimize.
[2024-05-28 16:44:04] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:44:04] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:44:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 684 ms
[2024-05-28 16:44:04] [INFO ] Computed and/alt/rep : 394/1333/386 causal constraints (skipped 528 transitions) in 74 ms.
[2024-05-28 16:44:08] [INFO ] Added : 163 causal constraints over 33 iterations in 3512 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2492 reset in 541 ms.
Product exploration explored 100000 steps with 2502 reset in 487 ms.
Built C files in :
/tmp/ltsmin8292381425939267947
[2024-05-28 16:44:09] [INFO ] Computing symmetric may disable matrix : 932 transitions.
[2024-05-28 16:44:09] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:44:09] [INFO ] Computing symmetric may enable matrix : 932 transitions.
[2024-05-28 16:44:09] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:44:09] [INFO ] Computing Do-Not-Accords matrix : 932 transitions.
[2024-05-28 16:44:09] [INFO ] Computation of Completed DNA matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:44:09] [INFO ] Built C files in 246ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8292381425939267947
Running compilation step : cd /tmp/ltsmin8292381425939267947;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8292381425939267947;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8292381425939267947;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 10 out of 422 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 422/422 places, 932/932 transitions.
Applied a total of 0 rules in 35 ms. Remains 422 /422 variables (removed 0) and now considering 932/932 (removed 0) transitions.
Running 930 sub problems to find dead transitions.
[2024-05-28 16:44:12] [INFO ] Flow matrix only has 916 transitions (discarded 16 similar events)
[2024-05-28 16:44:12] [INFO ] Invariant cache hit.
[2024-05-28 16:44:12] [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-05-28 16:44:19] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 2 ms to minimize.
[2024-05-28 16:44:19] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 1 ms to minimize.
[2024-05-28 16:44:19] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:44:19] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:44:19] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:44:20] [INFO ] Deduced a trap composed of 102 places in 221 ms of which 3 ms to minimize.
[2024-05-28 16:44:20] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:44:20] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:44:20] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:44:20] [INFO ] Deduced a trap composed of 19 places in 173 ms of which 2 ms to minimize.
[2024-05-28 16:44:21] [INFO ] Deduced a trap composed of 158 places in 265 ms of which 3 ms to minimize.
[2024-05-28 16:44:21] [INFO ] Deduced a trap composed of 63 places in 157 ms of which 2 ms to minimize.
[2024-05-28 16:44:23] [INFO ] Deduced a trap composed of 166 places in 239 ms of which 4 ms to minimize.
[2024-05-28 16:44:23] [INFO ] Deduced a trap composed of 272 places in 217 ms of which 3 ms to minimize.
[2024-05-28 16:44:25] [INFO ] Deduced a trap composed of 180 places in 248 ms of which 4 ms to minimize.
[2024-05-28 16:44:25] [INFO ] Deduced a trap composed of 236 places in 210 ms of which 2 ms to minimize.
[2024-05-28 16:44:27] [INFO ] Deduced a trap composed of 258 places in 216 ms of which 3 ms to minimize.
[2024-05-28 16:44:29] [INFO ] Deduced a trap composed of 232 places in 238 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 18/56 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 56 constraints, problems are : Problem set: 0 solved, 930 unsolved in 20020 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-05-28 16:44:44] [INFO ] Deduced a trap composed of 169 places in 279 ms of which 3 ms to minimize.
[2024-05-28 16:44:49] [INFO ] Deduced a trap composed of 149 places in 235 ms of which 3 ms to minimize.
[2024-05-28 16:44:50] [INFO ] Deduced a trap composed of 145 places in 233 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 3/59 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 59 constraints, problems are : Problem set: 0 solved, 930 unsolved in 20041 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: 21/21 constraints]
After SMT, in 41649ms problems are : Problem set: 0 solved, 930 unsolved
Search for dead transitions found 0 dead transitions in 41667ms
[2024-05-28 16:44:54] [INFO ] Flow matrix only has 916 transitions (discarded 16 similar events)
[2024-05-28 16:44:54] [INFO ] Invariant cache hit.
[2024-05-28 16:44:54] [INFO ] Implicit Places using invariants in 411 ms returned []
[2024-05-28 16:44:54] [INFO ] Flow matrix only has 916 transitions (discarded 16 similar events)
[2024-05-28 16:44:54] [INFO ] Invariant cache hit.
[2024-05-28 16:44:55] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 16:44:58] [INFO ] Implicit Places using invariants and state equation in 3968 ms returned []
Implicit Place search using SMT with State Equation took 4384 ms to find 0 implicit places.
[2024-05-28 16:44:58] [INFO ] Redundant transitions in 22 ms returned []
Running 930 sub problems to find dead transitions.
[2024-05-28 16:44:58] [INFO ] Flow matrix only has 916 transitions (discarded 16 similar events)
[2024-05-28 16:44:58] [INFO ] Invariant cache hit.
[2024-05-28 16:44:58] [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-05-28 16:45:05] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:45:05] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:45:05] [INFO ] Deduced a trap composed of 43 places in 30 ms of which 0 ms to minimize.
[2024-05-28 16:45:05] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:45:06] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:45:06] [INFO ] Deduced a trap composed of 102 places in 231 ms of which 4 ms to minimize.
[2024-05-28 16:45:06] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:45:06] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:45:06] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:45:06] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 2 ms to minimize.
[2024-05-28 16:45:07] [INFO ] Deduced a trap composed of 158 places in 209 ms of which 3 ms to minimize.
[2024-05-28 16:45:07] [INFO ] Deduced a trap composed of 63 places in 152 ms of which 2 ms to minimize.
[2024-05-28 16:45:09] [INFO ] Deduced a trap composed of 166 places in 239 ms of which 3 ms to minimize.
[2024-05-28 16:45:09] [INFO ] Deduced a trap composed of 272 places in 242 ms of which 3 ms to minimize.
[2024-05-28 16:45:11] [INFO ] Deduced a trap composed of 180 places in 269 ms of which 4 ms to minimize.
[2024-05-28 16:45:12] [INFO ] Deduced a trap composed of 236 places in 226 ms of which 3 ms to minimize.
[2024-05-28 16:45:14] [INFO ] Deduced a trap composed of 258 places in 242 ms of which 3 ms to minimize.
[2024-05-28 16:45:16] [INFO ] Deduced a trap composed of 232 places in 215 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 930 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 0/56 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/58 constraints. Problems are: Problem set: 88 solved, 842 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 422/1338 variables, and 58 constraints, problems are : Problem set: 88 solved, 842 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/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: 88 solved, 842 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 13/13 constraints. Problems are: Problem set: 88 solved, 842 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 25/38 constraints. Problems are: Problem set: 88 solved, 842 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 18/56 constraints. Problems are: Problem set: 88 solved, 842 unsolved
[2024-05-28 16:45:36] [INFO ] Deduced a trap composed of 184 places in 297 ms of which 4 ms to minimize.
[2024-05-28 16:45:43] [INFO ] Deduced a trap composed of 157 places in 254 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 2/58 constraints. Problems are: Problem set: 88 solved, 842 unsolved
[2024-05-28 16:45:50] [INFO ] Deduced a trap composed of 164 places in 261 ms of which 3 ms to minimize.
[2024-05-28 16:45:51] [INFO ] Deduced a trap composed of 173 places in 245 ms of which 3 ms to minimize.
[2024-05-28 16:45:55] [INFO ] Deduced a trap composed of 48 places in 231 ms of which 4 ms to minimize.
[2024-05-28 16:45:59] [INFO ] Deduced a trap composed of 185 places in 239 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/1338 variables, and 62 constraints, problems are : Problem set: 88 solved, 842 unsolved in 30022 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: 24/24 constraints]
After SMT, in 61661ms problems are : Problem set: 88 solved, 842 unsolved
Search for dead transitions found 88 dead transitions in 61678ms
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/422 places, 844/932 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 24 ms. Remains 404 /422 variables (removed 18) and now considering 812/844 (removed 32) transitions.
[2024-05-28 16:46:00] [INFO ] Flow matrix only has 796 transitions (discarded 16 similar events)
// Phase 1: matrix 796 rows 404 cols
[2024-05-28 16:46:00] [INFO ] Computed 40 invariants in 20 ms
[2024-05-28 16:46:00] [INFO ] Implicit Places using invariants in 460 ms returned []
[2024-05-28 16:46:00] [INFO ] Flow matrix only has 796 transitions (discarded 16 similar events)
[2024-05-28 16:46:00] [INFO ] Invariant cache hit.
[2024-05-28 16:46:01] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 16:46:03] [INFO ] Implicit Places using invariants and state equation in 3172 ms returned []
Implicit Place search using SMT with State Equation took 3636 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 404/422 places, 812/932 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 111470 ms. Remains : 404/422 places, 812/932 transitions.
Built C files in :
/tmp/ltsmin3018913932780676689
[2024-05-28 16:46:03] [INFO ] Computing symmetric may disable matrix : 812 transitions.
[2024-05-28 16:46:03] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:46:03] [INFO ] Computing symmetric may enable matrix : 812 transitions.
[2024-05-28 16:46:03] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:46:04] [INFO ] Computing Do-Not-Accords matrix : 812 transitions.
[2024-05-28 16:46:04] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:46:04] [INFO ] Built C files in 152ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3018913932780676689
Running compilation step : cd /tmp/ltsmin3018913932780676689;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3018913932780676689;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3018913932780676689;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 16:46:07] [INFO ] Flatten gal took : 41 ms
[2024-05-28 16:46:07] [INFO ] Flatten gal took : 35 ms
[2024-05-28 16:46:07] [INFO ] Time to serialize gal into /tmp/LTL12524168275229799694.gal : 6 ms
[2024-05-28 16:46:07] [INFO ] Time to serialize properties into /tmp/LTL11619780686077036570.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12524168275229799694.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12953773099906849002.hoa' '-atoms' '/tmp/LTL11619780686077036570.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL11619780686077036570.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12953773099906849002.hoa
Detected timeout of ITS tools.
[2024-05-28 16:46:22] [INFO ] Flatten gal took : 64 ms
[2024-05-28 16:46:22] [INFO ] Flatten gal took : 47 ms
[2024-05-28 16:46:22] [INFO ] Time to serialize gal into /tmp/LTL6841518536498226735.gal : 11 ms
[2024-05-28 16:46:22] [INFO ] Time to serialize properties into /tmp/LTL8831192481934125648.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6841518536498226735.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8831192481934125648.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(("((((P_1160_3>=4)||(P_1160_1>=4))||((P_1160_2>=4)||(P_1160_8>=4)))||(((P_1160_6>=4)||(P_1160_4>=4))||((P_1160_7>=4)||(P_1160_5>=...653
Formula 0 simplified : X(!"((((P_1160_3>=4)||(P_1160_1>=4))||((P_1160_2>=4)||(P_1160_8>=4)))||(((P_1160_6>=4)||(P_1160_4>=4))||((P_1160_7>=4)||(P_1160_5>=4...645
Detected timeout of ITS tools.
[2024-05-28 16:46:37] [INFO ] Flatten gal took : 67 ms
[2024-05-28 16:46:37] [INFO ] Applying decomposition
[2024-05-28 16:46:37] [INFO ] Flatten gal took : 42 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5312481280765797607.txt' '-o' '/tmp/graph5312481280765797607.bin' '-w' '/tmp/graph5312481280765797607.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5312481280765797607.bin' '-l' '-1' '-v' '-w' '/tmp/graph5312481280765797607.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:46:37] [INFO ] Decomposing Gal with order
[2024-05-28 16:46:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:46:37] [INFO ] Removed a total of 758 redundant transitions.
[2024-05-28 16:46:37] [INFO ] Flatten gal took : 95 ms
[2024-05-28 16:46:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 506 labels/synchronizations in 34 ms.
[2024-05-28 16:46:37] [INFO ] Time to serialize gal into /tmp/LTL10686565012977415655.gal : 10 ms
[2024-05-28 16:46:37] [INFO ] Time to serialize properties into /tmp/LTL11409534280980264700.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10686565012977415655.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11409534280980264700.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(("((((i1.u5.P_1160_3>=4)||(i1.u29.P_1160_1>=4))||((i1.u1.P_1160_2>=4)||(i1.u20.P_1160_8>=4)))||(((i1.u27.P_1160_6>=4)||(i1.u11.P_...874
Formula 0 simplified : X(!"((((i1.u5.P_1160_3>=4)||(i1.u29.P_1160_1>=4))||((i1.u1.P_1160_2>=4)||(i1.u20.P_1160_8>=4)))||(((i1.u27.P_1160_6>=4)||(i1.u11.P_1...866
Detected timeout of ITS tools.
Treatment of property PolyORBLF-PT-S02J04T08-LTLFireability-05 finished in 384820 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 18 ms. Remains 588 /592 variables (removed 4) and now considering 1098/1102 (removed 4) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-28 16:46:53] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 588 cols
[2024-05-28 16:46:53] [INFO ] Computed 40 invariants in 16 ms
[2024-05-28 16:46:53] [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-05-28 16:47:03] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 4 ms to minimize.
[2024-05-28 16:47:03] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:47:04] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:47:04] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 0 ms to minimize.
[2024-05-28 16:47:04] [INFO ] Deduced a trap composed of 64 places in 110 ms of which 3 ms to minimize.
[2024-05-28 16:47:04] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 2 ms to minimize.
[2024-05-28 16:47:04] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:47:04] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:47:05] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 0 ms to minimize.
[2024-05-28 16:47:05] [INFO ] Deduced a trap composed of 114 places in 271 ms of which 4 ms to minimize.
[2024-05-28 16:47:05] [INFO ] Deduced a trap composed of 162 places in 264 ms of which 5 ms to minimize.
[2024-05-28 16:47:06] [INFO ] Deduced a trap composed of 406 places in 311 ms of which 5 ms to minimize.
[2024-05-28 16:47:06] [INFO ] Deduced a trap composed of 79 places in 173 ms of which 2 ms to minimize.
[2024-05-28 16:47:07] [INFO ] Deduced a trap composed of 300 places in 312 ms of which 4 ms to minimize.
[2024-05-28 16:47:09] [INFO ] Deduced a trap composed of 294 places in 325 ms of which 4 ms to minimize.
[2024-05-28 16:47:09] [INFO ] Deduced a trap composed of 299 places in 339 ms of which 4 ms to minimize.
[2024-05-28 16:47:10] [INFO ] Deduced a trap composed of 269 places in 295 ms of which 4 ms to minimize.
[2024-05-28 16:47:11] [INFO ] Deduced a trap composed of 323 places in 315 ms of which 5 ms to minimize.
[2024-05-28 16:47:11] [INFO ] Deduced a trap composed of 339 places in 290 ms of which 4 ms to minimize.
[2024-05-28 16:47:12] [INFO ] Deduced a trap composed of 305 places in 290 ms of which 5 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 20023 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 20035 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 41558ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41573ms
[2024-05-28 16:47:34] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 16:47:34] [INFO ] Invariant cache hit.
[2024-05-28 16:47:35] [INFO ] Implicit Places using invariants in 477 ms returned []
[2024-05-28 16:47:35] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 16:47:35] [INFO ] Invariant cache hit.
[2024-05-28 16:47:35] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 16:47:45] [INFO ] Implicit Places using invariants and state equation in 10149 ms returned []
Implicit Place search using SMT with State Equation took 10628 ms to find 0 implicit places.
Running 1096 sub problems to find dead transitions.
[2024-05-28 16:47:45] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 16:47:45] [INFO ] Invariant cache hit.
[2024-05-28 16:47:45] [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-05-28 16:47:55] [INFO ] Deduced a trap composed of 19 places in 212 ms of which 4 ms to minimize.
[2024-05-28 16:47:55] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 2 ms to minimize.
[2024-05-28 16:47:55] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 1 ms to minimize.
[2024-05-28 16:47:55] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 2 ms to minimize.
[2024-05-28 16:47:55] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 1 ms to minimize.
[2024-05-28 16:47:56] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:47:56] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 2 ms to minimize.
[2024-05-28 16:47:56] [INFO ] Deduced a trap composed of 64 places in 105 ms of which 1 ms to minimize.
[2024-05-28 16:47:56] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:47:57] [INFO ] Deduced a trap composed of 162 places in 328 ms of which 4 ms to minimize.
[2024-05-28 16:47:57] [INFO ] Deduced a trap composed of 396 places in 334 ms of which 4 ms to minimize.
[2024-05-28 16:47:58] [INFO ] Deduced a trap composed of 394 places in 302 ms of which 4 ms to minimize.
[2024-05-28 16:47:58] [INFO ] Deduced a trap composed of 79 places in 148 ms of which 3 ms to minimize.
[2024-05-28 16:47:59] [INFO ] Deduced a trap composed of 326 places in 318 ms of which 4 ms to minimize.
[2024-05-28 16:47:59] [INFO ] Deduced a trap composed of 269 places in 292 ms of which 4 ms to minimize.
[2024-05-28 16:48:01] [INFO ] Deduced a trap composed of 269 places in 301 ms of which 4 ms to minimize.
[2024-05-28 16:48:02] [INFO ] Deduced a trap composed of 3 places in 256 ms of which 3 ms to minimize.
[2024-05-28 16:48:03] [INFO ] Deduced a trap composed of 302 places in 296 ms of which 4 ms to minimize.
[2024-05-28 16:48:03] [INFO ] Deduced a trap composed of 294 places in 242 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
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.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 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 10.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 0.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 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30022 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-05-28 16:48:36] [INFO ] Deduced a trap composed of 375 places in 288 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 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: 0/1096 constraints, Known Traps: 20/20 constraints]
After SMT, in 61447ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 61464ms
Starting structural reductions in LTL mode, iteration 1 : 588/592 places, 1098/1102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113691 ms. Remains : 588/592 places, 1098/1102 transitions.
Stuttering acceptance computed with spot in 390 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 57 steps with 1 reset in 1 ms.
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T08-LTLFireability-07 finished in 114127 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 41 ms. Remains 588 /592 variables (removed 4) and now considering 1098/1102 (removed 4) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-28 16:48:47] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 16:48:47] [INFO ] Invariant cache hit.
[2024-05-28 16:48:47] [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-05-28 16:48:59] [INFO ] Deduced a trap composed of 19 places in 234 ms of which 4 ms to minimize.
[2024-05-28 16:48:59] [INFO ] Deduced a trap composed of 64 places in 103 ms of which 1 ms to minimize.
[2024-05-28 16:48:59] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
[2024-05-28 16:48:59] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 1 ms to minimize.
[2024-05-28 16:48:59] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 2 ms to minimize.
[2024-05-28 16:48:59] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:48:59] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 2 ms to minimize.
[2024-05-28 16:49:00] [INFO ] Deduced a trap composed of 64 places in 120 ms of which 2 ms to minimize.
[2024-05-28 16:49:00] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:49:00] [INFO ] Deduced a trap composed of 162 places in 335 ms of which 5 ms to minimize.
[2024-05-28 16:49:01] [INFO ] Deduced a trap composed of 396 places in 324 ms of which 4 ms to minimize.
[2024-05-28 16:49:01] [INFO ] Deduced a trap composed of 394 places in 270 ms of which 3 ms to minimize.
[2024-05-28 16:49:02] [INFO ] Deduced a trap composed of 79 places in 155 ms of which 3 ms to minimize.
[2024-05-28 16:49:03] [INFO ] Deduced a trap composed of 326 places in 291 ms of which 4 ms to minimize.
[2024-05-28 16:49:03] [INFO ] Deduced a trap composed of 269 places in 309 ms of which 5 ms to minimize.
[2024-05-28 16:49:04] [INFO ] Deduced a trap composed of 269 places in 283 ms of which 4 ms to minimize.
[2024-05-28 16:49:06] [INFO ] Deduced a trap composed of 3 places in 268 ms of which 5 ms to minimize.
[2024-05-28 16:49:07] [INFO ] Deduced a trap composed of 302 places in 291 ms of which 4 ms to minimize.
[2024-05-28 16:49:07] [INFO ] Deduced a trap composed of 294 places in 281 ms of which 4 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 20025 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
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 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: 0/1096 constraints, Known Traps: 19/19 constraints]
After SMT, in 41474ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41493ms
[2024-05-28 16:49:28] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 16:49:28] [INFO ] Invariant cache hit.
[2024-05-28 16:49:29] [INFO ] Implicit Places using invariants in 616 ms returned []
[2024-05-28 16:49:29] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 16:49:29] [INFO ] Invariant cache hit.
[2024-05-28 16:49:30] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 16:49:36] [INFO ] Implicit Places using invariants and state equation in 6719 ms returned []
Implicit Place search using SMT with State Equation took 7337 ms to find 0 implicit places.
Running 1096 sub problems to find dead transitions.
[2024-05-28 16:49:36] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 16:49:36] [INFO ] Invariant cache hit.
[2024-05-28 16:49:36] [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-05-28 16:49:46] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 3 ms to minimize.
[2024-05-28 16:49:46] [INFO ] Deduced a trap composed of 64 places in 112 ms of which 2 ms to minimize.
[2024-05-28 16:49:46] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 1 ms to minimize.
[2024-05-28 16:49:46] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:49:46] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-05-28 16:49:46] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:49:47] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 2 ms to minimize.
[2024-05-28 16:49:47] [INFO ] Deduced a trap composed of 64 places in 103 ms of which 2 ms to minimize.
[2024-05-28 16:49:47] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:49:47] [INFO ] Deduced a trap composed of 162 places in 320 ms of which 4 ms to minimize.
[2024-05-28 16:49:48] [INFO ] Deduced a trap composed of 396 places in 321 ms of which 5 ms to minimize.
[2024-05-28 16:49:48] [INFO ] Deduced a trap composed of 394 places in 317 ms of which 4 ms to minimize.
[2024-05-28 16:49:49] [INFO ] Deduced a trap composed of 79 places in 182 ms of which 2 ms to minimize.
[2024-05-28 16:49:50] [INFO ] Deduced a trap composed of 326 places in 314 ms of which 4 ms to minimize.
[2024-05-28 16:49:50] [INFO ] Deduced a trap composed of 269 places in 294 ms of which 4 ms to minimize.
[2024-05-28 16:49:51] [INFO ] Deduced a trap composed of 269 places in 314 ms of which 4 ms to minimize.
[2024-05-28 16:49:53] [INFO ] Deduced a trap composed of 3 places in 317 ms of which 4 ms to minimize.
[2024-05-28 16:49:54] [INFO ] Deduced a trap composed of 302 places in 338 ms of which 5 ms to minimize.
[2024-05-28 16:49:54] [INFO ] Deduced a trap composed of 294 places in 326 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 19/57 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 57 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30020 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-05-28 16:50:27] [INFO ] Deduced a trap composed of 375 places in 307 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 30023 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 61510ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 61530ms
Starting structural reductions in LTL mode, iteration 1 : 588/592 places, 1098/1102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110417 ms. Remains : 588/592 places, 1098/1102 transitions.
Stuttering acceptance computed with spot in 225 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 3136 steps with 1 reset in 24 ms.
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T08-LTLFireability-09 finished in 110701 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 41 ms. Remains 590 /592 variables (removed 2) and now considering 1100/1102 (removed 2) transitions.
Running 1098 sub problems to find dead transitions.
[2024-05-28 16:50:37] [INFO ] Flow matrix only has 1084 transitions (discarded 16 similar events)
// Phase 1: matrix 1084 rows 590 cols
[2024-05-28 16:50:37] [INFO ] Computed 40 invariants in 29 ms
[2024-05-28 16:50:37] [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-05-28 16:50:48] [INFO ] Deduced a trap composed of 19 places in 198 ms of which 3 ms to minimize.
[2024-05-28 16:50:48] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 1 ms to minimize.
[2024-05-28 16:50:48] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:50:48] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:50:48] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:50:48] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:50:48] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 2 ms to minimize.
[2024-05-28 16:50:49] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:50:49] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:50:49] [INFO ] Deduced a trap composed of 170 places in 331 ms of which 6 ms to minimize.
[2024-05-28 16:50:50] [INFO ] Deduced a trap composed of 396 places in 320 ms of which 7 ms to minimize.
[2024-05-28 16:50:50] [INFO ] Deduced a trap composed of 339 places in 303 ms of which 4 ms to minimize.
[2024-05-28 16:50:50] [INFO ] Deduced a trap composed of 321 places in 203 ms of which 3 ms to minimize.
[2024-05-28 16:50:52] [INFO ] Deduced a trap composed of 326 places in 317 ms of which 4 ms to minimize.
[2024-05-28 16:50:52] [INFO ] Deduced a trap composed of 173 places in 279 ms of which 4 ms to minimize.
[2024-05-28 16:50:53] [INFO ] Deduced a trap composed of 63 places in 152 ms of which 3 ms to minimize.
[2024-05-28 16:50:55] [INFO ] Deduced a trap composed of 291 places in 293 ms of which 4 ms to minimize.
[2024-05-28 16:50:55] [INFO ] Deduced a trap composed of 289 places in 265 ms of which 5 ms to minimize.
[2024-05-28 16:50:56] [INFO ] Deduced a trap composed of 54 places in 315 ms of which 5 ms to minimize.
[2024-05-28 16:50:56] [INFO ] Deduced a trap composed of 296 places in 297 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-05-28 16:50:58] [INFO ] Deduced a trap composed of 295 places in 326 ms of which 4 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 6.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 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 7.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 0.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 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.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 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.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 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 3.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 4.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 1.0)
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 9.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 1.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 1.0)
(s385 1.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 1.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 1.0)
(s407 0.0)
(s408 0.0)
(s409 1.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 1.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 1.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 1.0)
(s550 1.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 6.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 1.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 1.0)
(s580 0.0)
(s581 timeout
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 20024 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-05-28 16:51:15] [INFO ] Deduced a trap composed of 339 places in 320 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 20018 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 41602ms problems are : Problem set: 0 solved, 1098 unsolved
Search for dead transitions found 0 dead transitions in 41622ms
[2024-05-28 16:51:19] [INFO ] Flow matrix only has 1084 transitions (discarded 16 similar events)
[2024-05-28 16:51:19] [INFO ] Invariant cache hit.
[2024-05-28 16:51:20] [INFO ] Implicit Places using invariants in 576 ms returned []
[2024-05-28 16:51:20] [INFO ] Flow matrix only has 1084 transitions (discarded 16 similar events)
[2024-05-28 16:51:20] [INFO ] Invariant cache hit.
[2024-05-28 16:51:20] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 16:51:29] [INFO ] Implicit Places using invariants and state equation in 9411 ms returned []
Implicit Place search using SMT with State Equation took 9988 ms to find 0 implicit places.
Running 1098 sub problems to find dead transitions.
[2024-05-28 16:51:29] [INFO ] Flow matrix only has 1084 transitions (discarded 16 similar events)
[2024-05-28 16:51:29] [INFO ] Invariant cache hit.
[2024-05-28 16:51:29] [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-05-28 16:51:39] [INFO ] Deduced a trap composed of 64 places in 198 ms of which 3 ms to minimize.
[2024-05-28 16:51:39] [INFO ] Deduced a trap composed of 64 places in 167 ms of which 3 ms to minimize.
[2024-05-28 16:51:40] [INFO ] Deduced a trap composed of 19 places in 198 ms of which 3 ms to minimize.
[2024-05-28 16:51:40] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2024-05-28 16:51:40] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2024-05-28 16:51:40] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:51:40] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:51:41] [INFO ] Deduced a trap composed of 64 places in 107 ms of which 2 ms to minimize.
[2024-05-28 16:51:41] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:51:41] [INFO ] Deduced a trap composed of 184 places in 332 ms of which 5 ms to minimize.
[2024-05-28 16:51:42] [INFO ] Deduced a trap composed of 396 places in 323 ms of which 5 ms to minimize.
[2024-05-28 16:51:42] [INFO ] Deduced a trap composed of 395 places in 288 ms of which 4 ms to minimize.
[2024-05-28 16:51:43] [INFO ] Deduced a trap composed of 47 places in 172 ms of which 2 ms to minimize.
[2024-05-28 16:51:43] [INFO ] Deduced a trap composed of 326 places in 320 ms of which 4 ms to minimize.
[2024-05-28 16:51:44] [INFO ] Deduced a trap composed of 277 places in 294 ms of which 4 ms to minimize.
[2024-05-28 16:51:45] [INFO ] Deduced a trap composed of 296 places in 307 ms of which 5 ms to minimize.
[2024-05-28 16:51:45] [INFO ] Deduced a trap composed of 276 places in 315 ms of which 4 ms to minimize.
[2024-05-28 16:51:46] [INFO ] Deduced a trap composed of 3 places in 319 ms of which 4 ms to minimize.
[2024-05-28 16:51:47] [INFO ] Deduced a trap composed of 167 places in 286 ms of which 3 ms to minimize.
[2024-05-28 16:51:48] [INFO ] Deduced a trap composed of 356 places in 336 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-05-28 16:51:51] [INFO ] Deduced a trap composed of 331 places in 330 ms of which 5 ms to minimize.
[2024-05-28 16:51:52] [INFO ] Deduced a trap composed of 320 places in 290 ms of which 4 ms to minimize.
[2024-05-28 16:51:52] [INFO ] Deduced a trap composed of 348 places in 309 ms of which 4 ms to minimize.
[2024-05-28 16:51:52] [INFO ] Deduced a trap composed of 308 places in 293 ms of which 4 ms to minimize.
[2024-05-28 16:51:55] [INFO ] Deduced a trap composed of 54 places in 326 ms of which 4 ms to minimize.
[2024-05-28 16:51:55] [INFO ] Deduced a trap composed of 309 places in 302 ms of which 4 ms to minimize.
[2024-05-28 16:51:55] [INFO ] Deduced a trap composed of 296 places in 273 ms of which 4 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 30028 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 30031 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 61551ms problems are : Problem set: 0 solved, 1098 unsolved
Search for dead transitions found 0 dead transitions in 61565ms
Starting structural reductions in LTL mode, iteration 1 : 590/592 places, 1100/1102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113223 ms. Remains : 590/592 places, 1100/1102 transitions.
Stuttering acceptance computed with spot in 275 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 559 ms.
Product exploration explored 100000 steps with 50000 reset in 478 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 31 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 114602 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 21 ms. Remains 590 /592 variables (removed 2) and now considering 1100/1102 (removed 2) transitions.
Running 1098 sub problems to find dead transitions.
[2024-05-28 16:52:32] [INFO ] Flow matrix only has 1084 transitions (discarded 16 similar events)
// Phase 1: matrix 1084 rows 590 cols
[2024-05-28 16:52:32] [INFO ] Computed 40 invariants in 20 ms
[2024-05-28 16:52:32] [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-05-28 16:52:42] [INFO ] Deduced a trap composed of 66 places in 230 ms of which 4 ms to minimize.
[2024-05-28 16:52:43] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 3 ms to minimize.
[2024-05-28 16:52:43] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 1 ms to minimize.
[2024-05-28 16:52:43] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:52:43] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:52:43] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:52:43] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 0 ms to minimize.
[2024-05-28 16:52:43] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 1 ms to minimize.
[2024-05-28 16:52:44] [INFO ] Deduced a trap composed of 64 places in 303 ms of which 4 ms to minimize.
[2024-05-28 16:52:44] [INFO ] Deduced a trap composed of 173 places in 257 ms of which 4 ms to minimize.
[2024-05-28 16:52:45] [INFO ] Deduced a trap composed of 410 places in 280 ms of which 4 ms to minimize.
[2024-05-28 16:52:45] [INFO ] Deduced a trap composed of 396 places in 253 ms of which 4 ms to minimize.
[2024-05-28 16:52:46] [INFO ] Deduced a trap composed of 79 places in 161 ms of which 2 ms to minimize.
[2024-05-28 16:52:46] [INFO ] Deduced a trap composed of 308 places in 298 ms of which 5 ms to minimize.
[2024-05-28 16:52:47] [INFO ] Deduced a trap composed of 139 places in 290 ms of which 4 ms to minimize.
[2024-05-28 16:52:48] [INFO ] Deduced a trap composed of 331 places in 292 ms of which 4 ms to minimize.
[2024-05-28 16:52:48] [INFO ] Deduced a trap composed of 312 places in 263 ms of which 4 ms to minimize.
[2024-05-28 16:52:48] [INFO ] Deduced a trap composed of 320 places in 286 ms of which 4 ms to minimize.
[2024-05-28 16:52:49] [INFO ] Deduced a trap composed of 311 places in 289 ms of which 4 ms to minimize.
[2024-05-28 16:52:49] [INFO ] Deduced a trap composed of 296 places in 283 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/588 variables, 20/57 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 57 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 20026 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: 20/20 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, 20/57 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 16:53:06] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 2 ms to minimize.
[2024-05-28 16:53:07] [INFO ] Deduced a trap composed of 54 places in 355 ms of which 5 ms to minimize.
[2024-05-28 16:53:08] [INFO ] Deduced a trap composed of 304 places in 339 ms of which 4 ms to minimize.
[2024-05-28 16:53:11] [INFO ] Deduced a trap composed of 332 places in 312 ms of which 4 ms to minimize.
[2024-05-28 16:53:13] [INFO ] Deduced a trap composed of 295 places in 357 ms of which 4 ms to minimize.
[2024-05-28 16:53:13] [INFO ] Deduced a trap composed of 324 places in 314 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 588/1674 variables, and 63 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 20052 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: 26/26 constraints]
After SMT, in 41370ms problems are : Problem set: 0 solved, 1098 unsolved
Search for dead transitions found 0 dead transitions in 41387ms
[2024-05-28 16:53:13] [INFO ] Flow matrix only has 1084 transitions (discarded 16 similar events)
[2024-05-28 16:53:13] [INFO ] Invariant cache hit.
[2024-05-28 16:53:14] [INFO ] Implicit Places using invariants in 633 ms returned []
[2024-05-28 16:53:14] [INFO ] Flow matrix only has 1084 transitions (discarded 16 similar events)
[2024-05-28 16:53:14] [INFO ] Invariant cache hit.
[2024-05-28 16:53:15] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 16:53:22] [INFO ] Implicit Places using invariants and state equation in 7537 ms returned []
Implicit Place search using SMT with State Equation took 8173 ms to find 0 implicit places.
Running 1098 sub problems to find dead transitions.
[2024-05-28 16:53:22] [INFO ] Flow matrix only has 1084 transitions (discarded 16 similar events)
[2024-05-28 16:53:22] [INFO ] Invariant cache hit.
[2024-05-28 16:53:22] [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-05-28 16:53:32] [INFO ] Deduced a trap composed of 64 places in 213 ms of which 3 ms to minimize.
[2024-05-28 16:53:32] [INFO ] Deduced a trap composed of 19 places in 198 ms of which 4 ms to minimize.
[2024-05-28 16:53:32] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:53:32] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
[2024-05-28 16:53:32] [INFO ] Deduced a trap composed of 66 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:53:33] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:53:33] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:53:33] [INFO ] Deduced a trap composed of 164 places in 302 ms of which 4 ms to minimize.
[2024-05-28 16:53:33] [INFO ] Deduced a trap composed of 64 places in 321 ms of which 4 ms to minimize.
[2024-05-28 16:53:34] [INFO ] Deduced a trap composed of 289 places in 323 ms of which 5 ms to minimize.
[2024-05-28 16:53:34] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:53:34] [INFO ] Deduced a trap composed of 54 places in 299 ms of which 4 ms to minimize.
[2024-05-28 16:53:35] [INFO ] Deduced a trap composed of 396 places in 304 ms of which 4 ms to minimize.
[2024-05-28 16:53:36] [INFO ] Deduced a trap composed of 79 places in 207 ms of which 3 ms to minimize.
[2024-05-28 16:53:37] [INFO ] Deduced a trap composed of 116 places in 300 ms of which 4 ms to minimize.
[2024-05-28 16:53:37] [INFO ] Deduced a trap composed of 329 places in 317 ms of which 4 ms to minimize.
[2024-05-28 16:53:37] [INFO ] Deduced a trap composed of 319 places in 332 ms of which 5 ms to minimize.
[2024-05-28 16:53:38] [INFO ] Deduced a trap composed of 320 places in 310 ms of which 3 ms to minimize.
[2024-05-28 16:53:39] [INFO ] Deduced a trap composed of 298 places in 335 ms of which 5 ms to minimize.
[2024-05-28 16:53:39] [INFO ] Deduced a trap composed of 310 places in 232 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-05-28 16:53:42] [INFO ] Deduced a trap composed of 286 places in 339 ms of which 5 ms to minimize.
[2024-05-28 16:53:43] [INFO ] Deduced a trap composed of 296 places in 291 ms of which 4 ms to minimize.
[2024-05-28 16:53:49] [INFO ] Deduced a trap composed of 295 places in 329 ms of which 5 ms to minimize.
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 30038 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-05-28 16:54:15] [INFO ] Deduced a trap composed of 339 places in 298 ms of which 5 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 30019 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 61456ms problems are : Problem set: 0 solved, 1098 unsolved
Search for dead transitions found 0 dead transitions in 61479ms
Starting structural reductions in LTL mode, iteration 1 : 590/592 places, 1100/1102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111069 ms. Remains : 590/592 places, 1100/1102 transitions.
Stuttering acceptance computed with spot in 183 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 1120 steps with 0 reset in 8 ms.
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T08-LTLFireability-12 finished in 111283 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 80 ms. Remains 408 /592 variables (removed 184) and now considering 918/1102 (removed 184) transitions.
Running 916 sub problems to find dead transitions.
[2024-05-28 16:54:23] [INFO ] Flow matrix only has 902 transitions (discarded 16 similar events)
// Phase 1: matrix 902 rows 408 cols
[2024-05-28 16:54:23] [INFO ] Computed 40 invariants in 17 ms
[2024-05-28 16:54:23] [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-05-28 16:54:30] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 2 ms to minimize.
[2024-05-28 16:54:30] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 2 ms to minimize.
[2024-05-28 16:54:30] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:54:30] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 0 ms to minimize.
[2024-05-28 16:54:30] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 1 ms to minimize.
[2024-05-28 16:54:31] [INFO ] Deduced a trap composed of 83 places in 224 ms of which 3 ms to minimize.
[2024-05-28 16:54:31] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 2 ms to minimize.
[2024-05-28 16:54:31] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 1 ms to minimize.
[2024-05-28 16:54:31] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 2 ms to minimize.
[2024-05-28 16:54:31] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 0 ms to minimize.
[2024-05-28 16:54:31] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 0 ms to minimize.
[2024-05-28 16:54:31] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:54:32] [INFO ] Deduced a trap composed of 39 places in 158 ms of which 2 ms to minimize.
[2024-05-28 16:54:32] [INFO ] Deduced a trap composed of 149 places in 256 ms of which 3 ms to minimize.
[2024-05-28 16:54:33] [INFO ] Deduced a trap composed of 184 places in 237 ms of which 3 ms to minimize.
[2024-05-28 16:54:33] [INFO ] Deduced a trap composed of 144 places in 238 ms of which 3 ms to minimize.
[2024-05-28 16:54:33] [INFO ] Deduced a trap composed of 204 places in 276 ms of which 3 ms to minimize.
[2024-05-28 16:54:34] [INFO ] Deduced a trap composed of 133 places in 214 ms of which 3 ms to minimize.
[2024-05-28 16:54:34] [INFO ] Deduced a trap composed of 160 places in 225 ms of which 3 ms to minimize.
[2024-05-28 16:54:34] [INFO ] Deduced a trap composed of 153 places in 209 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
[2024-05-28 16:54:35] [INFO ] Deduced a trap composed of 174 places in 223 ms of which 3 ms to minimize.
[2024-05-28 16:54:37] [INFO ] Deduced a trap composed of 205 places in 218 ms of which 3 ms to minimize.
[2024-05-28 16:54:37] [INFO ] Deduced a trap composed of 150 places in 198 ms of which 3 ms to minimize.
[2024-05-28 16:54:38] [INFO ] Deduced a trap composed of 244 places in 240 ms of which 3 ms to minimize.
[2024-05-28 16:54:39] [INFO ] Deduced a trap composed of 46 places in 223 ms of which 3 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 20017 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-05-28 16:54:58] [INFO ] Deduced a trap composed of 162 places in 227 ms of which 3 ms to minimize.
[2024-05-28 16:55:00] [INFO ] Deduced a trap composed of 41 places in 225 ms of which 3 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 41398ms problems are : Problem set: 0 solved, 916 unsolved
Search for dead transitions found 0 dead transitions in 41409ms
[2024-05-28 16:55:05] [INFO ] Flow matrix only has 902 transitions (discarded 16 similar events)
[2024-05-28 16:55:05] [INFO ] Invariant cache hit.
[2024-05-28 16:55:05] [INFO ] Implicit Places using invariants in 517 ms returned []
[2024-05-28 16:55:05] [INFO ] Flow matrix only has 902 transitions (discarded 16 similar events)
[2024-05-28 16:55:05] [INFO ] Invariant cache hit.
[2024-05-28 16:55:06] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 16:55:12] [INFO ] Implicit Places using invariants and state equation in 6262 ms returned []
Implicit Place search using SMT with State Equation took 6780 ms to find 0 implicit places.
[2024-05-28 16:55:12] [INFO ] Redundant transitions in 15 ms returned []
Running 916 sub problems to find dead transitions.
[2024-05-28 16:55:12] [INFO ] Flow matrix only has 902 transitions (discarded 16 similar events)
[2024-05-28 16:55:12] [INFO ] Invariant cache hit.
[2024-05-28 16:55:12] [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-05-28 16:55:18] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 2 ms to minimize.
[2024-05-28 16:55:18] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:55:18] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:55:19] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:55:19] [INFO ] Deduced a trap composed of 83 places in 257 ms of which 3 ms to minimize.
[2024-05-28 16:55:19] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:55:19] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:55:19] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:55:19] [INFO ] Deduced a trap composed of 41 places in 287 ms of which 4 ms to minimize.
[2024-05-28 16:55:20] [INFO ] Deduced a trap composed of 60 places in 231 ms of which 3 ms to minimize.
[2024-05-28 16:55:20] [INFO ] Deduced a trap composed of 153 places in 245 ms of which 3 ms to minimize.
[2024-05-28 16:55:20] [INFO ] Deduced a trap composed of 25 places in 229 ms of which 3 ms to minimize.
[2024-05-28 16:55:21] [INFO ] Deduced a trap composed of 64 places in 149 ms of which 2 ms to minimize.
[2024-05-28 16:55:22] [INFO ] Deduced a trap composed of 221 places in 242 ms of which 3 ms to minimize.
[2024-05-28 16:55:22] [INFO ] Deduced a trap composed of 150 places in 224 ms of which 3 ms to minimize.
[2024-05-28 16:55:23] [INFO ] Deduced a trap composed of 244 places in 227 ms of which 3 ms to minimize.
[2024-05-28 16:55:23] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 2 ms to minimize.
[2024-05-28 16:55:28] [INFO ] Deduced a trap composed of 41 places in 217 ms of which 2 ms to minimize.
[2024-05-28 16:55:28] [INFO ] Deduced a trap composed of 149 places in 201 ms of which 3 ms to minimize.
[2024-05-28 16:55:29] [INFO ] Deduced a trap composed of 177 places in 178 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
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 10.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 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 10.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 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 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.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 1.0)
(s114 0.0)
(s115 0.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 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.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 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 10.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 1.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 1.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 1.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 916 unsolved
SMT process timed out in 31460ms, After SMT, problems are : Problem set: 0 solved, 916 unsolved
Search for dead transitions found 0 dead transitions in 31474ms
Starting structural reductions in SI_LTL mode, iteration 1 : 408/592 places, 918/1102 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 79774 ms. Remains : 408/592 places, 918/1102 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J04T08-LTLFireability-13
Stuttering criterion allowed to conclude after 411 steps with 2 reset in 3 ms.
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T08-LTLFireability-13 finished in 79856 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 50 ms. Remains 398 /592 variables (removed 194) and now considering 908/1102 (removed 194) transitions.
Running 906 sub problems to find dead transitions.
[2024-05-28 16:55:43] [INFO ] Flow matrix only has 892 transitions (discarded 16 similar events)
// Phase 1: matrix 892 rows 398 cols
[2024-05-28 16:55:43] [INFO ] Computed 40 invariants in 16 ms
[2024-05-28 16:55:43] [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-05-28 16:55:49] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:55:49] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 0 ms to minimize.
[2024-05-28 16:55:49] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:55:49] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:55:49] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:55:50] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:55:50] [INFO ] Deduced a trap composed of 41 places in 267 ms of which 3 ms to minimize.
[2024-05-28 16:55:50] [INFO ] Deduced a trap composed of 75 places in 192 ms of which 3 ms to minimize.
[2024-05-28 16:55:50] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:55:50] [INFO ] Deduced a trap composed of 154 places in 187 ms of which 2 ms to minimize.
[2024-05-28 16:55:51] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 1 ms to minimize.
[2024-05-28 16:55:51] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 2 ms to minimize.
[2024-05-28 16:55:51] [INFO ] Deduced a trap composed of 142 places in 148 ms of which 2 ms to minimize.
[2024-05-28 16:55:53] [INFO ] Deduced a trap composed of 234 places in 247 ms of which 3 ms to minimize.
[2024-05-28 16:55:56] [INFO ] Deduced a trap composed of 187 places in 229 ms of which 3 ms to minimize.
[2024-05-28 16:55:57] [INFO ] Deduced a trap composed of 167 places in 216 ms of which 3 ms to minimize.
[2024-05-28 16:55:58] [INFO ] Deduced a trap composed of 188 places in 232 ms of which 3 ms to minimize.
[2024-05-28 16:55:59] [INFO ] Deduced a trap composed of 169 places in 219 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
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)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 20019 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-05-28 16:56:16] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 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 20031 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 41513ms problems are : Problem set: 0 solved, 906 unsolved
Search for dead transitions found 0 dead transitions in 41521ms
[2024-05-28 16:56:25] [INFO ] Flow matrix only has 892 transitions (discarded 16 similar events)
[2024-05-28 16:56:25] [INFO ] Invariant cache hit.
[2024-05-28 16:56:25] [INFO ] Implicit Places using invariants in 494 ms returned []
[2024-05-28 16:56:25] [INFO ] Flow matrix only has 892 transitions (discarded 16 similar events)
[2024-05-28 16:56:25] [INFO ] Invariant cache hit.
[2024-05-28 16:56:26] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 16:56:32] [INFO ] Implicit Places using invariants and state equation in 6697 ms returned []
Implicit Place search using SMT with State Equation took 7215 ms to find 0 implicit places.
[2024-05-28 16:56:32] [INFO ] Redundant transitions in 24 ms returned []
Running 906 sub problems to find dead transitions.
[2024-05-28 16:56:32] [INFO ] Flow matrix only has 892 transitions (discarded 16 similar events)
[2024-05-28 16:56:32] [INFO ] Invariant cache hit.
[2024-05-28 16:56:32] [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-05-28 16:56:38] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 2 ms to minimize.
[2024-05-28 16:56:39] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
[2024-05-28 16:56:39] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:56:39] [INFO ] Deduced a trap composed of 58 places in 206 ms of which 3 ms to minimize.
[2024-05-28 16:56:39] [INFO ] Deduced a trap composed of 71 places in 190 ms of which 3 ms to minimize.
[2024-05-28 16:56:39] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 1 ms to minimize.
[2024-05-28 16:56:40] [INFO ] Deduced a trap composed of 40 places in 204 ms of which 3 ms to minimize.
[2024-05-28 16:56:40] [INFO ] Deduced a trap composed of 156 places in 196 ms of which 3 ms to minimize.
[2024-05-28 16:56:40] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:56:40] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 0 ms to minimize.
[2024-05-28 16:56:40] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 2 ms to minimize.
[2024-05-28 16:56:40] [INFO ] Deduced a trap composed of 19 places in 181 ms of which 2 ms to minimize.
[2024-05-28 16:56:41] [INFO ] Deduced a trap composed of 31 places in 203 ms of which 2 ms to minimize.
[2024-05-28 16:56:41] [INFO ] Deduced a trap composed of 142 places in 333 ms of which 3 ms to minimize.
[2024-05-28 16:56:42] [INFO ] Deduced a trap composed of 167 places in 237 ms of which 3 ms to minimize.
[2024-05-28 16:56:43] [INFO ] Deduced a trap composed of 234 places in 217 ms of which 3 ms to minimize.
[2024-05-28 16:56:48] [INFO ] Deduced a trap composed of 154 places in 228 ms of which 3 ms to minimize.
[2024-05-28 16:56:49] [INFO ] Deduced a trap composed of 134 places in 286 ms of which 3 ms to minimize.
[2024-05-28 16:56:49] [INFO ] Deduced a trap composed of 123 places in 192 ms of which 3 ms to minimize.
[2024-05-28 16:56:49] [INFO ] Deduced a trap composed of 169 places in 213 ms of which 3 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
At refinement iteration 4 (OVERLAPS) 2/398 variables, 3/60 constraints. Problems are: Problem set: 8 solved, 898 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 398/1290 variables, and 60 constraints, problems are : Problem set: 8 solved, 898 unsolved in 30028 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: 20/20 constraints]
Escalating to Integer solving :Problem set: 8 solved, 898 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 14/14 constraints. Problems are: Problem set: 8 solved, 898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/396 variables, 23/37 constraints. Problems are: Problem set: 8 solved, 898 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 20/57 constraints. Problems are: Problem set: 8 solved, 898 unsolved
[2024-05-28 16:57:16] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:57:20] [INFO ] Deduced a trap composed of 149 places in 283 ms of which 3 ms to minimize.
[2024-05-28 16:57:20] [INFO ] Deduced a trap composed of 181 places in 258 ms of which 3 ms to minimize.
[2024-05-28 16:57:21] [INFO ] Deduced a trap composed of 198 places in 264 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 4/61 constraints. Problems are: Problem set: 8 solved, 898 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 396/1290 variables, and 61 constraints, problems are : Problem set: 8 solved, 898 unsolved in 30034 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: 24/24 constraints]
After SMT, in 61581ms problems are : Problem set: 8 solved, 898 unsolved
Search for dead transitions found 8 dead transitions in 61595ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 398/592 places, 900/1102 transitions.
Applied a total of 0 rules in 13 ms. Remains 398 /398 variables (removed 0) and now considering 900/900 (removed 0) transitions.
[2024-05-28 16:57:34] [INFO ] Redundant transitions in 9 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 110455 ms. Remains : 398/592 places, 900/1102 transitions.
Stuttering acceptance computed with spot in 105 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 595 ms.
Stack based approach found an accepted trace after 6594 steps with 3 reset with depth 3259 and stack size 3227 in 42 ms.
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-PT-S02J04T08-LTLFireability-14 finished in 111219 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 131 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 0 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 64 ms. Remains 414 /592 variables (removed 178) and now considering 924/1102 (removed 178) transitions.
Running 922 sub problems to find dead transitions.
[2024-05-28 16:57:35] [INFO ] Flow matrix only has 908 transitions (discarded 16 similar events)
// Phase 1: matrix 908 rows 414 cols
[2024-05-28 16:57:35] [INFO ] Computed 40 invariants in 23 ms
[2024-05-28 16:57:35] [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-05-28 16:57:42] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 2 ms to minimize.
[2024-05-28 16:57:42] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 0 ms to minimize.
[2024-05-28 16:57:42] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:57:42] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:57:42] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:57:42] [INFO ] Deduced a trap composed of 101 places in 247 ms of which 3 ms to minimize.
[2024-05-28 16:57:42] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 0 ms to minimize.
[2024-05-28 16:57:43] [INFO ] Deduced a trap composed of 42 places in 242 ms of which 3 ms to minimize.
[2024-05-28 16:57:43] [INFO ] Deduced a trap composed of 19 places in 205 ms of which 3 ms to minimize.
[2024-05-28 16:57:43] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:57:43] [INFO ] Deduced a trap composed of 271 places in 240 ms of which 3 ms to minimize.
[2024-05-28 16:57:44] [INFO ] Deduced a trap composed of 43 places in 220 ms of which 2 ms to minimize.
[2024-05-28 16:57:44] [INFO ] Deduced a trap composed of 158 places in 186 ms of which 2 ms to minimize.
[2024-05-28 16:57:45] [INFO ] Deduced a trap composed of 250 places in 178 ms of which 3 ms to minimize.
[2024-05-28 16:57:50] [INFO ] Deduced a trap composed of 171 places in 248 ms of which 3 ms to minimize.
[2024-05-28 16:57:50] [INFO ] Deduced a trap composed of 170 places in 218 ms of which 3 ms to minimize.
[2024-05-28 16:57:50] [INFO ] Deduced a trap composed of 184 places in 191 ms of which 2 ms to minimize.
[2024-05-28 16:57:52] [INFO ] Deduced a trap composed of 181 places in 270 ms of which 3 ms to minimize.
[2024-05-28 16:57:53] [INFO ] Deduced a trap composed of 197 places in 238 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-05-28 16:57:56] [INFO ] Deduced a trap composed of 168 places in 248 ms of which 4 ms to minimize.
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 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: 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 20022 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 41522ms problems are : Problem set: 0 solved, 922 unsolved
Search for dead transitions found 0 dead transitions in 41534ms
[2024-05-28 16:58:16] [INFO ] Flow matrix only has 908 transitions (discarded 16 similar events)
[2024-05-28 16:58:16] [INFO ] Invariant cache hit.
[2024-05-28 16:58:17] [INFO ] Implicit Places using invariants in 503 ms returned []
[2024-05-28 16:58:17] [INFO ] Flow matrix only has 908 transitions (discarded 16 similar events)
[2024-05-28 16:58:17] [INFO ] Invariant cache hit.
[2024-05-28 16:58:18] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 16:58:21] [INFO ] Implicit Places using invariants and state equation in 4265 ms returned []
Implicit Place search using SMT with State Equation took 4775 ms to find 0 implicit places.
Running 922 sub problems to find dead transitions.
[2024-05-28 16:58:21] [INFO ] Flow matrix only has 908 transitions (discarded 16 similar events)
[2024-05-28 16:58:21] [INFO ] Invariant cache hit.
[2024-05-28 16:58:21] [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-05-28 16:58:28] [INFO ] Deduced a trap composed of 42 places in 245 ms of which 3 ms to minimize.
[2024-05-28 16:58:28] [INFO ] Deduced a trap composed of 123 places in 221 ms of which 3 ms to minimize.
[2024-05-28 16:58:28] [INFO ] Deduced a trap composed of 87 places in 167 ms of which 2 ms to minimize.
[2024-05-28 16:58:28] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:58:28] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:58:28] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 0 ms to minimize.
[2024-05-28 16:58:28] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 1 ms to minimize.
[2024-05-28 16:58:28] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 2 ms to minimize.
[2024-05-28 16:58:29] [INFO ] Deduced a trap composed of 155 places in 178 ms of which 3 ms to minimize.
[2024-05-28 16:58:29] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 0 ms to minimize.
[2024-05-28 16:58:29] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:58:29] [INFO ] Deduced a trap composed of 42 places in 31 ms of which 0 ms to minimize.
[2024-05-28 16:58:29] [INFO ] Deduced a trap composed of 31 places in 168 ms of which 2 ms to minimize.
[2024-05-28 16:58:30] [INFO ] Deduced a trap composed of 149 places in 255 ms of which 3 ms to minimize.
[2024-05-28 16:58:30] [INFO ] Deduced a trap composed of 210 places in 242 ms of which 3 ms to minimize.
[2024-05-28 16:58:31] [INFO ] Deduced a trap composed of 158 places in 227 ms of which 3 ms to minimize.
[2024-05-28 16:58:32] [INFO ] Deduced a trap composed of 252 places in 230 ms of which 3 ms to minimize.
[2024-05-28 16:58:37] [INFO ] Deduced a trap composed of 250 places in 162 ms of which 2 ms to minimize.
[2024-05-28 16:58:37] [INFO ] Deduced a trap composed of 62 places in 170 ms of which 2 ms to minimize.
[2024-05-28 16:58:39] [INFO ] Deduced a trap composed of 185 places in 188 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-05-28 16:58:46] [INFO ] Deduced a trap composed of 166 places in 221 ms of which 3 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 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: 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-05-28 16:59:21] [INFO ] Deduced a trap composed of 155 places in 252 ms of which 3 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 30030 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 61454ms problems are : Problem set: 88 solved, 834 unsolved
Search for dead transitions found 88 dead transitions in 61472ms
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 23 ms. Remains 396 /414 variables (removed 18) and now considering 804/836 (removed 32) transitions.
[2024-05-28 16:59:23] [INFO ] Flow matrix only has 788 transitions (discarded 16 similar events)
// Phase 1: matrix 788 rows 396 cols
[2024-05-28 16:59:23] [INFO ] Computed 40 invariants in 9 ms
[2024-05-28 16:59:23] [INFO ] Implicit Places using invariants in 397 ms returned []
[2024-05-28 16:59:23] [INFO ] Flow matrix only has 788 transitions (discarded 16 similar events)
[2024-05-28 16:59:23] [INFO ] Invariant cache hit.
[2024-05-28 16:59:24] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 16:59:26] [INFO ] Implicit Places using invariants and state equation in 2917 ms returned []
Implicit Place search using SMT with State Equation took 3315 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 111194 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 4580 reset in 472 ms.
Product exploration explored 100000 steps with 4698 reset in 377 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 98 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 125 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 168 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 129 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 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
[2024-05-28 16:59:27] [INFO ] Flow matrix only has 788 transitions (discarded 16 similar events)
[2024-05-28 16:59:27] [INFO ] Invariant cache hit.
[2024-05-28 16:59:28] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-28 16:59:28] [INFO ] [Real]Absence check using 12 positive and 28 generalized place invariants in 42 ms returned sat
[2024-05-28 16:59:29] [INFO ] [Real]Absence check using state equation in 824 ms returned sat
[2024-05-28 16:59:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:59:29] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-28 16:59:29] [INFO ] [Nat]Absence check using 12 positive and 28 generalized place invariants in 42 ms returned sat
[2024-05-28 16:59:30] [INFO ] [Nat]Absence check using state equation in 1059 ms returned sat
[2024-05-28 16:59:30] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 16:59:30] [INFO ] [Nat]Added 96 Read/Feed constraints in 90 ms returned sat
[2024-05-28 16:59:30] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 1 ms to minimize.
[2024-05-28 16:59:30] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:59:31] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:59:31] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:59:31] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:59:31] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:59:31] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:59:31] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1119 ms
[2024-05-28 16:59:31] [INFO ] Computed and/alt/rep : 370/1309/362 causal constraints (skipped 424 transitions) in 80 ms.
[2024-05-28 16:59:33] [INFO ] Added : 200 causal constraints over 40 iterations in 2143 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 14 ms. Remains 396 /396 variables (removed 0) and now considering 804/804 (removed 0) transitions.
Running 802 sub problems to find dead transitions.
[2024-05-28 16:59:33] [INFO ] Flow matrix only has 788 transitions (discarded 16 similar events)
[2024-05-28 16:59:33] [INFO ] Invariant cache hit.
[2024-05-28 16:59:33] [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-05-28 16:59:38] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:59:38] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 0 ms to minimize.
[2024-05-28 16:59:38] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:59:39] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 0 ms to minimize.
[2024-05-28 16:59:39] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:59:39] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:59:39] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 0 ms to minimize.
[2024-05-28 16:59:39] [INFO ] Deduced a trap composed of 206 places in 187 ms of which 2 ms to minimize.
[2024-05-28 16:59:39] [INFO ] Deduced a trap composed of 200 places in 167 ms of which 2 ms to minimize.
[2024-05-28 16:59:39] [INFO ] Deduced a trap composed of 77 places in 173 ms of which 2 ms to minimize.
[2024-05-28 16:59:40] [INFO ] Deduced a trap composed of 199 places in 203 ms of which 4 ms to minimize.
[2024-05-28 16:59:40] [INFO ] Deduced a trap composed of 220 places in 178 ms of which 3 ms to minimize.
[2024-05-28 16:59:40] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 1 ms to minimize.
[2024-05-28 16:59:40] [INFO ] Deduced a trap composed of 191 places in 243 ms of which 3 ms to minimize.
[2024-05-28 16:59:40] [INFO ] Deduced a trap composed of 37 places in 227 ms of which 3 ms to minimize.
[2024-05-28 16:59:40] [INFO ] Deduced a trap composed of 258 places in 182 ms of which 3 ms to minimize.
[2024-05-28 16:59:41] [INFO ] Deduced a trap composed of 213 places in 184 ms of which 2 ms to minimize.
[2024-05-28 16:59:41] [INFO ] Deduced a trap composed of 223 places in 213 ms of which 3 ms to minimize.
[2024-05-28 16:59:41] [INFO ] Deduced a trap composed of 204 places in 180 ms of which 3 ms to minimize.
[2024-05-28 16:59:41] [INFO ] Deduced a trap composed of 224 places in 226 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 802 unsolved
[2024-05-28 16:59:42] [INFO ] Deduced a trap composed of 192 places in 197 ms of which 3 ms to minimize.
[2024-05-28 16:59:42] [INFO ] Deduced a trap composed of 50 places in 192 ms of which 3 ms to minimize.
[2024-05-28 16:59:43] [INFO ] Deduced a trap composed of 140 places in 133 ms of which 2 ms to minimize.
[2024-05-28 16:59:43] [INFO ] Deduced a trap composed of 206 places in 135 ms of which 2 ms to minimize.
[2024-05-28 16:59:43] [INFO ] Deduced a trap composed of 215 places in 181 ms of which 3 ms to minimize.
[2024-05-28 16:59:43] [INFO ] Deduced a trap composed of 220 places in 140 ms of which 2 ms to minimize.
[2024-05-28 16:59:43] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 2 ms to minimize.
[2024-05-28 16:59:43] [INFO ] Deduced a trap composed of 189 places in 148 ms of which 2 ms to minimize.
[2024-05-28 16:59:44] [INFO ] Deduced a trap composed of 210 places in 147 ms of which 2 ms to minimize.
[2024-05-28 16:59:44] [INFO ] Deduced a trap composed of 262 places in 196 ms of which 3 ms to minimize.
[2024-05-28 16:59:44] [INFO ] Deduced a trap composed of 224 places in 142 ms of which 2 ms to minimize.
[2024-05-28 16:59:44] [INFO ] Deduced a trap composed of 231 places in 195 ms of which 3 ms to minimize.
[2024-05-28 16:59:44] [INFO ] Deduced a trap composed of 244 places in 164 ms of which 2 ms to minimize.
[2024-05-28 16:59:45] [INFO ] Deduced a trap composed of 265 places in 139 ms of which 2 ms to minimize.
[2024-05-28 16:59:45] [INFO ] Deduced a trap composed of 231 places in 175 ms of which 2 ms to minimize.
[2024-05-28 16:59:45] [INFO ] Deduced a trap composed of 130 places in 171 ms of which 2 ms to minimize.
[2024-05-28 16:59:45] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 2 ms to minimize.
[2024-05-28 16:59:45] [INFO ] Deduced a trap composed of 189 places in 210 ms of which 3 ms to minimize.
[2024-05-28 16:59:46] [INFO ] Deduced a trap composed of 179 places in 150 ms of which 2 ms to minimize.
[2024-05-28 16:59:46] [INFO ] Deduced a trap composed of 19 places in 183 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-05-28 16:59:51] [INFO ] Deduced a trap composed of 232 places in 133 ms of which 2 ms to minimize.
[2024-05-28 16:59:52] [INFO ] Deduced a trap composed of 206 places in 132 ms of which 2 ms to minimize.
[2024-05-28 16:59:52] [INFO ] Deduced a trap composed of 224 places in 147 ms of which 2 ms to minimize.
[2024-05-28 16:59:52] [INFO ] Deduced a trap composed of 215 places in 136 ms of which 2 ms to minimize.
[2024-05-28 16:59:52] [INFO ] Deduced a trap composed of 139 places in 143 ms of which 2 ms to minimize.
[2024-05-28 16:59:52] [INFO ] Deduced a trap composed of 116 places in 143 ms of which 2 ms to minimize.
[2024-05-28 16:59:53] [INFO ] Deduced a trap composed of 206 places in 134 ms of which 2 ms to minimize.
[2024-05-28 16:59:53] [INFO ] Deduced a trap composed of 214 places in 146 ms of which 2 ms to minimize.
[2024-05-28 16:59:54] [INFO ] Deduced a trap composed of 214 places in 147 ms of which 2 ms to minimize.
[2024-05-28 16:59:54] [INFO ] Deduced a trap composed of 219 places in 144 ms of which 2 ms to minimize.
[2024-05-28 16:59:54] [INFO ] Deduced a trap composed of 221 places in 144 ms of which 2 ms to minimize.
[2024-05-28 16:59:54] [INFO ] Deduced a trap composed of 216 places in 207 ms of which 3 ms to minimize.
[2024-05-28 16:59:54] [INFO ] Deduced a trap composed of 214 places in 144 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 394/1184 variables, and 90 constraints, problems are : Problem set: 0 solved, 802 unsolved in 20019 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: 53/53 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, 53/90 constraints. Problems are: Problem set: 0 solved, 802 unsolved
[2024-05-28 16:59:58] [INFO ] Deduced a trap composed of 180 places in 244 ms of which 3 ms to minimize.
[2024-05-28 16:59:58] [INFO ] Deduced a trap composed of 205 places in 172 ms of which 2 ms to minimize.
[2024-05-28 16:59:58] [INFO ] Deduced a trap composed of 200 places in 170 ms of which 3 ms to minimize.
[2024-05-28 16:59:58] [INFO ] Deduced a trap composed of 162 places in 161 ms of which 2 ms to minimize.
[2024-05-28 16:59:59] [INFO ] Deduced a trap composed of 190 places in 161 ms of which 2 ms to minimize.
[2024-05-28 16:59:59] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-28 17:00:00] [INFO ] Deduced a trap composed of 211 places in 128 ms of which 3 ms to minimize.
[2024-05-28 17:00:00] [INFO ] Deduced a trap composed of 200 places in 196 ms of which 3 ms to minimize.
[2024-05-28 17:00:01] [INFO ] Deduced a trap composed of 156 places in 146 ms of which 2 ms to minimize.
[2024-05-28 17:00:01] [INFO ] Deduced a trap composed of 198 places in 145 ms of which 2 ms to minimize.
[2024-05-28 17:00:01] [INFO ] Deduced a trap composed of 182 places in 130 ms of which 2 ms to minimize.
[2024-05-28 17:00:01] [INFO ] Deduced a trap composed of 202 places in 227 ms of which 3 ms to minimize.
[2024-05-28 17:00:01] [INFO ] Deduced a trap composed of 186 places in 169 ms of which 2 ms to minimize.
[2024-05-28 17:00:02] [INFO ] Deduced a trap composed of 198 places in 180 ms of which 3 ms to minimize.
[2024-05-28 17:00:05] [INFO ] Deduced a trap composed of 228 places in 150 ms of which 2 ms to minimize.
[2024-05-28 17:00:05] [INFO ] Deduced a trap composed of 205 places in 159 ms of which 2 ms to minimize.
[2024-05-28 17:00:05] [INFO ] Deduced a trap composed of 217 places in 183 ms of which 2 ms to minimize.
[2024-05-28 17:00:05] [INFO ] Deduced a trap composed of 193 places in 165 ms of which 2 ms to minimize.
[2024-05-28 17:00:05] [INFO ] Deduced a trap composed of 201 places in 185 ms of which 3 ms to minimize.
[2024-05-28 17:00:06] [INFO ] Deduced a trap composed of 168 places in 169 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 802 unsolved
[2024-05-28 17:00:11] [INFO ] Deduced a trap composed of 208 places in 217 ms of which 3 ms to minimize.
[2024-05-28 17:00:11] [INFO ] Deduced a trap composed of 220 places in 160 ms of which 2 ms to minimize.
[2024-05-28 17:00:12] [INFO ] Deduced a trap composed of 213 places in 136 ms of which 2 ms to minimize.
[2024-05-28 17:00:12] [INFO ] Deduced a trap composed of 205 places in 139 ms of which 2 ms to minimize.
[2024-05-28 17:00:12] [INFO ] Deduced a trap composed of 196 places in 138 ms of which 2 ms to minimize.
[2024-05-28 17:00:12] [INFO ] Deduced a trap composed of 216 places in 138 ms of which 2 ms to minimize.
[2024-05-28 17:00:12] [INFO ] Deduced a trap composed of 225 places in 136 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 7)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 7)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 1)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 0)
(s76 1)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 1)
(s88 0)
(s89 1)
(s90 0)
(s91 1)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 1)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 3)
(s162 1)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 3)
(s179 0)
(s180 0)
(s181 0)
(s182 1)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 9)
(s206 0)
(s207 0)
(s208 timeout
0)
(s209 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/1184 variables, and 117 constraints, problems are : Problem set: 0 solved, 802 unsolved in 20014 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: 80/80 constraints]
After SMT, in 40896ms problems are : Problem set: 0 solved, 802 unsolved
Search for dead transitions found 0 dead transitions in 40905ms
[2024-05-28 17:00:14] [INFO ] Flow matrix only has 788 transitions (discarded 16 similar events)
[2024-05-28 17:00:14] [INFO ] Invariant cache hit.
[2024-05-28 17:00:15] [INFO ] Implicit Places using invariants in 295 ms returned []
[2024-05-28 17:00:15] [INFO ] Flow matrix only has 788 transitions (discarded 16 similar events)
[2024-05-28 17:00:15] [INFO ] Invariant cache hit.
[2024-05-28 17:00:15] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 17:00:18] [INFO ] Implicit Places using invariants and state equation in 3041 ms returned []
Implicit Place search using SMT with State Equation took 3347 ms to find 0 implicit places.
[2024-05-28 17:00:18] [INFO ] Redundant transitions in 23 ms returned []
Running 802 sub problems to find dead transitions.
[2024-05-28 17:00:18] [INFO ] Flow matrix only has 788 transitions (discarded 16 similar events)
[2024-05-28 17:00:18] [INFO ] Invariant cache hit.
[2024-05-28 17:00:18] [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-05-28 17:00:23] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 1 ms to minimize.
[2024-05-28 17:00:23] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2024-05-28 17:00:23] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2024-05-28 17:00:23] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-05-28 17:00:23] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2024-05-28 17:00:23] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 0 ms to minimize.
[2024-05-28 17:00:23] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 0 ms to minimize.
[2024-05-28 17:00:24] [INFO ] Deduced a trap composed of 206 places in 212 ms of which 3 ms to minimize.
[2024-05-28 17:00:24] [INFO ] Deduced a trap composed of 200 places in 146 ms of which 2 ms to minimize.
[2024-05-28 17:00:24] [INFO ] Deduced a trap composed of 77 places in 186 ms of which 2 ms to minimize.
[2024-05-28 17:00:24] [INFO ] Deduced a trap composed of 199 places in 181 ms of which 3 ms to minimize.
[2024-05-28 17:00:24] [INFO ] Deduced a trap composed of 220 places in 166 ms of which 2 ms to minimize.
[2024-05-28 17:00:24] [INFO ] Deduced a trap composed of 41 places in 29 ms of which 1 ms to minimize.
[2024-05-28 17:00:25] [INFO ] Deduced a trap composed of 191 places in 146 ms of which 2 ms to minimize.
[2024-05-28 17:00:25] [INFO ] Deduced a trap composed of 37 places in 196 ms of which 3 ms to minimize.
[2024-05-28 17:00:25] [INFO ] Deduced a trap composed of 258 places in 144 ms of which 2 ms to minimize.
[2024-05-28 17:00:25] [INFO ] Deduced a trap composed of 213 places in 201 ms of which 3 ms to minimize.
[2024-05-28 17:00:25] [INFO ] Deduced a trap composed of 223 places in 150 ms of which 2 ms to minimize.
[2024-05-28 17:00:26] [INFO ] Deduced a trap composed of 204 places in 146 ms of which 2 ms to minimize.
[2024-05-28 17:00:26] [INFO ] Deduced a trap composed of 224 places in 147 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-05-28 17:00:26] [INFO ] Deduced a trap composed of 192 places in 179 ms of which 3 ms to minimize.
[2024-05-28 17:00:27] [INFO ] Deduced a trap composed of 50 places in 167 ms of which 3 ms to minimize.
[2024-05-28 17:00:27] [INFO ] Deduced a trap composed of 140 places in 135 ms of which 2 ms to minimize.
[2024-05-28 17:00:27] [INFO ] Deduced a trap composed of 206 places in 135 ms of which 2 ms to minimize.
[2024-05-28 17:00:27] [INFO ] Deduced a trap composed of 215 places in 194 ms of which 3 ms to minimize.
[2024-05-28 17:00:28] [INFO ] Deduced a trap composed of 220 places in 146 ms of which 2 ms to minimize.
[2024-05-28 17:00:28] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 2 ms to minimize.
[2024-05-28 17:00:28] [INFO ] Deduced a trap composed of 189 places in 149 ms of which 2 ms to minimize.
[2024-05-28 17:00:28] [INFO ] Deduced a trap composed of 210 places in 145 ms of which 2 ms to minimize.
[2024-05-28 17:00:28] [INFO ] Deduced a trap composed of 262 places in 142 ms of which 2 ms to minimize.
[2024-05-28 17:00:28] [INFO ] Deduced a trap composed of 224 places in 143 ms of which 2 ms to minimize.
[2024-05-28 17:00:28] [INFO ] Deduced a trap composed of 231 places in 184 ms of which 2 ms to minimize.
[2024-05-28 17:00:29] [INFO ] Deduced a trap composed of 244 places in 163 ms of which 2 ms to minimize.
[2024-05-28 17:00:29] [INFO ] Deduced a trap composed of 265 places in 176 ms of which 2 ms to minimize.
[2024-05-28 17:00:29] [INFO ] Deduced a trap composed of 231 places in 166 ms of which 3 ms to minimize.
[2024-05-28 17:00:29] [INFO ] Deduced a trap composed of 130 places in 167 ms of which 3 ms to minimize.
[2024-05-28 17:00:29] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-05-28 17:00:30] [INFO ] Deduced a trap composed of 189 places in 193 ms of which 2 ms to minimize.
[2024-05-28 17:00:30] [INFO ] Deduced a trap composed of 179 places in 168 ms of which 2 ms to minimize.
[2024-05-28 17:00:30] [INFO ] Deduced a trap composed of 19 places in 147 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-05-28 17:00:35] [INFO ] Deduced a trap composed of 232 places in 132 ms of which 2 ms to minimize.
[2024-05-28 17:00:36] [INFO ] Deduced a trap composed of 206 places in 130 ms of which 2 ms to minimize.
[2024-05-28 17:00:36] [INFO ] Deduced a trap composed of 224 places in 136 ms of which 2 ms to minimize.
[2024-05-28 17:00:36] [INFO ] Deduced a trap composed of 215 places in 132 ms of which 2 ms to minimize.
[2024-05-28 17:00:36] [INFO ] Deduced a trap composed of 139 places in 145 ms of which 3 ms to minimize.
[2024-05-28 17:00:36] [INFO ] Deduced a trap composed of 116 places in 159 ms of which 2 ms to minimize.
[2024-05-28 17:00:37] [INFO ] Deduced a trap composed of 206 places in 137 ms of which 2 ms to minimize.
[2024-05-28 17:00:38] [INFO ] Deduced a trap composed of 214 places in 158 ms of which 2 ms to minimize.
[2024-05-28 17:00:38] [INFO ] Deduced a trap composed of 214 places in 147 ms of which 2 ms to minimize.
[2024-05-28 17:00:38] [INFO ] Deduced a trap composed of 219 places in 209 ms of which 3 ms to minimize.
[2024-05-28 17:00:38] [INFO ] Deduced a trap composed of 221 places in 184 ms of which 3 ms to minimize.
[2024-05-28 17:00:38] [INFO ] Deduced a trap composed of 216 places in 183 ms of which 2 ms to minimize.
[2024-05-28 17:00:39] [INFO ] Deduced a trap composed of 214 places in 172 ms of which 2 ms to minimize.
[2024-05-28 17:00:39] [INFO ] Deduced a trap composed of 130 places in 202 ms of which 2 ms to minimize.
[2024-05-28 17:00:41] [INFO ] Deduced a trap composed of 194 places in 237 ms of which 3 ms to minimize.
[2024-05-28 17:00:41] [INFO ] Deduced a trap composed of 177 places in 130 ms of which 2 ms to minimize.
[2024-05-28 17:00:42] [INFO ] Deduced a trap composed of 191 places in 212 ms of which 3 ms to minimize.
[2024-05-28 17:00:42] [INFO ] Deduced a trap composed of 179 places in 183 ms of which 3 ms to minimize.
[2024-05-28 17:00:42] [INFO ] Deduced a trap composed of 208 places in 144 ms of which 2 ms to minimize.
[2024-05-28 17:00:42] [INFO ] Deduced a trap composed of 192 places in 156 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-05-28 17:00:43] [INFO ] Deduced a trap composed of 186 places in 219 ms of which 3 ms to minimize.
[2024-05-28 17:00:44] [INFO ] Deduced a trap composed of 199 places in 177 ms of which 3 ms to minimize.
[2024-05-28 17:00:44] [INFO ] Deduced a trap composed of 116 places in 195 ms of which 3 ms to minimize.
[2024-05-28 17:00:44] [INFO ] Deduced a trap composed of 211 places in 188 ms of which 3 ms to minimize.
[2024-05-28 17:00:44] [INFO ] Deduced a trap composed of 118 places in 148 ms of which 2 ms to minimize.
[2024-05-28 17:00:45] [INFO ] Deduced a trap composed of 199 places in 146 ms of which 2 ms to minimize.
[2024-05-28 17:00:45] [INFO ] Deduced a trap composed of 119 places in 173 ms of which 2 ms to minimize.
[2024-05-28 17:00:45] [INFO ] Deduced a trap composed of 119 places in 160 ms of which 2 ms to minimize.
[2024-05-28 17:00:45] [INFO ] Deduced a trap composed of 205 places in 208 ms of which 3 ms to minimize.
[2024-05-28 17:00:45] [INFO ] Deduced a trap composed of 200 places in 176 ms of which 3 ms to minimize.
[2024-05-28 17:00:46] [INFO ] Deduced a trap composed of 223 places in 162 ms of which 2 ms to minimize.
[2024-05-28 17:00:46] [INFO ] Deduced a trap composed of 232 places in 136 ms of which 2 ms to minimize.
[2024-05-28 17:00:46] [INFO ] Deduced a trap composed of 237 places in 189 ms of which 3 ms to minimize.
[2024-05-28 17:00:47] [INFO ] Deduced a trap composed of 185 places in 205 ms of which 3 ms to minimize.
[2024-05-28 17:00:47] [INFO ] Deduced a trap composed of 130 places in 129 ms of which 2 ms to minimize.
[2024-05-28 17:00:48] [INFO ] Deduced a trap composed of 202 places in 199 ms of which 3 ms to minimize.
[2024-05-28 17:00:48] [INFO ] Deduced a trap composed of 197 places in 171 ms of which 2 ms to minimize.
[2024-05-28 17:00:48] [INFO ] Deduced a trap composed of 186 places in 138 ms of which 2 ms to minimize.
[2024-05-28 17:00:48] [INFO ] Deduced a trap composed of 197 places in 143 ms of which 2 ms to minimize.
[2024-05-28 17:00:48] [INFO ] Deduced a trap composed of 190 places in 143 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 30023 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-05-28 17:00:53] [INFO ] Deduced a trap composed of 197 places in 161 ms of which 2 ms to minimize.
[2024-05-28 17:00:54] [INFO ] Deduced a trap composed of 198 places in 175 ms of which 3 ms to minimize.
[2024-05-28 17:00:54] [INFO ] Deduced a trap composed of 167 places in 167 ms of which 2 ms to minimize.
[2024-05-28 17:00:54] [INFO ] Deduced a trap composed of 211 places in 162 ms of which 2 ms to minimize.
[2024-05-28 17:00:54] [INFO ] Deduced a trap composed of 192 places in 223 ms of which 3 ms to minimize.
[2024-05-28 17:00:55] [INFO ] Deduced a trap composed of 208 places in 163 ms of which 3 ms to minimize.
[2024-05-28 17:00:55] [INFO ] Deduced a trap composed of 188 places in 160 ms of which 2 ms to minimize.
[2024-05-28 17:00:55] [INFO ] Deduced a trap composed of 187 places in 209 ms of which 3 ms to minimize.
[2024-05-28 17:00:55] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-28 17:00:56] [INFO ] Deduced a trap composed of 171 places in 128 ms of which 2 ms to minimize.
[2024-05-28 17:00:56] [INFO ] Deduced a trap composed of 200 places in 143 ms of which 1 ms to minimize.
[2024-05-28 17:00:56] [INFO ] Deduced a trap composed of 198 places in 202 ms of which 2 ms to minimize.
[2024-05-28 17:00:56] [INFO ] Deduced a trap composed of 211 places in 180 ms of which 2 ms to minimize.
[2024-05-28 17:00:57] [INFO ] Deduced a trap composed of 183 places in 148 ms of which 2 ms to minimize.
[2024-05-28 17:00:57] [INFO ] Deduced a trap composed of 193 places in 185 ms of which 2 ms to minimize.
[2024-05-28 17:00:57] [INFO ] Deduced a trap composed of 194 places in 182 ms of which 3 ms to minimize.
[2024-05-28 17:00:57] [INFO ] Deduced a trap composed of 175 places in 175 ms of which 2 ms to minimize.
[2024-05-28 17:00:57] [INFO ] Deduced a trap composed of 203 places in 158 ms of which 2 ms to minimize.
[2024-05-28 17:00:57] [INFO ] Deduced a trap composed of 198 places in 144 ms of which 2 ms to minimize.
[2024-05-28 17:00:58] [INFO ] Deduced a trap composed of 203 places in 140 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-05-28 17:01:02] [INFO ] Deduced a trap composed of 197 places in 309 ms of which 3 ms to minimize.
[2024-05-28 17:01:02] [INFO ] Deduced a trap composed of 170 places in 188 ms of which 2 ms to minimize.
[2024-05-28 17:01:02] [INFO ] Deduced a trap composed of 243 places in 223 ms of which 2 ms to minimize.
[2024-05-28 17:01:02] [INFO ] Deduced a trap composed of 200 places in 225 ms of which 2 ms to minimize.
[2024-05-28 17:01:04] [INFO ] Deduced a trap composed of 212 places in 133 ms of which 2 ms to minimize.
[2024-05-28 17:01:05] [INFO ] Deduced a trap composed of 180 places in 175 ms of which 3 ms to minimize.
[2024-05-28 17:01:05] [INFO ] Deduced a trap composed of 167 places in 117 ms of which 2 ms to minimize.
[2024-05-28 17:01:07] [INFO ] Deduced a trap composed of 186 places in 117 ms of which 1 ms to minimize.
[2024-05-28 17:01:07] [INFO ] Deduced a trap composed of 204 places in 135 ms of which 2 ms to minimize.
[2024-05-28 17:01:07] [INFO ] Deduced a trap composed of 174 places in 133 ms of which 2 ms to minimize.
[2024-05-28 17:01:08] [INFO ] Deduced a trap composed of 197 places in 144 ms of which 3 ms to minimize.
[2024-05-28 17:01:09] [INFO ] Deduced a trap composed of 201 places in 188 ms of which 2 ms to minimize.
[2024-05-28 17:01:09] [INFO ] Deduced a trap composed of 175 places in 179 ms of which 2 ms to minimize.
[2024-05-28 17:01:09] [INFO ] Deduced a trap composed of 211 places in 176 ms of which 3 ms to minimize.
[2024-05-28 17:01:09] [INFO ] Deduced a trap composed of 212 places in 185 ms of which 2 ms to minimize.
[2024-05-28 17:01:09] [INFO ] Deduced a trap composed of 217 places in 181 ms of which 3 ms to minimize.
[2024-05-28 17:01:10] [INFO ] Deduced a trap composed of 217 places in 173 ms of which 2 ms to minimize.
[2024-05-28 17:01:10] [INFO ] Deduced a trap composed of 210 places in 170 ms of which 2 ms to minimize.
[2024-05-28 17:01:10] [INFO ] Deduced a trap composed of 235 places in 171 ms of which 3 ms to minimize.
[2024-05-28 17:01:10] [INFO ] Deduced a trap composed of 232 places in 158 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 802 unsolved
[2024-05-28 17:01:15] [INFO ] Deduced a trap composed of 193 places in 166 ms of which 2 ms to minimize.
[2024-05-28 17:01:15] [INFO ] Deduced a trap composed of 189 places in 164 ms of which 2 ms to minimize.
[2024-05-28 17:01:15] [INFO ] Deduced a trap composed of 198 places in 160 ms of which 2 ms to minimize.
[2024-05-28 17:01:15] [INFO ] Deduced a trap composed of 190 places in 175 ms of which 3 ms to minimize.
[2024-05-28 17:01:15] [INFO ] Deduced a trap composed of 187 places in 161 ms of which 2 ms to minimize.
[2024-05-28 17:01:15] [INFO ] Deduced a trap composed of 269 places in 144 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 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: 0/802 constraints, Known Traps: 126/126 constraints]
After SMT, in 61185ms problems are : Problem set: 0 solved, 802 unsolved
Search for dead transitions found 0 dead transitions in 61201ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 105502 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 103 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 p0), (NOT p0)]
RANDOM walk for 152 steps (0 resets) in 6 ms. (21 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 94 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 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
[2024-05-28 17:01:19] [INFO ] Flow matrix only has 788 transitions (discarded 16 similar events)
[2024-05-28 17:01:19] [INFO ] Invariant cache hit.
[2024-05-28 17:01:20] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-28 17:01:20] [INFO ] [Real]Absence check using 12 positive and 28 generalized place invariants in 58 ms returned sat
[2024-05-28 17:01:21] [INFO ] [Real]Absence check using state equation in 940 ms returned sat
[2024-05-28 17:01:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:01:21] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-28 17:01:21] [INFO ] [Nat]Absence check using 12 positive and 28 generalized place invariants in 41 ms returned sat
[2024-05-28 17:01:22] [INFO ] [Nat]Absence check using state equation in 860 ms returned sat
[2024-05-28 17:01:22] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 17:01:22] [INFO ] [Nat]Added 96 Read/Feed constraints in 90 ms returned sat
[2024-05-28 17:01:22] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 1 ms to minimize.
[2024-05-28 17:01:22] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 1 ms to minimize.
[2024-05-28 17:01:23] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 1 ms to minimize.
[2024-05-28 17:01:23] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-28 17:01:23] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 1 ms to minimize.
[2024-05-28 17:01:23] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 2 ms to minimize.
[2024-05-28 17:01:23] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 2 ms to minimize.
[2024-05-28 17:01:23] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1195 ms
[2024-05-28 17:01:23] [INFO ] Computed and/alt/rep : 370/1309/362 causal constraints (skipped 424 transitions) in 66 ms.
[2024-05-28 17:01:25] [INFO ] Added : 200 causal constraints over 40 iterations in 2094 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2439 reset in 306 ms.
Product exploration explored 100000 steps with 2439 reset in 396 ms.
Built C files in :
/tmp/ltsmin7451251967909526171
[2024-05-28 17:01:26] [INFO ] Computing symmetric may disable matrix : 804 transitions.
[2024-05-28 17:01:26] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:01:26] [INFO ] Computing symmetric may enable matrix : 804 transitions.
[2024-05-28 17:01:26] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:01:26] [INFO ] Computing Do-Not-Accords matrix : 804 transitions.
[2024-05-28 17:01:27] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:01:27] [INFO ] Built C files in 192ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7451251967909526171
Running compilation step : cd /tmp/ltsmin7451251967909526171;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2529 ms.
Running link step : cd /tmp/ltsmin7451251967909526171;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 94 ms.
Running LTSmin : cd /tmp/ltsmin7451251967909526171;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16556674352398700829.hoa' '--buchi-type=spotba'
LTSmin run took 8820 ms.
Treatment of property PolyORBLF-PT-S02J04T08-LTLFireability-04 finished in 243403 ms.
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-04 TRUE TECHNIQUES SHORTENING_INSENSITIVE
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(F(p1))||p0)))'
[2024-05-28 17:01:38] [INFO ] Flatten gal took : 60 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13337928651872819506
[2024-05-28 17:01:38] [INFO ] Computing symmetric may disable matrix : 1102 transitions.
[2024-05-28 17:01:38] [INFO ] Applying decomposition
[2024-05-28 17:01:38] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:01:38] [INFO ] Computing symmetric may enable matrix : 1102 transitions.
[2024-05-28 17:01:38] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:01:38] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph136473587165481345.txt' '-o' '/tmp/graph136473587165481345.bin' '-w' '/tmp/graph136473587165481345.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph136473587165481345.bin' '-l' '-1' '-v' '-w' '/tmp/graph136473587165481345.weights' '-q' '0' '-e' '0.001'
[2024-05-28 17:01:38] [INFO ] Decomposing Gal with order
[2024-05-28 17:01:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 17:01:38] [INFO ] Removed a total of 857 redundant transitions.
[2024-05-28 17:01:38] [INFO ] Computing Do-Not-Accords matrix : 1102 transitions.
[2024-05-28 17:01:38] [INFO ] Flatten gal took : 64 ms
[2024-05-28 17:01:38] [INFO ] Computation of Completed DNA matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:01:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 278 labels/synchronizations in 18 ms.
[2024-05-28 17:01:38] [INFO ] Time to serialize gal into /tmp/LTLFireability11624240599891930214.gal : 8 ms
[2024-05-28 17:01:38] [INFO ] Built C files in 295ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13337928651872819506
Running compilation step : cd /tmp/ltsmin13337928651872819506;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-28 17:01:38] [INFO ] Time to serialize properties into /tmp/LTLFireability18205993156075599011.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11624240599891930214.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18205993156075599011.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 2 LTL properties
Checking formula 0 : !((X(G(X(F(("(((((i0.u3.P_1095>=1)&&(i0.u3.P_1113_1>=1))||((i0.u3.P_1095>=1)&&(i0.u3.P_1113_6>=1)))||(((i0.u3.P_1113_3>=1)&&(i0.u3.P_1...1224
Formula 0 simplified : FG(!"(((((i0.u3.Check_Sources_E_1>=1)&&(i8.i1.u49.ORB_Lock>=1))||((i0.u3.Check_Sources_E_6>=1)&&(i8.i1.u49.ORB_Lock>=1)))||(((i8.i1....1327
Compilation finished in 4048 ms.
Running link step : cd /tmp/ltsmin13337928651872819506;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 104 ms.
Running LTSmin : cd /tmp/ltsmin13337928651872819506;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](X(<>(((LTLAPp0==true) U (!X((LTLAPp0==true)) U (LTLAPp1==true)))))))' '--buchi-type=spotba'
LTSmin run took 254906 ms.
FORMULA PolyORBLF-PT-S02J04T08-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin13337928651872819506;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](<>((LTLAPp5==true)))||(LTLAPp4==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin13337928651872819506;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](<>((LTLAPp5==true)))||(LTLAPp4==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin13337928651872819506;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](<>((LTLAPp5==true)))||(LTLAPp4==true)))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is PolyORBLF-PT-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 r290-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 ;