Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r202-smll-171649587500116.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is HirschbergSinclair-PT-40, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-171649587500116
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 14K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 113K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.6K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 13 03:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Apr 13 03:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 13 03:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 13 03:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 580K May 18 16:42 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 HirschbergSinclair-PT-40-LTLFireability-00
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-01
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-02
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-03
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-04
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-05
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-06
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-07
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-08
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-09
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-10
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-11
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-12
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-13
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-14
FORMULA_NAME HirschbergSinclair-PT-40-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716621369197

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-40
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-25 07:16:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 07:16:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 07:16:12] [INFO ] Load time of PNML (sax parser for PT used): 290 ms
[2024-05-25 07:16:12] [INFO ] Transformed 1068 places.
[2024-05-25 07:16:12] [INFO ] Transformed 982 transitions.
[2024-05-25 07:16:12] [INFO ] Parsed PT model containing 1068 places and 982 transitions and 2991 arcs in 682 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Support contains 56 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1068/1068 places, 982/982 transitions.
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 1028 transition count 982
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 77 place count 991 transition count 945
Iterating global reduction 1 with 37 rules applied. Total rules applied 114 place count 991 transition count 945
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 148 place count 957 transition count 911
Iterating global reduction 1 with 34 rules applied. Total rules applied 182 place count 957 transition count 911
Applied a total of 182 rules in 690 ms. Remains 957 /1068 variables (removed 111) and now considering 911/982 (removed 71) transitions.
// Phase 1: matrix 911 rows 957 cols
[2024-05-25 07:16:13] [INFO ] Computed 46 invariants in 67 ms
[2024-05-25 07:16:15] [INFO ] Implicit Places using invariants in 1811 ms returned []
[2024-05-25 07:16:15] [INFO ] Invariant cache hit.
[2024-05-25 07:16:20] [INFO ] Implicit Places using invariants and state equation in 5048 ms returned []
Implicit Place search using SMT with State Equation took 6931 ms to find 0 implicit places.
Running 871 sub problems to find dead transitions.
[2024-05-25 07:16:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/917 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 871 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 917/1868 variables, and 6 constraints, problems are : Problem set: 0 solved, 871 unsolved in 30067 ms.
Refiners :[Generalized P Invariants (flows): 6/46 constraints, State Equation: 0/957 constraints, PredecessorRefiner: 871/871 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 871 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/917 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 871 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/917 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 871 unsolved
At refinement iteration 2 (OVERLAPS) 40/957 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 871 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 698)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 1)
(s6 698)
(s7 1)
(s8 0)
(s9 1)
(s10 0)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 696)
(s16 0)
(s17 1)
(s18 0)
(s19 1)
(s20 0)
(s21 693)
(s22 0)
(s23 1)
(s24 690)
(s25 1)
(s26 0)
(s27 690)
(s28 0)
(s29 1)
(s30 0)
(s31 689)
(s32 0)
(s33 1)
(s34 0)
(s35 1)
(s36 0)
(s37 1)
(s38 685)
(s39 1)
(s40 0)
(s41 1)
(s42 0)
(s43 1)
(s44 0)
(s45 1)
(s46 0)
(s47 681)
(s48 0)
(s49 1)
(s50 0)
(s51 1)
(s52 0)
(s53 1)
(s54 0)
(s55 676)
(s56 674)
(s57 1)
(s58 0)
(s59 1)
(s60 0)
(s61 673)
(s62 0)
(s63 1)
(s64 670)
(s65 1)
(s66 0)
(s67 1)
(s68 0)
(s69 669)
(s70 0)
(s71 1)
(s72 664)
(s73 1)
(s74 0)
(s75 663)
(s76 0)
(s77 1)
(s78 0)
(s79 700)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 699)
(s88 1)
(s89 699)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 699)
(s96 1)
(s97 1)
(s98 1)
(s99 698)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 697)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 695)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 693)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 692)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 689)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 688)
(s152 1)
(s153 689)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 687)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 684)
(s168 1)
(s169 685)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 683)
(s178 1)
(s179 679)
(s180 1)
(s181 1)
(s182 1)
(s183 677)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 677)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 673)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 672)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 670)
(s226 1)
(s227 667)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 661)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 957/1868 variables, and 46 constraints, problems are : Problem set: 0 solved, 871 unsolved in 30041 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/957 constraints, PredecessorRefiner: 0/871 constraints, Known Traps: 0/0 constraints]
After SMT, in 60996ms problems are : Problem set: 0 solved, 871 unsolved
Search for dead transitions found 0 dead transitions in 61056ms
Starting structural reductions in LTL mode, iteration 1 : 957/1068 places, 911/982 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68740 ms. Remains : 957/1068 places, 911/982 transitions.
Support contains 56 out of 957 places after structural reductions.
[2024-05-25 07:17:22] [INFO ] Flatten gal took : 200 ms
[2024-05-25 07:17:22] [INFO ] Flatten gal took : 87 ms
[2024-05-25 07:17:22] [INFO ] Input system was already deterministic with 911 transitions.
RANDOM walk for 40000 steps (40 resets) in 1840 ms. (21 steps per ms) remains 1/38 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 1/1 properties
[2024-05-25 07:17:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 612/615 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 260/875 variables, 42/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/875 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp10 is UNSAT
After SMT solving in domain Real declared 1786/1868 variables, and 921 constraints, problems are : Problem set: 1 solved, 0 unsolved in 1096 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 875/957 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1128ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
FORMULA HirschbergSinclair-PT-40-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 957 stabilizing places and 911 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 957 transition count 911
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(F(p1) U (!p1 U G(p0))))))'
Support contains 2 out of 957 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 957/957 places, 911/911 transitions.
Reduce places removed 38 places and 38 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 387 transitions
Trivial Post-agglo rules discarded 387 transitions
Performed 387 trivial Post agglomeration. Transition count delta: 387
Iterating post reduction 0 with 387 rules applied. Total rules applied 387 place count 919 transition count 486
Reduce places removed 387 places and 0 transitions.
Iterating post reduction 1 with 387 rules applied. Total rules applied 774 place count 532 transition count 486
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 780 place count 526 transition count 480
Iterating global reduction 2 with 6 rules applied. Total rules applied 786 place count 526 transition count 480
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 789 place count 526 transition count 477
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 792 place count 523 transition count 477
Applied a total of 792 rules in 229 ms. Remains 523 /957 variables (removed 434) and now considering 477/911 (removed 434) transitions.
// Phase 1: matrix 477 rows 523 cols
[2024-05-25 07:17:25] [INFO ] Computed 46 invariants in 6 ms
[2024-05-25 07:17:26] [INFO ] Implicit Places using invariants in 1060 ms returned []
[2024-05-25 07:17:26] [INFO ] Invariant cache hit.
[2024-05-25 07:17:29] [INFO ] Implicit Places using invariants and state equation in 2998 ms returned []
Implicit Place search using SMT with State Equation took 4068 ms to find 0 implicit places.
[2024-05-25 07:17:29] [INFO ] Redundant transitions in 40 ms returned []
Running 404 sub problems to find dead transitions.
[2024-05-25 07:17:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/450 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 2 (OVERLAPS) 4/454 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 4 (OVERLAPS) 408/862 variables, 454/500 constraints. Problems are: Problem set: 0 solved, 404 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 862/1000 variables, and 500 constraints, problems are : Problem set: 0 solved, 404 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 454/523 constraints, PredecessorRefiner: 404/404 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 404 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/450 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 2 (OVERLAPS) 4/454 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 4 (OVERLAPS) 408/862 variables, 454/500 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/862 variables, 404/904 constraints. Problems are: Problem set: 0 solved, 404 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 862/1000 variables, and 904 constraints, problems are : Problem set: 0 solved, 404 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 454/523 constraints, PredecessorRefiner: 404/404 constraints, Known Traps: 0/0 constraints]
After SMT, in 60147ms problems are : Problem set: 0 solved, 404 unsolved
Search for dead transitions found 0 dead transitions in 60155ms
Starting structural reductions in SI_LTL mode, iteration 1 : 523/957 places, 477/911 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64507 ms. Remains : 523/957 places, 477/911 transitions.
Stuttering acceptance computed with spot in 291 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-00
Product exploration explored 100000 steps with 398 reset in 889 ms.
Product exploration explored 100000 steps with 398 reset in 539 ms.
Computed a total of 523 stabilizing places and 477 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 523 transition count 477
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 98 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 1086 steps (0 resets) in 10 ms. (98 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 152 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2024-05-25 07:18:31] [INFO ] Invariant cache hit.
[2024-05-25 07:18:33] [INFO ] [Real]Absence check using 0 positive and 46 generalized place invariants in 618 ms returned sat
[2024-05-25 07:18:41] [INFO ] [Real]Absence check using state equation in 8618 ms returned sat
[2024-05-25 07:18:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 07:18:42] [INFO ] [Nat]Absence check using 0 positive and 46 generalized place invariants in 384 ms returned sat
[2024-05-25 07:18:46] [INFO ] [Nat]Absence check using state equation in 3547 ms returned sat
[2024-05-25 07:18:46] [INFO ] Computed and/alt/rep : 382/391/382 causal constraints (skipped 22 transitions) in 39 ms.
[2024-05-25 07:18:49] [INFO ] Added : 127 causal constraints over 26 iterations in 3279 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 523 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 523/523 places, 477/477 transitions.
Applied a total of 0 rules in 50 ms. Remains 523 /523 variables (removed 0) and now considering 477/477 (removed 0) transitions.
[2024-05-25 07:18:49] [INFO ] Invariant cache hit.
[2024-05-25 07:18:50] [INFO ] Implicit Places using invariants in 1010 ms returned []
[2024-05-25 07:18:50] [INFO ] Invariant cache hit.
[2024-05-25 07:18:54] [INFO ] Implicit Places using invariants and state equation in 3352 ms returned []
Implicit Place search using SMT with State Equation took 4383 ms to find 0 implicit places.
[2024-05-25 07:18:54] [INFO ] Redundant transitions in 4 ms returned []
Running 404 sub problems to find dead transitions.
[2024-05-25 07:18:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/450 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 2 (OVERLAPS) 4/454 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 4 (OVERLAPS) 408/862 variables, 454/500 constraints. Problems are: Problem set: 0 solved, 404 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 862/1000 variables, and 500 constraints, problems are : Problem set: 0 solved, 404 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 454/523 constraints, PredecessorRefiner: 404/404 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 404 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/450 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 2 (OVERLAPS) 4/454 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 4 (OVERLAPS) 408/862 variables, 454/500 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/862 variables, 404/904 constraints. Problems are: Problem set: 0 solved, 404 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 862/1000 variables, and 904 constraints, problems are : Problem set: 0 solved, 404 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 454/523 constraints, PredecessorRefiner: 404/404 constraints, Known Traps: 0/0 constraints]
After SMT, in 60139ms problems are : Problem set: 0 solved, 404 unsolved
Search for dead transitions found 0 dead transitions in 60145ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64593 ms. Remains : 523/523 places, 477/477 transitions.
Computed a total of 523 stabilizing places and 477 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 523 transition count 477
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 128 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
RANDOM walk for 1070 steps (0 resets) in 13 ms. (76 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 156 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
[2024-05-25 07:19:55] [INFO ] Invariant cache hit.
[2024-05-25 07:19:56] [INFO ] [Real]Absence check using 0 positive and 46 generalized place invariants in 635 ms returned sat
[2024-05-25 07:20:06] [INFO ] [Real]Absence check using state equation in 9672 ms returned sat
[2024-05-25 07:20:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 07:20:07] [INFO ] [Nat]Absence check using 0 positive and 46 generalized place invariants in 388 ms returned sat
[2024-05-25 07:20:11] [INFO ] [Nat]Absence check using state equation in 4342 ms returned sat
[2024-05-25 07:20:11] [INFO ] Computed and/alt/rep : 382/391/382 causal constraints (skipped 22 transitions) in 35 ms.
[2024-05-25 07:20:14] [INFO ] Added : 127 causal constraints over 26 iterations in 3094 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Product exploration explored 100000 steps with 398 reset in 607 ms.
Product exploration explored 100000 steps with 398 reset in 418 ms.
Built C files in :
/tmp/ltsmin11009545948643554215
[2024-05-25 07:20:15] [INFO ] Computing symmetric may disable matrix : 477 transitions.
[2024-05-25 07:20:15] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 07:20:15] [INFO ] Computing symmetric may enable matrix : 477 transitions.
[2024-05-25 07:20:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 07:20:15] [INFO ] Computing Do-Not-Accords matrix : 477 transitions.
[2024-05-25 07:20:15] [INFO ] Computation of Completed DNA matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 07:20:15] [INFO ] Built C files in 130ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11009545948643554215
Running compilation step : cd /tmp/ltsmin11009545948643554215;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2610 ms.
Running link step : cd /tmp/ltsmin11009545948643554215;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin11009545948643554215;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased984659547829316013.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 523 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 523/523 places, 477/477 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 522 transition count 466
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 512 transition count 466
Applied a total of 20 rules in 35 ms. Remains 512 /523 variables (removed 11) and now considering 466/477 (removed 11) transitions.
// Phase 1: matrix 466 rows 512 cols
[2024-05-25 07:20:30] [INFO ] Computed 46 invariants in 6 ms
[2024-05-25 07:20:31] [INFO ] Implicit Places using invariants in 912 ms returned []
[2024-05-25 07:20:31] [INFO ] Invariant cache hit.
[2024-05-25 07:20:35] [INFO ] Implicit Places using invariants and state equation in 3325 ms returned []
Implicit Place search using SMT with State Equation took 4246 ms to find 0 implicit places.
[2024-05-25 07:20:35] [INFO ] Redundant transitions in 3 ms returned []
Running 390 sub problems to find dead transitions.
[2024-05-25 07:20:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/436 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/436 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (OVERLAPS) 3/439 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 393/832 variables, 439/485 constraints. Problems are: Problem set: 0 solved, 390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 832/978 variables, and 485 constraints, problems are : Problem set: 0 solved, 390 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 439/512 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/436 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/436 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (OVERLAPS) 3/439 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 393/832 variables, 439/485 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/832 variables, 390/875 constraints. Problems are: Problem set: 0 solved, 390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 832/978 variables, and 875 constraints, problems are : Problem set: 0 solved, 390 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 439/512 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 0/0 constraints]
After SMT, in 60103ms problems are : Problem set: 0 solved, 390 unsolved
Search for dead transitions found 0 dead transitions in 60109ms
Starting structural reductions in SI_LTL mode, iteration 1 : 512/523 places, 466/477 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64402 ms. Remains : 512/523 places, 466/477 transitions.
Built C files in :
/tmp/ltsmin5661559817997970079
[2024-05-25 07:21:35] [INFO ] Computing symmetric may disable matrix : 466 transitions.
[2024-05-25 07:21:35] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 07:21:35] [INFO ] Computing symmetric may enable matrix : 466 transitions.
[2024-05-25 07:21:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 07:21:35] [INFO ] Computing Do-Not-Accords matrix : 466 transitions.
[2024-05-25 07:21:35] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 07:21:35] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5661559817997970079
Running compilation step : cd /tmp/ltsmin5661559817997970079;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2136 ms.
Running link step : cd /tmp/ltsmin5661559817997970079;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin5661559817997970079;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5773226547388607875.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 07:21:50] [INFO ] Flatten gal took : 29 ms
[2024-05-25 07:21:50] [INFO ] Flatten gal took : 29 ms
[2024-05-25 07:21:50] [INFO ] Time to serialize gal into /tmp/LTL6557660772154744231.gal : 7 ms
[2024-05-25 07:21:50] [INFO ] Time to serialize properties into /tmp/LTL9541873525492923730.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/LTL6557660772154744231.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7063887137924144677.hoa' '-atoms' '/tmp/LTL9541873525492923730.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/LTL9541873525492923730.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7063887137924144677.hoa
Detected timeout of ITS tools.
[2024-05-25 07:22:05] [INFO ] Flatten gal took : 25 ms
[2024-05-25 07:22:05] [INFO ] Flatten gal took : 23 ms
[2024-05-25 07:22:05] [INFO ] Time to serialize gal into /tmp/LTL12959654086801407487.gal : 5 ms
[2024-05-25 07:22:05] [INFO ] Time to serialize properties into /tmp/LTL12176286523534804269.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/LTL12959654086801407487.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12176286523534804269.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(((F("((newmsg7>=1)&&(elected_40_to_left_8>=1))"))U((!("((newmsg7>=1)&&(elected_40_to_left_8>=1))"))U(G("((newmsg5>=1)&&(reply_40_...226
Formula 0 simplified : G(!"((newmsg5>=1)&&(reply_40_4_to_left_6>=1))" & (G!"((newmsg7>=1)&&(elected_40_to_left_8>=1))" R ("((newmsg7>=1)&&(elected_40_to_le...216
Detected timeout of ITS tools.
[2024-05-25 07:22:20] [INFO ] Flatten gal took : 21 ms
[2024-05-25 07:22:20] [INFO ] Applying decomposition
[2024-05-25 07:22:20] [INFO ] Flatten gal took : 19 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/graph17450731089754762177.txt' '-o' '/tmp/graph17450731089754762177.bin' '-w' '/tmp/graph17450731089754762177.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17450731089754762177.bin' '-l' '-1' '-v' '-w' '/tmp/graph17450731089754762177.weights' '-q' '0' '-e' '0.001'
[2024-05-25 07:22:20] [INFO ] Decomposing Gal with order
[2024-05-25 07:22:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 07:22:21] [INFO ] Removed a total of 314 redundant transitions.
[2024-05-25 07:22:21] [INFO ] Flatten gal took : 176 ms
[2024-05-25 07:22:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 40 ms.
[2024-05-25 07:22:21] [INFO ] Time to serialize gal into /tmp/LTL14509629438120602600.gal : 27 ms
[2024-05-25 07:22:21] [INFO ] Time to serialize properties into /tmp/LTL16142204357598418496.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/LTL14509629438120602600.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16142204357598418496.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(((F("((i1.u2.newmsg7>=1)&&(i8.i0.u203.elected_40_to_left_8>=1))"))U((!("((i1.u2.newmsg7>=1)&&(i8.i0.u203.elected_40_to_left_8>=1)...284
Formula 0 simplified : G(!"((i0.u0.newmsg5>=1)&&(i1.u1.reply_40_4_to_left_6>=1))" & (G!"((i1.u2.newmsg7>=1)&&(i8.i0.u203.elected_40_to_left_8>=1))" R ("((i...274
Reverse transition relation is NOT exact ! Due to transitions t46_t47, t58_t59, t156_t157, t307_t308, t376_t377, t788_t789, t818_t819, t832_t833, i0.t61, i...744
Computing Next relation with stutter on 8.73115e+28 deadlock states
Detected timeout of ITS tools.
Treatment of property HirschbergSinclair-PT-40-LTLFireability-00 finished in 311454 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||G(!p0))))))'
Support contains 2 out of 957 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 957/957 places, 911/911 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 952 transition count 906
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 952 transition count 906
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 950 transition count 904
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 950 transition count 904
Applied a total of 14 rules in 186 ms. Remains 950 /957 variables (removed 7) and now considering 904/911 (removed 7) transitions.
// Phase 1: matrix 904 rows 950 cols
[2024-05-25 07:22:36] [INFO ] Computed 46 invariants in 8 ms
[2024-05-25 07:22:37] [INFO ] Implicit Places using invariants in 1137 ms returned []
[2024-05-25 07:22:37] [INFO ] Invariant cache hit.
[2024-05-25 07:22:45] [INFO ] Implicit Places using invariants and state equation in 8022 ms returned []
Implicit Place search using SMT with State Equation took 9167 ms to find 0 implicit places.
Running 864 sub problems to find dead transitions.
[2024-05-25 07:22:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/910 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 910/1854 variables, and 6 constraints, problems are : Problem set: 0 solved, 864 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 6/46 constraints, State Equation: 0/950 constraints, PredecessorRefiner: 864/864 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 864 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/910 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/910 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 2 (OVERLAPS) 40/950 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 864 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 950/1854 variables, and 46 constraints, problems are : Problem set: 0 solved, 864 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/950 constraints, PredecessorRefiner: 0/864 constraints, Known Traps: 0/0 constraints]
After SMT, in 60568ms problems are : Problem set: 0 solved, 864 unsolved
Search for dead transitions found 0 dead transitions in 60592ms
Starting structural reductions in LTL mode, iteration 1 : 950/957 places, 904/911 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69950 ms. Remains : 950/957 places, 904/911 transitions.
Stuttering acceptance computed with spot in 275 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (AND p0 (NOT p1)), p0]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-40-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-40-LTLFireability-01 finished in 70269 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(p0)) U (p1 U p2)))'
Support contains 4 out of 957 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 957/957 places, 911/911 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 951 transition count 905
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 951 transition count 905
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 948 transition count 902
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 948 transition count 902
Applied a total of 18 rules in 180 ms. Remains 948 /957 variables (removed 9) and now considering 902/911 (removed 9) transitions.
// Phase 1: matrix 902 rows 948 cols
[2024-05-25 07:23:46] [INFO ] Computed 46 invariants in 12 ms
[2024-05-25 07:23:48] [INFO ] Implicit Places using invariants in 1191 ms returned []
[2024-05-25 07:23:48] [INFO ] Invariant cache hit.
[2024-05-25 07:23:55] [INFO ] Implicit Places using invariants and state equation in 7387 ms returned []
Implicit Place search using SMT with State Equation took 8584 ms to find 0 implicit places.
Running 862 sub problems to find dead transitions.
[2024-05-25 07:23:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 862 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 908/1850 variables, and 6 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 6/46 constraints, State Equation: 0/948 constraints, PredecessorRefiner: 862/862 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 862 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/908 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 2 (OVERLAPS) 40/948 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 948/1850 variables, and 46 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/948 constraints, PredecessorRefiner: 0/862 constraints, Known Traps: 0/0 constraints]
After SMT, in 60553ms problems are : Problem set: 0 solved, 862 unsolved
Search for dead transitions found 0 dead transitions in 60571ms
Starting structural reductions in LTL mode, iteration 1 : 948/957 places, 902/911 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69344 ms. Remains : 948/957 places, 902/911 transitions.
Stuttering acceptance computed with spot in 357 ms :[(NOT p2), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p2) (NOT p1) (NOT p0)), (AND p0 (NOT p2))]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-02
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-40-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-40-LTLFireability-02 finished in 69746 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 U X(p1))))'
Support contains 3 out of 957 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 957/957 places, 911/911 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 951 transition count 905
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 951 transition count 905
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 948 transition count 902
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 948 transition count 902
Applied a total of 18 rules in 186 ms. Remains 948 /957 variables (removed 9) and now considering 902/911 (removed 9) transitions.
[2024-05-25 07:24:56] [INFO ] Invariant cache hit.
[2024-05-25 07:24:57] [INFO ] Implicit Places using invariants in 1234 ms returned []
[2024-05-25 07:24:57] [INFO ] Invariant cache hit.
[2024-05-25 07:25:04] [INFO ] Implicit Places using invariants and state equation in 6729 ms returned []
Implicit Place search using SMT with State Equation took 7972 ms to find 0 implicit places.
Running 862 sub problems to find dead transitions.
[2024-05-25 07:25:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 908/1850 variables, and 6 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 6/46 constraints, State Equation: 0/948 constraints, PredecessorRefiner: 862/862 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 862 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/908 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 2 (OVERLAPS) 40/948 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 948/1850 variables, and 46 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/948 constraints, PredecessorRefiner: 0/862 constraints, Known Traps: 0/0 constraints]
After SMT, in 60370ms problems are : Problem set: 0 solved, 862 unsolved
Search for dead transitions found 0 dead transitions in 60380ms
Starting structural reductions in LTL mode, iteration 1 : 948/957 places, 902/911 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68542 ms. Remains : 948/957 places, 902/911 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-03
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-40-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-40-LTLFireability-03 finished in 68772 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) U G((p1||G(p0)))))'
Support contains 3 out of 957 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 957/957 places, 911/911 transitions.
Reduce places removed 37 places and 37 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 399 transitions
Trivial Post-agglo rules discarded 399 transitions
Performed 399 trivial Post agglomeration. Transition count delta: 399
Iterating post reduction 0 with 399 rules applied. Total rules applied 399 place count 920 transition count 475
Reduce places removed 399 places and 0 transitions.
Iterating post reduction 1 with 399 rules applied. Total rules applied 798 place count 521 transition count 475
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 803 place count 516 transition count 470
Iterating global reduction 2 with 5 rules applied. Total rules applied 808 place count 516 transition count 470
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 810 place count 516 transition count 468
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 812 place count 514 transition count 468
Applied a total of 812 rules in 107 ms. Remains 514 /957 variables (removed 443) and now considering 468/911 (removed 443) transitions.
// Phase 1: matrix 468 rows 514 cols
[2024-05-25 07:26:05] [INFO ] Computed 46 invariants in 10 ms
[2024-05-25 07:26:06] [INFO ] Implicit Places using invariants in 1132 ms returned []
[2024-05-25 07:26:06] [INFO ] Invariant cache hit.
[2024-05-25 07:26:07] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-25 07:26:10] [INFO ] Implicit Places using invariants and state equation in 4006 ms returned []
Implicit Place search using SMT with State Equation took 5141 ms to find 0 implicit places.
[2024-05-25 07:26:10] [INFO ] Redundant transitions in 3 ms returned []
Running 396 sub problems to find dead transitions.
[2024-05-25 07:26:10] [INFO ] Invariant cache hit.
[2024-05-25 07:26:10] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (OVERLAPS) 5/447 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 4 (OVERLAPS) 401/848 variables, 447/493 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/848 variables, 18/511 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 848/982 variables, and 511 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 447/514 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (OVERLAPS) 5/447 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 4 (OVERLAPS) 401/848 variables, 447/493 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/848 variables, 18/511 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/848 variables, 396/907 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 848/982 variables, and 907 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 447/514 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 0/0 constraints]
After SMT, in 60098ms problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 60103ms
Starting structural reductions in SI_LTL mode, iteration 1 : 514/957 places, 468/911 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65361 ms. Remains : 514/957 places, 468/911 transitions.
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p1) (NOT p0)), p0, (NOT p0), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-05
Entered a terminal (fully accepting) state of product in 134 steps with 2 reset in 4 ms.
FORMULA HirschbergSinclair-PT-40-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-40-LTLFireability-05 finished in 65642 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((p0||G(F(p1))))))'
Support contains 2 out of 957 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 957/957 places, 911/911 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 951 transition count 905
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 951 transition count 905
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 948 transition count 902
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 948 transition count 902
Applied a total of 18 rules in 181 ms. Remains 948 /957 variables (removed 9) and now considering 902/911 (removed 9) transitions.
// Phase 1: matrix 902 rows 948 cols
[2024-05-25 07:27:11] [INFO ] Computed 46 invariants in 10 ms
[2024-05-25 07:27:12] [INFO ] Implicit Places using invariants in 1268 ms returned []
[2024-05-25 07:27:12] [INFO ] Invariant cache hit.
[2024-05-25 07:27:19] [INFO ] Implicit Places using invariants and state equation in 7308 ms returned []
Implicit Place search using SMT with State Equation took 8578 ms to find 0 implicit places.
Running 862 sub problems to find dead transitions.
[2024-05-25 07:27:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 908/1850 variables, and 6 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 6/46 constraints, State Equation: 0/948 constraints, PredecessorRefiner: 862/862 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 862 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/908 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 2 (OVERLAPS) 40/948 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 948/1850 variables, and 46 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/948 constraints, PredecessorRefiner: 0/862 constraints, Known Traps: 0/0 constraints]
After SMT, in 60449ms problems are : Problem set: 0 solved, 862 unsolved
Search for dead transitions found 0 dead transitions in 60459ms
Starting structural reductions in LTL mode, iteration 1 : 948/957 places, 902/911 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69221 ms. Remains : 948/957 places, 902/911 transitions.
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-06
Product exploration explored 100000 steps with 128 reset in 635 ms.
Product exploration explored 100000 steps with 129 reset in 693 ms.
Computed a total of 948 stabilizing places and 902 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 948 transition count 902
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 15 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-40-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-40-LTLFireability-06 finished in 71228 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(G((!p1&&(!p0 U (p2||G(!p0))))) U G(p3))))'
Support contains 7 out of 957 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 957/957 places, 911/911 transitions.
Reduce places removed 37 places and 37 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 370 transitions
Trivial Post-agglo rules discarded 370 transitions
Performed 370 trivial Post agglomeration. Transition count delta: 370
Iterating post reduction 0 with 370 rules applied. Total rules applied 370 place count 920 transition count 504
Reduce places removed 370 places and 0 transitions.
Iterating post reduction 1 with 370 rules applied. Total rules applied 740 place count 550 transition count 504
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 744 place count 546 transition count 500
Iterating global reduction 2 with 4 rules applied. Total rules applied 748 place count 546 transition count 500
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 749 place count 546 transition count 499
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 750 place count 545 transition count 499
Applied a total of 750 rules in 71 ms. Remains 545 /957 variables (removed 412) and now considering 499/911 (removed 412) transitions.
// Phase 1: matrix 499 rows 545 cols
[2024-05-25 07:28:22] [INFO ] Computed 46 invariants in 3 ms
[2024-05-25 07:28:23] [INFO ] Implicit Places using invariants in 1105 ms returned []
[2024-05-25 07:28:23] [INFO ] Invariant cache hit.
[2024-05-25 07:28:27] [INFO ] Implicit Places using invariants and state equation in 4151 ms returned []
Implicit Place search using SMT with State Equation took 5260 ms to find 0 implicit places.
[2024-05-25 07:28:27] [INFO ] Redundant transitions in 3 ms returned []
Running 428 sub problems to find dead transitions.
[2024-05-25 07:28:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 2 (OVERLAPS) 3/477 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/477 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 4 (OVERLAPS) 433/910 variables, 477/523 constraints. Problems are: Problem set: 0 solved, 428 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 910/1044 variables, and 523 constraints, problems are : Problem set: 0 solved, 428 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 477/545 constraints, PredecessorRefiner: 428/428 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 428 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 2 (OVERLAPS) 3/477 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/477 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 4 (OVERLAPS) 433/910 variables, 477/523 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/910 variables, 428/951 constraints. Problems are: Problem set: 0 solved, 428 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 0)
(s3 0)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 0)
(s14 0)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 0)
(s42 1)
(s43 1)
(s44 0)
(s47 0)
(s48 0)
(s49 1)
(s50 1)
(s51 0)
(s52 1)
(s69 1)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 1)
(s106 0)
(s108 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 1)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(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 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 910/1044 variables, and 951 constraints, problems are : Problem set: 0 solved, 428 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 477/545 constraints, PredecessorRefiner: 428/428 constraints, Known Traps: 0/0 constraints]
After SMT, in 60122ms problems are : Problem set: 0 solved, 428 unsolved
Search for dead transitions found 0 dead transitions in 60128ms
Starting structural reductions in SI_LTL mode, iteration 1 : 545/957 places, 499/911 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65469 ms. Remains : 545/957 places, 499/911 transitions.
Stuttering acceptance computed with spot in 353 ms :[(OR (NOT p0) (NOT p3)), true, (NOT p0), (NOT p3), (OR (AND p0 (NOT p2) p3) (AND p1 p3)), (NOT p3)]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-07
Product exploration explored 100000 steps with 1854 reset in 873 ms.
Product exploration explored 100000 steps with 1863 reset in 567 ms.
Computed a total of 545 stabilizing places and 499 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 545 transition count 499
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p3) p2 (NOT p1)), (X p2), (X (NOT (OR (AND p0 p3 (NOT p2)) (AND p3 p1)))), (X (NOT p0)), (X (NOT (OR (AND p0 (NOT p3) (NOT p2)) (AND (NOT p3) p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (OR (AND p0 p3 (NOT p2)) (AND p3 p1))))), (X (X (NOT p0))), (X (X (NOT (OR (AND p0 (NOT p3) (NOT p2)) (AND (NOT p3) p1))))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p3))), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p1) p2)))), (X (NOT p3)), (X p3), (X (OR (AND (NOT p0) p3 (NOT p1)) (AND p3 (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) p3 (NOT p1)) (AND p3 (NOT p1) p2)))), (X (X (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p1) p2))))), (X (X (NOT p3))), (X (X p3)), (X (X (OR (AND (NOT p0) p3 (NOT p1)) (AND p3 (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p3 (NOT p1)) (AND p3 (NOT p1) p2)))))]
Property proved to be false thanks to negative knowledge :(X (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p1) p2)))
Knowledge based reduction with 15 factoid took 207 ms. Reduced automaton from 6 states, 16 edges and 4 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-40-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-40-LTLFireability-07 finished in 67727 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&F(p1))))))'
Support contains 3 out of 957 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 957/957 places, 911/911 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 951 transition count 905
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 951 transition count 905
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 948 transition count 902
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 948 transition count 902
Applied a total of 18 rules in 176 ms. Remains 948 /957 variables (removed 9) and now considering 902/911 (removed 9) transitions.
// Phase 1: matrix 902 rows 948 cols
[2024-05-25 07:29:30] [INFO ] Computed 46 invariants in 10 ms
[2024-05-25 07:29:31] [INFO ] Implicit Places using invariants in 1195 ms returned []
[2024-05-25 07:29:31] [INFO ] Invariant cache hit.
[2024-05-25 07:29:38] [INFO ] Implicit Places using invariants and state equation in 6968 ms returned []
Implicit Place search using SMT with State Equation took 8165 ms to find 0 implicit places.
Running 862 sub problems to find dead transitions.
[2024-05-25 07:29:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s3 1.0)
(s5 1.0)
(s7 1.0)
(s9 1.0)
(s11 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 908/1850 variables, and 6 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 6/46 constraints, State Equation: 0/948 constraints, PredecessorRefiner: 862/862 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 862 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/908 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 2 (OVERLAPS) 40/948 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 948/1850 variables, and 46 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/948 constraints, PredecessorRefiner: 0/862 constraints, Known Traps: 0/0 constraints]
After SMT, in 60391ms problems are : Problem set: 0 solved, 862 unsolved
Search for dead transitions found 0 dead transitions in 60401ms
Starting structural reductions in LTL mode, iteration 1 : 948/957 places, 902/911 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68746 ms. Remains : 948/957 places, 902/911 transitions.
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-08
Stuttering criterion allowed to conclude after 972 steps with 0 reset in 5 ms.
FORMULA HirschbergSinclair-PT-40-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-40-LTLFireability-08 finished in 69022 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 1 out of 957 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 957/957 places, 911/911 transitions.
Reduce places removed 40 places and 40 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 407 transitions
Trivial Post-agglo rules discarded 407 transitions
Performed 407 trivial Post agglomeration. Transition count delta: 407
Iterating post reduction 0 with 407 rules applied. Total rules applied 407 place count 917 transition count 464
Reduce places removed 407 places and 0 transitions.
Iterating post reduction 1 with 407 rules applied. Total rules applied 814 place count 510 transition count 464
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 820 place count 504 transition count 458
Iterating global reduction 2 with 6 rules applied. Total rules applied 826 place count 504 transition count 458
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 829 place count 504 transition count 455
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 832 place count 501 transition count 455
Applied a total of 832 rules in 99 ms. Remains 501 /957 variables (removed 456) and now considering 455/911 (removed 456) transitions.
// Phase 1: matrix 455 rows 501 cols
[2024-05-25 07:30:38] [INFO ] Computed 46 invariants in 4 ms
[2024-05-25 07:30:40] [INFO ] Implicit Places using invariants in 1163 ms returned []
[2024-05-25 07:30:40] [INFO ] Invariant cache hit.
[2024-05-25 07:30:43] [INFO ] Implicit Places using invariants and state equation in 3193 ms returned []
Implicit Place search using SMT with State Equation took 4360 ms to find 0 implicit places.
[2024-05-25 07:30:43] [INFO ] Redundant transitions in 2 ms returned []
Running 376 sub problems to find dead transitions.
[2024-05-25 07:30:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (OVERLAPS) 2/424 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/424 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 4 (OVERLAPS) 378/802 variables, 424/470 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 802/956 variables, and 470 constraints, problems are : Problem set: 0 solved, 376 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 424/501 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 376 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (OVERLAPS) 2/424 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/424 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 4 (OVERLAPS) 378/802 variables, 424/470 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 376/846 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 802/956 variables, and 846 constraints, problems are : Problem set: 0 solved, 376 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 424/501 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 0/0 constraints]
After SMT, in 60083ms problems are : Problem set: 0 solved, 376 unsolved
Search for dead transitions found 0 dead transitions in 60088ms
Starting structural reductions in SI_LTL mode, iteration 1 : 501/957 places, 455/911 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64558 ms. Remains : 501/957 places, 455/911 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-09
Product exploration explored 100000 steps with 202 reset in 518 ms.
Product exploration explored 100000 steps with 202 reset in 505 ms.
Computed a total of 501 stabilizing places and 455 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 501 transition count 455
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 13 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-40-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-40-LTLFireability-09 finished in 65928 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(X(p0))||F(p1)))))'
Support contains 3 out of 957 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 957/957 places, 911/911 transitions.
Reduce places removed 38 places and 38 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 398 transitions
Trivial Post-agglo rules discarded 398 transitions
Performed 398 trivial Post agglomeration. Transition count delta: 398
Iterating post reduction 0 with 398 rules applied. Total rules applied 398 place count 919 transition count 475
Reduce places removed 398 places and 0 transitions.
Iterating post reduction 1 with 398 rules applied. Total rules applied 796 place count 521 transition count 475
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 802 place count 515 transition count 469
Iterating global reduction 2 with 6 rules applied. Total rules applied 808 place count 515 transition count 469
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 811 place count 515 transition count 466
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 814 place count 512 transition count 466
Applied a total of 814 rules in 52 ms. Remains 512 /957 variables (removed 445) and now considering 466/911 (removed 445) transitions.
// Phase 1: matrix 466 rows 512 cols
[2024-05-25 07:31:44] [INFO ] Computed 46 invariants in 3 ms
[2024-05-25 07:31:45] [INFO ] Implicit Places using invariants in 708 ms returned []
[2024-05-25 07:31:45] [INFO ] Invariant cache hit.
[2024-05-25 07:31:46] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 07:31:49] [INFO ] Implicit Places using invariants and state equation in 3461 ms returned []
Implicit Place search using SMT with State Equation took 4173 ms to find 0 implicit places.
[2024-05-25 07:31:49] [INFO ] Redundant transitions in 4 ms returned []
Running 393 sub problems to find dead transitions.
[2024-05-25 07:31:49] [INFO ] Invariant cache hit.
[2024-05-25 07:31:49] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 4/443 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/443 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (OVERLAPS) 397/840 variables, 443/489 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/840 variables, 10/499 constraints. Problems are: Problem set: 0 solved, 393 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 840/978 variables, and 499 constraints, problems are : Problem set: 0 solved, 393 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 443/512 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 4/443 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/443 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (OVERLAPS) 397/840 variables, 443/489 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/840 variables, 10/499 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/840 variables, 393/892 constraints. Problems are: Problem set: 0 solved, 393 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 840/978 variables, and 892 constraints, problems are : Problem set: 0 solved, 393 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 443/512 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 0/0 constraints]
After SMT, in 60133ms problems are : Problem set: 0 solved, 393 unsolved
Search for dead transitions found 0 dead transitions in 60140ms
Starting structural reductions in SI_LTL mode, iteration 1 : 512/957 places, 466/911 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64380 ms. Remains : 512/957 places, 466/911 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-10
Product exploration explored 100000 steps with 204 reset in 484 ms.
Product exploration explored 100000 steps with 204 reset in 501 ms.
Computed a total of 512 stabilizing places and 466 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 512 transition count 466
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 32 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-40-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-40-LTLFireability-10 finished in 65755 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||F(p1)||X(G(p2)))))'
Support contains 6 out of 957 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 957/957 places, 911/911 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 951 transition count 905
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 951 transition count 905
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 948 transition count 902
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 948 transition count 902
Applied a total of 18 rules in 103 ms. Remains 948 /957 variables (removed 9) and now considering 902/911 (removed 9) transitions.
// Phase 1: matrix 902 rows 948 cols
[2024-05-25 07:32:50] [INFO ] Computed 46 invariants in 6 ms
[2024-05-25 07:32:51] [INFO ] Implicit Places using invariants in 1149 ms returned []
[2024-05-25 07:32:51] [INFO ] Invariant cache hit.
[2024-05-25 07:32:58] [INFO ] Implicit Places using invariants and state equation in 6772 ms returned []
Implicit Place search using SMT with State Equation took 7925 ms to find 0 implicit places.
Running 862 sub problems to find dead transitions.
[2024-05-25 07:32:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 908/1850 variables, and 6 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 6/46 constraints, State Equation: 0/948 constraints, PredecessorRefiner: 862/862 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 862 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/908 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 2 (OVERLAPS) 40/948 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 948/1850 variables, and 46 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/948 constraints, PredecessorRefiner: 0/862 constraints, Known Traps: 0/0 constraints]
After SMT, in 60386ms problems are : Problem set: 0 solved, 862 unsolved
Search for dead transitions found 0 dead transitions in 60395ms
Starting structural reductions in LTL mode, iteration 1 : 948/957 places, 902/911 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68425 ms. Remains : 948/957 places, 902/911 transitions.
Stuttering acceptance computed with spot in 222 ms :[(NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-11
Product exploration explored 100000 steps with 317 reset in 741 ms.
Product exploration explored 100000 steps with 317 reset in 579 ms.
Computed a total of 948 stabilizing places and 902 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 948 transition count 902
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 354 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 1267 steps (0 resets) in 14 ms. (84 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 11 factoid took 585 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
[2024-05-25 07:34:02] [INFO ] Invariant cache hit.
[2024-05-25 07:34:04] [INFO ] [Real]Absence check using 0 positive and 46 generalized place invariants in 327 ms returned sat
[2024-05-25 07:34:17] [INFO ] [Real]Absence check using state equation in 13372 ms returned unknown
Could not prove EG (NOT p1)
Support contains 3 out of 948 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 948/948 places, 902/902 transitions.
Applied a total of 0 rules in 31 ms. Remains 948 /948 variables (removed 0) and now considering 902/902 (removed 0) transitions.
[2024-05-25 07:34:17] [INFO ] Invariant cache hit.
[2024-05-25 07:34:18] [INFO ] Implicit Places using invariants in 1158 ms returned []
[2024-05-25 07:34:18] [INFO ] Invariant cache hit.
[2024-05-25 07:34:26] [INFO ] Implicit Places using invariants and state equation in 7258 ms returned []
Implicit Place search using SMT with State Equation took 8423 ms to find 0 implicit places.
Running 862 sub problems to find dead transitions.
[2024-05-25 07:34:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 862 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 908/1850 variables, and 6 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 6/46 constraints, State Equation: 0/948 constraints, PredecessorRefiner: 862/862 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 862 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/908 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 2 (OVERLAPS) 40/948 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 948/1850 variables, and 46 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/948 constraints, PredecessorRefiner: 0/862 constraints, Known Traps: 0/0 constraints]
After SMT, in 60539ms problems are : Problem set: 0 solved, 862 unsolved
Search for dead transitions found 0 dead transitions in 60555ms
Finished structural reductions in LTL mode , in 1 iterations and 69013 ms. Remains : 948/948 places, 902/902 transitions.
Computed a total of 948 stabilizing places and 902 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 948 transition count 902
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 1255 steps (0 resets) in 16 ms. (73 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 144 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 205 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
[2024-05-25 07:35:28] [INFO ] Invariant cache hit.
[2024-05-25 07:35:29] [INFO ] [Real]Absence check using 0 positive and 46 generalized place invariants in 331 ms returned sat
[2024-05-25 07:35:43] [INFO ] [Real]Absence check using state equation in 13362 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 317 reset in 894 ms.
Product exploration explored 100000 steps with 317 reset in 846 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 3 out of 948 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 948/948 places, 902/902 transitions.
Performed 394 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 394 rules applied. Total rules applied 394 place count 948 transition count 902
Deduced a syphon composed of 394 places in 5 ms
Applied a total of 394 rules in 156 ms. Remains 948 /948 variables (removed 0) and now considering 902/902 (removed 0) transitions.
[2024-05-25 07:35:45] [INFO ] Redundant transitions in 10 ms returned []
Running 862 sub problems to find dead transitions.
// Phase 1: matrix 902 rows 948 cols
[2024-05-25 07:35:45] [INFO ] Computed 46 invariants in 9 ms
[2024-05-25 07:35:45] [INFO ] State equation strengthened by 394 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 908/1850 variables, and 6 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 6/46 constraints, State Equation: 0/948 constraints, ReadFeed: 0/394 constraints, PredecessorRefiner: 862/862 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 862 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/908 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 2 (OVERLAPS) 40/948 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 948/1850 variables, and 46 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/948 constraints, ReadFeed: 0/394 constraints, PredecessorRefiner: 0/862 constraints, Known Traps: 0/0 constraints]
After SMT, in 60323ms problems are : Problem set: 0 solved, 862 unsolved
Search for dead transitions found 0 dead transitions in 60332ms
Starting structural reductions in SI_LTL mode, iteration 1 : 948/948 places, 902/902 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60509 ms. Remains : 948/948 places, 902/902 transitions.
Built C files in :
/tmp/ltsmin9411512512361389130
[2024-05-25 07:36:45] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9411512512361389130
Running compilation step : cd /tmp/ltsmin9411512512361389130;'/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/ltsmin9411512512361389130;'/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/ltsmin9411512512361389130;'/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 3 out of 948 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 948/948 places, 902/902 transitions.
Applied a total of 0 rules in 36 ms. Remains 948 /948 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 948 cols
[2024-05-25 07:36:49] [INFO ] Computed 46 invariants in 10 ms
[2024-05-25 07:36:50] [INFO ] Implicit Places using invariants in 1047 ms returned []
[2024-05-25 07:36:50] [INFO ] Invariant cache hit.
[2024-05-25 07:36:58] [INFO ] Implicit Places using invariants and state equation in 8064 ms returned []
Implicit Place search using SMT with State Equation took 9114 ms to find 0 implicit places.
Running 862 sub problems to find dead transitions.
[2024-05-25 07:36:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s3 1.0)
(s5 1.0)
(s7 1.0)
(s9 1.0)
(s11 1.0)
(s13 1.0)
(s15 1.0)
(s17 1.0)
(s19 1.0)
(s21 1.0)
(s23 1.0)
(s25 1.0)
(s27 1.0)
(s29 1.0)
(s31 1.0)
(s33 1.0)
(s35 1.0)
(s37 1.0)
(s39 1.0)
(s41 1.0)
(s43 1.0)
(s45 1.0)
(s47 1.0)
(s49 1.0)
(s51 1.0)
(s53 1.0)
(s55 1.0)
(s57 1.0)
(s59 1.0)
(s61 1.0)
(s63 1.0)
(s65 1.0)
(s67 1.0)
(s69 1.0)
(s71 1.0)
(s73 1.0)
(s75 1.0)
(s77 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 908/1850 variables, and 6 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 6/46 constraints, State Equation: 0/948 constraints, PredecessorRefiner: 862/862 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 862 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/908 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 2 (OVERLAPS) 40/948 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 948/1850 variables, and 46 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/948 constraints, PredecessorRefiner: 0/862 constraints, Known Traps: 0/0 constraints]
After SMT, in 60354ms problems are : Problem set: 0 solved, 862 unsolved
Search for dead transitions found 0 dead transitions in 60365ms
Finished structural reductions in LTL mode , in 1 iterations and 69516 ms. Remains : 948/948 places, 902/902 transitions.
Built C files in :
/tmp/ltsmin5452673146332347379
[2024-05-25 07:37:58] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5452673146332347379
Running compilation step : cd /tmp/ltsmin5452673146332347379;'/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/ltsmin5452673146332347379;'/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/ltsmin5452673146332347379;'/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-25 07:38:01] [INFO ] Flatten gal took : 39 ms
[2024-05-25 07:38:01] [INFO ] Flatten gal took : 39 ms
[2024-05-25 07:38:01] [INFO ] Time to serialize gal into /tmp/LTL5329668687411067716.gal : 8 ms
[2024-05-25 07:38:01] [INFO ] Time to serialize properties into /tmp/LTL17417024058615777124.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5329668687411067716.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3006368370877373361.hoa' '-atoms' '/tmp/LTL17417024058615777124.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17417024058615777124.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3006368370877373361.hoa
Detected timeout of ITS tools.
[2024-05-25 07:38:16] [INFO ] Flatten gal took : 54 ms
[2024-05-25 07:38:16] [INFO ] Flatten gal took : 50 ms
[2024-05-25 07:38:16] [INFO ] Time to serialize gal into /tmp/LTL13035727141791082800.gal : 11 ms
[2024-05-25 07:38:16] [INFO ] Time to serialize properties into /tmp/LTL7937250020032372019.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/LTL13035727141791082800.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7937250020032372019.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(((F("((rcv_left_election_40_6_8_8>=1)||((newmsg3>=1)&&(reply_40_2_to_left_4>=1)))"))||(X(G("(rcv_right_election_40_4_7_33>=1)")))...214
Formula 0 simplified : X(!"((newmsg17>=1)&&(election_40_5_23_to_left_18>=1))" & G!"((rcv_left_election_40_6_8_8>=1)||((newmsg3>=1)&&(reply_40_2_to_left_4>=...202
Detected timeout of ITS tools.
[2024-05-25 07:38:32] [INFO ] Flatten gal took : 48 ms
[2024-05-25 07:38:32] [INFO ] Applying decomposition
[2024-05-25 07:38:32] [INFO ] Flatten gal took : 48 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1860946905559444496.txt' '-o' '/tmp/graph1860946905559444496.bin' '-w' '/tmp/graph1860946905559444496.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1860946905559444496.bin' '-l' '-1' '-v' '-w' '/tmp/graph1860946905559444496.weights' '-q' '0' '-e' '0.001'
[2024-05-25 07:38:32] [INFO ] Decomposing Gal with order
[2024-05-25 07:38:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 07:38:32] [INFO ] Removed a total of 74 redundant transitions.
[2024-05-25 07:38:32] [INFO ] Flatten gal took : 115 ms
[2024-05-25 07:38:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2024-05-25 07:38:32] [INFO ] Time to serialize gal into /tmp/LTL17216287244727408134.gal : 22 ms
[2024-05-25 07:38:32] [INFO ] Time to serialize properties into /tmp/LTL9586493527157817633.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/LTL17216287244727408134.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9586493527157817633.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(((F("((i2.i0.u80.rcv_left_election_40_6_8_8>=1)||((i1.i0.u2.newmsg3>=1)&&(i1.i0.u3.reply_40_2_to_left_4>=1)))"))||(X(G("(i7.i1.u3...272
Formula 0 simplified : X(!"((i4.i1.u16.newmsg17>=1)&&(i4.i1.u17.election_40_5_23_to_left_18>=1))" & G!"((i2.i0.u80.rcv_left_election_40_6_8_8>=1)||((i1.i0....260
Detected timeout of ITS tools.
Treatment of property HirschbergSinclair-PT-40-LTLFireability-11 finished in 357020 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 U p1))))'
Support contains 3 out of 957 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 957/957 places, 911/911 transitions.
Reduce places removed 39 places and 39 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 394 transitions
Trivial Post-agglo rules discarded 394 transitions
Performed 394 trivial Post agglomeration. Transition count delta: 394
Iterating post reduction 0 with 394 rules applied. Total rules applied 394 place count 918 transition count 478
Reduce places removed 394 places and 0 transitions.
Iterating post reduction 1 with 394 rules applied. Total rules applied 788 place count 524 transition count 478
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 794 place count 518 transition count 472
Iterating global reduction 2 with 6 rules applied. Total rules applied 800 place count 518 transition count 472
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 803 place count 518 transition count 469
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 806 place count 515 transition count 469
Applied a total of 806 rules in 78 ms. Remains 515 /957 variables (removed 442) and now considering 469/911 (removed 442) transitions.
// Phase 1: matrix 469 rows 515 cols
[2024-05-25 07:38:47] [INFO ] Computed 46 invariants in 5 ms
[2024-05-25 07:38:48] [INFO ] Implicit Places using invariants in 1022 ms returned []
[2024-05-25 07:38:48] [INFO ] Invariant cache hit.
[2024-05-25 07:38:52] [INFO ] Implicit Places using invariants and state equation in 3458 ms returned []
Implicit Place search using SMT with State Equation took 4485 ms to find 0 implicit places.
[2024-05-25 07:38:52] [INFO ] Redundant transitions in 5 ms returned []
Running 393 sub problems to find dead transitions.
[2024-05-25 07:38:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 3/442 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (OVERLAPS) 396/838 variables, 442/488 constraints. Problems are: Problem set: 0 solved, 393 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 838/984 variables, and 488 constraints, problems are : Problem set: 0 solved, 393 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 442/515 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 3/442 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (OVERLAPS) 396/838 variables, 442/488 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/838 variables, 393/881 constraints. Problems are: Problem set: 0 solved, 393 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 838/984 variables, and 881 constraints, problems are : Problem set: 0 solved, 393 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 442/515 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 0/0 constraints]
After SMT, in 60138ms problems are : Problem set: 0 solved, 393 unsolved
Search for dead transitions found 0 dead transitions in 60145ms
Starting structural reductions in SI_LTL mode, iteration 1 : 515/957 places, 469/911 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64722 ms. Remains : 515/957 places, 469/911 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-12
Stuttering criterion allowed to conclude after 510 steps with 0 reset in 6 ms.
FORMULA HirschbergSinclair-PT-40-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-40-LTLFireability-12 finished in 64945 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) U G(p2)) U p3)))'
Support contains 7 out of 957 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 957/957 places, 911/911 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 952 transition count 906
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 952 transition count 906
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 949 transition count 903
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 949 transition count 903
Applied a total of 16 rules in 165 ms. Remains 949 /957 variables (removed 8) and now considering 903/911 (removed 8) transitions.
// Phase 1: matrix 903 rows 949 cols
[2024-05-25 07:39:52] [INFO ] Computed 46 invariants in 8 ms
[2024-05-25 07:39:53] [INFO ] Implicit Places using invariants in 1234 ms returned []
[2024-05-25 07:39:53] [INFO ] Invariant cache hit.
[2024-05-25 07:40:01] [INFO ] Implicit Places using invariants and state equation in 7131 ms returned []
Implicit Place search using SMT with State Equation took 8367 ms to find 0 implicit places.
Running 863 sub problems to find dead transitions.
[2024-05-25 07:40:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/909 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 863 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s3 1.0)
(s5 1.0)
(s7 1.0)
(s9 1.0)
(s11 1.0)
(s13 1.0)
(s15 1.0)
(s17 1.0)
(s19 1.0)
(s21 1.0)
(s23 1.0)
(s25 1.0)
(s27 1.0)
(s29 1.0)
(s31 1.0)
(s33 1.0)
(s35 1.0)
(s37 1.0)
(s39 1.0)
(s41 1.0)
(s43 1.0)
(s45 1.0)
(s47 1.0)
(s49 1.0)
(s51 1.0)
(s53 1.0)
(s55 1.0)
(s57 1.0)
(s59 1.0)
(s61 1.0)
(s63 1.0)
(s65 1.0)
(s67 1.0)
(s69 1.0)
(s71 1.0)
(s73 1.0)
(s75 1.0)
(s77 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
timeout
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 909/1852 variables, and 6 constraints, problems are : Problem set: 0 solved, 863 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 6/46 constraints, State Equation: 0/949 constraints, PredecessorRefiner: 863/863 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 863 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/909 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 863 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/909 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 863 unsolved
At refinement iteration 2 (OVERLAPS) 40/949 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 863 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 949/1852 variables, and 46 constraints, problems are : Problem set: 0 solved, 863 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/949 constraints, PredecessorRefiner: 0/863 constraints, Known Traps: 0/0 constraints]
After SMT, in 60434ms problems are : Problem set: 0 solved, 863 unsolved
Search for dead transitions found 0 dead transitions in 60450ms
Starting structural reductions in LTL mode, iteration 1 : 949/957 places, 903/911 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68985 ms. Remains : 949/957 places, 903/911 transitions.
Stuttering acceptance computed with spot in 368 ms :[(OR (NOT p3) (NOT p0)), true, (NOT p0), (AND p2 (NOT p1)), (NOT p2), (NOT p2), (NOT p3)]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-13
Entered a terminal (fully accepting) state of product in 468 steps with 0 reset in 3 ms.
FORMULA HirschbergSinclair-PT-40-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-40-LTLFireability-13 finished in 69409 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((G((p0&&F(p1))) U p2)))))'
Support contains 4 out of 957 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 957/957 places, 911/911 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 952 transition count 906
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 952 transition count 906
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 950 transition count 904
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 950 transition count 904
Applied a total of 14 rules in 166 ms. Remains 950 /957 variables (removed 7) and now considering 904/911 (removed 7) transitions.
// Phase 1: matrix 904 rows 950 cols
[2024-05-25 07:41:02] [INFO ] Computed 46 invariants in 8 ms
[2024-05-25 07:41:03] [INFO ] Implicit Places using invariants in 1236 ms returned []
[2024-05-25 07:41:03] [INFO ] Invariant cache hit.
[2024-05-25 07:41:11] [INFO ] Implicit Places using invariants and state equation in 7877 ms returned []
Implicit Place search using SMT with State Equation took 9118 ms to find 0 implicit places.
Running 864 sub problems to find dead transitions.
[2024-05-25 07:41:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/910 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 910/1854 variables, and 6 constraints, problems are : Problem set: 0 solved, 864 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 6/46 constraints, State Equation: 0/950 constraints, PredecessorRefiner: 864/864 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 864 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/910 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/910 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 2 (OVERLAPS) 40/950 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 864 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 950/1854 variables, and 46 constraints, problems are : Problem set: 0 solved, 864 unsolved in 30041 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/950 constraints, PredecessorRefiner: 0/864 constraints, Known Traps: 0/0 constraints]
After SMT, in 60543ms problems are : Problem set: 0 solved, 864 unsolved
Search for dead transitions found 0 dead transitions in 60558ms
Starting structural reductions in LTL mode, iteration 1 : 950/957 places, 904/911 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69847 ms. Remains : 950/957 places, 904/911 transitions.
Stuttering acceptance computed with spot in 381 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-14
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-40-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-40-LTLFireability-14 finished in 70276 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(F(p1))))))'
Support contains 4 out of 957 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 957/957 places, 911/911 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 951 transition count 905
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 951 transition count 905
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 948 transition count 902
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 948 transition count 902
Applied a total of 18 rules in 160 ms. Remains 948 /957 variables (removed 9) and now considering 902/911 (removed 9) transitions.
// Phase 1: matrix 902 rows 948 cols
[2024-05-25 07:42:12] [INFO ] Computed 46 invariants in 9 ms
[2024-05-25 07:42:13] [INFO ] Implicit Places using invariants in 1243 ms returned []
[2024-05-25 07:42:13] [INFO ] Invariant cache hit.
[2024-05-25 07:42:20] [INFO ] Implicit Places using invariants and state equation in 6833 ms returned []
Implicit Place search using SMT with State Equation took 8079 ms to find 0 implicit places.
Running 862 sub problems to find dead transitions.
[2024-05-25 07:42:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 908/1850 variables, and 6 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 6/46 constraints, State Equation: 0/948 constraints, PredecessorRefiner: 862/862 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 862 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/908 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 2 (OVERLAPS) 40/948 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 698)
(s2 697)
(s3 1)
(s4 0)
(s5 698)
(s6 0)
(s7 1)
(s8 0)
(s9 698)
(s10 0)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 1)
(s16 0)
(s17 694)
(s18 692)
(s19 1)
(s20 0)
(s21 1)
(s22 0)
(s23 1)
(s24 0)
(s25 1)
(s26 0)
(s27 689)
(s28 687)
(s29 1)
(s30 0)
(s31 688)
(s32 0)
(s33 1)
(s34 0)
(s35 1)
(s36 0)
(s37 1)
(s38 0)
(s39 685)
(s40 0)
(s41 1)
(s42 0)
(s43 1)
(s44 0)
(s45 1)
(s46 679)
(s47 1)
(s48 0)
(s49 678)
(s50 0)
(s51 1)
(s52 0)
(s53 1)
(s54 674)
(s55 1)
(s56 0)
(s57 1)
(s58 0)
(s59 673)
(s60 0)
(s61 672)
(s62 0)
(s63 1)
(s64 669)
(s65 1)
(s66 0)
(s67 1)
(s68 0)
(s69 1)
(s70 0)
(s71 1)
(s72 0)
(s73 1)
(s74 0)
(s75 1)
(s76 659)
(s77 1)
(s78 0)
(s79 699)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 698)
(s98 1)
(s99 697)
(s100 1)
(s101 1)
(s102 1)
(s103 696)
(s104 1)
(s105 1)
(s106 1)
(s107 695)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 691)
(s124 1)
(s125 692)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 690)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 687)
(s148 1)
(s149 688)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 686)
(s158 1)
(s159 684)
(s160 1)
(s161 1)
(s162 1)
(s163 683)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 682)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 677)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 676)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 674)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 671)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 669)
(s218 1)
(s219 1)
(s220 1)
(s221 668)
(s222 1)
(s223 664)
(s224 1)
(s225 666)
(s226 1)
(s227 662)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 948/1850 variables, and 46 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/948 constraints, PredecessorRefiner: 0/862 constraints, Known Traps: 0/0 constraints]
After SMT, in 60352ms problems are : Problem set: 0 solved, 862 unsolved
Search for dead transitions found 0 dead transitions in 60361ms
Starting structural reductions in LTL mode, iteration 1 : 948/957 places, 902/911 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68602 ms. Remains : 948/957 places, 902/911 transitions.
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLFireability-15
Product exploration explored 100000 steps with 33333 reset in 808 ms.
Product exploration explored 100000 steps with 33333 reset in 519 ms.
Computed a total of 948 stabilizing places and 902 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 948 transition count 902
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 14 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-40-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-40-LTLFireability-15 finished in 70554 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(F(p1) U (!p1 U G(p0))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(p1)||X(G(p2)))))'
[2024-05-25 07:43:23] [INFO ] Flatten gal took : 46 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1894219686522292309
[2024-05-25 07:43:23] [INFO ] Computing symmetric may disable matrix : 911 transitions.
[2024-05-25 07:43:23] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 07:43:23] [INFO ] Computing symmetric may enable matrix : 911 transitions.
[2024-05-25 07:43:23] [INFO ] Applying decomposition
[2024-05-25 07:43:23] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 07:43:23] [INFO ] Flatten gal took : 47 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4127029720387008136.txt' '-o' '/tmp/graph4127029720387008136.bin' '-w' '/tmp/graph4127029720387008136.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4127029720387008136.bin' '-l' '-1' '-v' '-w' '/tmp/graph4127029720387008136.weights' '-q' '0' '-e' '0.001'
[2024-05-25 07:43:23] [INFO ] Decomposing Gal with order
[2024-05-25 07:43:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 07:43:23] [INFO ] Computing Do-Not-Accords matrix : 911 transitions.
[2024-05-25 07:43:23] [INFO ] Computation of Completed DNA matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 07:43:23] [INFO ] Built C files in 313ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1894219686522292309
Running compilation step : cd /tmp/ltsmin1894219686522292309;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-25 07:43:23] [INFO ] Removed a total of 87 redundant transitions.
[2024-05-25 07:43:23] [INFO ] Flatten gal took : 131 ms
[2024-05-25 07:43:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2024-05-25 07:43:23] [INFO ] Time to serialize gal into /tmp/LTLFireability9020740420544766810.gal : 19 ms
[2024-05-25 07:43:23] [INFO ] Time to serialize properties into /tmp/LTLFireability1293872816253217121.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/LTLFireability9020740420544766810.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1293872816253217121.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((F(("((i2.u4.newmsg5>=1)&&(i2.u58.reply_40_4_to_left_6>=1))")||((F("((i2.u6.newmsg7>=1)&&(i3.u102.elected_40_to_left_8>=1))"))U((!("...280
Formula 0 simplified : G(!"((i2.u4.newmsg5>=1)&&(i2.u58.reply_40_4_to_left_6>=1))" & (G!"((i2.u6.newmsg7>=1)&&(i3.u102.elected_40_to_left_8>=1))" R ("((i2....270
Compilation finished in 5268 ms.
Running link step : cd /tmp/ltsmin1894219686522292309;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin1894219686522292309;'/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)||(<>((LTLAPp1==true)) U (!(LTLAPp1==true) U []((LTLAPp0==true))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t7, t10, t12, t13, t17, t19, t23, t24, t25, t28, t30, t33, t37, t38, t39, t49...1487
Computing Next relation with stutter on 2.19975e+29 deadlock states
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin1894219686522292309;'/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)||(<>((LTLAPp1==true)) U (!(LTLAPp1==true) U []((LTLAPp0==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1894219686522292309;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((LTLAPp2==true)||<>((LTLAPp3==true))||X([]((LTLAPp4==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-25 08:12:27] [INFO ] Flatten gal took : 91 ms
[2024-05-25 08:12:27] [INFO ] Time to serialize gal into /tmp/LTLFireability12989435091232107088.gal : 7 ms
[2024-05-25 08:12:27] [INFO ] Time to serialize properties into /tmp/LTLFireability3885039327529902891.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/LTLFireability12989435091232107088.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3885039327529902891.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...298
Read 2 LTL properties
Checking formula 0 : !((F(("((newmsg5>=1)&&(reply_40_4_to_left_6>=1))")||((F("((newmsg7>=1)&&(elected_40_to_left_8>=1))"))U((!("((newmsg7>=1)&&(elected_40_...226
Formula 0 simplified : G(!"((newmsg5>=1)&&(reply_40_4_to_left_6>=1))" & (G!"((newmsg7>=1)&&(elected_40_to_left_8>=1))" R ("((newmsg7>=1)&&(elected_40_to_le...216
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin1894219686522292309;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((LTLAPp2==true)||<>((LTLAPp3==true))||X([]((LTLAPp4==true)))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin1894219686522292309;'/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)||(<>((LTLAPp1==true)) U (!(LTLAPp1==true) U []((LTLAPp0==true))))))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is HirschbergSinclair-PT-40, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r202-smll-171649587500116"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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