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-171654446300084.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-COL-S02J04T08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446300084
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 7.4K Apr 11 16:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 11 16:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 16:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 11 16:52 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 4.6K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 11 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 11 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 11 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K Apr 11 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K 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-COL-S02J04T08-LTLFireability-00
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLFireability-01
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLFireability-02
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLFireability-03
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLFireability-04
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLFireability-05
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLFireability-06
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLFireability-07
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLFireability-08
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLFireability-09
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLFireability-10
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLFireability-11
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLFireability-12
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLFireability-13
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLFireability-14
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716903301813

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J04T08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202405141337
[2024-05-28 13:35:03] [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 13:35:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 13:35:03] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 13:35:03] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 13:35:04] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 666 ms
[2024-05-28 13:35:04] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 614 PT places and 1300.0 transition bindings in 28 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 13:35:04] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 4 ms.
[2024-05-28 13:35:04] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 7 formulas.
FORMULA PolyORBLF-COL-S02J04T08-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 9 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40000 steps (13 resets) in 1366 ms. (29 steps per ms) remains 5/18 properties
BEST_FIRST walk for 40000 steps (11 resets) in 594 ms. (67 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40001 steps (14 resets) in 247 ms. (161 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (15 resets) in 194 ms. (205 steps per ms) remains 3/3 properties
[2024-05-28 13:35:05] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 13:35:05] [INFO ] Computed 26 invariants in 9 ms
[2024-05-28 13:35:05] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 11/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/24 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 23/47 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 3/50 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 23/73 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 13:35:05] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 9 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/73 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 5/78 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1/79 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/79 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 64/143 variables, 79/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 8/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/143 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 2/145 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/145 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/145 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/145 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 116 constraints, problems are : Problem set: 0 solved, 3 unsolved in 733 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 11/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/24 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 23/47 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 3/50 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 23/73 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/73 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 5/78 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1/79 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/79 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 64/143 variables, 79/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 8/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/143 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/143 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 2/145 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/145 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/145 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/145 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 119 constraints, problems are : Problem set: 0 solved, 3 unsolved in 270 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 1043ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1001 ms.
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 65/65 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 80 transition count 58
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 73 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 72 transition count 57
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 17 place count 72 transition count 54
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 23 place count 69 transition count 54
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 37 place count 62 transition count 47
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 62 transition count 45
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 41 place count 60 transition count 45
Applied a total of 41 rules in 50 ms. Remains 60 /81 variables (removed 21) and now considering 45/65 (removed 20) transitions.
Running 44 sub problems to find dead transitions.
[2024-05-28 13:35:07] [INFO ] Flow matrix only has 44 transitions (discarded 1 similar events)
// Phase 1: matrix 44 rows 60 cols
[2024-05-28 13:35:07] [INFO ] Computed 25 invariants in 2 ms
[2024-05-28 13:35:07] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-28 13:35:07] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/26 constraints. Problems are: Problem set: 2 solved, 42 unsolved
[2024-05-28 13:35:07] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-28 13:35:07] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-28 13:35:07] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-28 13:35:07] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 13:35:08] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-28 13:35:08] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 6/32 constraints. Problems are: Problem set: 2 solved, 42 unsolved
[2024-05-28 13:35:08] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 13:35:08] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-28 13:35:08] [INFO ] Deduced a trap composed of 18 places in 721 ms of which 0 ms to minimize.
[2024-05-28 13:35:08] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 4/36 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 44/104 variables, 60/96 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 8/104 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 0/104 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 11 (OVERLAPS) 0/104 variables, 0/104 constraints. Problems are: Problem set: 2 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 104 constraints, problems are : Problem set: 2 solved, 42 unsolved in 2349 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 60/60 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 2 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 15/24 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 7/31 constraints. Problems are: Problem set: 2 solved, 42 unsolved
[2024-05-28 13:35:09] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-28 13:35:09] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 2/33 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/33 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 1/60 variables, 1/34 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 4/38 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/38 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 44/104 variables, 60/98 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 8/106 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 42/148 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/104 variables, 0/148 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 12 (OVERLAPS) 0/104 variables, 0/148 constraints. Problems are: Problem set: 2 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 148 constraints, problems are : Problem set: 2 solved, 42 unsolved in 1272 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 60/60 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 42/44 constraints, Known Traps: 13/13 constraints]
After SMT, in 3663ms problems are : Problem set: 2 solved, 42 unsolved
Search for dead transitions found 2 dead transitions in 3666ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/81 places, 43/65 transitions.
Reduce places removed 0 places and 2 transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 1 places and 2 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 59 transition count 39
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 1 rules in 3 ms. Remains 59 /60 variables (removed 1) and now considering 39/43 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3743 ms. Remains : 59/81 places, 39/65 transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Successfully simplified 3 atomic propositions for a total of 9 simplifications.
[2024-05-28 13:35:10] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-05-28 13:35:11] [INFO ] Flatten gal took : 28 ms
FORMULA PolyORBLF-COL-S02J04T08-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 13:35:11] [INFO ] Flatten gal took : 8 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-28 13:35:11] [INFO ] Unfolded HLPN to a Petri net with 614 places and 1242 transitions 5732 arcs in 58 ms.
[2024-05-28 13:35:11] [INFO ] Unfolded 8 HLPN properties in 0 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Support contains 162 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 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 604 transition count 1106
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 596 transition count 1098
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 596 transition count 1098
Applied a total of 34 rules in 91 ms. Remains 596 /614 variables (removed 18) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-28 13:35:11] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 596 cols
[2024-05-28 13:35:11] [INFO ] Computed 48 invariants in 51 ms
[2024-05-28 13:35:11] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:35:21] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 2 ms to minimize.
[2024-05-28 13:35:21] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 2 ms to minimize.
[2024-05-28 13:35:21] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 2 ms to minimize.
[2024-05-28 13:35:21] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 2 ms to minimize.
[2024-05-28 13:35:21] [INFO ] Deduced a trap composed of 63 places in 51 ms of which 1 ms to minimize.
[2024-05-28 13:35:21] [INFO ] Deduced a trap composed of 63 places in 43 ms of which 1 ms to minimize.
[2024-05-28 13:35:22] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-05-28 13:35:22] [INFO ] Deduced a trap composed of 328 places in 213 ms of which 4 ms to minimize.
[2024-05-28 13:35:22] [INFO ] Deduced a trap composed of 316 places in 223 ms of which 3 ms to minimize.
[2024-05-28 13:35:22] [INFO ] Deduced a trap composed of 327 places in 226 ms of which 3 ms to minimize.
[2024-05-28 13:35:23] [INFO ] Deduced a trap composed of 320 places in 217 ms of which 4 ms to minimize.
[2024-05-28 13:35:23] [INFO ] Deduced a trap composed of 302 places in 214 ms of which 3 ms to minimize.
[2024-05-28 13:35:23] [INFO ] Deduced a trap composed of 183 places in 186 ms of which 3 ms to minimize.
[2024-05-28 13:35:24] [INFO ] Deduced a trap composed of 327 places in 297 ms of which 5 ms to minimize.
[2024-05-28 13:35:24] [INFO ] Deduced a trap composed of 379 places in 209 ms of which 4 ms to minimize.
[2024-05-28 13:35:25] [INFO ] Deduced a trap composed of 313 places in 206 ms of which 3 ms to minimize.
[2024-05-28 13:35:25] [INFO ] Deduced a trap composed of 388 places in 205 ms of which 4 ms to minimize.
[2024-05-28 13:35:25] [INFO ] Deduced a trap composed of 301 places in 205 ms of which 3 ms to minimize.
[2024-05-28 13:35:25] [INFO ] Deduced a trap composed of 314 places in 263 ms of which 3 ms to minimize.
[2024-05-28 13:35:26] [INFO ] Deduced a trap composed of 324 places in 207 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:35:26] [INFO ] Deduced a trap composed of 63 places in 59 ms of which 2 ms to minimize.
[2024-05-28 13:35:27] [INFO ] Deduced a trap composed of 356 places in 486 ms of which 9 ms to minimize.
[2024-05-28 13:35:32] [INFO ] Deduced a trap composed of 47 places in 181 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1678 variables, and 69 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 23/69 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:35:44] [INFO ] Deduced a trap composed of 294 places in 295 ms of which 4 ms to minimize.
[2024-05-28 13:35:44] [INFO ] Deduced a trap composed of 314 places in 290 ms of which 5 ms to minimize.
[2024-05-28 13:35:47] [INFO ] Deduced a trap composed of 365 places in 195 ms of which 4 ms to minimize.
[2024-05-28 13:35:47] [INFO ] Deduced a trap composed of 409 places in 278 ms of which 3 ms to minimize.
[2024-05-28 13:35:47] [INFO ] Deduced a trap composed of 318 places in 265 ms of which 16 ms to minimize.
[2024-05-28 13:35:48] [INFO ] Deduced a trap composed of 347 places in 196 ms of which 3 ms to minimize.
[2024-05-28 13:35:49] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/594 variables, 7/76 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/1678 variables, and 76 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 30/30 constraints]
After SMT, in 41728ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41746ms
[2024-05-28 13:35:52] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 13:35:52] [INFO ] Invariant cache hit.
[2024-05-28 13:35:53] [INFO ] Implicit Places using invariants in 318 ms returned [470, 471, 472, 473, 474, 475, 476, 477]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 327 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 588/614 places, 1098/1114 transitions.
Applied a total of 0 rules in 26 ms. Remains 588 /588 variables (removed 0) and now considering 1098/1098 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42198 ms. Remains : 588/614 places, 1098/1114 transitions.
Support contains 162 out of 588 places after structural reductions.
[2024-05-28 13:35:53] [INFO ] Flatten gal took : 133 ms
[2024-05-28 13:35:53] [INFO ] Flatten gal took : 109 ms
[2024-05-28 13:35:53] [INFO ] Input system was already deterministic with 1098 transitions.
RANDOM walk for 40000 steps (8 resets) in 568 ms. (70 steps per ms) remains 1/15 properties
BEST_FIRST walk for 40003 steps (9 resets) in 259 ms. (153 steps per ms) remains 1/1 properties
[2024-05-28 13:35:54] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 588 cols
[2024-05-28 13:35:54] [INFO ] Computed 40 invariants in 22 ms
[2024-05-28 13:35:54] [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) 462/470 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/470 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 30/500 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 84/584 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 13:35:54] [INFO ] Deduced a trap composed of 64 places in 347 ms of which 4 ms to minimize.
[2024-05-28 13:35:55] [INFO ] Deduced a trap composed of 307 places in 218 ms of which 3 ms to minimize.
[2024-05-28 13:35:55] [INFO ] Deduced a trap composed of 128 places in 259 ms of which 3 ms to minimize.
[2024-05-28 13:35:55] [INFO ] Deduced a trap composed of 65 places in 237 ms of which 3 ms to minimize.
[2024-05-28 13:35:55] [INFO ] Deduced a trap composed of 64 places in 238 ms of which 3 ms to minimize.
[2024-05-28 13:35:56] [INFO ] Deduced a trap composed of 64 places in 355 ms of which 8 ms to minimize.
[2024-05-28 13:35:56] [INFO ] Deduced a trap composed of 378 places in 264 ms of which 4 ms to minimize.
[2024-05-28 13:35:56] [INFO ] Deduced a trap composed of 343 places in 268 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/584 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/584 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/586 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1668/1670 variables, and 633 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3404 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 586/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 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) 462/470 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/470 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/500 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 84/584 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/584 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 13:35:58] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/584 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 13:35:58] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/584 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/584 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/586 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/586 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1082/1668 variables, 586/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1668 variables, 96/731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1668 variables, 1/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1668 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1670 variables, 2/734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1670 variables, 1/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1670 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1670 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1670/1670 variables, and 735 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 588/588 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 5501ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 136 ms.
Support contains 8 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1098/1098 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 588 transition count 1042
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 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 112 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 240 place count 468 transition count 978
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 368 place count 404 transition count 914
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 376 place count 396 transition count 906
Iterating global reduction 2 with 8 rules applied. Total rules applied 384 place count 396 transition count 906
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 400 place count 396 transition count 890
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 416 place count 380 transition count 890
Applied a total of 416 rules in 194 ms. Remains 380 /588 variables (removed 208) and now considering 890/1098 (removed 208) transitions.
Running 888 sub problems to find dead transitions.
[2024-05-28 13:36:00] [INFO ] Flow matrix only has 874 transitions (discarded 16 similar events)
// Phase 1: matrix 874 rows 380 cols
[2024-05-28 13:36:00] [INFO ] Computed 40 invariants in 18 ms
[2024-05-28 13:36:00] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2024-05-28 13:36:06] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 2 ms to minimize.
[2024-05-28 13:36:06] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 1 ms to minimize.
[2024-05-28 13:36:06] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 8 ms to minimize.
[2024-05-28 13:36:06] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2024-05-28 13:36:07] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 1 ms to minimize.
[2024-05-28 13:36:07] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-28 13:36:07] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-28 13:36:07] [INFO ] Deduced a trap composed of 151 places in 183 ms of which 2 ms to minimize.
[2024-05-28 13:36:07] [INFO ] Deduced a trap composed of 157 places in 168 ms of which 3 ms to minimize.
[2024-05-28 13:36:08] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 2 ms to minimize.
[2024-05-28 13:36:12] [INFO ] Deduced a trap composed of 134 places in 161 ms of which 2 ms to minimize.
[2024-05-28 13:36:12] [INFO ] Deduced a trap composed of 146 places in 143 ms of which 2 ms to minimize.
[2024-05-28 13:36:13] [INFO ] Deduced a trap composed of 65 places in 153 ms of which 2 ms to minimize.
[2024-05-28 13:36:13] [INFO ] Deduced a trap composed of 164 places in 179 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2024-05-28 13:36:15] [INFO ] Deduced a trap composed of 45 places in 135 ms of which 1 ms to minimize.
[2024-05-28 13:36:15] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 888 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/1254 variables, and 54 constraints, problems are : Problem set: 0 solved, 888 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/380 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 888/888 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 888 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2024-05-28 13:36:30] [INFO ] Deduced a trap composed of 152 places in 208 ms of which 3 ms to minimize.
[2024-05-28 13:36:30] [INFO ] Deduced a trap composed of 133 places in 146 ms of which 2 ms to minimize.
[2024-05-28 13:36:31] [INFO ] Deduced a trap composed of 54 places in 128 ms of which 2 ms to minimize.
[2024-05-28 13:36:31] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 888 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/1254 variables, and 58 constraints, problems are : Problem set: 0 solved, 888 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/380 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/888 constraints, Known Traps: 20/20 constraints]
After SMT, in 41886ms problems are : Problem set: 0 solved, 888 unsolved
Search for dead transitions found 0 dead transitions in 41895ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42092 ms. Remains : 380/588 places, 890/1098 transitions.
RANDOM walk for 40000 steps (25 resets) in 333 ms. (119 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (14 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 345006 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :0 out of 1
Probabilistic random walk after 345006 steps, saw 183638 distinct states, run finished after 3007 ms. (steps per millisecond=114 ) properties seen :0
[2024-05-28 13:36:45] [INFO ] Flow matrix only has 874 transitions (discarded 16 similar events)
[2024-05-28 13:36:45] [INFO ] Invariant cache hit.
[2024-05-28 13:36:45] [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) 135/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/166 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/176 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 195/371 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 13:36:45] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 2 ms to minimize.
[2024-05-28 13:36:45] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 2 ms to minimize.
[2024-05-28 13:36:45] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 1 ms to minimize.
[2024-05-28 13:36:45] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
[2024-05-28 13:36:45] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 13:36:45] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/375 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/375 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/378 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/378 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 874/1252 variables, 378/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1252 variables, 96/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1252 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 2/1254 variables, 2/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1254 variables, 1/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1254 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1254 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1254/1254 variables, and 522 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1508 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 380/380 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 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) 135/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/166 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/176 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 195/371 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 13:36:46] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/375 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/375 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/378 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/378 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 874/1252 variables, 378/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1252 variables, 96/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1252 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1252 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/1254 variables, 2/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1254 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1254 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1254 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1254/1254 variables, and 524 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1230 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 380/380 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 2760ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 94 ms.
Support contains 8 out of 380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 890/890 transitions.
Applied a total of 0 rules in 25 ms. Remains 380 /380 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 380/380 places, 890/890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 890/890 transitions.
Applied a total of 0 rules in 23 ms. Remains 380 /380 variables (removed 0) and now considering 890/890 (removed 0) transitions.
[2024-05-28 13:36:48] [INFO ] Flow matrix only has 874 transitions (discarded 16 similar events)
[2024-05-28 13:36:48] [INFO ] Invariant cache hit.
[2024-05-28 13:36:48] [INFO ] Implicit Places using invariants in 502 ms returned []
[2024-05-28 13:36:48] [INFO ] Flow matrix only has 874 transitions (discarded 16 similar events)
[2024-05-28 13:36:48] [INFO ] Invariant cache hit.
[2024-05-28 13:36:49] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 13:36:52] [INFO ] Implicit Places using invariants and state equation in 3801 ms returned []
Implicit Place search using SMT with State Equation took 4314 ms to find 0 implicit places.
[2024-05-28 13:36:52] [INFO ] Redundant transitions in 50 ms returned []
Running 888 sub problems to find dead transitions.
[2024-05-28 13:36:52] [INFO ] Flow matrix only has 874 transitions (discarded 16 similar events)
[2024-05-28 13:36:52] [INFO ] Invariant cache hit.
[2024-05-28 13:36:52] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2024-05-28 13:36:59] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2024-05-28 13:36:59] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2024-05-28 13:36:59] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-28 13:36:59] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:36:59] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 0 ms to minimize.
[2024-05-28 13:37:00] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-28 13:37:00] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 0 ms to minimize.
[2024-05-28 13:37:00] [INFO ] Deduced a trap composed of 151 places in 260 ms of which 3 ms to minimize.
[2024-05-28 13:37:00] [INFO ] Deduced a trap composed of 151 places in 138 ms of which 2 ms to minimize.
[2024-05-28 13:37:01] [INFO ] Deduced a trap composed of 140 places in 140 ms of which 2 ms to minimize.
[2024-05-28 13:37:01] [INFO ] Deduced a trap composed of 145 places in 143 ms of which 2 ms to minimize.
[2024-05-28 13:37:01] [INFO ] Deduced a trap composed of 152 places in 138 ms of which 2 ms to minimize.
[2024-05-28 13:37:01] [INFO ] Deduced a trap composed of 144 places in 248 ms of which 3 ms to minimize.
[2024-05-28 13:37:01] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-05-28 13:37:01] [INFO ] Deduced a trap composed of 68 places in 108 ms of which 2 ms to minimize.
[2024-05-28 13:37:06] [INFO ] Deduced a trap composed of 132 places in 211 ms of which 2 ms to minimize.
[2024-05-28 13:37:07] [INFO ] Deduced a trap composed of 19 places in 213 ms of which 3 ms to minimize.
[2024-05-28 13:37:07] [INFO ] Deduced a trap composed of 125 places in 190 ms of which 3 ms to minimize.
[2024-05-28 13:37:08] [INFO ] Deduced a trap composed of 149 places in 138 ms of which 2 ms to minimize.
[2024-05-28 13:37:08] [INFO ] Deduced a trap composed of 3 places in 157 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2024-05-28 13:37:10] [INFO ] Deduced a trap composed of 218 places in 154 ms of which 2 ms to minimize.
[2024-05-28 13:37:13] [INFO ] Deduced a trap composed of 134 places in 181 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 888 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/1254 variables, and 60 constraints, problems are : Problem set: 0 solved, 888 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/380 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 888/888 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 888 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2024-05-28 13:37:29] [INFO ] Deduced a trap composed of 65 places in 171 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 5 (OVERLAPS) 1/379 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 888 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 379/1254 variables, and 62 constraints, problems are : Problem set: 0 solved, 888 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/380 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/888 constraints, Known Traps: 23/23 constraints]
After SMT, in 61972ms problems are : Problem set: 0 solved, 888 unsolved
Search for dead transitions found 0 dead transitions in 61981ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66381 ms. Remains : 380/380 places, 890/890 transitions.
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 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 1098/1098 transitions.
Applied a total of 0 rules in 6 ms. Remains 588 /588 variables (removed 0) and now considering 1098/1098 (removed 0) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-28 13:37:54] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 588 cols
[2024-05-28 13:37:54] [INFO ] Computed 40 invariants in 24 ms
[2024-05-28 13:37:54] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:38:03] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 2 ms to minimize.
[2024-05-28 13:38:03] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 2 ms to minimize.
[2024-05-28 13:38:03] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 2 ms to minimize.
[2024-05-28 13:38:03] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 1 ms to minimize.
[2024-05-28 13:38:03] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
[2024-05-28 13:38:04] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 2 ms to minimize.
[2024-05-28 13:38:04] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-05-28 13:38:04] [INFO ] Deduced a trap composed of 325 places in 222 ms of which 4 ms to minimize.
[2024-05-28 13:38:05] [INFO ] Deduced a trap composed of 165 places in 280 ms of which 4 ms to minimize.
[2024-05-28 13:38:05] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2024-05-28 13:38:06] [INFO ] Deduced a trap composed of 346 places in 288 ms of which 4 ms to minimize.
[2024-05-28 13:38:06] [INFO ] Deduced a trap composed of 308 places in 279 ms of which 5 ms to minimize.
[2024-05-28 13:38:06] [INFO ] Deduced a trap composed of 307 places in 253 ms of which 4 ms to minimize.
[2024-05-28 13:38:07] [INFO ] Deduced a trap composed of 313 places in 297 ms of which 4 ms to minimize.
[2024-05-28 13:38:07] [INFO ] Deduced a trap composed of 299 places in 277 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 53 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:38:18] [INFO ] Deduced a trap composed of 353 places in 294 ms of which 5 ms to minimize.
[2024-05-28 13:38:18] [INFO ] Deduced a trap composed of 45 places in 176 ms of which 4 ms to minimize.
[2024-05-28 13:38:19] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 2 ms to minimize.
[2024-05-28 13:38:24] [INFO ] Deduced a trap composed of 324 places in 226 ms of which 5 ms to minimize.
[2024-05-28 13:38:24] [INFO ] Deduced a trap composed of 311 places in 281 ms of which 4 ms to minimize.
[2024-05-28 13:38:29] [INFO ] Deduced a trap composed of 313 places in 258 ms of which 5 ms to minimize.
[2024-05-28 13:38:30] [INFO ] Deduced a trap composed of 47 places in 170 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 7/60 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 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 22/22 constraints]
After SMT, in 41397ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41408ms
[2024-05-28 13:38:36] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 13:38:36] [INFO ] Invariant cache hit.
[2024-05-28 13:38:36] [INFO ] Implicit Places using invariants in 497 ms returned []
[2024-05-28 13:38:36] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 13:38:36] [INFO ] Invariant cache hit.
[2024-05-28 13:38:37] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 13:38:44] [INFO ] Implicit Places using invariants and state equation in 7512 ms returned []
Implicit Place search using SMT with State Equation took 8016 ms to find 0 implicit places.
Running 1096 sub problems to find dead transitions.
[2024-05-28 13:38:44] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 13:38:44] [INFO ] Invariant cache hit.
[2024-05-28 13:38:44] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:38:53] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
[2024-05-28 13:38:53] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-05-28 13:38:53] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2024-05-28 13:38:53] [INFO ] Deduced a trap composed of 64 places in 43 ms of which 1 ms to minimize.
[2024-05-28 13:38:53] [INFO ] Deduced a trap composed of 64 places in 41 ms of which 0 ms to minimize.
[2024-05-28 13:38:53] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 2 ms to minimize.
[2024-05-28 13:38:53] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
[2024-05-28 13:38:54] [INFO ] Deduced a trap composed of 334 places in 281 ms of which 5 ms to minimize.
[2024-05-28 13:38:54] [INFO ] Deduced a trap composed of 339 places in 270 ms of which 4 ms to minimize.
[2024-05-28 13:38:55] [INFO ] Deduced a trap composed of 183 places in 261 ms of which 4 ms to minimize.
[2024-05-28 13:38:55] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 2 ms to minimize.
[2024-05-28 13:38:55] [INFO ] Deduced a trap composed of 65 places in 151 ms of which 2 ms to minimize.
[2024-05-28 13:38:56] [INFO ] Deduced a trap composed of 314 places in 286 ms of which 4 ms to minimize.
[2024-05-28 13:38:56] [INFO ] Deduced a trap composed of 334 places in 299 ms of which 5 ms to minimize.
[2024-05-28 13:38:57] [INFO ] Deduced a trap composed of 351 places in 312 ms of which 5 ms to minimize.
[2024-05-28 13:38:57] [INFO ] Deduced a trap composed of 338 places in 301 ms of which 4 ms to minimize.
[2024-05-28 13:38:57] [INFO ] Deduced a trap composed of 307 places in 295 ms of which 5 ms to minimize.
[2024-05-28 13:38:58] [INFO ] Deduced a trap composed of 324 places in 300 ms of which 5 ms to minimize.
[2024-05-28 13:38:58] [INFO ] Deduced a trap composed of 42 places in 286 ms of which 4 ms to minimize.
[2024-05-28 13:38:58] [INFO ] Deduced a trap composed of 307 places in 274 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
[2024-05-28 13:38:59] [INFO ] Deduced a trap composed of 283 places in 290 ms of which 4 ms to minimize.
[2024-05-28 13:39:00] [INFO ] Deduced a trap composed of 353 places in 258 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 2/60 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 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:39:27] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:39:37] [INFO ] Deduced a trap composed of 299 places in 268 ms of which 4 ms to minimize.
[2024-05-28 13:39:37] [INFO ] Deduced a trap composed of 397 places in 227 ms of which 4 ms to minimize.
[2024-05-28 13:39:37] [INFO ] Deduced a trap composed of 408 places in 225 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 64 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 26/26 constraints]
After SMT, in 61698ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 61725ms
Finished structural reductions in LTL mode , in 1 iterations and 111165 ms. Remains : 588/588 places, 1098/1098 transitions.
Stuttering acceptance computed with spot in 322 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLFireability-00
Entered a terminal (fully accepting) state of product in 55 steps with 0 reset in 4 ms.
FORMULA PolyORBLF-COL-S02J04T08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T08-LTLFireability-00 finished in 111626 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 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 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 588 transition count 1074
Reduce places removed 24 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 40 rules applied. Total rules applied 64 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 80 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 80 place count 548 transition count 986
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 224 place count 476 transition count 986
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 304 place count 436 transition count 946
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 312 place count 428 transition count 938
Iterating global reduction 3 with 8 rules applied. Total rules applied 320 place count 428 transition count 938
Applied a total of 320 rules in 113 ms. Remains 428 /588 variables (removed 160) and now considering 938/1098 (removed 160) transitions.
Running 936 sub problems to find dead transitions.
[2024-05-28 13:39:46] [INFO ] Flow matrix only has 922 transitions (discarded 16 similar events)
// Phase 1: matrix 922 rows 428 cols
[2024-05-28 13:39:46] [INFO ] Computed 40 invariants in 13 ms
[2024-05-28 13:39:46] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 936 unsolved
[2024-05-28 13:39:54] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 1 ms to minimize.
[2024-05-28 13:39:54] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
[2024-05-28 13:39:54] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 2 ms to minimize.
[2024-05-28 13:39:54] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 1 ms to minimize.
[2024-05-28 13:39:54] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-05-28 13:39:55] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2024-05-28 13:39:55] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
[2024-05-28 13:39:57] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-05-28 13:39:58] [INFO ] Deduced a trap composed of 156 places in 222 ms of which 3 ms to minimize.
[2024-05-28 13:39:58] [INFO ] Deduced a trap composed of 163 places in 194 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/426 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 936 unsolved
[2024-05-28 13:40:04] [INFO ] Deduced a trap composed of 266 places in 210 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 426/1350 variables, and 49 constraints, problems are : Problem set: 0 solved, 936 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/428 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 936/936 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 936 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/426 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 936 unsolved
[2024-05-28 13:40:11] [INFO ] Deduced a trap composed of 180 places in 217 ms of which 3 ms to minimize.
[2024-05-28 13:40:11] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 2 ms to minimize.
[2024-05-28 13:40:18] [INFO ] Deduced a trap composed of 85 places in 233 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 936 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/1350 variables, and 52 constraints, problems are : Problem set: 0 solved, 936 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/428 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/936 constraints, Known Traps: 14/14 constraints]
After SMT, in 41674ms problems are : Problem set: 0 solved, 936 unsolved
Search for dead transitions found 0 dead transitions in 41689ms
[2024-05-28 13:40:28] [INFO ] Flow matrix only has 922 transitions (discarded 16 similar events)
[2024-05-28 13:40:28] [INFO ] Invariant cache hit.
[2024-05-28 13:40:28] [INFO ] Implicit Places using invariants in 433 ms returned []
[2024-05-28 13:40:28] [INFO ] Flow matrix only has 922 transitions (discarded 16 similar events)
[2024-05-28 13:40:28] [INFO ] Invariant cache hit.
[2024-05-28 13:40:28] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 13:40:33] [INFO ] Implicit Places using invariants and state equation in 4703 ms returned []
Implicit Place search using SMT with State Equation took 5140 ms to find 0 implicit places.
[2024-05-28 13:40:33] [INFO ] Redundant transitions in 19 ms returned []
Running 936 sub problems to find dead transitions.
[2024-05-28 13:40:33] [INFO ] Flow matrix only has 922 transitions (discarded 16 similar events)
[2024-05-28 13:40:33] [INFO ] Invariant cache hit.
[2024-05-28 13:40:33] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 936 unsolved
[2024-05-28 13:40:39] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 2 ms to minimize.
[2024-05-28 13:40:39] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
[2024-05-28 13:40:39] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 1 ms to minimize.
[2024-05-28 13:40:39] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 0 ms to minimize.
[2024-05-28 13:40:39] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2024-05-28 13:40:39] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-05-28 13:40:40] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-05-28 13:40:40] [INFO ] Deduced a trap composed of 179 places in 235 ms of which 4 ms to minimize.
[2024-05-28 13:40:40] [INFO ] Deduced a trap composed of 179 places in 200 ms of which 3 ms to minimize.
[2024-05-28 13:40:40] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 1 ms to minimize.
[2024-05-28 13:40:41] [INFO ] Deduced a trap composed of 63 places in 155 ms of which 2 ms to minimize.
[2024-05-28 13:40:44] [INFO ] Deduced a trap composed of 149 places in 158 ms of which 3 ms to minimize.
[2024-05-28 13:40:44] [INFO ] Deduced a trap composed of 19 places in 223 ms of which 3 ms to minimize.
[2024-05-28 13:40:45] [INFO ] Deduced a trap composed of 158 places in 193 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/426 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 936 unsolved
[2024-05-28 13:40:56] [INFO ] Deduced a trap composed of 207 places in 220 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 936 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 426/1350 variables, and 53 constraints, problems are : Problem set: 0 solved, 936 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/428 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 936/936 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 936 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/426 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 936 unsolved
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/427 variables, 1/54 constraints. Problems are: Problem set: 48 solved, 888 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/427 variables, 0/54 constraints. Problems are: Problem set: 48 solved, 888 unsolved
At refinement iteration 6 (OVERLAPS) 1/428 variables, 1/55 constraints. Problems are: Problem set: 48 solved, 888 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 428/1350 variables, and 55 constraints, problems are : Problem set: 48 solved, 888 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/428 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/936 constraints, Known Traps: 15/15 constraints]
After SMT, in 61297ms problems are : Problem set: 48 solved, 888 unsolved
Search for dead transitions found 48 dead transitions in 61314ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 428/588 places, 890/1098 transitions.
Applied a total of 0 rules in 25 ms. Remains 428 /428 variables (removed 0) and now considering 890/890 (removed 0) transitions.
[2024-05-28 13:41:34] [INFO ] Redundant transitions in 12 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 108359 ms. Remains : 428/588 places, 890/1098 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLFireability-01
Product exploration explored 100000 steps with 10789 reset in 574 ms.
Product exploration explored 100000 steps with 10801 reset in 451 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 155 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 75 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 10 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 140 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 p1), (NOT p1)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1)]
[2024-05-28 13:41:36] [INFO ] Flow matrix only has 874 transitions (discarded 16 similar events)
// Phase 1: matrix 874 rows 428 cols
[2024-05-28 13:41:36] [INFO ] Computed 40 invariants in 14 ms
[2024-05-28 13:41:36] [INFO ] [Real]Absence check using 14 positive place invariants in 19 ms returned sat
[2024-05-28 13:41:36] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 69 ms returned sat
[2024-05-28 13:41:38] [INFO ] [Real]Absence check using state equation in 1053 ms returned sat
[2024-05-28 13:41:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:41:38] [INFO ] [Nat]Absence check using 14 positive place invariants in 20 ms returned sat
[2024-05-28 13:41:38] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 39 ms returned sat
[2024-05-28 13:41:39] [INFO ] [Nat]Absence check using state equation in 1050 ms returned sat
[2024-05-28 13:41:39] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 13:41:40] [INFO ] [Nat]Added 96 Read/Feed constraints in 480 ms returned sat
[2024-05-28 13:41:40] [INFO ] Deduced a trap composed of 32 places in 293 ms of which 3 ms to minimize.
[2024-05-28 13:41:42] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 1858 ms
Could not prove EG (NOT p1)
Support contains 9 out of 428 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 : 428/428 places, 890/890 transitions.
Applied a total of 0 rules in 32 ms. Remains 428 /428 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Running 888 sub problems to find dead transitions.
[2024-05-28 13:41:42] [INFO ] Flow matrix only has 874 transitions (discarded 16 similar events)
[2024-05-28 13:41:42] [INFO ] Invariant cache hit.
[2024-05-28 13:41:42] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2024-05-28 13:41:49] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 2 ms to minimize.
[2024-05-28 13:41:49] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-28 13:41:49] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 1 ms to minimize.
[2024-05-28 13:41:49] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-28 13:41:49] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-28 13:41:49] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 1 ms to minimize.
[2024-05-28 13:41:49] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
[2024-05-28 13:41:49] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 0 ms to minimize.
[2024-05-28 13:41:50] [INFO ] Deduced a trap composed of 271 places in 167 ms of which 2 ms to minimize.
[2024-05-28 13:41:51] [INFO ] Deduced a trap composed of 144 places in 191 ms of which 3 ms to minimize.
[2024-05-28 13:41:54] [INFO ] Deduced a trap composed of 173 places in 265 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/426 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2024-05-28 13:41:57] [INFO ] Deduced a trap composed of 47 places in 116 ms of which 2 ms to minimize.
[2024-05-28 13:42:00] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 426/1302 variables, and 51 constraints, problems are : Problem set: 0 solved, 888 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/428 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 888/888 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 888 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/426 variables, 13/51 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2024-05-28 13:42:05] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 3 ms to minimize.
[2024-05-28 13:42:13] [INFO ] Deduced a trap composed of 223 places in 229 ms of which 3 ms to minimize.
[2024-05-28 13:42:15] [INFO ] Deduced a trap composed of 146 places in 219 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 888 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/1302 variables, and 54 constraints, problems are : Problem set: 0 solved, 888 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/428 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/888 constraints, Known Traps: 16/16 constraints]
After SMT, in 41328ms problems are : Problem set: 0 solved, 888 unsolved
Search for dead transitions found 0 dead transitions in 41345ms
[2024-05-28 13:42:23] [INFO ] Flow matrix only has 874 transitions (discarded 16 similar events)
[2024-05-28 13:42:23] [INFO ] Invariant cache hit.
[2024-05-28 13:42:23] [INFO ] Implicit Places using invariants in 360 ms returned []
[2024-05-28 13:42:23] [INFO ] Flow matrix only has 874 transitions (discarded 16 similar events)
[2024-05-28 13:42:23] [INFO ] Invariant cache hit.
[2024-05-28 13:42:24] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 13:42:28] [INFO ] Implicit Places using invariants and state equation in 4994 ms returned []
Implicit Place search using SMT with State Equation took 5356 ms to find 0 implicit places.
[2024-05-28 13:42:28] [INFO ] Redundant transitions in 14 ms returned []
Running 888 sub problems to find dead transitions.
[2024-05-28 13:42:28] [INFO ] Flow matrix only has 874 transitions (discarded 16 similar events)
[2024-05-28 13:42:28] [INFO ] Invariant cache hit.
[2024-05-28 13:42:28] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2024-05-28 13:42:36] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 1 ms to minimize.
[2024-05-28 13:42:36] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-05-28 13:42:36] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-05-28 13:42:36] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-05-28 13:42:36] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 0 ms to minimize.
[2024-05-28 13:42:36] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-05-28 13:42:36] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-05-28 13:42:36] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-05-28 13:42:37] [INFO ] Deduced a trap composed of 271 places in 141 ms of which 2 ms to minimize.
[2024-05-28 13:42:38] [INFO ] Deduced a trap composed of 144 places in 231 ms of which 2 ms to minimize.
[2024-05-28 13:42:41] [INFO ] Deduced a trap composed of 173 places in 162 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/426 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2024-05-28 13:42:44] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 2 ms to minimize.
[2024-05-28 13:42:47] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2024-05-28 13:42:56] [INFO ] Deduced a trap composed of 182 places in 255 ms of which 4 ms to minimize.
[2024-05-28 13:42:56] [INFO ] Deduced a trap composed of 181 places in 226 ms of which 3 ms to minimize.
[2024-05-28 13:42:57] [INFO ] Deduced a trap composed of 166 places in 217 ms of which 2 ms to minimize.
[2024-05-28 13:42:57] [INFO ] Deduced a trap composed of 181 places in 187 ms of which 3 ms to minimize.
[2024-05-28 13:42:57] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 2 ms to minimize.
[2024-05-28 13:42:57] [INFO ] Deduced a trap composed of 161 places in 183 ms of which 2 ms to minimize.
[2024-05-28 13:42:59] [INFO ] Deduced a trap composed of 223 places in 163 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 426/1302 variables, and 58 constraints, problems are : Problem set: 0 solved, 888 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/428 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 888/888 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 888 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/426 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2024-05-28 13:43:09] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 3 ms to minimize.
[2024-05-28 13:43:14] [INFO ] Deduced a trap composed of 147 places in 234 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 888 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/1302 variables, and 60 constraints, problems are : Problem set: 0 solved, 888 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/428 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/888 constraints, Known Traps: 22/22 constraints]
After SMT, in 61212ms problems are : Problem set: 0 solved, 888 unsolved
Search for dead transitions found 0 dead transitions in 61228ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 107989 ms. Remains : 428/428 places, 890/890 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 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 9 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 144 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 68 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
[2024-05-28 13:43:30] [INFO ] Flow matrix only has 874 transitions (discarded 16 similar events)
[2024-05-28 13:43:30] [INFO ] Invariant cache hit.
[2024-05-28 13:43:30] [INFO ] [Real]Absence check using 14 positive place invariants in 26 ms returned sat
[2024-05-28 13:43:30] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 39 ms returned sat
[2024-05-28 13:43:32] [INFO ] [Real]Absence check using state equation in 1076 ms returned sat
[2024-05-28 13:43:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:43:32] [INFO ] [Nat]Absence check using 14 positive place invariants in 19 ms returned sat
[2024-05-28 13:43:32] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 65 ms returned sat
[2024-05-28 13:43:33] [INFO ] [Nat]Absence check using state equation in 1068 ms returned sat
[2024-05-28 13:43:33] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 13:43:33] [INFO ] [Nat]Added 96 Read/Feed constraints in 227 ms returned sat
[2024-05-28 13:43:33] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 2 ms to minimize.
[2024-05-28 13:43:34] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-05-28 13:43:34] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 0 ms to minimize.
[2024-05-28 13:43:34] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:43:35] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 1 ms to minimize.
[2024-05-28 13:43:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1475 ms
[2024-05-28 13:43:35] [INFO ] Computed and/alt/rep : 432/1661/424 causal constraints (skipped 448 transitions) in 87 ms.
[2024-05-28 13:43:39] [INFO ] Added : 248 causal constraints over 50 iterations in 4633 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 10970 reset in 354 ms.
Product exploration explored 100000 steps with 10997 reset in 348 ms.
Built C files in :
/tmp/ltsmin10332982816677538348
[2024-05-28 13:43:40] [INFO ] Computing symmetric may disable matrix : 890 transitions.
[2024-05-28 13:43:40] [INFO ] Computation of Complete disable matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:43:40] [INFO ] Computing symmetric may enable matrix : 890 transitions.
[2024-05-28 13:43:40] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:43:41] [INFO ] Computing Do-Not-Accords matrix : 890 transitions.
[2024-05-28 13:43:41] [INFO ] Computation of Completed DNA matrix. took 36 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:43:41] [INFO ] Built C files in 273ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10332982816677538348
Running compilation step : cd /tmp/ltsmin10332982816677538348;'/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/ltsmin10332982816677538348;'/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/ltsmin10332982816677538348;'/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 428 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 428/428 places, 890/890 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 428 transition count 882
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 420 transition count 882
Applied a total of 16 rules in 19 ms. Remains 420 /428 variables (removed 8) and now considering 882/890 (removed 8) transitions.
Running 880 sub problems to find dead transitions.
[2024-05-28 13:43:44] [INFO ] Flow matrix only has 866 transitions (discarded 16 similar events)
// Phase 1: matrix 866 rows 420 cols
[2024-05-28 13:43:44] [INFO ] Computed 40 invariants in 8 ms
[2024-05-28 13:43:44] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 880 unsolved
[2024-05-28 13:43:49] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 2 ms to minimize.
[2024-05-28 13:43:49] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 4 ms to minimize.
[2024-05-28 13:43:49] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 0 ms to minimize.
[2024-05-28 13:43:49] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 1 ms to minimize.
[2024-05-28 13:43:50] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2024-05-28 13:43:50] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-05-28 13:43:50] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 2 ms to minimize.
[2024-05-28 13:43:50] [INFO ] Deduced a trap composed of 174 places in 187 ms of which 3 ms to minimize.
[2024-05-28 13:43:50] [INFO ] Deduced a trap composed of 168 places in 218 ms of which 6 ms to minimize.
[2024-05-28 13:43:52] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 2 ms to minimize.
[2024-05-28 13:43:52] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 2 ms to minimize.
[2024-05-28 13:43:52] [INFO ] Deduced a trap composed of 31 places in 166 ms of which 2 ms to minimize.
[2024-05-28 13:43:54] [INFO ] Deduced a trap composed of 158 places in 163 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 13/51 constraints. Problems are: Problem set: 0 solved, 880 unsolved
[2024-05-28 13:43:58] [INFO ] Deduced a trap composed of 171 places in 181 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 880 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1286 variables, and 52 constraints, problems are : Problem set: 0 solved, 880 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 880/880 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 880 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 880 unsolved
[2024-05-28 13:44:06] [INFO ] Deduced a trap composed of 190 places in 220 ms of which 3 ms to minimize.
[2024-05-28 13:44:09] [INFO ] Deduced a trap composed of 258 places in 205 ms of which 3 ms to minimize.
[2024-05-28 13:44:11] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 2 ms to minimize.
[2024-05-28 13:44:14] [INFO ] Deduced a trap composed of 145 places in 214 ms of which 3 ms to minimize.
[2024-05-28 13:44:14] [INFO ] Deduced a trap composed of 178 places in 145 ms of which 2 ms to minimize.
[2024-05-28 13:44:14] [INFO ] Deduced a trap composed of 144 places in 183 ms of which 2 ms to minimize.
[2024-05-28 13:44:15] [INFO ] Deduced a trap composed of 166 places in 228 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 880 unsolved
[2024-05-28 13:44:16] [INFO ] Deduced a trap composed of 176 places in 250 ms of which 3 ms to minimize.
[2024-05-28 13:44:19] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 2 ms to minimize.
[2024-05-28 13:44:24] [INFO ] Deduced a trap composed of 156 places in 228 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 880 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/1286 variables, and 62 constraints, problems are : Problem set: 0 solved, 880 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/880 constraints, Known Traps: 24/24 constraints]
After SMT, in 41001ms problems are : Problem set: 0 solved, 880 unsolved
Search for dead transitions found 0 dead transitions in 41011ms
[2024-05-28 13:44:25] [INFO ] Flow matrix only has 866 transitions (discarded 16 similar events)
[2024-05-28 13:44:25] [INFO ] Invariant cache hit.
[2024-05-28 13:44:25] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-05-28 13:44:25] [INFO ] Flow matrix only has 866 transitions (discarded 16 similar events)
[2024-05-28 13:44:25] [INFO ] Invariant cache hit.
[2024-05-28 13:44:25] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 13:44:31] [INFO ] Implicit Places using invariants and state equation in 5816 ms returned []
Implicit Place search using SMT with State Equation took 6126 ms to find 0 implicit places.
[2024-05-28 13:44:31] [INFO ] Redundant transitions in 5 ms returned []
Running 880 sub problems to find dead transitions.
[2024-05-28 13:44:31] [INFO ] Flow matrix only has 866 transitions (discarded 16 similar events)
[2024-05-28 13:44:31] [INFO ] Invariant cache hit.
[2024-05-28 13:44:31] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 880 unsolved
[2024-05-28 13:44:37] [INFO ] Deduced a trap composed of 171 places in 197 ms of which 3 ms to minimize.
[2024-05-28 13:44:37] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 1 ms to minimize.
[2024-05-28 13:44:37] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 1 ms to minimize.
[2024-05-28 13:44:38] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-05-28 13:44:38] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 2 ms to minimize.
[2024-05-28 13:44:38] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 2 ms to minimize.
[2024-05-28 13:44:38] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 1 ms to minimize.
[2024-05-28 13:44:38] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:44:39] [INFO ] Deduced a trap composed of 258 places in 207 ms of which 3 ms to minimize.
[2024-05-28 13:44:40] [INFO ] Deduced a trap composed of 43 places in 184 ms of which 3 ms to minimize.
[2024-05-28 13:44:40] [INFO ] Deduced a trap composed of 173 places in 162 ms of which 3 ms to minimize.
[2024-05-28 13:44:40] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 2 ms to minimize.
[2024-05-28 13:44:40] [INFO ] Deduced a trap composed of 141 places in 187 ms of which 2 ms to minimize.
[2024-05-28 13:44:41] [INFO ] Deduced a trap composed of 200 places in 224 ms of which 3 ms to minimize.
[2024-05-28 13:44:42] [INFO ] Deduced a trap composed of 158 places in 223 ms of which 13 ms to minimize.
[2024-05-28 13:44:42] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 2 ms to minimize.
[2024-05-28 13:44:45] [INFO ] Deduced a trap composed of 215 places in 223 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 880 unsolved
[2024-05-28 13:44:48] [INFO ] Deduced a trap composed of 170 places in 187 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 880 unsolved
SMT process timed out in 30950ms, After SMT, problems are : Problem set: 0 solved, 880 unsolved
Search for dead transitions found 0 dead transitions in 30959ms
Starting structural reductions in SI_LTL mode, iteration 1 : 420/428 places, 882/890 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 78135 ms. Remains : 420/428 places, 882/890 transitions.
Built C files in :
/tmp/ltsmin10438862106473455634
[2024-05-28 13:45:02] [INFO ] Computing symmetric may disable matrix : 882 transitions.
[2024-05-28 13:45:02] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:45:02] [INFO ] Computing symmetric may enable matrix : 882 transitions.
[2024-05-28 13:45:02] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:45:02] [INFO ] Computing Do-Not-Accords matrix : 882 transitions.
[2024-05-28 13:45:02] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:45:02] [INFO ] Built C files in 145ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10438862106473455634
Running compilation step : cd /tmp/ltsmin10438862106473455634;'/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 2961 ms.
Running link step : cd /tmp/ltsmin10438862106473455634;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 105 ms.
Running LTSmin : cd /tmp/ltsmin10438862106473455634;'/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/stateBased14036191120140129388.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 13:45:17] [INFO ] Flatten gal took : 37 ms
[2024-05-28 13:45:17] [INFO ] Flatten gal took : 37 ms
[2024-05-28 13:45:17] [INFO ] Time to serialize gal into /tmp/LTL7123983304376478831.gal : 9 ms
[2024-05-28 13:45:17] [INFO ] Time to serialize properties into /tmp/LTL16267963824937867621.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7123983304376478831.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13512910052321487314.hoa' '-atoms' '/tmp/LTL16267963824937867621.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...319
Loading property file /tmp/LTL16267963824937867621.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13512910052321487314.hoa
Detected timeout of ITS tools.
[2024-05-28 13:45:32] [INFO ] Flatten gal took : 50 ms
[2024-05-28 13:45:32] [INFO ] Flatten gal took : 44 ms
[2024-05-28 13:45:32] [INFO ] Time to serialize gal into /tmp/LTL16177576560960030727.gal : 40 ms
[2024-05-28 13:45:32] [INFO ] Time to serialize properties into /tmp/LTL12198218973431857423.ltl : 16 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/LTL16177576560960030727.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12198218973431857423.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...277
Read 1 LTL properties
Checking formula 0 : !((X(G(X(F(("(((((P_1095>=1)&&(P_1113_7>=1))||((P_1095>=1)&&(P_1113_5>=1)))||(((P_1095>=1)&&(P_1113_6>=1))||((P_1095>=1)&&(P_1113_0>=1...904
Formula 0 simplified : FG(!"(((((Check_Sources_E_4>=1)&&(ORB_Lock>=1))||((Check_Sources_E_3>=1)&&(ORB_Lock>=1)))||(((Check_Sources_E_2>=1)&&(ORB_Lock>=1))|...975
Detected timeout of ITS tools.
[2024-05-28 13:45:47] [INFO ] Flatten gal took : 66 ms
[2024-05-28 13:45:47] [INFO ] Applying decomposition
[2024-05-28 13:45:47] [INFO ] Flatten gal took : 62 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/graph1444665742648726999.txt' '-o' '/tmp/graph1444665742648726999.bin' '-w' '/tmp/graph1444665742648726999.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1444665742648726999.bin' '-l' '-1' '-v' '-w' '/tmp/graph1444665742648726999.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:45:48] [INFO ] Decomposing Gal with order
[2024-05-28 13:45:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:45:48] [INFO ] Removed a total of 610 redundant transitions.
[2024-05-28 13:45:48] [INFO ] Flatten gal took : 243 ms
[2024-05-28 13:45:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 510 labels/synchronizations in 33 ms.
[2024-05-28 13:45:48] [INFO ] Time to serialize gal into /tmp/LTL11635047198746823924.gal : 14 ms
[2024-05-28 13:45:48] [INFO ] Time to serialize properties into /tmp/LTL12007460200137551155.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/LTL11635047198746823924.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12007460200137551155.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(("(((((i5.u24.P_1095>=1)&&(i5.u24.P_1113_7>=1))||((i5.u24.P_1095>=1)&&(i5.u24.P_1113_5>=1)))||(((i5.u24.P_1095>=1)&&(i5.u24...1232
Formula 0 simplified : FG(!"(((((i5.u24.Check_Sources_E_4>=1)&&(i8.u9.ORB_Lock>=1))||((i5.u24.Check_Sources_E_3>=1)&&(i8.u9.ORB_Lock>=1)))||(((i5.u24.Check...1295
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S02J04T08-LTLFireability-01 finished in 377336 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 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 1098/1098 transitions.
Applied a total of 0 rules in 9 ms. Remains 588 /588 variables (removed 0) and now considering 1098/1098 (removed 0) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-28 13:46:03] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 588 cols
[2024-05-28 13:46:03] [INFO ] Computed 40 invariants in 25 ms
[2024-05-28 13:46:03] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:46:13] [INFO ] Deduced a trap composed of 64 places in 109 ms of which 2 ms to minimize.
[2024-05-28 13:46:13] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 1 ms to minimize.
[2024-05-28 13:46:14] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 2 ms to minimize.
[2024-05-28 13:46:14] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
[2024-05-28 13:46:14] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 2 ms to minimize.
[2024-05-28 13:46:14] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
[2024-05-28 13:46:14] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 1 ms to minimize.
[2024-05-28 13:46:15] [INFO ] Deduced a trap composed of 325 places in 301 ms of which 4 ms to minimize.
[2024-05-28 13:46:15] [INFO ] Deduced a trap composed of 165 places in 431 ms of which 5 ms to minimize.
[2024-05-28 13:46:15] [INFO ] Deduced a trap composed of 64 places in 43 ms of which 1 ms to minimize.
[2024-05-28 13:46:16] [INFO ] Deduced a trap composed of 346 places in 301 ms of which 3 ms to minimize.
[2024-05-28 13:46:17] [INFO ] Deduced a trap composed of 308 places in 255 ms of which 3 ms to minimize.
[2024-05-28 13:46:17] [INFO ] Deduced a trap composed of 307 places in 256 ms of which 4 ms to minimize.
[2024-05-28 13:46:17] [INFO ] Deduced a trap composed of 313 places in 229 ms of which 3 ms to minimize.
[2024-05-28 13:46:17] [INFO ] Deduced a trap composed of 299 places in 224 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 53 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:46:27] [INFO ] Deduced a trap composed of 353 places in 280 ms of which 4 ms to minimize.
[2024-05-28 13:46:27] [INFO ] Deduced a trap composed of 45 places in 175 ms of which 4 ms to minimize.
[2024-05-28 13:46:28] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 2 ms to minimize.
[2024-05-28 13:46:32] [INFO ] Deduced a trap composed of 324 places in 282 ms of which 4 ms to minimize.
[2024-05-28 13:46:33] [INFO ] Deduced a trap composed of 311 places in 286 ms of which 5 ms to minimize.
[2024-05-28 13:46:38] [INFO ] Deduced a trap composed of 313 places in 263 ms of which 3 ms to minimize.
[2024-05-28 13:46:39] [INFO ] Deduced a trap composed of 47 places in 189 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 7/60 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 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 22/22 constraints]
After SMT, in 41386ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41401ms
[2024-05-28 13:46:45] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 13:46:45] [INFO ] Invariant cache hit.
[2024-05-28 13:46:45] [INFO ] Implicit Places using invariants in 427 ms returned []
[2024-05-28 13:46:45] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 13:46:45] [INFO ] Invariant cache hit.
[2024-05-28 13:46:46] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 13:46:52] [INFO ] Implicit Places using invariants and state equation in 6690 ms returned []
Implicit Place search using SMT with State Equation took 7120 ms to find 0 implicit places.
Running 1096 sub problems to find dead transitions.
[2024-05-28 13:46:52] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 13:46:52] [INFO ] Invariant cache hit.
[2024-05-28 13:46:52] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:47:01] [INFO ] Deduced a trap composed of 64 places in 40 ms of which 1 ms to minimize.
[2024-05-28 13:47:01] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-05-28 13:47:01] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-05-28 13:47:01] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2024-05-28 13:47:01] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-05-28 13:47:01] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
[2024-05-28 13:47:02] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 0 ms to minimize.
[2024-05-28 13:47:02] [INFO ] Deduced a trap composed of 334 places in 312 ms of which 4 ms to minimize.
[2024-05-28 13:47:02] [INFO ] Deduced a trap composed of 339 places in 266 ms of which 4 ms to minimize.
[2024-05-28 13:47:03] [INFO ] Deduced a trap composed of 183 places in 245 ms of which 4 ms to minimize.
[2024-05-28 13:47:03] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-05-28 13:47:04] [INFO ] Deduced a trap composed of 65 places in 139 ms of which 3 ms to minimize.
[2024-05-28 13:47:04] [INFO ] Deduced a trap composed of 314 places in 298 ms of which 4 ms to minimize.
[2024-05-28 13:47:05] [INFO ] Deduced a trap composed of 334 places in 338 ms of which 4 ms to minimize.
[2024-05-28 13:47:05] [INFO ] Deduced a trap composed of 351 places in 246 ms of which 4 ms to minimize.
[2024-05-28 13:47:05] [INFO ] Deduced a trap composed of 338 places in 241 ms of which 4 ms to minimize.
[2024-05-28 13:47:05] [INFO ] Deduced a trap composed of 307 places in 291 ms of which 4 ms to minimize.
[2024-05-28 13:47:06] [INFO ] Deduced a trap composed of 324 places in 272 ms of which 4 ms to minimize.
[2024-05-28 13:47:06] [INFO ] Deduced a trap composed of 42 places in 309 ms of which 4 ms to minimize.
[2024-05-28 13:47:06] [INFO ] Deduced a trap composed of 307 places in 264 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
[2024-05-28 13:47:08] [INFO ] Deduced a trap composed of 283 places in 243 ms of which 3 ms to minimize.
[2024-05-28 13:47:08] [INFO ] Deduced a trap composed of 353 places in 320 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 6.0)
(s1 4.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 1.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 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 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)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 2/60 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 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:47:34] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:47:45] [INFO ] Deduced a trap composed of 299 places in 350 ms of which 4 ms to minimize.
[2024-05-28 13:47:45] [INFO ] Deduced a trap composed of 397 places in 272 ms of which 6 ms to minimize.
[2024-05-28 13:47:45] [INFO ] Deduced a trap composed of 408 places in 217 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 586/1670 variables, and 64 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 26/26 constraints]
After SMT, in 61259ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 61269ms
Finished structural reductions in LTL mode , in 1 iterations and 109806 ms. Remains : 588/588 places, 1098/1098 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLFireability-04
Product exploration explored 100000 steps with 3334 reset in 329 ms.
Product exploration explored 100000 steps with 3278 reset in 320 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 115 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 89 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 237 steps (0 resets) in 4 ms. (47 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 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
[2024-05-28 13:47:54] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 13:47:54] [INFO ] Invariant cache hit.
[2024-05-28 13:47:55] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-28 13:47:55] [INFO ] [Real]Absence check using 11 positive and 29 generalized place invariants in 95 ms returned sat
[2024-05-28 13:47:56] [INFO ] [Real]Absence check using state equation in 837 ms returned sat
[2024-05-28 13:47:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:47:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-28 13:47:56] [INFO ] [Nat]Absence check using 11 positive and 29 generalized place invariants in 98 ms returned sat
[2024-05-28 13:47:58] [INFO ] [Nat]Absence check using state equation in 1415 ms returned sat
[2024-05-28 13:47:58] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 13:47:58] [INFO ] [Nat]Added 96 Read/Feed constraints in 298 ms returned sat
[2024-05-28 13:47:58] [INFO ] Deduced a trap composed of 98 places in 328 ms of which 5 ms to minimize.
[2024-05-28 13:47:59] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 2 ms to minimize.
[2024-05-28 13:47:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 976 ms
[2024-05-28 13:47:59] [INFO ] Computed and/alt/rep : 712/2573/704 causal constraints (skipped 376 transitions) in 107 ms.
[2024-05-28 13:48:07] [INFO ] Added : 215 causal constraints over 43 iterations in 8299 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 588 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 1098/1098 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 588 transition count 1058
Reduce places removed 40 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 48 rules applied. Total rules applied 88 place count 548 transition count 1050
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 96 place count 540 transition count 1050
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 96 place count 540 transition count 986
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 224 place count 476 transition count 986
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 336 place count 420 transition count 930
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 344 place count 412 transition count 922
Iterating global reduction 3 with 8 rules applied. Total rules applied 352 place count 412 transition count 922
Applied a total of 352 rules in 84 ms. Remains 412 /588 variables (removed 176) and now considering 922/1098 (removed 176) transitions.
Running 920 sub problems to find dead transitions.
[2024-05-28 13:48:08] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
// Phase 1: matrix 906 rows 412 cols
[2024-05-28 13:48:08] [INFO ] Computed 40 invariants in 18 ms
[2024-05-28 13:48:08] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-28 13:48:14] [INFO ] Deduced a trap composed of 42 places in 145 ms of which 3 ms to minimize.
[2024-05-28 13:48:14] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 2 ms to minimize.
[2024-05-28 13:48:14] [INFO ] Deduced a trap composed of 42 places in 119 ms of which 1 ms to minimize.
[2024-05-28 13:48:14] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 2 ms to minimize.
[2024-05-28 13:48:14] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
[2024-05-28 13:48:14] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 0 ms to minimize.
[2024-05-28 13:48:14] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
[2024-05-28 13:48:15] [INFO ] Deduced a trap composed of 188 places in 244 ms of which 3 ms to minimize.
[2024-05-28 13:48:15] [INFO ] Deduced a trap composed of 189 places in 228 ms of which 4 ms to minimize.
[2024-05-28 13:48:15] [INFO ] Deduced a trap composed of 189 places in 230 ms of which 4 ms to minimize.
[2024-05-28 13:48:16] [INFO ] Deduced a trap composed of 183 places in 248 ms of which 3 ms to minimize.
[2024-05-28 13:48:16] [INFO ] Deduced a trap composed of 183 places in 261 ms of which 4 ms to minimize.
[2024-05-28 13:48:16] [INFO ] Deduced a trap composed of 183 places in 232 ms of which 3 ms to minimize.
[2024-05-28 13:48:17] [INFO ] Deduced a trap composed of 189 places in 254 ms of which 3 ms to minimize.
[2024-05-28 13:48:17] [INFO ] Deduced a trap composed of 163 places in 231 ms of which 3 ms to minimize.
[2024-05-28 13:48:17] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-05-28 13:48:18] [INFO ] Deduced a trap composed of 55 places in 129 ms of which 2 ms to minimize.
[2024-05-28 13:48:23] [INFO ] Deduced a trap composed of 166 places in 210 ms of which 3 ms to minimize.
[2024-05-28 13:48:24] [INFO ] Deduced a trap composed of 195 places in 208 ms of which 3 ms to minimize.
[2024-05-28 13:48:25] [INFO ] Deduced a trap composed of 169 places in 255 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 920 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/1318 variables, and 58 constraints, problems are : Problem set: 0 solved, 920 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 920/920 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 920 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-28 13:48:33] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 3 ms to minimize.
[2024-05-28 13:48:39] [INFO ] Deduced a trap composed of 23 places in 229 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-28 13:48:47] [INFO ] Deduced a trap composed of 164 places in 152 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 920 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/1318 variables, and 61 constraints, problems are : Problem set: 0 solved, 920 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/920 constraints, Known Traps: 23/23 constraints]
After SMT, in 41334ms problems are : Problem set: 0 solved, 920 unsolved
Search for dead transitions found 0 dead transitions in 41346ms
[2024-05-28 13:48:49] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-28 13:48:49] [INFO ] Invariant cache hit.
[2024-05-28 13:48:49] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-05-28 13:48:49] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-28 13:48:49] [INFO ] Invariant cache hit.
[2024-05-28 13:48:50] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 13:48:53] [INFO ] Implicit Places using invariants and state equation in 3779 ms returned []
Implicit Place search using SMT with State Equation took 4133 ms to find 0 implicit places.
[2024-05-28 13:48:53] [INFO ] Redundant transitions in 5 ms returned []
Running 920 sub problems to find dead transitions.
[2024-05-28 13:48:53] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-28 13:48:53] [INFO ] Invariant cache hit.
[2024-05-28 13:48:53] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-28 13:49:00] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 2 ms to minimize.
[2024-05-28 13:49:00] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
[2024-05-28 13:49:00] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 1 ms to minimize.
[2024-05-28 13:49:00] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 1 ms to minimize.
[2024-05-28 13:49:00] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-05-28 13:49:01] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 0 ms to minimize.
[2024-05-28 13:49:01] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-05-28 13:49:01] [INFO ] Deduced a trap composed of 176 places in 204 ms of which 3 ms to minimize.
[2024-05-28 13:49:01] [INFO ] Deduced a trap composed of 171 places in 201 ms of which 3 ms to minimize.
[2024-05-28 13:49:02] [INFO ] Deduced a trap composed of 88 places in 172 ms of which 3 ms to minimize.
[2024-05-28 13:49:02] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:49:03] [INFO ] Deduced a trap composed of 55 places in 137 ms of which 2 ms to minimize.
[2024-05-28 13:49:09] [INFO ] Deduced a trap composed of 147 places in 214 ms of which 2 ms to minimize.
[2024-05-28 13:49:09] [INFO ] Deduced a trap composed of 173 places in 176 ms of which 3 ms to minimize.
[2024-05-28 13:49:09] [INFO ] Deduced a trap composed of 162 places in 139 ms of which 2 ms to minimize.
[2024-05-28 13:49:10] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-28 13:49:17] [INFO ] Deduced a trap composed of 158 places in 190 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 920 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/1318 variables, and 55 constraints, problems are : Problem set: 0 solved, 920 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 920/920 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 920 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-28 13:49:36] [INFO ] Deduced a trap composed of 37 places in 156 ms of which 2 ms to minimize.
[2024-05-28 13:49:36] [INFO ] Deduced a trap composed of 250 places in 256 ms of which 3 ms to minimize.
[2024-05-28 13:49:39] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 920 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/1318 variables, and 58 constraints, problems are : Problem set: 0 solved, 920 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/920 constraints, Known Traps: 20/20 constraints]
After SMT, in 61436ms problems are : Problem set: 0 solved, 920 unsolved
Search for dead transitions found 0 dead transitions in 61445ms
Starting structural reductions in SI_LTL mode, iteration 1 : 412/588 places, 922/1098 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 107027 ms. Remains : 412/588 places, 922/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 102 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 p0), (NOT p0)]
RANDOM walk for 173 steps (0 resets) in 5 ms. (28 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 92 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 97 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
[2024-05-28 13:49:55] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-28 13:49:55] [INFO ] Invariant cache hit.
[2024-05-28 13:49:55] [INFO ] [Real]Absence check using 13 positive place invariants in 24 ms returned sat
[2024-05-28 13:49:55] [INFO ] [Real]Absence check using 13 positive and 27 generalized place invariants in 68 ms returned sat
[2024-05-28 13:49:56] [INFO ] [Real]Absence check using state equation in 553 ms returned sat
[2024-05-28 13:49:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:49:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 60 ms returned sat
[2024-05-28 13:49:57] [INFO ] [Nat]Absence check using 13 positive and 27 generalized place invariants in 42 ms returned sat
[2024-05-28 13:49:58] [INFO ] [Nat]Absence check using state equation in 1778 ms returned sat
[2024-05-28 13:49:58] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 13:49:59] [INFO ] [Nat]Added 96 Read/Feed constraints in 305 ms returned sat
[2024-05-28 13:49:59] [INFO ] Deduced a trap composed of 47 places in 146 ms of which 2 ms to minimize.
[2024-05-28 13:49:59] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 1 ms to minimize.
[2024-05-28 13:49:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 627 ms
[2024-05-28 13:49:59] [INFO ] Computed and/alt/rep : 384/1325/376 causal constraints (skipped 528 transitions) in 67 ms.
[2024-05-28 13:50:02] [INFO ] Added : 146 causal constraints over 30 iterations in 2437 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2440 reset in 354 ms.
Product exploration explored 100000 steps with 2429 reset in 364 ms.
Built C files in :
/tmp/ltsmin12804233481314170501
[2024-05-28 13:50:02] [INFO ] Computing symmetric may disable matrix : 922 transitions.
[2024-05-28 13:50:02] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:50:02] [INFO ] Computing symmetric may enable matrix : 922 transitions.
[2024-05-28 13:50:02] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:50:03] [INFO ] Computing Do-Not-Accords matrix : 922 transitions.
[2024-05-28 13:50:03] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:50:03] [INFO ] Built C files in 181ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12804233481314170501
Running compilation step : cd /tmp/ltsmin12804233481314170501;'/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 2796 ms.
Running link step : cd /tmp/ltsmin12804233481314170501;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 94 ms.
Running LTSmin : cd /tmp/ltsmin12804233481314170501;'/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/stateBased1455379979602941808.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 412 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 412/412 places, 922/922 transitions.
Applied a total of 0 rules in 12 ms. Remains 412 /412 variables (removed 0) and now considering 922/922 (removed 0) transitions.
Running 920 sub problems to find dead transitions.
[2024-05-28 13:50:18] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-28 13:50:18] [INFO ] Invariant cache hit.
[2024-05-28 13:50:18] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-28 13:50:24] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 1 ms to minimize.
[2024-05-28 13:50:24] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 1 ms to minimize.
[2024-05-28 13:50:24] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
[2024-05-28 13:50:24] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 0 ms to minimize.
[2024-05-28 13:50:24] [INFO ] Deduced a trap composed of 42 places in 25 ms of which 0 ms to minimize.
[2024-05-28 13:50:24] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 4 ms to minimize.
[2024-05-28 13:50:24] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 0 ms to minimize.
[2024-05-28 13:50:24] [INFO ] Deduced a trap composed of 176 places in 159 ms of which 2 ms to minimize.
[2024-05-28 13:50:25] [INFO ] Deduced a trap composed of 171 places in 183 ms of which 2 ms to minimize.
[2024-05-28 13:50:26] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 1 ms to minimize.
[2024-05-28 13:50:26] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 0 ms to minimize.
[2024-05-28 13:50:26] [INFO ] Deduced a trap composed of 55 places in 104 ms of which 2 ms to minimize.
[2024-05-28 13:50:31] [INFO ] Deduced a trap composed of 147 places in 186 ms of which 4 ms to minimize.
[2024-05-28 13:50:32] [INFO ] Deduced a trap composed of 173 places in 155 ms of which 2 ms to minimize.
[2024-05-28 13:50:32] [INFO ] Deduced a trap composed of 162 places in 141 ms of which 2 ms to minimize.
[2024-05-28 13:50:32] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 920 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/1318 variables, and 54 constraints, problems are : Problem set: 0 solved, 920 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 920/920 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 920 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-28 13:50:44] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 2 ms to minimize.
[2024-05-28 13:50:47] [INFO ] Deduced a trap composed of 250 places in 149 ms of which 2 ms to minimize.
[2024-05-28 13:50:53] [INFO ] Deduced a trap composed of 163 places in 169 ms of which 2 ms to minimize.
[2024-05-28 13:50:54] [INFO ] Deduced a trap composed of 93 places in 167 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 920 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/1318 variables, and 58 constraints, problems are : Problem set: 0 solved, 920 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/920 constraints, Known Traps: 20/20 constraints]
After SMT, in 41344ms problems are : Problem set: 0 solved, 920 unsolved
Search for dead transitions found 0 dead transitions in 41353ms
[2024-05-28 13:50:59] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-28 13:50:59] [INFO ] Invariant cache hit.
[2024-05-28 13:50:59] [INFO ] Implicit Places using invariants in 369 ms returned []
[2024-05-28 13:50:59] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-28 13:50:59] [INFO ] Invariant cache hit.
[2024-05-28 13:51:00] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 13:51:03] [INFO ] Implicit Places using invariants and state equation in 3542 ms returned []
Implicit Place search using SMT with State Equation took 3948 ms to find 0 implicit places.
[2024-05-28 13:51:03] [INFO ] Redundant transitions in 10 ms returned []
Running 920 sub problems to find dead transitions.
[2024-05-28 13:51:03] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-28 13:51:03] [INFO ] Invariant cache hit.
[2024-05-28 13:51:03] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-28 13:51:09] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 1 ms to minimize.
[2024-05-28 13:51:09] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 1 ms to minimize.
[2024-05-28 13:51:09] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 0 ms to minimize.
[2024-05-28 13:51:09] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-05-28 13:51:09] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 0 ms to minimize.
[2024-05-28 13:51:09] [INFO ] Deduced a trap composed of 42 places in 31 ms of which 1 ms to minimize.
[2024-05-28 13:51:09] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-05-28 13:51:10] [INFO ] Deduced a trap composed of 176 places in 175 ms of which 2 ms to minimize.
[2024-05-28 13:51:10] [INFO ] Deduced a trap composed of 171 places in 166 ms of which 2 ms to minimize.
[2024-05-28 13:51:11] [INFO ] Deduced a trap composed of 88 places in 115 ms of which 2 ms to minimize.
[2024-05-28 13:51:11] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 0 ms to minimize.
[2024-05-28 13:51:11] [INFO ] Deduced a trap composed of 55 places in 102 ms of which 2 ms to minimize.
[2024-05-28 13:51:16] [INFO ] Deduced a trap composed of 147 places in 180 ms of which 3 ms to minimize.
[2024-05-28 13:51:17] [INFO ] Deduced a trap composed of 173 places in 156 ms of which 2 ms to minimize.
[2024-05-28 13:51:17] [INFO ] Deduced a trap composed of 162 places in 187 ms of which 2 ms to minimize.
[2024-05-28 13:51:17] [INFO ] Deduced a trap composed of 3 places in 161 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-28 13:51:24] [INFO ] Deduced a trap composed of 158 places in 172 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-28 13:51:31] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 920 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/1318 variables, and 56 constraints, problems are : Problem set: 0 solved, 920 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 920/920 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 920 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-28 13:51:41] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2024-05-28 13:51:48] [INFO ] Deduced a trap composed of 91 places in 146 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-28 13:51:56] [INFO ] Deduced a trap composed of 250 places in 154 ms of which 2 ms to minimize.
[2024-05-28 13:52:02] [INFO ] Deduced a trap composed of 203 places in 153 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 920 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/1318 variables, and 60 constraints, problems are : Problem set: 0 solved, 920 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/920 constraints, Known Traps: 22/22 constraints]
After SMT, in 61111ms problems are : Problem set: 0 solved, 920 unsolved
Search for dead transitions found 0 dead transitions in 61123ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 106471 ms. Remains : 412/412 places, 922/922 transitions.
Built C files in :
/tmp/ltsmin13021564222969036605
[2024-05-28 13:52:04] [INFO ] Computing symmetric may disable matrix : 922 transitions.
[2024-05-28 13:52:04] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:52:04] [INFO ] Computing symmetric may enable matrix : 922 transitions.
[2024-05-28 13:52:04] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:52:04] [INFO ] Computing Do-Not-Accords matrix : 922 transitions.
[2024-05-28 13:52:04] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:52:04] [INFO ] Built C files in 218ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13021564222969036605
Running compilation step : cd /tmp/ltsmin13021564222969036605;'/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/ltsmin13021564222969036605;'/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/ltsmin13021564222969036605;'/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 13:52:07] [INFO ] Flatten gal took : 96 ms
[2024-05-28 13:52:07] [INFO ] Flatten gal took : 80 ms
[2024-05-28 13:52:07] [INFO ] Time to serialize gal into /tmp/LTL6823773742879295703.gal : 19 ms
[2024-05-28 13:52:07] [INFO ] Time to serialize properties into /tmp/LTL12249206261820352077.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/LTL6823773742879295703.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15783968191317209822.hoa' '-atoms' '/tmp/LTL12249206261820352077.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...319
Loading property file /tmp/LTL12249206261820352077.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15783968191317209822.hoa
Detected timeout of ITS tools.
[2024-05-28 13:52:23] [INFO ] Flatten gal took : 42 ms
[2024-05-28 13:52:23] [INFO ] Flatten gal took : 28 ms
[2024-05-28 13:52:23] [INFO ] Time to serialize gal into /tmp/LTL4165780632234815550.gal : 21 ms
[2024-05-28 13:52:23] [INFO ] Time to serialize properties into /tmp/LTL13824780014983601846.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4165780632234815550.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13824780014983601846.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_2>=1)||(NotifyEventSourceAddedB_3>=1))||((NotifyEventSourceAddedB_5>=1)||(NotifyEventSourceAddedB...1539
Formula 0 simplified : G(G!"((((NotifyEventSourceAddedB_2>=1)||(NotifyEventSourceAddedB_3>=1))||((NotifyEventSourceAddedB_5>=1)||(NotifyEventSourceAddedB_4...1246
Detected timeout of ITS tools.
[2024-05-28 13:52:38] [INFO ] Flatten gal took : 56 ms
[2024-05-28 13:52:38] [INFO ] Applying decomposition
[2024-05-28 13:52:38] [INFO ] Flatten gal took : 31 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/graph17446191626941110648.txt' '-o' '/tmp/graph17446191626941110648.bin' '-w' '/tmp/graph17446191626941110648.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17446191626941110648.bin' '-l' '-1' '-v' '-w' '/tmp/graph17446191626941110648.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:52:38] [INFO ] Decomposing Gal with order
[2024-05-28 13:52:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:52:38] [INFO ] Removed a total of 738 redundant transitions.
[2024-05-28 13:52:38] [INFO ] Flatten gal took : 126 ms
[2024-05-28 13:52:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 220 labels/synchronizations in 43 ms.
[2024-05-28 13:52:38] [INFO ] Time to serialize gal into /tmp/LTL17806341996805056514.gal : 32 ms
[2024-05-28 13:52:38] [INFO ] Time to serialize properties into /tmp/LTL11218409839692657979.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/LTL17806341996805056514.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11218409839692657979.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 : !((F((F("((((i2.u4.NotifyEventSourceAddedB_2>=1)||(i2.u23.NotifyEventSourceAddedB_3>=1))||((i2.u6.NotifyEventSourceAddedB_5>=1)||(i2.u...1839
Formula 0 simplified : G(G!"((((i2.u4.NotifyEventSourceAddedB_2>=1)||(i2.u23.NotifyEventSourceAddedB_3>=1))||((i2.u6.NotifyEventSourceAddedB_5>=1)||(i2.u5....1495
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S02J04T08-LTLFireability-04 finished in 410265 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 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 1098/1098 transitions.
Applied a total of 0 rules in 15 ms. Remains 588 /588 variables (removed 0) and now considering 1098/1098 (removed 0) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-28 13:52:53] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 588 cols
[2024-05-28 13:52:53] [INFO ] Computed 40 invariants in 26 ms
[2024-05-28 13:52:53] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:53:02] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 2 ms to minimize.
[2024-05-28 13:53:02] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 1 ms to minimize.
[2024-05-28 13:53:02] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 1 ms to minimize.
[2024-05-28 13:53:02] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
[2024-05-28 13:53:02] [INFO ] Deduced a trap composed of 64 places in 39 ms of which 0 ms to minimize.
[2024-05-28 13:53:02] [INFO ] Deduced a trap composed of 64 places in 38 ms of which 1 ms to minimize.
[2024-05-28 13:53:02] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-05-28 13:53:03] [INFO ] Deduced a trap composed of 325 places in 432 ms of which 4 ms to minimize.
[2024-05-28 13:53:03] [INFO ] Deduced a trap composed of 165 places in 282 ms of which 5 ms to minimize.
[2024-05-28 13:53:04] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2024-05-28 13:53:05] [INFO ] Deduced a trap composed of 346 places in 325 ms of which 5 ms to minimize.
[2024-05-28 13:53:05] [INFO ] Deduced a trap composed of 308 places in 256 ms of which 3 ms to minimize.
[2024-05-28 13:53:05] [INFO ] Deduced a trap composed of 307 places in 227 ms of which 3 ms to minimize.
[2024-05-28 13:53:06] [INFO ] Deduced a trap composed of 313 places in 256 ms of which 3 ms to minimize.
[2024-05-28 13:53:06] [INFO ] Deduced a trap composed of 299 places in 245 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 53 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:53:16] [INFO ] Deduced a trap composed of 353 places in 256 ms of which 4 ms to minimize.
[2024-05-28 13:53:17] [INFO ] Deduced a trap composed of 45 places in 116 ms of which 2 ms to minimize.
[2024-05-28 13:53:17] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 2 ms to minimize.
[2024-05-28 13:53:23] [INFO ] Deduced a trap composed of 324 places in 219 ms of which 3 ms to minimize.
[2024-05-28 13:53:23] [INFO ] Deduced a trap composed of 311 places in 205 ms of which 3 ms to minimize.
[2024-05-28 13:53:27] [INFO ] Deduced a trap composed of 313 places in 227 ms of which 3 ms to minimize.
[2024-05-28 13:53:28] [INFO ] Deduced a trap composed of 47 places in 193 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 7/60 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 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 22/22 constraints]
After SMT, in 41174ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41183ms
[2024-05-28 13:53:35] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 13:53:35] [INFO ] Invariant cache hit.
[2024-05-28 13:53:35] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-05-28 13:53:35] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 13:53:35] [INFO ] Invariant cache hit.
[2024-05-28 13:53:36] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 13:53:42] [INFO ] Implicit Places using invariants and state equation in 6947 ms returned []
Implicit Place search using SMT with State Equation took 7264 ms to find 0 implicit places.
Running 1096 sub problems to find dead transitions.
[2024-05-28 13:53:42] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 13:53:42] [INFO ] Invariant cache hit.
[2024-05-28 13:53:42] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:53:51] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 1 ms to minimize.
[2024-05-28 13:53:51] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:53:51] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:53:51] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-05-28 13:53:51] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 0 ms to minimize.
[2024-05-28 13:53:51] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2024-05-28 13:53:51] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-05-28 13:53:52] [INFO ] Deduced a trap composed of 334 places in 211 ms of which 3 ms to minimize.
[2024-05-28 13:53:52] [INFO ] Deduced a trap composed of 339 places in 239 ms of which 2 ms to minimize.
[2024-05-28 13:53:52] [INFO ] Deduced a trap composed of 183 places in 207 ms of which 3 ms to minimize.
[2024-05-28 13:53:52] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-05-28 13:53:53] [INFO ] Deduced a trap composed of 65 places in 113 ms of which 1 ms to minimize.
[2024-05-28 13:53:54] [INFO ] Deduced a trap composed of 314 places in 296 ms of which 4 ms to minimize.
[2024-05-28 13:53:54] [INFO ] Deduced a trap composed of 334 places in 273 ms of which 4 ms to minimize.
[2024-05-28 13:53:54] [INFO ] Deduced a trap composed of 351 places in 255 ms of which 4 ms to minimize.
[2024-05-28 13:53:54] [INFO ] Deduced a trap composed of 338 places in 241 ms of which 4 ms to minimize.
[2024-05-28 13:53:55] [INFO ] Deduced a trap composed of 307 places in 262 ms of which 5 ms to minimize.
[2024-05-28 13:53:55] [INFO ] Deduced a trap composed of 324 places in 198 ms of which 3 ms to minimize.
[2024-05-28 13:53:55] [INFO ] Deduced a trap composed of 42 places in 196 ms of which 3 ms to minimize.
[2024-05-28 13:53:55] [INFO ] Deduced a trap composed of 307 places in 203 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
[2024-05-28 13:53:56] [INFO ] Deduced a trap composed of 283 places in 275 ms of which 4 ms to minimize.
[2024-05-28 13:53:57] [INFO ] Deduced a trap composed of 353 places in 239 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 2/60 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 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:54:25] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:54:36] [INFO ] Deduced a trap composed of 299 places in 316 ms of which 5 ms to minimize.
[2024-05-28 13:54:36] [INFO ] Deduced a trap composed of 397 places in 270 ms of which 4 ms to minimize.
[2024-05-28 13:54:36] [INFO ] Deduced a trap composed of 408 places in 244 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10)
(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 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(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 0)
(s59 0)
(s60 0)
(s61 0)
(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 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(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 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 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 10)
(s163 1)
(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 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 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 1)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(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 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 1)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(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 1)
(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 1)
(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 0)
(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 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(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 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 10)
(s388 0)
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 64 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 26/26 constraints]
After SMT, in 61256ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 61280ms
Finished structural reductions in LTL mode , in 1 iterations and 109749 ms. Remains : 588/588 places, 1098/1098 transitions.
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLFireability-05
Product exploration explored 100000 steps with 1767 reset in 360 ms.
Product exploration explored 100000 steps with 1771 reset in 367 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 124 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 91 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 194 steps (0 resets) in 5 ms. (32 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 135 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 88 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (NOT p1)]
[2024-05-28 13:54:45] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 13:54:45] [INFO ] Invariant cache hit.
[2024-05-28 13:54:45] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-28 13:54:45] [INFO ] [Real]Absence check using 11 positive and 29 generalized place invariants in 118 ms returned sat
[2024-05-28 13:54:47] [INFO ] [Real]Absence check using state equation in 1856 ms returned sat
[2024-05-28 13:54:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:54:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-28 13:54:48] [INFO ] [Nat]Absence check using 11 positive and 29 generalized place invariants in 244 ms returned sat
[2024-05-28 13:54:52] [INFO ] [Nat]Absence check using state equation in 3494 ms returned sat
[2024-05-28 13:54:52] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 13:54:52] [INFO ] [Nat]Added 96 Read/Feed constraints in 656 ms returned sat
[2024-05-28 13:54:53] [INFO ] Deduced a trap composed of 64 places in 170 ms of which 2 ms to minimize.
[2024-05-28 13:54:53] [INFO ] Deduced a trap composed of 64 places in 132 ms of which 2 ms to minimize.
[2024-05-28 13:54:53] [INFO ] Deduced a trap composed of 64 places in 122 ms of which 2 ms to minimize.
[2024-05-28 13:54:55] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 2 ms to minimize.
[2024-05-28 13:54:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3021 ms
[2024-05-28 13:54:55] [INFO ] Computed and/alt/rep : 712/2573/704 causal constraints (skipped 376 transitions) in 83 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-28 13:55:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
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 0 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 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 328 place count 420 transition count 930
Iterating global reduction 3 with 8 rules applied. Total rules applied 336 place count 420 transition count 930
Applied a total of 336 rules in 86 ms. Remains 420 /588 variables (removed 168) and now considering 930/1098 (removed 168) transitions.
Running 928 sub problems to find dead transitions.
[2024-05-28 13:55:02] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
// Phase 1: matrix 914 rows 420 cols
[2024-05-28 13:55:03] [INFO ] Computed 40 invariants in 20 ms
[2024-05-28 13:55:03] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-05-28 13:55:10] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 1 ms to minimize.
[2024-05-28 13:55:10] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 0 ms to minimize.
[2024-05-28 13:55:10] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 1 ms to minimize.
[2024-05-28 13:55:10] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-05-28 13:55:10] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 1 ms to minimize.
[2024-05-28 13:55:10] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
[2024-05-28 13:55:10] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-05-28 13:55:11] [INFO ] Deduced a trap composed of 195 places in 271 ms of which 3 ms to minimize.
[2024-05-28 13:55:11] [INFO ] Deduced a trap composed of 156 places in 214 ms of which 3 ms to minimize.
[2024-05-28 13:55:11] [INFO ] Deduced a trap composed of 213 places in 264 ms of which 3 ms to minimize.
[2024-05-28 13:55:11] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 1 ms to minimize.
[2024-05-28 13:55:16] [INFO ] Deduced a trap composed of 79 places in 140 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-05-28 13:55:24] [INFO ] Deduced a trap composed of 158 places in 223 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 418/1334 variables, and 51 constraints, problems are : Problem set: 0 solved, 928 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 928/928 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 13/51 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-05-28 13:55:26] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 2 ms to minimize.
[2024-05-28 13:55:29] [INFO ] Deduced a trap composed of 179 places in 245 ms of which 3 ms to minimize.
[2024-05-28 13:55:29] [INFO ] Deduced a trap composed of 168 places in 158 ms of which 2 ms to minimize.
[2024-05-28 13:55:36] [INFO ] Deduced a trap composed of 142 places in 204 ms of which 3 ms to minimize.
[2024-05-28 13:55:37] [INFO ] Deduced a trap composed of 177 places in 203 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-05-28 13:55:42] [INFO ] Deduced a trap composed of 260 places in 205 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/1334 variables, and 57 constraints, problems are : Problem set: 0 solved, 928 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/928 constraints, Known Traps: 19/19 constraints]
After SMT, in 41518ms problems are : Problem set: 0 solved, 928 unsolved
Search for dead transitions found 0 dead transitions in 41534ms
[2024-05-28 13:55:44] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-05-28 13:55:44] [INFO ] Invariant cache hit.
[2024-05-28 13:55:44] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-05-28 13:55:44] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-05-28 13:55:44] [INFO ] Invariant cache hit.
[2024-05-28 13:55:45] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 13:55:48] [INFO ] Implicit Places using invariants and state equation in 3880 ms returned []
Implicit Place search using SMT with State Equation took 4186 ms to find 0 implicit places.
[2024-05-28 13:55:48] [INFO ] Redundant transitions in 5 ms returned []
Running 928 sub problems to find dead transitions.
[2024-05-28 13:55:48] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-05-28 13:55:48] [INFO ] Invariant cache hit.
[2024-05-28 13:55:48] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-05-28 13:55:54] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2024-05-28 13:55:54] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 0 ms to minimize.
[2024-05-28 13:55:54] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-05-28 13:55:54] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-05-28 13:55:55] [INFO ] Deduced a trap composed of 43 places in 28 ms of which 1 ms to minimize.
[2024-05-28 13:55:55] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-05-28 13:55:55] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-05-28 13:55:55] [INFO ] Deduced a trap composed of 172 places in 154 ms of which 2 ms to minimize.
[2024-05-28 13:55:55] [INFO ] Deduced a trap composed of 156 places in 205 ms of which 3 ms to minimize.
[2024-05-28 13:55:56] [INFO ] Deduced a trap composed of 43 places in 30 ms of which 0 ms to minimize.
[2024-05-28 13:55:59] [INFO ] Deduced a trap composed of 158 places in 191 ms of which 3 ms to minimize.
[2024-05-28 13:56:03] [INFO ] Deduced a trap composed of 137 places in 237 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 928 unsolved
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/419 variables, 1/51 constraints. Problems are: Problem set: 48 solved, 880 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 419/1334 variables, and 51 constraints, problems are : Problem set: 48 solved, 880 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 928/928 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 48 solved, 880 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 48 solved, 880 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 48 solved, 880 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 12/50 constraints. Problems are: Problem set: 48 solved, 880 unsolved
[2024-05-28 13:56:21] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 2 ms to minimize.
[2024-05-28 13:56:25] [INFO ] Deduced a trap composed of 171 places in 145 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 2/52 constraints. Problems are: Problem set: 48 solved, 880 unsolved
[2024-05-28 13:56:31] [INFO ] Deduced a trap composed of 270 places in 183 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 1/53 constraints. Problems are: Problem set: 48 solved, 880 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 0/53 constraints. Problems are: Problem set: 48 solved, 880 unsolved
At refinement iteration 6 (OVERLAPS) 1/419 variables, 1/54 constraints. Problems are: Problem set: 48 solved, 880 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 419/1334 variables, and 54 constraints, problems are : Problem set: 48 solved, 880 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/928 constraints, Known Traps: 15/15 constraints]
After SMT, in 61146ms problems are : Problem set: 48 solved, 880 unsolved
Search for dead transitions found 48 dead transitions in 61156ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 420/588 places, 882/1098 transitions.
Applied a total of 0 rules in 11 ms. Remains 420 /420 variables (removed 0) and now considering 882/882 (removed 0) transitions.
[2024-05-28 13:56:49] [INFO ] Redundant transitions in 5 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 107010 ms. Remains : 420/588 places, 882/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 83 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 58 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 169 steps (0 resets) in 5 ms. (28 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 70 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p1), (NOT p1)]
[2024-05-28 13:56:50] [INFO ] Flow matrix only has 866 transitions (discarded 16 similar events)
// Phase 1: matrix 866 rows 420 cols
[2024-05-28 13:56:50] [INFO ] Computed 40 invariants in 8 ms
[2024-05-28 13:56:50] [INFO ] [Real]Absence check using 14 positive place invariants in 26 ms returned sat
[2024-05-28 13:56:50] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 63 ms returned sat
[2024-05-28 13:56:51] [INFO ] [Real]Absence check using state equation in 549 ms returned sat
[2024-05-28 13:56:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 13:56:51] [INFO ] [Nat]Absence check using 14 positive place invariants in 31 ms returned sat
[2024-05-28 13:56:51] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 38 ms returned sat
[2024-05-28 13:56:53] [INFO ] [Nat]Absence check using state equation in 1391 ms returned sat
[2024-05-28 13:56:53] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 13:56:53] [INFO ] [Nat]Added 96 Read/Feed constraints in 387 ms returned sat
[2024-05-28 13:56:53] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
[2024-05-28 13:56:53] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 1 ms to minimize.
[2024-05-28 13:56:53] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 1 ms to minimize.
[2024-05-28 13:56:55] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 1 ms to minimize.
[2024-05-28 13:56:55] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 1 ms to minimize.
[2024-05-28 13:56:55] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 2 ms to minimize.
[2024-05-28 13:56:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2294 ms
[2024-05-28 13:56:55] [INFO ] Computed and/alt/rep : 424/1653/416 causal constraints (skipped 448 transitions) in 76 ms.
[2024-05-28 13:56:59] [INFO ] Added : 223 causal constraints over 45 iterations in 3438 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2505 reset in 401 ms.
Product exploration explored 100000 steps with 2504 reset in 422 ms.
Built C files in :
/tmp/ltsmin8213540580822992757
[2024-05-28 13:57:00] [INFO ] Computing symmetric may disable matrix : 882 transitions.
[2024-05-28 13:57:00] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:57:00] [INFO ] Computing symmetric may enable matrix : 882 transitions.
[2024-05-28 13:57:00] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:57:00] [INFO ] Computing Do-Not-Accords matrix : 882 transitions.
[2024-05-28 13:57:00] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:57:00] [INFO ] Built C files in 178ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8213540580822992757
Running compilation step : cd /tmp/ltsmin8213540580822992757;'/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/ltsmin8213540580822992757;'/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/ltsmin8213540580822992757;'/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 420 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 420/420 places, 882/882 transitions.
Applied a total of 0 rules in 18 ms. Remains 420 /420 variables (removed 0) and now considering 882/882 (removed 0) transitions.
Running 880 sub problems to find dead transitions.
[2024-05-28 13:57:03] [INFO ] Flow matrix only has 866 transitions (discarded 16 similar events)
[2024-05-28 13:57:03] [INFO ] Invariant cache hit.
[2024-05-28 13:57:03] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 880 unsolved
[2024-05-28 13:57:10] [INFO ] Deduced a trap composed of 166 places in 143 ms of which 2 ms to minimize.
[2024-05-28 13:57:10] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
[2024-05-28 13:57:10] [INFO ] Deduced a trap composed of 43 places in 24 ms of which 1 ms to minimize.
[2024-05-28 13:57:10] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2024-05-28 13:57:10] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 0 ms to minimize.
[2024-05-28 13:57:10] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 0 ms to minimize.
[2024-05-28 13:57:10] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 1 ms to minimize.
[2024-05-28 13:57:10] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 1 ms to minimize.
[2024-05-28 13:57:10] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 0 ms to minimize.
[2024-05-28 13:57:11] [INFO ] Deduced a trap composed of 263 places in 161 ms of which 2 ms to minimize.
[2024-05-28 13:57:12] [INFO ] Deduced a trap composed of 132 places in 148 ms of which 3 ms to minimize.
[2024-05-28 13:57:13] [INFO ] Deduced a trap composed of 158 places in 162 ms of which 2 ms to minimize.
[2024-05-28 13:57:16] [INFO ] Deduced a trap composed of 136 places in 160 ms of which 2 ms to minimize.
[2024-05-28 13:57:16] [INFO ] Deduced a trap composed of 202 places in 157 ms of which 2 ms to minimize.
[2024-05-28 13:57:17] [INFO ] Deduced a trap composed of 169 places in 175 ms of which 2 ms to minimize.
[2024-05-28 13:57:17] [INFO ] Deduced a trap composed of 199 places in 163 ms of which 5 ms to minimize.
[2024-05-28 13:57:17] [INFO ] Deduced a trap composed of 179 places in 171 ms of which 2 ms to minimize.
[2024-05-28 13:57:17] [INFO ] Deduced a trap composed of 149 places in 161 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 880 unsolved
[2024-05-28 13:57:23] [INFO ] Deduced a trap composed of 211 places in 175 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1286 variables, and 57 constraints, problems are : Problem set: 0 solved, 880 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 880/880 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 880 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 19/57 constraints. Problems are: Problem set: 0 solved, 880 unsolved
[2024-05-28 13:57:26] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-05-28 13:57:26] [INFO ] Deduced a trap composed of 168 places in 151 ms of which 2 ms to minimize.
[2024-05-28 13:57:27] [INFO ] Deduced a trap composed of 167 places in 156 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 880 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/1286 variables, and 60 constraints, problems are : Problem set: 0 solved, 880 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/880 constraints, Known Traps: 22/22 constraints]
After SMT, in 41198ms problems are : Problem set: 0 solved, 880 unsolved
Search for dead transitions found 0 dead transitions in 41209ms
[2024-05-28 13:57:44] [INFO ] Flow matrix only has 866 transitions (discarded 16 similar events)
[2024-05-28 13:57:44] [INFO ] Invariant cache hit.
[2024-05-28 13:57:44] [INFO ] Implicit Places using invariants in 329 ms returned []
[2024-05-28 13:57:44] [INFO ] Flow matrix only has 866 transitions (discarded 16 similar events)
[2024-05-28 13:57:44] [INFO ] Invariant cache hit.
[2024-05-28 13:57:45] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 13:57:50] [INFO ] Implicit Places using invariants and state equation in 5272 ms returned []
Implicit Place search using SMT with State Equation took 5621 ms to find 0 implicit places.
[2024-05-28 13:57:50] [INFO ] Redundant transitions in 16 ms returned []
Running 880 sub problems to find dead transitions.
[2024-05-28 13:57:50] [INFO ] Flow matrix only has 866 transitions (discarded 16 similar events)
[2024-05-28 13:57:50] [INFO ] Invariant cache hit.
[2024-05-28 13:57:50] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 880 unsolved
[2024-05-28 13:57:57] [INFO ] Deduced a trap composed of 166 places in 203 ms of which 3 ms to minimize.
[2024-05-28 13:57:57] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2024-05-28 13:57:57] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-05-28 13:57:57] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-05-28 13:57:58] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 1 ms to minimize.
[2024-05-28 13:57:58] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 0 ms to minimize.
[2024-05-28 13:57:58] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 1 ms to minimize.
[2024-05-28 13:57:58] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 1 ms to minimize.
[2024-05-28 13:57:58] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-05-28 13:57:59] [INFO ] Deduced a trap composed of 263 places in 224 ms of which 3 ms to minimize.
[2024-05-28 13:58:00] [INFO ] Deduced a trap composed of 132 places in 236 ms of which 3 ms to minimize.
[2024-05-28 13:58:01] [INFO ] Deduced a trap composed of 158 places in 215 ms of which 3 ms to minimize.
[2024-05-28 13:58:05] [INFO ] Deduced a trap composed of 136 places in 216 ms of which 3 ms to minimize.
[2024-05-28 13:58:05] [INFO ] Deduced a trap composed of 202 places in 231 ms of which 3 ms to minimize.
[2024-05-28 13:58:06] [INFO ] Deduced a trap composed of 169 places in 209 ms of which 3 ms to minimize.
[2024-05-28 13:58:06] [INFO ] Deduced a trap composed of 199 places in 217 ms of which 3 ms to minimize.
[2024-05-28 13:58:06] [INFO ] Deduced a trap composed of 179 places in 198 ms of which 3 ms to minimize.
[2024-05-28 13:58:07] [INFO ] Deduced a trap composed of 149 places in 212 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 880 unsolved
[2024-05-28 13:58:13] [INFO ] Deduced a trap composed of 211 places in 222 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 880 unsolved
[2024-05-28 13:58:20] [INFO ] Deduced a trap composed of 165 places in 216 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1286 variables, and 58 constraints, problems are : Problem set: 0 solved, 880 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 880/880 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 880 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 880 unsolved
[2024-05-28 13:58:22] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 3 ms to minimize.
[2024-05-28 13:58:23] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 2 ms to minimize.
[2024-05-28 13:58:23] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 3 ms to minimize.
[2024-05-28 13:58:23] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 2 ms to minimize.
[2024-05-28 13:58:27] [INFO ] Deduced a trap composed of 177 places in 201 ms of which 3 ms to minimize.
[2024-05-28 13:58:31] [INFO ] Deduced a trap composed of 144 places in 162 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 880 unsolved
[2024-05-28 13:58:47] [INFO ] Deduced a trap composed of 156 places in 254 ms of which 3 ms to minimize.
[2024-05-28 13:58:47] [INFO ] Deduced a trap composed of 184 places in 183 ms of which 2 ms to minimize.
[2024-05-28 13:58:48] [INFO ] Deduced a trap composed of 181 places in 181 ms of which 2 ms to minimize.
[2024-05-28 13:58:48] [INFO ] Deduced a trap composed of 186 places in 187 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/1286 variables, and 68 constraints, problems are : Problem set: 0 solved, 880 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/880 constraints, Known Traps: 30/30 constraints]
After SMT, in 61375ms problems are : Problem set: 0 solved, 880 unsolved
Search for dead transitions found 0 dead transitions in 61394ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 108273 ms. Remains : 420/420 places, 882/882 transitions.
Built C files in :
/tmp/ltsmin9398465444737292903
[2024-05-28 13:58:51] [INFO ] Computing symmetric may disable matrix : 882 transitions.
[2024-05-28 13:58:51] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:58:51] [INFO ] Computing symmetric may enable matrix : 882 transitions.
[2024-05-28 13:58:51] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:58:51] [INFO ] Computing Do-Not-Accords matrix : 882 transitions.
[2024-05-28 13:58:51] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:58:51] [INFO ] Built C files in 186ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9398465444737292903
Running compilation step : cd /tmp/ltsmin9398465444737292903;'/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 2991 ms.
Running link step : cd /tmp/ltsmin9398465444737292903;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 87 ms.
Running LTSmin : cd /tmp/ltsmin9398465444737292903;'/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/stateBased4469775693670195613.hoa' '--buchi-type=spotba'
LTSmin run took 8679 ms.
FORMULA PolyORBLF-COL-S02J04T08-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBLF-COL-S02J04T08-LTLFireability-05 finished in 369741 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 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 1098/1098 transitions.
Applied a total of 0 rules in 8 ms. Remains 588 /588 variables (removed 0) and now considering 1098/1098 (removed 0) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-28 13:59:03] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 588 cols
[2024-05-28 13:59:03] [INFO ] Computed 40 invariants in 27 ms
[2024-05-28 13:59:03] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:59:13] [INFO ] Deduced a trap composed of 64 places in 111 ms of which 2 ms to minimize.
[2024-05-28 13:59:13] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 1 ms to minimize.
[2024-05-28 13:59:13] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 2 ms to minimize.
[2024-05-28 13:59:13] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
[2024-05-28 13:59:13] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-05-28 13:59:13] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 2 ms to minimize.
[2024-05-28 13:59:13] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2024-05-28 13:59:14] [INFO ] Deduced a trap composed of 325 places in 285 ms of which 4 ms to minimize.
[2024-05-28 13:59:14] [INFO ] Deduced a trap composed of 165 places in 242 ms of which 4 ms to minimize.
[2024-05-28 13:59:14] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2024-05-28 13:59:16] [INFO ] Deduced a trap composed of 346 places in 251 ms of which 4 ms to minimize.
[2024-05-28 13:59:16] [INFO ] Deduced a trap composed of 308 places in 260 ms of which 4 ms to minimize.
[2024-05-28 13:59:16] [INFO ] Deduced a trap composed of 307 places in 240 ms of which 4 ms to minimize.
[2024-05-28 13:59:16] [INFO ] Deduced a trap composed of 313 places in 198 ms of which 3 ms to minimize.
[2024-05-28 13:59:17] [INFO ] Deduced a trap composed of 299 places in 215 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 53 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 13:59:26] [INFO ] Deduced a trap composed of 353 places in 187 ms of which 3 ms to minimize.
[2024-05-28 13:59:27] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 2 ms to minimize.
[2024-05-28 13:59:27] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 2 ms to minimize.
[2024-05-28 13:59:32] [INFO ] Deduced a trap composed of 324 places in 208 ms of which 3 ms to minimize.
[2024-05-28 13:59:32] [INFO ] Deduced a trap composed of 311 places in 298 ms of which 3 ms to minimize.
[2024-05-28 13:59:37] [INFO ] Deduced a trap composed of 313 places in 289 ms of which 4 ms to minimize.
[2024-05-28 13:59:38] [INFO ] Deduced a trap composed of 47 places in 209 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 7/60 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 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 22/22 constraints]
After SMT, in 41640ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41658ms
[2024-05-28 13:59:45] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 13:59:45] [INFO ] Invariant cache hit.
[2024-05-28 13:59:45] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-05-28 13:59:45] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 13:59:45] [INFO ] Invariant cache hit.
[2024-05-28 13:59:46] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 13:59:54] [INFO ] Implicit Places using invariants and state equation in 8404 ms returned []
Implicit Place search using SMT with State Equation took 8711 ms to find 0 implicit places.
Running 1096 sub problems to find dead transitions.
[2024-05-28 13:59:54] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 13:59:54] [INFO ] Invariant cache hit.
[2024-05-28 13:59:54] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 14:00:03] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:00:03] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 0 ms to minimize.
[2024-05-28 14:00:03] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 0 ms to minimize.
[2024-05-28 14:00:03] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
[2024-05-28 14:00:03] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:00:03] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-05-28 14:00:03] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 1 ms to minimize.
[2024-05-28 14:00:04] [INFO ] Deduced a trap composed of 334 places in 288 ms of which 4 ms to minimize.
[2024-05-28 14:00:04] [INFO ] Deduced a trap composed of 339 places in 205 ms of which 3 ms to minimize.
[2024-05-28 14:00:04] [INFO ] Deduced a trap composed of 183 places in 168 ms of which 3 ms to minimize.
[2024-05-28 14:00:04] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
[2024-05-28 14:00:05] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 2 ms to minimize.
[2024-05-28 14:00:05] [INFO ] Deduced a trap composed of 314 places in 205 ms of which 3 ms to minimize.
[2024-05-28 14:00:05] [INFO ] Deduced a trap composed of 334 places in 192 ms of which 3 ms to minimize.
[2024-05-28 14:00:06] [INFO ] Deduced a trap composed of 351 places in 206 ms of which 3 ms to minimize.
[2024-05-28 14:00:06] [INFO ] Deduced a trap composed of 338 places in 231 ms of which 2 ms to minimize.
[2024-05-28 14:00:06] [INFO ] Deduced a trap composed of 307 places in 298 ms of which 4 ms to minimize.
[2024-05-28 14:00:06] [INFO ] Deduced a trap composed of 324 places in 215 ms of which 3 ms to minimize.
[2024-05-28 14:00:07] [INFO ] Deduced a trap composed of 42 places in 245 ms of which 4 ms to minimize.
[2024-05-28 14:00:07] [INFO ] Deduced a trap composed of 307 places in 194 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
[2024-05-28 14:00:08] [INFO ] Deduced a trap composed of 283 places in 280 ms of which 4 ms to minimize.
[2024-05-28 14:00:08] [INFO ] Deduced a trap composed of 353 places in 200 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 2/60 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 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 14:00:35] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 14:00:45] [INFO ] Deduced a trap composed of 299 places in 200 ms of which 3 ms to minimize.
[2024-05-28 14:00:45] [INFO ] Deduced a trap composed of 397 places in 204 ms of which 3 ms to minimize.
[2024-05-28 14:00:45] [INFO ] Deduced a trap composed of 408 places in 183 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/586 variables, 3/64 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 64 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 26/26 constraints]
After SMT, in 61476ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 61500ms
Finished structural reductions in LTL mode , in 1 iterations and 111888 ms. Remains : 588/588 places, 1098/1098 transitions.
Stuttering acceptance computed with spot in 348 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-COL-S02J04T08-LTLFireability-07
Entered a terminal (fully accepting) state of product in 152 steps with 4 reset in 1 ms.
FORMULA PolyORBLF-COL-S02J04T08-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T08-LTLFireability-07 finished in 112266 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)&&F(G((G(p0) U X(!p1)))))))'
Support contains 22 out of 588 places. Attempting structural reductions.
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 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 328 place count 420 transition count 930
Iterating global reduction 3 with 8 rules applied. Total rules applied 336 place count 420 transition count 930
Applied a total of 336 rules in 76 ms. Remains 420 /588 variables (removed 168) and now considering 930/1098 (removed 168) transitions.
Running 928 sub problems to find dead transitions.
[2024-05-28 14:00:56] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
// Phase 1: matrix 914 rows 420 cols
[2024-05-28 14:00:56] [INFO ] Computed 40 invariants in 20 ms
[2024-05-28 14:00:56] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-05-28 14:01:03] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 2 ms to minimize.
[2024-05-28 14:01:03] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-05-28 14:01:03] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-05-28 14:01:03] [INFO ] Deduced a trap composed of 43 places in 28 ms of which 1 ms to minimize.
[2024-05-28 14:01:03] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 2 ms to minimize.
[2024-05-28 14:01:03] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 0 ms to minimize.
[2024-05-28 14:01:03] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 1 ms to minimize.
[2024-05-28 14:01:04] [INFO ] Deduced a trap composed of 195 places in 226 ms of which 4 ms to minimize.
[2024-05-28 14:01:04] [INFO ] Deduced a trap composed of 156 places in 215 ms of which 3 ms to minimize.
[2024-05-28 14:01:04] [INFO ] Deduced a trap composed of 213 places in 210 ms of which 3 ms to minimize.
[2024-05-28 14:01:04] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:01:09] [INFO ] Deduced a trap composed of 79 places in 105 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-05-28 14:01:17] [INFO ] Deduced a trap composed of 158 places in 226 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1334 variables, and 51 constraints, problems are : Problem set: 0 solved, 928 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 928/928 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 13/51 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-05-28 14:01:20] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 2 ms to minimize.
[2024-05-28 14:01:23] [INFO ] Deduced a trap composed of 179 places in 227 ms of which 3 ms to minimize.
[2024-05-28 14:01:23] [INFO ] Deduced a trap composed of 168 places in 198 ms of which 3 ms to minimize.
[2024-05-28 14:01:30] [INFO ] Deduced a trap composed of 142 places in 239 ms of which 3 ms to minimize.
[2024-05-28 14:01:31] [INFO ] Deduced a trap composed of 177 places in 228 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-05-28 14:01:36] [INFO ] Deduced a trap composed of 260 places in 218 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/1334 variables, and 57 constraints, problems are : Problem set: 0 solved, 928 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/928 constraints, Known Traps: 19/19 constraints]
After SMT, in 41551ms problems are : Problem set: 0 solved, 928 unsolved
Search for dead transitions found 0 dead transitions in 41568ms
[2024-05-28 14:01:37] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-05-28 14:01:37] [INFO ] Invariant cache hit.
[2024-05-28 14:01:37] [INFO ] Implicit Places using invariants in 393 ms returned []
[2024-05-28 14:01:37] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-05-28 14:01:37] [INFO ] Invariant cache hit.
[2024-05-28 14:01:38] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:01:42] [INFO ] Implicit Places using invariants and state equation in 4394 ms returned []
Implicit Place search using SMT with State Equation took 4804 ms to find 0 implicit places.
[2024-05-28 14:01:42] [INFO ] Redundant transitions in 13 ms returned []
Running 928 sub problems to find dead transitions.
[2024-05-28 14:01:42] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-05-28 14:01:42] [INFO ] Invariant cache hit.
[2024-05-28 14:01:42] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-05-28 14:01:48] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:01:48] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 1 ms to minimize.
[2024-05-28 14:01:48] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
[2024-05-28 14:01:48] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 1 ms to minimize.
[2024-05-28 14:01:48] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 1 ms to minimize.
[2024-05-28 14:01:48] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 1 ms to minimize.
[2024-05-28 14:01:49] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 0 ms to minimize.
[2024-05-28 14:01:49] [INFO ] Deduced a trap composed of 172 places in 310 ms of which 3 ms to minimize.
[2024-05-28 14:01:49] [INFO ] Deduced a trap composed of 156 places in 280 ms of which 3 ms to minimize.
[2024-05-28 14:01:50] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-05-28 14:01:54] [INFO ] Deduced a trap composed of 158 places in 211 ms of which 3 ms to minimize.
[2024-05-28 14:01:58] [INFO ] Deduced a trap composed of 137 places in 252 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 928 unsolved
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/419 variables, 1/51 constraints. Problems are: Problem set: 48 solved, 880 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 419/1334 variables, and 51 constraints, problems are : Problem set: 48 solved, 880 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 928/928 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 48 solved, 880 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 48 solved, 880 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 48 solved, 880 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 12/50 constraints. Problems are: Problem set: 48 solved, 880 unsolved
[2024-05-28 14:02:15] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 2 ms to minimize.
[2024-05-28 14:02:19] [INFO ] Deduced a trap composed of 171 places in 117 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 2/52 constraints. Problems are: Problem set: 48 solved, 880 unsolved
[2024-05-28 14:02:26] [INFO ] Deduced a trap composed of 270 places in 208 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 1/53 constraints. Problems are: Problem set: 48 solved, 880 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 0/53 constraints. Problems are: Problem set: 48 solved, 880 unsolved
At refinement iteration 6 (OVERLAPS) 1/419 variables, 1/54 constraints. Problems are: Problem set: 48 solved, 880 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 419/1334 variables, and 54 constraints, problems are : Problem set: 48 solved, 880 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/928 constraints, Known Traps: 15/15 constraints]
After SMT, in 61345ms problems are : Problem set: 48 solved, 880 unsolved
Search for dead transitions found 48 dead transitions in 61359ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 420/588 places, 882/1098 transitions.
Applied a total of 0 rules in 14 ms. Remains 420 /420 variables (removed 0) and now considering 882/882 (removed 0) transitions.
[2024-05-28 14:02:43] [INFO ] Redundant transitions in 7 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 107863 ms. Remains : 420/588 places, 882/1098 transitions.
Stuttering acceptance computed with spot in 384 ms :[(OR p1 p0), p0, p1, p1, (AND (NOT p0) p1), p1, false]
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLFireability-08
Product exploration explored 100000 steps with 28494 reset in 407 ms.
Product exploration explored 100000 steps with 28596 reset in 332 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 210 ms. Reduced automaton from 7 states, 26 edges and 2 AP (stutter insensitive) to 8 states, 29 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 397 ms :[(OR p0 p1), p0, p1, p1, (AND (NOT p0) p1), p1, false, false]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (12 resets) in 353 ms. (112 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 770 ms. (51 steps per ms) remains 1/1 properties
[2024-05-28 14:02:45] [INFO ] Flow matrix only has 866 transitions (discarded 16 similar events)
// Phase 1: matrix 866 rows 420 cols
[2024-05-28 14:02:45] [INFO ] Computed 40 invariants in 21 ms
[2024-05-28 14:02:45] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/63 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 158/221 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 23/244 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 416/1286 variables, and 36 constraints, problems are : Problem set: 1 solved, 0 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 213ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F p1), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 12 factoid took 382 ms. Reduced automaton from 8 states, 29 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 209 ms :[(OR p0 p1), p0, p1, p1]
Stuttering acceptance computed with spot in 212 ms :[(OR p0 p1), p0, p1, p1]
Support contains 22 out of 420 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 420/420 places, 882/882 transitions.
Applied a total of 0 rules in 16 ms. Remains 420 /420 variables (removed 0) and now considering 882/882 (removed 0) transitions.
Running 880 sub problems to find dead transitions.
[2024-05-28 14:02:46] [INFO ] Flow matrix only has 866 transitions (discarded 16 similar events)
[2024-05-28 14:02:46] [INFO ] Invariant cache hit.
[2024-05-28 14:02:46] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 880 unsolved
[2024-05-28 14:02:54] [INFO ] Deduced a trap composed of 166 places in 188 ms of which 3 ms to minimize.
[2024-05-28 14:02:54] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:02:54] [INFO ] Deduced a trap composed of 43 places in 29 ms of which 2 ms to minimize.
[2024-05-28 14:02:54] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-05-28 14:02:55] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 1 ms to minimize.
[2024-05-28 14:02:55] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2024-05-28 14:02:55] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 1 ms to minimize.
[2024-05-28 14:02:55] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2024-05-28 14:02:55] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 0 ms to minimize.
[2024-05-28 14:02:56] [INFO ] Deduced a trap composed of 263 places in 241 ms of which 3 ms to minimize.
[2024-05-28 14:02:57] [INFO ] Deduced a trap composed of 132 places in 246 ms of which 4 ms to minimize.
[2024-05-28 14:02:59] [INFO ] Deduced a trap composed of 158 places in 210 ms of which 3 ms to minimize.
[2024-05-28 14:03:03] [INFO ] Deduced a trap composed of 136 places in 227 ms of which 4 ms to minimize.
[2024-05-28 14:03:03] [INFO ] Deduced a trap composed of 202 places in 241 ms of which 3 ms to minimize.
[2024-05-28 14:03:03] [INFO ] Deduced a trap composed of 169 places in 139 ms of which 2 ms to minimize.
[2024-05-28 14:03:03] [INFO ] Deduced a trap composed of 199 places in 160 ms of which 2 ms to minimize.
[2024-05-28 14:03:04] [INFO ] Deduced a trap composed of 179 places in 158 ms of which 2 ms to minimize.
[2024-05-28 14:03:04] [INFO ] Deduced a trap composed of 149 places in 190 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 880 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1286 variables, and 56 constraints, problems are : Problem set: 0 solved, 880 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 880/880 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 880 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 880 unsolved
[2024-05-28 14:03:12] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 2 ms to minimize.
[2024-05-28 14:03:12] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 880 unsolved
[2024-05-28 14:03:27] [INFO ] Deduced a trap composed of 162 places in 229 ms of which 3 ms to minimize.
[2024-05-28 14:03:27] [INFO ] Deduced a trap composed of 161 places in 235 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/1286 variables, and 60 constraints, problems are : Problem set: 0 solved, 880 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/880 constraints, Known Traps: 22/22 constraints]
After SMT, in 41105ms problems are : Problem set: 0 solved, 880 unsolved
Search for dead transitions found 0 dead transitions in 41119ms
[2024-05-28 14:03:28] [INFO ] Flow matrix only has 866 transitions (discarded 16 similar events)
[2024-05-28 14:03:28] [INFO ] Invariant cache hit.
[2024-05-28 14:03:28] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-05-28 14:03:28] [INFO ] Flow matrix only has 866 transitions (discarded 16 similar events)
[2024-05-28 14:03:28] [INFO ] Invariant cache hit.
[2024-05-28 14:03:28] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:03:33] [INFO ] Implicit Places using invariants and state equation in 5087 ms returned []
Implicit Place search using SMT with State Equation took 5393 ms to find 0 implicit places.
[2024-05-28 14:03:33] [INFO ] Redundant transitions in 9 ms returned []
Running 880 sub problems to find dead transitions.
[2024-05-28 14:03:33] [INFO ] Flow matrix only has 866 transitions (discarded 16 similar events)
[2024-05-28 14:03:33] [INFO ] Invariant cache hit.
[2024-05-28 14:03:33] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 880 unsolved
[2024-05-28 14:03:41] [INFO ] Deduced a trap composed of 166 places in 200 ms of which 3 ms to minimize.
[2024-05-28 14:03:41] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:03:41] [INFO ] Deduced a trap composed of 43 places in 25 ms of which 0 ms to minimize.
[2024-05-28 14:03:41] [INFO ] Deduced a trap composed of 43 places in 25 ms of which 0 ms to minimize.
[2024-05-28 14:03:41] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 1 ms to minimize.
[2024-05-28 14:03:41] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-05-28 14:03:41] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 2 ms to minimize.
[2024-05-28 14:03:41] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 0 ms to minimize.
[2024-05-28 14:03:42] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2024-05-28 14:03:43] [INFO ] Deduced a trap composed of 263 places in 221 ms of which 3 ms to minimize.
[2024-05-28 14:03:44] [INFO ] Deduced a trap composed of 132 places in 223 ms of which 3 ms to minimize.
[2024-05-28 14:03:45] [INFO ] Deduced a trap composed of 158 places in 213 ms of which 3 ms to minimize.
[2024-05-28 14:03:49] [INFO ] Deduced a trap composed of 136 places in 226 ms of which 3 ms to minimize.
[2024-05-28 14:03:49] [INFO ] Deduced a trap composed of 202 places in 200 ms of which 3 ms to minimize.
[2024-05-28 14:03:50] [INFO ] Deduced a trap composed of 169 places in 241 ms of which 3 ms to minimize.
[2024-05-28 14:03:50] [INFO ] Deduced a trap composed of 199 places in 166 ms of which 2 ms to minimize.
[2024-05-28 14:03:50] [INFO ] Deduced a trap composed of 179 places in 175 ms of which 2 ms to minimize.
[2024-05-28 14:03:50] [INFO ] Deduced a trap composed of 149 places in 170 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 880 unsolved
[2024-05-28 14:03:56] [INFO ] Deduced a trap composed of 211 places in 196 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 880 unsolved
[2024-05-28 14:04:03] [INFO ] Deduced a trap composed of 165 places in 179 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1286 variables, and 58 constraints, problems are : Problem set: 0 solved, 880 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 880/880 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 880 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 880 unsolved
[2024-05-28 14:04:05] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 2 ms to minimize.
[2024-05-28 14:04:05] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 1 ms to minimize.
[2024-05-28 14:04:05] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
[2024-05-28 14:04:06] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 1 ms to minimize.
[2024-05-28 14:04:09] [INFO ] Deduced a trap composed of 177 places in 157 ms of which 2 ms to minimize.
[2024-05-28 14:04:13] [INFO ] Deduced a trap composed of 144 places in 197 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 880 unsolved
[2024-05-28 14:04:30] [INFO ] Deduced a trap composed of 156 places in 234 ms of which 4 ms to minimize.
[2024-05-28 14:04:30] [INFO ] Deduced a trap composed of 184 places in 212 ms of which 3 ms to minimize.
[2024-05-28 14:04:30] [INFO ] Deduced a trap composed of 181 places in 199 ms of which 3 ms to minimize.
[2024-05-28 14:04:30] [INFO ] Deduced a trap composed of 186 places in 189 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/1286 variables, and 68 constraints, problems are : Problem set: 0 solved, 880 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/880 constraints, Known Traps: 30/30 constraints]
After SMT, in 61057ms problems are : Problem set: 0 solved, 880 unsolved
Search for dead transitions found 0 dead transitions in 61069ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 107623 ms. Remains : 420/420 places, 882/882 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 116 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 173 ms :[(OR p0 p1), p0, p1, p1]
RANDOM walk for 162 steps (0 resets) in 17 ms. (9 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 5 factoid took 181 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 200 ms :[(OR p0 p1), p0, p1, p1]
Stuttering acceptance computed with spot in 162 ms :[(OR p0 p1), p0, p1, p1]
Stuttering acceptance computed with spot in 153 ms :[(OR p0 p1), p0, p1, p1]
Product exploration explored 100000 steps with 33484 reset in 498 ms.
Product exploration explored 100000 steps with 33373 reset in 474 ms.
Built C files in :
/tmp/ltsmin10936657865521337836
[2024-05-28 14:04:36] [INFO ] Computing symmetric may disable matrix : 882 transitions.
[2024-05-28 14:04:36] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:04:36] [INFO ] Computing symmetric may enable matrix : 882 transitions.
[2024-05-28 14:04:36] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:04:36] [INFO ] Computing Do-Not-Accords matrix : 882 transitions.
[2024-05-28 14:04:36] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:04:36] [INFO ] Built C files in 226ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10936657865521337836
Running compilation step : cd /tmp/ltsmin10936657865521337836;'/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/ltsmin10936657865521337836;'/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/ltsmin10936657865521337836;'/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 22 out of 420 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 420/420 places, 882/882 transitions.
Applied a total of 0 rules in 13 ms. Remains 420 /420 variables (removed 0) and now considering 882/882 (removed 0) transitions.
Running 880 sub problems to find dead transitions.
[2024-05-28 14:04:39] [INFO ] Flow matrix only has 866 transitions (discarded 16 similar events)
[2024-05-28 14:04:39] [INFO ] Invariant cache hit.
[2024-05-28 14:04:39] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 880 unsolved
[2024-05-28 14:04:47] [INFO ] Deduced a trap composed of 166 places in 199 ms of which 3 ms to minimize.
[2024-05-28 14:04:47] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 1 ms to minimize.
[2024-05-28 14:04:47] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-05-28 14:04:47] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-05-28 14:04:48] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 2 ms to minimize.
[2024-05-28 14:04:48] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-05-28 14:04:48] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 2 ms to minimize.
[2024-05-28 14:04:48] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:04:48] [INFO ] Deduced a trap composed of 43 places in 33 ms of which 1 ms to minimize.
[2024-05-28 14:04:49] [INFO ] Deduced a trap composed of 263 places in 193 ms of which 3 ms to minimize.
[2024-05-28 14:04:50] [INFO ] Deduced a trap composed of 132 places in 228 ms of which 3 ms to minimize.
[2024-05-28 14:04:51] [INFO ] Deduced a trap composed of 158 places in 210 ms of which 3 ms to minimize.
[2024-05-28 14:04:55] [INFO ] Deduced a trap composed of 136 places in 214 ms of which 3 ms to minimize.
[2024-05-28 14:04:55] [INFO ] Deduced a trap composed of 202 places in 195 ms of which 3 ms to minimize.
[2024-05-28 14:04:56] [INFO ] Deduced a trap composed of 169 places in 200 ms of which 2 ms to minimize.
[2024-05-28 14:04:56] [INFO ] Deduced a trap composed of 199 places in 160 ms of which 2 ms to minimize.
[2024-05-28 14:04:56] [INFO ] Deduced a trap composed of 179 places in 158 ms of which 2 ms to minimize.
[2024-05-28 14:04:56] [INFO ] Deduced a trap composed of 149 places in 201 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 880 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1286 variables, and 56 constraints, problems are : Problem set: 0 solved, 880 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 880/880 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 880 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 880 unsolved
[2024-05-28 14:05:04] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 2 ms to minimize.
[2024-05-28 14:05:05] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 880 unsolved
[2024-05-28 14:05:19] [INFO ] Deduced a trap composed of 162 places in 242 ms of which 4 ms to minimize.
[2024-05-28 14:05:20] [INFO ] Deduced a trap composed of 161 places in 216 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 880 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/1286 variables, and 60 constraints, problems are : Problem set: 0 solved, 880 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/880 constraints, Known Traps: 22/22 constraints]
After SMT, in 41225ms problems are : Problem set: 0 solved, 880 unsolved
Search for dead transitions found 0 dead transitions in 41237ms
[2024-05-28 14:05:21] [INFO ] Flow matrix only has 866 transitions (discarded 16 similar events)
[2024-05-28 14:05:21] [INFO ] Invariant cache hit.
[2024-05-28 14:05:21] [INFO ] Implicit Places using invariants in 375 ms returned []
[2024-05-28 14:05:21] [INFO ] Flow matrix only has 866 transitions (discarded 16 similar events)
[2024-05-28 14:05:21] [INFO ] Invariant cache hit.
[2024-05-28 14:05:21] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:05:26] [INFO ] Implicit Places using invariants and state equation in 4883 ms returned []
Implicit Place search using SMT with State Equation took 5263 ms to find 0 implicit places.
[2024-05-28 14:05:26] [INFO ] Redundant transitions in 12 ms returned []
Running 880 sub problems to find dead transitions.
[2024-05-28 14:05:26] [INFO ] Flow matrix only has 866 transitions (discarded 16 similar events)
[2024-05-28 14:05:26] [INFO ] Invariant cache hit.
[2024-05-28 14:05:26] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 880 unsolved
[2024-05-28 14:05:33] [INFO ] Deduced a trap composed of 166 places in 204 ms of which 3 ms to minimize.
[2024-05-28 14:05:33] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:05:34] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-05-28 14:05:34] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 0 ms to minimize.
[2024-05-28 14:05:34] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 1 ms to minimize.
[2024-05-28 14:05:34] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 0 ms to minimize.
[2024-05-28 14:05:34] [INFO ] Deduced a trap composed of 43 places in 99 ms of which 1 ms to minimize.
[2024-05-28 14:05:34] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 1 ms to minimize.
[2024-05-28 14:05:34] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 0 ms to minimize.
[2024-05-28 14:05:35] [INFO ] Deduced a trap composed of 263 places in 143 ms of which 2 ms to minimize.
[2024-05-28 14:05:36] [INFO ] Deduced a trap composed of 132 places in 142 ms of which 2 ms to minimize.
[2024-05-28 14:05:37] [INFO ] Deduced a trap composed of 158 places in 139 ms of which 2 ms to minimize.
[2024-05-28 14:05:40] [INFO ] Deduced a trap composed of 136 places in 215 ms of which 3 ms to minimize.
[2024-05-28 14:05:40] [INFO ] Deduced a trap composed of 202 places in 169 ms of which 2 ms to minimize.
[2024-05-28 14:05:40] [INFO ] Deduced a trap composed of 169 places in 136 ms of which 2 ms to minimize.
[2024-05-28 14:05:41] [INFO ] Deduced a trap composed of 199 places in 225 ms of which 3 ms to minimize.
[2024-05-28 14:05:41] [INFO ] Deduced a trap composed of 179 places in 143 ms of which 2 ms to minimize.
[2024-05-28 14:05:41] [INFO ] Deduced a trap composed of 149 places in 208 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 880 unsolved
[2024-05-28 14:05:48] [INFO ] Deduced a trap composed of 211 places in 260 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 880 unsolved
[2024-05-28 14:05:56] [INFO ] Deduced a trap composed of 165 places in 199 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1286 variables, and 58 constraints, problems are : Problem set: 0 solved, 880 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 880/880 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 880 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 880 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 880 unsolved
[2024-05-28 14:05:58] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 2 ms to minimize.
[2024-05-28 14:05:59] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 2 ms to minimize.
[2024-05-28 14:05:59] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 1 ms to minimize.
[2024-05-28 14:05:59] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2024-05-28 14:06:02] [INFO ] Deduced a trap composed of 177 places in 156 ms of which 2 ms to minimize.
[2024-05-28 14:06:06] [INFO ] Deduced a trap composed of 144 places in 141 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 880 unsolved
[2024-05-28 14:06:23] [INFO ] Deduced a trap composed of 156 places in 258 ms of which 3 ms to minimize.
[2024-05-28 14:06:23] [INFO ] Deduced a trap composed of 184 places in 208 ms of which 3 ms to minimize.
[2024-05-28 14:06:23] [INFO ] Deduced a trap composed of 181 places in 187 ms of which 2 ms to minimize.
[2024-05-28 14:06:23] [INFO ] Deduced a trap composed of 186 places in 190 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/1286 variables, and 68 constraints, problems are : Problem set: 0 solved, 880 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/880 constraints, Known Traps: 30/30 constraints]
After SMT, in 61273ms problems are : Problem set: 0 solved, 880 unsolved
Search for dead transitions found 0 dead transitions in 61290ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 107826 ms. Remains : 420/420 places, 882/882 transitions.
Built C files in :
/tmp/ltsmin17856990077504639029
[2024-05-28 14:06:27] [INFO ] Computing symmetric may disable matrix : 882 transitions.
[2024-05-28 14:06:27] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:06:27] [INFO ] Computing symmetric may enable matrix : 882 transitions.
[2024-05-28 14:06:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:06:27] [INFO ] Computing Do-Not-Accords matrix : 882 transitions.
[2024-05-28 14:06:27] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:06:27] [INFO ] Built C files in 134ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17856990077504639029
Running compilation step : cd /tmp/ltsmin17856990077504639029;'/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 2734 ms.
Running link step : cd /tmp/ltsmin17856990077504639029;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 94 ms.
Running LTSmin : cd /tmp/ltsmin17856990077504639029;'/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/stateBased12154121392884354542.hoa' '--buchi-type=spotba'
LTSmin run took 9311 ms.
FORMULA PolyORBLF-COL-S02J04T08-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBLF-COL-S02J04T08-LTLFireability-08 finished in 344105 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 8 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 1098/1098 transitions.
Applied a total of 0 rules in 9 ms. Remains 588 /588 variables (removed 0) and now considering 1098/1098 (removed 0) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-28 14:06:40] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 588 cols
[2024-05-28 14:06:40] [INFO ] Computed 40 invariants in 23 ms
[2024-05-28 14:06:40] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 14:06:48] [INFO ] Deduced a trap composed of 64 places in 112 ms of which 2 ms to minimize.
[2024-05-28 14:06:48] [INFO ] Deduced a trap composed of 64 places in 135 ms of which 3 ms to minimize.
[2024-05-28 14:06:48] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 1 ms to minimize.
[2024-05-28 14:06:48] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2024-05-28 14:06:48] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-05-28 14:06:48] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 2 ms to minimize.
[2024-05-28 14:06:49] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-05-28 14:06:49] [INFO ] Deduced a trap composed of 325 places in 306 ms of which 5 ms to minimize.
[2024-05-28 14:06:50] [INFO ] Deduced a trap composed of 165 places in 280 ms of which 4 ms to minimize.
[2024-05-28 14:06:50] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-05-28 14:06:51] [INFO ] Deduced a trap composed of 346 places in 295 ms of which 4 ms to minimize.
[2024-05-28 14:06:51] [INFO ] Deduced a trap composed of 308 places in 341 ms of which 4 ms to minimize.
[2024-05-28 14:06:52] [INFO ] Deduced a trap composed of 307 places in 276 ms of which 4 ms to minimize.
[2024-05-28 14:06:52] [INFO ] Deduced a trap composed of 313 places in 242 ms of which 4 ms to minimize.
[2024-05-28 14:06:52] [INFO ] Deduced a trap composed of 299 places in 254 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 53 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 14:07:02] [INFO ] Deduced a trap composed of 353 places in 306 ms of which 4 ms to minimize.
[2024-05-28 14:07:03] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 2 ms to minimize.
[2024-05-28 14:07:03] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 2 ms to minimize.
[2024-05-28 14:07:08] [INFO ] Deduced a trap composed of 324 places in 217 ms of which 3 ms to minimize.
[2024-05-28 14:07:08] [INFO ] Deduced a trap composed of 311 places in 223 ms of which 3 ms to minimize.
[2024-05-28 14:07:12] [INFO ] Deduced a trap composed of 313 places in 269 ms of which 3 ms to minimize.
[2024-05-28 14:07:13] [INFO ] Deduced a trap composed of 47 places in 165 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 7/60 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 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 22/22 constraints]
After SMT, in 41241ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41259ms
[2024-05-28 14:07:21] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 14:07:21] [INFO ] Invariant cache hit.
[2024-05-28 14:07:21] [INFO ] Implicit Places using invariants in 443 ms returned []
[2024-05-28 14:07:21] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 14:07:21] [INFO ] Invariant cache hit.
[2024-05-28 14:07:22] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:07:28] [INFO ] Implicit Places using invariants and state equation in 6656 ms returned []
Implicit Place search using SMT with State Equation took 7101 ms to find 0 implicit places.
Running 1096 sub problems to find dead transitions.
[2024-05-28 14:07:28] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 14:07:28] [INFO ] Invariant cache hit.
[2024-05-28 14:07:28] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 14:07:38] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 1 ms to minimize.
[2024-05-28 14:07:38] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 0 ms to minimize.
[2024-05-28 14:07:38] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:07:38] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-05-28 14:07:38] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
[2024-05-28 14:07:38] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:07:38] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:07:39] [INFO ] Deduced a trap composed of 334 places in 275 ms of which 4 ms to minimize.
[2024-05-28 14:07:39] [INFO ] Deduced a trap composed of 339 places in 278 ms of which 4 ms to minimize.
[2024-05-28 14:07:40] [INFO ] Deduced a trap composed of 183 places in 234 ms of which 4 ms to minimize.
[2024-05-28 14:07:40] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 1 ms to minimize.
[2024-05-28 14:07:40] [INFO ] Deduced a trap composed of 65 places in 125 ms of which 2 ms to minimize.
[2024-05-28 14:07:41] [INFO ] Deduced a trap composed of 314 places in 278 ms of which 4 ms to minimize.
[2024-05-28 14:07:41] [INFO ] Deduced a trap composed of 334 places in 264 ms of which 3 ms to minimize.
[2024-05-28 14:07:42] [INFO ] Deduced a trap composed of 351 places in 209 ms of which 3 ms to minimize.
[2024-05-28 14:07:42] [INFO ] Deduced a trap composed of 338 places in 203 ms of which 3 ms to minimize.
[2024-05-28 14:07:42] [INFO ] Deduced a trap composed of 307 places in 195 ms of which 3 ms to minimize.
[2024-05-28 14:07:42] [INFO ] Deduced a trap composed of 324 places in 204 ms of which 3 ms to minimize.
[2024-05-28 14:07:43] [INFO ] Deduced a trap composed of 42 places in 191 ms of which 3 ms to minimize.
[2024-05-28 14:07:43] [INFO ] Deduced a trap composed of 307 places in 209 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
[2024-05-28 14:07:44] [INFO ] Deduced a trap composed of 283 places in 238 ms of which 3 ms to minimize.
[2024-05-28 14:07:44] [INFO ] Deduced a trap composed of 353 places in 194 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 2/60 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 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 14:08:09] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 14:08:18] [INFO ] Deduced a trap composed of 299 places in 207 ms of which 3 ms to minimize.
[2024-05-28 14:08:18] [INFO ] Deduced a trap composed of 397 places in 203 ms of which 3 ms to minimize.
[2024-05-28 14:08:19] [INFO ] Deduced a trap composed of 408 places in 194 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/586 variables, 3/64 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 64 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 26/26 constraints]
After SMT, in 61270ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 61280ms
Finished structural reductions in LTL mode , in 1 iterations and 109658 ms. Remains : 588/588 places, 1098/1098 transitions.
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S02J04T08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T08-LTLFireability-12 finished in 109736 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))) U p2)))'
Support contains 35 out of 588 places. Attempting structural reductions.
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 0 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 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 328 place count 420 transition count 930
Iterating global reduction 3 with 8 rules applied. Total rules applied 336 place count 420 transition count 930
Applied a total of 336 rules in 36 ms. Remains 420 /588 variables (removed 168) and now considering 930/1098 (removed 168) transitions.
Running 928 sub problems to find dead transitions.
[2024-05-28 14:08:29] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
// Phase 1: matrix 914 rows 420 cols
[2024-05-28 14:08:29] [INFO ] Computed 40 invariants in 7 ms
[2024-05-28 14:08:29] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-05-28 14:08:36] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:08:36] [INFO ] Deduced a trap composed of 43 places in 33 ms of which 1 ms to minimize.
[2024-05-28 14:08:36] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
[2024-05-28 14:08:36] [INFO ] Deduced a trap composed of 43 places in 31 ms of which 1 ms to minimize.
[2024-05-28 14:08:36] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:08:36] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-05-28 14:08:36] [INFO ] Deduced a trap composed of 43 places in 31 ms of which 0 ms to minimize.
[2024-05-28 14:08:37] [INFO ] Deduced a trap composed of 195 places in 193 ms of which 2 ms to minimize.
[2024-05-28 14:08:37] [INFO ] Deduced a trap composed of 156 places in 167 ms of which 2 ms to minimize.
[2024-05-28 14:08:37] [INFO ] Deduced a trap composed of 213 places in 174 ms of which 2 ms to minimize.
[2024-05-28 14:08:37] [INFO ] Deduced a trap composed of 43 places in 32 ms of which 0 ms to minimize.
[2024-05-28 14:08:41] [INFO ] Deduced a trap composed of 79 places in 109 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-05-28 14:08:48] [INFO ] Deduced a trap composed of 158 places in 199 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1334 variables, and 51 constraints, problems are : Problem set: 0 solved, 928 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 928/928 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 13/51 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-05-28 14:08:53] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 2 ms to minimize.
[2024-05-28 14:08:56] [INFO ] Deduced a trap composed of 179 places in 222 ms of which 3 ms to minimize.
[2024-05-28 14:08:57] [INFO ] Deduced a trap composed of 168 places in 199 ms of which 3 ms to minimize.
[2024-05-28 14:09:04] [INFO ] Deduced a trap composed of 142 places in 191 ms of which 3 ms to minimize.
[2024-05-28 14:09:04] [INFO ] Deduced a trap composed of 177 places in 170 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-05-28 14:09:10] [INFO ] Deduced a trap composed of 260 places in 194 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/1334 variables, and 57 constraints, problems are : Problem set: 0 solved, 928 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/928 constraints, Known Traps: 19/19 constraints]
After SMT, in 41524ms problems are : Problem set: 0 solved, 928 unsolved
Search for dead transitions found 0 dead transitions in 41533ms
[2024-05-28 14:09:11] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-05-28 14:09:11] [INFO ] Invariant cache hit.
[2024-05-28 14:09:11] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-05-28 14:09:11] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-05-28 14:09:11] [INFO ] Invariant cache hit.
[2024-05-28 14:09:11] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:09:16] [INFO ] Implicit Places using invariants and state equation in 4793 ms returned []
Implicit Place search using SMT with State Equation took 5136 ms to find 0 implicit places.
[2024-05-28 14:09:16] [INFO ] Redundant transitions in 12 ms returned []
Running 928 sub problems to find dead transitions.
[2024-05-28 14:09:16] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2024-05-28 14:09:16] [INFO ] Invariant cache hit.
[2024-05-28 14:09:16] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 928 unsolved
[2024-05-28 14:09:22] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:09:22] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:09:23] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 0 ms to minimize.
[2024-05-28 14:09:23] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 1 ms to minimize.
[2024-05-28 14:09:23] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2024-05-28 14:09:23] [INFO ] Deduced a trap composed of 43 places in 28 ms of which 1 ms to minimize.
[2024-05-28 14:09:23] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-05-28 14:09:23] [INFO ] Deduced a trap composed of 172 places in 168 ms of which 3 ms to minimize.
[2024-05-28 14:09:23] [INFO ] Deduced a trap composed of 156 places in 163 ms of which 2 ms to minimize.
[2024-05-28 14:09:24] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 1 ms to minimize.
[2024-05-28 14:09:27] [INFO ] Deduced a trap composed of 158 places in 154 ms of which 2 ms to minimize.
[2024-05-28 14:09:31] [INFO ] Deduced a trap composed of 137 places in 202 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 928 unsolved
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/419 variables, 1/51 constraints. Problems are: Problem set: 48 solved, 880 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 419/1334 variables, and 51 constraints, problems are : Problem set: 48 solved, 880 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 928/928 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 48 solved, 880 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 13/13 constraints. Problems are: Problem set: 48 solved, 880 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 25/38 constraints. Problems are: Problem set: 48 solved, 880 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 12/50 constraints. Problems are: Problem set: 48 solved, 880 unsolved
[2024-05-28 14:09:49] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 2 ms to minimize.
[2024-05-28 14:09:53] [INFO ] Deduced a trap composed of 171 places in 145 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 2/52 constraints. Problems are: Problem set: 48 solved, 880 unsolved
[2024-05-28 14:10:01] [INFO ] Deduced a trap composed of 270 places in 219 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 1/53 constraints. Problems are: Problem set: 48 solved, 880 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 0/53 constraints. Problems are: Problem set: 48 solved, 880 unsolved
At refinement iteration 6 (OVERLAPS) 1/419 variables, 1/54 constraints. Problems are: Problem set: 48 solved, 880 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 Int declared 419/1334 variables, and 54 constraints, problems are : Problem set: 48 solved, 880 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/420 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/928 constraints, Known Traps: 15/15 constraints]
After SMT, in 61417ms problems are : Problem set: 48 solved, 880 unsolved
Search for dead transitions found 48 dead transitions in 61432ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 420/588 places, 882/1098 transitions.
Applied a total of 0 rules in 10 ms. Remains 420 /420 variables (removed 0) and now considering 882/882 (removed 0) transitions.
[2024-05-28 14:10:17] [INFO ] Redundant transitions in 5 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 108200 ms. Remains : 420/588 places, 882/1098 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p2), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLFireability-14
Stuttering criterion allowed to conclude after 1773 steps with 0 reset in 8 ms.
FORMULA PolyORBLF-COL-S02J04T08-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T08-LTLFireability-14 finished in 108363 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-COL-S02J04T08-LTLFireability-04
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1))]
Support contains 17 out of 588 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 588/588 places, 1098/1098 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 588 transition count 1058
Reduce places removed 40 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 48 rules applied. Total rules applied 88 place count 548 transition count 1050
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 96 place count 540 transition count 1050
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 96 place count 540 transition count 986
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 224 place count 476 transition count 986
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 336 place count 420 transition count 930
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 344 place count 412 transition count 922
Iterating global reduction 3 with 8 rules applied. Total rules applied 352 place count 412 transition count 922
Applied a total of 352 rules in 36 ms. Remains 412 /588 variables (removed 176) and now considering 922/1098 (removed 176) transitions.
Running 920 sub problems to find dead transitions.
[2024-05-28 14:10:18] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
// Phase 1: matrix 906 rows 412 cols
[2024-05-28 14:10:18] [INFO ] Computed 40 invariants in 10 ms
[2024-05-28 14:10:18] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-28 14:10:25] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 2 ms to minimize.
[2024-05-28 14:10:25] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 1 ms to minimize.
[2024-05-28 14:10:25] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 1 ms to minimize.
[2024-05-28 14:10:25] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 1 ms to minimize.
[2024-05-28 14:10:25] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 7 ms to minimize.
[2024-05-28 14:10:26] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-05-28 14:10:26] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2024-05-28 14:10:26] [INFO ] Deduced a trap composed of 188 places in 165 ms of which 2 ms to minimize.
[2024-05-28 14:10:26] [INFO ] Deduced a trap composed of 189 places in 181 ms of which 2 ms to minimize.
[2024-05-28 14:10:26] [INFO ] Deduced a trap composed of 189 places in 157 ms of which 2 ms to minimize.
[2024-05-28 14:10:26] [INFO ] Deduced a trap composed of 183 places in 169 ms of which 2 ms to minimize.
[2024-05-28 14:10:27] [INFO ] Deduced a trap composed of 183 places in 169 ms of which 2 ms to minimize.
[2024-05-28 14:10:27] [INFO ] Deduced a trap composed of 183 places in 157 ms of which 2 ms to minimize.
[2024-05-28 14:10:27] [INFO ] Deduced a trap composed of 189 places in 157 ms of which 2 ms to minimize.
[2024-05-28 14:10:27] [INFO ] Deduced a trap composed of 163 places in 155 ms of which 2 ms to minimize.
[2024-05-28 14:10:28] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 0 ms to minimize.
[2024-05-28 14:10:28] [INFO ] Deduced a trap composed of 55 places in 111 ms of which 2 ms to minimize.
[2024-05-28 14:10:33] [INFO ] Deduced a trap composed of 166 places in 215 ms of which 3 ms to minimize.
[2024-05-28 14:10:34] [INFO ] Deduced a trap composed of 195 places in 202 ms of which 3 ms to minimize.
[2024-05-28 14:10:34] [INFO ] Deduced a trap composed of 169 places in 219 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 920 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 410/1318 variables, and 58 constraints, problems are : Problem set: 0 solved, 920 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 920/920 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 920 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-28 14:10:44] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 2 ms to minimize.
[2024-05-28 14:10:50] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-28 14:10:57] [INFO ] Deduced a trap composed of 164 places in 154 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 920 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/1318 variables, and 61 constraints, problems are : Problem set: 0 solved, 920 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/920 constraints, Known Traps: 23/23 constraints]
After SMT, in 41337ms problems are : Problem set: 0 solved, 920 unsolved
Search for dead transitions found 0 dead transitions in 41345ms
[2024-05-28 14:10:59] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-28 14:10:59] [INFO ] Invariant cache hit.
[2024-05-28 14:11:00] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-05-28 14:11:00] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-28 14:11:00] [INFO ] Invariant cache hit.
[2024-05-28 14:11:00] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:11:03] [INFO ] Implicit Places using invariants and state equation in 3134 ms returned []
Implicit Place search using SMT with State Equation took 3419 ms to find 0 implicit places.
Running 920 sub problems to find dead transitions.
[2024-05-28 14:11:03] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-28 14:11:03] [INFO ] Invariant cache hit.
[2024-05-28 14:11:03] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-28 14:11:09] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 1 ms to minimize.
[2024-05-28 14:11:09] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 1 ms to minimize.
[2024-05-28 14:11:10] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-05-28 14:11:10] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 0 ms to minimize.
[2024-05-28 14:11:10] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 0 ms to minimize.
[2024-05-28 14:11:10] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-05-28 14:11:10] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 1 ms to minimize.
[2024-05-28 14:11:10] [INFO ] Deduced a trap composed of 176 places in 157 ms of which 2 ms to minimize.
[2024-05-28 14:11:10] [INFO ] Deduced a trap composed of 171 places in 158 ms of which 2 ms to minimize.
[2024-05-28 14:11:11] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 1 ms to minimize.
[2024-05-28 14:11:11] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 0 ms to minimize.
[2024-05-28 14:11:11] [INFO ] Deduced a trap composed of 55 places in 112 ms of which 1 ms to minimize.
[2024-05-28 14:11:16] [INFO ] Deduced a trap composed of 147 places in 166 ms of which 2 ms to minimize.
[2024-05-28 14:11:17] [INFO ] Deduced a trap composed of 173 places in 163 ms of which 2 ms to minimize.
[2024-05-28 14:11:17] [INFO ] Deduced a trap composed of 162 places in 131 ms of which 3 ms to minimize.
[2024-05-28 14:11:17] [INFO ] Deduced a trap composed of 3 places in 186 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-28 14:11:24] [INFO ] Deduced a trap composed of 158 places in 155 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-28 14:11:31] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/1318 variables, and 56 constraints, problems are : Problem set: 0 solved, 920 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 920/920 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 920 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-28 14:11:41] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-28 14:11:49] [INFO ] Deduced a trap composed of 91 places in 266 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-28 14:11:56] [INFO ] Deduced a trap composed of 250 places in 189 ms of which 3 ms to minimize.
[2024-05-28 14:12:03] [INFO ] Deduced a trap composed of 203 places in 220 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/1318 variables, and 60 constraints, problems are : Problem set: 0 solved, 920 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/920 constraints, Known Traps: 22/22 constraints]
After SMT, in 61347ms problems are : Problem set: 0 solved, 920 unsolved
Search for dead transitions found 0 dead transitions in 61361ms
Starting structural reductions in LI_LTL mode, iteration 1 : 412/588 places, 922/1098 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 106168 ms. Remains : 412/588 places, 922/1098 transitions.
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLFireability-04
Product exploration explored 100000 steps with 4557 reset in 405 ms.
Product exploration explored 100000 steps with 4578 reset in 370 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 165 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 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 163 steps (0 resets) in 6 ms. (23 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 147 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 102 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
[2024-05-28 14:12:06] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-28 14:12:06] [INFO ] Invariant cache hit.
[2024-05-28 14:12:06] [INFO ] [Real]Absence check using 13 positive place invariants in 32 ms returned sat
[2024-05-28 14:12:06] [INFO ] [Real]Absence check using 13 positive and 27 generalized place invariants in 68 ms returned sat
[2024-05-28 14:12:07] [INFO ] [Real]Absence check using state equation in 845 ms returned sat
[2024-05-28 14:12:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:12:07] [INFO ] [Nat]Absence check using 13 positive place invariants in 23 ms returned sat
[2024-05-28 14:12:07] [INFO ] [Nat]Absence check using 13 positive and 27 generalized place invariants in 59 ms returned sat
[2024-05-28 14:12:09] [INFO ] [Nat]Absence check using state equation in 1747 ms returned sat
[2024-05-28 14:12:09] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:12:10] [INFO ] [Nat]Added 96 Read/Feed constraints in 422 ms returned sat
[2024-05-28 14:12:10] [INFO ] Deduced a trap composed of 47 places in 196 ms of which 2 ms to minimize.
[2024-05-28 14:12:10] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 1 ms to minimize.
[2024-05-28 14:12:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 711 ms
[2024-05-28 14:12:10] [INFO ] Computed and/alt/rep : 384/1325/376 causal constraints (skipped 528 transitions) in 90 ms.
[2024-05-28 14:12:13] [INFO ] Added : 146 causal constraints over 30 iterations in 2591 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 412 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 : 412/412 places, 922/922 transitions.
Applied a total of 0 rules in 17 ms. Remains 412 /412 variables (removed 0) and now considering 922/922 (removed 0) transitions.
Running 920 sub problems to find dead transitions.
[2024-05-28 14:12:13] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-28 14:12:13] [INFO ] Invariant cache hit.
[2024-05-28 14:12:13] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-28 14:12:19] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:12:19] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
[2024-05-28 14:12:20] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-05-28 14:12:20] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 1 ms to minimize.
[2024-05-28 14:12:20] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:12:20] [INFO ] Deduced a trap composed of 42 places in 29 ms of which 0 ms to minimize.
[2024-05-28 14:12:20] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 0 ms to minimize.
[2024-05-28 14:12:20] [INFO ] Deduced a trap composed of 176 places in 146 ms of which 2 ms to minimize.
[2024-05-28 14:12:20] [INFO ] Deduced a trap composed of 171 places in 144 ms of which 2 ms to minimize.
[2024-05-28 14:12:22] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 2 ms to minimize.
[2024-05-28 14:12:22] [INFO ] Deduced a trap composed of 42 places in 27 ms of which 1 ms to minimize.
[2024-05-28 14:12:22] [INFO ] Deduced a trap composed of 55 places in 131 ms of which 2 ms to minimize.
[2024-05-28 14:12:27] [INFO ] Deduced a trap composed of 147 places in 217 ms of which 3 ms to minimize.
[2024-05-28 14:12:28] [INFO ] Deduced a trap composed of 173 places in 239 ms of which 2 ms to minimize.
[2024-05-28 14:12:28] [INFO ] Deduced a trap composed of 162 places in 184 ms of which 2 ms to minimize.
[2024-05-28 14:12:28] [INFO ] Deduced a trap composed of 3 places in 200 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 920 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/1318 variables, and 54 constraints, problems are : Problem set: 0 solved, 920 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 920/920 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 920 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-28 14:12:39] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 3 ms to minimize.
[2024-05-28 14:12:42] [INFO ] Deduced a trap composed of 250 places in 206 ms of which 3 ms to minimize.
[2024-05-28 14:12:49] [INFO ] Deduced a trap composed of 163 places in 145 ms of which 3 ms to minimize.
[2024-05-28 14:12:50] [INFO ] Deduced a trap composed of 93 places in 182 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 920 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 9)
(s1 1)
(s2 0)
(s3 0)
(s4 1)
(s5 1)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/1318 variables, and 58 constraints, problems are : Problem set: 0 solved, 920 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/920 constraints, Known Traps: 20/20 constraints]
After SMT, in 41427ms problems are : Problem set: 0 solved, 920 unsolved
Search for dead transitions found 0 dead transitions in 41440ms
[2024-05-28 14:12:54] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-28 14:12:54] [INFO ] Invariant cache hit.
[2024-05-28 14:12:55] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-05-28 14:12:55] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-28 14:12:55] [INFO ] Invariant cache hit.
[2024-05-28 14:12:55] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:12:58] [INFO ] Implicit Places using invariants and state equation in 2995 ms returned []
Implicit Place search using SMT with State Equation took 3310 ms to find 0 implicit places.
[2024-05-28 14:12:58] [INFO ] Redundant transitions in 12 ms returned []
Running 920 sub problems to find dead transitions.
[2024-05-28 14:12:58] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-28 14:12:58] [INFO ] Invariant cache hit.
[2024-05-28 14:12:58] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-28 14:13:04] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 1 ms to minimize.
[2024-05-28 14:13:04] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 1 ms to minimize.
[2024-05-28 14:13:04] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 0 ms to minimize.
[2024-05-28 14:13:04] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 0 ms to minimize.
[2024-05-28 14:13:04] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:13:04] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-05-28 14:13:04] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 0 ms to minimize.
[2024-05-28 14:13:04] [INFO ] Deduced a trap composed of 176 places in 150 ms of which 2 ms to minimize.
[2024-05-28 14:13:05] [INFO ] Deduced a trap composed of 171 places in 152 ms of which 2 ms to minimize.
[2024-05-28 14:13:06] [INFO ] Deduced a trap composed of 88 places in 90 ms of which 1 ms to minimize.
[2024-05-28 14:13:06] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 0 ms to minimize.
[2024-05-28 14:13:06] [INFO ] Deduced a trap composed of 55 places in 97 ms of which 1 ms to minimize.
[2024-05-28 14:13:11] [INFO ] Deduced a trap composed of 147 places in 149 ms of which 2 ms to minimize.
[2024-05-28 14:13:12] [INFO ] Deduced a trap composed of 173 places in 164 ms of which 2 ms to minimize.
[2024-05-28 14:13:12] [INFO ] Deduced a trap composed of 162 places in 160 ms of which 2 ms to minimize.
[2024-05-28 14:13:12] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-28 14:13:19] [INFO ] Deduced a trap composed of 158 places in 149 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-28 14:13:26] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/1318 variables, and 56 constraints, problems are : Problem set: 0 solved, 920 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 920/920 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 920 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-28 14:13:35] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 2 ms to minimize.
[2024-05-28 14:13:43] [INFO ] Deduced a trap composed of 91 places in 147 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-28 14:13:51] [INFO ] Deduced a trap composed of 250 places in 172 ms of which 2 ms to minimize.
[2024-05-28 14:13:58] [INFO ] Deduced a trap composed of 203 places in 211 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 9)
(s1 1)
(s2 1)
(s3 1)
(s4 0)
(s5 1)
(s6 1)
(s7 1)
(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 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(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 0)
(s59 0)
(s60 0)
(s61 0)
(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 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(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 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 10)
(s147 1)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 1)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(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 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 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 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 timeout
0)
(s223 0)
(s224 0)
(s225 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/1318 variables, and 60 constraints, problems are : Problem set: 0 solved, 920 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/920 constraints, Known Traps: 22/22 constraints]
After SMT, in 61238ms problems are : Problem set: 0 solved, 920 unsolved
Search for dead transitions found 0 dead transitions in 61252ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 106056 ms. Remains : 412/412 places, 922/922 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 73 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 p0), (NOT p0)]
RANDOM walk for 159 steps (0 resets) in 6 ms. (22 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 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
[2024-05-28 14:13:59] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-28 14:13:59] [INFO ] Invariant cache hit.
[2024-05-28 14:14:00] [INFO ] [Real]Absence check using 13 positive place invariants in 21 ms returned sat
[2024-05-28 14:14:00] [INFO ] [Real]Absence check using 13 positive and 27 generalized place invariants in 46 ms returned sat
[2024-05-28 14:14:00] [INFO ] [Real]Absence check using state equation in 558 ms returned sat
[2024-05-28 14:14:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:14:01] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2024-05-28 14:14:01] [INFO ] [Nat]Absence check using 13 positive and 27 generalized place invariants in 40 ms returned sat
[2024-05-28 14:14:02] [INFO ] [Nat]Absence check using state equation in 1400 ms returned sat
[2024-05-28 14:14:02] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:14:02] [INFO ] [Nat]Added 96 Read/Feed constraints in 296 ms returned sat
[2024-05-28 14:14:02] [INFO ] Deduced a trap composed of 47 places in 147 ms of which 3 ms to minimize.
[2024-05-28 14:14:03] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 2 ms to minimize.
[2024-05-28 14:14:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 622 ms
[2024-05-28 14:14:03] [INFO ] Computed and/alt/rep : 384/1325/376 causal constraints (skipped 528 transitions) in 57 ms.
[2024-05-28 14:14:05] [INFO ] Added : 146 causal constraints over 30 iterations in 2235 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2439 reset in 426 ms.
Product exploration explored 100000 steps with 2439 reset in 407 ms.
Built C files in :
/tmp/ltsmin10288579816422728305
[2024-05-28 14:14:06] [INFO ] Computing symmetric may disable matrix : 922 transitions.
[2024-05-28 14:14:06] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:14:06] [INFO ] Computing symmetric may enable matrix : 922 transitions.
[2024-05-28 14:14:06] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:14:06] [INFO ] Computing Do-Not-Accords matrix : 922 transitions.
[2024-05-28 14:14:06] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:14:06] [INFO ] Built C files in 195ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10288579816422728305
Running compilation step : cd /tmp/ltsmin10288579816422728305;'/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/ltsmin10288579816422728305;'/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/ltsmin10288579816422728305;'/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 412 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 412/412 places, 922/922 transitions.
Applied a total of 0 rules in 16 ms. Remains 412 /412 variables (removed 0) and now considering 922/922 (removed 0) transitions.
Running 920 sub problems to find dead transitions.
[2024-05-28 14:14:09] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-28 14:14:09] [INFO ] Invariant cache hit.
[2024-05-28 14:14:09] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-28 14:14:16] [INFO ] Deduced a trap composed of 42 places in 84 ms of which 1 ms to minimize.
[2024-05-28 14:14:16] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:14:16] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-05-28 14:14:16] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-05-28 14:14:16] [INFO ] Deduced a trap composed of 42 places in 29 ms of which 1 ms to minimize.
[2024-05-28 14:14:17] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 0 ms to minimize.
[2024-05-28 14:14:17] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-05-28 14:14:17] [INFO ] Deduced a trap composed of 176 places in 209 ms of which 2 ms to minimize.
[2024-05-28 14:14:17] [INFO ] Deduced a trap composed of 171 places in 185 ms of which 2 ms to minimize.
[2024-05-28 14:14:19] [INFO ] Deduced a trap composed of 88 places in 114 ms of which 1 ms to minimize.
[2024-05-28 14:14:19] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-05-28 14:14:19] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 1 ms to minimize.
[2024-05-28 14:14:24] [INFO ] Deduced a trap composed of 147 places in 154 ms of which 2 ms to minimize.
[2024-05-28 14:14:25] [INFO ] Deduced a trap composed of 173 places in 154 ms of which 2 ms to minimize.
[2024-05-28 14:14:25] [INFO ] Deduced a trap composed of 162 places in 146 ms of which 2 ms to minimize.
[2024-05-28 14:14:25] [INFO ] Deduced a trap composed of 3 places in 157 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 920 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/1318 variables, and 54 constraints, problems are : Problem set: 0 solved, 920 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 920/920 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 920 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-28 14:14:35] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 1 ms to minimize.
[2024-05-28 14:14:38] [INFO ] Deduced a trap composed of 250 places in 153 ms of which 2 ms to minimize.
[2024-05-28 14:14:45] [INFO ] Deduced a trap composed of 163 places in 168 ms of which 2 ms to minimize.
[2024-05-28 14:14:46] [INFO ] Deduced a trap composed of 93 places in 192 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 920 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 Int declared 410/1318 variables, and 58 constraints, problems are : Problem set: 0 solved, 920 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/920 constraints, Known Traps: 20/20 constraints]
After SMT, in 41539ms problems are : Problem set: 0 solved, 920 unsolved
Search for dead transitions found 0 dead transitions in 41554ms
[2024-05-28 14:14:51] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-28 14:14:51] [INFO ] Invariant cache hit.
[2024-05-28 14:14:51] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-05-28 14:14:51] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-28 14:14:51] [INFO ] Invariant cache hit.
[2024-05-28 14:14:51] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:14:54] [INFO ] Implicit Places using invariants and state equation in 3242 ms returned []
Implicit Place search using SMT with State Equation took 3551 ms to find 0 implicit places.
[2024-05-28 14:14:54] [INFO ] Redundant transitions in 5 ms returned []
Running 920 sub problems to find dead transitions.
[2024-05-28 14:14:54] [INFO ] Flow matrix only has 906 transitions (discarded 16 similar events)
[2024-05-28 14:14:54] [INFO ] Invariant cache hit.
[2024-05-28 14:14:54] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-28 14:15:01] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 2 ms to minimize.
[2024-05-28 14:15:02] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 1 ms to minimize.
[2024-05-28 14:15:02] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:15:02] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 5 ms to minimize.
[2024-05-28 14:15:02] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
[2024-05-28 14:15:02] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 0 ms to minimize.
[2024-05-28 14:15:02] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-05-28 14:15:02] [INFO ] Deduced a trap composed of 176 places in 223 ms of which 3 ms to minimize.
[2024-05-28 14:15:03] [INFO ] Deduced a trap composed of 171 places in 217 ms of which 3 ms to minimize.
[2024-05-28 14:15:04] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 1 ms to minimize.
[2024-05-28 14:15:04] [INFO ] Deduced a trap composed of 42 places in 31 ms of which 1 ms to minimize.
[2024-05-28 14:15:04] [INFO ] Deduced a trap composed of 55 places in 150 ms of which 2 ms to minimize.
[2024-05-28 14:15:09] [INFO ] Deduced a trap composed of 147 places in 219 ms of which 3 ms to minimize.
[2024-05-28 14:15:10] [INFO ] Deduced a trap composed of 173 places in 223 ms of which 2 ms to minimize.
[2024-05-28 14:15:10] [INFO ] Deduced a trap composed of 162 places in 213 ms of which 3 ms to minimize.
[2024-05-28 14:15:10] [INFO ] Deduced a trap composed of 3 places in 241 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-28 14:15:18] [INFO ] Deduced a trap composed of 158 places in 156 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-28 14:15:25] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/1318 variables, and 56 constraints, problems are : Problem set: 0 solved, 920 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 920/920 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 920 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 920 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-28 14:15:32] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
[2024-05-28 14:15:39] [INFO ] Deduced a trap composed of 91 places in 224 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 920 unsolved
[2024-05-28 14:15:47] [INFO ] Deduced a trap composed of 250 places in 217 ms of which 4 ms to minimize.
[2024-05-28 14:15:54] [INFO ] Deduced a trap composed of 203 places in 143 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 920 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/1318 variables, and 60 constraints, problems are : Problem set: 0 solved, 920 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/920 constraints, Known Traps: 22/22 constraints]
After SMT, in 61234ms problems are : Problem set: 0 solved, 920 unsolved
Search for dead transitions found 0 dead transitions in 61243ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 106379 ms. Remains : 412/412 places, 922/922 transitions.
Built C files in :
/tmp/ltsmin7697701867557221873
[2024-05-28 14:15:56] [INFO ] Computing symmetric may disable matrix : 922 transitions.
[2024-05-28 14:15:56] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:15:56] [INFO ] Computing symmetric may enable matrix : 922 transitions.
[2024-05-28 14:15:56] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:15:56] [INFO ] Computing Do-Not-Accords matrix : 922 transitions.
[2024-05-28 14:15:56] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:15:56] [INFO ] Built C files in 232ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7697701867557221873
Running compilation step : cd /tmp/ltsmin7697701867557221873;'/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/ltsmin7697701867557221873;'/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/ltsmin7697701867557221873;'/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 14:15:59] [INFO ] Flatten gal took : 50 ms
[2024-05-28 14:15:59] [INFO ] Flatten gal took : 42 ms
[2024-05-28 14:15:59] [INFO ] Time to serialize gal into /tmp/LTL3819985512761286177.gal : 7 ms
[2024-05-28 14:15:59] [INFO ] Time to serialize properties into /tmp/LTL7604552735391540413.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/LTL3819985512761286177.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13763390024399277475.hoa' '-atoms' '/tmp/LTL7604552735391540413.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/LTL7604552735391540413.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13763390024399277475.hoa
Detected timeout of ITS tools.
[2024-05-28 14:16:14] [INFO ] Flatten gal took : 55 ms
[2024-05-28 14:16:14] [INFO ] Flatten gal took : 44 ms
[2024-05-28 14:16:14] [INFO ] Time to serialize gal into /tmp/LTL18296103307229565723.gal : 5 ms
[2024-05-28 14:16:14] [INFO ] Time to serialize properties into /tmp/LTL10163498293742086287.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/LTL18296103307229565723.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10163498293742086287.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...277
Read 1 LTL properties
Checking formula 0 : !((F((F("((((NotifyEventSourceAddedB_2>=1)||(NotifyEventSourceAddedB_3>=1))||((NotifyEventSourceAddedB_5>=1)||(NotifyEventSourceAddedB...1539
Formula 0 simplified : G(G!"((((NotifyEventSourceAddedB_2>=1)||(NotifyEventSourceAddedB_3>=1))||((NotifyEventSourceAddedB_5>=1)||(NotifyEventSourceAddedB_4...1246
Detected timeout of ITS tools.
[2024-05-28 14:16:29] [INFO ] Flatten gal took : 64 ms
[2024-05-28 14:16:29] [INFO ] Applying decomposition
[2024-05-28 14:16:30] [INFO ] Flatten gal took : 61 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/graph15761866586678448844.txt' '-o' '/tmp/graph15761866586678448844.bin' '-w' '/tmp/graph15761866586678448844.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15761866586678448844.bin' '-l' '-1' '-v' '-w' '/tmp/graph15761866586678448844.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:16:30] [INFO ] Decomposing Gal with order
[2024-05-28 14:16:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:16:30] [INFO ] Removed a total of 693 redundant transitions.
[2024-05-28 14:16:30] [INFO ] Flatten gal took : 165 ms
[2024-05-28 14:16:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 289 labels/synchronizations in 48 ms.
[2024-05-28 14:16:30] [INFO ] Time to serialize gal into /tmp/LTL11103387642908162754.gal : 28 ms
[2024-05-28 14:16:30] [INFO ] Time to serialize properties into /tmp/LTL16803365857590937165.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/LTL11103387642908162754.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16803365857590937165.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 : !((F((F("((((i4.i0.u14.NotifyEventSourceAddedB_2>=1)||(i4.i0.u15.NotifyEventSourceAddedB_3>=1))||((i4.i0.u16.NotifyEventSourceAddedB_5...2011
Formula 0 simplified : G(G!"((((i4.i0.u14.NotifyEventSourceAddedB_2>=1)||(i4.i0.u15.NotifyEventSourceAddedB_3>=1))||((i4.i0.u16.NotifyEventSourceAddedB_5>=...1640
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S02J04T08-LTLFireability-04 finished in 387313 ms.
[2024-05-28 14:16:45] [INFO ] Flatten gal took : 32 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12426954930076477198
[2024-05-28 14:16:45] [INFO ] Computing symmetric may disable matrix : 1098 transitions.
[2024-05-28 14:16:45] [INFO ] Applying decomposition
[2024-05-28 14:16:45] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:16:45] [INFO ] Computing symmetric may enable matrix : 1098 transitions.
[2024-05-28 14:16:45] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:16:45] [INFO ] Flatten gal took : 32 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/graph5405228394764290306.txt' '-o' '/tmp/graph5405228394764290306.bin' '-w' '/tmp/graph5405228394764290306.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5405228394764290306.bin' '-l' '-1' '-v' '-w' '/tmp/graph5405228394764290306.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:16:45] [INFO ] Decomposing Gal with order
[2024-05-28 14:16:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:16:45] [INFO ] Removed a total of 895 redundant transitions.
[2024-05-28 14:16:45] [INFO ] Flatten gal took : 84 ms
[2024-05-28 14:16:45] [INFO ] Computing Do-Not-Accords matrix : 1098 transitions.
[2024-05-28 14:16:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 278 labels/synchronizations in 13 ms.
[2024-05-28 14:16:45] [INFO ] Time to serialize gal into /tmp/LTLFireability4043711343907300352.gal : 7 ms
[2024-05-28 14:16:45] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:16:45] [INFO ] Time to serialize properties into /tmp/LTLFireability9313325220199192332.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/LTLFireability4043711343907300352.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9313325220199192332.ltl' '-c' '-stutter-deadlock'
[2024-05-28 14:16:45] [INFO ] Built C files in 318ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12426954930076477198
Running compilation step : cd /tmp/ltsmin12426954930076477198;'/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'

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 2 LTL properties
Checking formula 0 : !((X(G(X(F(("(((((i9.u72.P_1095>=1)&&(i9.u72.P_1113_7>=1))||((i9.u72.P_1095>=1)&&(i9.u72.P_1113_5>=1)))||(((i9.u72.P_1095>=1)&&(i9.u72...1272
Formula 0 simplified : FG(!"(((((i9.u72.Check_Sources_E_4>=1)&&(i12.i3.u17.ORB_Lock>=1))||((i9.u72.Check_Sources_E_3>=1)&&(i12.i3.u17.ORB_Lock>=1)))||(((i9...1375
Compilation finished in 3849 ms.
Running link step : cd /tmp/ltsmin12426954930076477198;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 109 ms.
Running LTSmin : cd /tmp/ltsmin12426954930076477198;'/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 198196 ms.
FORMULA PolyORBLF-COL-S02J04T08-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin12426954930076477198;'/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' '<>((<>((LTLAPp2==true))&&X((!(LTLAPp2==true) U ((LTLAPp3==true)||[](!(LTLAPp2==true)))))))' '--buchi-type=spotba'
LTSmin run took 2884 ms.
FORMULA PolyORBLF-COL-S02J04T08-LTLFireability-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 2707774 ms.

BK_STOP 1716906011126

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-COL-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-COL-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-171654446300084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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