MCC'2024- Execution of r290-tajo-171654447100419

About the Execution of ITS-Tools for PolyORBNT-COL-S10J40

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
16205.115	3600000.00	9213025.00	15826.60	F?TTTFTTTFTTFFFF	normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 8.5K Apr 12 11:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 12 11:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 12 10:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 12 10:43 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 4.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 13:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 12 13:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 13:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 12 13:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 93K 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-COL-S10J40-LTLCardinality-00
FORMULA_NAME PolyORBNT-COL-S10J40-LTLCardinality-01
FORMULA_NAME PolyORBNT-COL-S10J40-LTLCardinality-02
FORMULA_NAME PolyORBNT-COL-S10J40-LTLCardinality-03
FORMULA_NAME PolyORBNT-COL-S10J40-LTLCardinality-04
FORMULA_NAME PolyORBNT-COL-S10J40-LTLCardinality-05
FORMULA_NAME PolyORBNT-COL-S10J40-LTLCardinality-06
FORMULA_NAME PolyORBNT-COL-S10J40-LTLCardinality-07
FORMULA_NAME PolyORBNT-COL-S10J40-LTLCardinality-08
FORMULA_NAME PolyORBNT-COL-S10J40-LTLCardinality-09
FORMULA_NAME PolyORBNT-COL-S10J40-LTLCardinality-10
FORMULA_NAME PolyORBNT-COL-S10J40-LTLCardinality-11
FORMULA_NAME PolyORBNT-COL-S10J40-LTLCardinality-12
FORMULA_NAME PolyORBNT-COL-S10J40-LTLCardinality-13
FORMULA_NAME PolyORBNT-COL-S10J40-LTLCardinality-14
FORMULA_NAME PolyORBNT-COL-S10J40-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716927395286

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J40
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202405141337
[2024-05-28 20:16:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 20:16:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 20:16:36] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 20:16:37] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 20:16:37] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 732 ms
[2024-05-28 20:16:37] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 894 PT places and 12462.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 20:16:37] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 5 ms.
[2024-05-28 20:16:37] [INFO ] Skeletonized 16 HLPN properties in 5 ms.
Initial state reduction rules removed 4 formulas.
FORMULA PolyORBNT-COL-S10J40-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J40-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J40-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J40-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40007 steps (2285 resets) in 977 ms. (40 steps per ms) remains 6/28 properties
BEST_FIRST walk for 40003 steps (749 resets) in 201 ms. (198 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40001 steps (807 resets) in 178 ms. (223 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40001 steps (811 resets) in 129 ms. (307 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (795 resets) in 128 ms. (310 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (818 resets) in 50 ms. (784 steps per ms) remains 4/4 properties
// Phase 1: matrix 38 rows 48 cols
[2024-05-28 20:16:38] [INFO ] Computed 13 invariants in 8 ms
[2024-05-28 20:16:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp7 is UNSAT
At refinement iteration 1 (OVERLAPS) 11/16 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp18 is UNSAT
At refinement iteration 3 (OVERLAPS) 24/40 variables, 6/8 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-05-28 20:16:38] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 1/9 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5/45 variables, 3/12 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-05-28 20:16:38] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/45 variables, 1/13 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/45 variables, 0/13 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/46 variables, 1/14 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/46 variables, 0/14 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Problem AtomicPropp3 is UNSAT
After SMT solving in domain Real declared 47/86 variables, and 15 constraints, problems are : Problem set: 4 solved, 0 unsolved in 350 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/48 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 393ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 12 simplifications.
FORMULA PolyORBNT-COL-S10J40-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 20:16:38] [INFO ] Flatten gal took : 40 ms
[2024-05-28 20:16:38] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA PolyORBNT-COL-S10J40-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 20:16:38] [INFO ] Flatten gal took : 6 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-28 20:16:39] [INFO ] Unfolded HLPN to a Petri net with 894 places and 12380 transitions 114079 arcs in 337 ms.
[2024-05-28 20:16:39] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Deduced a syphon composed of 40 places in 34 ms
Reduce places removed 40 places and 40 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 223 out of 854 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 854/854 places, 2230/2230 transitions.
Applied a total of 0 rules in 120 ms. Remains 854 /854 variables (removed 0) and now considering 2230/2230 (removed 0) transitions.
Running 2219 sub problems to find dead transitions.
[2024-05-28 20:16:39] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
// Phase 1: matrix 2221 rows 854 cols
[2024-05-28 20:16:39] [INFO ] Computed 112 invariants in 103 ms
[2024-05-28 20:16:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/833 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2219 unsolved
SMT process timed out in 42236ms, After SMT, problems are : Problem set: 0 solved, 2219 unsolved
Search for dead transitions found 0 dead transitions in 42321ms
[2024-05-28 20:17:21] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
[2024-05-28 20:17:21] [INFO ] Invariant cache hit.
[2024-05-28 20:17:22] [INFO ] Implicit Places using invariants in 783 ms returned []
[2024-05-28 20:17:22] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
[2024-05-28 20:17:22] [INFO ] Invariant cache hit.
[2024-05-28 20:17:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:17:27] [INFO ] Implicit Places using invariants and state equation in 4705 ms returned []
Implicit Place search using SMT with State Equation took 5496 ms to find 0 implicit places.
Running 2219 sub problems to find dead transitions.
[2024-05-28 20:17:27] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
[2024-05-28 20:17:27] [INFO ] Invariant cache hit.
[2024-05-28 20:17:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/833 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/833 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 2219 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.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 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 (/ 1.0 3.0))
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 2.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 (/ 2.0 3.0))
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 (/ 2.0 3.0))
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 (/ 1.0 3.0))
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 (/ 1.0 3.0))
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 1.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 1.0)
(s264 4.0)
(s265 4.0)
(s266 4.0)
(s267 4.0)
(s268 4.0)
(s269 4.0)
(s270 4.0)
(s271 4.0)
(s272 4.0)
(s273 4.0)
(s274 9.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 0.0)
(s287 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 833/3075 variables, and 91 constraints, problems are : Problem set: 0 solved, 2219 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 86/105 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/854 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2219/1219 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/833 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/833 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 2219 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 3)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 1)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 1)
(s257 1)
(s258 4)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 4)
(s265 4)
(s266 4)
(s267 4)
(s268 4)
(s269 4)
(s270 4)
(s271 4)
(s272 4)
(s273 4)
(s274 9)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 833/3075 variables, and 91 constraints, problems are : Problem set: 0 solved, 2219 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 86/105 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/854 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1219 constraints, Known Traps: 0/0 constraints]
After SMT, in 80949ms problems are : Problem set: 0 solved, 2219 unsolved
Search for dead transitions found 0 dead transitions in 80992ms
Finished structural reductions in LTL mode , in 1 iterations and 128970 ms. Remains : 854/854 places, 2230/2230 transitions.
Support contains 223 out of 854 places after structural reductions.
[2024-05-28 20:18:48] [INFO ] Flatten gal took : 243 ms
[2024-05-28 20:18:48] [INFO ] Flatten gal took : 178 ms
[2024-05-28 20:18:49] [INFO ] Input system was already deterministic with 2230 transitions.
Support contains 180 out of 854 places (down from 223) after GAL structural reductions.
RANDOM walk for 40000 steps (2238 resets) in 3187 ms. (12 steps per ms) remains 10/22 properties
BEST_FIRST walk for 40003 steps (115 resets) in 242 ms. (164 steps per ms) remains 3/10 properties
BEST_FIRST walk for 40003 steps (416 resets) in 266 ms. (149 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (420 resets) in 330 ms. (120 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (421 resets) in 250 ms. (159 steps per ms) remains 3/3 properties
[2024-05-28 20:18:50] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
[2024-05-28 20:18:50] [INFO ] Invariant cache hit.
[2024-05-28 20:18:50] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 350/394 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 411/805 variables, 42/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/805 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 36/841 variables, 18/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/841 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp13 is UNSAT
At refinement iteration 7 (OVERLAPS) 11/852 variables, 7/111 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/852 variables, 0/111 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/853 variables, 1/112 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/853 variables, 0/112 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2221/3074 variables, 853/965 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3074 variables, 1/966 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3074 variables, 0/966 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/3075 variables, 1/967 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3075 variables, 0/967 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/3075 variables, 0/967 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3075/3075 variables, and 967 constraints, problems are : Problem set: 2 solved, 1 unsolved in 1618 ms.
Refiners :[Positive P Invariants (semi-flows): 105/105 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 854/854 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 351/393 variables, 44/44 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 0/44 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 411/804 variables, 42/86 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/804 variables, 0/86 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 36/840 variables, 18/104 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/840 variables, 0/104 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 12/852 variables, 7/111 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/852 variables, 0/111 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/853 variables, 1/112 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/853 variables, 0/112 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2221/3074 variables, 853/965 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3074 variables, 1/966 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3074 variables, 1/967 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3074 variables, 0/967 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/3075 variables, 1/968 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3075 variables, 0/968 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/3075 variables, 0/968 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3075/3075 variables, and 968 constraints, problems are : Problem set: 2 solved, 1 unsolved in 1756 ms.
Refiners :[Positive P Invariants (semi-flows): 105/105 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 854/854 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 3419ms problems are : Problem set: 2 solved, 1 unsolved
Finished Parikh walk after 19 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=9 )
Parikh walk visited 1 properties in 21 ms.
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 24 out of 854 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 854/854 places, 2230/2230 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 844 transition count 2186
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 800 transition count 2186
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 88 place count 800 transition count 2142
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 176 place count 756 transition count 2142
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 177 place count 755 transition count 2141
Iterating global reduction 2 with 1 rules applied. Total rules applied 178 place count 755 transition count 2141
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 180 place count 754 transition count 2140
Applied a total of 180 rules in 340 ms. Remains 754 /854 variables (removed 100) and now considering 2140/2230 (removed 90) transitions.
Running 2129 sub problems to find dead transitions.
[2024-05-28 20:18:54] [INFO ] Flow matrix only has 2131 transitions (discarded 9 similar events)
// Phase 1: matrix 2131 rows 754 cols
[2024-05-28 20:18:54] [INFO ] Computed 102 invariants in 89 ms
[2024-05-28 20:18:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/744 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/744 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 2129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 744/2885 variables, and 92 constraints, problems are : Problem set: 0 solved, 2129 unsolved in 20056 ms.
Refiners :[Positive P Invariants (semi-flows): 86/95 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/754 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2129/1129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/744 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/744 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 2129 unsolved
[2024-05-28 20:19:40] [INFO ] Deduced a trap composed of 18 places in 436 ms of which 4 ms to minimize.
[2024-05-28 20:19:44] [INFO ] Deduced a trap composed of 118 places in 576 ms of which 6 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 1)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 1)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 1)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 1)
(s260 4)
(s261 4)
(s262 4)
(s263 4)
(s264 4)
(s265 4)
(s266 4)
(s267 4)
(s268 4)
(s269 4)
(s270 8)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 1)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)timeout

