Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654447200492.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 PolyORBNT-PT-S10J30, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654447200492
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 27M
-rw-r--r-- 1 mcc users 12K Apr 12 11:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 12 11:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 762K Apr 12 11:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.7M Apr 12 11:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 44K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 143K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 40K Apr 12 14:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 212K Apr 12 14:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.9M Apr 12 13:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 7.1M Apr 12 13:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 14M 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 PolyORBNT-PT-S10J30-LTLFireability-00
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-01
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-02
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-03
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-04
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-05
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-06
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-07
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-08
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-09
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-10
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-11
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-12
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-13
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-14
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716933206204

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J30
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-28 21:53:27] [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 21:53:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 21:53:28] [INFO ] Load time of PNML (sax parser for PT used): 603 ms
[2024-05-28 21:53:28] [INFO ] Transformed 664 places.
[2024-05-28 21:53:28] [INFO ] Transformed 12050 transitions.
[2024-05-28 21:53:28] [INFO ] Parsed PT model containing 664 places and 12050 transitions and 112559 arcs in 822 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
[2024-05-28 21:53:28] [INFO ] Reduced 780 identical enabling conditions.
[2024-05-28 21:53:28] [INFO ] Reduced 45 identical enabling conditions.
[2024-05-28 21:53:28] [INFO ] Reduced 45 identical enabling conditions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 114 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Applied a total of 0 rules in 120 ms. Remains 664 /664 variables (removed 0) and now considering 1940/1940 (removed 0) transitions.
Running 1929 sub problems to find dead transitions.
[2024-05-28 21:53:28] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 664 cols
[2024-05-28 21:53:29] [INFO ] Computed 92 invariants in 105 ms
[2024-05-28 21:53:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1929 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 643/2595 variables, and 71 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 20091 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1929/929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 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 1)
(s51 0)
(s52 0)
(s53 1)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s63 1)
(s64 1)
(s65 0)
(s66 1)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 1)
(s78 0)
(s79 0)
(s80 0)
(s81 1)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 1)
(s104 9)
(s105 1)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 1)
(s113 3)
(s114 0)
(s115 3)
(s116 0)
(s117 0)
(s118 0)
(s119 1)
(s120 1)
(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)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 3)
(s143 0)
(s144 0)
(s146 0)
(s147 0)
(s148 1)
(s149 1)
(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 1)
(s163 0)
(s164 0)
(s165 1)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s177 0)
(s178 1)
(s179 1)
(s180 1)
(s181 0)
(s182 0)
(s183 4)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 1)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 4)
(s213 0)
(s215 1)
(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)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 1)
(s241 0)
(s242 1)
(s243 0)
(s244 0)
(s245 1)
(s246 0)
(s247 0)
(s248 0)
(s249 1)
(s250 1)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 643/2595 variables, and 71 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/929 constraints, Known Traps: 0/0 constraints]
After SMT, in 59349ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 59409ms
[2024-05-28 21:54:28] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2024-05-28 21:54:28] [INFO ] Invariant cache hit.
[2024-05-28 21:54:29] [INFO ] Implicit Places using invariants in 737 ms returned []
[2024-05-28 21:54:29] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2024-05-28 21:54:29] [INFO ] Invariant cache hit.
[2024-05-28 21:54:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:54:35] [INFO ] Implicit Places using invariants and state equation in 6246 ms returned []
Implicit Place search using SMT with State Equation took 6991 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2024-05-28 21:54:35] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2024-05-28 21:54:35] [INFO ] Invariant cache hit.
[2024-05-28 21:54:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 643/2595 variables, and 71 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1929/929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
[2024-05-28 21:55:32] [INFO ] Deduced a trap composed of 19 places in 524 ms of which 32 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/643 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 643/2595 variables, and 72 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/929 constraints, Known Traps: 1/1 constraints]
After SMT, in 78993ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 79034ms
Finished structural reductions in LTL mode , in 1 iterations and 145655 ms. Remains : 664/664 places, 1940/1940 transitions.
Support contains 114 out of 664 places after structural reductions.
[2024-05-28 21:55:54] [INFO ] Flatten gal took : 227 ms
[2024-05-28 21:55:54] [INFO ] Flatten gal took : 139 ms
[2024-05-28 21:55:55] [INFO ] Input system was already deterministic with 1940 transitions.
RANDOM walk for 40000 steps (2239 resets) in 2936 ms. (13 steps per ms) remains 15/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 374 ms. (10 steps per ms) remains 11/15 properties
BEST_FIRST walk for 4004 steps (40 resets) in 445 ms. (8 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4004 steps (40 resets) in 268 ms. (14 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 5/11 properties
BEST_FIRST walk for 4003 steps (40 resets) in 33 ms. (117 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 4/5 properties
BEST_FIRST walk for 4004 steps (40 resets) in 36 ms. (108 steps per ms) remains 4/4 properties
[2024-05-28 21:55:56] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2024-05-28 21:55:56] [INFO ] Invariant cache hit.
[2024-05-28 21:55:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 248/292 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 280/572 variables, 28/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/572 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp13 is UNSAT
At refinement iteration 5 (OVERLAPS) 89/661 variables, 29/89 constraints. Problems are: Problem set: 2 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/661 variables, 0/89 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3/664 variables, 3/92 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/664 variables, 0/92 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1931/2595 variables, 664/756 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2595 variables, 1/757 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2595 variables, 0/757 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/2595 variables, 0/757 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2595/2595 variables, and 757 constraints, problems are : Problem set: 2 solved, 2 unsolved in 1074 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 664/664 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 17/21 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 91/112 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 168/280 variables, 28/31 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/31 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 280/560 variables, 28/59 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/560 variables, 0/59 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 99/659 variables, 29/88 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-28 21:55:58] [INFO ] Deduced a trap composed of 26 places in 508 ms of which 4 ms to minimize.
[2024-05-28 21:55:58] [INFO ] Deduced a trap composed of 24 places in 436 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/659 variables, 2/90 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/659 variables, 0/90 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 4/663 variables, 4/94 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/663 variables, 0/94 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1931/2594 variables, 663/757 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2594 variables, 1/758 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2594 variables, 2/760 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2594 variables, 0/760 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/2595 variables, 1/761 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2595 variables, 0/761 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/2595 variables, 0/761 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2595/2595 variables, and 761 constraints, problems are : Problem set: 2 solved, 2 unsolved in 3918 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 664/664 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 5081ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 170 ms.
Support contains 2 out of 664 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 654 transition count 1905
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 81 place count 619 transition count 1904
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 618 transition count 1904
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 82 place count 618 transition count 1870
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 150 place count 584 transition count 1870
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 151 place count 583 transition count 1869
Iterating global reduction 3 with 1 rules applied. Total rules applied 152 place count 583 transition count 1869
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 156 place count 581 transition count 1867
Applied a total of 156 rules in 423 ms. Remains 581 /664 variables (removed 83) and now considering 1867/1940 (removed 73) transitions.
Running 1856 sub problems to find dead transitions.
[2024-05-28 21:56:02] [INFO ] Flow matrix only has 1858 transitions (discarded 9 similar events)
// Phase 1: matrix 1858 rows 581 cols
[2024-05-28 21:56:02] [INFO ] Computed 82 invariants in 104 ms
[2024-05-28 21:56:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 571/2439 variables, and 72 constraints, problems are : Problem set: 0 solved, 1856 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/581 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1856/856 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1856 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
[2024-05-28 21:56:43] [INFO ] Deduced a trap composed of 18 places in 373 ms of which 2 ms to minimize.
[2024-05-28 21:56:59] [INFO ] Deduced a trap composed of 14 places in 308 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/2439 variables, and 74 constraints, problems are : Problem set: 0 solved, 1856 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/581 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/856 constraints, Known Traps: 2/2 constraints]
After SMT, in 59279ms problems are : Problem set: 0 solved, 1856 unsolved
Search for dead transitions found 0 dead transitions in 59309ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59741 ms. Remains : 581/664 places, 1867/1940 transitions.
RANDOM walk for 686 steps (42 resets) in 41 ms. (16 steps per ms) remains 0/1 properties
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!((F(p0)&&X(G(p1))))'
Support contains 13 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1939
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1939
Applied a total of 12 rules in 96 ms. Remains 653 /664 variables (removed 11) and now considering 1939/1940 (removed 1) transitions.
Running 1928 sub problems to find dead transitions.
[2024-05-28 21:57:02] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
// Phase 1: matrix 1930 rows 653 cols
[2024-05-28 21:57:02] [INFO ] Computed 82 invariants in 52 ms
[2024-05-28 21:57:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1928/928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/928 constraints, Known Traps: 0/0 constraints]
After SMT, in 59315ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 59339ms
[2024-05-28 21:58:01] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-05-28 21:58:01] [INFO ] Invariant cache hit.
[2024-05-28 21:58:01] [INFO ] Implicit Places using invariants in 565 ms returned []
[2024-05-28 21:58:01] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-05-28 21:58:01] [INFO ] Invariant cache hit.
[2024-05-28 21:58:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:58:09] [INFO ] Implicit Places using invariants and state equation in 7855 ms returned []
Implicit Place search using SMT with State Equation took 8426 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2024-05-28 21:58:09] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-05-28 21:58:09] [INFO ] Invariant cache hit.
[2024-05-28 21:58:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1928/928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
SMT process timed out in 81386ms, After SMT, problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 81423ms
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1939/1940 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 149302 ms. Remains : 653/664 places, 1939/1940 transitions.
Stuttering acceptance computed with spot in 253 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-00 finished in 149637 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 33 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 654 transition count 1904
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 618 transition count 1904
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 72 place count 618 transition count 1869
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 142 place count 583 transition count 1869
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 582 transition count 1868
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 582 transition count 1868
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 148 place count 580 transition count 1866
Applied a total of 148 rules in 246 ms. Remains 580 /664 variables (removed 84) and now considering 1866/1940 (removed 74) transitions.
Running 1855 sub problems to find dead transitions.
[2024-05-28 21:59:31] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
// Phase 1: matrix 1857 rows 580 cols
[2024-05-28 21:59:31] [INFO ] Computed 82 invariants in 27 ms
[2024-05-28 21:59:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
(s173 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 2.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 1.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 1.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 9.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 4.0)
(s97 0.0)
(s98 4.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 1.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 1.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)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 4.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.0timeout
)
(s174 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/2437 variables, and 72 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1855/855 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1855 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
[2024-05-28 22:00:12] [INFO ] Deduced a trap composed of 87 places in 397 ms of which 2 ms to minimize.
[2024-05-28 22:00:18] [INFO ] Deduced a trap composed of 283 places in 606 ms of which 6 ms to minimize.
[2024-05-28 22:00:19] [INFO ] Deduced a trap composed of 265 places in 583 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/2437 variables, and 75 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/855 constraints, Known Traps: 3/3 constraints]
After SMT, in 58894ms problems are : Problem set: 0 solved, 1855 unsolved
Search for dead transitions found 0 dead transitions in 58918ms
[2024-05-28 22:00:30] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-28 22:00:30] [INFO ] Invariant cache hit.
[2024-05-28 22:00:31] [INFO ] Implicit Places using invariants in 851 ms returned []
[2024-05-28 22:00:31] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-28 22:00:31] [INFO ] Invariant cache hit.
[2024-05-28 22:00:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:00:39] [INFO ] Implicit Places using invariants and state equation in 7654 ms returned []
Implicit Place search using SMT with State Equation took 8508 ms to find 0 implicit places.
[2024-05-28 22:00:39] [INFO ] Redundant transitions in 174 ms returned []
Running 1855 sub problems to find dead transitions.
[2024-05-28 22:00:39] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-28 22:00:39] [INFO ] Invariant cache hit.
[2024-05-28 22:00:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
Problem TDEAD542 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1396 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1403 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1409 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1417 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1423 is UNSAT
Problem TDEAD1424 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1429 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1438 is UNSAT
Problem TDEAD1439 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1451 is UNSAT
Problem TDEAD1452 is UNSAT
Problem TDEAD1453 is UNSAT
Problem TDEAD1455 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1463 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1475 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1493 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1501 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1503 is UNSAT
Problem TDEAD1509 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1515 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1523 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1528 is UNSAT
Problem TDEAD1529 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1536 is UNSAT
Problem TDEAD1537 is UNSAT
Problem TDEAD1541 is UNSAT
At refinement iteration 3 (OVERLAPS) 10/580 variables, 10/82 constraints. Problems are: Problem set: 615 solved, 1240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/2437 variables, and 82 constraints, problems are : Problem set: 615 solved, 1240 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1855/855 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 615 solved, 1240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 615 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 615 solved, 1240 unsolved
[2024-05-28 22:01:33] [INFO ] Deduced a trap composed of 18 places in 410 ms of which 2 ms to minimize.
[2024-05-28 22:01:39] [INFO ] Deduced a trap composed of 283 places in 451 ms of which 4 ms to minimize.
[2024-05-28 22:01:40] [INFO ] Deduced a trap composed of 104 places in 438 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 3/75 constraints. Problems are: Problem set: 615 solved, 1240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/2437 variables, and 75 constraints, problems are : Problem set: 615 solved, 1240 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 385/855 constraints, Known Traps: 3/3 constraints]
After SMT, in 82606ms problems are : Problem set: 615 solved, 1240 unsolved
Search for dead transitions found 615 dead transitions in 82636ms
Found 615 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 615 transitions
Dead transitions reduction (with SMT) removed 615 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 580/664 places, 1251/1940 transitions.
Applied a total of 0 rules in 29 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2024-05-28 22:02:02] [INFO ] Redundant transitions in 49 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 150592 ms. Remains : 580/664 places, 1251/1940 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-02
Product exploration explored 100000 steps with 8173 reset in 1209 ms.
Product exploration explored 100000 steps with 8190 reset in 882 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 322 steps (26 resets) in 8 ms. (35 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 114 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 85 ms :[(NOT p0), (NOT p0)]
Support contains 33 out of 580 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 30 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Running 1240 sub problems to find dead transitions.
[2024-05-28 22:02:04] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2024-05-28 22:02:05] [INFO ] Computed 82 invariants in 25 ms
[2024-05-28 22:02:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-05-28 22:02:20] [INFO ] Deduced a trap composed of 151 places in 199 ms of which 3 ms to minimize.
[2024-05-28 22:02:20] [INFO ] Deduced a trap composed of 141 places in 249 ms of which 5 ms to minimize.
[2024-05-28 22:02:21] [INFO ] Deduced a trap composed of 136 places in 242 ms of which 3 ms to minimize.
[2024-05-28 22:02:21] [INFO ] Deduced a trap composed of 141 places in 224 ms of which 3 ms to minimize.
[2024-05-28 22:02:22] [INFO ] Deduced a trap composed of 162 places in 284 ms of which 3 ms to minimize.
[2024-05-28 22:02:22] [INFO ] Deduced a trap composed of 147 places in 240 ms of which 3 ms to minimize.
[2024-05-28 22:02:22] [INFO ] Deduced a trap composed of 181 places in 227 ms of which 3 ms to minimize.
[2024-05-28 22:02:23] [INFO ] Deduced a trap composed of 161 places in 204 ms of which 3 ms to minimize.
[2024-05-28 22:02:23] [INFO ] Deduced a trap composed of 156 places in 213 ms of which 3 ms to minimize.
[2024-05-28 22:02:23] [INFO ] Deduced a trap composed of 156 places in 210 ms of which 3 ms to minimize.
[2024-05-28 22:02:23] [INFO ] Deduced a trap composed of 141 places in 197 ms of which 4 ms to minimize.
[2024-05-28 22:02:24] [INFO ] Deduced a trap composed of 141 places in 211 ms of which 3 ms to minimize.
[2024-05-28 22:02:24] [INFO ] Deduced a trap composed of 141 places in 252 ms of which 3 ms to minimize.
[2024-05-28 22:02:24] [INFO ] Deduced a trap composed of 151 places in 203 ms of which 3 ms to minimize.
[2024-05-28 22:02:25] [INFO ] Deduced a trap composed of 151 places in 259 ms of which 3 ms to minimize.
[2024-05-28 22:02:25] [INFO ] Deduced a trap composed of 166 places in 205 ms of which 3 ms to minimize.
[2024-05-28 22:02:25] [INFO ] Deduced a trap composed of 161 places in 200 ms of which 3 ms to minimize.
[2024-05-28 22:02:25] [INFO ] Deduced a trap composed of 166 places in 208 ms of which 3 ms to minimize.
[2024-05-28 22:02:26] [INFO ] Deduced a trap composed of 156 places in 232 ms of which 3 ms to minimize.
[2024-05-28 22:02:27] [INFO ] Deduced a trap composed of 166 places in 275 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-05-28 22:02:28] [INFO ] Deduced a trap composed of 152 places in 272 ms of which 4 ms to minimize.
[2024-05-28 22:02:29] [INFO ] Deduced a trap composed of 156 places in 275 ms of which 4 ms to minimize.
[2024-05-28 22:02:29] [INFO ] Deduced a trap composed of 161 places in 301 ms of which 5 ms to minimize.
[2024-05-28 22:02:29] [INFO ] Deduced a trap composed of 167 places in 274 ms of which 4 ms to minimize.
[2024-05-28 22:02:29] [INFO ] Deduced a trap composed of 157 places in 270 ms of which 4 ms to minimize.
[2024-05-28 22:02:30] [INFO ] Deduced a trap composed of 161 places in 252 ms of which 4 ms to minimize.
[2024-05-28 22:02:30] [INFO ] Deduced a trap composed of 235 places in 249 ms of which 3 ms to minimize.
[2024-05-28 22:02:30] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 3 ms to minimize.
[2024-05-28 22:02:31] [INFO ] Deduced a trap composed of 157 places in 278 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1822 variables, and 101 constraints, problems are : Problem set: 0 solved, 1240 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1240/1240 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 29/101 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-05-28 22:02:36] [INFO ] Deduced a trap composed of 18 places in 269 ms of which 2 ms to minimize.
[2024-05-28 22:02:44] [INFO ] Deduced a trap composed of 129 places in 423 ms of which 4 ms to minimize.
[2024-05-28 22:02:45] [INFO ] Deduced a trap composed of 252 places in 366 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/1822 variables, and 104 constraints, problems are : Problem set: 0 solved, 1240 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1240 constraints, Known Traps: 32/32 constraints]
After SMT, in 46083ms problems are : Problem set: 0 solved, 1240 unsolved
Search for dead transitions found 0 dead transitions in 46098ms
[2024-05-28 22:02:51] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-28 22:02:51] [INFO ] Invariant cache hit.
[2024-05-28 22:02:51] [INFO ] Implicit Places using invariants in 517 ms returned []
[2024-05-28 22:02:51] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-28 22:02:51] [INFO ] Invariant cache hit.
[2024-05-28 22:02:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:02:58] [INFO ] Implicit Places using invariants and state equation in 6972 ms returned []
Implicit Place search using SMT with State Equation took 7493 ms to find 0 implicit places.
[2024-05-28 22:02:58] [INFO ] Redundant transitions in 59 ms returned []
Running 1240 sub problems to find dead transitions.
[2024-05-28 22:02:58] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-28 22:02:58] [INFO ] Invariant cache hit.
[2024-05-28 22:02:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-05-28 22:03:12] [INFO ] Deduced a trap composed of 167 places in 218 ms of which 3 ms to minimize.
[2024-05-28 22:03:12] [INFO ] Deduced a trap composed of 166 places in 252 ms of which 3 ms to minimize.
[2024-05-28 22:03:13] [INFO ] Deduced a trap composed of 161 places in 201 ms of which 4 ms to minimize.
[2024-05-28 22:03:13] [INFO ] Deduced a trap composed of 156 places in 279 ms of which 4 ms to minimize.
[2024-05-28 22:03:14] [INFO ] Deduced a trap composed of 156 places in 378 ms of which 4 ms to minimize.
[2024-05-28 22:03:14] [INFO ] Deduced a trap composed of 240 places in 217 ms of which 3 ms to minimize.
[2024-05-28 22:03:14] [INFO ] Deduced a trap composed of 236 places in 209 ms of which 3 ms to minimize.
[2024-05-28 22:03:15] [INFO ] Deduced a trap composed of 228 places in 251 ms of which 4 ms to minimize.
[2024-05-28 22:03:15] [INFO ] Deduced a trap composed of 234 places in 225 ms of which 4 ms to minimize.
[2024-05-28 22:03:15] [INFO ] Deduced a trap composed of 171 places in 215 ms of which 3 ms to minimize.
[2024-05-28 22:03:15] [INFO ] Deduced a trap composed of 224 places in 210 ms of which 4 ms to minimize.
[2024-05-28 22:03:16] [INFO ] Deduced a trap composed of 224 places in 204 ms of which 3 ms to minimize.
[2024-05-28 22:03:16] [INFO ] Deduced a trap composed of 151 places in 182 ms of which 3 ms to minimize.
[2024-05-28 22:03:16] [INFO ] Deduced a trap composed of 146 places in 205 ms of which 4 ms to minimize.
[2024-05-28 22:03:16] [INFO ] Deduced a trap composed of 236 places in 212 ms of which 3 ms to minimize.
[2024-05-28 22:03:16] [INFO ] Deduced a trap composed of 228 places in 291 ms of which 4 ms to minimize.
[2024-05-28 22:03:17] [INFO ] Deduced a trap composed of 226 places in 271 ms of which 4 ms to minimize.
[2024-05-28 22:03:17] [INFO ] Deduced a trap composed of 230 places in 249 ms of which 4 ms to minimize.
[2024-05-28 22:03:17] [INFO ] Deduced a trap composed of 226 places in 247 ms of which 4 ms to minimize.
[2024-05-28 22:03:18] [INFO ] Deduced a trap composed of 232 places in 237 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-05-28 22:03:19] [INFO ] Deduced a trap composed of 146 places in 289 ms of which 5 ms to minimize.
[2024-05-28 22:03:19] [INFO ] Deduced a trap composed of 162 places in 191 ms of which 3 ms to minimize.
[2024-05-28 22:03:19] [INFO ] Deduced a trap composed of 156 places in 193 ms of which 3 ms to minimize.
[2024-05-28 22:03:19] [INFO ] Deduced a trap composed of 152 places in 194 ms of which 3 ms to minimize.
[2024-05-28 22:03:19] [INFO ] Deduced a trap composed of 229 places in 201 ms of which 4 ms to minimize.
[2024-05-28 22:03:20] [INFO ] Deduced a trap composed of 146 places in 203 ms of which 3 ms to minimize.
[2024-05-28 22:03:20] [INFO ] Deduced a trap composed of 146 places in 190 ms of which 3 ms to minimize.
[2024-05-28 22:03:20] [INFO ] Deduced a trap composed of 141 places in 197 ms of which 4 ms to minimize.
[2024-05-28 22:03:20] [INFO ] Deduced a trap composed of 142 places in 252 ms of which 3 ms to minimize.
[2024-05-28 22:03:21] [INFO ] Deduced a trap composed of 181 places in 261 ms of which 5 ms to minimize.
[2024-05-28 22:03:21] [INFO ] Deduced a trap composed of 157 places in 247 ms of which 3 ms to minimize.
[2024-05-28 22:03:21] [INFO ] Deduced a trap composed of 131 places in 240 ms of which 3 ms to minimize.
[2024-05-28 22:03:21] [INFO ] Deduced a trap composed of 171 places in 213 ms of which 3 ms to minimize.
[2024-05-28 22:03:22] [INFO ] Deduced a trap composed of 151 places in 214 ms of which 3 ms to minimize.
[2024-05-28 22:03:22] [INFO ] Deduced a trap composed of 166 places in 213 ms of which 3 ms to minimize.
[2024-05-28 22:03:22] [INFO ] Deduced a trap composed of 161 places in 214 ms of which 3 ms to minimize.
[2024-05-28 22:03:22] [INFO ] Deduced a trap composed of 177 places in 215 ms of which 4 ms to minimize.
[2024-05-28 22:03:23] [INFO ] Deduced a trap composed of 132 places in 216 ms of which 3 ms to minimize.
[2024-05-28 22:03:23] [INFO ] Deduced a trap composed of 162 places in 214 ms of which 3 ms to minimize.
[2024-05-28 22:03:23] [INFO ] Deduced a trap composed of 162 places in 219 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1822 variables, and 112 constraints, problems are : Problem set: 0 solved, 1240 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1240/1240 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 40/112 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-05-28 22:03:36] [INFO ] Deduced a trap composed of 136 places in 302 ms of which 5 ms to minimize.
[2024-05-28 22:03:36] [INFO ] Deduced a trap composed of 121 places in 228 ms of which 4 ms to minimize.
[2024-05-28 22:03:36] [INFO ] Deduced a trap composed of 121 places in 298 ms of which 4 ms to minimize.
[2024-05-28 22:03:37] [INFO ] Deduced a trap composed of 121 places in 303 ms of which 5 ms to minimize.
[2024-05-28 22:03:37] [INFO ] Deduced a trap composed of 106 places in 215 ms of which 3 ms to minimize.
[2024-05-28 22:03:37] [INFO ] Deduced a trap composed of 131 places in 283 ms of which 4 ms to minimize.
[2024-05-28 22:03:37] [INFO ] Deduced a trap composed of 79 places in 270 ms of which 4 ms to minimize.
[2024-05-28 22:03:38] [INFO ] Deduced a trap composed of 78 places in 248 ms of which 4 ms to minimize.
[2024-05-28 22:03:38] [INFO ] Deduced a trap composed of 121 places in 225 ms of which 3 ms to minimize.
[2024-05-28 22:03:38] [INFO ] Deduced a trap composed of 131 places in 218 ms of which 3 ms to minimize.
[2024-05-28 22:03:38] [INFO ] Deduced a trap composed of 121 places in 225 ms of which 3 ms to minimize.
[2024-05-28 22:03:39] [INFO ] Deduced a trap composed of 126 places in 211 ms of which 4 ms to minimize.
[2024-05-28 22:03:39] [INFO ] Deduced a trap composed of 111 places in 283 ms of which 4 ms to minimize.
[2024-05-28 22:03:39] [INFO ] Deduced a trap composed of 117 places in 234 ms of which 3 ms to minimize.
[2024-05-28 22:03:39] [INFO ] Deduced a trap composed of 116 places in 220 ms of which 3 ms to minimize.
[2024-05-28 22:03:40] [INFO ] Deduced a trap composed of 112 places in 215 ms of which 3 ms to minimize.
[2024-05-28 22:03:40] [INFO ] Deduced a trap composed of 142 places in 286 ms of which 4 ms to minimize.
[2024-05-28 22:03:40] [INFO ] Deduced a trap composed of 131 places in 275 ms of which 4 ms to minimize.
[2024-05-28 22:03:40] [INFO ] Deduced a trap composed of 126 places in 254 ms of which 4 ms to minimize.
[2024-05-28 22:03:41] [INFO ] Deduced a trap composed of 116 places in 250 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-05-28 22:03:43] [INFO ] Deduced a trap composed of 18 places in 222 ms of which 1 ms to minimize.
[2024-05-28 22:03:44] [INFO ] Deduced a trap composed of 175 places in 332 ms of which 3 ms to minimize.
[2024-05-28 22:03:44] [INFO ] Deduced a trap composed of 151 places in 327 ms of which 4 ms to minimize.
[2024-05-28 22:03:44] [INFO ] Deduced a trap composed of 111 places in 290 ms of which 3 ms to minimize.
[2024-05-28 22:03:45] [INFO ] Deduced a trap composed of 166 places in 284 ms of which 3 ms to minimize.
[2024-05-28 22:03:45] [INFO ] Deduced a trap composed of 161 places in 279 ms of which 3 ms to minimize.
[2024-05-28 22:03:45] [INFO ] Deduced a trap composed of 140 places in 316 ms of which 4 ms to minimize.
[2024-05-28 22:03:45] [INFO ] Deduced a trap composed of 152 places in 307 ms of which 3 ms to minimize.
[2024-05-28 22:03:46] [INFO ] Deduced a trap composed of 121 places in 313 ms of which 4 ms to minimize.
[2024-05-28 22:03:46] [INFO ] Deduced a trap composed of 156 places in 321 ms of which 4 ms to minimize.
[2024-05-28 22:03:46] [INFO ] Deduced a trap composed of 136 places in 276 ms of which 3 ms to minimize.
[2024-05-28 22:03:47] [INFO ] Deduced a trap composed of 160 places in 331 ms of which 3 ms to minimize.
[2024-05-28 22:03:47] [INFO ] Deduced a trap composed of 156 places in 276 ms of which 3 ms to minimize.
[2024-05-28 22:03:47] [INFO ] Deduced a trap composed of 160 places in 274 ms of which 4 ms to minimize.
[2024-05-28 22:03:48] [INFO ] Deduced a trap composed of 151 places in 255 ms of which 2 ms to minimize.
[2024-05-28 22:03:48] [INFO ] Deduced a trap composed of 155 places in 257 ms of which 3 ms to minimize.
[2024-05-28 22:03:48] [INFO ] Deduced a trap composed of 151 places in 259 ms of which 3 ms to minimize.
[2024-05-28 22:03:48] [INFO ] Deduced a trap composed of 146 places in 260 ms of which 3 ms to minimize.
[2024-05-28 22:03:49] [INFO ] Deduced a trap composed of 150 places in 270 ms of which 3 ms to minimize.
[2024-05-28 22:03:49] [INFO ] Deduced a trap composed of 146 places in 256 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-05-28 22:03:51] [INFO ] Deduced a trap composed of 116 places in 375 ms of which 5 ms to minimize.
[2024-05-28 22:03:52] [INFO ] Deduced a trap composed of 131 places in 338 ms of which 4 ms to minimize.
[2024-05-28 22:03:52] [INFO ] Deduced a trap composed of 156 places in 343 ms of which 4 ms to minimize.
[2024-05-28 22:03:52] [INFO ] Deduced a trap composed of 116 places in 301 ms of which 3 ms to minimize.
[2024-05-28 22:03:53] [INFO ] Deduced a trap composed of 121 places in 315 ms of which 3 ms to minimize.
[2024-05-28 22:03:53] [INFO ] Deduced a trap composed of 130 places in 276 ms of which 3 ms to minimize.
[2024-05-28 22:03:53] [INFO ] Deduced a trap composed of 116 places in 259 ms of which 3 ms to minimize.
[2024-05-28 22:03:54] [INFO ] Deduced a trap composed of 146 places in 274 ms of which 3 ms to minimize.
[2024-05-28 22:03:54] [INFO ] Deduced a trap composed of 130 places in 336 ms of which 3 ms to minimize.
[2024-05-28 22:03:54] [INFO ] Deduced a trap composed of 126 places in 277 ms of which 3 ms to minimize.
[2024-05-28 22:03:54] [INFO ] Deduced a trap composed of 120 places in 258 ms of which 3 ms to minimize.
[2024-05-28 22:03:55] [INFO ] Deduced a trap composed of 131 places in 268 ms of which 3 ms to minimize.
[2024-05-28 22:03:55] [INFO ] Deduced a trap composed of 132 places in 256 ms of which 3 ms to minimize.
[2024-05-28 22:03:55] [INFO ] Deduced a trap composed of 106 places in 258 ms of which 3 ms to minimize.
[2024-05-28 22:03:56] [INFO ] Deduced a trap composed of 111 places in 260 ms of which 3 ms to minimize.
[2024-05-28 22:03:56] [INFO ] Deduced a trap composed of 161 places in 322 ms of which 3 ms to minimize.
[2024-05-28 22:03:56] [INFO ] Deduced a trap composed of 132 places in 268 ms of which 3 ms to minimize.
[2024-05-28 22:03:57] [INFO ] Deduced a trap composed of 135 places in 257 ms of which 3 ms to minimize.
[2024-05-28 22:03:57] [INFO ] Deduced a trap composed of 121 places in 260 ms of which 2 ms to minimize.
[2024-05-28 22:03:57] [INFO ] Deduced a trap composed of 131 places in 262 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-05-28 22:04:00] [INFO ] Deduced a trap composed of 222 places in 280 ms of which 4 ms to minimize.
[2024-05-28 22:04:01] [INFO ] Deduced a trap composed of 236 places in 276 ms of which 3 ms to minimize.
[2024-05-28 22:04:01] [INFO ] Deduced a trap composed of 182 places in 210 ms of which 3 ms to minimize.
[2024-05-28 22:04:01] [INFO ] Deduced a trap composed of 161 places in 201 ms of which 3 ms to minimize.
[2024-05-28 22:04:01] [INFO ] Deduced a trap composed of 171 places in 243 ms of which 4 ms to minimize.
[2024-05-28 22:04:02] [INFO ] Deduced a trap composed of 228 places in 201 ms of which 3 ms to minimize.
[2024-05-28 22:04:02] [INFO ] Deduced a trap composed of 171 places in 240 ms of which 4 ms to minimize.
[2024-05-28 22:04:02] [INFO ] Deduced a trap composed of 156 places in 202 ms of which 3 ms to minimize.
[2024-05-28 22:04:02] [INFO ] Deduced a trap composed of 176 places in 191 ms of which 3 ms to minimize.
[2024-05-28 22:04:03] [INFO ] Deduced a trap composed of 166 places in 239 ms of which 3 ms to minimize.
[2024-05-28 22:04:03] [INFO ] Deduced a trap composed of 166 places in 197 ms of which 3 ms to minimize.
[2024-05-28 22:04:03] [INFO ] Deduced a trap composed of 171 places in 196 ms of which 4 ms to minimize.
[2024-05-28 22:04:03] [INFO ] Deduced a trap composed of 156 places in 198 ms of which 3 ms to minimize.
SMT process timed out in 65103ms, After SMT, problems are : Problem set: 0 solved, 1240 unsolved
Search for dead transitions found 0 dead transitions in 65125ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 118828 ms. Remains : 580/580 places, 1251/1251 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 607 steps (51 resets) in 13 ms. (43 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 8175 reset in 1101 ms.
Product exploration explored 100000 steps with 8162 reset in 848 ms.
Built C files in :
/tmp/ltsmin7889955798029513039
[2024-05-28 22:04:06] [INFO ] Computing symmetric may disable matrix : 1251 transitions.
[2024-05-28 22:04:06] [INFO ] Computation of Complete disable matrix. took 49 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 22:04:06] [INFO ] Computing symmetric may enable matrix : 1251 transitions.
[2024-05-28 22:04:06] [INFO ] Computation of Complete enable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 22:04:06] [INFO ] Computing Do-Not-Accords matrix : 1251 transitions.
[2024-05-28 22:04:06] [INFO ] Computation of Completed DNA matrix. took 66 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 22:04:06] [INFO ] Built C files in 510ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7889955798029513039
Running compilation step : cd /tmp/ltsmin7889955798029513039;'/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/ltsmin7889955798029513039;'/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/ltsmin7889955798029513039;'/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 33 out of 580 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 71 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Running 1240 sub problems to find dead transitions.
[2024-05-28 22:04:09] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-28 22:04:09] [INFO ] Invariant cache hit.
[2024-05-28 22:04:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-05-28 22:04:24] [INFO ] Deduced a trap composed of 167 places in 256 ms of which 4 ms to minimize.
[2024-05-28 22:04:25] [INFO ] Deduced a trap composed of 166 places in 275 ms of which 4 ms to minimize.
[2024-05-28 22:04:25] [INFO ] Deduced a trap composed of 161 places in 248 ms of which 4 ms to minimize.
[2024-05-28 22:04:25] [INFO ] Deduced a trap composed of 156 places in 212 ms of which 3 ms to minimize.
[2024-05-28 22:04:26] [INFO ] Deduced a trap composed of 156 places in 281 ms of which 4 ms to minimize.
[2024-05-28 22:04:26] [INFO ] Deduced a trap composed of 240 places in 242 ms of which 4 ms to minimize.
[2024-05-28 22:04:26] [INFO ] Deduced a trap composed of 236 places in 265 ms of which 4 ms to minimize.
[2024-05-28 22:04:27] [INFO ] Deduced a trap composed of 228 places in 346 ms of which 5 ms to minimize.
[2024-05-28 22:04:27] [INFO ] Deduced a trap composed of 234 places in 254 ms of which 4 ms to minimize.
[2024-05-28 22:04:27] [INFO ] Deduced a trap composed of 171 places in 234 ms of which 3 ms to minimize.
[2024-05-28 22:04:28] [INFO ] Deduced a trap composed of 224 places in 224 ms of which 3 ms to minimize.
[2024-05-28 22:04:28] [INFO ] Deduced a trap composed of 224 places in 290 ms of which 4 ms to minimize.
[2024-05-28 22:04:28] [INFO ] Deduced a trap composed of 151 places in 250 ms of which 4 ms to minimize.
[2024-05-28 22:04:28] [INFO ] Deduced a trap composed of 146 places in 242 ms of which 3 ms to minimize.
[2024-05-28 22:04:29] [INFO ] Deduced a trap composed of 236 places in 245 ms of which 4 ms to minimize.
[2024-05-28 22:04:29] [INFO ] Deduced a trap composed of 228 places in 278 ms of which 4 ms to minimize.
[2024-05-28 22:04:29] [INFO ] Deduced a trap composed of 226 places in 244 ms of which 4 ms to minimize.
[2024-05-28 22:04:30] [INFO ] Deduced a trap composed of 230 places in 242 ms of which 4 ms to minimize.
[2024-05-28 22:04:30] [INFO ] Deduced a trap composed of 226 places in 250 ms of which 4 ms to minimize.
[2024-05-28 22:04:30] [INFO ] Deduced a trap composed of 232 places in 247 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-05-28 22:04:31] [INFO ] Deduced a trap composed of 146 places in 250 ms of which 4 ms to minimize.
[2024-05-28 22:04:32] [INFO ] Deduced a trap composed of 162 places in 256 ms of which 4 ms to minimize.
[2024-05-28 22:04:32] [INFO ] Deduced a trap composed of 156 places in 278 ms of which 3 ms to minimize.
[2024-05-28 22:04:32] [INFO ] Deduced a trap composed of 152 places in 250 ms of which 4 ms to minimize.
[2024-05-28 22:04:32] [INFO ] Deduced a trap composed of 229 places in 272 ms of which 5 ms to minimize.
[2024-05-28 22:04:33] [INFO ] Deduced a trap composed of 146 places in 255 ms of which 5 ms to minimize.
[2024-05-28 22:04:33] [INFO ] Deduced a trap composed of 146 places in 249 ms of which 4 ms to minimize.
[2024-05-28 22:04:33] [INFO ] Deduced a trap composed of 141 places in 316 ms of which 4 ms to minimize.
[2024-05-28 22:04:34] [INFO ] Deduced a trap composed of 142 places in 267 ms of which 4 ms to minimize.
[2024-05-28 22:04:34] [INFO ] Deduced a trap composed of 181 places in 285 ms of which 4 ms to minimize.
[2024-05-28 22:04:34] [INFO ] Deduced a trap composed of 157 places in 254 ms of which 4 ms to minimize.
[2024-05-28 22:04:34] [INFO ] Deduced a trap composed of 131 places in 273 ms of which 4 ms to minimize.
[2024-05-28 22:04:35] [INFO ] Deduced a trap composed of 171 places in 266 ms of which 5 ms to minimize.
[2024-05-28 22:04:35] [INFO ] Deduced a trap composed of 151 places in 229 ms of which 4 ms to minimize.
SMT process timed out in 25665ms, After SMT, problems are : Problem set: 0 solved, 1240 unsolved
Search for dead transitions found 0 dead transitions in 25683ms
[2024-05-28 22:04:35] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-28 22:04:35] [INFO ] Invariant cache hit.
[2024-05-28 22:04:36] [INFO ] Implicit Places using invariants in 733 ms returned []
[2024-05-28 22:04:36] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-28 22:04:36] [INFO ] Invariant cache hit.
[2024-05-28 22:04:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:04:42] [INFO ] Implicit Places using invariants and state equation in 6692 ms returned []
Implicit Place search using SMT with State Equation took 7429 ms to find 0 implicit places.
[2024-05-28 22:04:42] [INFO ] Redundant transitions in 41 ms returned []
Running 1240 sub problems to find dead transitions.
[2024-05-28 22:04:43] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-28 22:04:43] [INFO ] Invariant cache hit.
[2024-05-28 22:04:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-05-28 22:04:57] [INFO ] Deduced a trap composed of 167 places in 258 ms of which 3 ms to minimize.
[2024-05-28 22:04:58] [INFO ] Deduced a trap composed of 166 places in 248 ms of which 6 ms to minimize.
[2024-05-28 22:04:58] [INFO ] Deduced a trap composed of 161 places in 253 ms of which 4 ms to minimize.
[2024-05-28 22:04:58] [INFO ] Deduced a trap composed of 156 places in 281 ms of which 4 ms to minimize.
[2024-05-28 22:04:59] [INFO ] Deduced a trap composed of 156 places in 272 ms of which 4 ms to minimize.
[2024-05-28 22:04:59] [INFO ] Deduced a trap composed of 240 places in 265 ms of which 4 ms to minimize.
[2024-05-28 22:04:59] [INFO ] Deduced a trap composed of 236 places in 195 ms of which 2 ms to minimize.
[2024-05-28 22:05:00] [INFO ] Deduced a trap composed of 228 places in 268 ms of which 4 ms to minimize.
[2024-05-28 22:05:00] [INFO ] Deduced a trap composed of 234 places in 239 ms of which 4 ms to minimize.
[2024-05-28 22:05:00] [INFO ] Deduced a trap composed of 171 places in 190 ms of which 3 ms to minimize.
[2024-05-28 22:05:00] [INFO ] Deduced a trap composed of 224 places in 192 ms of which 3 ms to minimize.
[2024-05-28 22:05:01] [INFO ] Deduced a trap composed of 224 places in 262 ms of which 4 ms to minimize.
[2024-05-28 22:05:01] [INFO ] Deduced a trap composed of 151 places in 253 ms of which 4 ms to minimize.
[2024-05-28 22:05:01] [INFO ] Deduced a trap composed of 146 places in 199 ms of which 3 ms to minimize.
[2024-05-28 22:05:01] [INFO ] Deduced a trap composed of 236 places in 189 ms of which 3 ms to minimize.
[2024-05-28 22:05:02] [INFO ] Deduced a trap composed of 228 places in 272 ms of which 4 ms to minimize.
[2024-05-28 22:05:02] [INFO ] Deduced a trap composed of 226 places in 192 ms of which 3 ms to minimize.
[2024-05-28 22:05:02] [INFO ] Deduced a trap composed of 230 places in 192 ms of which 3 ms to minimize.
[2024-05-28 22:05:02] [INFO ] Deduced a trap composed of 226 places in 187 ms of which 3 ms to minimize.
[2024-05-28 22:05:02] [INFO ] Deduced a trap composed of 232 places in 189 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-05-28 22:05:03] [INFO ] Deduced a trap composed of 146 places in 268 ms of which 4 ms to minimize.
[2024-05-28 22:05:04] [INFO ] Deduced a trap composed of 162 places in 237 ms of which 3 ms to minimize.
[2024-05-28 22:05:04] [INFO ] Deduced a trap composed of 156 places in 249 ms of which 4 ms to minimize.
[2024-05-28 22:05:04] [INFO ] Deduced a trap composed of 152 places in 207 ms of which 3 ms to minimize.
[2024-05-28 22:05:04] [INFO ] Deduced a trap composed of 229 places in 204 ms of which 2 ms to minimize.
[2024-05-28 22:05:05] [INFO ] Deduced a trap composed of 146 places in 224 ms of which 3 ms to minimize.
[2024-05-28 22:05:05] [INFO ] Deduced a trap composed of 146 places in 195 ms of which 3 ms to minimize.
[2024-05-28 22:05:05] [INFO ] Deduced a trap composed of 141 places in 211 ms of which 2 ms to minimize.
[2024-05-28 22:05:05] [INFO ] Deduced a trap composed of 142 places in 196 ms of which 3 ms to minimize.
[2024-05-28 22:05:05] [INFO ] Deduced a trap composed of 181 places in 195 ms of which 3 ms to minimize.
[2024-05-28 22:05:06] [INFO ] Deduced a trap composed of 157 places in 213 ms of which 5 ms to minimize.
[2024-05-28 22:05:06] [INFO ] Deduced a trap composed of 131 places in 226 ms of which 3 ms to minimize.
[2024-05-28 22:05:06] [INFO ] Deduced a trap composed of 171 places in 266 ms of which 3 ms to minimize.
[2024-05-28 22:05:07] [INFO ] Deduced a trap composed of 151 places in 273 ms of which 4 ms to minimize.
[2024-05-28 22:05:07] [INFO ] Deduced a trap composed of 166 places in 198 ms of which 3 ms to minimize.
[2024-05-28 22:05:07] [INFO ] Deduced a trap composed of 161 places in 205 ms of which 3 ms to minimize.
[2024-05-28 22:05:07] [INFO ] Deduced a trap composed of 177 places in 175 ms of which 3 ms to minimize.
[2024-05-28 22:05:07] [INFO ] Deduced a trap composed of 132 places in 281 ms of which 4 ms to minimize.
[2024-05-28 22:05:08] [INFO ] Deduced a trap composed of 162 places in 191 ms of which 3 ms to minimize.
[2024-05-28 22:05:08] [INFO ] Deduced a trap composed of 162 places in 265 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1822 variables, and 112 constraints, problems are : Problem set: 0 solved, 1240 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1240/1240 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 40/112 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-05-28 22:05:20] [INFO ] Deduced a trap composed of 136 places in 337 ms of which 4 ms to minimize.
[2024-05-28 22:05:20] [INFO ] Deduced a trap composed of 121 places in 249 ms of which 7 ms to minimize.
[2024-05-28 22:05:20] [INFO ] Deduced a trap composed of 121 places in 245 ms of which 3 ms to minimize.
[2024-05-28 22:05:21] [INFO ] Deduced a trap composed of 121 places in 254 ms of which 3 ms to minimize.
[2024-05-28 22:05:21] [INFO ] Deduced a trap composed of 106 places in 215 ms of which 3 ms to minimize.
[2024-05-28 22:05:21] [INFO ] Deduced a trap composed of 131 places in 205 ms of which 3 ms to minimize.
[2024-05-28 22:05:21] [INFO ] Deduced a trap composed of 79 places in 209 ms of which 3 ms to minimize.
[2024-05-28 22:05:21] [INFO ] Deduced a trap composed of 78 places in 203 ms of which 3 ms to minimize.
[2024-05-28 22:05:22] [INFO ] Deduced a trap composed of 121 places in 196 ms of which 3 ms to minimize.
[2024-05-28 22:05:22] [INFO ] Deduced a trap composed of 131 places in 219 ms of which 3 ms to minimize.
[2024-05-28 22:05:22] [INFO ] Deduced a trap composed of 121 places in 195 ms of which 4 ms to minimize.
[2024-05-28 22:05:22] [INFO ] Deduced a trap composed of 126 places in 209 ms of which 3 ms to minimize.
[2024-05-28 22:05:23] [INFO ] Deduced a trap composed of 111 places in 256 ms of which 3 ms to minimize.
[2024-05-28 22:05:23] [INFO ] Deduced a trap composed of 117 places in 270 ms of which 4 ms to minimize.
[2024-05-28 22:05:23] [INFO ] Deduced a trap composed of 116 places in 252 ms of which 3 ms to minimize.
[2024-05-28 22:05:23] [INFO ] Deduced a trap composed of 112 places in 192 ms of which 3 ms to minimize.
[2024-05-28 22:05:24] [INFO ] Deduced a trap composed of 142 places in 274 ms of which 6 ms to minimize.
[2024-05-28 22:05:24] [INFO ] Deduced a trap composed of 131 places in 211 ms of which 3 ms to minimize.
[2024-05-28 22:05:24] [INFO ] Deduced a trap composed of 126 places in 203 ms of which 4 ms to minimize.
[2024-05-28 22:05:24] [INFO ] Deduced a trap composed of 116 places in 229 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-05-28 22:05:26] [INFO ] Deduced a trap composed of 18 places in 260 ms of which 2 ms to minimize.
[2024-05-28 22:05:27] [INFO ] Deduced a trap composed of 175 places in 381 ms of which 5 ms to minimize.
[2024-05-28 22:05:28] [INFO ] Deduced a trap composed of 151 places in 361 ms of which 4 ms to minimize.
[2024-05-28 22:05:28] [INFO ] Deduced a trap composed of 111 places in 300 ms of which 4 ms to minimize.
[2024-05-28 22:05:28] [INFO ] Deduced a trap composed of 166 places in 401 ms of which 5 ms to minimize.
[2024-05-28 22:05:29] [INFO ] Deduced a trap composed of 161 places in 365 ms of which 4 ms to minimize.
[2024-05-28 22:05:29] [INFO ] Deduced a trap composed of 140 places in 349 ms of which 3 ms to minimize.
[2024-05-28 22:05:29] [INFO ] Deduced a trap composed of 152 places in 312 ms of which 4 ms to minimize.
[2024-05-28 22:05:30] [INFO ] Deduced a trap composed of 121 places in 317 ms of which 3 ms to minimize.
[2024-05-28 22:05:30] [INFO ] Deduced a trap composed of 156 places in 322 ms of which 3 ms to minimize.
[2024-05-28 22:05:31] [INFO ] Deduced a trap composed of 136 places in 339 ms of which 4 ms to minimize.
[2024-05-28 22:05:31] [INFO ] Deduced a trap composed of 160 places in 311 ms of which 3 ms to minimize.
[2024-05-28 22:05:31] [INFO ] Deduced a trap composed of 156 places in 300 ms of which 3 ms to minimize.
[2024-05-28 22:05:32] [INFO ] Deduced a trap composed of 160 places in 339 ms of which 3 ms to minimize.
[2024-05-28 22:05:32] [INFO ] Deduced a trap composed of 151 places in 308 ms of which 3 ms to minimize.
[2024-05-28 22:05:32] [INFO ] Deduced a trap composed of 155 places in 297 ms of which 3 ms to minimize.
[2024-05-28 22:05:32] [INFO ] Deduced a trap composed of 151 places in 279 ms of which 3 ms to minimize.
[2024-05-28 22:05:33] [INFO ] Deduced a trap composed of 146 places in 298 ms of which 4 ms to minimize.
[2024-05-28 22:05:33] [INFO ] Deduced a trap composed of 150 places in 353 ms of which 3 ms to minimize.
[2024-05-28 22:05:34] [INFO ] Deduced a trap composed of 146 places in 408 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-05-28 22:05:36] [INFO ] Deduced a trap composed of 116 places in 389 ms of which 3 ms to minimize.
[2024-05-28 22:05:37] [INFO ] Deduced a trap composed of 131 places in 360 ms of which 3 ms to minimize.
[2024-05-28 22:05:37] [INFO ] Deduced a trap composed of 156 places in 284 ms of which 4 ms to minimize.
[2024-05-28 22:05:37] [INFO ] Deduced a trap composed of 116 places in 330 ms of which 4 ms to minimize.
[2024-05-28 22:05:38] [INFO ] Deduced a trap composed of 121 places in 316 ms of which 3 ms to minimize.
[2024-05-28 22:05:38] [INFO ] Deduced a trap composed of 130 places in 257 ms of which 3 ms to minimize.
[2024-05-28 22:05:38] [INFO ] Deduced a trap composed of 116 places in 257 ms of which 3 ms to minimize.
[2024-05-28 22:05:38] [INFO ] Deduced a trap composed of 146 places in 264 ms of which 3 ms to minimize.
[2024-05-28 22:05:39] [INFO ] Deduced a trap composed of 130 places in 257 ms of which 3 ms to minimize.
[2024-05-28 22:05:39] [INFO ] Deduced a trap composed of 126 places in 383 ms of which 4 ms to minimize.
[2024-05-28 22:05:39] [INFO ] Deduced a trap composed of 120 places in 347 ms of which 4 ms to minimize.
[2024-05-28 22:05:40] [INFO ] Deduced a trap composed of 131 places in 253 ms of which 3 ms to minimize.
[2024-05-28 22:05:40] [INFO ] Deduced a trap composed of 132 places in 381 ms of which 4 ms to minimize.
[2024-05-28 22:05:40] [INFO ] Deduced a trap composed of 106 places in 346 ms of which 4 ms to minimize.
[2024-05-28 22:05:41] [INFO ] Deduced a trap composed of 111 places in 348 ms of which 3 ms to minimize.
[2024-05-28 22:05:41] [INFO ] Deduced a trap composed of 161 places in 375 ms of which 3 ms to minimize.
[2024-05-28 22:05:42] [INFO ] Deduced a trap composed of 132 places in 332 ms of which 3 ms to minimize.
[2024-05-28 22:05:42] [INFO ] Deduced a trap composed of 135 places in 293 ms of which 3 ms to minimize.
[2024-05-28 22:05:42] [INFO ] Deduced a trap composed of 121 places in 294 ms of which 3 ms to minimize.
[2024-05-28 22:05:42] [INFO ] Deduced a trap composed of 131 places in 299 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-05-28 22:05:45] [INFO ] Deduced a trap composed of 222 places in 297 ms of which 5 ms to minimize.
[2024-05-28 22:05:46] [INFO ] Deduced a trap composed of 236 places in 309 ms of which 3 ms to minimize.
[2024-05-28 22:05:46] [INFO ] Deduced a trap composed of 182 places in 274 ms of which 4 ms to minimize.
[2024-05-28 22:05:46] [INFO ] Deduced a trap composed of 161 places in 223 ms of which 3 ms to minimize.
[2024-05-28 22:05:47] [INFO ] Deduced a trap composed of 171 places in 219 ms of which 3 ms to minimize.
[2024-05-28 22:05:47] [INFO ] Deduced a trap composed of 228 places in 291 ms of which 4 ms to minimize.
[2024-05-28 22:05:47] [INFO ] Deduced a trap composed of 171 places in 228 ms of which 3 ms to minimize.
[2024-05-28 22:05:47] [INFO ] Deduced a trap composed of 156 places in 282 ms of which 3 ms to minimize.
[2024-05-28 22:05:48] [INFO ] Deduced a trap composed of 176 places in 239 ms of which 4 ms to minimize.
SMT process timed out in 65198ms, After SMT, problems are : Problem set: 0 solved, 1240 unsolved
Search for dead transitions found 0 dead transitions in 65217ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 98459 ms. Remains : 580/580 places, 1251/1251 transitions.
Built C files in :
/tmp/ltsmin10338876470988622522
[2024-05-28 22:05:48] [INFO ] Computing symmetric may disable matrix : 1251 transitions.
[2024-05-28 22:05:48] [INFO ] Computation of Complete disable matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 22:05:48] [INFO ] Computing symmetric may enable matrix : 1251 transitions.
[2024-05-28 22:05:48] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 22:05:48] [INFO ] Computing Do-Not-Accords matrix : 1251 transitions.
[2024-05-28 22:05:48] [INFO ] Computation of Completed DNA matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 22:05:48] [INFO ] Built C files in 360ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10338876470988622522
Running compilation step : cd /tmp/ltsmin10338876470988622522;'/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/ltsmin10338876470988622522;'/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/ltsmin10338876470988622522;'/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 22:05:51] [INFO ] Flatten gal took : 71 ms
[2024-05-28 22:05:51] [INFO ] Flatten gal took : 62 ms
[2024-05-28 22:05:51] [INFO ] Time to serialize gal into /tmp/LTL9825077079013350644.gal : 16 ms
[2024-05-28 22:05:52] [INFO ] Time to serialize properties into /tmp/LTL5912737346035247559.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/LTL9825077079013350644.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16584561497744952097.hoa' '-atoms' '/tmp/LTL5912737346035247559.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/LTL5912737346035247559.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16584561497744952097.hoa
Detected timeout of ITS tools.
[2024-05-28 22:06:07] [INFO ] Flatten gal took : 67 ms
[2024-05-28 22:06:07] [INFO ] Flatten gal took : 66 ms
[2024-05-28 22:06:07] [INFO ] Time to serialize gal into /tmp/LTL13349085497945073647.gal : 17 ms
[2024-05-28 22:06:07] [INFO ] Time to serialize properties into /tmp/LTL11548371380107870582.ltl : 14 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/LTL13349085497945073647.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11548371380107870582.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((mi1<1)||(QueueJobB_1_14<1))||(block<1))&&(((mi1<1)||(QueueJobB_1_17<1))||(block<1)))&&((((mi1<1)||(QueueJobB_1_9<1))||...1446
Formula 0 simplified : FG!"((((((((mi1<1)||(QueueJobB_1_14<1))||(block<1))&&(((mi1<1)||(QueueJobB_1_17<1))||(block<1)))&&((((mi1<1)||(QueueJobB_1_9<1))||(b...1440
Detected timeout of ITS tools.
[2024-05-28 22:06:22] [INFO ] Flatten gal took : 71 ms
[2024-05-28 22:06:22] [INFO ] Applying decomposition
[2024-05-28 22:06:22] [INFO ] Flatten gal took : 65 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/graph7317876034741082160.txt' '-o' '/tmp/graph7317876034741082160.bin' '-w' '/tmp/graph7317876034741082160.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7317876034741082160.bin' '-l' '-1' '-v' '-w' '/tmp/graph7317876034741082160.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:06:22] [INFO ] Decomposing Gal with order
[2024-05-28 22:06:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:06:23] [INFO ] Removed a total of 3070 redundant transitions.
[2024-05-28 22:06:23] [INFO ] Flatten gal took : 239 ms
[2024-05-28 22:06:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 345 labels/synchronizations in 97 ms.
[2024-05-28 22:06:23] [INFO ] Time to serialize gal into /tmp/LTL3855883172904236653.gal : 37 ms
[2024-05-28 22:06:23] [INFO ] Time to serialize properties into /tmp/LTL10266100299259947665.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/LTL3855883172904236653.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10266100299259947665.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("((((((((i6.u39.mi1<1)||(i6.u39.QueueJobB_1_14<1))||(i6.u39.block<1))&&(((i6.u39.mi1<1)||(i6.u39.QueueJobB_1_17<1))||(i6.u39.bl...2097
Formula 0 simplified : FG!"((((((((i6.u39.mi1<1)||(i6.u39.QueueJobB_1_14<1))||(i6.u39.block<1))&&(((i6.u39.mi1<1)||(i6.u39.QueueJobB_1_17<1))||(i6.u39.bloc...2091
Detected timeout of ITS tools.
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-02 finished in 426949 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&&(!p1 U (p2||G(!p1)))))))'
Support contains 14 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1939
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1939
Applied a total of 12 rules in 71 ms. Remains 653 /664 variables (removed 11) and now considering 1939/1940 (removed 1) transitions.
Running 1928 sub problems to find dead transitions.
[2024-05-28 22:06:38] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
// Phase 1: matrix 1930 rows 653 cols
[2024-05-28 22:06:38] [INFO ] Computed 82 invariants in 40 ms
[2024-05-28 22:06:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1928/928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/928 constraints, Known Traps: 0/0 constraints]
After SMT, in 57457ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 57485ms
[2024-05-28 22:07:36] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-05-28 22:07:36] [INFO ] Invariant cache hit.
[2024-05-28 22:07:36] [INFO ] Implicit Places using invariants in 759 ms returned []
[2024-05-28 22:07:36] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-05-28 22:07:36] [INFO ] Invariant cache hit.
[2024-05-28 22:07:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:07:44] [INFO ] Implicit Places using invariants and state equation in 7828 ms returned []
Implicit Place search using SMT with State Equation took 8591 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2024-05-28 22:07:44] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-05-28 22:07:44] [INFO ] Invariant cache hit.
[2024-05-28 22:07:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 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 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1928/928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Problem TDEAD26 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD879 is UNSAT
At refinement iteration 3 (OVERLAPS) 11/653 variables, 11/82 constraints. Problems are: Problem set: 126 solved, 1802 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 653/2583 variables, and 82 constraints, problems are : Problem set: 126 solved, 1802 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/928 constraints, Known Traps: 0/0 constraints]
After SMT, in 81165ms problems are : Problem set: 126 solved, 1802 unsolved
Search for dead transitions found 126 dead transitions in 81182ms
Found 126 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 126 transitions
Dead transitions reduction (with SMT) removed 126 transitions
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1813/1940 transitions.
Applied a total of 0 rules in 16 ms. Remains 653 /653 variables (removed 0) and now considering 1813/1813 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 147357 ms. Remains : 653/664 places, 1813/1940 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-05
Product exploration explored 100000 steps with 5604 reset in 1417 ms.
Entered a terminal (fully accepting) state of product in 2201 steps with 123 reset in 56 ms.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-05 finished in 149002 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(F(p0))))'
Support contains 1 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1939
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1939
Applied a total of 12 rules in 73 ms. Remains 653 /664 variables (removed 11) and now considering 1939/1940 (removed 1) transitions.
Running 1928 sub problems to find dead transitions.
[2024-05-28 22:09:07] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-05-28 22:09:07] [INFO ] Invariant cache hit.
[2024-05-28 22:09:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 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 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 (/ 1.0 3.0))
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 1.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)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1928/928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/928 constraints, Known Traps: 0/0 constraints]
After SMT, in 60465ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60495ms
[2024-05-28 22:10:08] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-05-28 22:10:08] [INFO ] Invariant cache hit.
[2024-05-28 22:10:08] [INFO ] Implicit Places using invariants in 770 ms returned []
[2024-05-28 22:10:08] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-05-28 22:10:08] [INFO ] Invariant cache hit.
[2024-05-28 22:10:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:10:18] [INFO ] Implicit Places using invariants and state equation in 9882 ms returned []
Implicit Place search using SMT with State Equation took 10656 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2024-05-28 22:10:18] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-05-28 22:10:18] [INFO ] Invariant cache hit.
[2024-05-28 22:10:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1928/928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
SMT process timed out in 79683ms, After SMT, problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 79703ms
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1939/1940 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150945 ms. Remains : 653/664 places, 1939/1940 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-06
Product exploration explored 100000 steps with 6960 reset in 1159 ms.
Product exploration explored 100000 steps with 6944 reset in 926 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 (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 55 steps (0 resets) in 5 ms. (9 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-28 22:11:41] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-05-28 22:11:41] [INFO ] Invariant cache hit.
[2024-05-28 22:11:42] [INFO ] [Real]Absence check using 63 positive place invariants in 24 ms returned sat
[2024-05-28 22:11:42] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 87 ms returned sat
[2024-05-28 22:11:45] [INFO ] [Real]Absence check using state equation in 2614 ms returned sat
[2024-05-28 22:11:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 22:11:46] [INFO ] [Nat]Absence check using 63 positive place invariants in 25 ms returned sat
[2024-05-28 22:11:46] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 54 ms returned sat
[2024-05-28 22:11:48] [INFO ] [Nat]Absence check using state equation in 2010 ms returned sat
[2024-05-28 22:11:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:11:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 120 ms returned sat
[2024-05-28 22:11:49] [INFO ] Computed and/alt/rep : 1446/4712/1446 causal constraints (skipped 473 transitions) in 246 ms.
[2024-05-28 22:11:49] [INFO ] Added : 18 causal constraints over 4 iterations in 868 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 653/653 places, 1939/1939 transitions.
Applied a total of 0 rules in 20 ms. Remains 653 /653 variables (removed 0) and now considering 1939/1939 (removed 0) transitions.
Running 1928 sub problems to find dead transitions.
[2024-05-28 22:11:49] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-05-28 22:11:49] [INFO ] Invariant cache hit.
[2024-05-28 22:11:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20052 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1928/928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/928 constraints, Known Traps: 0/0 constraints]
After SMT, in 58974ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 58998ms
[2024-05-28 22:12:48] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-05-28 22:12:48] [INFO ] Invariant cache hit.
[2024-05-28 22:12:49] [INFO ] Implicit Places using invariants in 1097 ms returned []
[2024-05-28 22:12:49] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-05-28 22:12:49] [INFO ] Invariant cache hit.
[2024-05-28 22:12:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:12:59] [INFO ] Implicit Places using invariants and state equation in 9588 ms returned []
Implicit Place search using SMT with State Equation took 10687 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2024-05-28 22:12:59] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-05-28 22:12:59] [INFO ] Invariant cache hit.
[2024-05-28 22:12:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1928/928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Problem TDEAD26 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD766 is UNSAT
At refinement iteration 3 (OVERLAPS) 11/653 variables, 11/82 constraints. Problems are: Problem set: 90 solved, 1838 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 653/2583 variables, and 82 constraints, problems are : Problem set: 90 solved, 1838 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/928 constraints, Known Traps: 0/0 constraints]
After SMT, in 78133ms problems are : Problem set: 90 solved, 1838 unsolved
Search for dead transitions found 90 dead transitions in 78167ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) removed 90 transitions
Starting structural reductions in LTL mode, iteration 1 : 653/653 places, 1849/1939 transitions.
Applied a total of 0 rules in 25 ms. Remains 653 /653 variables (removed 0) and now considering 1849/1849 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 147907 ms. Remains : 653/653 places, 1849/1939 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 (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 148 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 55 steps (0 resets) in 5 ms. (9 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-28 22:14:18] [INFO ] Flow matrix only has 1840 transitions (discarded 9 similar events)
// Phase 1: matrix 1840 rows 653 cols
[2024-05-28 22:14:18] [INFO ] Computed 82 invariants in 25 ms
[2024-05-28 22:14:19] [INFO ] [Real]Absence check using 63 positive place invariants in 23 ms returned sat
[2024-05-28 22:14:19] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 61 ms returned sat
[2024-05-28 22:14:22] [INFO ] [Real]Absence check using state equation in 2972 ms returned sat
[2024-05-28 22:14:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 22:14:23] [INFO ] [Nat]Absence check using 63 positive place invariants in 21 ms returned sat
[2024-05-28 22:14:23] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 65 ms returned sat
[2024-05-28 22:14:25] [INFO ] [Nat]Absence check using state equation in 1848 ms returned sat
[2024-05-28 22:14:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:14:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 47 ms returned sat
[2024-05-28 22:14:25] [INFO ] Computed and/alt/rep : 1356/4458/1356 causal constraints (skipped 473 transitions) in 164 ms.
[2024-05-28 22:14:26] [INFO ] Added : 14 causal constraints over 3 iterations in 729 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6958 reset in 1205 ms.
Product exploration explored 100000 steps with 6949 reset in 932 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 653 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 653/653 places, 1849/1849 transitions.
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 653 transition count 1849
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 33 place count 653 transition count 1850
Deduced a syphon composed of 35 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 653 transition count 1850
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 71 places in 1 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 71 place count 653 transition count 1850
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 104 place count 620 transition count 1817
Deduced a syphon composed of 38 places in 2 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 137 place count 620 transition count 1817
Deduced a syphon composed of 38 places in 1 ms
Applied a total of 137 rules in 316 ms. Remains 620 /653 variables (removed 33) and now considering 1817/1849 (removed 32) transitions.
Running 1806 sub problems to find dead transitions.
[2024-05-28 22:14:29] [INFO ] Flow matrix only has 1808 transitions (discarded 9 similar events)
// Phase 1: matrix 1808 rows 620 cols
[2024-05-28 22:14:29] [INFO ] Computed 82 invariants in 24 ms
[2024-05-28 22:14:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1806 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1806 unsolved
[2024-05-28 22:15:07] [INFO ] Deduced a trap composed of 44 places in 305 ms of which 8 ms to minimize.
Problem TDEAD240 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD611 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 610/2428 variables, and 73 constraints, problems are : Problem set: 11 solved, 1795 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/620 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1806/1806 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 11 solved, 1795 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 56/56 constraints. Problems are: Problem set: 11 solved, 1795 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 5/61 constraints. Problems are: Problem set: 11 solved, 1795 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/600 variables, 1/62 constraints. Problems are: Problem set: 11 solved, 1795 unsolved
[2024-05-28 22:15:13] [INFO ] Deduced a trap composed of 7 places in 417 ms of which 3 ms to minimize.
[2024-05-28 22:15:14] [INFO ] Deduced a trap composed of 7 places in 378 ms of which 3 ms to minimize.
[2024-05-28 22:15:14] [INFO ] Deduced a trap composed of 7 places in 353 ms of which 2 ms to minimize.
[2024-05-28 22:15:14] [INFO ] Deduced a trap composed of 7 places in 395 ms of which 2 ms to minimize.
[2024-05-28 22:15:15] [INFO ] Deduced a trap composed of 7 places in 379 ms of which 2 ms to minimize.
[2024-05-28 22:15:15] [INFO ] Deduced a trap composed of 7 places in 395 ms of which 2 ms to minimize.
[2024-05-28 22:15:16] [INFO ] Deduced a trap composed of 7 places in 370 ms of which 2 ms to minimize.
[2024-05-28 22:15:16] [INFO ] Deduced a trap composed of 9 places in 374 ms of which 2 ms to minimize.
[2024-05-28 22:15:16] [INFO ] Deduced a trap composed of 20 places in 351 ms of which 2 ms to minimize.
[2024-05-28 22:15:16] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-28 22:15:17] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-05-28 22:15:17] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-28 22:15:17] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-28 22:15:17] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-28 22:15:17] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-28 22:15:17] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-28 22:15:18] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-28 22:15:18] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-05-28 22:15:18] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
Problem TDEAD104 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD222 is UNSAT
[2024-05-28 22:15:19] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1299 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/600 variables, 20/82 constraints. Problems are: Problem set: 24 solved, 1782 unsolved
[2024-05-28 22:15:20] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2024-05-28 22:15:20] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-28 22:15:20] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-28 22:15:20] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-28 22:15:20] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-28 22:15:20] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2024-05-28 22:15:21] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
Problem TDEAD1286 is UNSAT
[2024-05-28 22:15:31] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
Problem TDEAD1288 is UNSAT
Problem TDEAD1289 is UNSAT
[2024-05-28 22:15:31] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 1 ms to minimize.
Problem TDEAD1292 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1298 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 600/2428 variables, and 91 constraints, problems are : Problem set: 31 solved, 1775 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 56/63 constraints, Generalized P Invariants (flows): 5/19 constraints, State Equation: 0/620 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1806 constraints, Known Traps: 30/30 constraints]
After SMT, in 62891ms problems are : Problem set: 31 solved, 1775 unsolved
Search for dead transitions found 31 dead transitions in 62929ms
Found 31 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 31 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 31 transitions.
[2024-05-28 22:15:32] [INFO ] Redundant transitions in 39 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 620/653 places, 1786/1849 transitions.
Graph (complete) has 3467 edges and 620 vertex of which 590 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.5 ms
Discarding 30 places :
Also discarding 0 output transitions
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 1 rules in 45 ms. Remains 590 /620 variables (removed 30) and now considering 1786/1786 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 590/653 places, 1786/1849 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 63343 ms. Remains : 590/653 places, 1786/1849 transitions.
Built C files in :
/tmp/ltsmin310386558408942959
[2024-05-28 22:15:32] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin310386558408942959
Running compilation step : cd /tmp/ltsmin310386558408942959;'/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/ltsmin310386558408942959;'/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/ltsmin310386558408942959;'/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 1 out of 653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 653/653 places, 1849/1849 transitions.
Applied a total of 0 rules in 43 ms. Remains 653 /653 variables (removed 0) and now considering 1849/1849 (removed 0) transitions.
Running 1838 sub problems to find dead transitions.
[2024-05-28 22:15:35] [INFO ] Flow matrix only has 1840 transitions (discarded 9 similar events)
// Phase 1: matrix 1840 rows 653 cols
[2024-05-28 22:15:35] [INFO ] Computed 82 invariants in 40 ms
[2024-05-28 22:15:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1838 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1838 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2493 variables, and 71 constraints, problems are : Problem set: 0 solved, 1838 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1838/1838 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1838 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1838 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1838 unsolved
[2024-05-28 22:16:24] [INFO ] Deduced a trap composed of 19 places in 406 ms of which 3 ms to minimize.
[2024-05-28 22:16:26] [INFO ] Deduced a trap composed of 84 places in 174 ms of which 2 ms to minimize.
[2024-05-28 22:16:27] [INFO ] Deduced a trap composed of 82 places in 206 ms of which 2 ms to minimize.
[2024-05-28 22:16:29] [INFO ] Deduced a trap composed of 83 places in 156 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2493 variables, and 75 constraints, problems are : Problem set: 0 solved, 1838 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1838 constraints, Known Traps: 4/4 constraints]
After SMT, in 61597ms problems are : Problem set: 0 solved, 1838 unsolved
Search for dead transitions found 0 dead transitions in 61625ms
[2024-05-28 22:16:36] [INFO ] Flow matrix only has 1840 transitions (discarded 9 similar events)
[2024-05-28 22:16:36] [INFO ] Invariant cache hit.
[2024-05-28 22:16:37] [INFO ] Implicit Places using invariants in 964 ms returned []
[2024-05-28 22:16:37] [INFO ] Flow matrix only has 1840 transitions (discarded 9 similar events)
[2024-05-28 22:16:37] [INFO ] Invariant cache hit.
[2024-05-28 22:16:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:16:49] [INFO ] Implicit Places using invariants and state equation in 11578 ms returned []
Implicit Place search using SMT with State Equation took 12544 ms to find 0 implicit places.
Running 1838 sub problems to find dead transitions.
[2024-05-28 22:16:49] [INFO ] Flow matrix only has 1840 transitions (discarded 9 similar events)
[2024-05-28 22:16:49] [INFO ] Invariant cache hit.
[2024-05-28 22:16:49] [INFO ] State equation strengthened by 1 read => feed constraints.

BK_STOP 1716934616475

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-PT-S10J30"
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 PolyORBNT-PT-S10J30, 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-171654447200492"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S10J30.tgz
mv PolyORBNT-PT-S10J30 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;