About the Execution of ITS-Tools for PolyORBLF-COL-S02J06T08
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16200.844 | 3600000.00 | 9409098.00 | 1256.40 | F?FFFFTTTFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654446400108.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-S02J06T08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446400108
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 8.3K Apr 11 17:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 11 17:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 11 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 11 17:06 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.9K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 11 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 11 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Apr 11 17:13 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-S02J06T08-LTLFireability-00
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-01
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-02
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-03
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-04
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-05
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-06
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-07
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-08
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-09
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-10
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-11
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-12
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-13
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-14
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716906539374
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-S02J06T08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202405141337
[2024-05-28 14:29:00] [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 14:29:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 14:29:00] [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 14:29:01] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 14:29:01] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 775 ms
[2024-05-28 14:29:01] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 690 PT places and 1492.0 transition bindings in 28 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 14:29:01] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2024-05-28 14:29:01] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 23 to 21
RANDOM walk for 40000 steps (18 resets) in 1402 ms. (28 steps per ms) remains 4/21 properties
BEST_FIRST walk for 40000 steps (13 resets) in 563 ms. (70 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 174 ms. (228 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (11 resets) in 148 ms. (268 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (15 resets) in 225 ms. (176 steps per ms) remains 4/4 properties
[2024-05-28 14:29:02] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 14:29:02] [INFO ] Computed 26 invariants in 13 ms
[2024-05-28 14:29:02] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 39/49 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 5/54 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp12 is UNSAT
At refinement iteration 5 (OVERLAPS) 21/75 variables, 12/22 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-28 14:29:02] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 9 ms to minimize.
[2024-05-28 14:29:02] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 2/24 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/24 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/80 variables, 3/27 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/80 variables, 0/27 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/81 variables, 1/28 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/81 variables, 0/28 constraints. Problems are: Problem set: 2 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 64/145 variables, 81/109 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/145 variables, 8/117 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/145 variables, 0/117 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/145 variables, 0/117 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 117 constraints, problems are : Problem set: 2 solved, 2 unsolved in 400 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: 4/4 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 9/24 variables, 2/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 23/47 variables, 3/7 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3/50 variables, 2/9 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 23/73 variables, 12/21 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 2/23 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/73 variables, 0/23 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 5/78 variables, 3/26 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/78 variables, 0/26 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/79 variables, 1/27 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/79 variables, 0/27 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 64/143 variables, 79/106 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 8/114 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/143 variables, 2/116 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/143 variables, 0/116 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/145 variables, 2/118 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/145 variables, 1/119 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/145 variables, 0/119 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/145 variables, 0/119 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 119 constraints, problems are : Problem set: 2 solved, 2 unsolved in 745 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: 2/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 1189ms problems are : Problem set: 2 solved, 2 unsolved
Parikh walk visited 0 properties in 850 ms.
Support contains 3 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 67 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 14:29:04] [INFO ] Flow matrix only has 44 transitions (discarded 1 similar events)
// Phase 1: matrix 44 rows 60 cols
[2024-05-28 14:29:04] [INFO ] Computed 25 invariants in 1 ms
[2024-05-28 14:29:04] [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 14:29:05] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 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 14:29:05] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2024-05-28 14:29:05] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-05-28 14:29:05] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-28 14:29:05] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-05-28 14:29:05] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 5/31 constraints. Problems are: Problem set: 2 solved, 42 unsolved
[2024-05-28 14:29:05] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-28 14:29:05] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 2/33 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/33 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 44/104 variables, 60/93 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 8/101 constraints. Problems are: Problem set: 2 solved, 42 unsolved
[2024-05-28 14:29:05] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2024-05-28 14:29:05] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 2/103 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/104 variables, 0/103 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 12 (OVERLAPS) 0/104 variables, 0/103 constraints. Problems are: Problem set: 2 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 103 constraints, problems are : Problem set: 2 solved, 42 unsolved in 1377 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: 10/10 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, 5/29 constraints. Problems are: Problem set: 2 solved, 42 unsolved
[2024-05-28 14:29:06] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-28 14:29:06] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-28 14:29:06] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-28 14:29:06] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-05-28 14:29:06] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 5/34 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/34 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 1/60 variables, 1/35 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 5/40 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/40 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 44/104 variables, 60/100 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 8/108 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 42/150 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/104 variables, 0/150 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 12 (OVERLAPS) 0/104 variables, 0/150 constraints. Problems are: Problem set: 2 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 150 constraints, problems are : Problem set: 2 solved, 42 unsolved in 1127 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: 15/15 constraints]
After SMT, in 2548ms problems are : Problem set: 2 solved, 42 unsolved
Search for dead transitions found 2 dead transitions in 2551ms
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 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 59 transition count 41
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 58 transition count 39
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 5 ms. Remains 58 /60 variables (removed 2) and now considering 39/43 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2653 ms. Remains : 58/81 places, 39/65 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Successfully simplified 5 atomic propositions for a total of 12 simplifications.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 14:29:07] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-05-28 14:29:07] [INFO ] Flatten gal took : 30 ms
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 14:29:07] [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 14:29:07] [INFO ] Unfolded HLPN to a Petri net with 690 places and 1434 transitions 6564 arcs in 30 ms.
[2024-05-28 14:29:07] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Support contains 198 out of 690 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 682 transition count 1298
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 682 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 674 transition count 1290
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 674 transition count 1290
Applied a total of 32 rules in 51 ms. Remains 674 /690 variables (removed 16) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2024-05-28 14:29:07] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 674 cols
[2024-05-28 14:29:07] [INFO ] Computed 54 invariants in 51 ms
[2024-05-28 14:29:07] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:29:18] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 2 ms to minimize.
[2024-05-28 14:29:18] [INFO ] Deduced a trap composed of 71 places in 72 ms of which 2 ms to minimize.
[2024-05-28 14:29:19] [INFO ] Deduced a trap composed of 71 places in 58 ms of which 1 ms to minimize.
[2024-05-28 14:29:19] [INFO ] Deduced a trap composed of 71 places in 59 ms of which 2 ms to minimize.
[2024-05-28 14:29:19] [INFO ] Deduced a trap composed of 71 places in 42 ms of which 1 ms to minimize.
[2024-05-28 14:29:19] [INFO ] Deduced a trap composed of 71 places in 43 ms of which 3 ms to minimize.
[2024-05-28 14:29:19] [INFO ] Deduced a trap composed of 71 places in 42 ms of which 1 ms to minimize.
[2024-05-28 14:29:19] [INFO ] Deduced a trap composed of 349 places in 347 ms of which 4 ms to minimize.
[2024-05-28 14:29:20] [INFO ] Deduced a trap composed of 162 places in 272 ms of which 4 ms to minimize.
[2024-05-28 14:29:20] [INFO ] Deduced a trap composed of 71 places in 43 ms of which 1 ms to minimize.
[2024-05-28 14:29:21] [INFO ] Deduced a trap composed of 384 places in 372 ms of which 5 ms to minimize.
[2024-05-28 14:29:21] [INFO ] Deduced a trap composed of 53 places in 210 ms of which 3 ms to minimize.
[2024-05-28 14:29:22] [INFO ] Deduced a trap composed of 336 places in 374 ms of which 5 ms to minimize.
[2024-05-28 14:29:22] [INFO ] Deduced a trap composed of 319 places in 354 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/1948 variables, and 64 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20065 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/42 constraints, State Equation: 0/674 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 14/64 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:29:41] [INFO ] Deduced a trap composed of 19 places in 167 ms of which 3 ms to minimize.
[2024-05-28 14:29:44] [INFO ] Deduced a trap composed of 351 places in 352 ms of which 5 ms to minimize.
[2024-05-28 14:29:45] [INFO ] Deduced a trap composed of 346 places in 274 ms of which 4 ms to minimize.
[2024-05-28 14:29:45] [INFO ] Deduced a trap composed of 47 places in 174 ms of which 4 ms to minimize.
[2024-05-28 14:29:46] [INFO ] Deduced a trap composed of 374 places in 349 ms of which 5 ms to minimize.
[2024-05-28 14:29:47] [INFO ] Deduced a trap composed of 59 places in 349 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/1948 variables, and 70 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/42 constraints, State Equation: 0/674 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 20/20 constraints]
After SMT, in 41873ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 41891ms
[2024-05-28 14:29:49] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 14:29:49] [INFO ] Invariant cache hit.
[2024-05-28 14:29:50] [INFO ] Implicit Places using invariants in 537 ms returned []
[2024-05-28 14:29:50] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 14:29:50] [INFO ] Invariant cache hit.
[2024-05-28 14:29:50] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:29:58] [INFO ] Implicit Places using invariants and state equation in 8211 ms returned []
Implicit Place search using SMT with State Equation took 8752 ms to find 0 implicit places.
Running 1288 sub problems to find dead transitions.
[2024-05-28 14:29:58] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 14:29:58] [INFO ] Invariant cache hit.
[2024-05-28 14:29:58] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:30:10] [INFO ] Deduced a trap composed of 71 places in 100 ms of which 1 ms to minimize.
[2024-05-28 14:30:10] [INFO ] Deduced a trap composed of 71 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:30:10] [INFO ] Deduced a trap composed of 71 places in 62 ms of which 2 ms to minimize.
[2024-05-28 14:30:10] [INFO ] Deduced a trap composed of 71 places in 60 ms of which 1 ms to minimize.
[2024-05-28 14:30:11] [INFO ] Deduced a trap composed of 71 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:30:11] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:30:11] [INFO ] Deduced a trap composed of 71 places in 59 ms of which 2 ms to minimize.
[2024-05-28 14:30:11] [INFO ] Deduced a trap composed of 367 places in 346 ms of which 5 ms to minimize.
[2024-05-28 14:30:12] [INFO ] Deduced a trap composed of 374 places in 352 ms of which 5 ms to minimize.
[2024-05-28 14:30:12] [INFO ] Deduced a trap composed of 165 places in 302 ms of which 5 ms to minimize.
[2024-05-28 14:30:13] [INFO ] Deduced a trap composed of 366 places in 318 ms of which 3 ms to minimize.
[2024-05-28 14:30:13] [INFO ] Deduced a trap composed of 71 places in 69 ms of which 2 ms to minimize.
[2024-05-28 14:30:14] [INFO ] Deduced a trap composed of 377 places in 317 ms of which 5 ms to minimize.
[2024-05-28 14:30:14] [INFO ] Deduced a trap composed of 49 places in 267 ms of which 4 ms to minimize.
[2024-05-28 14:30:14] [INFO ] Deduced a trap composed of 350 places in 281 ms of which 4 ms to minimize.
[2024-05-28 14:30:15] [INFO ] Deduced a trap composed of 328 places in 368 ms of which 5 ms to minimize.
[2024-05-28 14:30:15] [INFO ] Deduced a trap composed of 329 places in 258 ms of which 4 ms to minimize.
[2024-05-28 14:30:16] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
[2024-05-28 14:30:25] [INFO ] Deduced a trap composed of 69 places in 157 ms of which 3 ms to minimize.
[2024-05-28 14:30:26] [INFO ] Deduced a trap composed of 3 places in 312 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/1948 variables, and 70 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/42 constraints, State Equation: 0/674 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:30:33] [INFO ] Deduced a trap composed of 328 places in 344 ms of which 5 ms to minimize.
[2024-05-28 14:30:34] [INFO ] Deduced a trap composed of 392 places in 314 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/670 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/1948 variables, and 72 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/42 constraints, State Equation: 0/674 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 22/22 constraints]
After SMT, in 61808ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 61825ms
Starting structural reductions in LTL mode, iteration 1 : 674/690 places, 1290/1306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112530 ms. Remains : 674/690 places, 1290/1306 transitions.
Support contains 198 out of 674 places after structural reductions.
[2024-05-28 14:31:00] [INFO ] Flatten gal took : 108 ms
[2024-05-28 14:31:00] [INFO ] Flatten gal took : 77 ms
[2024-05-28 14:31:00] [INFO ] Input system was already deterministic with 1290 transitions.
Reduction of identical properties reduced properties to check from 18 to 16
RANDOM walk for 446 steps (0 resets) in 39 ms. (11 steps per ms) remains 0/16 properties
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(X(((!p0 U p1)||F(G(p2)))))))'
Support contains 30 out of 674 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 674/674 places, 1290/1290 transitions.
Applied a total of 0 rules in 22 ms. Remains 674 /674 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Running 1288 sub problems to find dead transitions.
[2024-05-28 14:31:00] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 14:31:00] [INFO ] Invariant cache hit.
[2024-05-28 14:31:00] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:31:13] [INFO ] Deduced a trap composed of 71 places in 89 ms of which 1 ms to minimize.
[2024-05-28 14:31:13] [INFO ] Deduced a trap composed of 71 places in 45 ms of which 1 ms to minimize.
[2024-05-28 14:31:13] [INFO ] Deduced a trap composed of 71 places in 43 ms of which 1 ms to minimize.
[2024-05-28 14:31:13] [INFO ] Deduced a trap composed of 71 places in 44 ms of which 1 ms to minimize.
[2024-05-28 14:31:13] [INFO ] Deduced a trap composed of 71 places in 43 ms of which 2 ms to minimize.
[2024-05-28 14:31:13] [INFO ] Deduced a trap composed of 71 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:31:13] [INFO ] Deduced a trap composed of 71 places in 60 ms of which 1 ms to minimize.
[2024-05-28 14:31:14] [INFO ] Deduced a trap composed of 367 places in 312 ms of which 6 ms to minimize.
[2024-05-28 14:31:14] [INFO ] Deduced a trap composed of 374 places in 328 ms of which 6 ms to minimize.
[2024-05-28 14:31:14] [INFO ] Deduced a trap composed of 165 places in 294 ms of which 4 ms to minimize.
[2024-05-28 14:31:15] [INFO ] Deduced a trap composed of 366 places in 337 ms of which 4 ms to minimize.
[2024-05-28 14:31:15] [INFO ] Deduced a trap composed of 71 places in 58 ms of which 2 ms to minimize.
[2024-05-28 14:31:16] [INFO ] Deduced a trap composed of 377 places in 389 ms of which 5 ms to minimize.
[2024-05-28 14:31:16] [INFO ] Deduced a trap composed of 49 places in 260 ms of which 3 ms to minimize.
[2024-05-28 14:31:17] [INFO ] Deduced a trap composed of 350 places in 363 ms of which 5 ms to minimize.
[2024-05-28 14:31:17] [INFO ] Deduced a trap composed of 328 places in 290 ms of which 3 ms to minimize.
[2024-05-28 14:31:17] [INFO ] Deduced a trap composed of 329 places in 228 ms of which 3 ms to minimize.
[2024-05-28 14:31:18] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/1948 variables, and 68 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/42 constraints, State Equation: 0/674 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 18/68 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:31:34] [INFO ] Deduced a trap composed of 69 places in 168 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/1948 variables, and 69 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/42 constraints, State Equation: 0/674 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 19/19 constraints]
After SMT, in 42098ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 42118ms
[2024-05-28 14:31:42] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 14:31:42] [INFO ] Invariant cache hit.
[2024-05-28 14:31:43] [INFO ] Implicit Places using invariants in 585 ms returned [532, 533, 534, 535, 536, 537, 538, 539]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 608 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 666/674 places, 1290/1290 transitions.
Applied a total of 0 rules in 46 ms. Remains 666 /666 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42800 ms. Remains : 666/674 places, 1290/1290 transitions.
Stuttering acceptance computed with spot in 394 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-00
Stuttering criterion allowed to conclude after 4302 steps with 0 reset in 80 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-00 finished in 43357 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(F(p1))||p0))))'
Support contains 20 out of 674 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 674/674 places, 1290/1290 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 672 transition count 1242
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 624 transition count 1242
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 96 place count 624 transition count 1162
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 256 place count 544 transition count 1162
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 384 place count 480 transition count 1098
Applied a total of 384 rules in 135 ms. Remains 480 /674 variables (removed 194) and now considering 1098/1290 (removed 192) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-28 14:31:44] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 480 cols
[2024-05-28 14:31:44] [INFO ] Computed 52 invariants in 44 ms
[2024-05-28 14:31:44] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 14:31:52] [INFO ] Deduced a trap composed of 47 places in 147 ms of which 2 ms to minimize.
[2024-05-28 14:31:52] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:31:53] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 2 ms to minimize.
[2024-05-28 14:31:53] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:31:53] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
[2024-05-28 14:31:53] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 2 ms to minimize.
[2024-05-28 14:31:53] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:31:53] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:31:53] [INFO ] Deduced a trap composed of 175 places in 287 ms of which 4 ms to minimize.
[2024-05-28 14:31:54] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
[2024-05-28 14:31:58] [INFO ] Deduced a trap composed of 292 places in 243 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/1562 variables, and 61 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 35/37 constraints, State Equation: 0/480 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 14:32:10] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 3 ms to minimize.
[2024-05-28 14:32:17] [INFO ] Deduced a trap composed of 124 places in 267 ms of which 3 ms to minimize.
[2024-05-28 14:32:17] [INFO ] Deduced a trap composed of 153 places in 264 ms of which 5 ms to minimize.
[2024-05-28 14:32:17] [INFO ] Deduced a trap composed of 173 places in 254 ms of which 4 ms to minimize.
[2024-05-28 14:32:18] [INFO ] Deduced a trap composed of 166 places in 237 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 5/66 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/1562 variables, and 66 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 35/37 constraints, State Equation: 0/480 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 16/16 constraints]
After SMT, in 41728ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41745ms
[2024-05-28 14:32:26] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 14:32:26] [INFO ] Invariant cache hit.
[2024-05-28 14:32:26] [INFO ] Implicit Places using invariants in 371 ms returned [434, 435, 436, 437, 438, 439, 440, 441]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 374 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 472/674 places, 1098/1290 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 464 transition count 1090
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 464 transition count 1090
Applied a total of 16 rules in 44 ms. Remains 464 /472 variables (removed 8) and now considering 1090/1098 (removed 8) transitions.
[2024-05-28 14:32:26] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
// Phase 1: matrix 1074 rows 464 cols
[2024-05-28 14:32:26] [INFO ] Computed 44 invariants in 35 ms
[2024-05-28 14:32:26] [INFO ] Implicit Places using invariants in 340 ms returned []
[2024-05-28 14:32:26] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2024-05-28 14:32:26] [INFO ] Invariant cache hit.
[2024-05-28 14:32:27] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:32:30] [INFO ] Implicit Places using invariants and state equation in 3990 ms returned []
Implicit Place search using SMT with State Equation took 4332 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 464/674 places, 1090/1290 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 46634 ms. Remains : 464/674 places, 1090/1290 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-01
Product exploration explored 100000 steps with 3706 reset in 751 ms.
Product exploration explored 100000 steps with 3718 reset in 496 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 132 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 88 steps (0 resets) in 6 ms. (12 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 230 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-28 14:32:32] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2024-05-28 14:32:32] [INFO ] Invariant cache hit.
[2024-05-28 14:32:33] [INFO ] [Real]Absence check using 15 positive place invariants in 29 ms returned sat
[2024-05-28 14:32:33] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 63 ms returned sat
[2024-05-28 14:32:35] [INFO ] [Real]Absence check using state equation in 1513 ms returned sat
[2024-05-28 14:32:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:32:35] [INFO ] [Nat]Absence check using 15 positive place invariants in 23 ms returned sat
[2024-05-28 14:32:35] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 53 ms returned sat
[2024-05-28 14:32:37] [INFO ] [Nat]Absence check using state equation in 1595 ms returned sat
[2024-05-28 14:32:37] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:32:37] [INFO ] [Nat]Added 96 Read/Feed constraints in 326 ms returned sat
[2024-05-28 14:32:37] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 2 ms to minimize.
[2024-05-28 14:32:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 284 ms
[2024-05-28 14:32:38] [INFO ] Computed and/alt/rep : 416/1461/408 causal constraints (skipped 664 transitions) in 142 ms.
[2024-05-28 14:32:41] [INFO ] Added : 105 causal constraints over 21 iterations in 3014 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 20 out of 464 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 464/464 places, 1090/1090 transitions.
Applied a total of 0 rules in 31 ms. Remains 464 /464 variables (removed 0) and now considering 1090/1090 (removed 0) transitions.
Running 1088 sub problems to find dead transitions.
[2024-05-28 14:32:41] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2024-05-28 14:32:41] [INFO ] Invariant cache hit.
[2024-05-28 14:32:41] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
[2024-05-28 14:32:50] [INFO ] Deduced a trap composed of 47 places in 171 ms of which 3 ms to minimize.
[2024-05-28 14:32:50] [INFO ] Deduced a trap composed of 47 places in 124 ms of which 2 ms to minimize.
[2024-05-28 14:32:50] [INFO ] Deduced a trap composed of 47 places in 105 ms of which 2 ms to minimize.
[2024-05-28 14:32:50] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 1 ms to minimize.
[2024-05-28 14:32:50] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
[2024-05-28 14:32:51] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 0 ms to minimize.
[2024-05-28 14:32:51] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 1 ms to minimize.
[2024-05-28 14:32:51] [INFO ] Deduced a trap composed of 47 places in 262 ms of which 3 ms to minimize.
[2024-05-28 14:32:51] [INFO ] Deduced a trap composed of 192 places in 247 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1538 variables, and 51 constraints, problems are : Problem set: 0 solved, 1088 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/464 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1088/1088 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1088 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
[2024-05-28 14:33:07] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 2 ms to minimize.
[2024-05-28 14:33:10] [INFO ] Deduced a trap composed of 39 places in 187 ms of which 2 ms to minimize.
[2024-05-28 14:33:13] [INFO ] Deduced a trap composed of 170 places in 225 ms of which 3 ms to minimize.
[2024-05-28 14:33:13] [INFO ] Deduced a trap composed of 166 places in 240 ms of which 3 ms to minimize.
[2024-05-28 14:33:14] [INFO ] Deduced a trap composed of 152 places in 252 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 6)
(s1 4)
(s2 1)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 2)
(s8 1)
(s9 1)
(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 1)
(s88 1)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(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 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 9)
(s171 1)
(s172 0)
(s173 1)
(s174 0)
(s175 1)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 1)
(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 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 1)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 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 0)
(s284 0)
(s285 0)
(s286 1)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 1)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 1)
(s320 1)
(s321 1)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 3)
(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 0)
(s345 0)
(s346 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/1538 variables, and 56 constraints, problems are : Problem set: 0 solved, 1088 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/464 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1088 constraints, Known Traps: 14/14 constraints]
After SMT, in 42054ms problems are : Problem set: 0 solved, 1088 unsolved
Search for dead transitions found 0 dead transitions in 42072ms
[2024-05-28 14:33:23] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2024-05-28 14:33:23] [INFO ] Invariant cache hit.
[2024-05-28 14:33:23] [INFO ] Implicit Places using invariants in 343 ms returned []
[2024-05-28 14:33:23] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2024-05-28 14:33:23] [INFO ] Invariant cache hit.
[2024-05-28 14:33:23] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:33:28] [INFO ] Implicit Places using invariants and state equation in 4535 ms returned []
Implicit Place search using SMT with State Equation took 4879 ms to find 0 implicit places.
[2024-05-28 14:33:28] [INFO ] Redundant transitions in 56 ms returned []
Running 1088 sub problems to find dead transitions.
[2024-05-28 14:33:28] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2024-05-28 14:33:28] [INFO ] Invariant cache hit.
[2024-05-28 14:33:28] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
[2024-05-28 14:33:37] [INFO ] Deduced a trap composed of 47 places in 152 ms of which 2 ms to minimize.
[2024-05-28 14:33:37] [INFO ] Deduced a trap composed of 47 places in 104 ms of which 1 ms to minimize.
[2024-05-28 14:33:37] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 1 ms to minimize.
[2024-05-28 14:33:37] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 1 ms to minimize.
[2024-05-28 14:33:37] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 0 ms to minimize.
[2024-05-28 14:33:38] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 1 ms to minimize.
[2024-05-28 14:33:38] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:33:38] [INFO ] Deduced a trap composed of 47 places in 270 ms of which 3 ms to minimize.
[2024-05-28 14:33:38] [INFO ] Deduced a trap composed of 192 places in 222 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
SMT process timed out in 32140ms, After SMT, problems are : Problem set: 0 solved, 1088 unsolved
Search for dead transitions found 0 dead transitions in 32165ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 79222 ms. Remains : 464/464 places, 1090/1090 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 164 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 726 steps (0 resets) in 18 ms. (38 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 210 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-28 14:34:00] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2024-05-28 14:34:00] [INFO ] Invariant cache hit.
[2024-05-28 14:34:01] [INFO ] [Real]Absence check using 15 positive place invariants in 38 ms returned sat
[2024-05-28 14:34:01] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 77 ms returned sat
[2024-05-28 14:34:03] [INFO ] [Real]Absence check using state equation in 1783 ms returned sat
[2024-05-28 14:34:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:34:04] [INFO ] [Nat]Absence check using 15 positive place invariants in 34 ms returned sat
[2024-05-28 14:34:04] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 69 ms returned sat
[2024-05-28 14:34:05] [INFO ] [Nat]Absence check using state equation in 1548 ms returned sat
[2024-05-28 14:34:05] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:34:06] [INFO ] [Nat]Added 96 Read/Feed constraints in 317 ms returned sat
[2024-05-28 14:34:06] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 1 ms to minimize.
[2024-05-28 14:34:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 269 ms
[2024-05-28 14:34:06] [INFO ] Computed and/alt/rep : 416/1461/408 causal constraints (skipped 664 transitions) in 107 ms.
[2024-05-28 14:34:09] [INFO ] Added : 105 causal constraints over 21 iterations in 2879 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3706 reset in 452 ms.
Product exploration explored 100000 steps with 3712 reset in 492 ms.
Built C files in :
/tmp/ltsmin17253371085818452671
[2024-05-28 14:34:10] [INFO ] Computing symmetric may disable matrix : 1090 transitions.
[2024-05-28 14:34:10] [INFO ] Computation of Complete disable matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:34:10] [INFO ] Computing symmetric may enable matrix : 1090 transitions.
[2024-05-28 14:34:10] [INFO ] Computation of Complete enable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:34:10] [INFO ] Computing Do-Not-Accords matrix : 1090 transitions.
[2024-05-28 14:34:10] [INFO ] Computation of Completed DNA matrix. took 39 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:34:10] [INFO ] Built C files in 339ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17253371085818452671
Running compilation step : cd /tmp/ltsmin17253371085818452671;'/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/ltsmin17253371085818452671;'/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/ltsmin17253371085818452671;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 20 out of 464 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 464/464 places, 1090/1090 transitions.
Applied a total of 0 rules in 42 ms. Remains 464 /464 variables (removed 0) and now considering 1090/1090 (removed 0) transitions.
Running 1088 sub problems to find dead transitions.
[2024-05-28 14:34:13] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2024-05-28 14:34:13] [INFO ] Invariant cache hit.
[2024-05-28 14:34:13] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
[2024-05-28 14:34:23] [INFO ] Deduced a trap composed of 47 places in 145 ms of which 3 ms to minimize.
[2024-05-28 14:34:23] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 2 ms to minimize.
[2024-05-28 14:34:23] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 2 ms to minimize.
[2024-05-28 14:34:23] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 2 ms to minimize.
[2024-05-28 14:34:23] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
[2024-05-28 14:34:23] [INFO ] Deduced a trap composed of 47 places in 37 ms of which 1 ms to minimize.
[2024-05-28 14:34:23] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 1 ms to minimize.
[2024-05-28 14:34:23] [INFO ] Deduced a trap composed of 47 places in 236 ms of which 4 ms to minimize.
[2024-05-28 14:34:24] [INFO ] Deduced a trap composed of 192 places in 224 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
(s119 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 4.0)
(s1 6.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 1.0)
(s15 1.0)
(s16 1.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)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1538 variables, and 51 constraints, problems are : Problem set: 0 solved, 1088 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/464 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1088/1088 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1088 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
[2024-05-28 14:34:40] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 2 ms to minimize.
[2024-05-28 14:34:43] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 2 ms to minimize.
[2024-05-28 14:34:46] [INFO ] Deduced a trap composed of 170 places in 174 ms of which 3 ms to minimize.
[2024-05-28 14:34:46] [INFO ] Deduced a trap composed of 166 places in 187 ms of which 3 ms to minimize.
[2024-05-28 14:34:46] [INFO ] Deduced a trap composed of 152 places in 187 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/1538 variables, and 56 constraints, problems are : Problem set: 0 solved, 1088 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/464 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1088 constraints, Known Traps: 14/14 constraints]
After SMT, in 41798ms problems are : Problem set: 0 solved, 1088 unsolved
Search for dead transitions found 0 dead transitions in 41818ms
[2024-05-28 14:34:55] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2024-05-28 14:34:55] [INFO ] Invariant cache hit.
[2024-05-28 14:34:56] [INFO ] Implicit Places using invariants in 374 ms returned []
[2024-05-28 14:34:56] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2024-05-28 14:34:56] [INFO ] Invariant cache hit.
[2024-05-28 14:34:56] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:35:00] [INFO ] Implicit Places using invariants and state equation in 4482 ms returned []
Implicit Place search using SMT with State Equation took 4858 ms to find 0 implicit places.
[2024-05-28 14:35:00] [INFO ] Redundant transitions in 26 ms returned []
Running 1088 sub problems to find dead transitions.
[2024-05-28 14:35:00] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2024-05-28 14:35:00] [INFO ] Invariant cache hit.
[2024-05-28 14:35:00] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
[2024-05-28 14:35:10] [INFO ] Deduced a trap composed of 47 places in 104 ms of which 2 ms to minimize.
[2024-05-28 14:35:10] [INFO ] Deduced a trap composed of 47 places in 86 ms of which 1 ms to minimize.
[2024-05-28 14:35:10] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 2 ms to minimize.
[2024-05-28 14:35:10] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:35:10] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 1 ms to minimize.
[2024-05-28 14:35:10] [INFO ] Deduced a trap composed of 47 places in 28 ms of which 0 ms to minimize.
[2024-05-28 14:35:10] [INFO ] Deduced a trap composed of 47 places in 29 ms of which 1 ms to minimize.
[2024-05-28 14:35:10] [INFO ] Deduced a trap composed of 47 places in 255 ms of which 3 ms to minimize.
[2024-05-28 14:35:11] [INFO ] Deduced a trap composed of 192 places in 190 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
SMT process timed out in 31576ms, After SMT, problems are : Problem set: 0 solved, 1088 unsolved
Search for dead transitions found 0 dead transitions in 31595ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 78354 ms. Remains : 464/464 places, 1090/1090 transitions.
Built C files in :
/tmp/ltsmin18428507674178098369
[2024-05-28 14:35:32] [INFO ] Computing symmetric may disable matrix : 1090 transitions.
[2024-05-28 14:35:32] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:35:32] [INFO ] Computing symmetric may enable matrix : 1090 transitions.
[2024-05-28 14:35:32] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:35:32] [INFO ] Computing Do-Not-Accords matrix : 1090 transitions.
[2024-05-28 14:35:32] [INFO ] Computation of Completed DNA matrix. took 37 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:35:32] [INFO ] Built C files in 302ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18428507674178098369
Running compilation step : cd /tmp/ltsmin18428507674178098369;'/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/ltsmin18428507674178098369;'/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/ltsmin18428507674178098369;'/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:35:35] [INFO ] Flatten gal took : 112 ms
[2024-05-28 14:35:35] [INFO ] Flatten gal took : 134 ms
[2024-05-28 14:35:35] [INFO ] Time to serialize gal into /tmp/LTL6308042586389457217.gal : 32 ms
[2024-05-28 14:35:35] [INFO ] Time to serialize properties into /tmp/LTL10258060560620261250.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/LTL6308042586389457217.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9281268528799700848.hoa' '-atoms' '/tmp/LTL10258060560620261250.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/LTL10258060560620261250.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9281268528799700848.hoa
Detected timeout of ITS tools.
[2024-05-28 14:35:51] [INFO ] Flatten gal took : 69 ms
[2024-05-28 14:35:51] [INFO ] Flatten gal took : 59 ms
[2024-05-28 14:35:51] [INFO ] Time to serialize gal into /tmp/LTL2530559372241991068.gal : 11 ms
[2024-05-28 14:35:51] [INFO ] Time to serialize properties into /tmp/LTL4417574242961827081.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/LTL2530559372241991068.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4417574242961827081.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G((((((X(F("(((((Abort_Check_Sources_B_5>=1)&&(NoSigAbort>=1))||((Abort_Check_Sources_B_0>=1)&&(NoSigAbort>=1)))||(((Abort_Check_...1472
Formula 0 simplified : G(F(!"((((((cSources>=9)&&(ProcessingEvt_7>=1))&&(ModifiedSrc_0>=1))||(((cSources>=9)&&(ProcessingEvt_7>=1))&&(ModifiedSrc_1>=1)))||...1456
Detected timeout of ITS tools.
[2024-05-28 14:36:06] [INFO ] Flatten gal took : 80 ms
[2024-05-28 14:36:06] [INFO ] Applying decomposition
[2024-05-28 14:36:06] [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/graph9679438835529033475.txt' '-o' '/tmp/graph9679438835529033475.bin' '-w' '/tmp/graph9679438835529033475.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9679438835529033475.bin' '-l' '-1' '-v' '-w' '/tmp/graph9679438835529033475.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:36:06] [INFO ] Decomposing Gal with order
[2024-05-28 14:36:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:36:07] [INFO ] Removed a total of 791 redundant transitions.
[2024-05-28 14:36:07] [INFO ] Flatten gal took : 375 ms
[2024-05-28 14:36:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 605 labels/synchronizations in 68 ms.
[2024-05-28 14:36:07] [INFO ] Time to serialize gal into /tmp/LTL10884145985883274289.gal : 32 ms
[2024-05-28 14:36:07] [INFO ] Time to serialize properties into /tmp/LTL17495689487839735039.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/LTL10884145985883274289.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17495689487839735039.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(G((((((X(F("(((((i2.u30.Abort_Check_Sources_B_5>=1)&&(i2.u30.NoSigAbort>=1))||((i2.u30.Abort_Check_Sources_B_0>=1)&&(i2.u30.NoSig...1920
Formula 0 simplified : G(F(!"((((((i9.u15.cSources>=9)&&(i9.u15.ProcessingEvt_7>=1))&&(i9.u15.ModifiedSrc_0>=1))||(((i9.u15.cSources>=9)&&(i9.u15.Processin...1904
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-01 finished in 278342 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p1)||p0)))'
Support contains 18 out of 674 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 674/674 places, 1290/1290 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 672 transition count 1250
Reduce places removed 40 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 48 rules applied. Total rules applied 88 place count 632 transition count 1242
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 96 place count 624 transition count 1242
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 96 place count 624 transition count 1162
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 256 place count 544 transition count 1162
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 352 place count 496 transition count 1114
Applied a total of 352 rules in 98 ms. Remains 496 /674 variables (removed 178) and now considering 1114/1290 (removed 176) transitions.
Running 1112 sub problems to find dead transitions.
[2024-05-28 14:36:22] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 496 cols
[2024-05-28 14:36:22] [INFO ] Computed 52 invariants in 26 ms
[2024-05-28 14:36:22] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-05-28 14:36:33] [INFO ] Deduced a trap composed of 49 places in 177 ms of which 5 ms to minimize.
[2024-05-28 14:36:33] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 2 ms to minimize.
[2024-05-28 14:36:33] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 1 ms to minimize.
[2024-05-28 14:36:33] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:36:33] [INFO ] Deduced a trap composed of 49 places in 37 ms of which 1 ms to minimize.
[2024-05-28 14:36:33] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:36:33] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 1 ms to minimize.
[2024-05-28 14:36:33] [INFO ] Deduced a trap composed of 216 places in 208 ms of which 3 ms to minimize.
[2024-05-28 14:36:34] [INFO ] Deduced a trap composed of 208 places in 192 ms of which 3 ms to minimize.
[2024-05-28 14:36:34] [INFO ] Deduced a trap composed of 49 places in 29 ms of which 1 ms to minimize.
[2024-05-28 14:36:40] [INFO ] Deduced a trap composed of 52 places in 155 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/494 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 494/1594 variables, and 61 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 35/36 constraints, State Equation: 0/496 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1112/1112 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/494 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-05-28 14:36:46] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 2 ms to minimize.
[2024-05-28 14:36:50] [INFO ] Deduced a trap composed of 178 places in 263 ms of which 3 ms to minimize.
[2024-05-28 14:36:54] [INFO ] Deduced a trap composed of 202 places in 236 ms of which 3 ms to minimize.
[2024-05-28 14:36:54] [INFO ] Deduced a trap composed of 229 places in 213 ms of which 4 ms to minimize.
[2024-05-28 14:36:55] [INFO ] Deduced a trap composed of 93 places in 261 ms of which 3 ms to minimize.
[2024-05-28 14:36:59] [INFO ] Deduced a trap composed of 174 places in 291 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/494 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 494/1594 variables, and 67 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 35/36 constraints, State Equation: 0/496 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1112 constraints, Known Traps: 17/17 constraints]
After SMT, in 42064ms problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 42087ms
[2024-05-28 14:37:04] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-05-28 14:37:04] [INFO ] Invariant cache hit.
[2024-05-28 14:37:05] [INFO ] Implicit Places using invariants in 399 ms returned [450, 451, 452, 453, 454, 455, 456, 457]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 415 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 488/674 places, 1114/1290 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 480 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 480 transition count 1106
Applied a total of 16 rules in 30 ms. Remains 480 /488 variables (removed 8) and now considering 1106/1114 (removed 8) transitions.
[2024-05-28 14:37:05] [INFO ] Flow matrix only has 1090 transitions (discarded 16 similar events)
// Phase 1: matrix 1090 rows 480 cols
[2024-05-28 14:37:05] [INFO ] Computed 44 invariants in 15 ms
[2024-05-28 14:37:05] [INFO ] Implicit Places using invariants in 406 ms returned []
[2024-05-28 14:37:05] [INFO ] Flow matrix only has 1090 transitions (discarded 16 similar events)
[2024-05-28 14:37:05] [INFO ] Invariant cache hit.
[2024-05-28 14:37:06] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:37:10] [INFO ] Implicit Places using invariants and state equation in 5424 ms returned []
Implicit Place search using SMT with State Equation took 5831 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 480/674 places, 1106/1290 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 48465 ms. Remains : 480/674 places, 1106/1290 transitions.
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-02
Stuttering criterion allowed to conclude after 1611 steps with 32 reset in 6 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-02 finished in 48552 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&(X(F(p2))||p1))))'
Support contains 28 out of 674 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 674/674 places, 1290/1290 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 672 transition count 1290
Applied a total of 2 rules in 9 ms. Remains 672 /674 variables (removed 2) and now considering 1290/1290 (removed 0) transitions.
Running 1288 sub problems to find dead transitions.
[2024-05-28 14:37:11] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 672 cols
[2024-05-28 14:37:11] [INFO ] Computed 52 invariants in 14 ms
[2024-05-28 14:37:11] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:37:25] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 2 ms to minimize.
[2024-05-28 14:37:27] [INFO ] Deduced a trap composed of 71 places in 66 ms of which 1 ms to minimize.
[2024-05-28 14:37:27] [INFO ] Deduced a trap composed of 71 places in 60 ms of which 1 ms to minimize.
[2024-05-28 14:37:27] [INFO ] Deduced a trap composed of 71 places in 49 ms of which 2 ms to minimize.
[2024-05-28 14:37:27] [INFO ] Deduced a trap composed of 71 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:37:27] [INFO ] Deduced a trap composed of 71 places in 67 ms of which 1 ms to minimize.
[2024-05-28 14:37:28] [INFO ] Deduced a trap composed of 71 places in 67 ms of which 2 ms to minimize.
[2024-05-28 14:37:31] [INFO ] Deduced a trap composed of 71 places in 60 ms of which 1 ms to minimize.
[2024-05-28 14:37:32] [INFO ] Deduced a trap composed of 382 places in 346 ms of which 5 ms to minimize.
SMT process timed out in 21849ms, After SMT, problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 21861ms
[2024-05-28 14:37:32] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 14:37:32] [INFO ] Invariant cache hit.
[2024-05-28 14:37:33] [INFO ] Implicit Places using invariants in 347 ms returned [530, 531, 532, 533, 534, 535, 536, 537]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 349 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 664/674 places, 1290/1290 transitions.
Applied a total of 0 rules in 7 ms. Remains 664 /664 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 22228 ms. Remains : 664/674 places, 1290/1290 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-03
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-03 finished in 22398 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)||(F(p2)&&p1))))'
Support contains 16 out of 674 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 674/674 places, 1290/1290 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 672 transition count 1290
Applied a total of 2 rules in 9 ms. Remains 672 /674 variables (removed 2) and now considering 1290/1290 (removed 0) transitions.
Running 1288 sub problems to find dead transitions.
[2024-05-28 14:37:33] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 14:37:33] [INFO ] Invariant cache hit.
[2024-05-28 14:37:33] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:37:46] [INFO ] Deduced a trap composed of 71 places in 95 ms of which 2 ms to minimize.
[2024-05-28 14:37:47] [INFO ] Deduced a trap composed of 71 places in 86 ms of which 2 ms to minimize.
[2024-05-28 14:37:47] [INFO ] Deduced a trap composed of 71 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:37:47] [INFO ] Deduced a trap composed of 71 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:37:47] [INFO ] Deduced a trap composed of 71 places in 56 ms of which 1 ms to minimize.
[2024-05-28 14:37:47] [INFO ] Deduced a trap composed of 71 places in 60 ms of which 1 ms to minimize.
[2024-05-28 14:37:47] [INFO ] Deduced a trap composed of 71 places in 60 ms of which 1 ms to minimize.
[2024-05-28 14:37:47] [INFO ] Deduced a trap composed of 380 places in 302 ms of which 4 ms to minimize.
[2024-05-28 14:37:48] [INFO ] Deduced a trap composed of 364 places in 308 ms of which 5 ms to minimize.
[2024-05-28 14:37:48] [INFO ] Deduced a trap composed of 71 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:37:48] [INFO ] Deduced a trap composed of 367 places in 302 ms of which 5 ms to minimize.
[2024-05-28 14:37:49] [INFO ] Deduced a trap composed of 184 places in 300 ms of which 4 ms to minimize.
[2024-05-28 14:37:50] [INFO ] Deduced a trap composed of 366 places in 341 ms of which 5 ms to minimize.
[2024-05-28 14:37:50] [INFO ] Deduced a trap composed of 382 places in 311 ms of which 5 ms to minimize.
[2024-05-28 14:37:51] [INFO ] Deduced a trap composed of 395 places in 315 ms of which 5 ms to minimize.
[2024-05-28 14:37:51] [INFO ] Deduced a trap composed of 356 places in 350 ms of which 5 ms to minimize.
[2024-05-28 14:37:51] [INFO ] Deduced a trap composed of 402 places in 289 ms of which 3 ms to minimize.
[2024-05-28 14:37:52] [INFO ] Deduced a trap composed of 353 places in 423 ms of which 5 ms to minimize.
[2024-05-28 14:37:52] [INFO ] Deduced a trap composed of 346 places in 294 ms of which 6 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 9.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.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 1.0)
(s15 3.0)
(s16 1.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 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 9.0)
(s195 0.0)
(s196 1.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 1.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 0.0)
(s404 1.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 4.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 1.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/1946 variables, and 69 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 35/37 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 19/69 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:37:57] [INFO ] Deduced a trap composed of 341 places in 344 ms of which 5 ms to minimize.
[2024-05-28 14:37:58] [INFO ] Deduced a trap composed of 380 places in 367 ms of which 10 ms to minimize.
[2024-05-28 14:38:05] [INFO ] Deduced a trap composed of 461 places in 332 ms of which 5 ms to minimize.
[2024-05-28 14:38:07] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 2 ms to minimize.
[2024-05-28 14:38:11] [INFO ] Deduced a trap composed of 350 places in 329 ms of which 5 ms to minimize.
[2024-05-28 14:38:12] [INFO ] Deduced a trap composed of 69 places in 224 ms of which 4 ms to minimize.
[2024-05-28 14:38:14] [INFO ] Deduced a trap composed of 396 places in 325 ms of which 5 ms to minimize.
[2024-05-28 14:38:15] [INFO ] Deduced a trap composed of 371 places in 283 ms of which 4 ms to minimize.
SMT process timed out in 41850ms, After SMT, problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 41866ms
[2024-05-28 14:38:15] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 14:38:15] [INFO ] Invariant cache hit.
[2024-05-28 14:38:15] [INFO ] Implicit Places using invariants in 569 ms returned [530, 531, 532, 533, 534, 535, 536, 537]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 571 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 664/674 places, 1290/1290 transitions.
Applied a total of 0 rules in 6 ms. Remains 664 /664 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42455 ms. Remains : 664/674 places, 1290/1290 transitions.
Stuttering acceptance computed with spot in 279 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 701 ms.
Product exploration explored 100000 steps with 50000 reset in 572 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 p2 p0 p1), (X p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 25 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-06 finished in 44065 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 11 out of 674 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 674/674 places, 1290/1290 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 672 transition count 1234
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 616 transition count 1234
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 112 place count 616 transition count 1154
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 272 place count 536 transition count 1154
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 368 place count 488 transition count 1106
Applied a total of 368 rules in 71 ms. Remains 488 /674 variables (removed 186) and now considering 1106/1290 (removed 184) transitions.
Running 1104 sub problems to find dead transitions.
[2024-05-28 14:38:17] [INFO ] Flow matrix only has 1090 transitions (discarded 16 similar events)
// Phase 1: matrix 1090 rows 488 cols
[2024-05-28 14:38:17] [INFO ] Computed 52 invariants in 19 ms
[2024-05-28 14:38:17] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
[2024-05-28 14:38:27] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:38:27] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 1 ms to minimize.
[2024-05-28 14:38:27] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
[2024-05-28 14:38:27] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 1 ms to minimize.
[2024-05-28 14:38:27] [INFO ] Deduced a trap composed of 48 places in 37 ms of which 1 ms to minimize.
[2024-05-28 14:38:27] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:38:27] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 0 ms to minimize.
[2024-05-28 14:38:27] [INFO ] Deduced a trap composed of 183 places in 246 ms of which 4 ms to minimize.
[2024-05-28 14:38:28] [INFO ] Deduced a trap composed of 195 places in 224 ms of which 4 ms to minimize.
[2024-05-28 14:38:28] [INFO ] Deduced a trap composed of 184 places in 229 ms of which 3 ms to minimize.
[2024-05-28 14:38:28] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:38:32] [INFO ] Deduced a trap composed of 173 places in 199 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/1578 variables, and 62 constraints, problems are : Problem set: 0 solved, 1104 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 36/37 constraints, State Equation: 0/488 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1104/1104 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
[2024-05-28 14:38:41] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 2 ms to minimize.
[2024-05-28 14:38:42] [INFO ] Deduced a trap composed of 59 places in 143 ms of which 3 ms to minimize.
[2024-05-28 14:38:47] [INFO ] Deduced a trap composed of 166 places in 208 ms of which 3 ms to minimize.
[2024-05-28 14:38:47] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 1 ms to minimize.
[2024-05-28 14:38:48] [INFO ] Deduced a trap composed of 46 places in 259 ms of which 3 ms to minimize.
[2024-05-28 14:38:48] [INFO ] Deduced a trap composed of 212 places in 224 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 6/68 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/1578 variables, and 68 constraints, problems are : Problem set: 0 solved, 1104 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 36/37 constraints, State Equation: 0/488 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1104 constraints, Known Traps: 18/18 constraints]
After SMT, in 41918ms problems are : Problem set: 0 solved, 1104 unsolved
Search for dead transitions found 0 dead transitions in 41933ms
[2024-05-28 14:38:59] [INFO ] Flow matrix only has 1090 transitions (discarded 16 similar events)
[2024-05-28 14:38:59] [INFO ] Invariant cache hit.
[2024-05-28 14:38:59] [INFO ] Implicit Places using invariants in 370 ms returned [434, 435, 436, 437, 438, 439, 440, 441]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 395 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 480/674 places, 1106/1290 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 472 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 472 transition count 1098
Applied a total of 16 rules in 43 ms. Remains 472 /480 variables (removed 8) and now considering 1098/1106 (removed 8) transitions.
[2024-05-28 14:38:59] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 472 cols
[2024-05-28 14:38:59] [INFO ] Computed 44 invariants in 14 ms
[2024-05-28 14:39:00] [INFO ] Implicit Places using invariants in 529 ms returned []
[2024-05-28 14:39:00] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 14:39:00] [INFO ] Invariant cache hit.
[2024-05-28 14:39:00] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:39:07] [INFO ] Implicit Places using invariants and state equation in 6971 ms returned []
Implicit Place search using SMT with State Equation took 7509 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 472/674 places, 1098/1290 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 49956 ms. Remains : 472/674 places, 1098/1290 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 530 ms.
Product exploration explored 100000 steps with 50000 reset in 430 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 29 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-07 finished in 51024 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(p1))))'
Support contains 25 out of 674 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 674/674 places, 1290/1290 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 672 transition count 1250
Reduce places removed 40 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 48 rules applied. Total rules applied 88 place count 632 transition count 1242
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 96 place count 624 transition count 1242
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 96 place count 624 transition count 1162
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 256 place count 544 transition count 1162
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 336 place count 504 transition count 1122
Applied a total of 336 rules in 37 ms. Remains 504 /674 variables (removed 170) and now considering 1122/1290 (removed 168) transitions.
Running 1120 sub problems to find dead transitions.
[2024-05-28 14:39:08] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
// Phase 1: matrix 1106 rows 504 cols
[2024-05-28 14:39:08] [INFO ] Computed 52 invariants in 25 ms
[2024-05-28 14:39:08] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-05-28 14:39:17] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 2 ms to minimize.
[2024-05-28 14:39:18] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2024-05-28 14:39:18] [INFO ] Deduced a trap composed of 50 places in 29 ms of which 1 ms to minimize.
[2024-05-28 14:39:18] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 0 ms to minimize.
[2024-05-28 14:39:18] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 2 ms to minimize.
[2024-05-28 14:39:18] [INFO ] Deduced a trap composed of 50 places in 96 ms of which 2 ms to minimize.
[2024-05-28 14:39:18] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:39:18] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:39:22] [INFO ] Deduced a trap composed of 188 places in 202 ms of which 3 ms to minimize.
[2024-05-28 14:39:23] [INFO ] Deduced a trap composed of 19 places in 249 ms of which 4 ms to minimize.
[2024-05-28 14:39:23] [INFO ] Deduced a trap composed of 209 places in 261 ms of which 4 ms to minimize.
[2024-05-28 14:39:23] [INFO ] Deduced a trap composed of 194 places in 261 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 502/1610 variables, and 62 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/504 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1120/1120 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-05-28 14:39:35] [INFO ] Deduced a trap composed of 211 places in 269 ms of which 4 ms to minimize.
[2024-05-28 14:39:35] [INFO ] Deduced a trap composed of 203 places in 243 ms of which 4 ms to minimize.
[2024-05-28 14:39:35] [INFO ] Deduced a trap composed of 320 places in 239 ms of which 3 ms to minimize.
[2024-05-28 14:39:35] [INFO ] Deduced a trap composed of 186 places in 289 ms of which 4 ms to minimize.
[2024-05-28 14:39:38] [INFO ] Deduced a trap composed of 174 places in 187 ms of which 3 ms to minimize.
[2024-05-28 14:39:39] [INFO ] Deduced a trap composed of 78 places in 186 ms of which 3 ms to minimize.
[2024-05-28 14:39:39] [INFO ] Deduced a trap composed of 69 places in 235 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 7/69 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 502/1610 variables, and 69 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/504 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1120 constraints, Known Traps: 19/19 constraints]
After SMT, in 42075ms problems are : Problem set: 0 solved, 1120 unsolved
Search for dead transitions found 0 dead transitions in 42088ms
[2024-05-28 14:39:50] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
[2024-05-28 14:39:50] [INFO ] Invariant cache hit.
[2024-05-28 14:39:50] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-05-28 14:39:50] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
[2024-05-28 14:39:50] [INFO ] Invariant cache hit.
[2024-05-28 14:39:51] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:39:56] [INFO ] Implicit Places using invariants and state equation in 5257 ms returned []
Implicit Place search using SMT with State Equation took 5583 ms to find 0 implicit places.
[2024-05-28 14:39:56] [INFO ] Redundant transitions in 21 ms returned []
Running 1120 sub problems to find dead transitions.
[2024-05-28 14:39:56] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
[2024-05-28 14:39:56] [INFO ] Invariant cache hit.
[2024-05-28 14:39:56] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-05-28 14:40:06] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-05-28 14:40:06] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-05-28 14:40:06] [INFO ] Deduced a trap composed of 50 places in 102 ms of which 1 ms to minimize.
[2024-05-28 14:40:06] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:40:06] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:40:06] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:40:06] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:40:07] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:40:12] [INFO ] Deduced a trap composed of 68 places in 257 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-05-28 14:40:19] [INFO ] Deduced a trap composed of 321 places in 263 ms of which 4 ms to minimize.
[2024-05-28 14:40:19] [INFO ] Deduced a trap composed of 308 places in 255 ms of which 4 ms to minimize.
[2024-05-28 14:40:22] [INFO ] Deduced a trap composed of 183 places in 261 ms of which 4 ms to minimize.
[2024-05-28 14:40:22] [INFO ] Deduced a trap composed of 230 places in 265 ms of which 4 ms to minimize.
[2024-05-28 14:40:23] [INFO ] Deduced a trap composed of 227 places in 233 ms of which 3 ms to minimize.
[2024-05-28 14:40:23] [INFO ] Deduced a trap composed of 229 places in 236 ms of which 5 ms to minimize.
[2024-05-28 14:40:23] [INFO ] Deduced a trap composed of 225 places in 204 ms of which 3 ms to minimize.
[2024-05-28 14:40:23] [INFO ] Deduced a trap composed of 227 places in 199 ms of which 2 ms to minimize.
[2024-05-28 14:40:24] [INFO ] Deduced a trap composed of 227 places in 260 ms of which 4 ms to minimize.
[2024-05-28 14:40:24] [INFO ] Deduced a trap composed of 306 places in 233 ms of which 4 ms to minimize.
[2024-05-28 14:40:24] [INFO ] Deduced a trap composed of 214 places in 269 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 502/1610 variables, and 70 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/504 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1120/1120 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-05-28 14:40:30] [INFO ] Deduced a trap composed of 224 places in 267 ms of which 3 ms to minimize.
[2024-05-28 14:40:30] [INFO ] Deduced a trap composed of 216 places in 266 ms of which 3 ms to minimize.
[2024-05-28 14:40:30] [INFO ] Deduced a trap composed of 202 places in 266 ms of which 4 ms to minimize.
[2024-05-28 14:40:30] [INFO ] Deduced a trap composed of 221 places in 262 ms of which 4 ms to minimize.
[2024-05-28 14:40:31] [INFO ] Deduced a trap composed of 210 places in 254 ms of which 3 ms to minimize.
[2024-05-28 14:40:35] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 3 ms to minimize.
[2024-05-28 14:40:38] [INFO ] Deduced a trap composed of 174 places in 215 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 7/77 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-05-28 14:40:50] [INFO ] Deduced a trap composed of 171 places in 180 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 502/1610 variables, and 78 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/504 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1120 constraints, Known Traps: 28/28 constraints]
After SMT, in 61921ms problems are : Problem set: 0 solved, 1120 unsolved
Search for dead transitions found 0 dead transitions in 61940ms
Starting structural reductions in SI_LTL mode, iteration 1 : 504/674 places, 1122/1290 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 109692 ms. Remains : 504/674 places, 1122/1290 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-09
Product exploration explored 100000 steps with 3195 reset in 481 ms.
Product exploration explored 100000 steps with 3197 reset in 445 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 p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 119 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 160 steps (0 resets) in 10 ms. (14 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 5 factoid took 173 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-28 14:41:00] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
[2024-05-28 14:41:00] [INFO ] Invariant cache hit.
[2024-05-28 14:41:00] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-28 14:41:00] [INFO ] [Real]Absence check using 12 positive and 40 generalized place invariants in 138 ms returned sat
[2024-05-28 14:41:01] [INFO ] [Real]Absence check using state equation in 971 ms returned sat
[2024-05-28 14:41:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:41:02] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-28 14:41:02] [INFO ] [Nat]Absence check using 12 positive and 40 generalized place invariants in 490 ms returned sat
[2024-05-28 14:41:04] [INFO ] [Nat]Absence check using state equation in 1424 ms returned sat
[2024-05-28 14:41:04] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:41:04] [INFO ] [Nat]Added 96 Read/Feed constraints in 479 ms returned sat
[2024-05-28 14:41:05] [INFO ] Deduced a trap composed of 51 places in 301 ms of which 4 ms to minimize.
[2024-05-28 14:41:05] [INFO ] Deduced a trap composed of 68 places in 304 ms of which 4 ms to minimize.
[2024-05-28 14:41:07] [INFO ] Deduced a trap composed of 50 places in 315 ms of which 4 ms to minimize.
[2024-05-28 14:41:07] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 1 ms to minimize.
[2024-05-28 14:41:07] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 2 ms to minimize.
[2024-05-28 14:41:07] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2915 ms
[2024-05-28 14:41:07] [INFO ] Computed and/alt/rep : 456/1566/448 causal constraints (skipped 656 transitions) in 85 ms.
[2024-05-28 14:41:12] [INFO ] Added : 235 causal constraints over 48 iterations in 4813 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-28 14:41:12] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
[2024-05-28 14:41:12] [INFO ] Invariant cache hit.
[2024-05-28 14:41:13] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-28 14:41:13] [INFO ] [Real]Absence check using 12 positive and 40 generalized place invariants in 193 ms returned sat
[2024-05-28 14:41:15] [INFO ] [Real]Absence check using state equation in 1906 ms returned sat
[2024-05-28 14:41:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:41:15] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-28 14:41:16] [INFO ] [Nat]Absence check using 12 positive and 40 generalized place invariants in 349 ms returned sat
[2024-05-28 14:41:17] [INFO ] [Nat]Absence check using state equation in 1403 ms returned sat
[2024-05-28 14:41:17] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:41:18] [INFO ] [Nat]Added 96 Read/Feed constraints in 414 ms returned sat
[2024-05-28 14:41:18] [INFO ] Deduced a trap composed of 56 places in 281 ms of which 3 ms to minimize.
[2024-05-28 14:41:19] [INFO ] Deduced a trap composed of 51 places in 271 ms of which 3 ms to minimize.
[2024-05-28 14:41:20] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 2666 ms
Could not prove EG (NOT p1)
Support contains 25 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 1122/1122 transitions.
Applied a total of 0 rules in 32 ms. Remains 504 /504 variables (removed 0) and now considering 1122/1122 (removed 0) transitions.
Running 1120 sub problems to find dead transitions.
[2024-05-28 14:41:20] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
[2024-05-28 14:41:20] [INFO ] Invariant cache hit.
[2024-05-28 14:41:20] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-05-28 14:41:31] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:41:31] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 1 ms to minimize.
[2024-05-28 14:41:31] [INFO ] Deduced a trap composed of 50 places in 96 ms of which 1 ms to minimize.
[2024-05-28 14:41:31] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 0 ms to minimize.
[2024-05-28 14:41:31] [INFO ] Deduced a trap composed of 50 places in 44 ms of which 0 ms to minimize.
[2024-05-28 14:41:31] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:41:31] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 0 ms to minimize.
[2024-05-28 14:41:31] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:41:37] [INFO ] Deduced a trap composed of 68 places in 263 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 502/1610 variables, and 59 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/504 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1120/1120 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-05-28 14:41:44] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 1 ms to minimize.
[2024-05-28 14:41:44] [INFO ] Deduced a trap composed of 224 places in 272 ms of which 4 ms to minimize.
[2024-05-28 14:41:44] [INFO ] Deduced a trap composed of 19 places in 213 ms of which 2 ms to minimize.
[2024-05-28 14:41:45] [INFO ] Deduced a trap composed of 193 places in 237 ms of which 2 ms to minimize.
[2024-05-28 14:41:45] [INFO ] Deduced a trap composed of 236 places in 245 ms of which 3 ms to minimize.
[2024-05-28 14:41:45] [INFO ] Deduced a trap composed of 224 places in 196 ms of which 3 ms to minimize.
[2024-05-28 14:41:45] [INFO ] Deduced a trap composed of 224 places in 262 ms of which 4 ms to minimize.
[2024-05-28 14:41:45] [INFO ] Deduced a trap composed of 210 places in 200 ms of which 3 ms to minimize.
[2024-05-28 14:41:46] [INFO ] Deduced a trap composed of 221 places in 262 ms of which 4 ms to minimize.
[2024-05-28 14:41:46] [INFO ] Deduced a trap composed of 222 places in 246 ms of which 3 ms to minimize.
[2024-05-28 14:41:46] [INFO ] Deduced a trap composed of 237 places in 239 ms of which 3 ms to minimize.
[2024-05-28 14:41:46] [INFO ] Deduced a trap composed of 231 places in 199 ms of which 3 ms to minimize.
[2024-05-28 14:41:47] [INFO ] Deduced a trap composed of 211 places in 195 ms of which 3 ms to minimize.
[2024-05-28 14:41:57] [INFO ] Deduced a trap composed of 209 places in 199 ms of which 3 ms to minimize.
[2024-05-28 14:41:58] [INFO ] Deduced a trap composed of 211 places in 278 ms of which 3 ms to minimize.
[2024-05-28 14:41:58] [INFO ] Deduced a trap composed of 199 places in 186 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 16/75 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 502/1610 variables, and 75 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/504 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1120 constraints, Known Traps: 25/25 constraints]
After SMT, in 42113ms problems are : Problem set: 0 solved, 1120 unsolved
Search for dead transitions found 0 dead transitions in 42135ms
[2024-05-28 14:42:02] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
[2024-05-28 14:42:02] [INFO ] Invariant cache hit.
[2024-05-28 14:42:03] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-05-28 14:42:03] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
[2024-05-28 14:42:03] [INFO ] Invariant cache hit.
[2024-05-28 14:42:03] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:42:07] [INFO ] Implicit Places using invariants and state equation in 4643 ms returned []
Implicit Place search using SMT with State Equation took 4981 ms to find 0 implicit places.
[2024-05-28 14:42:07] [INFO ] Redundant transitions in 19 ms returned []
Running 1120 sub problems to find dead transitions.
[2024-05-28 14:42:07] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
[2024-05-28 14:42:07] [INFO ] Invariant cache hit.
[2024-05-28 14:42:07] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-05-28 14:42:17] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 1 ms to minimize.
[2024-05-28 14:42:17] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 1 ms to minimize.
[2024-05-28 14:42:17] [INFO ] Deduced a trap composed of 50 places in 129 ms of which 2 ms to minimize.
[2024-05-28 14:42:17] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 1 ms to minimize.
[2024-05-28 14:42:18] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 1 ms to minimize.
[2024-05-28 14:42:18] [INFO ] Deduced a trap composed of 50 places in 30 ms of which 1 ms to minimize.
[2024-05-28 14:42:18] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:42:18] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:42:22] [INFO ] Deduced a trap composed of 68 places in 185 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-05-28 14:42:28] [INFO ] Deduced a trap composed of 321 places in 247 ms of which 3 ms to minimize.
[2024-05-28 14:42:29] [INFO ] Deduced a trap composed of 308 places in 224 ms of which 3 ms to minimize.
[2024-05-28 14:42:31] [INFO ] Deduced a trap composed of 183 places in 183 ms of which 3 ms to minimize.
[2024-05-28 14:42:32] [INFO ] Deduced a trap composed of 230 places in 190 ms of which 3 ms to minimize.
[2024-05-28 14:42:32] [INFO ] Deduced a trap composed of 227 places in 187 ms of which 3 ms to minimize.
[2024-05-28 14:42:32] [INFO ] Deduced a trap composed of 229 places in 188 ms of which 3 ms to minimize.
[2024-05-28 14:42:32] [INFO ] Deduced a trap composed of 225 places in 172 ms of which 3 ms to minimize.
[2024-05-28 14:42:32] [INFO ] Deduced a trap composed of 227 places in 185 ms of which 2 ms to minimize.
[2024-05-28 14:42:33] [INFO ] Deduced a trap composed of 227 places in 183 ms of which 3 ms to minimize.
[2024-05-28 14:42:33] [INFO ] Deduced a trap composed of 306 places in 183 ms of which 3 ms to minimize.
[2024-05-28 14:42:33] [INFO ] Deduced a trap composed of 214 places in 187 ms of which 3 ms to minimize.
(s469 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 4.0)
(s1 6.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 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 1.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)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 9.0)
(s179 0.0)
(s180 1.0)
(s181 1.0)
(s182 0.0)
(s183 1.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 1.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 1.0)
(s362 0.0)
(s363 1.0)
(s364 0.0)
(s365 1.0)
(s366 0.0)
(s367 1.0)
(s368 0.0)
(s369 0.0)
(s370 1.0)
(s371 0.0)
(s372 1.0)
(s373 0.0)
(s374 1.0)
(s375 10.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 1.0)
(s435 1.0)
(s436 0.0)
(s437 1.0)
(s438 0.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 1.0)
(s468 0.0)
(s469 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 11/70 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 502/1610 variables, and 70 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/504 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1120/1120 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-05-28 14:42:41] [INFO ] Deduced a trap composed of 224 places in 251 ms of which 3 ms to minimize.
[2024-05-28 14:42:41] [INFO ] Deduced a trap composed of 216 places in 257 ms of which 4 ms to minimize.
[2024-05-28 14:42:41] [INFO ] Deduced a trap composed of 202 places in 220 ms of which 4 ms to minimize.
[2024-05-28 14:42:42] [INFO ] Deduced a trap composed of 221 places in 207 ms of which 2 ms to minimize.
[2024-05-28 14:42:42] [INFO ] Deduced a trap composed of 210 places in 241 ms of which 3 ms to minimize.
[2024-05-28 14:42:46] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 3 ms to minimize.
[2024-05-28 14:42:48] [INFO ] Deduced a trap composed of 174 places in 189 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 7/77 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-05-28 14:43:01] [INFO ] Deduced a trap composed of 171 places in 132 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 502/1610 variables, and 78 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/504 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1120 constraints, Known Traps: 28/28 constraints]
After SMT, in 61728ms problems are : Problem set: 0 solved, 1120 unsolved
Search for dead transitions found 0 dead transitions in 61746ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 108928 ms. Remains : 504/504 places, 1122/1122 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 p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 77 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 157 steps (0 resets) in 5 ms. (26 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 5 factoid took 145 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-28 14:43:10] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
[2024-05-28 14:43:10] [INFO ] Invariant cache hit.
[2024-05-28 14:43:10] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2024-05-28 14:43:10] [INFO ] [Real]Absence check using 12 positive and 40 generalized place invariants in 92 ms returned sat
[2024-05-28 14:43:11] [INFO ] [Real]Absence check using state equation in 815 ms returned sat
[2024-05-28 14:43:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:43:12] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-28 14:43:12] [INFO ] [Nat]Absence check using 12 positive and 40 generalized place invariants in 392 ms returned sat
[2024-05-28 14:43:13] [INFO ] [Nat]Absence check using state equation in 1245 ms returned sat
[2024-05-28 14:43:13] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:43:14] [INFO ] [Nat]Added 96 Read/Feed constraints in 742 ms returned sat
[2024-05-28 14:43:14] [INFO ] Deduced a trap composed of 51 places in 251 ms of which 2 ms to minimize.
[2024-05-28 14:43:15] [INFO ] Deduced a trap composed of 68 places in 248 ms of which 3 ms to minimize.
[2024-05-28 14:43:16] [INFO ] Deduced a trap composed of 50 places in 249 ms of which 4 ms to minimize.
[2024-05-28 14:43:16] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 1 ms to minimize.
[2024-05-28 14:43:17] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-05-28 14:43:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2701 ms
[2024-05-28 14:43:17] [INFO ] Computed and/alt/rep : 456/1566/448 causal constraints (skipped 656 transitions) in 102 ms.
[2024-05-28 14:43:21] [INFO ] Added : 235 causal constraints over 48 iterations in 4746 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-28 14:43:21] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
[2024-05-28 14:43:21] [INFO ] Invariant cache hit.
[2024-05-28 14:43:22] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-28 14:43:22] [INFO ] [Real]Absence check using 12 positive and 40 generalized place invariants in 159 ms returned sat
[2024-05-28 14:43:24] [INFO ] [Real]Absence check using state equation in 1899 ms returned sat
[2024-05-28 14:43:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:43:25] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2024-05-28 14:43:25] [INFO ] [Nat]Absence check using 12 positive and 40 generalized place invariants in 306 ms returned sat
[2024-05-28 14:43:26] [INFO ] [Nat]Absence check using state equation in 1413 ms returned sat
[2024-05-28 14:43:26] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:43:27] [INFO ] [Nat]Added 96 Read/Feed constraints in 264 ms returned sat
[2024-05-28 14:43:27] [INFO ] Deduced a trap composed of 56 places in 289 ms of which 4 ms to minimize.
[2024-05-28 14:43:28] [INFO ] Deduced a trap composed of 51 places in 293 ms of which 4 ms to minimize.
[2024-05-28 14:43:29] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 2502 ms
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 3254 reset in 423 ms.
Product exploration explored 100000 steps with 3232 reset in 455 ms.
Built C files in :
/tmp/ltsmin852944189896842409
[2024-05-28 14:43:30] [INFO ] Computing symmetric may disable matrix : 1122 transitions.
[2024-05-28 14:43:30] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:43:30] [INFO ] Computing symmetric may enable matrix : 1122 transitions.
[2024-05-28 14:43:30] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:43:30] [INFO ] Computing Do-Not-Accords matrix : 1122 transitions.
[2024-05-28 14:43:30] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:43:31] [INFO ] Built C files in 303ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin852944189896842409
Running compilation step : cd /tmp/ltsmin852944189896842409;'/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/ltsmin852944189896842409;'/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/ltsmin852944189896842409;'/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 25 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 1122/1122 transitions.
Applied a total of 0 rules in 33 ms. Remains 504 /504 variables (removed 0) and now considering 1122/1122 (removed 0) transitions.
Running 1120 sub problems to find dead transitions.
[2024-05-28 14:43:34] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
[2024-05-28 14:43:34] [INFO ] Invariant cache hit.
[2024-05-28 14:43:34] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-05-28 14:43:44] [INFO ] Deduced a trap composed of 50 places in 31 ms of which 0 ms to minimize.
[2024-05-28 14:43:44] [INFO ] Deduced a trap composed of 50 places in 28 ms of which 1 ms to minimize.
[2024-05-28 14:43:44] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
[2024-05-28 14:43:44] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:43:44] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 0 ms to minimize.
[2024-05-28 14:43:44] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:43:44] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:43:44] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:43:49] [INFO ] Deduced a trap composed of 68 places in 171 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 502/1610 variables, and 59 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/504 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1120/1120 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-05-28 14:43:57] [INFO ] Deduced a trap composed of 48 places in 123 ms of which 1 ms to minimize.
[2024-05-28 14:43:57] [INFO ] Deduced a trap composed of 224 places in 215 ms of which 2 ms to minimize.
[2024-05-28 14:43:57] [INFO ] Deduced a trap composed of 19 places in 194 ms of which 3 ms to minimize.
[2024-05-28 14:43:58] [INFO ] Deduced a trap composed of 193 places in 196 ms of which 3 ms to minimize.
[2024-05-28 14:43:58] [INFO ] Deduced a trap composed of 236 places in 196 ms of which 3 ms to minimize.
[2024-05-28 14:43:58] [INFO ] Deduced a trap composed of 224 places in 197 ms of which 3 ms to minimize.
[2024-05-28 14:43:58] [INFO ] Deduced a trap composed of 224 places in 194 ms of which 2 ms to minimize.
[2024-05-28 14:43:58] [INFO ] Deduced a trap composed of 210 places in 188 ms of which 2 ms to minimize.
[2024-05-28 14:43:59] [INFO ] Deduced a trap composed of 221 places in 208 ms of which 2 ms to minimize.
[2024-05-28 14:43:59] [INFO ] Deduced a trap composed of 222 places in 193 ms of which 2 ms to minimize.
[2024-05-28 14:43:59] [INFO ] Deduced a trap composed of 237 places in 194 ms of which 2 ms to minimize.
[2024-05-28 14:43:59] [INFO ] Deduced a trap composed of 231 places in 209 ms of which 2 ms to minimize.
[2024-05-28 14:44:00] [INFO ] Deduced a trap composed of 211 places in 179 ms of which 2 ms to minimize.
[2024-05-28 14:44:10] [INFO ] Deduced a trap composed of 209 places in 284 ms of which 4 ms to minimize.
[2024-05-28 14:44:11] [INFO ] Deduced a trap composed of 211 places in 177 ms of which 3 ms to minimize.
[2024-05-28 14:44:11] [INFO ] Deduced a trap composed of 199 places in 187 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 16/75 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 502/1610 variables, and 75 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/504 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1120 constraints, Known Traps: 25/25 constraints]
After SMT, in 41874ms problems are : Problem set: 0 solved, 1120 unsolved
Search for dead transitions found 0 dead transitions in 41898ms
[2024-05-28 14:44:15] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
[2024-05-28 14:44:15] [INFO ] Invariant cache hit.
[2024-05-28 14:44:16] [INFO ] Implicit Places using invariants in 390 ms returned []
[2024-05-28 14:44:16] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
[2024-05-28 14:44:16] [INFO ] Invariant cache hit.
[2024-05-28 14:44:16] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:44:20] [INFO ] Implicit Places using invariants and state equation in 4484 ms returned []
Implicit Place search using SMT with State Equation took 4878 ms to find 0 implicit places.
[2024-05-28 14:44:20] [INFO ] Redundant transitions in 19 ms returned []
Running 1120 sub problems to find dead transitions.
[2024-05-28 14:44:20] [INFO ] Flow matrix only has 1106 transitions (discarded 16 similar events)
[2024-05-28 14:44:20] [INFO ] Invariant cache hit.
[2024-05-28 14:44:20] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-05-28 14:44:30] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:44:31] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:44:31] [INFO ] Deduced a trap composed of 50 places in 106 ms of which 3 ms to minimize.
[2024-05-28 14:44:31] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 1 ms to minimize.
[2024-05-28 14:44:31] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 2 ms to minimize.
[2024-05-28 14:44:32] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2024-05-28 14:44:32] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 1 ms to minimize.
[2024-05-28 14:44:32] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:44:36] [INFO ] Deduced a trap composed of 68 places in 263 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-05-28 14:44:44] [INFO ] Deduced a trap composed of 321 places in 254 ms of which 4 ms to minimize.
[2024-05-28 14:44:44] [INFO ] Deduced a trap composed of 308 places in 314 ms of which 4 ms to minimize.
[2024-05-28 14:44:47] [INFO ] Deduced a trap composed of 183 places in 264 ms of which 3 ms to minimize.
[2024-05-28 14:44:48] [INFO ] Deduced a trap composed of 230 places in 241 ms of which 4 ms to minimize.
[2024-05-28 14:44:48] [INFO ] Deduced a trap composed of 227 places in 260 ms of which 4 ms to minimize.
[2024-05-28 14:44:48] [INFO ] Deduced a trap composed of 229 places in 200 ms of which 2 ms to minimize.
[2024-05-28 14:44:48] [INFO ] Deduced a trap composed of 225 places in 244 ms of which 4 ms to minimize.
[2024-05-28 14:44:49] [INFO ] Deduced a trap composed of 227 places in 258 ms of which 3 ms to minimize.
[2024-05-28 14:44:49] [INFO ] Deduced a trap composed of 227 places in 236 ms of which 4 ms to minimize.
[2024-05-28 14:44:49] [INFO ] Deduced a trap composed of 306 places in 201 ms of which 3 ms to minimize.
[2024-05-28 14:44:49] [INFO ] Deduced a trap composed of 214 places in 244 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 502/1610 variables, and 70 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/504 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1120/1120 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-05-28 14:44:54] [INFO ] Deduced a trap composed of 224 places in 281 ms of which 4 ms to minimize.
[2024-05-28 14:44:55] [INFO ] Deduced a trap composed of 216 places in 321 ms of which 4 ms to minimize.
[2024-05-28 14:44:55] [INFO ] Deduced a trap composed of 202 places in 283 ms of which 4 ms to minimize.
[2024-05-28 14:44:55] [INFO ] Deduced a trap composed of 221 places in 293 ms of which 4 ms to minimize.
[2024-05-28 14:44:56] [INFO ] Deduced a trap composed of 210 places in 318 ms of which 4 ms to minimize.
[2024-05-28 14:44:59] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 3 ms to minimize.
[2024-05-28 14:45:03] [INFO ] Deduced a trap composed of 174 places in 300 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 7/77 constraints. Problems are: Problem set: 0 solved, 1120 unsolved
[2024-05-28 14:45:17] [INFO ] Deduced a trap composed of 171 places in 186 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 502/1610 variables, and 78 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/504 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1120 constraints, Known Traps: 28/28 constraints]
After SMT, in 62137ms problems are : Problem set: 0 solved, 1120 unsolved
Search for dead transitions found 0 dead transitions in 62156ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 109004 ms. Remains : 504/504 places, 1122/1122 transitions.
Built C files in :
/tmp/ltsmin13882614493249465035
[2024-05-28 14:45:23] [INFO ] Computing symmetric may disable matrix : 1122 transitions.
[2024-05-28 14:45:23] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:45:23] [INFO ] Computing symmetric may enable matrix : 1122 transitions.
[2024-05-28 14:45:23] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:45:23] [INFO ] Computing Do-Not-Accords matrix : 1122 transitions.
[2024-05-28 14:45:23] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:45:23] [INFO ] Built C files in 298ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13882614493249465035
Running compilation step : cd /tmp/ltsmin13882614493249465035;'/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/ltsmin13882614493249465035;'/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/ltsmin13882614493249465035;'/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:45:26] [INFO ] Flatten gal took : 67 ms
[2024-05-28 14:45:26] [INFO ] Flatten gal took : 53 ms
[2024-05-28 14:45:26] [INFO ] Time to serialize gal into /tmp/LTL16450407619154799628.gal : 18 ms
[2024-05-28 14:45:26] [INFO ] Time to serialize properties into /tmp/LTL6887038390695949858.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/LTL16450407619154799628.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14141764127994576895.hoa' '-atoms' '/tmp/LTL6887038390695949858.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/LTL6887038390695949858.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14141764127994576895.hoa
Detected timeout of ITS tools.
[2024-05-28 14:45:41] [INFO ] Flatten gal took : 35 ms
[2024-05-28 14:45:41] [INFO ] Flatten gal took : 34 ms
[2024-05-28 14:45:41] [INFO ] Time to serialize gal into /tmp/LTL10046662092796225307.gal : 5 ms
[2024-05-28 14:45:41] [INFO ] Time to serialize properties into /tmp/LTL4683069284165641028.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10046662092796225307.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4683069284165641028.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 : !((G((F("((((RunB_4>=1)||(RunB_5>=1))||((RunB_6>=1)||(RunB_7>=1)))||(((RunB_0>=1)||(RunB_1>=1))||((RunB_2>=1)||(RunB_3>=1))))"))&&(F("...581
Formula 0 simplified : F(G!"((((RunB_4>=1)||(RunB_5>=1))||((RunB_6>=1)||(RunB_7>=1)))||(((RunB_0>=1)||(RunB_1>=1))||((RunB_2>=1)||(RunB_3>=1))))" | G!"((((...573
Detected timeout of ITS tools.
[2024-05-28 14:45:56] [INFO ] Flatten gal took : 73 ms
[2024-05-28 14:45:56] [INFO ] Applying decomposition
[2024-05-28 14:45:56] [INFO ] Flatten gal took : 53 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4759792533854686038.txt' '-o' '/tmp/graph4759792533854686038.bin' '-w' '/tmp/graph4759792533854686038.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4759792533854686038.bin' '-l' '-1' '-v' '-w' '/tmp/graph4759792533854686038.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:45:57] [INFO ] Decomposing Gal with order
[2024-05-28 14:45:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:45:57] [INFO ] Removed a total of 712 redundant transitions.
[2024-05-28 14:45:57] [INFO ] Flatten gal took : 142 ms
[2024-05-28 14:45:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 601 labels/synchronizations in 39 ms.
[2024-05-28 14:45:57] [INFO ] Time to serialize gal into /tmp/LTL6611264780411428609.gal : 13 ms
[2024-05-28 14:45:57] [INFO ] Time to serialize properties into /tmp/LTL14366316012020238359.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6611264780411428609.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14366316012020238359.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((F("((((i9.u27.RunB_4>=1)||(i9.u28.RunB_5>=1))||((i9.u32.RunB_6>=1)||(i9.u29.RunB_7>=1)))||(((i9.u30.RunB_0>=1)||(i9.u25.RunB_1>=...785
Formula 0 simplified : F(G!"((((i9.u27.RunB_4>=1)||(i9.u28.RunB_5>=1))||((i9.u32.RunB_6>=1)||(i9.u29.RunB_7>=1)))||(((i9.u30.RunB_0>=1)||(i9.u25.RunB_1>=1)...777
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-09 finished in 423938 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)))'
Support contains 10 out of 674 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 674/674 places, 1290/1290 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 672 transition count 1290
Applied a total of 2 rules in 19 ms. Remains 672 /674 variables (removed 2) and now considering 1290/1290 (removed 0) transitions.
Running 1288 sub problems to find dead transitions.
[2024-05-28 14:46:12] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 672 cols
[2024-05-28 14:46:12] [INFO ] Computed 52 invariants in 35 ms
[2024-05-28 14:46:12] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:46:28] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 1 ms to minimize.
[2024-05-28 14:46:30] [INFO ] Deduced a trap composed of 71 places in 61 ms of which 2 ms to minimize.
[2024-05-28 14:46:30] [INFO ] Deduced a trap composed of 71 places in 62 ms of which 2 ms to minimize.
[2024-05-28 14:46:30] [INFO ] Deduced a trap composed of 71 places in 56 ms of which 1 ms to minimize.
[2024-05-28 14:46:31] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 1 ms to minimize.
[2024-05-28 14:46:31] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:46:31] [INFO ] Deduced a trap composed of 71 places in 63 ms of which 2 ms to minimize.
[2024-05-28 14:46:34] [INFO ] Deduced a trap composed of 71 places in 58 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/1946 variables, and 58 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 35/37 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:46:36] [INFO ] Deduced a trap composed of 154 places in 275 ms of which 4 ms to minimize.
[2024-05-28 14:46:37] [INFO ] Deduced a trap composed of 174 places in 242 ms of which 5 ms to minimize.
[2024-05-28 14:46:37] [INFO ] Deduced a trap composed of 315 places in 242 ms of which 5 ms to minimize.
[2024-05-28 14:46:38] [INFO ] Deduced a trap composed of 327 places in 314 ms of which 5 ms to minimize.
[2024-05-28 14:46:38] [INFO ] Deduced a trap composed of 390 places in 275 ms of which 5 ms to minimize.
[2024-05-28 14:46:39] [INFO ] Deduced a trap composed of 336 places in 319 ms of which 4 ms to minimize.
[2024-05-28 14:46:39] [INFO ] Deduced a trap composed of 372 places in 327 ms of which 5 ms to minimize.
[2024-05-28 14:46:39] [INFO ] Deduced a trap composed of 19 places in 313 ms of which 5 ms to minimize.
[2024-05-28 14:46:40] [INFO ] Deduced a trap composed of 343 places in 380 ms of which 5 ms to minimize.
[2024-05-28 14:46:40] [INFO ] Deduced a trap composed of 375 places in 403 ms of which 4 ms to minimize.
[2024-05-28 14:46:41] [INFO ] Deduced a trap composed of 348 places in 302 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/1946 variables, and 69 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 35/37 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 19/19 constraints]
After SMT, in 42250ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 42274ms
[2024-05-28 14:46:54] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 14:46:54] [INFO ] Invariant cache hit.
[2024-05-28 14:46:55] [INFO ] Implicit Places using invariants in 537 ms returned [530, 531, 532, 533, 534, 535, 536, 537]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 540 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 664/674 places, 1290/1290 transitions.
Applied a total of 0 rules in 9 ms. Remains 664 /664 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42850 ms. Remains : 664/674 places, 1290/1290 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-12
Product exploration explored 100000 steps with 1424 reset in 393 ms.
Product exploration explored 100000 steps with 1425 reset in 416 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 284 steps (0 resets) in 6 ms. (40 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 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 105 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
[2024-05-28 14:46:56] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 664 cols
[2024-05-28 14:46:56] [INFO ] Computed 44 invariants in 34 ms
[2024-05-28 14:46:57] [INFO ] [Real]Absence check using 15 positive place invariants in 23 ms returned sat
[2024-05-28 14:46:57] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 140 ms returned sat
[2024-05-28 14:46:59] [INFO ] [Real]Absence check using state equation in 1226 ms returned sat
[2024-05-28 14:46:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:47:00] [INFO ] [Nat]Absence check using 15 positive place invariants in 334 ms returned sat
[2024-05-28 14:47:00] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 149 ms returned sat
[2024-05-28 14:47:02] [INFO ] [Nat]Absence check using state equation in 1903 ms returned sat
[2024-05-28 14:47:02] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:47:03] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 14:47:04] [INFO ] [Nat]Added 96 Read/Feed constraints in 2379 ms returned sat
[2024-05-28 14:47:04] [INFO ] Deduced a trap composed of 72 places in 221 ms of which 3 ms to minimize.
[2024-05-28 14:47:06] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 1865 ms
Could not prove EG (NOT p0)
Support contains 10 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1290/1290 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 664 transition count 1234
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 608 transition count 1234
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 112 place count 608 transition count 1154
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 272 place count 528 transition count 1154
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 400 place count 464 transition count 1090
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 408 place count 456 transition count 1082
Iterating global reduction 2 with 8 rules applied. Total rules applied 416 place count 456 transition count 1082
Applied a total of 416 rules in 88 ms. Remains 456 /664 variables (removed 208) and now considering 1082/1290 (removed 208) transitions.
Running 1080 sub problems to find dead transitions.
[2024-05-28 14:47:06] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
// Phase 1: matrix 1066 rows 456 cols
[2024-05-28 14:47:06] [INFO ] Computed 44 invariants in 30 ms
[2024-05-28 14:47:06] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 14:47:15] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 2 ms to minimize.
[2024-05-28 14:47:15] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
[2024-05-28 14:47:15] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 2 ms to minimize.
[2024-05-28 14:47:15] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:47:16] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:47:16] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
[2024-05-28 14:47:16] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:47:16] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:47:16] [INFO ] Deduced a trap composed of 235 places in 277 ms of which 3 ms to minimize.
[2024-05-28 14:47:16] [INFO ] Deduced a trap composed of 185 places in 252 ms of which 3 ms to minimize.
[2024-05-28 14:47:17] [INFO ] Deduced a trap composed of 186 places in 279 ms of which 3 ms to minimize.
[2024-05-28 14:47:17] [INFO ] Deduced a trap composed of 193 places in 251 ms of which 4 ms to minimize.
[2024-05-28 14:47:17] [INFO ] Deduced a trap composed of 182 places in 247 ms of which 3 ms to minimize.
[2024-05-28 14:47:19] [INFO ] Deduced a trap composed of 33 places in 150 ms of which 2 ms to minimize.
[2024-05-28 14:47:25] [INFO ] Deduced a trap composed of 153 places in 263 ms of which 3 ms to minimize.
[2024-05-28 14:47:25] [INFO ] Deduced a trap composed of 19 places in 247 ms of which 3 ms to minimize.
[2024-05-28 14:47:25] [INFO ] Deduced a trap composed of 179 places in 256 ms of which 3 ms to minimize.
[2024-05-28 14:47:26] [INFO ] Deduced a trap composed of 167 places in 298 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1522 variables, and 60 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 14:47:34] [INFO ] Deduced a trap composed of 284 places in 254 ms of which 3 ms to minimize.
[2024-05-28 14:47:43] [INFO ] Deduced a trap composed of 151 places in 199 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1522 variables, and 62 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 20/20 constraints]
After SMT, in 42054ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 42072ms
[2024-05-28 14:47:48] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2024-05-28 14:47:48] [INFO ] Invariant cache hit.
[2024-05-28 14:47:49] [INFO ] Implicit Places using invariants in 415 ms returned []
[2024-05-28 14:47:49] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2024-05-28 14:47:49] [INFO ] Invariant cache hit.
[2024-05-28 14:47:49] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:47:53] [INFO ] Implicit Places using invariants and state equation in 4812 ms returned []
Implicit Place search using SMT with State Equation took 5231 ms to find 0 implicit places.
[2024-05-28 14:47:53] [INFO ] Redundant transitions in 10 ms returned []
Running 1080 sub problems to find dead transitions.
[2024-05-28 14:47:53] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2024-05-28 14:47:53] [INFO ] Invariant cache hit.
[2024-05-28 14:47:53] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 14:48:03] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 1 ms to minimize.
[2024-05-28 14:48:03] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:48:03] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 1 ms to minimize.
[2024-05-28 14:48:03] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 1 ms to minimize.
[2024-05-28 14:48:03] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 0 ms to minimize.
[2024-05-28 14:48:03] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:48:03] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
[2024-05-28 14:48:03] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 2 ms to minimize.
[2024-05-28 14:48:04] [INFO ] Deduced a trap composed of 168 places in 281 ms of which 4 ms to minimize.
[2024-05-28 14:48:04] [INFO ] Deduced a trap composed of 188 places in 258 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 14:48:14] [INFO ] Deduced a trap composed of 55 places in 109 ms of which 2 ms to minimize.
[2024-05-28 14:48:22] [INFO ] Deduced a trap composed of 174 places in 215 ms of which 3 ms to minimize.
[2024-05-28 14:48:22] [INFO ] Deduced a trap composed of 160 places in 230 ms of which 3 ms to minimize.
[2024-05-28 14:48:23] [INFO ] Deduced a trap composed of 191 places in 248 ms of which 3 ms to minimize.
[2024-05-28 14:48:24] [INFO ] Deduced a trap composed of 3 places in 277 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1522 variables, and 57 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 15/57 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 14:48:30] [INFO ] Deduced a trap composed of 284 places in 243 ms of which 4 ms to minimize.
[2024-05-28 14:48:30] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 1 ms to minimize.
[2024-05-28 14:48:30] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 2 ms to minimize.
[2024-05-28 14:48:30] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 2 ms to minimize.
[2024-05-28 14:48:31] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 1 ms to minimize.
[2024-05-28 14:48:31] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 1 ms to minimize.
[2024-05-28 14:48:36] [INFO ] Deduced a trap composed of 158 places in 185 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/455 variables, 1/65 constraints. Problems are: Problem set: 48 solved, 1032 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1522 variables, and 65 constraints, problems are : Problem set: 48 solved, 1032 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 22/22 constraints]
After SMT, in 61935ms problems are : Problem set: 48 solved, 1032 unsolved
Search for dead transitions found 48 dead transitions in 61949ms
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 : 456/664 places, 1034/1290 transitions.
Applied a total of 0 rules in 30 ms. Remains 456 /456 variables (removed 0) and now considering 1034/1034 (removed 0) transitions.
[2024-05-28 14:48:55] [INFO ] Redundant transitions in 15 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 109424 ms. Remains : 456/664 places, 1034/1290 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 107 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 87 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 160 steps (0 resets) in 5 ms. (26 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 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
[2024-05-28 14:48:56] [INFO ] Flow matrix only has 1018 transitions (discarded 16 similar events)
// Phase 1: matrix 1018 rows 456 cols
[2024-05-28 14:48:56] [INFO ] Computed 44 invariants in 32 ms
[2024-05-28 14:48:56] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-05-28 14:48:57] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 100 ms returned sat
[2024-05-28 14:48:58] [INFO ] [Real]Absence check using state equation in 1281 ms returned sat
[2024-05-28 14:48:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:48:59] [INFO ] [Nat]Absence check using 15 positive place invariants in 16 ms returned sat
[2024-05-28 14:48:59] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 96 ms returned sat
[2024-05-28 14:49:00] [INFO ] [Nat]Absence check using state equation in 1434 ms returned sat
[2024-05-28 14:49:00] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:49:00] [INFO ] [Nat]Added 96 Read/Feed constraints in 264 ms returned sat
[2024-05-28 14:49:01] [INFO ] Deduced a trap composed of 32 places in 194 ms of which 3 ms to minimize.
[2024-05-28 14:49:01] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:49:01] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 1 ms to minimize.
[2024-05-28 14:49:01] [INFO ] Deduced a trap composed of 47 places in 86 ms of which 1 ms to minimize.
[2024-05-28 14:49:01] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:49:02] [INFO ] Deduced a trap composed of 87 places in 246 ms of which 3 ms to minimize.
[2024-05-28 14:49:02] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 1 ms to minimize.
[2024-05-28 14:49:02] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:49:02] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2165 ms
[2024-05-28 14:49:03] [INFO ] Computed and/alt/rep : 472/1949/464 causal constraints (skipped 552 transitions) in 141 ms.
[2024-05-28 14:49:05] [INFO ] Added : 135 causal constraints over 27 iterations in 2605 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2282 reset in 445 ms.
Product exploration explored 100000 steps with 2288 reset in 412 ms.
Built C files in :
/tmp/ltsmin4272440260803578285
[2024-05-28 14:49:06] [INFO ] Computing symmetric may disable matrix : 1034 transitions.
[2024-05-28 14:49:06] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:49:06] [INFO ] Computing symmetric may enable matrix : 1034 transitions.
[2024-05-28 14:49:06] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:49:06] [INFO ] Computing Do-Not-Accords matrix : 1034 transitions.
[2024-05-28 14:49:06] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:49:06] [INFO ] Built C files in 272ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4272440260803578285
Running compilation step : cd /tmp/ltsmin4272440260803578285;'/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/ltsmin4272440260803578285;'/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/ltsmin4272440260803578285;'/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 456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 456/456 places, 1034/1034 transitions.
Applied a total of 0 rules in 11 ms. Remains 456 /456 variables (removed 0) and now considering 1034/1034 (removed 0) transitions.
Running 1032 sub problems to find dead transitions.
[2024-05-28 14:49:09] [INFO ] Flow matrix only has 1018 transitions (discarded 16 similar events)
[2024-05-28 14:49:09] [INFO ] Invariant cache hit.
[2024-05-28 14:49:09] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
[2024-05-28 14:49:17] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 2 ms to minimize.
[2024-05-28 14:49:17] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-05-28 14:49:17] [INFO ] Deduced a trap composed of 46 places in 32 ms of which 0 ms to minimize.
[2024-05-28 14:49:17] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 1 ms to minimize.
[2024-05-28 14:49:17] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 0 ms to minimize.
[2024-05-28 14:49:17] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-05-28 14:49:17] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
[2024-05-28 14:49:18] [INFO ] Deduced a trap composed of 180 places in 248 ms of which 3 ms to minimize.
[2024-05-28 14:49:18] [INFO ] Deduced a trap composed of 178 places in 223 ms of which 4 ms to minimize.
[2024-05-28 14:49:18] [INFO ] Deduced a trap composed of 154 places in 258 ms of which 3 ms to minimize.
[2024-05-28 14:49:18] [INFO ] Deduced a trap composed of 168 places in 228 ms of which 4 ms to minimize.
[2024-05-28 14:49:19] [INFO ] Deduced a trap composed of 160 places in 246 ms of which 3 ms to minimize.
[2024-05-28 14:49:19] [INFO ] Deduced a trap composed of 160 places in 246 ms of which 3 ms to minimize.
[2024-05-28 14:49:19] [INFO ] Deduced a trap composed of 169 places in 249 ms of which 3 ms to minimize.
[2024-05-28 14:49:19] [INFO ] Deduced a trap composed of 178 places in 210 ms of which 3 ms to minimize.
[2024-05-28 14:49:19] [INFO ] Deduced a trap composed of 201 places in 180 ms of which 2 ms to minimize.
[2024-05-28 14:49:20] [INFO ] Deduced a trap composed of 155 places in 225 ms of which 3 ms to minimize.
[2024-05-28 14:49:20] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1474 variables, and 60 constraints, problems are : Problem set: 0 solved, 1032 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1032/1032 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1032 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
[2024-05-28 14:49:33] [INFO ] Deduced a trap composed of 187 places in 255 ms of which 3 ms to minimize.
[2024-05-28 14:49:33] [INFO ] Deduced a trap composed of 146 places in 234 ms of which 3 ms to minimize.
[2024-05-28 14:49:42] [INFO ] Deduced a trap composed of 44 places in 126 ms of which 3 ms to minimize.
[2024-05-28 14:49:44] [INFO ] Deduced a trap composed of 158 places in 173 ms of which 3 ms to minimize.
[2024-05-28 14:49:44] [INFO ] Deduced a trap composed of 161 places in 162 ms of which 3 ms to minimize.
[2024-05-28 14:49:45] [INFO ] Deduced a trap composed of 72 places in 202 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
[2024-05-28 14:49:46] [INFO ] Deduced a trap composed of 175 places in 198 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1474 variables, and 67 constraints, problems are : Problem set: 0 solved, 1032 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1032 constraints, Known Traps: 25/25 constraints]
After SMT, in 41576ms problems are : Problem set: 0 solved, 1032 unsolved
Search for dead transitions found 0 dead transitions in 41585ms
[2024-05-28 14:49:51] [INFO ] Flow matrix only has 1018 transitions (discarded 16 similar events)
[2024-05-28 14:49:51] [INFO ] Invariant cache hit.
[2024-05-28 14:49:51] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-05-28 14:49:51] [INFO ] Flow matrix only has 1018 transitions (discarded 16 similar events)
[2024-05-28 14:49:51] [INFO ] Invariant cache hit.
[2024-05-28 14:49:52] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:50:10] [INFO ] Implicit Places using invariants and state equation in 18680 ms returned []
Implicit Place search using SMT with State Equation took 19026 ms to find 0 implicit places.
[2024-05-28 14:50:10] [INFO ] Redundant transitions in 18 ms returned []
Running 1032 sub problems to find dead transitions.
[2024-05-28 14:50:10] [INFO ] Flow matrix only has 1018 transitions (discarded 16 similar events)
[2024-05-28 14:50:10] [INFO ] Invariant cache hit.
[2024-05-28 14:50:10] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
[2024-05-28 14:50:18] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 1 ms to minimize.
[2024-05-28 14:50:18] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 1 ms to minimize.
[2024-05-28 14:50:18] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 1 ms to minimize.
[2024-05-28 14:50:18] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:50:18] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 0 ms to minimize.
[2024-05-28 14:50:18] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 0 ms to minimize.
[2024-05-28 14:50:18] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 1 ms to minimize.
[2024-05-28 14:50:18] [INFO ] Deduced a trap composed of 180 places in 182 ms of which 2 ms to minimize.
[2024-05-28 14:50:19] [INFO ] Deduced a trap composed of 178 places in 178 ms of which 3 ms to minimize.
[2024-05-28 14:50:19] [INFO ] Deduced a trap composed of 154 places in 162 ms of which 2 ms to minimize.
[2024-05-28 14:50:19] [INFO ] Deduced a trap composed of 168 places in 179 ms of which 3 ms to minimize.
[2024-05-28 14:50:19] [INFO ] Deduced a trap composed of 160 places in 163 ms of which 2 ms to minimize.
[2024-05-28 14:50:19] [INFO ] Deduced a trap composed of 160 places in 168 ms of which 3 ms to minimize.
[2024-05-28 14:50:20] [INFO ] Deduced a trap composed of 169 places in 172 ms of which 2 ms to minimize.
[2024-05-28 14:50:20] [INFO ] Deduced a trap composed of 178 places in 161 ms of which 2 ms to minimize.
[2024-05-28 14:50:20] [INFO ] Deduced a trap composed of 201 places in 162 ms of which 2 ms to minimize.
[2024-05-28 14:50:20] [INFO ] Deduced a trap composed of 155 places in 159 ms of which 3 ms to minimize.
[2024-05-28 14:50:20] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
[2024-05-28 14:50:37] [INFO ] Deduced a trap composed of 51 places in 239 ms of which 3 ms to minimize.
[2024-05-28 14:50:37] [INFO ] Deduced a trap composed of 146 places in 229 ms of which 3 ms to minimize.
[2024-05-28 14:50:37] [INFO ] Deduced a trap composed of 158 places in 184 ms of which 2 ms to minimize.
[2024-05-28 14:50:38] [INFO ] Deduced a trap composed of 284 places in 253 ms of which 4 ms to minimize.
[2024-05-28 14:50:38] [INFO ] Deduced a trap composed of 294 places in 274 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")
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1474 variables, and 65 constraints, problems are : Problem set: 0 solved, 1032 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1032/1032 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1032 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 23/65 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
[2024-05-28 14:50:44] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 2 ms to minimize.
[2024-05-28 14:50:55] [INFO ] Deduced a trap composed of 167 places in 169 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
[2024-05-28 14:50:59] [INFO ] Deduced a trap composed of 196 places in 227 ms of which 4 ms to minimize.
[2024-05-28 14:51:11] [INFO ] Deduced a trap composed of 40 places in 198 ms of which 2 ms to minimize.
[2024-05-28 14:51:11] [INFO ] Deduced a trap composed of 77 places in 150 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1474 variables, and 70 constraints, problems are : Problem set: 0 solved, 1032 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1032 constraints, Known Traps: 28/28 constraints]
After SMT, in 61725ms problems are : Problem set: 0 solved, 1032 unsolved
Search for dead transitions found 0 dead transitions in 61741ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 122406 ms. Remains : 456/456 places, 1034/1034 transitions.
Built C files in :
/tmp/ltsmin4818926363549802383
[2024-05-28 14:51:12] [INFO ] Computing symmetric may disable matrix : 1034 transitions.
[2024-05-28 14:51:12] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:51:12] [INFO ] Computing symmetric may enable matrix : 1034 transitions.
[2024-05-28 14:51:12] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:51:12] [INFO ] Computing Do-Not-Accords matrix : 1034 transitions.
[2024-05-28 14:51:12] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:51:12] [INFO ] Built C files in 160ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4818926363549802383
Running compilation step : cd /tmp/ltsmin4818926363549802383;'/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/ltsmin4818926363549802383;'/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/ltsmin4818926363549802383;'/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:51:15] [INFO ] Flatten gal took : 55 ms
[2024-05-28 14:51:15] [INFO ] Flatten gal took : 60 ms
[2024-05-28 14:51:15] [INFO ] Time to serialize gal into /tmp/LTL13411184560746128813.gal : 8 ms
[2024-05-28 14:51:15] [INFO ] Time to serialize properties into /tmp/LTL5496029280641458851.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/LTL13411184560746128813.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14347279360068487538.hoa' '-atoms' '/tmp/LTL5496029280641458851.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/LTL5496029280641458851.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14347279360068487538.hoa
Detected timeout of ITS tools.
[2024-05-28 14:51:30] [INFO ] Flatten gal took : 123 ms
[2024-05-28 14:51:30] [INFO ] Flatten gal took : 57 ms
[2024-05-28 14:51:30] [INFO ] Time to serialize gal into /tmp/LTL15613838489680914404.gal : 6 ms
[2024-05-28 14:51:30] [INFO ] Time to serialize properties into /tmp/LTL1895019202598439852.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15613838489680914404.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1895019202598439852.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F("((((((cJobCnt>=10)&&(P_1617_4>=1))&&(cIdleTasks>=1))||(((cJobCnt>=10)&&(P_1617_7>=1))&&(cIdleTasks>=1)))||((((cJobCnt>=10)&&(P...454
Formula 0 simplified : XG!"((((((cJobCnt>=10)&&(P_1617_4>=1))&&(cIdleTasks>=1))||(((cJobCnt>=10)&&(P_1617_7>=1))&&(cIdleTasks>=1)))||((((cJobCnt>=10)&&(P_1...448
Detected timeout of ITS tools.
[2024-05-28 14:51:46] [INFO ] Flatten gal took : 63 ms
[2024-05-28 14:51:46] [INFO ] Applying decomposition
[2024-05-28 14:51:46] [INFO ] Flatten gal took : 48 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/graph3292465076967677492.txt' '-o' '/tmp/graph3292465076967677492.bin' '-w' '/tmp/graph3292465076967677492.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3292465076967677492.bin' '-l' '-1' '-v' '-w' '/tmp/graph3292465076967677492.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:51:46] [INFO ] Decomposing Gal with order
[2024-05-28 14:51:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:51:46] [INFO ] Removed a total of 1126 redundant transitions.
[2024-05-28 14:51:46] [INFO ] Flatten gal took : 83 ms
[2024-05-28 14:51:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 602 labels/synchronizations in 43 ms.
[2024-05-28 14:51:46] [INFO ] Time to serialize gal into /tmp/LTL6961714665248049340.gal : 9 ms
[2024-05-28 14:51:46] [INFO ] Time to serialize properties into /tmp/LTL16955366798786584733.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/LTL6961714665248049340.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16955366798786584733.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F("((((((i9.i0.u0.cJobCnt>=10)&&(i3.u21.P_1617_4>=1))&&(i9.i1.u39.cIdleTasks>=1))||(((i9.i0.u0.cJobCnt>=10)&&(i3.u24.P_1617_7>=1)...662
Formula 0 simplified : XG!"((((((i9.i0.u0.cJobCnt>=10)&&(i3.u21.P_1617_4>=1))&&(i9.i1.u39.cIdleTasks>=1))||(((i9.i0.u0.cJobCnt>=10)&&(i3.u24.P_1617_7>=1))&...656
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-12 finished in 349053 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 56 out of 674 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 674/674 places, 1290/1290 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 672 transition count 1290
Applied a total of 2 rules in 7 ms. Remains 672 /674 variables (removed 2) and now considering 1290/1290 (removed 0) transitions.
Running 1288 sub problems to find dead transitions.
[2024-05-28 14:52:01] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 672 cols
[2024-05-28 14:52:01] [INFO ] Computed 52 invariants in 33 ms
[2024-05-28 14:52:01] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:52:17] [INFO ] Deduced a trap composed of 71 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:52:19] [INFO ] Deduced a trap composed of 71 places in 75 ms of which 1 ms to minimize.
[2024-05-28 14:52:19] [INFO ] Deduced a trap composed of 71 places in 77 ms of which 2 ms to minimize.
[2024-05-28 14:52:19] [INFO ] Deduced a trap composed of 71 places in 64 ms of which 0 ms to minimize.
[2024-05-28 14:52:20] [INFO ] Deduced a trap composed of 71 places in 56 ms of which 1 ms to minimize.
[2024-05-28 14:52:20] [INFO ] Deduced a trap composed of 71 places in 63 ms of which 1 ms to minimize.
[2024-05-28 14:52:20] [INFO ] Deduced a trap composed of 71 places in 61 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/1946 variables, and 57 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20052 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 35/37 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:52:25] [INFO ] Deduced a trap composed of 154 places in 301 ms of which 5 ms to minimize.
[2024-05-28 14:52:25] [INFO ] Deduced a trap composed of 183 places in 292 ms of which 18 ms to minimize.
[2024-05-28 14:52:25] [INFO ] Deduced a trap composed of 186 places in 252 ms of which 4 ms to minimize.
[2024-05-28 14:52:26] [INFO ] Deduced a trap composed of 159 places in 249 ms of which 3 ms to minimize.
[2024-05-28 14:52:26] [INFO ] Deduced a trap composed of 71 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:52:26] [INFO ] Deduced a trap composed of 329 places in 309 ms of which 4 ms to minimize.
[2024-05-28 14:52:27] [INFO ] Deduced a trap composed of 391 places in 301 ms of which 4 ms to minimize.
[2024-05-28 14:52:27] [INFO ] Deduced a trap composed of 365 places in 367 ms of which 5 ms to minimize.
[2024-05-28 14:52:34] [INFO ] Deduced a trap composed of 19 places in 193 ms of which 3 ms to minimize.
[2024-05-28 14:52:40] [INFO ] Deduced a trap composed of 325 places in 352 ms of which 5 ms to minimize.
[2024-05-28 14:52:41] [INFO ] Deduced a trap composed of 326 places in 267 ms of which 4 ms to minimize.
[2024-05-28 14:52:42] [INFO ] Deduced a trap composed of 59 places in 367 ms of which 4 ms to minimize.
[2024-05-28 14:52:43] [INFO ] Deduced a trap composed of 210 places in 388 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/1946 variables, and 70 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 35/37 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 20/20 constraints]
After SMT, in 41746ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 41760ms
[2024-05-28 14:52:43] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 14:52:43] [INFO ] Invariant cache hit.
[2024-05-28 14:52:43] [INFO ] Implicit Places using invariants in 545 ms returned [530, 531, 532, 533, 534, 535, 536, 537]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 549 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 664/674 places, 1290/1290 transitions.
Applied a total of 0 rules in 8 ms. Remains 664 /664 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42329 ms. Remains : 664/674 places, 1290/1290 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-14
Entered a terminal (fully accepting) state of product in 33 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-14 finished in 42458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(F(p1))||p0))))'
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(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' '!(X(F(p0)))'
Found a Shortening insensitive property : PolyORBLF-COL-S02J06T08-LTLFireability-12
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Support contains 10 out of 674 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 674/674 places, 1290/1290 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 672 transition count 1234
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 616 transition count 1234
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 112 place count 616 transition count 1154
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 272 place count 536 transition count 1154
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 400 place count 472 transition count 1090
Applied a total of 400 rules in 60 ms. Remains 472 /674 variables (removed 202) and now considering 1090/1290 (removed 200) transitions.
Running 1088 sub problems to find dead transitions.
[2024-05-28 14:52:44] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
// Phase 1: matrix 1074 rows 472 cols
[2024-05-28 14:52:44] [INFO ] Computed 52 invariants in 34 ms
[2024-05-28 14:52:44] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
[2024-05-28 14:52:53] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 2 ms to minimize.
[2024-05-28 14:52:53] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 1 ms to minimize.
[2024-05-28 14:52:53] [INFO ] Deduced a trap composed of 46 places in 76 ms of which 1 ms to minimize.
[2024-05-28 14:52:53] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 2 ms to minimize.
[2024-05-28 14:52:53] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-05-28 14:52:53] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-05-28 14:52:54] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:52:54] [INFO ] Deduced a trap composed of 181 places in 271 ms of which 3 ms to minimize.
[2024-05-28 14:52:54] [INFO ] Deduced a trap composed of 169 places in 298 ms of which 3 ms to minimize.
[2024-05-28 14:52:54] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:53:03] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 2 ms to minimize.
[2024-05-28 14:53:03] [INFO ] Deduced a trap composed of 158 places in 244 ms of which 3 ms to minimize.
[2024-05-28 14:53:04] [INFO ] Deduced a trap composed of 220 places in 218 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/470 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
[2024-05-28 14:53:05] [INFO ] Deduced a trap composed of 219 places in 258 ms of which 4 ms to minimize.
[2024-05-28 14:53:06] [INFO ] Deduced a trap composed of 37 places in 215 ms of which 2 ms to minimize.
[2024-05-28 14:53:06] [INFO ] Deduced a trap composed of 36 places in 246 ms of which 3 ms to minimize.
[2024-05-28 14:53:06] [INFO ] Deduced a trap composed of 36 places in 232 ms of which 3 ms to minimize.
SMT process timed out in 22131ms, After SMT, problems are : Problem set: 0 solved, 1088 unsolved
Search for dead transitions found 0 dead transitions in 22149ms
[2024-05-28 14:53:06] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2024-05-28 14:53:06] [INFO ] Invariant cache hit.
[2024-05-28 14:53:07] [INFO ] Implicit Places using invariants in 380 ms returned [426, 427, 428, 429, 430, 431, 432, 433]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 394 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 464/674 places, 1090/1290 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 456 transition count 1082
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 456 transition count 1082
Applied a total of 16 rules in 38 ms. Remains 456 /464 variables (removed 8) and now considering 1082/1090 (removed 8) transitions.
[2024-05-28 14:53:07] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
// Phase 1: matrix 1066 rows 456 cols
[2024-05-28 14:53:07] [INFO ] Computed 44 invariants in 25 ms
[2024-05-28 14:53:07] [INFO ] Implicit Places using invariants in 374 ms returned []
[2024-05-28 14:53:07] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2024-05-28 14:53:07] [INFO ] Invariant cache hit.
[2024-05-28 14:53:07] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:53:11] [INFO ] Implicit Places using invariants and state equation in 4178 ms returned []
Implicit Place search using SMT with State Equation took 4555 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 456/674 places, 1082/1290 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 27205 ms. Remains : 456/674 places, 1082/1290 transitions.
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-12
Product exploration explored 100000 steps with 2301 reset in 464 ms.
Product exploration explored 100000 steps with 2300 reset in 446 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 176 steps (0 resets) in 5 ms. (29 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 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
[2024-05-28 14:53:13] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2024-05-28 14:53:13] [INFO ] Invariant cache hit.
[2024-05-28 14:53:13] [INFO ] [Real]Absence check using 15 positive place invariants in 12 ms returned sat
[2024-05-28 14:53:13] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 108 ms returned sat
[2024-05-28 14:53:14] [INFO ] [Real]Absence check using state equation in 950 ms returned sat
[2024-05-28 14:53:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:53:15] [INFO ] [Nat]Absence check using 15 positive place invariants in 12 ms returned sat
[2024-05-28 14:53:15] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 75 ms returned sat
[2024-05-28 14:53:17] [INFO ] [Nat]Absence check using state equation in 1797 ms returned sat
[2024-05-28 14:53:17] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:53:17] [INFO ] [Nat]Added 96 Read/Feed constraints in 366 ms returned sat
[2024-05-28 14:53:17] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 1 ms to minimize.
[2024-05-28 14:53:17] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 2 ms to minimize.
[2024-05-28 14:53:17] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:53:18] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2024-05-28 14:53:18] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 0 ms to minimize.
[2024-05-28 14:53:18] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 0 ms to minimize.
[2024-05-28 14:53:19] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1621 ms
[2024-05-28 14:53:19] [INFO ] Computed and/alt/rep : 408/1453/400 causal constraints (skipped 664 transitions) in 75 ms.
[2024-05-28 14:53:21] [INFO ] Added : 117 causal constraints over 24 iterations in 1982 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 10 out of 456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 456/456 places, 1082/1082 transitions.
Applied a total of 0 rules in 16 ms. Remains 456 /456 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
Running 1080 sub problems to find dead transitions.
[2024-05-28 14:53:21] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2024-05-28 14:53:21] [INFO ] Invariant cache hit.
[2024-05-28 14:53:21] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 14:53:29] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 1 ms to minimize.
[2024-05-28 14:53:29] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:53:29] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
[2024-05-28 14:53:29] [INFO ] Deduced a trap composed of 46 places in 249 ms of which 1 ms to minimize.
[2024-05-28 14:53:29] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 0 ms to minimize.
[2024-05-28 14:53:29] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 0 ms to minimize.
[2024-05-28 14:53:29] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:53:30] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 0 ms to minimize.
[2024-05-28 14:53:30] [INFO ] Deduced a trap composed of 168 places in 205 ms of which 2 ms to minimize.
[2024-05-28 14:53:30] [INFO ] Deduced a trap composed of 188 places in 213 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 14:53:39] [INFO ] Deduced a trap composed of 55 places in 110 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1522 variables, and 53 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 14:53:47] [INFO ] Deduced a trap composed of 62 places in 115 ms of which 1 ms to minimize.
[2024-05-28 14:53:47] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2024-05-28 14:53:52] [INFO ] Deduced a trap composed of 158 places in 178 ms of which 3 ms to minimize.
[2024-05-28 14:53:53] [INFO ] Deduced a trap composed of 122 places in 188 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 14:53:56] [INFO ] Deduced a trap composed of 284 places in 180 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1522 variables, and 58 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 16/16 constraints]
After SMT, in 41920ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 41933ms
[2024-05-28 14:54:03] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2024-05-28 14:54:03] [INFO ] Invariant cache hit.
[2024-05-28 14:54:03] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-28 14:54:03] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2024-05-28 14:54:03] [INFO ] Invariant cache hit.
[2024-05-28 14:54:03] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:54:07] [INFO ] Implicit Places using invariants and state equation in 4240 ms returned []
Implicit Place search using SMT with State Equation took 4576 ms to find 0 implicit places.
[2024-05-28 14:54:07] [INFO ] Redundant transitions in 7 ms returned []
Running 1080 sub problems to find dead transitions.
[2024-05-28 14:54:07] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2024-05-28 14:54:07] [INFO ] Invariant cache hit.
[2024-05-28 14:54:07] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 14:54:16] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 1 ms to minimize.
[2024-05-28 14:54:16] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 1 ms to minimize.
[2024-05-28 14:54:16] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 8 ms to minimize.
[2024-05-28 14:54:16] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
[2024-05-28 14:54:16] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
[2024-05-28 14:54:16] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 1 ms to minimize.
[2024-05-28 14:54:16] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
[2024-05-28 14:54:17] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:54:17] [INFO ] Deduced a trap composed of 168 places in 211 ms of which 2 ms to minimize.
[2024-05-28 14:54:17] [INFO ] Deduced a trap composed of 188 places in 189 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 14:54:26] [INFO ] Deduced a trap composed of 55 places in 150 ms of which 1 ms to minimize.
[2024-05-28 14:54:32] [INFO ] Deduced a trap composed of 174 places in 178 ms of which 2 ms to minimize.
[2024-05-28 14:54:33] [INFO ] Deduced a trap composed of 160 places in 170 ms of which 2 ms to minimize.
[2024-05-28 14:54:33] [INFO ] Deduced a trap composed of 191 places in 166 ms of which 3 ms to minimize.
[2024-05-28 14:54:34] [INFO ] Deduced a trap composed of 3 places in 171 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")
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1522 variables, and 57 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 15/57 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 14:54:43] [INFO ] Deduced a trap composed of 284 places in 164 ms of which 2 ms to minimize.
[2024-05-28 14:54:43] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 1 ms to minimize.
[2024-05-28 14:54:43] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 1 ms to minimize.
[2024-05-28 14:54:44] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 1 ms to minimize.
[2024-05-28 14:54:44] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-05-28 14:54:44] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
[2024-05-28 14:54:49] [INFO ] Deduced a trap composed of 158 places in 169 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/455 variables, 1/65 constraints. Problems are: Problem set: 48 solved, 1032 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1522 variables, and 65 constraints, problems are : Problem set: 48 solved, 1032 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 22/22 constraints]
After SMT, in 62008ms problems are : Problem set: 48 solved, 1032 unsolved
Search for dead transitions found 48 dead transitions in 62017ms
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 : 456/456 places, 1034/1082 transitions.
Applied a total of 0 rules in 12 ms. Remains 456 /456 variables (removed 0) and now considering 1034/1034 (removed 0) transitions.
[2024-05-28 14:55:09] [INFO ] Redundant transitions in 6 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 108596 ms. Remains : 456/456 places, 1034/1082 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 56 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 45 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 161 steps (0 resets) in 5 ms. (26 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 63 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
[2024-05-28 14:55:09] [INFO ] Flow matrix only has 1018 transitions (discarded 16 similar events)
// Phase 1: matrix 1018 rows 456 cols
[2024-05-28 14:55:10] [INFO ] Computed 44 invariants in 13 ms
[2024-05-28 14:55:10] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-05-28 14:55:10] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 98 ms returned sat
[2024-05-28 14:55:11] [INFO ] [Real]Absence check using state equation in 955 ms returned sat
[2024-05-28 14:55:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:55:12] [INFO ] [Nat]Absence check using 15 positive place invariants in 14 ms returned sat
[2024-05-28 14:55:12] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 95 ms returned sat
[2024-05-28 14:55:13] [INFO ] [Nat]Absence check using state equation in 1277 ms returned sat
[2024-05-28 14:55:13] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:55:13] [INFO ] [Nat]Added 96 Read/Feed constraints in 275 ms returned sat
[2024-05-28 14:55:13] [INFO ] Deduced a trap composed of 32 places in 222 ms of which 3 ms to minimize.
[2024-05-28 14:55:14] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 1 ms to minimize.
[2024-05-28 14:55:14] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 2 ms to minimize.
[2024-05-28 14:55:14] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 2 ms to minimize.
[2024-05-28 14:55:14] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 1 ms to minimize.
[2024-05-28 14:55:15] [INFO ] Deduced a trap composed of 87 places in 239 ms of which 3 ms to minimize.
[2024-05-28 14:55:15] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 1 ms to minimize.
[2024-05-28 14:55:15] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:55:15] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2210 ms
[2024-05-28 14:55:16] [INFO ] Computed and/alt/rep : 472/1949/464 causal constraints (skipped 552 transitions) in 92 ms.
[2024-05-28 14:55:18] [INFO ] Added : 135 causal constraints over 27 iterations in 2678 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2308 reset in 419 ms.
Product exploration explored 100000 steps with 2297 reset in 401 ms.
Built C files in :
/tmp/ltsmin13775012272998909097
[2024-05-28 14:55:19] [INFO ] Computing symmetric may disable matrix : 1034 transitions.
[2024-05-28 14:55:19] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:55:19] [INFO ] Computing symmetric may enable matrix : 1034 transitions.
[2024-05-28 14:55:19] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:55:19] [INFO ] Computing Do-Not-Accords matrix : 1034 transitions.
[2024-05-28 14:55:19] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:55:19] [INFO ] Built C files in 275ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13775012272998909097
Running compilation step : cd /tmp/ltsmin13775012272998909097;'/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/ltsmin13775012272998909097;'/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/ltsmin13775012272998909097;'/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 456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 456/456 places, 1034/1034 transitions.
Applied a total of 0 rules in 11 ms. Remains 456 /456 variables (removed 0) and now considering 1034/1034 (removed 0) transitions.
Running 1032 sub problems to find dead transitions.
[2024-05-28 14:55:22] [INFO ] Flow matrix only has 1018 transitions (discarded 16 similar events)
[2024-05-28 14:55:22] [INFO ] Invariant cache hit.
[2024-05-28 14:55:22] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
[2024-05-28 14:55:30] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
[2024-05-28 14:55:30] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-05-28 14:55:30] [INFO ] Deduced a trap composed of 46 places in 32 ms of which 1 ms to minimize.
[2024-05-28 14:55:30] [INFO ] Deduced a trap composed of 46 places in 32 ms of which 1 ms to minimize.
[2024-05-28 14:55:30] [INFO ] Deduced a trap composed of 46 places in 32 ms of which 1 ms to minimize.
[2024-05-28 14:55:30] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:55:31] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
[2024-05-28 14:55:31] [INFO ] Deduced a trap composed of 180 places in 246 ms of which 4 ms to minimize.
[2024-05-28 14:55:31] [INFO ] Deduced a trap composed of 178 places in 211 ms of which 3 ms to minimize.
[2024-05-28 14:55:31] [INFO ] Deduced a trap composed of 154 places in 218 ms of which 3 ms to minimize.
[2024-05-28 14:55:32] [INFO ] Deduced a trap composed of 168 places in 265 ms of which 3 ms to minimize.
[2024-05-28 14:55:32] [INFO ] Deduced a trap composed of 160 places in 220 ms of which 3 ms to minimize.
[2024-05-28 14:55:32] [INFO ] Deduced a trap composed of 160 places in 218 ms of which 3 ms to minimize.
[2024-05-28 14:55:32] [INFO ] Deduced a trap composed of 169 places in 212 ms of which 4 ms to minimize.
[2024-05-28 14:55:33] [INFO ] Deduced a trap composed of 178 places in 158 ms of which 3 ms to minimize.
[2024-05-28 14:55:33] [INFO ] Deduced a trap composed of 201 places in 224 ms of which 3 ms to minimize.
[2024-05-28 14:55:33] [INFO ] Deduced a trap composed of 155 places in 202 ms of which 3 ms to minimize.
[2024-05-28 14:55:33] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1474 variables, and 60 constraints, problems are : Problem set: 0 solved, 1032 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1032/1032 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1032 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
[2024-05-28 14:55:45] [INFO ] Deduced a trap composed of 187 places in 315 ms of which 3 ms to minimize.
[2024-05-28 14:55:46] [INFO ] Deduced a trap composed of 146 places in 260 ms of which 3 ms to minimize.
[2024-05-28 14:55:53] [INFO ] Deduced a trap composed of 44 places in 177 ms of which 3 ms to minimize.
[2024-05-28 14:55:55] [INFO ] Deduced a trap composed of 158 places in 173 ms of which 2 ms to minimize.
[2024-05-28 14:55:56] [INFO ] Deduced a trap composed of 161 places in 238 ms of which 3 ms to minimize.
[2024-05-28 14:55:57] [INFO ] Deduced a trap composed of 72 places in 267 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
[2024-05-28 14:55:59] [INFO ] Deduced a trap composed of 175 places in 235 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1474 variables, and 67 constraints, problems are : Problem set: 0 solved, 1032 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1032 constraints, Known Traps: 25/25 constraints]
After SMT, in 41262ms problems are : Problem set: 0 solved, 1032 unsolved
Search for dead transitions found 0 dead transitions in 41272ms
[2024-05-28 14:56:04] [INFO ] Flow matrix only has 1018 transitions (discarded 16 similar events)
[2024-05-28 14:56:04] [INFO ] Invariant cache hit.
[2024-05-28 14:56:04] [INFO ] Implicit Places using invariants in 460 ms returned []
[2024-05-28 14:56:04] [INFO ] Flow matrix only has 1018 transitions (discarded 16 similar events)
[2024-05-28 14:56:04] [INFO ] Invariant cache hit.
[2024-05-28 14:56:05] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:56:22] [INFO ] Implicit Places using invariants and state equation in 18122 ms returned []
Implicit Place search using SMT with State Equation took 18585 ms to find 0 implicit places.
[2024-05-28 14:56:22] [INFO ] Redundant transitions in 7 ms returned []
Running 1032 sub problems to find dead transitions.
[2024-05-28 14:56:22] [INFO ] Flow matrix only has 1018 transitions (discarded 16 similar events)
[2024-05-28 14:56:22] [INFO ] Invariant cache hit.
[2024-05-28 14:56:22] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
[2024-05-28 14:56:30] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 2 ms to minimize.
[2024-05-28 14:56:30] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 1 ms to minimize.
[2024-05-28 14:56:30] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-05-28 14:56:30] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-05-28 14:56:30] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 0 ms to minimize.
[2024-05-28 14:56:31] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 0 ms to minimize.
[2024-05-28 14:56:31] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:56:31] [INFO ] Deduced a trap composed of 180 places in 191 ms of which 3 ms to minimize.
[2024-05-28 14:56:31] [INFO ] Deduced a trap composed of 178 places in 205 ms of which 3 ms to minimize.
[2024-05-28 14:56:31] [INFO ] Deduced a trap composed of 154 places in 207 ms of which 3 ms to minimize.
[2024-05-28 14:56:32] [INFO ] Deduced a trap composed of 168 places in 191 ms of which 2 ms to minimize.
[2024-05-28 14:56:32] [INFO ] Deduced a trap composed of 160 places in 172 ms of which 2 ms to minimize.
[2024-05-28 14:56:32] [INFO ] Deduced a trap composed of 160 places in 235 ms of which 3 ms to minimize.
[2024-05-28 14:56:32] [INFO ] Deduced a trap composed of 169 places in 212 ms of which 3 ms to minimize.
[2024-05-28 14:56:32] [INFO ] Deduced a trap composed of 178 places in 167 ms of which 2 ms to minimize.
[2024-05-28 14:56:33] [INFO ] Deduced a trap composed of 201 places in 163 ms of which 3 ms to minimize.
[2024-05-28 14:56:33] [INFO ] Deduced a trap composed of 155 places in 238 ms of which 3 ms to minimize.
[2024-05-28 14:56:33] [INFO ] Deduced a trap composed of 46 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
[2024-05-28 14:56:47] [INFO ] Deduced a trap composed of 51 places in 159 ms of which 3 ms to minimize.
[2024-05-28 14:56:47] [INFO ] Deduced a trap composed of 146 places in 227 ms of which 3 ms to minimize.
[2024-05-28 14:56:47] [INFO ] Deduced a trap composed of 158 places in 200 ms of which 2 ms to minimize.
[2024-05-28 14:56:48] [INFO ] Deduced a trap composed of 284 places in 244 ms of which 3 ms to minimize.
[2024-05-28 14:56:48] [INFO ] Deduced a trap composed of 294 places in 239 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1474 variables, and 65 constraints, problems are : Problem set: 0 solved, 1032 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1032/1032 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1032 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 23/65 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
[2024-05-28 14:56:56] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 3 ms to minimize.
[2024-05-28 14:57:10] [INFO ] Deduced a trap composed of 167 places in 266 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
[2024-05-28 14:57:14] [INFO ] Deduced a trap composed of 196 places in 271 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1474 variables, and 68 constraints, problems are : Problem set: 0 solved, 1032 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1032 constraints, Known Traps: 26/26 constraints]
After SMT, in 61456ms problems are : Problem set: 0 solved, 1032 unsolved
Search for dead transitions found 0 dead transitions in 61465ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 121356 ms. Remains : 456/456 places, 1034/1034 transitions.
Built C files in :
/tmp/ltsmin17116360046205848948
[2024-05-28 14:57:24] [INFO ] Computing symmetric may disable matrix : 1034 transitions.
[2024-05-28 14:57:24] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:57:24] [INFO ] Computing symmetric may enable matrix : 1034 transitions.
[2024-05-28 14:57:24] [INFO ] Computation of Complete enable matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:57:24] [INFO ] Computing Do-Not-Accords matrix : 1034 transitions.
[2024-05-28 14:57:24] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:57:24] [INFO ] Built C files in 277ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17116360046205848948
Running compilation step : cd /tmp/ltsmin17116360046205848948;'/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/ltsmin17116360046205848948;'/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/ltsmin17116360046205848948;'/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:57:27] [INFO ] Flatten gal took : 57 ms
[2024-05-28 14:57:27] [INFO ] Flatten gal took : 43 ms
[2024-05-28 14:57:27] [INFO ] Time to serialize gal into /tmp/LTL17294338941975310346.gal : 6 ms
[2024-05-28 14:57:27] [INFO ] Time to serialize properties into /tmp/LTL14440093982801064916.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/LTL17294338941975310346.gal' '-t' 'CGAL' '-hoa' '/tmp/aut819669213986484975.hoa' '-atoms' '/tmp/LTL14440093982801064916.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/LTL14440093982801064916.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut819669213986484975.hoa
Detected timeout of ITS tools.
[2024-05-28 14:57:42] [INFO ] Flatten gal took : 55 ms
[2024-05-28 14:57:42] [INFO ] Flatten gal took : 44 ms
[2024-05-28 14:57:42] [INFO ] Time to serialize gal into /tmp/LTL18385400199926704382.gal : 6 ms
[2024-05-28 14:57:42] [INFO ] Time to serialize properties into /tmp/LTL3614454410312075085.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18385400199926704382.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3614454410312075085.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F("((((((cJobCnt>=10)&&(P_1617_4>=1))&&(cIdleTasks>=1))||(((cJobCnt>=10)&&(P_1617_7>=1))&&(cIdleTasks>=1)))||((((cJobCnt>=10)&&(P...454
Formula 0 simplified : XG!"((((((cJobCnt>=10)&&(P_1617_4>=1))&&(cIdleTasks>=1))||(((cJobCnt>=10)&&(P_1617_7>=1))&&(cIdleTasks>=1)))||((((cJobCnt>=10)&&(P_1...448
Detected timeout of ITS tools.
[2024-05-28 14:57:57] [INFO ] Flatten gal took : 32 ms
[2024-05-28 14:57:57] [INFO ] Applying decomposition
[2024-05-28 14:57:57] [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/graph9003389076327963874.txt' '-o' '/tmp/graph9003389076327963874.bin' '-w' '/tmp/graph9003389076327963874.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9003389076327963874.bin' '-l' '-1' '-v' '-w' '/tmp/graph9003389076327963874.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:57:58] [INFO ] Decomposing Gal with order
[2024-05-28 14:57:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:57:58] [INFO ] Removed a total of 955 redundant transitions.
[2024-05-28 14:57:58] [INFO ] Flatten gal took : 74 ms
[2024-05-28 14:57:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 575 labels/synchronizations in 13 ms.
[2024-05-28 14:57:58] [INFO ] Time to serialize gal into /tmp/LTL13609841670896256813.gal : 8 ms
[2024-05-28 14:57:58] [INFO ] Time to serialize properties into /tmp/LTL16251615328918178649.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13609841670896256813.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16251615328918178649.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(F("((((((i2.u0.cJobCnt>=10)&&(i9.u31.P_1617_4>=1))&&(i0.u3.cIdleTasks>=1))||(((i2.u0.cJobCnt>=10)&&(i9.u17.P_1617_7>=1))&&(i0.u3....606
Formula 0 simplified : XG!"((((((i2.u0.cJobCnt>=10)&&(i9.u31.P_1617_4>=1))&&(i0.u3.cIdleTasks>=1))||(((i2.u0.cJobCnt>=10)&&(i9.u17.P_1617_7>=1))&&(i0.u3.cI...600
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-12 finished in 329043 ms.
[2024-05-28 14:58:13] [INFO ] Flatten gal took : 75 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7307500503802531483
[2024-05-28 14:58:13] [INFO ] Computing symmetric may disable matrix : 1290 transitions.
[2024-05-28 14:58:13] [INFO ] Applying decomposition
[2024-05-28 14:58:13] [INFO ] Computation of Complete disable matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:58:13] [INFO ] Computing symmetric may enable matrix : 1290 transitions.
[2024-05-28 14:58:13] [INFO ] Computation of Complete enable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:58:13] [INFO ] Flatten gal took : 54 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/graph6886974510541380449.txt' '-o' '/tmp/graph6886974510541380449.bin' '-w' '/tmp/graph6886974510541380449.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6886974510541380449.bin' '-l' '-1' '-v' '-w' '/tmp/graph6886974510541380449.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:58:13] [INFO ] Decomposing Gal with order
[2024-05-28 14:58:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:58:13] [INFO ] Computing Do-Not-Accords matrix : 1290 transitions.
[2024-05-28 14:58:13] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:58:13] [INFO ] Built C files in 349ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7307500503802531483
Running compilation step : cd /tmp/ltsmin7307500503802531483;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-28 14:58:13] [INFO ] Removed a total of 1025 redundant transitions.
[2024-05-28 14:58:13] [INFO ] Flatten gal took : 121 ms
[2024-05-28 14:58:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 154 labels/synchronizations in 17 ms.
[2024-05-28 14:58:13] [INFO ] Time to serialize gal into /tmp/LTLFireability7953722445396803682.gal : 15 ms
[2024-05-28 14:58:13] [INFO ] Time to serialize properties into /tmp/LTLFireability7766017543622108230.ltl : 9 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/LTLFireability7953722445396803682.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7766017543622108230.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...276
Read 3 LTL properties
Checking formula 0 : !((F(G(("(((((((u71.cSources>=9)&&(u71.ProcessingEvt_4>=1))&&(u71.ModifiedSrc_0>=1))||(((u71.cSources>=9)&&(u71.ProcessingEvt_4>=1))&&...1808
Formula 0 simplified : G(F!"(((((((u71.cSources>=9)&&(u71.ProcessingEvt_4>=1))&&(u71.ModifiedSrc_0>=1))||(((u71.cSources>=9)&&(u71.ProcessingEvt_4>=1))&&(u...1798
Compilation finished in 5405 ms.
Running link step : cd /tmp/ltsmin7307500503802531483;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 139 ms.
Running LTSmin : cd /tmp/ltsmin7307500503802531483;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X(<>((LTLAPp1==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin7307500503802531483;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X(<>((LTLAPp1==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7307500503802531483;'/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' '--ltl' '[]((<>((LTLAPp2==true))&&<>((LTLAPp3==true))))' '--buchi-type=spotba'
LTSmin run took 35136 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin7307500503802531483;'/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(<>((LTLAPp4==true)))' '--buchi-type=spotba'
LTSmin run took 1019 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin7307500503802531483;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X(<>((LTLAPp1==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2024-05-28 15:20:38] [INFO ] Applying decomposition
[2024-05-28 15:20:38] [INFO ] Flatten gal took : 100 ms
[2024-05-28 15:20:38] [INFO ] Decomposing Gal with order
[2024-05-28 15:20:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 15:20:38] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to cJobCnt in partition [CreatedJobs_0],[CreatedJobs_1],[CreatedJobs_2],[CreatedJobs_3],[CreatedJobs_4],[CreatedJobs_5],[CreatedJobs_6],[CreatedJobs_7],[CreatedJobs_8],[CreatedJobs_9],[CreatedJobs_10],[CreatedJobs_11],[CreatedJobs_12],[CreatedJobs_13],[AwakeTasks_0, IdleTasks_0, NotifyEventJobQueuedE_0, QueueJobE_0, P_2321_0, TryAllocateOneTaskE_0, TryAllocateOneTaskB_0, P_2318_0, EnablePollingE_0, EnablePollingB_0, FetchJobB_0, ScheduleTaskE_Check_0, ScheduleTaskB_0, Abort_Check_Sources_E_0, Abort_Check_Sources_B_0, NotifyEventSourceAddedB_0, Insert_Source_E_0, NotifyEventSourceAddedE_0, P_1113_0, ProcessingEvt_0, P_1155_0, nyo_0, P_1158_0, P_1159_0, P_1160_0, NotifyEventEndOfCheckSourcesB_0, NotifyEventEndOfCheckSourcesE_0, Check_Sources_B_0, Check_Sources_E_0, Idle_0, NotifyEventJobCompletedB_0, RunE_0, RunB_0, Perform_Work_E_0, Try_Check_Sources_B_0, P_1617_0, ScheduleTaskE_Idle_0],[AwakeTasks_1, IdleTasks_1, NotifyEventJobQueuedE_1, QueueJobE_1, P_2321_1, TryAllocateOneTaskE_1, TryAllocateOneTaskB_1, P_2318_1, EnablePollingE_1, EnablePollingB_1, FetchJobB_1, ScheduleTaskE_Check_1, ScheduleTaskB_1, Abort_Check_Sources_E_1, Abort_Check_Sources_B_1, NotifyEventSourceAddedB_1, Insert_Source_E_1, NotifyEventSourceAddedE_1, P_1113_1, ProcessingEvt_1, P_1155_1, nyo_1, P_1158_1, P_1159_1, P_1160_1, NotifyEventEndOfCheckSourcesB_1, NotifyEventEndOfCheckSourcesE_1, Check_Sources_B_1, Check_Sources_E_1, Idle_1, NotifyEventJobCompletedB_1, RunE_1, RunB_1, Perform_Work_E_1, Try_Check_Sources_B_1, P_1617_1, ScheduleTaskE_Idle_1],[AwakeTasks_2, IdleTasks_2, NotifyEventJobQueuedE_2, QueueJobE_2, P_2321_2, TryAllocateOneTaskE_2, TryAllocateOneTaskB_2, P_2318_2, EnablePollingE_2, EnablePollingB_2, FetchJobB_2, ScheduleTaskE_Check_2, ScheduleTaskB_2, Abort_Check_Sources_E_2, Abort_Check_Sources_B_2, NotifyEventSourceAddedB_2, Insert_Source_E_2, NotifyEventSourceAddedE_2, P_1113_2, ProcessingEvt_2, P_1155_2, nyo_2, P_1158_2, P_1159_2, P_1160_2, NotifyEventEndOfCheckSourcesB_2, NotifyEventEndOfCheckSourcesE_2, Check_Sources_B_2, Check_Sources_E_2, Idle_2, NotifyEventJobCompletedB_2, RunE_2, RunB_2, Perform_Work_E_2, Try_Check_Sources_B_2, P_1617_2, ScheduleTaskE_Idle_2],[AwakeTasks_3, IdleTasks_3, NotifyEventJobQueuedE_3, QueueJobE_3, P_2321_3, TryAllocateOneTaskE_3, TryAllocateOneTaskB_3, P_2318_3, EnablePollingE_3, EnablePollingB_3, FetchJobB_3, ScheduleTaskE_Check_3, ScheduleTaskB_3, Abort_Check_Sources_E_3, Abort_Check_Sources_B_3, NotifyEventSourceAddedB_3, Insert_Source_E_3, NotifyEventSourceAddedE_3, P_1113_3, ProcessingEvt_3, P_1155_3, nyo_3, P_1158_3, P_1159_3, P_1160_3, NotifyEventEndOfCheckSourcesB_3, NotifyEventEndOfCheckSourcesE_3, Check_Sources_B_3, Check_Sources_E_3, Idle_3, NotifyEventJobCompletedB_3, RunE_3, RunB_3, Perform_Work_E_3, Try_Check_Sources_B_3, P_1617_3, ScheduleTaskE_Idle_3],[AwakeTasks_4, IdleTasks_4, NotifyEventJobQueuedE_4, QueueJobE_4, P_2321_4, TryAllocateOneTaskE_4, TryAllocateOneTaskB_4, P_2318_4, EnablePollingE_4, EnablePollingB_4, FetchJobB_4, ScheduleTaskE_Check_4, ScheduleTaskB_4, Abort_Check_Sources_E_4, Abort_Check_Sources_B_4, NotifyEventSourceAddedB_4, Insert_Source_E_4, NotifyEventSourceAddedE_4, P_1113_4, ProcessingEvt_4, P_1155_4, nyo_4, P_1158_4, P_1159_4, P_1160_4, NotifyEventEndOfCheckSourcesB_4, NotifyEventEndOfCheckSourcesE_4, Check_Sources_B_4, Check_Sources_E_4, Idle_4, NotifyEventJobCompletedB_4, RunE_4, RunB_4, Perform_Work_E_4, Try_Check_Sources_B_4, P_1617_4, ScheduleTaskE_Idle_4],[AwakeTasks_5, IdleTasks_5, NotifyEventJobQueuedE_5, QueueJobE_5, P_2321_5, TryAllocateOneTaskE_5, TryAllocateOneTaskB_5, P_2318_5, EnablePollingE_5, EnablePollingB_5, FetchJobB_5, ScheduleTaskE_Check_5, ScheduleTaskB_5, Abort_Check_Sources_E_5, Abort_Check_Sources_B_5, NotifyEventSourceAddedB_5, Insert_Source_E_5, NotifyEventSourceAddedE_5, P_1113_5, ProcessingEvt_5, P_1155_5, nyo_5, P_1158_5, P_1159_5, P_1160_5, NotifyEventEndOfCheckSourcesB_5, NotifyEventEndOfCheckSourcesE_5, Check_Sources_B_5, Check_Sources_E_5, Idle_5, NotifyEventJobCompletedB_5, RunE_5, RunB_5, Perform_Work_E_5, Try_Check_Sources_B_5, P_1617_5, ScheduleTaskE_Idle_5],[AwakeTasks_6, IdleTasks_6, NotifyEventJobQueuedE_6, QueueJobE_6, P_2321_6, TryAllocateOneTaskE_6, TryAllocateOneTaskB_6, P_2318_6, EnablePollingE_6, EnablePollingB_6, FetchJobB_6, ScheduleTaskE_Check_6, ScheduleTaskB_6, Abort_Check_Sources_E_6, Abort_Check_Sources_B_6, NotifyEventSourceAddedB_6, Insert_Source_E_6, NotifyEventSourceAddedE_6, P_1113_6, ProcessingEvt_6, P_1155_6, nyo_6, P_1158_6, P_1159_6, P_1160_6, NotifyEventEndOfCheckSourcesB_6, NotifyEventEndOfCheckSourcesE_6, Check_Sources_B_6, Check_Sources_E_6, Idle_6, NotifyEventJobCompletedB_6, RunE_6, RunB_6, Perform_Work_E_6, Try_Check_Sources_B_6, P_1617_6, ScheduleTaskE_Idle_6],[AwakeTasks_7, IdleTasks_7, NotifyEventJobQueuedE_7, QueueJobE_7, P_2321_7, TryAllocateOneTaskE_7, TryAllocateOneTaskB_7, P_2318_7, EnablePollingE_7, EnablePollingB_7, FetchJobB_7, ScheduleTaskE_Check_7, ScheduleTaskB_7, Abort_Check_Sources_E_7, Abort_Check_Sources_B_7, NotifyEventSourceAddedB_7, Insert_Source_E_7, NotifyEventSourceAddedE_7, P_1113_7, ProcessingEvt_7, P_1155_7, nyo_7, P_1158_7, P_1159_7, P_1160_7, NotifyEventEndOfCheckSourcesB_7, NotifyEventEndOfCheckSourcesE_7, Check_Sources_B_7, Check_Sources_E_7, Idle_7, NotifyEventJobCompletedB_7, RunE_7, RunB_7, Perform_Work_E_7, Try_Check_Sources_B_7, P_1617_7, ScheduleTaskE_Idle_7],[P_1725_0, P_1724_0, P_1712_0, AvailableJobId_0],[P_1725_1, P_1724_1, P_1712_1, AvailableJobId_1],[P_1725_2, P_1724_2, P_1712_2, AvailableJobId_2],[P_1725_3, P_1724_3, P_1712_3, AvailableJobId_3],[P_1725_4, P_1724_4, P_1712_4, AvailableJobId_4],[P_1725_5, P_1724_5, P_1712_5, AvailableJobId_5],[P_1725_6, P_1724_6, P_1712_6, AvailableJobId_6],[NotifyEventJobQueuedB_0, QueueJobB_0, FetchJobE_0, ScheduleTaskE_Work_0],[NotifyEventJobQueuedB_1, QueueJobB_1, FetchJobE_1, ScheduleTaskE_Work_1],[NotifyEventJobQueuedB_2, QueueJobB_2, FetchJobE_2, ScheduleTaskE_Work_2],[NotifyEventJobQueuedB_3, QueueJobB_3, FetchJobE_3, ScheduleTaskE_Work_3],[NotifyEventJobQueuedB_4, QueueJobB_4, FetchJobE_4, ScheduleTaskE_Work_4],[NotifyEventJobQueuedB_5, QueueJobB_5, FetchJobE_5, ScheduleTaskE_Work_5],[NotifyEventJobQueuedB_6, QueueJobB_6, FetchJobE_6, ScheduleTaskE_Work_6],[NotifyEventJobQueuedB_7, QueueJobB_7, FetchJobE_7, ScheduleTaskE_Work_7],[NotifyEventJobQueuedB_8, QueueJobB_8, FetchJobE_8, ScheduleTaskE_Work_8],[NotifyEventJobQueuedB_9, QueueJobB_9, FetchJobE_9, ScheduleTaskE_Work_9],[NotifyEventJobQueuedB_10, QueueJobB_10, FetchJobE_10, ScheduleTaskE_Work_10],[NotifyEventJobQueuedB_11, QueueJobB_11, FetchJobE_11, ScheduleTaskE_Work_11],[NotifyEventJobQueuedB_12, QueueJobB_12, FetchJobE_12, ScheduleTaskE_Work_12],[NotifyEventJobQueuedB_13, QueueJobB_13, FetchJobE_13, ScheduleTaskE_Work_13],[NotifyEventJobQueuedB_14, QueueJobB_14, FetchJobE_14, ScheduleTaskE_Work_14],[NotifyEventJobQueuedB_15, QueueJobB_15, FetchJobE_15, ScheduleTaskE_Work_15],[NotifyEventJobQueuedB_16, QueueJobB_16, FetchJobE_16, ScheduleTaskE_Work_16],[NotifyEventJobQueuedB_17, QueueJobB_17, FetchJobE_17, ScheduleTaskE_Work_17],[NotifyEventJobQueuedB_18, QueueJobB_18, FetchJobE_18, ScheduleTaskE_Work_18],[NotifyEventJobQueuedB_19, QueueJobB_19, FetchJobE_19, ScheduleTaskE_Work_19],[NotifyEventJobQueuedB_20, QueueJobB_20, FetchJobE_20, ScheduleTaskE_Work_20],[NotifyEventJobQueuedB_21, QueueJobB_21, FetchJobE_21, ScheduleTaskE_Work_21],[NotifyEventJobQueuedB_22, QueueJobB_22, FetchJobE_22, ScheduleTaskE_Work_22],[NotifyEventJobQueuedB_23, QueueJobB_23, FetchJobE_23, ScheduleTaskE_Work_23],[NotifyEventJobQueuedB_24, QueueJobB_24, FetchJobE_24, ScheduleTaskE_Work_24],[NotifyEventJobQueuedB_25, QueueJobB_25, FetchJobE_25, ScheduleTaskE_Work_25],[NotifyEventJobQueuedB_26, QueueJobB_26, FetchJobE_26, ScheduleTaskE_Work_26],[NotifyEventJobQueuedB_27, QueueJobB_27, FetchJobE_27, ScheduleTaskE_Work_27],[NotifyEventJobQueuedB_28, QueueJobB_28, FetchJobE_28, ScheduleTaskE_Work_28],[NotifyEventJobQueuedB_29, QueueJobB_29, FetchJobE_29, ScheduleTaskE_Work_29],[NotifyEventJobQueuedB_30, QueueJobB_30, FetchJobE_30, ScheduleTaskE_Work_30],[NotifyEventJobQueuedB_31, QueueJobB_31, FetchJobE_31, ScheduleTaskE_Work_31],[NotifyEventJobQueuedB_32, QueueJobB_32, FetchJobE_32, ScheduleTaskE_Work_32],[NotifyEventJobQueuedB_33, QueueJobB_33, FetchJobE_33, ScheduleTaskE_Work_33],[NotifyEventJobQueuedB_34, QueueJobB_34, FetchJobE_34, ScheduleTaskE_Work_34],[NotifyEventJobQueuedB_35, QueueJobB_35, FetchJobE_35, ScheduleTaskE_Work_35],[NotifyEventJobQueuedB_36, QueueJobB_36, FetchJobE_36, ScheduleTaskE_Work_36],[NotifyEventJobQueuedB_37, QueueJobB_37, FetchJobE_37, ScheduleTaskE_Work_37],[NotifyEventJobQueuedB_38, QueueJobB_38, FetchJobE_38, ScheduleTaskE_Work_38],[NotifyEventJobQueuedB_39, QueueJobB_39, FetchJobE_39, ScheduleTaskE_Work_39],[NotifyEventJobQueuedB_40, QueueJobB_40, FetchJobE_40, ScheduleTaskE_Work_40],[NotifyEventJobQueuedB_41, QueueJobB_41, FetchJobE_41, ScheduleTaskE_Work_41],[NotifyEventJobQueuedB_42, QueueJobB_42, FetchJobE_42, ScheduleTaskE_Work_42],[NotifyEventJobQueuedB_43, QueueJobB_43, FetchJobE_43, ScheduleTaskE_Work_43],[NotifyEventJobQueuedB_44, QueueJobB_44, FetchJobE_44, ScheduleTaskE_Work_44],[NotifyEventJobQueuedB_45, QueueJobB_45, FetchJobE_45, ScheduleTaskE_Work_45],[NotifyEventJobQueuedB_46, QueueJobB_46, FetchJobE_46, ScheduleTaskE_Work_46],[NotifyEventJobQueuedB_47, QueueJobB_47, FetchJobE_47, ScheduleTaskE_Work_47],[NotifyEventJobQueuedB_48, QueueJobB_48, FetchJobE_48, ScheduleTaskE_Work_48],[NotifyEventJobQueuedB_49, QueueJobB_49, FetchJobE_49, ScheduleTaskE_Work_49],[NotifyEventJobQueuedB_50, QueueJobB_50, FetchJobE_50, ScheduleTaskE_Work_50],[NotifyEventJobQueuedB_51, QueueJobB_51, FetchJobE_51, ScheduleTaskE_Work_51],[NotifyEventJobQueuedB_52, QueueJobB_52, FetchJobE_52, ScheduleTaskE_Work_52],[NotifyEventJobQueuedB_53, QueueJobB_53, FetchJobE_53, ScheduleTaskE_Work_53],[NotifyEventJobQueuedB_54, QueueJobB_54, FetchJobE_54, ScheduleTaskE_Work_54],[NotifyEventJobQueuedB_55, QueueJobB_55, FetchJobE_55, ScheduleTaskE_Work_55],[DataOnSrc_0, PlaceSources_0, ModifiedSrc_0, AbourtToModifySrc_0],[DataOnSrc_1, PlaceSources_1, ModifiedSrc_1, AbourtToModifySrc_1],[DisablePollingE_0, DisablePollingB_0, Insert_Source_B_0, P_1119_0, P_2579_0],[DisablePollingE_1, DisablePollingB_1, Insert_Source_B_1, P_1119_1, P_2579_1],[DisablePollingE_2, DisablePollingB_2, Insert_Source_B_2, P_1119_2, P_2579_2],[DisablePollingE_3, DisablePollingB_3, Insert_Source_B_3, P_1119_3, P_2579_3],[DisablePollingE_4, DisablePollingB_4, Insert_Source_B_4, P_1119_4, P_2579_4],[DisablePollingE_5, DisablePollingB_5, Insert_Source_B_5, P_1119_5, P_2579_5],[DisablePollingE_6, DisablePollingB_6, Insert_Source_B_6, P_1119_6, P_2579_6],[DisablePollingE_7, DisablePollingB_7, Insert_Source_B_7, P_1119_7, P_2579_7],[DisablePollingE_8, DisablePollingB_8, Insert_Source_B_8, P_1119_8, P_2579_8],[DisablePollingE_9, DisablePollingB_9, Insert_Source_B_9, P_1119_9, P_2579_9],[DisablePollingE_10, DisablePollingB_10, Insert_Source_B_10, P_1119_10, P_2579_10],[DisablePollingE_11, DisablePollingB_11, Insert_Source_B_11, P_1119_11, P_2579_11],[DisablePollingE_12, DisablePollingB_12, Insert_Source_B_12, P_1119_12, P_2579_12],[DisablePollingE_13, DisablePollingB_13, Insert_Source_B_13, P_1119_13, P_2579_13],[DisablePollingE_14, DisablePollingB_14, Insert_Source_B_14, P_1119_14, P_2579_14],[DisablePollingE_15, DisablePollingB_15, Insert_Source_B_15, P_1119_15, P_2579_15],
at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:1011)
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 15:20:39] [INFO ] Flatten gal took : 100 ms
[2024-05-28 15:20:39] [INFO ] Time to serialize gal into /tmp/LTLFireability4294083062946853883.gal : 21 ms
[2024-05-28 15:20:39] [INFO ] Time to serialize properties into /tmp/LTLFireability5492130507249600606.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/LTLFireability4294083062946853883.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5492130507249600606.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...297
Read 1 LTL properties
Checking formula 0 : !((F(G(("(((((((cSources>=9)&&(ProcessingEvt_4>=1))&&(ModifiedSrc_0>=1))||(((cSources>=9)&&(ProcessingEvt_4>=1))&&(ModifiedSrc_1>=1)))...1456
Formula 0 simplified : G(F!"(((((((cSources>=9)&&(ProcessingEvt_4>=1))&&(ModifiedSrc_0>=1))||(((cSources>=9)&&(ProcessingEvt_4>=1))&&(ModifiedSrc_1>=1)))||...1446
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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-S02J06T08"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is PolyORBLF-COL-S02J06T08, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r290-tajo-171654446400108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J06T08.tgz
mv PolyORBLF-COL-S02J06T08 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;