(s342 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 744/2885 variables, and 94 constraints, problems are : Problem set: 0 solved, 2129 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 86/95 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/754 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1129 constraints, Known Traps: 2/2 constraints]
After SMT, in 62744ms problems are : Problem set: 0 solved, 2129 unsolved
Search for dead transitions found 0 dead transitions in 62774ms
[2024-05-28 20:19:57] [INFO ] Flow matrix only has 2131 transitions (discarded 9 similar events)
[2024-05-28 20:19:57] [INFO ] Invariant cache hit.
[2024-05-28 20:19:58] [INFO ] Implicit Places using invariants in 709 ms returned []
[2024-05-28 20:19:58] [INFO ] Flow matrix only has 2131 transitions (discarded 9 similar events)
[2024-05-28 20:19:58] [INFO ] Invariant cache hit.
[2024-05-28 20:19:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:20:03] [INFO ] Implicit Places using invariants and state equation in 5276 ms returned []
Implicit Place search using SMT with State Equation took 5988 ms to find 0 implicit places.
[2024-05-28 20:20:03] [INFO ] Redundant transitions in 160 ms returned []
Running 2129 sub problems to find dead transitions.
[2024-05-28 20:20:03] [INFO ] Flow matrix only has 2131 transitions (discarded 9 similar events)
[2024-05-28 20:20:03] [INFO ] Invariant cache hit.
[2024-05-28 20:20:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/744 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/744 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 2129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 744/2885 variables, and 92 constraints, problems are : Problem set: 0 solved, 2129 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 86/95 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/754 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2129/1129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/744 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/744 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 2129 unsolved
[2024-05-28 20:20:57] [INFO ] Deduced a trap composed of 18 places in 392 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/744 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 2129 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 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 1)
(s43 0)
(s44 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 744/2885 variables, and 93 constraints, problems are : Problem set: 0 solved, 2129 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 86/95 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/754 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1129 constraints, Known Traps: 1/1 constraints]
After SMT, in 81055ms problems are : Problem set: 0 solved, 2129 unsolved
Search for dead transitions found 0 dead transitions in 81116ms
Starting structural reductions in SI_LTL mode, iteration 1 : 754/854 places, 2140/2230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 150401 ms. Remains : 754/854 places, 2140/2230 transitions.
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBNT-COL-S10J40-LTLCardinality-00
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 2 ms.
FORMULA PolyORBNT-COL-S10J40-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J40-LTLCardinality-00 finished in 150747 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 854 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 854/854 places, 2230/2230 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 844 transition count 2184
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 798 transition count 2184
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 92 place count 798 transition count 2139
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 182 place count 753 transition count 2139
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 183 place count 752 transition count 2138
Iterating global reduction 2 with 1 rules applied. Total rules applied 184 place count 752 transition count 2138
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 2 with 4 rules applied. Total rules applied 188 place count 750 transition count 2136
Applied a total of 188 rules in 224 ms. Remains 750 /854 variables (removed 104) and now considering 2136/2230 (removed 94) transitions.
Running 2125 sub problems to find dead transitions.
[2024-05-28 20:21:25] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
// Phase 1: matrix 2127 rows 750 cols
[2024-05-28 20:21:25] [INFO ] Computed 102 invariants in 101 ms
[2024-05-28 20:21:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/740 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 740/2877 variables, and 92 constraints, problems are : Problem set: 0 solved, 2125 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 86/95 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/750 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2125/1125 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/740 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
[2024-05-28 20:22:07] [INFO ] Deduced a trap composed of 18 places in 565 ms of which 27 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 740/2877 variables, and 93 constraints, problems are : Problem set: 0 solved, 2125 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 86/95 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/750 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1125 constraints, Known Traps: 1/1 constraints]
After SMT, in 59821ms problems are : Problem set: 0 solved, 2125 unsolved
Search for dead transitions found 0 dead transitions in 59844ms
[2024-05-28 20:22:25] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-05-28 20:22:25] [INFO ] Invariant cache hit.
[2024-05-28 20:22:25] [INFO ] Implicit Places using invariants in 645 ms returned []
[2024-05-28 20:22:25] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-05-28 20:22:25] [INFO ] Invariant cache hit.
[2024-05-28 20:22:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:22:29] [INFO ] Implicit Places using invariants and state equation in 3699 ms returned []
Implicit Place search using SMT with State Equation took 4379 ms to find 0 implicit places.
[2024-05-28 20:22:29] [INFO ] Redundant transitions in 141 ms returned []
Running 2125 sub problems to find dead transitions.
[2024-05-28 20:22:29] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-05-28 20:22:29] [INFO ] Invariant cache hit.
[2024-05-28 20:22:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/740 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 740/2877 variables, and 92 constraints, problems are : Problem set: 0 solved, 2125 unsolved in 30081 ms.
Refiners :[Positive P Invariants (semi-flows): 86/95 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/750 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2125/1125 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/740 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/740 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 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 TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 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 TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD792 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 TDEAD805 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 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 TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 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 TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1019 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 TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 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 TDEAD1176 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1189 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 TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1249 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 TDEAD1263 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1366 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1371 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1375 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1381 is UNSAT
Problem TDEAD1382 is UNSAT
Problem TDEAD1383 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1390 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1396 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1401 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1403 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1409 is UNSAT
Problem TDEAD1410 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1417 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1420 is UNSAT
Problem TDEAD1421 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1423 is UNSAT
Problem TDEAD1424 is UNSAT
Problem TDEAD1427 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1432 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1440 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1447 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1454 is UNSAT
Problem TDEAD1455 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1465 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1475 is UNSAT
Problem TDEAD1476 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1479 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1501 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1503 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1505 is UNSAT
Problem TDEAD1506 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1508 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1514 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1523 is UNSAT
Problem TDEAD1529 is UNSAT
Problem TDEAD1536 is UNSAT
Problem TDEAD1537 is UNSAT
Problem TDEAD1538 is UNSAT
Problem TDEAD1539 is UNSAT
Problem TDEAD1540 is UNSAT
Problem TDEAD1541 is UNSAT
Problem TDEAD1542 is UNSAT
Problem TDEAD1543 is UNSAT
Problem TDEAD1544 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1554 is UNSAT
Problem TDEAD1559 is UNSAT
Problem TDEAD1565 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1581 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1585 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1604 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1634 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1637 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1643 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1647 is UNSAT
Problem TDEAD1650 is UNSAT
Problem TDEAD1654 is UNSAT
Problem TDEAD1659 is UNSAT
Problem TDEAD1665 is UNSAT
Problem TDEAD1672 is UNSAT
Problem TDEAD1680 is UNSAT
Problem TDEAD1689 is UNSAT
Problem TDEAD1699 is UNSAT
At refinement iteration 3 (OVERLAPS) 9/749 variables, 9/101 constraints. Problems are: Problem set: 558 solved, 1567 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 749/2877 variables, and 101 constraints, problems are : Problem set: 558 solved, 1567 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/750 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1125 constraints, Known Traps: 0/0 constraints]
After SMT, in 80181ms problems are : Problem set: 558 solved, 1567 unsolved
Search for dead transitions found 558 dead transitions in 80210ms
Found 558 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 558 transitions
Dead transitions reduction (with SMT) removed 558 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 750/854 places, 1578/2230 transitions.
Applied a total of 0 rules in 96 ms. Remains 750 /750 variables (removed 0) and now considering 1578/1578 (removed 0) transitions.
[2024-05-28 20:23:50] [INFO ] Redundant transitions in 29 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 144985 ms. Remains : 750/854 places, 1578/2230 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J40-LTLCardinality-01
Product exploration explored 100000 steps with 7294 reset in 1117 ms.
Product exploration explored 100000 steps with 7285 reset in 1380 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 142 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
RANDOM walk for 715 steps (58 resets) in 15 ms. (44 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 145 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Support contains 2 out of 750 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 750/750 places, 1578/1578 transitions.
Applied a total of 0 rules in 56 ms. Remains 750 /750 variables (removed 0) and now considering 1578/1578 (removed 0) transitions.
Running 1567 sub problems to find dead transitions.
[2024-05-28 20:23:53] [INFO ] Flow matrix only has 1569 transitions (discarded 9 similar events)
// Phase 1: matrix 1569 rows 750 cols
[2024-05-28 20:23:53] [INFO ] Computed 102 invariants in 83 ms
[2024-05-28 20:23:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/740 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
[2024-05-28 20:24:15] [INFO ] Deduced a trap composed of 298 places in 238 ms of which 4 ms to minimize.
[2024-05-28 20:24:16] [INFO ] Deduced a trap composed of 201 places in 465 ms of which 4 ms to minimize.
[2024-05-28 20:24:16] [INFO ] Deduced a trap composed of 300 places in 442 ms of which 4 ms to minimize.
[2024-05-28 20:24:17] [INFO ] Deduced a trap composed of 216 places in 440 ms of which 5 ms to minimize.
[2024-05-28 20:24:17] [INFO ] Deduced a trap composed of 206 places in 420 ms of which 6 ms to minimize.
[2024-05-28 20:24:17] [INFO ] Deduced a trap composed of 310 places in 332 ms of which 5 ms to minimize.
[2024-05-28 20:24:18] [INFO ] Deduced a trap composed of 221 places in 331 ms of which 6 ms to minimize.
[2024-05-28 20:24:18] [INFO ] Deduced a trap composed of 216 places in 322 ms of which 5 ms to minimize.
[2024-05-28 20:24:19] [INFO ] Deduced a trap composed of 191 places in 310 ms of which 6 ms to minimize.
[2024-05-28 20:24:19] [INFO ] Deduced a trap composed of 196 places in 306 ms of which 4 ms to minimize.
[2024-05-28 20:24:19] [INFO ] Deduced a trap composed of 191 places in 284 ms of which 3 ms to minimize.
[2024-05-28 20:24:19] [INFO ] Deduced a trap composed of 216 places in 295 ms of which 5 ms to minimize.
[2024-05-28 20:24:20] [INFO ] Deduced a trap composed of 211 places in 295 ms of which 5 ms to minimize.
[2024-05-28 20:24:20] [INFO ] Deduced a trap composed of 231 places in 255 ms of which 3 ms to minimize.
[2024-05-28 20:24:20] [INFO ] Deduced a trap composed of 216 places in 273 ms of which 5 ms to minimize.
[2024-05-28 20:24:21] [INFO ] Deduced a trap composed of 186 places in 381 ms of which 28 ms to minimize.
[2024-05-28 20:24:21] [INFO ] Deduced a trap composed of 211 places in 340 ms of which 4 ms to minimize.
SMT process timed out in 28508ms, After SMT, problems are : Problem set: 0 solved, 1567 unsolved
Search for dead transitions found 0 dead transitions in 28539ms
[2024-05-28 20:24:21] [INFO ] Flow matrix only has 1569 transitions (discarded 9 similar events)
[2024-05-28 20:24:21] [INFO ] Invariant cache hit.
[2024-05-28 20:24:22] [INFO ] Implicit Places using invariants in 748 ms returned []
[2024-05-28 20:24:22] [INFO ] Flow matrix only has 1569 transitions (discarded 9 similar events)
[2024-05-28 20:24:22] [INFO ] Invariant cache hit.
[2024-05-28 20:24:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:24:27] [INFO ] Implicit Places using invariants and state equation in 4556 ms returned []
Implicit Place search using SMT with State Equation took 5306 ms to find 0 implicit places.
[2024-05-28 20:24:27] [INFO ] Redundant transitions in 128 ms returned []
Running 1567 sub problems to find dead transitions.
[2024-05-28 20:24:27] [INFO ] Flow matrix only has 1569 transitions (discarded 9 similar events)
[2024-05-28 20:24:27] [INFO ] Invariant cache hit.
[2024-05-28 20:24:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/740 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
[2024-05-28 20:24:52] [INFO ] Deduced a trap composed of 206 places in 345 ms of which 5 ms to minimize.
[2024-05-28 20:24:52] [INFO ] Deduced a trap composed of 196 places in 332 ms of which 5 ms to minimize.
[2024-05-28 20:24:53] [INFO ] Deduced a trap composed of 196 places in 415 ms of which 6 ms to minimize.
[2024-05-28 20:24:53] [INFO ] Deduced a trap composed of 201 places in 341 ms of which 5 ms to minimize.
[2024-05-28 20:24:53] [INFO ] Deduced a trap composed of 186 places in 438 ms of which 3 ms to minimize.
[2024-05-28 20:24:54] [INFO ] Deduced a trap composed of 191 places in 452 ms of which 4 ms to minimize.
[2024-05-28 20:24:54] [INFO ] Deduced a trap composed of 221 places in 434 ms of which 4 ms to minimize.
[2024-05-28 20:24:55] [INFO ] Deduced a trap composed of 302 places in 422 ms of which 4 ms to minimize.
[2024-05-28 20:24:55] [INFO ] Deduced a trap composed of 211 places in 431 ms of which 4 ms to minimize.
[2024-05-28 20:24:56] [INFO ] Deduced a trap composed of 191 places in 346 ms of which 5 ms to minimize.
[2024-05-28 20:24:56] [INFO ] Deduced a trap composed of 191 places in 318 ms of which 5 ms to minimize.
[2024-05-28 20:24:56] [INFO ] Deduced a trap composed of 206 places in 307 ms of which 7 ms to minimize.
[2024-05-28 20:24:57] [INFO ] Deduced a trap composed of 201 places in 344 ms of which 5 ms to minimize.
[2024-05-28 20:24:57] [INFO ] Deduced a trap composed of 186 places in 345 ms of which 5 ms to minimize.
[2024-05-28 20:24:58] [INFO ] Deduced a trap composed of 211 places in 413 ms of which 4 ms to minimize.
[2024-05-28 20:24:58] [INFO ] Deduced a trap composed of 221 places in 353 ms of which 3 ms to minimize.
[2024-05-28 20:24:58] [INFO ] Deduced a trap composed of 221 places in 312 ms of which 5 ms to minimize.
[2024-05-28 20:24:59] [INFO ] Deduced a trap composed of 216 places in 334 ms of which 5 ms to minimize.
[2024-05-28 20:24:59] [INFO ] Deduced a trap composed of 216 places in 312 ms of which 5 ms to minimize.
[2024-05-28 20:24:59] [INFO ] Deduced a trap composed of 308 places in 318 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/740 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 740/2319 variables, and 112 constraints, problems are : Problem set: 0 solved, 1567 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 86/95 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/750 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1567/1567 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1567 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/740 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/740 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
[2024-05-28 20:25:08] [INFO ] Deduced a trap composed of 292 places in 251 ms of which 4 ms to minimize.
[2024-05-28 20:25:08] [INFO ] Deduced a trap composed of 292 places in 245 ms of which 3 ms to minimize.
[2024-05-28 20:25:09] [INFO ] Deduced a trap composed of 191 places in 296 ms of which 4 ms to minimize.
[2024-05-28 20:25:09] [INFO ] Deduced a trap composed of 186 places in 303 ms of which 5 ms to minimize.
[2024-05-28 20:25:09] [INFO ] Deduced a trap composed of 191 places in 249 ms of which 4 ms to minimize.
[2024-05-28 20:25:09] [INFO ] Deduced a trap composed of 191 places in 304 ms of which 5 ms to minimize.
[2024-05-28 20:25:10] [INFO ] Deduced a trap composed of 298 places in 251 ms of which 4 ms to minimize.
[2024-05-28 20:25:10] [INFO ] Deduced a trap composed of 186 places in 322 ms of which 6 ms to minimize.
[2024-05-28 20:25:10] [INFO ] Deduced a trap composed of 206 places in 344 ms of which 5 ms to minimize.
[2024-05-28 20:25:11] [INFO ] Deduced a trap composed of 201 places in 318 ms of which 5 ms to minimize.
[2024-05-28 20:25:11] [INFO ] Deduced a trap composed of 196 places in 276 ms of which 4 ms to minimize.
[2024-05-28 20:25:11] [INFO ] Deduced a trap composed of 294 places in 349 ms of which 5 ms to minimize.
[2024-05-28 20:25:12] [INFO ] Deduced a trap composed of 186 places in 352 ms of which 5 ms to minimize.
[2024-05-28 20:25:12] [INFO ] Deduced a trap composed of 201 places in 349 ms of which 14 ms to minimize.
[2024-05-28 20:25:13] [INFO ] Deduced a trap composed of 186 places in 354 ms of which 5 ms to minimize.
[2024-05-28 20:25:13] [INFO ] Deduced a trap composed of 186 places in 381 ms of which 5 ms to minimize.
[2024-05-28 20:25:13] [INFO ] Deduced a trap composed of 201 places in 353 ms of which 5 ms to minimize.
[2024-05-28 20:25:14] [INFO ] Deduced a trap composed of 196 places in 361 ms of which 5 ms to minimize.
[2024-05-28 20:25:14] [INFO ] Deduced a trap composed of 298 places in 343 ms of which 5 ms to minimize.
[2024-05-28 20:25:15] [INFO ] Deduced a trap composed of 191 places in 434 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/740 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
[2024-05-28 20:25:16] [INFO ] Deduced a trap composed of 306 places in 426 ms of which 4 ms to minimize.
[2024-05-28 20:25:16] [INFO ] Deduced a trap composed of 216 places in 439 ms of which 4 ms to minimize.
[2024-05-28 20:25:17] [INFO ] Deduced a trap composed of 206 places in 429 ms of which 4 ms to minimize.
[2024-05-28 20:25:17] [INFO ] Deduced a trap composed of 298 places in 330 ms of which 5 ms to minimize.
[2024-05-28 20:25:17] [INFO ] Deduced a trap composed of 191 places in 455 ms of which 4 ms to minimize.
[2024-05-28 20:25:18] [INFO ] Deduced a trap composed of 206 places in 334 ms of which 5 ms to minimize.
[2024-05-28 20:25:18] [INFO ] Deduced a trap composed of 191 places in 348 ms of which 5 ms to minimize.
[2024-05-28 20:25:19] [INFO ] Deduced a trap composed of 196 places in 353 ms of which 5 ms to minimize.
[2024-05-28 20:25:19] [INFO ] Deduced a trap composed of 191 places in 365 ms of which 4 ms to minimize.
[2024-05-28 20:25:19] [INFO ] Deduced a trap composed of 191 places in 347 ms of which 5 ms to minimize.
[2024-05-28 20:25:20] [INFO ] Deduced a trap composed of 294 places in 340 ms of which 5 ms to minimize.
[2024-05-28 20:25:20] [INFO ] Deduced a trap composed of 191 places in 332 ms of which 5 ms to minimize.
[2024-05-28 20:25:21] [INFO ] Deduced a trap composed of 196 places in 332 ms of which 5 ms to minimize.
[2024-05-28 20:25:21] [INFO ] Deduced a trap composed of 201 places in 372 ms of which 5 ms to minimize.
[2024-05-28 20:25:22] [INFO ] Deduced a trap composed of 216 places in 316 ms of which 5 ms to minimize.
[2024-05-28 20:25:22] [INFO ] Deduced a trap composed of 300 places in 302 ms of which 4 ms to minimize.
[2024-05-28 20:25:23] [INFO ] Deduced a trap composed of 308 places in 325 ms of which 5 ms to minimize.
[2024-05-28 20:25:23] [INFO ] Deduced a trap composed of 206 places in 339 ms of which 5 ms to minimize.
[2024-05-28 20:25:23] [INFO ] Deduced a trap composed of 206 places in 335 ms of which 5 ms to minimize.
[2024-05-28 20:25:24] [INFO ] Deduced a trap composed of 288 places in 349 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/740 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
[2024-05-28 20:25:26] [INFO ] Deduced a trap composed of 219 places in 341 ms of which 4 ms to minimize.
[2024-05-28 20:25:26] [INFO ] Deduced a trap composed of 213 places in 329 ms of which 5 ms to minimize.
[2024-05-28 20:25:27] [INFO ] Deduced a trap composed of 213 places in 398 ms of which 4 ms to minimize.
[2024-05-28 20:25:27] [INFO ] Deduced a trap composed of 237 places in 459 ms of which 4 ms to minimize.
[2024-05-28 20:25:28] [INFO ] Deduced a trap composed of 213 places in 346 ms of which 5 ms to minimize.
[2024-05-28 20:25:28] [INFO ] Deduced a trap composed of 201 places in 355 ms of which 5 ms to minimize.
[2024-05-28 20:25:28] [INFO ] Deduced a trap composed of 327 places in 366 ms of which 5 ms to minimize.
[2024-05-28 20:25:29] [INFO ] Deduced a trap composed of 219 places in 350 ms of which 5 ms to minimize.
[2024-05-28 20:25:29] [INFO ] Deduced a trap composed of 309 places in 435 ms of which 4 ms to minimize.
[2024-05-28 20:25:30] [INFO ] Deduced a trap composed of 219 places in 361 ms of which 5 ms to minimize.
[2024-05-28 20:25:30] [INFO ] Deduced a trap composed of 213 places in 338 ms of which 5 ms to minimize.
[2024-05-28 20:25:31] [INFO ] Deduced a trap composed of 219 places in 437 ms of which 4 ms to minimize.
[2024-05-28 20:25:31] [INFO ] Deduced a trap composed of 237 places in 355 ms of which 3 ms to minimize.
[2024-05-28 20:25:31] [INFO ] Deduced a trap composed of 189 places in 352 ms of which 5 ms to minimize.
[2024-05-28 20:25:32] [INFO ] Deduced a trap composed of 195 places in 343 ms of which 5 ms to minimize.
[2024-05-28 20:25:32] [INFO ] Deduced a trap composed of 225 places in 360 ms of which 4 ms to minimize.
[2024-05-28 20:25:33] [INFO ] Deduced a trap composed of 18 places in 257 ms of which 2 ms to minimize.
[2024-05-28 20:25:35] [INFO ] Deduced a trap composed of 220 places in 449 ms of which 6 ms to minimize.
[2024-05-28 20:25:36] [INFO ] Deduced a trap composed of 201 places in 470 ms of which 4 ms to minimize.
[2024-05-28 20:25:36] [INFO ] Deduced a trap composed of 206 places in 457 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/740 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 740/2319 variables, and 172 constraints, problems are : Problem set: 0 solved, 1567 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 86/95 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/750 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1567 constraints, Known Traps: 80/80 constraints]
After SMT, in 69547ms problems are : Problem set: 0 solved, 1567 unsolved
Search for dead transitions found 0 dead transitions in 69569ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 103640 ms. Remains : 750/750 places, 1578/1578 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 139 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
RANDOM walk for 544 steps (44 resets) in 14 ms. (36 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 148 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7300 reset in 920 ms.
Product exploration explored 100000 steps with 7234 reset in 924 ms.
Built C files in :
/tmp/ltsmin11522385422255056501
[2024-05-28 20:25:39] [INFO ] Too many transitions (1578) to apply POR reductions. Disabling POR matrices.
[2024-05-28 20:25:39] [INFO ] Built C files in 75ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11522385422255056501
Running compilation step : cd /tmp/ltsmin11522385422255056501;'/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/ltsmin11522385422255056501;'/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/ltsmin11522385422255056501;'/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 2 out of 750 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 750/750 places, 1578/1578 transitions.
Applied a total of 0 rules in 54 ms. Remains 750 /750 variables (removed 0) and now considering 1578/1578 (removed 0) transitions.
Running 1567 sub problems to find dead transitions.
[2024-05-28 20:25:42] [INFO ] Flow matrix only has 1569 transitions (discarded 9 similar events)
[2024-05-28 20:25:42] [INFO ] Invariant cache hit.
[2024-05-28 20:25:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/740 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
[2024-05-28 20:26:05] [INFO ] Deduced a trap composed of 206 places in 316 ms of which 4 ms to minimize.
[2024-05-28 20:26:05] [INFO ] Deduced a trap composed of 196 places in 282 ms of which 4 ms to minimize.
[2024-05-28 20:26:06] [INFO ] Deduced a trap composed of 196 places in 280 ms of which 4 ms to minimize.
[2024-05-28 20:26:06] [INFO ] Deduced a trap composed of 201 places in 307 ms of which 4 ms to minimize.
[2024-05-28 20:26:06] [INFO ] Deduced a trap composed of 186 places in 265 ms of which 4 ms to minimize.
[2024-05-28 20:26:07] [INFO ] Deduced a trap composed of 191 places in 282 ms of which 4 ms to minimize.
[2024-05-28 20:26:07] [INFO ] Deduced a trap composed of 221 places in 294 ms of which 4 ms to minimize.
[2024-05-28 20:26:07] [INFO ] Deduced a trap composed of 302 places in 272 ms of which 4 ms to minimize.
[2024-05-28 20:26:08] [INFO ] Deduced a trap composed of 211 places in 270 ms of which 4 ms to minimize.
[2024-05-28 20:26:08] [INFO ] Deduced a trap composed of 191 places in 288 ms of which 4 ms to minimize.
[2024-05-28 20:26:08] [INFO ] Deduced a trap composed of 191 places in 267 ms of which 4 ms to minimize.
[2024-05-28 20:26:09] [INFO ] Deduced a trap composed of 206 places in 294 ms of which 4 ms to minimize.
[2024-05-28 20:26:09] [INFO ] Deduced a trap composed of 201 places in 309 ms of which 4 ms to minimize.
[2024-05-28 20:26:09] [INFO ] Deduced a trap composed of 186 places in 272 ms of which 4 ms to minimize.
[2024-05-28 20:26:09] [INFO ] Deduced a trap composed of 211 places in 277 ms of which 4 ms to minimize.
[2024-05-28 20:26:10] [INFO ] Deduced a trap composed of 221 places in 264 ms of which 4 ms to minimize.
[2024-05-28 20:26:10] [INFO ] Deduced a trap composed of 221 places in 268 ms of which 4 ms to minimize.
SMT process timed out in 28122ms, After SMT, problems are : Problem set: 0 solved, 1567 unsolved
Search for dead transitions found 0 dead transitions in 28140ms
[2024-05-28 20:26:10] [INFO ] Flow matrix only has 1569 transitions (discarded 9 similar events)
[2024-05-28 20:26:10] [INFO ] Invariant cache hit.
[2024-05-28 20:26:11] [INFO ] Implicit Places using invariants in 667 ms returned []
[2024-05-28 20:26:11] [INFO ] Flow matrix only has 1569 transitions (discarded 9 similar events)
[2024-05-28 20:26:11] [INFO ] Invariant cache hit.
[2024-05-28 20:26:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:26:15] [INFO ] Implicit Places using invariants and state equation in 4178 ms returned []
Implicit Place search using SMT with State Equation took 4851 ms to find 0 implicit places.
[2024-05-28 20:26:15] [INFO ] Redundant transitions in 48 ms returned []
Running 1567 sub problems to find dead transitions.
[2024-05-28 20:26:15] [INFO ] Flow matrix only has 1569 transitions (discarded 9 similar events)
[2024-05-28 20:26:15] [INFO ] Invariant cache hit.
[2024-05-28 20:26:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/740 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
[2024-05-28 20:26:38] [INFO ] Deduced a trap composed of 206 places in 279 ms of which 4 ms to minimize.
[2024-05-28 20:26:38] [INFO ] Deduced a trap composed of 196 places in 290 ms of which 4 ms to minimize.
[2024-05-28 20:26:38] [INFO ] Deduced a trap composed of 196 places in 310 ms of which 5 ms to minimize.
[2024-05-28 20:26:39] [INFO ] Deduced a trap composed of 201 places in 336 ms of which 4 ms to minimize.
[2024-05-28 20:26:39] [INFO ] Deduced a trap composed of 186 places in 303 ms of which 4 ms to minimize.
[2024-05-28 20:26:39] [INFO ] Deduced a trap composed of 191 places in 288 ms of which 4 ms to minimize.
[2024-05-28 20:26:40] [INFO ] Deduced a trap composed of 221 places in 352 ms of which 4 ms to minimize.
[2024-05-28 20:26:40] [INFO ] Deduced a trap composed of 302 places in 310 ms of which 4 ms to minimize.
[2024-05-28 20:26:41] [INFO ] Deduced a trap composed of 211 places in 378 ms of which 6 ms to minimize.
[2024-05-28 20:26:41] [INFO ] Deduced a trap composed of 191 places in 317 ms of which 4 ms to minimize.
[2024-05-28 20:26:41] [INFO ] Deduced a trap composed of 191 places in 301 ms of which 4 ms to minimize.
[2024-05-28 20:26:42] [INFO ] Deduced a trap composed of 206 places in 306 ms of which 4 ms to minimize.
[2024-05-28 20:26:42] [INFO ] Deduced a trap composed of 201 places in 268 ms of which 3 ms to minimize.
[2024-05-28 20:26:42] [INFO ] Deduced a trap composed of 186 places in 263 ms of which 4 ms to minimize.
[2024-05-28 20:26:43] [INFO ] Deduced a trap composed of 211 places in 271 ms of which 4 ms to minimize.
[2024-05-28 20:26:43] [INFO ] Deduced a trap composed of 221 places in 278 ms of which 5 ms to minimize.
[2024-05-28 20:26:43] [INFO ] Deduced a trap composed of 221 places in 314 ms of which 5 ms to minimize.
[2024-05-28 20:26:44] [INFO ] Deduced a trap composed of 216 places in 312 ms of which 5 ms to minimize.
[2024-05-28 20:26:44] [INFO ] Deduced a trap composed of 216 places in 276 ms of which 4 ms to minimize.
[2024-05-28 20:26:44] [INFO ] Deduced a trap composed of 308 places in 251 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/740 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 (/ 1.0 3.0))
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 (/ 1.0 3.0))
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.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 (/ 2.0 3.0))
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 (/ 2.0 3.0))
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 740/2319 variables, and 112 constraints, problems are : Problem set: 0 solved, 1567 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 86/95 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/750 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1567/1567 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1567 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/740 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/740 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
[2024-05-28 20:26:55] [INFO ] Deduced a trap composed of 292 places in 329 ms of which 5 ms to minimize.
[2024-05-28 20:26:55] [INFO ] Deduced a trap composed of 292 places in 304 ms of which 5 ms to minimize.
[2024-05-28 20:26:56] [INFO ] Deduced a trap composed of 191 places in 336 ms of which 5 ms to minimize.
[2024-05-28 20:26:56] [INFO ] Deduced a trap composed of 186 places in 313 ms of which 4 ms to minimize.
[2024-05-28 20:26:56] [INFO ] Deduced a trap composed of 191 places in 327 ms of which 5 ms to minimize.
[2024-05-28 20:26:57] [INFO ] Deduced a trap composed of 191 places in 383 ms of which 5 ms to minimize.
[2024-05-28 20:26:57] [INFO ] Deduced a trap composed of 298 places in 351 ms of which 5 ms to minimize.
[2024-05-28 20:26:57] [INFO ] Deduced a trap composed of 186 places in 310 ms of which 4 ms to minimize.
[2024-05-28 20:26:58] [INFO ] Deduced a trap composed of 206 places in 286 ms of which 3 ms to minimize.
[2024-05-28 20:26:58] [INFO ] Deduced a trap composed of 201 places in 261 ms of which 4 ms to minimize.
[2024-05-28 20:26:58] [INFO ] Deduced a trap composed of 196 places in 260 ms of which 4 ms to minimize.
[2024-05-28 20:26:59] [INFO ] Deduced a trap composed of 294 places in 326 ms of which 5 ms to minimize.
[2024-05-28 20:26:59] [INFO ] Deduced a trap composed of 186 places in 317 ms of which 5 ms to minimize.
[2024-05-28 20:26:59] [INFO ] Deduced a trap composed of 201 places in 317 ms of which 5 ms to minimize.
[2024-05-28 20:27:00] [INFO ] Deduced a trap composed of 186 places in 336 ms of which 5 ms to minimize.
[2024-05-28 20:27:00] [INFO ] Deduced a trap composed of 186 places in 321 ms of which 5 ms to minimize.
[2024-05-28 20:27:00] [INFO ] Deduced a trap composed of 201 places in 331 ms of which 6 ms to minimize.
[2024-05-28 20:27:01] [INFO ] Deduced a trap composed of 196 places in 337 ms of which 5 ms to minimize.
[2024-05-28 20:27:01] [INFO ] Deduced a trap composed of 298 places in 331 ms of which 5 ms to minimize.
[2024-05-28 20:27:01] [INFO ] Deduced a trap composed of 191 places in 341 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/740 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
[2024-05-28 20:27:02] [INFO ] Deduced a trap composed of 306 places in 334 ms of which 5 ms to minimize.
[2024-05-28 20:27:03] [INFO ] Deduced a trap composed of 216 places in 339 ms of which 6 ms to minimize.
[2024-05-28 20:27:03] [INFO ] Deduced a trap composed of 206 places in 322 ms of which 6 ms to minimize.
[2024-05-28 20:27:03] [INFO ] Deduced a trap composed of 298 places in 291 ms of which 3 ms to minimize.
[2024-05-28 20:27:04] [INFO ] Deduced a trap composed of 191 places in 296 ms of which 3 ms to minimize.
[2024-05-28 20:27:04] [INFO ] Deduced a trap composed of 206 places in 294 ms of which 4 ms to minimize.
[2024-05-28 20:27:04] [INFO ] Deduced a trap composed of 191 places in 258 ms of which 4 ms to minimize.
[2024-05-28 20:27:05] [INFO ] Deduced a trap composed of 196 places in 262 ms of which 4 ms to minimize.
[2024-05-28 20:27:05] [INFO ] Deduced a trap composed of 191 places in 260 ms of which 4 ms to minimize.
[2024-05-28 20:27:05] [INFO ] Deduced a trap composed of 191 places in 344 ms of which 5 ms to minimize.
[2024-05-28 20:27:06] [INFO ] Deduced a trap composed of 294 places in 342 ms of which 5 ms to minimize.
[2024-05-28 20:27:06] [INFO ] Deduced a trap composed of 191 places in 414 ms of which 6 ms to minimize.
[2024-05-28 20:27:07] [INFO ] Deduced a trap composed of 196 places in 318 ms of which 4 ms to minimize.
[2024-05-28 20:27:07] [INFO ] Deduced a trap composed of 201 places in 336 ms of which 6 ms to minimize.
[2024-05-28 20:27:07] [INFO ] Deduced a trap composed of 216 places in 328 ms of which 5 ms to minimize.
[2024-05-28 20:27:08] [INFO ] Deduced a trap composed of 300 places in 324 ms of which 5 ms to minimize.
[2024-05-28 20:27:08] [INFO ] Deduced a trap composed of 308 places in 272 ms of which 3 ms to minimize.
[2024-05-28 20:27:08] [INFO ] Deduced a trap composed of 206 places in 264 ms of which 4 ms to minimize.
[2024-05-28 20:27:09] [INFO ] Deduced a trap composed of 206 places in 272 ms of which 4 ms to minimize.
[2024-05-28 20:27:09] [INFO ] Deduced a trap composed of 288 places in 278 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/740 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
[2024-05-28 20:27:10] [INFO ] Deduced a trap composed of 219 places in 336 ms of which 5 ms to minimize.
[2024-05-28 20:27:10] [INFO ] Deduced a trap composed of 213 places in 311 ms of which 5 ms to minimize.
[2024-05-28 20:27:11] [INFO ] Deduced a trap composed of 213 places in 320 ms of which 5 ms to minimize.
[2024-05-28 20:27:11] [INFO ] Deduced a trap composed of 237 places in 310 ms of which 5 ms to minimize.
[2024-05-28 20:27:11] [INFO ] Deduced a trap composed of 213 places in 327 ms of which 5 ms to minimize.
[2024-05-28 20:27:12] [INFO ] Deduced a trap composed of 201 places in 311 ms of which 5 ms to minimize.
[2024-05-28 20:27:12] [INFO ] Deduced a trap composed of 327 places in 273 ms of which 4 ms to minimize.
[2024-05-28 20:27:12] [INFO ] Deduced a trap composed of 219 places in 323 ms of which 4 ms to minimize.
[2024-05-28 20:27:13] [INFO ] Deduced a trap composed of 309 places in 297 ms of which 4 ms to minimize.
[2024-05-28 20:27:13] [INFO ] Deduced a trap composed of 219 places in 326 ms of which 4 ms to minimize.
[2024-05-28 20:27:13] [INFO ] Deduced a trap composed of 213 places in 286 ms of which 4 ms to minimize.
[2024-05-28 20:27:14] [INFO ] Deduced a trap composed of 219 places in 265 ms of which 3 ms to minimize.
[2024-05-28 20:27:14] [INFO ] Deduced a trap composed of 237 places in 364 ms of which 5 ms to minimize.
[2024-05-28 20:27:14] [INFO ] Deduced a trap composed of 189 places in 350 ms of which 5 ms to minimize.
[2024-05-28 20:27:15] [INFO ] Deduced a trap composed of 195 places in 400 ms of which 5 ms to minimize.
[2024-05-28 20:27:15] [INFO ] Deduced a trap composed of 225 places in 342 ms of which 5 ms to minimize.
[2024-05-28 20:27:17] [INFO ] Deduced a trap composed of 18 places in 323 ms of which 3 ms to minimize.
[2024-05-28 20:27:19] [INFO ] Deduced a trap composed of 220 places in 512 ms of which 5 ms to minimize.
[2024-05-28 20:27:19] [INFO ] Deduced a trap composed of 201 places in 435 ms of which 5 ms to minimize.
[2024-05-28 20:27:19] [INFO ] Deduced a trap composed of 206 places in 467 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/740 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
[2024-05-28 20:27:21] [INFO ] Deduced a trap composed of 304 places in 368 ms of which 5 ms to minimize.
[2024-05-28 20:27:21] [INFO ] Deduced a trap composed of 298 places in 418 ms of which 4 ms to minimize.
[2024-05-28 20:27:22] [INFO ] Deduced a trap composed of 294 places in 416 ms of which 4 ms to minimize.
[2024-05-28 20:27:22] [INFO ] Deduced a trap composed of 294 places in 326 ms of which 4 ms to minimize.
[2024-05-28 20:27:22] [INFO ] Deduced a trap composed of 302 places in 342 ms of which 4 ms to minimize.
[2024-05-28 20:27:23] [INFO ] Deduced a trap composed of 302 places in 309 ms of which 4 ms to minimize.
[2024-05-28 20:27:23] [INFO ] Deduced a trap composed of 286 places in 308 ms of which 4 ms to minimize.
SMT process timed out in 68173ms, After SMT, problems are : Problem set: 0 solved, 1567 unsolved
Search for dead transitions found 0 dead transitions in 68197ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 101308 ms. Remains : 750/750 places, 1578/1578 transitions.
Built C files in :
/tmp/ltsmin11629156172650729589
[2024-05-28 20:27:23] [INFO ] Too many transitions (1578) to apply POR reductions. Disabling POR matrices.
[2024-05-28 20:27:23] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11629156172650729589
Running compilation step : cd /tmp/ltsmin11629156172650729589;'/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/ltsmin11629156172650729589;'/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/ltsmin11629156172650729589;'/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 20:27:27] [INFO ] Flatten gal took : 116 ms
[2024-05-28 20:27:27] [INFO ] Flatten gal took : 112 ms
[2024-05-28 20:27:27] [INFO ] Time to serialize gal into /tmp/LTL1755587961672956560.gal : 35 ms
[2024-05-28 20:27:27] [INFO ] Time to serialize properties into /tmp/LTL407470859693863593.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/LTL1755587961672956560.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13042831137516519417.hoa' '-atoms' '/tmp/LTL407470859693863593.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL407470859693863593.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13042831137516519417.hoa
Detected timeout of ITS tools.
[2024-05-28 20:27:42] [INFO ] Flatten gal took : 73 ms
[2024-05-28 20:27:42] [INFO ] Flatten gal took : 77 ms
[2024-05-28 20:27:42] [INFO ] Time to serialize gal into /tmp/LTL2850459334595572693.gal : 14 ms
[2024-05-28 20:27:42] [INFO ] Time to serialize properties into /tmp/LTL1758802456275972124.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2850459334595572693.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1758802456275972124.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("(mo1<=mi1)"))))
Formula 0 simplified : GF!"(mo1<=mi1)"
Detected timeout of ITS tools.
[2024-05-28 20:27:57] [INFO ] Flatten gal took : 131 ms
[2024-05-28 20:27:57] [INFO ] Applying decomposition
[2024-05-28 20:27:57] [INFO ] Flatten gal took : 108 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/graph13648858488729143713.txt' '-o' '/tmp/graph13648858488729143713.bin' '-w' '/tmp/graph13648858488729143713.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13648858488729143713.bin' '-l' '-1' '-v' '-w' '/tmp/graph13648858488729143713.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:27:58] [INFO ] Decomposing Gal with order
[2024-05-28 20:27:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:27:58] [INFO ] Removed a total of 3818 redundant transitions.
[2024-05-28 20:27:58] [INFO ] Flatten gal took : 397 ms
[2024-05-28 20:27:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 661 labels/synchronizations in 108 ms.
[2024-05-28 20:27:59] [INFO ] Time to serialize gal into /tmp/LTL15331023780814891871.gal : 27 ms
[2024-05-28 20:27:59] [INFO ] Time to serialize properties into /tmp/LTL2004417228965330196.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15331023780814891871.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2004417228965330196.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(gu1.mo1<=gu1.mi1)"))))
Formula 0 simplified : GF!"(gu1.mo1<=gu1.mi1)"
Detected timeout of ITS tools.
Treatment of property PolyORBNT-COL-S10J40-LTLCardinality-01 finished in 409215 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((p0 U p1)))'
Support contains 53 out of 854 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 854/854 places, 2230/2230 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 844 transition count 2230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 843 transition count 2229
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 843 transition count 2229
Applied a total of 12 rules in 87 ms. Remains 843 /854 variables (removed 11) and now considering 2229/2230 (removed 1) transitions.
Running 2218 sub problems to find dead transitions.
[2024-05-28 20:28:14] [INFO ] Flow matrix only has 2220 transitions (discarded 9 similar events)
// Phase 1: matrix 2220 rows 843 cols
[2024-05-28 20:28:14] [INFO ] Computed 102 invariants in 47 ms
[2024-05-28 20:28:14] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 3.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 1.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 1.0)
(s264 4.0)
(s265 4.0)
(s266 4.0)
(s267 4.0)
(s268 4.0)
(s269 4.0)
(s270 4.0)
(s271 4.0)
(s272 4.0)
(s273 4.0)
(s274 9.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
SMT process timed out in 41446ms, After SMT, problems are : Problem set: 0 solved, 2218 unsolved
Search for dead transitions found 0 dead transitions in 41480ms
[2024-05-28 20:28:55] [INFO ] Flow matrix only has 2220 transitions (discarded 9 similar events)
[2024-05-28 20:28:55] [INFO ] Invariant cache hit.
[2024-05-28 20:28:56] [INFO ] Implicit Places using invariants in 797 ms returned []
[2024-05-28 20:28:56] [INFO ] Flow matrix only has 2220 transitions (discarded 9 similar events)
[2024-05-28 20:28:56] [INFO ] Invariant cache hit.
[2024-05-28 20:28:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:29:00] [INFO ] Implicit Places using invariants and state equation in 4060 ms returned []
Implicit Place search using SMT with State Equation took 4873 ms to find 0 implicit places.
Running 2218 sub problems to find dead transitions.
[2024-05-28 20:29:00] [INFO ] Flow matrix only has 2220 transitions (discarded 9 similar events)
[2024-05-28 20:29:00] [INFO ] Invariant cache hit.
[2024-05-28 20:29:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
SMT process timed out in 52351ms, After SMT, problems are : Problem set: 0 solved, 2218 unsolved
Search for dead transitions found 0 dead transitions in 52401ms
Starting structural reductions in LTL mode, iteration 1 : 843/854 places, 2229/2230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 98859 ms. Remains : 843/854 places, 2229/2230 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : PolyORBNT-COL-S10J40-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 848 ms.
Product exploration explored 100000 steps with 50000 reset in 984 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 32 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-COL-S10J40-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-COL-S10J40-LTLCardinality-03 finished in 100916 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 2 out of 854 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 854/854 places, 2230/2230 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 844 transition count 2185
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 799 transition count 2185
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 90 place count 799 transition count 2140
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 180 place count 754 transition count 2140
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 181 place count 753 transition count 2139
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 753 transition count 2139
Applied a total of 182 rules in 100 ms. Remains 753 /854 variables (removed 101) and now considering 2139/2230 (removed 91) transitions.
Running 2128 sub problems to find dead transitions.
[2024-05-28 20:29:55] [INFO ] Flow matrix only has 2130 transitions (discarded 9 similar events)
// Phase 1: matrix 2130 rows 753 cols
[2024-05-28 20:29:55] [INFO ] Computed 102 invariants in 37 ms
[2024-05-28 20:29:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/742 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2128 unsolved
SMT process timed out in 41669ms, After SMT, problems are : Problem set: 0 solved, 2128 unsolved
Search for dead transitions found 0 dead transitions in 41691ms
[2024-05-28 20:30:36] [INFO ] Flow matrix only has 2130 transitions (discarded 9 similar events)
[2024-05-28 20:30:36] [INFO ] Invariant cache hit.
[2024-05-28 20:30:37] [INFO ] Implicit Places using invariants in 816 ms returned []
[2024-05-28 20:30:37] [INFO ] Flow matrix only has 2130 transitions (discarded 9 similar events)
[2024-05-28 20:30:37] [INFO ] Invariant cache hit.
[2024-05-28 20:30:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:30:44] [INFO ] Implicit Places using invariants and state equation in 6291 ms returned []
Implicit Place search using SMT with State Equation took 7108 ms to find 0 implicit places.
[2024-05-28 20:30:44] [INFO ] Redundant transitions in 48 ms returned []
Running 2128 sub problems to find dead transitions.
[2024-05-28 20:30:44] [INFO ] Flow matrix only has 2130 transitions (discarded 9 similar events)
[2024-05-28 20:30:44] [INFO ] Invariant cache hit.
[2024-05-28 20:30:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/742 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/742 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 2128 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 742/2883 variables, and 91 constraints, problems are : Problem set: 0 solved, 2128 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 86/95 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/753 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2128/1128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/742 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/742 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 2128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/742 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2128 unsolved
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD765 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 TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 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 TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD813 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 TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 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 TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 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 TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1019 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 TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 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 TDEAD1176 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1189 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 TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1371 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1375 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1381 is UNSAT
Problem TDEAD1382 is UNSAT
Problem TDEAD1383 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1390 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1396 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1401 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1403 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1409 is UNSAT
Problem TDEAD1410 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1417 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1420 is UNSAT
Problem TDEAD1421 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1423 is UNSAT
Problem TDEAD1424 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1426 is UNSAT
Problem TDEAD1427 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1429 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1432 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1439 is UNSAT
Problem TDEAD1440 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1442 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 TDEAD1455 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1463 is UNSAT
Problem TDEAD1464 is UNSAT
Problem TDEAD1465 is UNSAT
Problem TDEAD1466 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1484 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1503 is UNSAT
Problem TDEAD1509 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1514 is UNSAT
Problem TDEAD1515 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1537 is UNSAT
Problem TDEAD1544 is UNSAT
Problem TDEAD1545 is UNSAT
Problem TDEAD1546 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1548 is UNSAT
Problem TDEAD1549 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1551 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1555 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1593 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1596 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1603 is UNSAT
Problem TDEAD1607 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1643 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1645 is UNSAT
Problem TDEAD1646 is UNSAT
Problem TDEAD1647 is UNSAT
Problem TDEAD1648 is UNSAT
Problem TDEAD1649 is UNSAT
Problem TDEAD1650 is UNSAT
Problem TDEAD1651 is UNSAT
Problem TDEAD1652 is UNSAT
Problem TDEAD1655 is UNSAT
Problem TDEAD1658 is UNSAT
Problem TDEAD1662 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1673 is UNSAT
Problem TDEAD1680 is UNSAT
Problem TDEAD1688 is UNSAT
Problem TDEAD1697 is UNSAT
Problem TDEAD1707 is UNSAT
At refinement iteration 3 (OVERLAPS) 9/751 variables, 9/100 constraints. Problems are: Problem set: 558 solved, 1570 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 751/2883 variables, and 100 constraints, problems are : Problem set: 558 solved, 1570 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/753 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1128 constraints, Known Traps: 0/0 constraints]
After SMT, in 82284ms problems are : Problem set: 558 solved, 1570 unsolved
Search for dead transitions found 558 dead transitions in 82313ms
Found 558 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 558 transitions
Dead transitions reduction (with SMT) removed 558 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 753/854 places, 1581/2230 transitions.
Applied a total of 0 rules in 31 ms. Remains 753 /753 variables (removed 0) and now considering 1581/1581 (removed 0) transitions.
[2024-05-28 20:32:06] [INFO ] Redundant transitions in 17 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 131383 ms. Remains : 753/854 places, 1581/2230 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J40-LTLCardinality-05
Stuttering criterion allowed to conclude after 90 steps with 13 reset in 1 ms.
FORMULA PolyORBNT-COL-S10J40-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J40-LTLCardinality-05 finished in 131518 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((p0||G(p1)||F(G(!p1)))))'
Support contains 53 out of 854 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 854/854 places, 2230/2230 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 844 transition count 2230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 843 transition count 2229
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 843 transition count 2229
Applied a total of 12 rules in 40 ms. Remains 843 /854 variables (removed 11) and now considering 2229/2230 (removed 1) transitions.
Running 2218 sub problems to find dead transitions.
[2024-05-28 20:32:06] [INFO ] Flow matrix only has 2220 transitions (discarded 9 similar events)
// Phase 1: matrix 2220 rows 843 cols
[2024-05-28 20:32:06] [INFO ] Computed 102 invariants in 38 ms
[2024-05-28 20:32:06] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
SMT process timed out in 40232ms, After SMT, problems are : Problem set: 0 solved, 2218 unsolved
Search for dead transitions found 0 dead transitions in 40256ms
[2024-05-28 20:32:46] [INFO ] Flow matrix only has 2220 transitions (discarded 9 similar events)
[2024-05-28 20:32:47] [INFO ] Invariant cache hit.
[2024-05-28 20:32:47] [INFO ] Implicit Places using invariants in 601 ms returned []
[2024-05-28 20:32:47] [INFO ] Flow matrix only has 2220 transitions (discarded 9 similar events)
[2024-05-28 20:32:47] [INFO ] Invariant cache hit.
[2024-05-28 20:32:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:32:53] [INFO ] Implicit Places using invariants and state equation in 6186 ms returned []
Implicit Place search using SMT with State Equation took 6789 ms to find 0 implicit places.
Running 2218 sub problems to find dead transitions.
[2024-05-28 20:32:53] [INFO ] Flow matrix only has 2220 transitions (discarded 9 similar events)
[2024-05-28 20:32:53] [INFO ] Invariant cache hit.
[2024-05-28 20:32:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/832 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 832/3063 variables, and 91 constraints, problems are : Problem set: 0 solved, 2218 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 86/96 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/843 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2218/1218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/832 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
[2024-05-28 20:33:52] [INFO ] Deduced a trap composed of 12 places in 577 ms of which 29 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 832/3063 variables, and 92 constraints, problems are : Problem set: 0 solved, 2218 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 86/96 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/843 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1218 constraints, Known Traps: 1/1 constraints]
After SMT, in 82554ms problems are : Problem set: 0 solved, 2218 unsolved
Search for dead transitions found 0 dead transitions in 82579ms
Starting structural reductions in LTL mode, iteration 1 : 843/854 places, 2229/2230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 129674 ms. Remains : 843/854 places, 2229/2230 transitions.
Stuttering acceptance computed with spot in 196 ms :[false, p1, false, false]
Running random walk in product with property : PolyORBNT-COL-S10J40-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 946 ms.
Product exploration explored 100000 steps with 50000 reset in 720 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 37 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-COL-S10J40-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-COL-S10J40-LTLCardinality-07 finished in 131619 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((p0||G(p1)||(p1&&F(p2)))))'
Support contains 23 out of 854 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 854/854 places, 2230/2230 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 844 transition count 2230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 843 transition count 2229
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 843 transition count 2229
Applied a total of 12 rules in 57 ms. Remains 843 /854 variables (removed 11) and now considering 2229/2230 (removed 1) transitions.
Running 2218 sub problems to find dead transitions.
[2024-05-28 20:34:18] [INFO ] Flow matrix only has 2220 transitions (discarded 9 similar events)
[2024-05-28 20:34:18] [INFO ] Invariant cache hit.
[2024-05-28 20:34:18] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
SMT process timed out in 41428ms, After SMT, problems are : Problem set: 0 solved, 2218 unsolved
Search for dead transitions found 0 dead transitions in 41456ms
[2024-05-28 20:34:59] [INFO ] Flow matrix only has 2220 transitions (discarded 9 similar events)
[2024-05-28 20:34:59] [INFO ] Invariant cache hit.
[2024-05-28 20:35:00] [INFO ] Implicit Places using invariants in 845 ms returned []
[2024-05-28 20:35:00] [INFO ] Flow matrix only has 2220 transitions (discarded 9 similar events)
[2024-05-28 20:35:00] [INFO ] Invariant cache hit.
[2024-05-28 20:35:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:35:04] [INFO ] Implicit Places using invariants and state equation in 3935 ms returned []
Implicit Place search using SMT with State Equation took 4787 ms to find 0 implicit places.
Running 2218 sub problems to find dead transitions.
[2024-05-28 20:35:04] [INFO ] Flow matrix only has 2220 transitions (discarded 9 similar events)
[2024-05-28 20:35:04] [INFO ] Invariant cache hit.
[2024-05-28 20:35:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/832 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 2218 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 832/3063 variables, and 91 constraints, problems are : Problem set: 0 solved, 2218 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 86/96 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/843 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2218/1218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/832 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
[2024-05-28 20:36:06] [INFO ] Deduced a trap composed of 12 places in 375 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 2)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 1)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 1)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 1)
(s257 1)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 4)
(s265 4)
(s266 4)
(s267 4)
(s268 4)
(s269 4)
(s270 4)
(s271 4)
(s272 4)
(s273 4)
(s274 9)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 1)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 1)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 1)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 1)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 1)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 1)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 1)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 1)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 1)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 1)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 1)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 1)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 1)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 1)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 1)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 1)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 1)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 1)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 1)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 1)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 1)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 1)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 1)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 1)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 1)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 1)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 1)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 1)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 1)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 1)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 1)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 1)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 1)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 1)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 1)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 1)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 0)
(s637 0)
(s638 1)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 1)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 1)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s668 1)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 0)
(s678 1)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 0)
(s690 0)
(s691 0)
(s692 0)
(s693 0)
(s694 0)
(s695 0)
(s696 0)
(s697 0)
(s698 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 832/3063 variables, and 92 constraints, problems are : Problem set: 0 solved, 2218 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 86/96 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/843 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1218 constraints, Known Traps: 1/1 constraints]
After SMT, in 84431ms problems are : Problem set: 0 solved, 2218 unsolved
Search for dead transitions found 0 dead transitions in 84477ms
Starting structural reductions in LTL mode, iteration 1 : 843/854 places, 2229/2230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130798 ms. Remains : 843/854 places, 2229/2230 transitions.
Stuttering acceptance computed with spot in 222 ms :[true, (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S10J40-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 708 ms.
Product exploration explored 100000 steps with 50000 reset in 743 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p1), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 37 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-COL-S10J40-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-COL-S10J40-LTLCardinality-08 finished in 132562 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 42 out of 854 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 854/854 places, 2230/2230 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 844 transition count 2230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 843 transition count 2229
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 843 transition count 2229
Applied a total of 12 rules in 42 ms. Remains 843 /854 variables (removed 11) and now considering 2229/2230 (removed 1) transitions.
Running 2218 sub problems to find dead transitions.
[2024-05-28 20:36:30] [INFO ] Flow matrix only has 2220 transitions (discarded 9 similar events)
[2024-05-28 20:36:30] [INFO ] Invariant cache hit.
[2024-05-28 20:36:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
SMT process timed out in 43831ms, After SMT, problems are : Problem set: 0 solved, 2218 unsolved
Search for dead transitions found 0 dead transitions in 43881ms
[2024-05-28 20:37:14] [INFO ] Flow matrix only has 2220 transitions (discarded 9 similar events)
[2024-05-28 20:37:14] [INFO ] Invariant cache hit.
[2024-05-28 20:37:15] [INFO ] Implicit Places using invariants in 761 ms returned []
[2024-05-28 20:37:15] [INFO ] Flow matrix only has 2220 transitions (discarded 9 similar events)
[2024-05-28 20:37:15] [INFO ] Invariant cache hit.
[2024-05-28 20:37:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:37:21] [INFO ] Implicit Places using invariants and state equation in 5576 ms returned []
Implicit Place search using SMT with State Equation took 6354 ms to find 0 implicit places.
Running 2218 sub problems to find dead transitions.
[2024-05-28 20:37:21] [INFO ] Flow matrix only has 2220 transitions (discarded 9 similar events)
[2024-05-28 20:37:21] [INFO ] Invariant cache hit.
[2024-05-28 20:37:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/832 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 2218 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 832/3063 variables, and 91 constraints, problems are : Problem set: 0 solved, 2218 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 86/96 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/843 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2218/1218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/832 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
[2024-05-28 20:38:20] [INFO ] Deduced a trap composed of 12 places in 370 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 832/3063 variables, and 92 constraints, problems are : Problem set: 0 solved, 2218 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 86/96 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/843 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1218 constraints, Known Traps: 1/1 constraints]
After SMT, in 83520ms problems are : Problem set: 0 solved, 2218 unsolved
Search for dead transitions found 0 dead transitions in 83586ms
Starting structural reductions in LTL mode, iteration 1 : 843/854 places, 2229/2230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 133882 ms. Remains : 843/854 places, 2229/2230 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J40-LTLCardinality-09
Product exploration explored 100000 steps with 5602 reset in 1164 ms.
Entered a terminal (fully accepting) state of product in 89835 steps with 5034 reset in 1065 ms.
FORMULA PolyORBNT-COL-S10J40-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J40-LTLCardinality-09 finished in 136256 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(X(G(p0)))))'
Support contains 1 out of 854 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 854/854 places, 2230/2230 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 844 transition count 2230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 843 transition count 2229
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 843 transition count 2229
Applied a total of 12 rules in 47 ms. Remains 843 /854 variables (removed 11) and now considering 2229/2230 (removed 1) transitions.
Running 2218 sub problems to find dead transitions.
[2024-05-28 20:38:47] [INFO ] Flow matrix only has 2220 transitions (discarded 9 similar events)
[2024-05-28 20:38:47] [INFO ] Invariant cache hit.
[2024-05-28 20:38:47] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 3.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
SMT process timed out in 40589ms, After SMT, problems are : Problem set: 0 solved, 2218 unsolved
Search for dead transitions found 0 dead transitions in 40624ms
[2024-05-28 20:39:27] [INFO ] Flow matrix only has 2220 transitions (discarded 9 similar events)
[2024-05-28 20:39:27] [INFO ] Invariant cache hit.
[2024-05-28 20:39:28] [INFO ] Implicit Places using invariants in 668 ms returned []
[2024-05-28 20:39:28] [INFO ] Flow matrix only has 2220 transitions (discarded 9 similar events)
[2024-05-28 20:39:28] [INFO ] Invariant cache hit.
[2024-05-28 20:39:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:39:34] [INFO ] Implicit Places using invariants and state equation in 5537 ms returned []
Implicit Place search using SMT with State Equation took 6210 ms to find 0 implicit places.
Running 2218 sub problems to find dead transitions.
[2024-05-28 20:39:34] [INFO ] Flow matrix only has 2220 transitions (discarded 9 similar events)
[2024-05-28 20:39:34] [INFO ] Invariant cache hit.
[2024-05-28 20:39:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/832 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
(s732 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 3.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 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 0.0)
(s21 1.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 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 1.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 1.0)
(s264 4.0)
(s265 4.0)
(s266 4.0)
(s267 4.0)
(s268 4.0)
(s269 4.0)
(s270 4.0)
(s271 4.0)
(s272 4.0)
(s273 4.0)
(s274 9.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 1.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 1.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 1.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 1.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 1.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 1.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 1.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 1.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 1.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 1.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 1.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 1.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 1.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 1.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 1.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 1.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 1.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 1.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 1.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 1.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 1.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 1.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 1.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 1.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 1.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 1.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 1.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 1.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 1.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 1.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 1.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 1.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 1.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 1.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 1.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 1.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 1.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 832/3063 variables, and 91 constraints, problems are : Problem set: 0 solved, 2218 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 86/96 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/843 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2218/1218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/832 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
[2024-05-28 20:40:29] [INFO ] Deduced a trap composed of 12 places in 309 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 832/3063 variables, and 92 constraints, problems are : Problem set: 0 solved, 2218 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 86/96 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/843 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1218 constraints, Known Traps: 1/1 constraints]
After SMT, in 79813ms problems are : Problem set: 0 solved, 2218 unsolved
Search for dead transitions found 0 dead transitions in 79855ms
Starting structural reductions in LTL mode, iteration 1 : 843/854 places, 2229/2230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 126751 ms. Remains : 843/854 places, 2229/2230 transitions.
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J40-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 14 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S10J40-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J40-LTLCardinality-12 finished in 126955 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(p0)||X(X(G((p1&&X((p1 U (p2||G(p1))))))))))'
Support contains 12 out of 854 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 854/854 places, 2230/2230 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 844 transition count 2230
Applied a total of 10 rules in 32 ms. Remains 844 /854 variables (removed 10) and now considering 2230/2230 (removed 0) transitions.
Running 2219 sub problems to find dead transitions.
[2024-05-28 20:40:54] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
// Phase 1: matrix 2221 rows 844 cols
[2024-05-28 20:40:54] [INFO ] Computed 102 invariants in 30 ms
[2024-05-28 20:40:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/833 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2219 unsolved
SMT process timed out in 39218ms, After SMT, problems are : Problem set: 0 solved, 2219 unsolved
Search for dead transitions found 0 dead transitions in 39245ms
[2024-05-28 20:41:33] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
[2024-05-28 20:41:33] [INFO ] Invariant cache hit.
[2024-05-28 20:41:34] [INFO ] Implicit Places using invariants in 924 ms returned []
[2024-05-28 20:41:34] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
[2024-05-28 20:41:34] [INFO ] Invariant cache hit.
[2024-05-28 20:41:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:41:39] [INFO ] Implicit Places using invariants and state equation in 5225 ms returned []
Implicit Place search using SMT with State Equation took 6152 ms to find 0 implicit places.
Running 2219 sub problems to find dead transitions.
[2024-05-28 20:41:39] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
[2024-05-28 20:41:39] [INFO ] Invariant cache hit.
[2024-05-28 20:41:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/833 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/833 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 2219 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 833/3065 variables, and 91 constraints, problems are : Problem set: 0 solved, 2219 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 86/96 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/844 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2219/1219 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/833 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/833 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 2219 unsolved
[2024-05-28 20:42:38] [INFO ] Deduced a trap composed of 12 places in 390 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 833/3065 variables, and 92 constraints, problems are : Problem set: 0 solved, 2219 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 86/96 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/844 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1219 constraints, Known Traps: 1/1 constraints]
After SMT, in 82329ms problems are : Problem set: 0 solved, 2219 unsolved
Search for dead transitions found 0 dead transitions in 82379ms
Starting structural reductions in LTL mode, iteration 1 : 844/854 places, 2230/2230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 127825 ms. Remains : 844/854 places, 2230/2230 transitions.
Stuttering acceptance computed with spot in 210 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S10J40-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 66808 steps with 3740 reset in 740 ms.
FORMULA PolyORBNT-COL-S10J40-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J40-LTLCardinality-13 finished in 128796 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(p0)||((F(p1) U p2)&&F(p3))))'
Support contains 74 out of 854 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 854/854 places, 2230/2230 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 854 transition count 2186
Reduce places removed 44 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 46 rules applied. Total rules applied 90 place count 810 transition count 2184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 92 place count 808 transition count 2184
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 92 place count 808 transition count 2140
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 180 place count 764 transition count 2140
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 182 place count 763 transition count 2139
Applied a total of 182 rules in 148 ms. Remains 763 /854 variables (removed 91) and now considering 2139/2230 (removed 91) transitions.
Running 2128 sub problems to find dead transitions.
[2024-05-28 20:43:03] [INFO ] Flow matrix only has 2130 transitions (discarded 9 similar events)
// Phase 1: matrix 2130 rows 763 cols
[2024-05-28 20:43:03] [INFO ] Computed 112 invariants in 65 ms
[2024-05-28 20:43:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/743 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/743 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 2128 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 743/2893 variables, and 92 constraints, problems are : Problem set: 0 solved, 2128 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 86/104 constraints, Generalized P Invariants (flows): 6/8 constraints, State Equation: 0/763 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2128/1128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/743 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/743 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 2128 unsolved
[2024-05-28 20:43:46] [INFO ] Deduced a trap composed of 18 places in 445 ms of which 3 ms to minimize.
[2024-05-28 20:43:50] [INFO ] Deduced a trap composed of 10 places in 588 ms of which 6 ms to minimize.
[2024-05-28 20:43:50] [INFO ] Deduced a trap composed of 134 places in 487 ms of which 4 ms to minimize.
[2024-05-28 20:43:51] [INFO ] Deduced a trap composed of 143 places in 472 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 743/2893 variables, and 96 constraints, problems are : Problem set: 0 solved, 2128 unsolved in 20059 ms.
Refiners :[Positive P Invariants (semi-flows): 86/104 constraints, Generalized P Invariants (flows): 6/8 constraints, State Equation: 0/763 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1128 constraints, Known Traps: 4/4 constraints]
After SMT, in 60655ms problems are : Problem set: 0 solved, 2128 unsolved
Search for dead transitions found 0 dead transitions in 60680ms
[2024-05-28 20:44:03] [INFO ] Flow matrix only has 2130 transitions (discarded 9 similar events)
[2024-05-28 20:44:03] [INFO ] Invariant cache hit.
[2024-05-28 20:44:04] [INFO ] Implicit Places using invariants in 836 ms returned []
[2024-05-28 20:44:04] [INFO ] Flow matrix only has 2130 transitions (discarded 9 similar events)
[2024-05-28 20:44:04] [INFO ] Invariant cache hit.
[2024-05-28 20:44:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:44:09] [INFO ] Implicit Places using invariants and state equation in 4645 ms returned []
Implicit Place search using SMT with State Equation took 5483 ms to find 0 implicit places.
[2024-05-28 20:44:09] [INFO ] Redundant transitions in 75 ms returned []
Running 2128 sub problems to find dead transitions.
[2024-05-28 20:44:09] [INFO ] Flow matrix only has 2130 transitions (discarded 9 similar events)
[2024-05-28 20:44:09] [INFO ] Invariant cache hit.
[2024-05-28 20:44:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/743 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/743 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 2128 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 743/2893 variables, and 92 constraints, problems are : Problem set: 0 solved, 2128 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 86/104 constraints, Generalized P Invariants (flows): 6/8 constraints, State Equation: 0/763 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2128/1128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/743 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/743 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 2128 unsolved
[2024-05-28 20:45:05] [INFO ] Deduced a trap composed of 125 places in 307 ms of which 4 ms to minimize.
[2024-05-28 20:45:06] [INFO ] Deduced a trap composed of 10 places in 487 ms of which 4 ms to minimize.
[2024-05-28 20:45:25] [INFO ] Deduced a trap composed of 16 places in 345 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/743 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 2128 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 743/2893 variables, and 95 constraints, problems are : Problem set: 0 solved, 2128 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 86/104 constraints, Generalized P Invariants (flows): 6/8 constraints, State Equation: 0/763 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1128 constraints, Known Traps: 3/3 constraints]
After SMT, in 80943ms problems are : Problem set: 0 solved, 2128 unsolved
Search for dead transitions found 0 dead transitions in 80971ms
Starting structural reductions in SI_LTL mode, iteration 1 : 763/854 places, 2139/2230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 147378 ms. Remains : 763/854 places, 2139/2230 transitions.
Stuttering acceptance computed with spot in 240 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p1), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : PolyORBNT-COL-S10J40-LTLCardinality-15
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S10J40-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J40-LTLCardinality-15 finished in 147641 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-05-28 20:45:31] [INFO ] Flatten gal took : 315 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3456927207549212197
[2024-05-28 20:45:31] [INFO ] Too many transitions (2230) to apply POR reductions. Disabling POR matrices.
[2024-05-28 20:45:31] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3456927207549212197
Running compilation step : cd /tmp/ltsmin3456927207549212197;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-28 20:45:31] [INFO ] Applying decomposition
[2024-05-28 20:45:31] [INFO ] Flatten gal took : 179 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/graph1132436736562309849.txt' '-o' '/tmp/graph1132436736562309849.bin' '-w' '/tmp/graph1132436736562309849.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1132436736562309849.bin' '-l' '-1' '-v' '-w' '/tmp/graph1132436736562309849.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:45:31] [INFO ] Decomposing Gal with order
[2024-05-28 20:45:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:45:32] [INFO ] Removed a total of 1961 redundant transitions.
[2024-05-28 20:45:32] [INFO ] Flatten gal took : 308 ms
[2024-05-28 20:45:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 133 labels/synchronizations in 37 ms.
[2024-05-28 20:45:32] [INFO ] Time to serialize gal into /tmp/LTLCardinality14047818173390916.gal : 23 ms
[2024-05-28 20:45:32] [INFO ] Time to serialize properties into /tmp/LTLCardinality46862910079508493.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/LTLCardinality14047818173390916.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality46862910079508493.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...293
Read 1 LTL properties
Checking formula 0 : !((F(G("(gu23.mo1<=gu23.mi1)"))))
Formula 0 simplified : GF!"(gu23.mo1<=gu23.mi1)"
Compilation finished in 6580 ms.
Running link step : cd /tmp/ltsmin3456927207549212197;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 87 ms.
Running LTSmin : cd /tmp/ltsmin3456927207549212197;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2024-05-28 21:13:04] [INFO ] Applying decomposition
[2024-05-28 21:13:04] [INFO ] Flatten gal took : 331 ms
[2024-05-28 21:13:04] [INFO ] Decomposing Gal with order
[2024-05-28 21:13:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:13:05] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to block in partition [CreatedJobs_0],[CreatedJobs_1],[CreatedJobs_2],[CreatedJobs_3],[CreatedJobs_4],[CreatedJobs_5],[CreatedJobs_6],[CreatedJobs_7],[CreatedJobs_8],[CreatedJobs_9],[CreatedJobs_10],[CreatedJobs_11],[CreatedJobs_12],[CreatedJobs_13],[CreatedJobs_14],[CreatedJobs_15],[CreatedJobs_16],[CreatedJobs_17],[CreatedJobs_18],[CreatedJobs_19],[CreatedJobs_20],[CreatedJobs_21],[CreatedJobs_22],[CreatedJobs_23],[CreatedJobs_24],[CreatedJobs_25],[CreatedJobs_26],[CreatedJobs_27],[CreatedJobs_28],[CreatedJobs_29],[CreatedJobs_30],[CreatedJobs_31],[CreatedJobs_32],[CreatedJobs_33],[CreatedJobs_34],[CreatedJobs_35],[CreatedJobs_36],[CreatedJobs_37],[CreatedJobs_38],[CreatedJobs_39],[CreatedJobs_40],[CreatedJobs_41],[CreatedJobs_42],[CreatedJobs_43],[CreatedJobs_44],[CreatedJobs_45],[CreatedJobs_46],[CreatedJobs_47],[CreatedJobs_48],[CreatedJobs_49],[CreatedJobs_50],[CreatedJobs_51],[CreatedJobs_52],[CreatedJobs_53],[CreatedJobs_54],[CreatedJobs_55],[CreatedJobs_56],[CreatedJobs_57],[CreatedJobs_58],[CreatedJobs_59],[CreatedJobs_60],[CreatedJobs_61],[CreatedJobs_62],[CreatedJobs_63],[CreatedJobs_64],[CreatedJobs_65],[CreatedJobs_66],[CreatedJobs_67],[CreatedJobs_68],[CreatedJobs_69],[CreatedJobs_70],[CreatedJobs_71],[CreatedJobs_72],[CreatedJobs_73],[CreatedJobs_74],[CreatedJobs_75],[CreatedJobs_76],[CreatedJobs_77],[CreatedJobs_78],[CreatedJobs_79],[CreatedJobs_80],[CreatedJobs_81],[CreatedJobs_82],[CreatedJobs_83],[CreatedJobs_84],[CreatedJobs_85],[CreatedJobs_86],[CreatedJobs_87],[CreatedJobs_88],[CreatedJobs_89],[CreatedJobs_90],[CreatedJobs_91],[CreatedJobs_92],[CreatedJobs_93],[CreatedJobs_94],[CreatedJobs_95],[CreatedJobs_96],[CreatedJobs_97],[CreatedJobs_98],[CreatedJobs_99],[CreatedJobs_100],[CreatedJobs_101],[CreatedJobs_102],[CreatedJobs_103],[CreatedJobs_104],[CreatedJobs_105],[CreatedJobs_106],[CreatedJobs_107],[CreatedJobs_108],[CreatedJobs_109],[CreatedJobs_110],[CreatedJobs_111],[CreatedJobs_112],[CreatedJobs_113],[CreatedJobs_114],[CreatedJobs_115],[CreatedJobs_116],[CreatedJobs_117],[CreatedJobs_118],[CreatedJobs_119],[CreatedJobs_120],[CreatedJobs_121],[CreatedJobs_122],[CreatedJobs_123],[CreatedJobs_124],[CreatedJobs_125],[CreatedJobs_126],[CreatedJobs_127],[CreatedJobs_128],[CreatedJobs_129],[CreatedJobs_130],[CreatedJobs_131],[CreatedJobs_132],[CreatedJobs_133],[CreatedJobs_134],[CreatedJobs_135],[CreatedJobs_136],[CreatedJobs_137],[CreatedJobs_138],[CreatedJobs_139],[CreatedJobs_140],[CreatedJobs_141],[CreatedJobs_142],[CreatedJobs_143],[CreatedJobs_144],[CreatedJobs_145],[CreatedJobs_146],[CreatedJobs_147],[CreatedJobs_148],[CreatedJobs_149],[CreatedJobs_150],[CreatedJobs_151],[CreatedJobs_152],[CreatedJobs_153],[CreatedJobs_154],[CreatedJobs_155],[CreatedJobs_156],[CreatedJobs_157],[CreatedJobs_158],[CreatedJobs_159],[CreatedJobs_160],[CreatedJobs_161],[CreatedJobs_162],[CreatedJobs_163],[CreatedJobs_164],[CreatedJobs_165],[CreatedJobs_166],[CreatedJobs_167],[CreatedJobs_168],[CreatedJobs_169],[CreatedJobs_170],[CreatedJobs_171],[CreatedJobs_172],[CreatedJobs_173],[CreatedJobs_174],[CreatedJobs_175],[CreatedJobs_176],[CreatedJobs_177],[CreatedJobs_178],[CreatedJobs_179],[CreatedJobs_180],[CreatedJobs_181],[CreatedJobs_182],[CreatedJobs_183],[CreatedJobs_184],[CreatedJobs_185],[CreatedJobs_186],[CreatedJobs_187],[CreatedJobs_188],[CreatedJobs_189],[CreatedJobs_190],[CreatedJobs_191],[CreatedJobs_192],[CreatedJobs_193],[CreatedJobs_194],[CreatedJobs_195],[CreatedJobs_196],[CreatedJobs_197],[CreatedJobs_198],[CreatedJobs_199],[CreatedJobs_200],[CreatedJobs_201],[CreatedJobs_202],[CreatedJobs_203],[CreatedJobs_204],[CreatedJobs_205],[CreatedJobs_206],[CreatedJobs_207],[CreatedJobs_208],[CreatedJobs_209],[CreatedJobs_210],[CreatedJobs_211],[CreatedJobs_212],[CreatedJobs_213],[CreatedJobs_214],[CreatedJobs_215],[CreatedJobs_216],[CreatedJobs_217],[CreatedJobs_218],[CreatedJobs_219],[CreatedJobs_220],[CreatedJobs_221],[CreatedJobs_222],[CreatedJobs_223],[CreatedJobs_224],[CreatedJobs_225],[CreatedJobs_226],[CreatedJobs_227],[CreatedJobs_228],[CreatedJobs_229],[CreatedJobs_230],[CreatedJobs_231],[CreatedJobs_232],[CreatedJobs_233],[CreatedJobs_234],[CreatedJobs_235],[CreatedJobs_236],[CreatedJobs_237],[CreatedJobs_238],[CreatedJobs_239],[CreatedJobs_240],[CreatedJobs_241],[CreatedJobs_242],[CreatedJobs_243],[CreatedJobs_244],[CreatedJobs_245],[CreatedJobs_246],[CreatedJobs_247],[CreatedJobs_248],[CreatedJobs_249],[CreatedJobs_250],[CreatedJobs_251],[CreatedJobs_252],[CreatedJobs_253],[CreatedJobs_254],[CreatedJobs_255],[CreatedJobs_256],[CreatedJobs_257],[CreatedJobs_258],[CreatedJobs_259],[CreatedJobs_260],[CreatedJobs_261],[CreatedJobs_262],[CreatedJobs_263],[CreatedJobs_264],[CreatedJobs_265],[CreatedJobs_266],[CreatedJobs_267],[CreatedJobs_268],[CreatedJobs_269],[CreatedJobs_270],[CreatedJobs_271],[CreatedJobs_272],[CreatedJobs_273],[CreatedJobs_274],[CreatedJobs_275],[CreatedJobs_276],[CreatedJobs_277],[CreatedJobs_278],[CreatedJobs_279],[CreatedJobs_280],[CreatedJobs_281],[CreatedJobs_282],[CreatedJobs_283],[CreatedJobs_284],[CreatedJobs_285],[CreatedJobs_286],[CreatedJobs_287],[CreatedJobs_288],[CreatedJobs_289],[CreatedJobs_290],[CreatedJobs_291],[CreatedJobs_292],[CreatedJobs_293],[CreatedJobs_294],[CreatedJobs_295],[CreatedJobs_296],[CreatedJobs_297],[CreatedJobs_298],[CreatedJobs_299],[CreatedJobs_300],[CreatedJobs_301],[CreatedJobs_302],[CreatedJobs_303],[CreatedJobs_304],[CreatedJobs_305],[CreatedJobs_306],[CreatedJobs_307],[CreatedJobs_308],[CreatedJobs_309],[CreatedJobs_310],[CreatedJobs_311],[CreatedJobs_312],[CreatedJobs_313],[CreatedJobs_314],[CreatedJobs_315],[CreatedJobs_316],[CreatedJobs_317],[CreatedJobs_318],[CreatedJobs_319],[CreatedJobs_320],[CreatedJobs_321],[CreatedJobs_322],[CreatedJobs_323],[CreatedJobs_324],[CreatedJobs_325],[CreatedJobs_326],[CreatedJobs_327],[CreatedJobs_328],[CreatedJobs_329],[CreatedJobs_330],[CreatedJobs_331],[CreatedJobs_332],[CreatedJobs_333],[CreatedJobs_334],[CreatedJobs_335],[CreatedJobs_336],[CreatedJobs_337],[CreatedJobs_338],[CreatedJobs_339],[CreatedJobs_340],[CreatedJobs_341],[CreatedJobs_342],[CreatedJobs_343],[CreatedJobs_344],[CreatedJobs_345],[CreatedJobs_346],[CreatedJobs_347],[CreatedJobs_348],[CreatedJobs_349],[CreatedJobs_350],[CreatedJobs_351],[CreatedJobs_352],[CreatedJobs_353],[CreatedJobs_354],[CreatedJobs_355],[CreatedJobs_356],[CreatedJobs_357],[CreatedJobs_358],[CreatedJobs_359],[CreatedJobs_360],[CreatedJobs_361],[CreatedJobs_362],[CreatedJobs_363],[CreatedJobs_364],[CreatedJobs_365],[CreatedJobs_366],[CreatedJobs_367],[CreatedJobs_368],[CreatedJobs_369],[CreatedJobs_370],[CreatedJobs_371],[CreatedJobs_372],[CreatedJobs_373],[CreatedJobs_374],[CreatedJobs_375],[CreatedJobs_376],[CreatedJobs_377],[CreatedJobs_378],[CreatedJobs_379],[CreatedJobs_380],[CreatedJobs_381],[CreatedJobs_382],[CreatedJobs_383],[CreatedJobs_384],[CreatedJobs_385],[CreatedJobs_386],[CreatedJobs_387],[CreatedJobs_388],[CreatedJobs_389],[CreatedJobs_390],[CreatedJobs_391],[CreatedJobs_392],[CreatedJobs_393],[CreatedJobs_394],[CreatedJobs_395],[CreatedJobs_396],[CreatedJobs_397],[CreatedJobs_398],[CreatedJobs_399],[CreatedJobs_400],[CreatedJobs_401],[CreatedJobs_402],[CreatedJobs_403],[CreatedJobs_404],[CreatedJobs_405],[CreatedJobs_406],[CreatedJobs_407],[CreatedJobs_408],[CreatedJobs_409],[Schedule_Task_E_0],[Schedule_Task_E_1],[Schedule_Task_E_2],[Schedule_Task_E_3],[Schedule_Task_E_4],[Schedule_Task_E_5],[Schedule_Task_E_6],[Schedule_Task_E_7],[Schedule_Task_E_8],[Schedule_Task_E_9],[Schedule_Task_E_10],[Schedule_Task_E_11],[Schedule_Task_E_12],[Schedule_Task_E_13],[Schedule_Task_E_14],[Schedule_Task_E_15],[Schedule_Task_E_16],[Schedule_Task_E_17],[Schedule_Task_E_18],[Schedule_Task_E_19],[Schedule_Task_E_20],[Schedule_Task_E_21],[Schedule_Task_E_22],[Schedule_Task_E_23],[Schedule_Task_E_24],[Schedule_Task_E_25],[Schedule_Task_E_26],[Schedule_Task_E_27],[Schedule_Task_E_28],[Schedule_Task_E_29],[Schedule_Task_E_30],[Schedule_Task_E_31],[Schedule_Task_E_32],[Schedule_Task_E_33],[Schedule_Task_E_34],[Schedule_Task_E_35],[Schedule_Task_E_36],[Schedule_Task_E_37],[Schedule_Task_E_38],[Schedule_Task_E_39],[Schedule_Task_E_40],[Schedule_Task_E_41],[f3_0, f2_0, f1_0, AvailableJobId_0],[f3_1, f2_1, f1_1, AvailableJobId_1],[f3_2, f2_2, f1_2, AvailableJobId_2],[f3_3, f2_3, f1_3, AvailableJobId_3],[f3_4, f2_4, f1_4, AvailableJobId_4],[f3_5, f2_5, f1_5, AvailableJobId_5],[f3_6, f2_6, f1_6, AvailableJobId_6],[f3_7, f2_7, f1_7, AvailableJobId_7],[f3_8, f2_8, f1_8, AvailableJobId_8],[f3_9, f2_9, f1_9, AvailableJobId_9],[f3_10, f2_10, f1_10, AvailableJobId_10],[f3_11, f2_11, f1_11, AvailableJobId_11],[f3_12, f2_12, f1_12, AvailableJobId_12],[f3_13, f2_13, f1_13, AvailableJobId_13],[f3_14, f2_14, f1_14, AvailableJobId_14],[f3_15, f2_15, f1_15, AvailableJobId_15],[f3_16, f2_16, f1_16, AvailableJobId_16],[f3_17, f2_17, f1_17, AvailableJobId_17],[f3_18, f2_18, f1_18, AvailableJobId_18],[f3_19, f2_19, f1_19, AvailableJobId_19],[f3_20, f2_20, f1_20, AvailableJobId_20],[f3_21, f2_21, f1_21, AvailableJobId_21],[f3_22, f2_22, f1_22, AvailableJobId_22],[f3_23, f2_23, f1_23, AvailableJobId_23],[f3_24, f2_24, f1_24, AvailableJobId_24],[f3_25, f2_25, f1_25, AvailableJobId_25],[f3_26, f2_26, f1_26, AvailableJobId_26],[f3_27, f2_27, f1_27, AvailableJobId_27],[f3_28, f2_28, f1_28, AvailableJobId_28],[f3_29, f2_29, f1_29, AvailableJobId_29],[f3_30, f2_30, f1_30, AvailableJobId_30],[f3_31, f2_31, f1_31, AvailableJobId_31],[f3_32, f2_32, f1_32, AvailableJobId_32],[f3_33, f2_33, f1_33, AvailableJobId_33],[f3_34, f2_34, f1_34, AvailableJobId_34],[f3_35, f2_35, f1_35, AvailableJobId_35],[f3_36, f2_36, f1_36, AvailableJobId_36],[f3_37, f2_37, f1_37, AvailableJobId_37],[f3_38, f2_38, f1_38, AvailableJobId_38],[f3_39, f2_39, f1_39, AvailableJobId_39],[f3_40, f2_40, f1_40, AvailableJobId_40],[FetchJobE_0, QueueJobB_0, NotifyEventJobQueuedB_0, Perform_Work_B_0],[FetchJobE_1, QueueJobB_1, NotifyEventJobQueuedB_1, Perform_Work_B_1],[FetchJobE_2, QueueJobB_2, NotifyEventJobQueuedB_2, Perform_Work_B_2],[FetchJobE_3, QueueJobB_3, NotifyEventJobQueuedB_3, Perform_Work_B_3],[FetchJobE_4, QueueJobB_4, NotifyEventJobQueuedB_4, Perform_Work_B_4],[FetchJobE_5, QueueJobB_5, NotifyEventJobQueuedB_5, Perform_Work_B_5],[FetchJobE_6, QueueJobB_6, NotifyEventJobQueuedB_6, Perform_Work_B_6],[FetchJobE_7, QueueJobB_7, NotifyEventJobQueuedB_7, Perform_Work_B_7],[FetchJobE_8, QueueJobB_8, NotifyEventJobQueuedB_8, Perform_Work_B_8],[FetchJobE_9, QueueJobB_9, NotifyEventJobQueuedB_9, Perform_Work_B_9],[FetchJobE_10, QueueJobB_10, NotifyEventJobQueuedB_10, Perform_Work_B_10],[FetchJobE_11, QueueJobB_11, NotifyEventJobQueuedB_11, Perform_Work_B_11],[FetchJobE_12, QueueJobB_12, NotifyEventJobQueuedB_12, Perform_Work_B_12],[FetchJobE_13, QueueJobB_13, NotifyEventJobQueuedB_13, Perform_Work_B_13],[FetchJobE_14, QueueJobB_14, NotifyEventJobQueuedB_14, Perform_Work_B_14],[FetchJobE_15, QueueJobB_15, NotifyEventJobQueuedB_15, Perform_Work_B_15],[FetchJobE_16, QueueJobB_16, NotifyEventJobQueuedB_16, Perform_Work_B_16],[FetchJobE_17, QueueJobB_17, NotifyEventJobQueuedB_17, Perform_Work_B_17],[FetchJobE_18, QueueJobB_18, NotifyEventJobQueuedB_18, Perform_Work_B_18],[FetchJobE_19, QueueJobB_19, NotifyEventJobQueuedB_19, Perform_Work_B_19],[FetchJobE_20, QueueJobB_20, NotifyEventJobQueuedB_20, Perform_Work_B_20],[FetchJobE_21, QueueJobB_21, NotifyEventJobQueuedB_21, Perform_Work_B_21],[FetchJobE_22, QueueJobB_22, NotifyEventJobQueuedB_22, Perform_Work_B_22],[FetchJobE_23, QueueJobB_23, NotifyEventJobQueuedB_23, Perform_Work_B_23],[FetchJobE_24, QueueJobB_24, NotifyEventJobQueuedB_24, Perform_Work_B_24],[FetchJobE_25, QueueJobB_25, NotifyEventJobQueuedB_25, Perform_Work_B_25],[FetchJobE_26, QueueJobB_26, NotifyEventJobQueuedB_26, Perform_Work_B_26],[FetchJobE_27, QueueJobB_27, NotifyEventJobQueuedB_27, Perform_Work_B_27],[FetchJobE_28, QueueJobB_28, NotifyEventJobQueuedB_28, Perform_Work_B_28],[FetchJobE_29, QueueJobB_29, NotifyEventJobQueuedB_29, Perform_Work_B_29],[FetchJobE_30, QueueJobB_30, NotifyEventJobQueuedB_30, Perform_Work_B_30],[FetchJobE_31, QueueJobB_31, NotifyEventJobQueuedB_31, Perform_Work_B_31],[FetchJobE_32, QueueJobB_32, NotifyEventJobQueuedB_32, Perform_Work_B_32],[FetchJobE_33, QueueJobB_33, NotifyEventJobQueuedB_33, Perform_Work_B_33],[FetchJobE_34, QueueJobB_34, NotifyEventJobQueuedB_34, Perform_Work_B_34],[FetchJobE_35, QueueJobB_35, NotifyEventJobQueuedB_35, Perform_Work_B_35],[FetchJobE_36, QueueJobB_36, NotifyEventJobQueuedB_36, Perform_Work_B_36],[FetchJobE_37, QueueJobB_37, NotifyEventJobQueuedB_37, Perform_Work_B_37],[FetchJobE_38, QueueJobB_38, NotifyEventJobQueuedB_38, Perform_Work_B_38],[FetchJobE_39, QueueJobB_39, NotifyEventJobQueuedB_39, Perform_Work_B_39],[FetchJobE_40, QueueJobB_40, NotifyEventJobQueuedB_40, Perform_Work_B_40],[place_482_0],[place_482_1],[place_482_2],[place_482_3],[place_482_4],[place_482_5],[place_482_6],[place_482_7],[place_482_8],[place_482_9],[ModifiedSrc_0, DataOnSrc_0, TheSour_0],[ModifiedSrc_1, DataOnSrc_1, TheSour_1],[ModifiedSrc_2, DataOnSrc_2, TheSour_2],[ModifiedSrc_3, DataOnSrc_3, TheSour_3],[ModifiedSrc_4, DataOnSrc_4, TheSour_4],[ModifiedSrc_5, DataOnSrc_5, TheSour_5],[ModifiedSrc_6, DataOnSrc_6, TheSour_6],[ModifiedSrc_7, DataOnSrc_7, TheSour_7],[ModifiedSrc_8, DataOnSrc_8, TheSour_8],[ModifiedSrc_9, DataOnSrc_9, TheSour_9],

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:1011)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-28 21:13:05] [INFO ] Flatten gal took : 342 ms
[2024-05-28 21:13:05] [INFO ] Time to serialize gal into /tmp/LTLCardinality17425609689516435192.gal : 31 ms
[2024-05-28 21:13:05] [INFO ] Time to serialize properties into /tmp/LTLCardinality13201018866805121586.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/LTLCardinality17425609689516435192.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13201018866805121586.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...299
Read 1 LTL properties
Checking formula 0 : !((F(G("(mo1<=mi1)"))))
Formula 0 simplified : GF!"(mo1<=mi1)"

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-COL-S10J40"
export BK_EXAMINATION="LTLCardinality"
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-COL-S10J40, examination is LTLCardinality"
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-171654447100419"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J40.tgz
mv PolyORBNT-COL-S10J40 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;