Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654447000387.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBNT-COL-S05J60, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654447000387
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.7K Apr 12 09:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 09:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 09:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 12 09:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 10:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 12 10:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 10:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 12 10:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 94K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-00
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-01
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-02
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-03
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-04
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-05
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-06
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-07
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-08
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-09
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-10
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-11
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-12
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-13
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-14
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716925293925

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S05J60
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202405141337
[2024-05-28 19:41:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 19:41:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 19:41:35] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 19:41:35] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 19:41:35] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 612 ms
[2024-05-28 19:41:36] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 969 PT places and 2152.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 19:41:36] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 6 ms.
[2024-05-28 19:41:36] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 4 formulas.
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40004 steps (3186 resets) in 1356 ms. (29 steps per ms) remains 15/24 properties
BEST_FIRST walk for 4003 steps (103 resets) in 49 ms. (80 steps per ms) remains 5/15 properties
BEST_FIRST walk for 4004 steps (99 resets) in 33 ms. (117 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4001 steps (94 resets) in 27 ms. (142 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4001 steps (95 resets) in 18 ms. (210 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4003 steps (102 resets) in 23 ms. (166 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4004 steps (123 resets) in 16 ms. (235 steps per ms) remains 5/5 properties
// Phase 1: matrix 38 rows 48 cols
[2024-05-28 19:41:36] [INFO ] Computed 13 invariants in 4 ms
[2024-05-28 19:41:36] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
At refinement iteration 1 (OVERLAPS) 14/22 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 21/43 variables, 4/9 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/44 variables, 1/10 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
At refinement iteration 7 (OVERLAPS) 3/47 variables, 3/13 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/47 variables, 0/13 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 38/85 variables, 47/60 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/85 variables, 1/61 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/85 variables, 0/61 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/86 variables, 1/62 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/86 variables, 0/62 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/86 variables, 0/62 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 62 constraints, problems are : Problem set: 4 solved, 1 unsolved in 208 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 48/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/18 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/19 variables, 1/4 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 20/39 variables, 2/6 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/42 variables, 2/8 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 4 solved, 1 unsolved
Problem AtomicPropp20 is UNSAT
After SMT solving in domain Int declared 47/86 variables, and 13 constraints, problems are : Problem set: 5 solved, 0 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/48 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 310ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 5 atomic propositions for a total of 12 simplifications.
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 19:41:37] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-05-28 19:41:37] [INFO ] Flatten gal took : 22 ms
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 19:41:37] [INFO ] Flatten gal took : 4 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-28 19:41:37] [INFO ] Unfolded HLPN to a Petri net with 969 places and 2030 transitions 12704 arcs in 51 ms.
[2024-05-28 19:41:37] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Deduced a syphon composed of 60 places in 8 ms
Reduce places removed 60 places and 60 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Support contains 577 out of 909 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1315/1315 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 904 transition count 1315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 903 transition count 1314
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 903 transition count 1314
Applied a total of 7 rules in 62 ms. Remains 903 /909 variables (removed 6) and now considering 1314/1315 (removed 1) transitions.
Running 1308 sub problems to find dead transitions.
[2024-05-28 19:41:37] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
// Phase 1: matrix 1310 rows 903 cols
[2024-05-28 19:41:37] [INFO ] Computed 137 invariants in 85 ms
[2024-05-28 19:41:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1308 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 897/2213 variables, and 131 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 20070 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1308/1308 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1308 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD556 is UNSAT
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 78 solved, 1230 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 3)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 1)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 1)
(s101 0)
(s102 1)
(s103 1)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 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 1)
(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 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 1)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 4)
(s385 1)
(s386 1)
(s387 0)
(s388 0)
(s389 9)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 1)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 1)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 1)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 1)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 0)
(s690 0)
(s691 0)
(s692 0)
(s693 0)
(s694 0)
(s695 0)
(s696 0)
(s697 0)
(s698 0)
(s699 0)
(s700 4)
(s701 0)
(s702 0)
(s703 0)
(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 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/2213 variables, and 136 constraints, problems are : Problem set: 78 solved, 1230 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1308 constraints, Known Traps: 0/0 constraints]
After SMT, in 43464ms problems are : Problem set: 78 solved, 1230 unsolved
Search for dead transitions found 78 dead transitions in 43489ms
Found 78 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 78 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 78 transitions.
[2024-05-28 19:42:20] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
// Phase 1: matrix 1232 rows 903 cols
[2024-05-28 19:42:20] [INFO ] Computed 137 invariants in 58 ms
[2024-05-28 19:42:21] [INFO ] Implicit Places using invariants in 385 ms returned []
[2024-05-28 19:42:21] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 19:42:21] [INFO ] Invariant cache hit.
[2024-05-28 19:42:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:42:22] [INFO ] Implicit Places using invariants and state equation in 1783 ms returned []
Implicit Place search using SMT with State Equation took 2177 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 903/909 places, 1236/1315 transitions.
Applied a total of 0 rules in 30 ms. Remains 903 /903 variables (removed 0) and now considering 1236/1236 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45788 ms. Remains : 903/909 places, 1236/1315 transitions.
Support contains 577 out of 903 places after structural reductions.
[2024-05-28 19:42:23] [INFO ] Flatten gal took : 155 ms
[2024-05-28 19:42:23] [INFO ] Flatten gal took : 114 ms
[2024-05-28 19:42:23] [INFO ] Input system was already deterministic with 1236 transitions.
RANDOM walk for 40000 steps (2774 resets) in 1399 ms. (28 steps per ms) remains 1/16 properties
BEST_FIRST walk for 40004 steps (499 resets) in 228 ms. (174 steps per ms) remains 1/1 properties
[2024-05-28 19:42:24] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 19:42:24] [INFO ] Invariant cache hit.
[2024-05-28 19:42:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 793/854 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/854 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/888 variables, 6/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/890 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/890 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp5 is UNSAT
After SMT solving in domain Real declared 901/2135 variables, and 136 constraints, problems are : Problem set: 1 solved, 0 unsolved in 270 ms.
Refiners :[Positive P Invariants (semi-flows): 130/131 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 308ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 4 out of 903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 903/903 places, 1236/1236 transitions.
Applied a total of 0 rules in 17 ms. Remains 903 /903 variables (removed 0) and now considering 1236/1236 (removed 0) transitions.
Running 1230 sub problems to find dead transitions.
[2024-05-28 19:42:24] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 19:42:24] [INFO ] Invariant cache hit.
[2024-05-28 19:42:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2135 variables, and 131 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/2135 variables, and 136 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 0/0 constraints]
After SMT, in 42674ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 42688ms
[2024-05-28 19:43:07] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 19:43:07] [INFO ] Invariant cache hit.
[2024-05-28 19:43:08] [INFO ] Implicit Places using invariants in 732 ms returned []
[2024-05-28 19:43:08] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 19:43:08] [INFO ] Invariant cache hit.
[2024-05-28 19:43:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:43:12] [INFO ] Implicit Places using invariants and state equation in 3900 ms returned []
Implicit Place search using SMT with State Equation took 4635 ms to find 0 implicit places.
Running 1230 sub problems to find dead transitions.
[2024-05-28 19:43:12] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 19:43:12] [INFO ] Invariant cache hit.
[2024-05-28 19:43:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 (/ 2.0 3.0))
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 (/ 1.0 3.0))
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 (/ 1.0 3.0))
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 (/ 2.0 3.0))
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 1.0)
(s354 1.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 4.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 1.0)
(s389 9.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 1.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 1.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 1.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 1.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 1.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 1.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 4.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 1.0)
(s705 1.0)
(s706 0.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 0.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 0.0)
(s743 0.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 0.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 0.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 timeout
0.0)
(s856 0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/2135 variables, and 136 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-05-28 19:44:09] [INFO ] Deduced a trap composed of 304 places in 455 ms of which 40 ms to minimize.
[2024-05-28 19:44:09] [INFO ] Deduced a trap composed of 12 places in 412 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/2135 variables, and 138 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 2/2 constraints]
After SMT, in 62773ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 62798ms
Finished structural reductions in LTL mode , in 1 iterations and 110150 ms. Remains : 903/903 places, 1236/1236 transitions.
Stuttering acceptance computed with spot in 226 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J60-LTLCardinality-01
Product exploration explored 100000 steps with 33333 reset in 575 ms.
Product exploration explored 100000 steps with 33333 reset in 426 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 39 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-COL-S05J60-LTLCardinality-01 finished in 111493 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U p1) U (F((p2 U p3))&&p2)))'
Support contains 125 out of 903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 903/903 places, 1236/1236 transitions.
Applied a total of 0 rules in 25 ms. Remains 903 /903 variables (removed 0) and now considering 1236/1236 (removed 0) transitions.
Running 1230 sub problems to find dead transitions.
[2024-05-28 19:44:16] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 19:44:16] [INFO ] Invariant cache hit.
[2024-05-28 19:44:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 2.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 (/ 2.0 3.0))
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 (/ 2.0 3.0))
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 (/ 2.0 3.0))
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2135 variables, and 131 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/2135 variables, and 136 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 0/0 constraints]
After SMT, in 43009ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 43023ms
[2024-05-28 19:44:59] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 19:44:59] [INFO ] Invariant cache hit.
[2024-05-28 19:45:00] [INFO ] Implicit Places using invariants in 890 ms returned []
[2024-05-28 19:45:00] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 19:45:00] [INFO ] Invariant cache hit.
[2024-05-28 19:45:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:45:03] [INFO ] Implicit Places using invariants and state equation in 3696 ms returned []
Implicit Place search using SMT with State Equation took 4588 ms to find 0 implicit places.
Running 1230 sub problems to find dead transitions.
[2024-05-28 19:45:03] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 19:45:03] [INFO ] Invariant cache hit.
[2024-05-28 19:45:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/2135 variables, and 136 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-05-28 19:46:01] [INFO ] Deduced a trap composed of 304 places in 339 ms of which 5 ms to minimize.
[2024-05-28 19:46:01] [INFO ] Deduced a trap composed of 12 places in 427 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/2135 variables, and 138 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 2/2 constraints]
After SMT, in 62786ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 62813ms
Finished structural reductions in LTL mode , in 1 iterations and 110457 ms. Remains : 903/903 places, 1236/1236 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p1)), (NOT p3), true]
Running random walk in product with property : PolyORBNT-COL-S05J60-LTLCardinality-04
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J60-LTLCardinality-04 finished in 110688 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 903/903 places, 1236/1236 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 903 transition count 1171
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 130 place count 838 transition count 1171
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 130 place count 838 transition count 1106
Deduced a syphon composed of 65 places in 7 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 260 place count 773 transition count 1106
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 266 place count 770 transition count 1103
Applied a total of 266 rules in 174 ms. Remains 770 /903 variables (removed 133) and now considering 1103/1236 (removed 133) transitions.
Running 1097 sub problems to find dead transitions.
[2024-05-28 19:46:07] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
// Phase 1: matrix 1099 rows 770 cols
[2024-05-28 19:46:07] [INFO ] Computed 137 invariants in 36 ms
[2024-05-28 19:46:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:46:20] [INFO ] Deduced a trap composed of 239 places in 292 ms of which 5 ms to minimize.
[2024-05-28 19:46:21] [INFO ] Deduced a trap composed of 233 places in 280 ms of which 5 ms to minimize.
[2024-05-28 19:46:21] [INFO ] Deduced a trap composed of 227 places in 294 ms of which 4 ms to minimize.
[2024-05-28 19:46:22] [INFO ] Deduced a trap composed of 236 places in 338 ms of which 5 ms to minimize.
[2024-05-28 19:46:22] [INFO ] Deduced a trap composed of 196 places in 264 ms of which 4 ms to minimize.
[2024-05-28 19:46:22] [INFO ] Deduced a trap composed of 196 places in 312 ms of which 5 ms to minimize.
[2024-05-28 19:46:22] [INFO ] Deduced a trap composed of 196 places in 249 ms of which 5 ms to minimize.
[2024-05-28 19:46:23] [INFO ] Deduced a trap composed of 196 places in 243 ms of which 4 ms to minimize.
[2024-05-28 19:46:23] [INFO ] Deduced a trap composed of 196 places in 230 ms of which 3 ms to minimize.
[2024-05-28 19:46:23] [INFO ] Deduced a trap composed of 196 places in 217 ms of which 3 ms to minimize.
[2024-05-28 19:46:23] [INFO ] Deduced a trap composed of 196 places in 285 ms of which 4 ms to minimize.
[2024-05-28 19:46:24] [INFO ] Deduced a trap composed of 196 places in 325 ms of which 5 ms to minimize.
[2024-05-28 19:46:24] [INFO ] Deduced a trap composed of 196 places in 263 ms of which 3 ms to minimize.
[2024-05-28 19:46:24] [INFO ] Deduced a trap composed of 196 places in 257 ms of which 4 ms to minimize.
[2024-05-28 19:46:25] [INFO ] Deduced a trap composed of 196 places in 288 ms of which 4 ms to minimize.
[2024-05-28 19:46:25] [INFO ] Deduced a trap composed of 196 places in 270 ms of which 4 ms to minimize.
[2024-05-28 19:46:25] [INFO ] Deduced a trap composed of 196 places in 269 ms of which 3 ms to minimize.
[2024-05-28 19:46:26] [INFO ] Deduced a trap composed of 196 places in 282 ms of which 6 ms to minimize.
[2024-05-28 19:46:26] [INFO ] Deduced a trap composed of 196 places in 298 ms of which 5 ms to minimize.
[2024-05-28 19:46:26] [INFO ] Deduced a trap composed of 196 places in 268 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:46:27] [INFO ] Deduced a trap composed of 196 places in 297 ms of which 4 ms to minimize.
[2024-05-28 19:46:27] [INFO ] Deduced a trap composed of 196 places in 268 ms of which 4 ms to minimize.
[2024-05-28 19:46:28] [INFO ] Deduced a trap composed of 196 places in 295 ms of which 6 ms to minimize.
[2024-05-28 19:46:28] [INFO ] Deduced a trap composed of 196 places in 299 ms of which 5 ms to minimize.
[2024-05-28 19:46:29] [INFO ] Deduced a trap composed of 196 places in 300 ms of which 5 ms to minimize.
[2024-05-28 19:46:29] [INFO ] Deduced a trap composed of 196 places in 272 ms of which 5 ms to minimize.
[2024-05-28 19:46:29] [INFO ] Deduced a trap composed of 196 places in 316 ms of which 5 ms to minimize.
[2024-05-28 19:46:30] [INFO ] Deduced a trap composed of 196 places in 309 ms of which 5 ms to minimize.
SMT process timed out in 23004ms, After SMT, problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 23015ms
[2024-05-28 19:46:30] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:46:30] [INFO ] Invariant cache hit.
[2024-05-28 19:46:30] [INFO ] Implicit Places using invariants in 807 ms returned []
[2024-05-28 19:46:30] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:46:30] [INFO ] Invariant cache hit.
[2024-05-28 19:46:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:46:36] [INFO ] Implicit Places using invariants and state equation in 5845 ms returned []
Implicit Place search using SMT with State Equation took 6654 ms to find 0 implicit places.
[2024-05-28 19:46:36] [INFO ] Redundant transitions in 69 ms returned []
Running 1097 sub problems to find dead transitions.
[2024-05-28 19:46:36] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:46:36] [INFO ] Invariant cache hit.
[2024-05-28 19:46:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:46:50] [INFO ] Deduced a trap composed of 245 places in 325 ms of which 5 ms to minimize.
[2024-05-28 19:46:50] [INFO ] Deduced a trap composed of 196 places in 278 ms of which 5 ms to minimize.
[2024-05-28 19:46:50] [INFO ] Deduced a trap composed of 233 places in 275 ms of which 6 ms to minimize.
[2024-05-28 19:46:51] [INFO ] Deduced a trap composed of 196 places in 291 ms of which 8 ms to minimize.
[2024-05-28 19:46:51] [INFO ] Deduced a trap composed of 230 places in 314 ms of which 5 ms to minimize.
[2024-05-28 19:46:52] [INFO ] Deduced a trap composed of 196 places in 334 ms of which 7 ms to minimize.
[2024-05-28 19:46:52] [INFO ] Deduced a trap composed of 196 places in 324 ms of which 5 ms to minimize.
[2024-05-28 19:46:52] [INFO ] Deduced a trap composed of 245 places in 315 ms of which 5 ms to minimize.
[2024-05-28 19:46:53] [INFO ] Deduced a trap composed of 196 places in 230 ms of which 4 ms to minimize.
[2024-05-28 19:46:53] [INFO ] Deduced a trap composed of 196 places in 325 ms of which 5 ms to minimize.
[2024-05-28 19:46:53] [INFO ] Deduced a trap composed of 196 places in 299 ms of which 5 ms to minimize.
[2024-05-28 19:46:54] [INFO ] Deduced a trap composed of 196 places in 283 ms of which 4 ms to minimize.
[2024-05-28 19:46:54] [INFO ] Deduced a trap composed of 196 places in 249 ms of which 4 ms to minimize.
[2024-05-28 19:46:54] [INFO ] Deduced a trap composed of 254 places in 255 ms of which 4 ms to minimize.
[2024-05-28 19:46:54] [INFO ] Deduced a trap composed of 196 places in 247 ms of which 3 ms to minimize.
[2024-05-28 19:46:55] [INFO ] Deduced a trap composed of 196 places in 248 ms of which 4 ms to minimize.
[2024-05-28 19:46:55] [INFO ] Deduced a trap composed of 242 places in 290 ms of which 4 ms to minimize.
[2024-05-28 19:46:55] [INFO ] Deduced a trap composed of 196 places in 303 ms of which 4 ms to minimize.
[2024-05-28 19:46:56] [INFO ] Deduced a trap composed of 196 places in 322 ms of which 5 ms to minimize.
[2024-05-28 19:46:56] [INFO ] Deduced a trap composed of 242 places in 261 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:46:57] [INFO ] Deduced a trap composed of 254 places in 212 ms of which 4 ms to minimize.
[2024-05-28 19:46:57] [INFO ] Deduced a trap composed of 245 places in 251 ms of which 4 ms to minimize.
[2024-05-28 19:46:57] [INFO ] Deduced a trap composed of 248 places in 273 ms of which 4 ms to minimize.
[2024-05-28 19:46:58] [INFO ] Deduced a trap composed of 196 places in 332 ms of which 6 ms to minimize.
[2024-05-28 19:46:58] [INFO ] Deduced a trap composed of 251 places in 281 ms of which 5 ms to minimize.
[2024-05-28 19:46:58] [INFO ] Deduced a trap composed of 196 places in 282 ms of which 4 ms to minimize.
[2024-05-28 19:46:59] [INFO ] Deduced a trap composed of 233 places in 255 ms of which 4 ms to minimize.
[2024-05-28 19:46:59] [INFO ] Deduced a trap composed of 236 places in 254 ms of which 4 ms to minimize.
[2024-05-28 19:46:59] [INFO ] Deduced a trap composed of 196 places in 269 ms of which 4 ms to minimize.
[2024-05-28 19:47:00] [INFO ] Deduced a trap composed of 230 places in 290 ms of which 4 ms to minimize.
[2024-05-28 19:47:00] [INFO ] Deduced a trap composed of 260 places in 251 ms of which 4 ms to minimize.
[2024-05-28 19:47:00] [INFO ] Deduced a trap composed of 236 places in 309 ms of which 6 ms to minimize.
[2024-05-28 19:47:01] [INFO ] Deduced a trap composed of 196 places in 314 ms of which 4 ms to minimize.
[2024-05-28 19:47:01] [INFO ] Deduced a trap composed of 196 places in 292 ms of which 4 ms to minimize.
[2024-05-28 19:47:01] [INFO ] Deduced a trap composed of 196 places in 325 ms of which 5 ms to minimize.
[2024-05-28 19:47:01] [INFO ] Deduced a trap composed of 196 places in 277 ms of which 4 ms to minimize.
[2024-05-28 19:47:02] [INFO ] Deduced a trap composed of 196 places in 319 ms of which 5 ms to minimize.
[2024-05-28 19:47:02] [INFO ] Deduced a trap composed of 196 places in 331 ms of which 5 ms to minimize.
[2024-05-28 19:47:02] [INFO ] Deduced a trap composed of 196 places in 299 ms of which 5 ms to minimize.
[2024-05-28 19:47:03] [INFO ] Deduced a trap composed of 196 places in 317 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 172 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:47:14] [INFO ] Deduced a trap composed of 200 places in 284 ms of which 5 ms to minimize.
[2024-05-28 19:47:15] [INFO ] Deduced a trap composed of 196 places in 343 ms of which 6 ms to minimize.
[2024-05-28 19:47:15] [INFO ] Deduced a trap composed of 196 places in 266 ms of which 4 ms to minimize.
[2024-05-28 19:47:15] [INFO ] Deduced a trap composed of 196 places in 259 ms of which 4 ms to minimize.
[2024-05-28 19:47:16] [INFO ] Deduced a trap composed of 200 places in 315 ms of which 4 ms to minimize.
[2024-05-28 19:47:16] [INFO ] Deduced a trap composed of 196 places in 254 ms of which 4 ms to minimize.
[2024-05-28 19:47:16] [INFO ] Deduced a trap composed of 200 places in 251 ms of which 4 ms to minimize.
[2024-05-28 19:47:16] [INFO ] Deduced a trap composed of 196 places in 246 ms of which 4 ms to minimize.
[2024-05-28 19:47:17] [INFO ] Deduced a trap composed of 200 places in 250 ms of which 4 ms to minimize.
[2024-05-28 19:47:17] [INFO ] Deduced a trap composed of 196 places in 250 ms of which 4 ms to minimize.
[2024-05-28 19:47:17] [INFO ] Deduced a trap composed of 196 places in 278 ms of which 5 ms to minimize.
[2024-05-28 19:47:17] [INFO ] Deduced a trap composed of 200 places in 277 ms of which 4 ms to minimize.
[2024-05-28 19:47:18] [INFO ] Deduced a trap composed of 196 places in 276 ms of which 4 ms to minimize.
[2024-05-28 19:47:18] [INFO ] Deduced a trap composed of 196 places in 272 ms of which 4 ms to minimize.
[2024-05-28 19:47:18] [INFO ] Deduced a trap composed of 196 places in 274 ms of which 5 ms to minimize.
[2024-05-28 19:47:19] [INFO ] Deduced a trap composed of 196 places in 271 ms of which 5 ms to minimize.
[2024-05-28 19:47:19] [INFO ] Deduced a trap composed of 200 places in 302 ms of which 4 ms to minimize.
[2024-05-28 19:47:19] [INFO ] Deduced a trap composed of 196 places in 272 ms of which 4 ms to minimize.
[2024-05-28 19:47:20] [INFO ] Deduced a trap composed of 200 places in 302 ms of which 4 ms to minimize.
[2024-05-28 19:47:20] [INFO ] Deduced a trap composed of 196 places in 267 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:47:22] [INFO ] Deduced a trap composed of 249 places in 320 ms of which 5 ms to minimize.
[2024-05-28 19:47:23] [INFO ] Deduced a trap composed of 248 places in 285 ms of which 5 ms to minimize.
[2024-05-28 19:47:23] [INFO ] Deduced a trap composed of 237 places in 286 ms of which 5 ms to minimize.
[2024-05-28 19:47:23] [INFO ] Deduced a trap composed of 230 places in 287 ms of which 5 ms to minimize.
[2024-05-28 19:47:24] [INFO ] Deduced a trap composed of 248 places in 280 ms of which 4 ms to minimize.
[2024-05-28 19:47:24] [INFO ] Deduced a trap composed of 255 places in 346 ms of which 5 ms to minimize.
[2024-05-28 19:47:24] [INFO ] Deduced a trap composed of 237 places in 324 ms of which 5 ms to minimize.
[2024-05-28 19:47:25] [INFO ] Deduced a trap composed of 248 places in 266 ms of which 4 ms to minimize.
[2024-05-28 19:47:25] [INFO ] Deduced a trap composed of 242 places in 278 ms of which 5 ms to minimize.
[2024-05-28 19:47:25] [INFO ] Deduced a trap composed of 236 places in 261 ms of which 5 ms to minimize.
[2024-05-28 19:47:26] [INFO ] Deduced a trap composed of 254 places in 323 ms of which 5 ms to minimize.
[2024-05-28 19:47:26] [INFO ] Deduced a trap composed of 245 places in 329 ms of which 5 ms to minimize.
[2024-05-28 19:47:27] [INFO ] Deduced a trap composed of 196 places in 315 ms of which 4 ms to minimize.
[2024-05-28 19:47:27] [INFO ] Deduced a trap composed of 196 places in 300 ms of which 4 ms to minimize.
[2024-05-28 19:47:27] [INFO ] Deduced a trap composed of 216 places in 292 ms of which 4 ms to minimize.
[2024-05-28 19:47:28] [INFO ] Deduced a trap composed of 196 places in 285 ms of which 4 ms to minimize.
[2024-05-28 19:47:28] [INFO ] Deduced a trap composed of 196 places in 312 ms of which 4 ms to minimize.
[2024-05-28 19:47:28] [INFO ] Deduced a trap composed of 196 places in 240 ms of which 4 ms to minimize.
[2024-05-28 19:47:29] [INFO ] Deduced a trap composed of 261 places in 273 ms of which 4 ms to minimize.
[2024-05-28 19:47:29] [INFO ] Deduced a trap composed of 196 places in 263 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1869 variables, and 212 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1097 constraints, Known Traps: 80/80 constraints]
After SMT, in 62821ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 62835ms
Starting structural reductions in SI_LTL mode, iteration 1 : 770/903 places, 1103/1236 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 92766 ms. Remains : 770/903 places, 1103/1236 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J60-LTLCardinality-06
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J60-LTLCardinality-06 finished in 92882 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 8 out of 903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 903/903 places, 1236/1236 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 903 transition count 1172
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 839 transition count 1172
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 128 place count 839 transition count 1107
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 258 place count 774 transition count 1107
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 262 place count 772 transition count 1105
Applied a total of 262 rules in 94 ms. Remains 772 /903 variables (removed 131) and now considering 1105/1236 (removed 131) transitions.
Running 1099 sub problems to find dead transitions.
[2024-05-28 19:47:39] [INFO ] Flow matrix only has 1101 transitions (discarded 4 similar events)
// Phase 1: matrix 1101 rows 772 cols
[2024-05-28 19:47:39] [INFO ] Computed 137 invariants in 22 ms
[2024-05-28 19:47:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 19:47:53] [INFO ] Deduced a trap composed of 198 places in 226 ms of which 4 ms to minimize.
[2024-05-28 19:47:53] [INFO ] Deduced a trap composed of 198 places in 274 ms of which 4 ms to minimize.
[2024-05-28 19:47:53] [INFO ] Deduced a trap composed of 198 places in 265 ms of which 4 ms to minimize.
[2024-05-28 19:47:54] [INFO ] Deduced a trap composed of 198 places in 253 ms of which 4 ms to minimize.
[2024-05-28 19:47:54] [INFO ] Deduced a trap composed of 238 places in 267 ms of which 4 ms to minimize.
[2024-05-28 19:47:54] [INFO ] Deduced a trap composed of 238 places in 254 ms of which 5 ms to minimize.
[2024-05-28 19:47:55] [INFO ] Deduced a trap composed of 198 places in 260 ms of which 4 ms to minimize.
[2024-05-28 19:47:55] [INFO ] Deduced a trap composed of 250 places in 263 ms of which 5 ms to minimize.
[2024-05-28 19:47:55] [INFO ] Deduced a trap composed of 198 places in 234 ms of which 4 ms to minimize.
[2024-05-28 19:47:56] [INFO ] Deduced a trap composed of 198 places in 303 ms of which 5 ms to minimize.
[2024-05-28 19:47:56] [INFO ] Deduced a trap composed of 238 places in 276 ms of which 5 ms to minimize.
[2024-05-28 19:47:56] [INFO ] Deduced a trap composed of 232 places in 257 ms of which 4 ms to minimize.
[2024-05-28 19:47:57] [INFO ] Deduced a trap composed of 238 places in 275 ms of which 4 ms to minimize.
[2024-05-28 19:47:57] [INFO ] Deduced a trap composed of 198 places in 280 ms of which 4 ms to minimize.
[2024-05-28 19:47:57] [INFO ] Deduced a trap composed of 198 places in 263 ms of which 5 ms to minimize.
[2024-05-28 19:47:58] [INFO ] Deduced a trap composed of 250 places in 258 ms of which 4 ms to minimize.
[2024-05-28 19:47:58] [INFO ] Deduced a trap composed of 253 places in 256 ms of which 5 ms to minimize.
[2024-05-28 19:47:58] [INFO ] Deduced a trap composed of 198 places in 261 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 767/1873 variables, and 150 constraints, problems are : Problem set: 0 solved, 1099 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1099/1099 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1099 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 18/150 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 19:48:04] [INFO ] Deduced a trap composed of 198 places in 264 ms of which 4 ms to minimize.
[2024-05-28 19:48:04] [INFO ] Deduced a trap composed of 198 places in 301 ms of which 5 ms to minimize.
[2024-05-28 19:48:04] [INFO ] Deduced a trap composed of 198 places in 307 ms of which 6 ms to minimize.
[2024-05-28 19:48:05] [INFO ] Deduced a trap composed of 198 places in 302 ms of which 5 ms to minimize.
[2024-05-28 19:48:05] [INFO ] Deduced a trap composed of 198 places in 231 ms of which 4 ms to minimize.
[2024-05-28 19:48:05] [INFO ] Deduced a trap composed of 198 places in 218 ms of which 4 ms to minimize.
[2024-05-28 19:48:06] [INFO ] Deduced a trap composed of 198 places in 253 ms of which 4 ms to minimize.
[2024-05-28 19:48:06] [INFO ] Deduced a trap composed of 229 places in 228 ms of which 4 ms to minimize.
[2024-05-28 19:48:06] [INFO ] Deduced a trap composed of 198 places in 287 ms of which 4 ms to minimize.
[2024-05-28 19:48:06] [INFO ] Deduced a trap composed of 198 places in 283 ms of which 5 ms to minimize.
[2024-05-28 19:48:07] [INFO ] Deduced a trap composed of 247 places in 273 ms of which 4 ms to minimize.
[2024-05-28 19:48:07] [INFO ] Deduced a trap composed of 241 places in 264 ms of which 4 ms to minimize.
[2024-05-28 19:48:07] [INFO ] Deduced a trap composed of 198 places in 259 ms of which 6 ms to minimize.
[2024-05-28 19:48:08] [INFO ] Deduced a trap composed of 198 places in 263 ms of which 4 ms to minimize.
[2024-05-28 19:48:08] [INFO ] Deduced a trap composed of 198 places in 251 ms of which 3 ms to minimize.
[2024-05-28 19:48:08] [INFO ] Deduced a trap composed of 198 places in 255 ms of which 4 ms to minimize.
[2024-05-28 19:48:08] [INFO ] Deduced a trap composed of 198 places in 288 ms of which 5 ms to minimize.
[2024-05-28 19:48:09] [INFO ] Deduced a trap composed of 198 places in 258 ms of which 4 ms to minimize.
[2024-05-28 19:48:09] [INFO ] Deduced a trap composed of 198 places in 301 ms of which 6 ms to minimize.
[2024-05-28 19:48:09] [INFO ] Deduced a trap composed of 198 places in 272 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/767 variables, 20/170 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 19:48:10] [INFO ] Deduced a trap composed of 198 places in 332 ms of which 5 ms to minimize.
[2024-05-28 19:48:11] [INFO ] Deduced a trap composed of 198 places in 297 ms of which 5 ms to minimize.
[2024-05-28 19:48:11] [INFO ] Deduced a trap composed of 198 places in 316 ms of which 5 ms to minimize.
[2024-05-28 19:48:11] [INFO ] Deduced a trap composed of 198 places in 244 ms of which 4 ms to minimize.
[2024-05-28 19:48:12] [INFO ] Deduced a trap composed of 198 places in 262 ms of which 4 ms to minimize.
[2024-05-28 19:48:12] [INFO ] Deduced a trap composed of 198 places in 224 ms of which 3 ms to minimize.
[2024-05-28 19:48:12] [INFO ] Deduced a trap composed of 198 places in 227 ms of which 4 ms to minimize.
[2024-05-28 19:48:12] [INFO ] Deduced a trap composed of 198 places in 333 ms of which 5 ms to minimize.
[2024-05-28 19:48:13] [INFO ] Deduced a trap composed of 198 places in 242 ms of which 4 ms to minimize.
[2024-05-28 19:48:13] [INFO ] Deduced a trap composed of 198 places in 324 ms of which 5 ms to minimize.
[2024-05-28 19:48:13] [INFO ] Deduced a trap composed of 198 places in 276 ms of which 4 ms to minimize.
[2024-05-28 19:48:14] [INFO ] Deduced a trap composed of 198 places in 253 ms of which 3 ms to minimize.
[2024-05-28 19:48:14] [INFO ] Deduced a trap composed of 198 places in 235 ms of which 4 ms to minimize.
[2024-05-28 19:48:14] [INFO ] Deduced a trap composed of 198 places in 246 ms of which 4 ms to minimize.
[2024-05-28 19:48:14] [INFO ] Deduced a trap composed of 198 places in 284 ms of which 4 ms to minimize.
[2024-05-28 19:48:15] [INFO ] Deduced a trap composed of 202 places in 327 ms of which 5 ms to minimize.
[2024-05-28 19:48:15] [INFO ] Deduced a trap composed of 198 places in 302 ms of which 5 ms to minimize.
[2024-05-28 19:48:16] [INFO ] Deduced a trap composed of 202 places in 288 ms of which 3 ms to minimize.
[2024-05-28 19:48:16] [INFO ] Deduced a trap composed of 198 places in 245 ms of which 3 ms to minimize.
[2024-05-28 19:48:16] [INFO ] Deduced a trap composed of 198 places in 306 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/767 variables, 20/190 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 19:48:17] [INFO ] Deduced a trap composed of 198 places in 330 ms of which 5 ms to minimize.
[2024-05-28 19:48:18] [INFO ] Deduced a trap composed of 202 places in 316 ms of which 6 ms to minimize.
[2024-05-28 19:48:18] [INFO ] Deduced a trap composed of 198 places in 320 ms of which 6 ms to minimize.
[2024-05-28 19:48:18] [INFO ] Deduced a trap composed of 202 places in 336 ms of which 5 ms to minimize.
[2024-05-28 19:48:19] [INFO ] Deduced a trap composed of 198 places in 289 ms of which 4 ms to minimize.
[2024-05-28 19:48:19] [INFO ] Deduced a trap composed of 198 places in 279 ms of which 4 ms to minimize.
[2024-05-28 19:48:19] [INFO ] Deduced a trap composed of 198 places in 317 ms of which 5 ms to minimize.
[2024-05-28 19:48:20] [INFO ] Deduced a trap composed of 199 places in 351 ms of which 5 ms to minimize.
[2024-05-28 19:48:20] [INFO ] Deduced a trap composed of 198 places in 281 ms of which 5 ms to minimize.
[2024-05-28 19:48:20] [INFO ] Deduced a trap composed of 198 places in 278 ms of which 5 ms to minimize.
[2024-05-28 19:48:21] [INFO ] Deduced a trap composed of 259 places in 325 ms of which 5 ms to minimize.
[2024-05-28 19:48:21] [INFO ] Deduced a trap composed of 229 places in 373 ms of which 4 ms to minimize.
[2024-05-28 19:48:22] [INFO ] Deduced a trap composed of 241 places in 369 ms of which 6 ms to minimize.
[2024-05-28 19:48:22] [INFO ] Deduced a trap composed of 198 places in 303 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 767/1873 variables, and 204 constraints, problems are : Problem set: 0 solved, 1099 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1099 constraints, Known Traps: 72/72 constraints]
After SMT, in 42661ms problems are : Problem set: 0 solved, 1099 unsolved
Search for dead transitions found 0 dead transitions in 42672ms
[2024-05-28 19:48:22] [INFO ] Flow matrix only has 1101 transitions (discarded 4 similar events)
[2024-05-28 19:48:22] [INFO ] Invariant cache hit.
[2024-05-28 19:48:23] [INFO ] Implicit Places using invariants in 766 ms returned []
[2024-05-28 19:48:23] [INFO ] Flow matrix only has 1101 transitions (discarded 4 similar events)
[2024-05-28 19:48:23] [INFO ] Invariant cache hit.
[2024-05-28 19:48:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:48:26] [INFO ] Implicit Places using invariants and state equation in 2900 ms returned []
Implicit Place search using SMT with State Equation took 3670 ms to find 0 implicit places.
[2024-05-28 19:48:26] [INFO ] Redundant transitions in 12 ms returned []
Running 1099 sub problems to find dead transitions.
[2024-05-28 19:48:26] [INFO ] Flow matrix only has 1101 transitions (discarded 4 similar events)
[2024-05-28 19:48:26] [INFO ] Invariant cache hit.
[2024-05-28 19:48:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 19:48:38] [INFO ] Deduced a trap composed of 198 places in 315 ms of which 5 ms to minimize.
[2024-05-28 19:48:39] [INFO ] Deduced a trap composed of 198 places in 326 ms of which 6 ms to minimize.
[2024-05-28 19:48:39] [INFO ] Deduced a trap composed of 198 places in 296 ms of which 5 ms to minimize.
[2024-05-28 19:48:39] [INFO ] Deduced a trap composed of 198 places in 314 ms of which 5 ms to minimize.
[2024-05-28 19:48:40] [INFO ] Deduced a trap composed of 198 places in 322 ms of which 5 ms to minimize.
[2024-05-28 19:48:40] [INFO ] Deduced a trap composed of 198 places in 333 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 6/138 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 19:48:51] [INFO ] Deduced a trap composed of 198 places in 268 ms of which 4 ms to minimize.
[2024-05-28 19:48:51] [INFO ] Deduced a trap composed of 198 places in 353 ms of which 5 ms to minimize.
[2024-05-28 19:48:51] [INFO ] Deduced a trap composed of 198 places in 342 ms of which 5 ms to minimize.
[2024-05-28 19:48:52] [INFO ] Deduced a trap composed of 198 places in 325 ms of which 5 ms to minimize.
[2024-05-28 19:48:52] [INFO ] Deduced a trap composed of 198 places in 412 ms of which 16 ms to minimize.
[2024-05-28 19:48:53] [INFO ] Deduced a trap composed of 198 places in 389 ms of which 6 ms to minimize.
[2024-05-28 19:48:53] [INFO ] Deduced a trap composed of 198 places in 314 ms of which 5 ms to minimize.
[2024-05-28 19:48:53] [INFO ] Deduced a trap composed of 198 places in 283 ms of which 4 ms to minimize.
[2024-05-28 19:48:54] [INFO ] Deduced a trap composed of 198 places in 273 ms of which 5 ms to minimize.
[2024-05-28 19:48:54] [INFO ] Deduced a trap composed of 198 places in 339 ms of which 5 ms to minimize.
[2024-05-28 19:48:54] [INFO ] Deduced a trap composed of 198 places in 252 ms of which 5 ms to minimize.
[2024-05-28 19:48:55] [INFO ] Deduced a trap composed of 198 places in 302 ms of which 4 ms to minimize.
[2024-05-28 19:48:55] [INFO ] Deduced a trap composed of 198 places in 301 ms of which 4 ms to minimize.
[2024-05-28 19:48:55] [INFO ] Deduced a trap composed of 198 places in 280 ms of which 4 ms to minimize.
[2024-05-28 19:48:56] [INFO ] Deduced a trap composed of 198 places in 236 ms of which 5 ms to minimize.
[2024-05-28 19:48:56] [INFO ] Deduced a trap composed of 244 places in 236 ms of which 4 ms to minimize.
[2024-05-28 19:48:56] [INFO ] Deduced a trap composed of 244 places in 237 ms of which 4 ms to minimize.
[2024-05-28 19:48:56] [INFO ] Deduced a trap composed of 198 places in 267 ms of which 4 ms to minimize.
[2024-05-28 19:48:57] [INFO ] Deduced a trap composed of 198 places in 230 ms of which 4 ms to minimize.
[2024-05-28 19:48:57] [INFO ] Deduced a trap composed of 198 places in 240 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/767 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 767/1873 variables, and 158 constraints, problems are : Problem set: 0 solved, 1099 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1099/1099 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1099 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 26/158 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 19:48:59] [INFO ] Deduced a trap composed of 198 places in 248 ms of which 7 ms to minimize.
[2024-05-28 19:49:00] [INFO ] Deduced a trap composed of 198 places in 237 ms of which 4 ms to minimize.
[2024-05-28 19:49:00] [INFO ] Deduced a trap composed of 202 places in 323 ms of which 5 ms to minimize.
[2024-05-28 19:49:00] [INFO ] Deduced a trap composed of 198 places in 296 ms of which 4 ms to minimize.
[2024-05-28 19:49:01] [INFO ] Deduced a trap composed of 202 places in 317 ms of which 5 ms to minimize.
[2024-05-28 19:49:01] [INFO ] Deduced a trap composed of 199 places in 249 ms of which 4 ms to minimize.
[2024-05-28 19:49:01] [INFO ] Deduced a trap composed of 198 places in 249 ms of which 4 ms to minimize.
[2024-05-28 19:49:02] [INFO ] Deduced a trap composed of 198 places in 293 ms of which 4 ms to minimize.
[2024-05-28 19:49:02] [INFO ] Deduced a trap composed of 198 places in 267 ms of which 4 ms to minimize.
[2024-05-28 19:49:02] [INFO ] Deduced a trap composed of 202 places in 281 ms of which 4 ms to minimize.
[2024-05-28 19:49:02] [INFO ] Deduced a trap composed of 198 places in 264 ms of which 4 ms to minimize.
[2024-05-28 19:49:03] [INFO ] Deduced a trap composed of 202 places in 328 ms of which 5 ms to minimize.
[2024-05-28 19:49:03] [INFO ] Deduced a trap composed of 202 places in 323 ms of which 5 ms to minimize.
[2024-05-28 19:49:03] [INFO ] Deduced a trap composed of 199 places in 324 ms of which 5 ms to minimize.
[2024-05-28 19:49:04] [INFO ] Deduced a trap composed of 198 places in 310 ms of which 5 ms to minimize.
[2024-05-28 19:49:04] [INFO ] Deduced a trap composed of 198 places in 344 ms of which 5 ms to minimize.
[2024-05-28 19:49:05] [INFO ] Deduced a trap composed of 202 places in 347 ms of which 6 ms to minimize.
[2024-05-28 19:49:05] [INFO ] Deduced a trap composed of 198 places in 338 ms of which 5 ms to minimize.
[2024-05-28 19:49:05] [INFO ] Deduced a trap composed of 198 places in 293 ms of which 5 ms to minimize.
[2024-05-28 19:49:06] [INFO ] Deduced a trap composed of 198 places in 267 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/767 variables, 20/178 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 19:49:07] [INFO ] Deduced a trap composed of 198 places in 379 ms of which 6 ms to minimize.
[2024-05-28 19:49:07] [INFO ] Deduced a trap composed of 198 places in 331 ms of which 6 ms to minimize.
[2024-05-28 19:49:07] [INFO ] Deduced a trap composed of 198 places in 360 ms of which 6 ms to minimize.
[2024-05-28 19:49:08] [INFO ] Deduced a trap composed of 198 places in 329 ms of which 5 ms to minimize.
[2024-05-28 19:49:08] [INFO ] Deduced a trap composed of 198 places in 318 ms of which 4 ms to minimize.
[2024-05-28 19:49:08] [INFO ] Deduced a trap composed of 198 places in 268 ms of which 4 ms to minimize.
[2024-05-28 19:49:09] [INFO ] Deduced a trap composed of 202 places in 255 ms of which 4 ms to minimize.
[2024-05-28 19:49:09] [INFO ] Deduced a trap composed of 198 places in 249 ms of which 4 ms to minimize.
[2024-05-28 19:49:09] [INFO ] Deduced a trap composed of 202 places in 270 ms of which 4 ms to minimize.
[2024-05-28 19:49:10] [INFO ] Deduced a trap composed of 202 places in 286 ms of which 4 ms to minimize.
[2024-05-28 19:49:10] [INFO ] Deduced a trap composed of 202 places in 251 ms of which 5 ms to minimize.
[2024-05-28 19:49:10] [INFO ] Deduced a trap composed of 198 places in 372 ms of which 6 ms to minimize.
[2024-05-28 19:49:11] [INFO ] Deduced a trap composed of 198 places in 340 ms of which 4 ms to minimize.
[2024-05-28 19:49:11] [INFO ] Deduced a trap composed of 202 places in 291 ms of which 5 ms to minimize.
[2024-05-28 19:49:11] [INFO ] Deduced a trap composed of 198 places in 290 ms of which 4 ms to minimize.
[2024-05-28 19:49:12] [INFO ] Deduced a trap composed of 198 places in 262 ms of which 4 ms to minimize.
[2024-05-28 19:49:12] [INFO ] Deduced a trap composed of 198 places in 294 ms of which 4 ms to minimize.
[2024-05-28 19:49:12] [INFO ] Deduced a trap composed of 198 places in 258 ms of which 4 ms to minimize.
[2024-05-28 19:49:13] [INFO ] Deduced a trap composed of 198 places in 298 ms of which 5 ms to minimize.
[2024-05-28 19:49:13] [INFO ] Deduced a trap composed of 198 places in 269 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/767 variables, 20/198 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 19:49:14] [INFO ] Deduced a trap composed of 226 places in 330 ms of which 6 ms to minimize.
[2024-05-28 19:49:15] [INFO ] Deduced a trap composed of 232 places in 310 ms of which 5 ms to minimize.
[2024-05-28 19:49:15] [INFO ] Deduced a trap composed of 198 places in 300 ms of which 5 ms to minimize.
[2024-05-28 19:49:15] [INFO ] Deduced a trap composed of 198 places in 304 ms of which 5 ms to minimize.
[2024-05-28 19:49:16] [INFO ] Deduced a trap composed of 198 places in 315 ms of which 5 ms to minimize.
[2024-05-28 19:49:16] [INFO ] Deduced a trap composed of 198 places in 302 ms of which 5 ms to minimize.
[2024-05-28 19:49:16] [INFO ] Deduced a trap composed of 198 places in 324 ms of which 5 ms to minimize.
[2024-05-28 19:49:17] [INFO ] Deduced a trap composed of 198 places in 263 ms of which 4 ms to minimize.
[2024-05-28 19:49:17] [INFO ] Deduced a trap composed of 198 places in 249 ms of which 4 ms to minimize.
[2024-05-28 19:49:17] [INFO ] Deduced a trap composed of 198 places in 321 ms of which 5 ms to minimize.
[2024-05-28 19:49:18] [INFO ] Deduced a trap composed of 198 places in 310 ms of which 6 ms to minimize.
[2024-05-28 19:49:18] [INFO ] Deduced a trap composed of 198 places in 302 ms of which 5 ms to minimize.
[2024-05-28 19:49:18] [INFO ] Deduced a trap composed of 235 places in 317 ms of which 5 ms to minimize.
[2024-05-28 19:49:19] [INFO ] Deduced a trap composed of 198 places in 308 ms of which 6 ms to minimize.
[2024-05-28 19:49:19] [INFO ] Deduced a trap composed of 198 places in 293 ms of which 5 ms to minimize.
[2024-05-28 19:49:19] [INFO ] Deduced a trap composed of 198 places in 309 ms of which 6 ms to minimize.
[2024-05-28 19:49:20] [INFO ] Deduced a trap composed of 198 places in 294 ms of which 4 ms to minimize.
[2024-05-28 19:49:20] [INFO ] Deduced a trap composed of 198 places in 298 ms of which 4 ms to minimize.
[2024-05-28 19:49:20] [INFO ] Deduced a trap composed of 198 places in 282 ms of which 4 ms to minimize.
[2024-05-28 19:49:21] [INFO ] Deduced a trap composed of 198 places in 273 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/767 variables, 20/218 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 19:49:22] [INFO ] Deduced a trap composed of 202 places in 321 ms of which 4 ms to minimize.
[2024-05-28 19:49:23] [INFO ] Deduced a trap composed of 198 places in 297 ms of which 4 ms to minimize.
[2024-05-28 19:49:23] [INFO ] Deduced a trap composed of 198 places in 246 ms of which 4 ms to minimize.
[2024-05-28 19:49:23] [INFO ] Deduced a trap composed of 202 places in 349 ms of which 5 ms to minimize.
[2024-05-28 19:49:24] [INFO ] Deduced a trap composed of 202 places in 333 ms of which 5 ms to minimize.
[2024-05-28 19:49:24] [INFO ] Deduced a trap composed of 198 places in 351 ms of which 5 ms to minimize.
[2024-05-28 19:49:24] [INFO ] Deduced a trap composed of 198 places in 336 ms of which 5 ms to minimize.
[2024-05-28 19:49:25] [INFO ] Deduced a trap composed of 202 places in 293 ms of which 4 ms to minimize.
[2024-05-28 19:49:25] [INFO ] Deduced a trap composed of 198 places in 314 ms of which 4 ms to minimize.
[2024-05-28 19:49:26] [INFO ] Deduced a trap composed of 198 places in 321 ms of which 4 ms to minimize.
[2024-05-28 19:49:26] [INFO ] Deduced a trap composed of 248 places in 298 ms of which 4 ms to minimize.
[2024-05-28 19:49:26] [INFO ] Deduced a trap composed of 198 places in 292 ms of which 4 ms to minimize.
[2024-05-28 19:49:27] [INFO ] Deduced a trap composed of 202 places in 316 ms of which 3 ms to minimize.
[2024-05-28 19:49:27] [INFO ] Deduced a trap composed of 198 places in 250 ms of which 3 ms to minimize.
[2024-05-28 19:49:27] [INFO ] Deduced a trap composed of 202 places in 287 ms of which 10 ms to minimize.
[2024-05-28 19:49:27] [INFO ] Deduced a trap composed of 198 places in 259 ms of which 4 ms to minimize.
[2024-05-28 19:49:28] [INFO ] Deduced a trap composed of 202 places in 309 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 767/1873 variables, and 235 constraints, problems are : Problem set: 0 solved, 1099 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1099 constraints, Known Traps: 103/103 constraints]
After SMT, in 62309ms problems are : Problem set: 0 solved, 1099 unsolved
Search for dead transitions found 0 dead transitions in 62321ms
Starting structural reductions in SI_LTL mode, iteration 1 : 772/903 places, 1105/1236 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 108790 ms. Remains : 772/903 places, 1105/1236 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-COL-S05J60-LTLCardinality-07
Product exploration explored 100000 steps with 9122 reset in 966 ms.
Product exploration explored 100000 steps with 9196 reset in 974 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 157 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1999 resets) in 464 ms. (86 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (1428 resets) in 246 ms. (161 steps per ms) remains 1/1 properties
[2024-05-28 19:49:31] [INFO ] Flow matrix only has 1101 transitions (discarded 4 similar events)
[2024-05-28 19:49:31] [INFO ] Invariant cache hit.
[2024-05-28 19:49:31] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 261/269 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 122/391 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 366/757 variables, 61/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/757 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/758 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/758 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/770 variables, 7/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/770 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/772 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/772 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1101/1873 variables, 772/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1873 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1873 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1873 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1873/1873 variables, and 910 constraints, problems are : Problem set: 0 solved, 1 unsolved in 705 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 772/772 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 261/269 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 19:49:31] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 122/391 variables, 61/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 366/757 variables, 61/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/757 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/758 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/758 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 770/1873 variables, and 136 constraints, problems are : Problem set: 1 solved, 0 unsolved in 349 ms.
Refiners :[Positive P Invariants (semi-flows): 128/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1078ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 278 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Support contains 6 out of 772 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 : 772/772 places, 1105/1105 transitions.
Applied a total of 0 rules in 43 ms. Remains 772 /772 variables (removed 0) and now considering 1105/1105 (removed 0) transitions.
Running 1099 sub problems to find dead transitions.
[2024-05-28 19:49:32] [INFO ] Flow matrix only has 1101 transitions (discarded 4 similar events)
[2024-05-28 19:49:32] [INFO ] Invariant cache hit.
[2024-05-28 19:49:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 19:49:46] [INFO ] Deduced a trap composed of 198 places in 260 ms of which 4 ms to minimize.
[2024-05-28 19:49:46] [INFO ] Deduced a trap composed of 198 places in 333 ms of which 5 ms to minimize.
[2024-05-28 19:49:47] [INFO ] Deduced a trap composed of 198 places in 291 ms of which 5 ms to minimize.
[2024-05-28 19:49:47] [INFO ] Deduced a trap composed of 198 places in 251 ms of which 3 ms to minimize.
[2024-05-28 19:49:47] [INFO ] Deduced a trap composed of 198 places in 301 ms of which 5 ms to minimize.
[2024-05-28 19:49:48] [INFO ] Deduced a trap composed of 198 places in 331 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 767/1873 variables, and 138 constraints, problems are : Problem set: 0 solved, 1099 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1099/1099 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1099 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 6/138 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 19:49:56] [INFO ] Deduced a trap composed of 198 places in 324 ms of which 5 ms to minimize.
[2024-05-28 19:49:57] [INFO ] Deduced a trap composed of 198 places in 301 ms of which 5 ms to minimize.
[2024-05-28 19:49:57] [INFO ] Deduced a trap composed of 198 places in 315 ms of which 4 ms to minimize.
[2024-05-28 19:49:57] [INFO ] Deduced a trap composed of 198 places in 260 ms of which 4 ms to minimize.
[2024-05-28 19:49:58] [INFO ] Deduced a trap composed of 198 places in 266 ms of which 5 ms to minimize.
[2024-05-28 19:49:58] [INFO ] Deduced a trap composed of 198 places in 354 ms of which 5 ms to minimize.
[2024-05-28 19:49:59] [INFO ] Deduced a trap composed of 198 places in 310 ms of which 5 ms to minimize.
[2024-05-28 19:49:59] [INFO ] Deduced a trap composed of 198 places in 226 ms of which 4 ms to minimize.
[2024-05-28 19:49:59] [INFO ] Deduced a trap composed of 198 places in 327 ms of which 5 ms to minimize.
[2024-05-28 19:50:00] [INFO ] Deduced a trap composed of 198 places in 305 ms of which 6 ms to minimize.
[2024-05-28 19:50:00] [INFO ] Deduced a trap composed of 198 places in 235 ms of which 4 ms to minimize.
[2024-05-28 19:50:00] [INFO ] Deduced a trap composed of 198 places in 328 ms of which 5 ms to minimize.
[2024-05-28 19:50:01] [INFO ] Deduced a trap composed of 198 places in 320 ms of which 5 ms to minimize.
[2024-05-28 19:50:01] [INFO ] Deduced a trap composed of 198 places in 331 ms of which 5 ms to minimize.
[2024-05-28 19:50:01] [INFO ] Deduced a trap composed of 198 places in 319 ms of which 5 ms to minimize.
[2024-05-28 19:50:02] [INFO ] Deduced a trap composed of 198 places in 306 ms of which 5 ms to minimize.
[2024-05-28 19:50:02] [INFO ] Deduced a trap composed of 198 places in 301 ms of which 5 ms to minimize.
[2024-05-28 19:50:02] [INFO ] Deduced a trap composed of 198 places in 316 ms of which 5 ms to minimize.
[2024-05-28 19:50:03] [INFO ] Deduced a trap composed of 198 places in 295 ms of which 8 ms to minimize.
[2024-05-28 19:50:03] [INFO ] Deduced a trap composed of 198 places in 278 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/767 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 19:50:04] [INFO ] Deduced a trap composed of 247 places in 359 ms of which 5 ms to minimize.
[2024-05-28 19:50:04] [INFO ] Deduced a trap composed of 198 places in 302 ms of which 5 ms to minimize.
[2024-05-28 19:50:04] [INFO ] Deduced a trap composed of 198 places in 317 ms of which 5 ms to minimize.
[2024-05-28 19:50:05] [INFO ] Deduced a trap composed of 198 places in 318 ms of which 5 ms to minimize.
[2024-05-28 19:50:05] [INFO ] Deduced a trap composed of 198 places in 307 ms of which 5 ms to minimize.
[2024-05-28 19:50:06] [INFO ] Deduced a trap composed of 198 places in 309 ms of which 5 ms to minimize.
[2024-05-28 19:50:06] [INFO ] Deduced a trap composed of 198 places in 303 ms of which 5 ms to minimize.
[2024-05-28 19:50:06] [INFO ] Deduced a trap composed of 198 places in 305 ms of which 5 ms to minimize.
[2024-05-28 19:50:07] [INFO ] Deduced a trap composed of 198 places in 313 ms of which 5 ms to minimize.
[2024-05-28 19:50:07] [INFO ] Deduced a trap composed of 198 places in 294 ms of which 5 ms to minimize.
[2024-05-28 19:50:08] [INFO ] Deduced a trap composed of 198 places in 315 ms of which 5 ms to minimize.
[2024-05-28 19:50:08] [INFO ] Deduced a trap composed of 198 places in 302 ms of which 5 ms to minimize.
[2024-05-28 19:50:08] [INFO ] Deduced a trap composed of 198 places in 293 ms of which 5 ms to minimize.
[2024-05-28 19:50:09] [INFO ] Deduced a trap composed of 198 places in 292 ms of which 4 ms to minimize.
[2024-05-28 19:50:09] [INFO ] Deduced a trap composed of 198 places in 306 ms of which 5 ms to minimize.
[2024-05-28 19:50:09] [INFO ] Deduced a trap composed of 198 places in 252 ms of which 3 ms to minimize.
[2024-05-28 19:50:09] [INFO ] Deduced a trap composed of 198 places in 260 ms of which 4 ms to minimize.
[2024-05-28 19:50:10] [INFO ] Deduced a trap composed of 198 places in 259 ms of which 4 ms to minimize.
[2024-05-28 19:50:10] [INFO ] Deduced a trap composed of 198 places in 268 ms of which 4 ms to minimize.
[2024-05-28 19:50:10] [INFO ] Deduced a trap composed of 198 places in 262 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/767 variables, 20/178 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 19:50:11] [INFO ] Deduced a trap composed of 198 places in 326 ms of which 5 ms to minimize.
[2024-05-28 19:50:12] [INFO ] Deduced a trap composed of 198 places in 323 ms of which 5 ms to minimize.
[2024-05-28 19:50:12] [INFO ] Deduced a trap composed of 198 places in 303 ms of which 5 ms to minimize.
[2024-05-28 19:50:12] [INFO ] Deduced a trap composed of 198 places in 322 ms of which 5 ms to minimize.
[2024-05-28 19:50:13] [INFO ] Deduced a trap composed of 198 places in 293 ms of which 5 ms to minimize.
[2024-05-28 19:50:13] [INFO ] Deduced a trap composed of 198 places in 279 ms of which 4 ms to minimize.
[2024-05-28 19:50:13] [INFO ] Deduced a trap composed of 198 places in 255 ms of which 4 ms to minimize.
[2024-05-28 19:50:14] [INFO ] Deduced a trap composed of 198 places in 299 ms of which 5 ms to minimize.
[2024-05-28 19:50:14] [INFO ] Deduced a trap composed of 198 places in 257 ms of which 4 ms to minimize.
[2024-05-28 19:50:14] [INFO ] Deduced a trap composed of 198 places in 259 ms of which 4 ms to minimize.
[2024-05-28 19:50:15] [INFO ] Deduced a trap composed of 198 places in 319 ms of which 5 ms to minimize.
SMT process timed out in 42510ms, After SMT, problems are : Problem set: 0 solved, 1099 unsolved
Search for dead transitions found 0 dead transitions in 42521ms
[2024-05-28 19:50:15] [INFO ] Flow matrix only has 1101 transitions (discarded 4 similar events)
[2024-05-28 19:50:15] [INFO ] Invariant cache hit.
[2024-05-28 19:50:15] [INFO ] Implicit Places using invariants in 659 ms returned []
[2024-05-28 19:50:15] [INFO ] Flow matrix only has 1101 transitions (discarded 4 similar events)
[2024-05-28 19:50:15] [INFO ] Invariant cache hit.
[2024-05-28 19:50:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:50:18] [INFO ] Implicit Places using invariants and state equation in 3086 ms returned []
Implicit Place search using SMT with State Equation took 3748 ms to find 0 implicit places.
[2024-05-28 19:50:18] [INFO ] Redundant transitions in 25 ms returned []
Running 1099 sub problems to find dead transitions.
[2024-05-28 19:50:18] [INFO ] Flow matrix only has 1101 transitions (discarded 4 similar events)
[2024-05-28 19:50:18] [INFO ] Invariant cache hit.
[2024-05-28 19:50:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 19:50:32] [INFO ] Deduced a trap composed of 198 places in 218 ms of which 4 ms to minimize.
[2024-05-28 19:50:33] [INFO ] Deduced a trap composed of 198 places in 320 ms of which 5 ms to minimize.
[2024-05-28 19:50:33] [INFO ] Deduced a trap composed of 198 places in 311 ms of which 5 ms to minimize.
[2024-05-28 19:50:33] [INFO ] Deduced a trap composed of 198 places in 310 ms of which 5 ms to minimize.
[2024-05-28 19:50:34] [INFO ] Deduced a trap composed of 198 places in 294 ms of which 5 ms to minimize.
[2024-05-28 19:50:34] [INFO ] Deduced a trap composed of 198 places in 310 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 6/138 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 19:50:45] [INFO ] Deduced a trap composed of 198 places in 302 ms of which 5 ms to minimize.
[2024-05-28 19:50:46] [INFO ] Deduced a trap composed of 198 places in 353 ms of which 6 ms to minimize.
[2024-05-28 19:50:46] [INFO ] Deduced a trap composed of 198 places in 350 ms of which 5 ms to minimize.
[2024-05-28 19:50:47] [INFO ] Deduced a trap composed of 198 places in 324 ms of which 5 ms to minimize.
[2024-05-28 19:50:47] [INFO ] Deduced a trap composed of 198 places in 310 ms of which 5 ms to minimize.
[2024-05-28 19:50:47] [INFO ] Deduced a trap composed of 198 places in 300 ms of which 5 ms to minimize.
[2024-05-28 19:50:48] [INFO ] Deduced a trap composed of 198 places in 303 ms of which 5 ms to minimize.
[2024-05-28 19:50:48] [INFO ] Deduced a trap composed of 198 places in 290 ms of which 4 ms to minimize.
[2024-05-28 19:50:48] [INFO ] Deduced a trap composed of 198 places in 247 ms of which 3 ms to minimize.
[2024-05-28 19:50:48] [INFO ] Deduced a trap composed of 198 places in 235 ms of which 4 ms to minimize.
[2024-05-28 19:50:49] [INFO ] Deduced a trap composed of 198 places in 240 ms of which 3 ms to minimize.
[2024-05-28 19:50:49] [INFO ] Deduced a trap composed of 198 places in 240 ms of which 4 ms to minimize.
[2024-05-28 19:50:49] [INFO ] Deduced a trap composed of 198 places in 235 ms of which 3 ms to minimize.
[2024-05-28 19:50:49] [INFO ] Deduced a trap composed of 198 places in 312 ms of which 5 ms to minimize.
[2024-05-28 19:50:50] [INFO ] Deduced a trap composed of 198 places in 332 ms of which 5 ms to minimize.
[2024-05-28 19:50:50] [INFO ] Deduced a trap composed of 244 places in 322 ms of which 5 ms to minimize.
[2024-05-28 19:50:51] [INFO ] Deduced a trap composed of 244 places in 309 ms of which 5 ms to minimize.
[2024-05-28 19:50:51] [INFO ] Deduced a trap composed of 198 places in 313 ms of which 5 ms to minimize.
[2024-05-28 19:50:51] [INFO ] Deduced a trap composed of 198 places in 318 ms of which 5 ms to minimize.
SMT process timed out in 32764ms, After SMT, problems are : Problem set: 0 solved, 1099 unsolved
Search for dead transitions found 0 dead transitions in 32785ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 79141 ms. Remains : 772/772 places, 1105/1105 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 34 steps (1 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9125 reset in 807 ms.
Product exploration explored 100000 steps with 9123 reset in 621 ms.
Built C files in :
/tmp/ltsmin15112042258084275118
[2024-05-28 19:50:53] [INFO ] Computing symmetric may disable matrix : 1105 transitions.
[2024-05-28 19:50:53] [INFO ] Computation of Complete disable matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:50:53] [INFO ] Computing symmetric may enable matrix : 1105 transitions.
[2024-05-28 19:50:53] [INFO ] Computation of Complete enable matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:50:54] [INFO ] Computing Do-Not-Accords matrix : 1105 transitions.
[2024-05-28 19:50:54] [INFO ] Computation of Completed DNA matrix. took 68 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:50:54] [INFO ] Built C files in 391ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15112042258084275118
Running compilation step : cd /tmp/ltsmin15112042258084275118;'/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/ltsmin15112042258084275118;'/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/ltsmin15112042258084275118;'/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 6 out of 772 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 772/772 places, 1105/1105 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 771 transition count 1104
Applied a total of 2 rules in 116 ms. Remains 771 /772 variables (removed 1) and now considering 1104/1105 (removed 1) transitions.
Running 1098 sub problems to find dead transitions.
[2024-05-28 19:50:57] [INFO ] Flow matrix only has 1100 transitions (discarded 4 similar events)
// Phase 1: matrix 1100 rows 771 cols
[2024-05-28 19:50:57] [INFO ] Computed 137 invariants in 46 ms
[2024-05-28 19:50:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 19:51:09] [INFO ] Deduced a trap composed of 197 places in 246 ms of which 3 ms to minimize.
[2024-05-28 19:51:10] [INFO ] Deduced a trap composed of 197 places in 245 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 766/1871 variables, and 134 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1098/1098 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1098 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 19:51:21] [INFO ] Deduced a trap composed of 258 places in 298 ms of which 11 ms to minimize.
[2024-05-28 19:51:21] [INFO ] Deduced a trap composed of 261 places in 243 ms of which 4 ms to minimize.
[2024-05-28 19:51:21] [INFO ] Deduced a trap composed of 246 places in 297 ms of which 5 ms to minimize.
[2024-05-28 19:51:21] [INFO ] Deduced a trap composed of 231 places in 254 ms of which 3 ms to minimize.
[2024-05-28 19:51:22] [INFO ] Deduced a trap composed of 222 places in 270 ms of which 4 ms to minimize.
[2024-05-28 19:51:22] [INFO ] Deduced a trap composed of 249 places in 261 ms of which 4 ms to minimize.
[2024-05-28 19:51:22] [INFO ] Deduced a trap composed of 234 places in 241 ms of which 4 ms to minimize.
[2024-05-28 19:51:23] [INFO ] Deduced a trap composed of 249 places in 310 ms of which 5 ms to minimize.
[2024-05-28 19:51:23] [INFO ] Deduced a trap composed of 240 places in 290 ms of which 5 ms to minimize.
[2024-05-28 19:51:24] [INFO ] Deduced a trap composed of 234 places in 323 ms of which 6 ms to minimize.
[2024-05-28 19:51:24] [INFO ] Deduced a trap composed of 237 places in 322 ms of which 5 ms to minimize.
[2024-05-28 19:51:24] [INFO ] Deduced a trap composed of 240 places in 266 ms of which 4 ms to minimize.
[2024-05-28 19:51:25] [INFO ] Deduced a trap composed of 228 places in 230 ms of which 4 ms to minimize.
[2024-05-28 19:51:25] [INFO ] Deduced a trap composed of 258 places in 222 ms of which 3 ms to minimize.
[2024-05-28 19:51:25] [INFO ] Deduced a trap composed of 228 places in 222 ms of which 4 ms to minimize.
[2024-05-28 19:51:25] [INFO ] Deduced a trap composed of 264 places in 294 ms of which 5 ms to minimize.
[2024-05-28 19:51:26] [INFO ] Deduced a trap composed of 237 places in 274 ms of which 5 ms to minimize.
[2024-05-28 19:51:26] [INFO ] Deduced a trap composed of 246 places in 272 ms of which 5 ms to minimize.
[2024-05-28 19:51:26] [INFO ] Deduced a trap composed of 252 places in 293 ms of which 5 ms to minimize.
[2024-05-28 19:51:27] [INFO ] Deduced a trap composed of 258 places in 278 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/766 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 19:51:27] [INFO ] Deduced a trap composed of 201 places in 312 ms of which 5 ms to minimize.
[2024-05-28 19:51:28] [INFO ] Deduced a trap composed of 198 places in 315 ms of which 5 ms to minimize.
[2024-05-28 19:51:28] [INFO ] Deduced a trap composed of 202 places in 294 ms of which 4 ms to minimize.
[2024-05-28 19:51:28] [INFO ] Deduced a trap composed of 197 places in 263 ms of which 3 ms to minimize.
[2024-05-28 19:51:29] [INFO ] Deduced a trap composed of 201 places in 242 ms of which 4 ms to minimize.
[2024-05-28 19:51:29] [INFO ] Deduced a trap composed of 197 places in 329 ms of which 5 ms to minimize.
[2024-05-28 19:51:29] [INFO ] Deduced a trap composed of 201 places in 296 ms of which 5 ms to minimize.
[2024-05-28 19:51:30] [INFO ] Deduced a trap composed of 197 places in 347 ms of which 6 ms to minimize.
[2024-05-28 19:51:30] [INFO ] Deduced a trap composed of 197 places in 320 ms of which 4 ms to minimize.
[2024-05-28 19:51:30] [INFO ] Deduced a trap composed of 221 places in 223 ms of which 4 ms to minimize.
[2024-05-28 19:51:30] [INFO ] Deduced a trap composed of 197 places in 224 ms of which 4 ms to minimize.
[2024-05-28 19:51:31] [INFO ] Deduced a trap composed of 197 places in 223 ms of which 3 ms to minimize.
[2024-05-28 19:51:31] [INFO ] Deduced a trap composed of 201 places in 226 ms of which 4 ms to minimize.
[2024-05-28 19:51:31] [INFO ] Deduced a trap composed of 197 places in 222 ms of which 4 ms to minimize.
[2024-05-28 19:51:31] [INFO ] Deduced a trap composed of 197 places in 275 ms of which 4 ms to minimize.
[2024-05-28 19:51:32] [INFO ] Deduced a trap composed of 201 places in 304 ms of which 4 ms to minimize.
[2024-05-28 19:51:32] [INFO ] Deduced a trap composed of 197 places in 359 ms of which 5 ms to minimize.
[2024-05-28 19:51:32] [INFO ] Deduced a trap composed of 201 places in 312 ms of which 5 ms to minimize.
[2024-05-28 19:51:33] [INFO ] Deduced a trap composed of 197 places in 318 ms of which 5 ms to minimize.
[2024-05-28 19:51:33] [INFO ] Deduced a trap composed of 197 places in 225 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/766 variables, 20/174 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 19:51:35] [INFO ] Deduced a trap composed of 342 places in 302 ms of which 5 ms to minimize.
[2024-05-28 19:51:36] [INFO ] Deduced a trap composed of 14 places in 201 ms of which 2 ms to minimize.
[2024-05-28 19:51:38] [INFO ] Deduced a trap composed of 201 places in 306 ms of which 5 ms to minimize.
[2024-05-28 19:51:38] [INFO ] Deduced a trap composed of 197 places in 283 ms of which 4 ms to minimize.
[2024-05-28 19:51:39] [INFO ] Deduced a trap composed of 247 places in 242 ms of which 4 ms to minimize.
[2024-05-28 19:51:39] [INFO ] Deduced a trap composed of 197 places in 280 ms of which 4 ms to minimize.
[2024-05-28 19:51:39] [INFO ] Deduced a trap composed of 201 places in 273 ms of which 3 ms to minimize.
SMT process timed out in 42524ms, After SMT, problems are : Problem set: 0 solved, 1098 unsolved
Search for dead transitions found 0 dead transitions in 42538ms
[2024-05-28 19:51:39] [INFO ] Flow matrix only has 1100 transitions (discarded 4 similar events)
[2024-05-28 19:51:39] [INFO ] Invariant cache hit.
[2024-05-28 19:51:40] [INFO ] Implicit Places using invariants in 894 ms returned []
[2024-05-28 19:51:40] [INFO ] Flow matrix only has 1100 transitions (discarded 4 similar events)
[2024-05-28 19:51:40] [INFO ] Invariant cache hit.
[2024-05-28 19:51:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:51:44] [INFO ] Implicit Places using invariants and state equation in 4200 ms returned []
Implicit Place search using SMT with State Equation took 5103 ms to find 0 implicit places.
[2024-05-28 19:51:44] [INFO ] Redundant transitions in 24 ms returned []
Running 1098 sub problems to find dead transitions.
[2024-05-28 19:51:44] [INFO ] Flow matrix only has 1100 transitions (discarded 4 similar events)
[2024-05-28 19:51:44] [INFO ] Invariant cache hit.
[2024-05-28 19:51:45] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 19:51:58] [INFO ] Deduced a trap composed of 197 places in 275 ms of which 4 ms to minimize.
[2024-05-28 19:51:59] [INFO ] Deduced a trap composed of 197 places in 277 ms of which 6 ms to minimize.
[2024-05-28 19:51:59] [INFO ] Deduced a trap composed of 197 places in 265 ms of which 4 ms to minimize.
[2024-05-28 19:51:59] [INFO ] Deduced a trap composed of 234 places in 259 ms of which 4 ms to minimize.
[2024-05-28 19:52:00] [INFO ] Deduced a trap composed of 197 places in 257 ms of which 4 ms to minimize.
[2024-05-28 19:52:00] [INFO ] Deduced a trap composed of 197 places in 285 ms of which 4 ms to minimize.
[2024-05-28 19:52:00] [INFO ] Deduced a trap composed of 228 places in 284 ms of which 5 ms to minimize.
[2024-05-28 19:52:01] [INFO ] Deduced a trap composed of 197 places in 300 ms of which 5 ms to minimize.
[2024-05-28 19:52:01] [INFO ] Deduced a trap composed of 225 places in 283 ms of which 4 ms to minimize.
[2024-05-28 19:52:01] [INFO ] Deduced a trap composed of 197 places in 300 ms of which 5 ms to minimize.
[2024-05-28 19:52:02] [INFO ] Deduced a trap composed of 197 places in 295 ms of which 5 ms to minimize.
[2024-05-28 19:52:02] [INFO ] Deduced a trap composed of 197 places in 272 ms of which 7 ms to minimize.
[2024-05-28 19:52:02] [INFO ] Deduced a trap composed of 197 places in 248 ms of which 4 ms to minimize.
[2024-05-28 19:52:02] [INFO ] Deduced a trap composed of 231 places in 245 ms of which 4 ms to minimize.
[2024-05-28 19:52:03] [INFO ] Deduced a trap composed of 197 places in 239 ms of which 5 ms to minimize.
[2024-05-28 19:52:03] [INFO ] Deduced a trap composed of 197 places in 245 ms of which 4 ms to minimize.
[2024-05-28 19:52:03] [INFO ] Deduced a trap composed of 197 places in 249 ms of which 4 ms to minimize.
[2024-05-28 19:52:04] [INFO ] Deduced a trap composed of 197 places in 240 ms of which 4 ms to minimize.
[2024-05-28 19:52:04] [INFO ] Deduced a trap composed of 197 places in 247 ms of which 4 ms to minimize.
[2024-05-28 19:52:04] [INFO ] Deduced a trap composed of 197 places in 249 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 19:52:05] [INFO ] Deduced a trap composed of 197 places in 289 ms of which 4 ms to minimize.
[2024-05-28 19:52:05] [INFO ] Deduced a trap composed of 197 places in 248 ms of which 4 ms to minimize.
[2024-05-28 19:52:05] [INFO ] Deduced a trap composed of 197 places in 255 ms of which 4 ms to minimize.
[2024-05-28 19:52:06] [INFO ] Deduced a trap composed of 197 places in 262 ms of which 5 ms to minimize.
[2024-05-28 19:52:06] [INFO ] Deduced a trap composed of 197 places in 242 ms of which 4 ms to minimize.
[2024-05-28 19:52:06] [INFO ] Deduced a trap composed of 197 places in 251 ms of which 4 ms to minimize.
[2024-05-28 19:52:06] [INFO ] Deduced a trap composed of 197 places in 252 ms of which 4 ms to minimize.
[2024-05-28 19:52:07] [INFO ] Deduced a trap composed of 197 places in 251 ms of which 4 ms to minimize.
[2024-05-28 19:52:07] [INFO ] Deduced a trap composed of 197 places in 245 ms of which 4 ms to minimize.
[2024-05-28 19:52:07] [INFO ] Deduced a trap composed of 237 places in 269 ms of which 4 ms to minimize.
[2024-05-28 19:52:08] [INFO ] Deduced a trap composed of 234 places in 248 ms of which 4 ms to minimize.
[2024-05-28 19:52:08] [INFO ] Deduced a trap composed of 243 places in 250 ms of which 4 ms to minimize.
[2024-05-28 19:52:08] [INFO ] Deduced a trap composed of 243 places in 223 ms of which 3 ms to minimize.
[2024-05-28 19:52:09] [INFO ] Deduced a trap composed of 243 places in 268 ms of which 4 ms to minimize.
[2024-05-28 19:52:09] [INFO ] Deduced a trap composed of 231 places in 247 ms of which 3 ms to minimize.
[2024-05-28 19:52:09] [INFO ] Deduced a trap composed of 237 places in 244 ms of which 4 ms to minimize.
[2024-05-28 19:52:09] [INFO ] Deduced a trap composed of 197 places in 246 ms of which 4 ms to minimize.
[2024-05-28 19:52:10] [INFO ] Deduced a trap composed of 243 places in 234 ms of which 4 ms to minimize.
[2024-05-28 19:52:10] [INFO ] Deduced a trap composed of 261 places in 246 ms of which 4 ms to minimize.
[2024-05-28 19:52:10] [INFO ] Deduced a trap composed of 228 places in 247 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/766 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 766/1871 variables, and 172 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1098/1098 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1098 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 19:52:19] [INFO ] Deduced a trap composed of 197 places in 233 ms of which 3 ms to minimize.
[2024-05-28 19:52:19] [INFO ] Deduced a trap composed of 237 places in 267 ms of which 4 ms to minimize.
[2024-05-28 19:52:19] [INFO ] Deduced a trap composed of 197 places in 233 ms of which 4 ms to minimize.
[2024-05-28 19:52:20] [INFO ] Deduced a trap composed of 197 places in 237 ms of which 3 ms to minimize.
[2024-05-28 19:52:20] [INFO ] Deduced a trap composed of 197 places in 246 ms of which 4 ms to minimize.
[2024-05-28 19:52:20] [INFO ] Deduced a trap composed of 197 places in 237 ms of which 4 ms to minimize.
[2024-05-28 19:52:20] [INFO ] Deduced a trap composed of 197 places in 245 ms of which 4 ms to minimize.
[2024-05-28 19:52:21] [INFO ] Deduced a trap composed of 197 places in 294 ms of which 4 ms to minimize.
[2024-05-28 19:52:21] [INFO ] Deduced a trap composed of 197 places in 241 ms of which 4 ms to minimize.
[2024-05-28 19:52:21] [INFO ] Deduced a trap composed of 197 places in 220 ms of which 4 ms to minimize.
[2024-05-28 19:52:22] [INFO ] Deduced a trap composed of 197 places in 235 ms of which 4 ms to minimize.
[2024-05-28 19:52:22] [INFO ] Deduced a trap composed of 197 places in 236 ms of which 3 ms to minimize.
[2024-05-28 19:52:22] [INFO ] Deduced a trap composed of 197 places in 234 ms of which 3 ms to minimize.
[2024-05-28 19:52:22] [INFO ] Deduced a trap composed of 197 places in 238 ms of which 4 ms to minimize.
[2024-05-28 19:52:23] [INFO ] Deduced a trap composed of 197 places in 250 ms of which 4 ms to minimize.
[2024-05-28 19:52:23] [INFO ] Deduced a trap composed of 197 places in 295 ms of which 4 ms to minimize.
[2024-05-28 19:52:23] [INFO ] Deduced a trap composed of 197 places in 233 ms of which 4 ms to minimize.
[2024-05-28 19:52:24] [INFO ] Deduced a trap composed of 197 places in 232 ms of which 4 ms to minimize.
[2024-05-28 19:52:24] [INFO ] Deduced a trap composed of 197 places in 233 ms of which 3 ms to minimize.
[2024-05-28 19:52:24] [INFO ] Deduced a trap composed of 197 places in 232 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/766 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 19:52:25] [INFO ] Deduced a trap composed of 338 places in 233 ms of which 4 ms to minimize.
[2024-05-28 19:52:26] [INFO ] Deduced a trap composed of 341 places in 255 ms of which 4 ms to minimize.
[2024-05-28 19:52:26] [INFO ] Deduced a trap composed of 332 places in 253 ms of which 3 ms to minimize.
[2024-05-28 19:52:27] [INFO ] Deduced a trap composed of 338 places in 236 ms of which 4 ms to minimize.
[2024-05-28 19:52:27] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 2 ms to minimize.
[2024-05-28 19:52:30] [INFO ] Deduced a trap composed of 201 places in 334 ms of which 5 ms to minimize.
[2024-05-28 19:52:30] [INFO ] Deduced a trap composed of 197 places in 328 ms of which 5 ms to minimize.
[2024-05-28 19:52:30] [INFO ] Deduced a trap composed of 201 places in 304 ms of which 5 ms to minimize.
[2024-05-28 19:52:31] [INFO ] Deduced a trap composed of 197 places in 249 ms of which 4 ms to minimize.
[2024-05-28 19:52:31] [INFO ] Deduced a trap composed of 201 places in 236 ms of which 3 ms to minimize.
[2024-05-28 19:52:31] [INFO ] Deduced a trap composed of 197 places in 231 ms of which 4 ms to minimize.
[2024-05-28 19:52:31] [INFO ] Deduced a trap composed of 197 places in 244 ms of which 4 ms to minimize.
[2024-05-28 19:52:32] [INFO ] Deduced a trap composed of 197 places in 250 ms of which 3 ms to minimize.
[2024-05-28 19:52:32] [INFO ] Deduced a trap composed of 201 places in 239 ms of which 4 ms to minimize.
[2024-05-28 19:52:32] [INFO ] Deduced a trap composed of 197 places in 305 ms of which 5 ms to minimize.
[2024-05-28 19:52:33] [INFO ] Deduced a trap composed of 197 places in 245 ms of which 3 ms to minimize.
[2024-05-28 19:52:33] [INFO ] Deduced a trap composed of 201 places in 243 ms of which 4 ms to minimize.
[2024-05-28 19:52:33] [INFO ] Deduced a trap composed of 197 places in 224 ms of which 3 ms to minimize.
[2024-05-28 19:52:34] [INFO ] Deduced a trap composed of 201 places in 231 ms of which 3 ms to minimize.
[2024-05-28 19:52:34] [INFO ] Deduced a trap composed of 197 places in 219 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/766 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 19:52:35] [INFO ] Deduced a trap composed of 201 places in 336 ms of which 5 ms to minimize.
[2024-05-28 19:52:36] [INFO ] Deduced a trap composed of 197 places in 310 ms of which 5 ms to minimize.
[2024-05-28 19:52:36] [INFO ] Deduced a trap composed of 201 places in 269 ms of which 4 ms to minimize.
[2024-05-28 19:52:36] [INFO ] Deduced a trap composed of 197 places in 254 ms of which 4 ms to minimize.
[2024-05-28 19:52:37] [INFO ] Deduced a trap composed of 197 places in 266 ms of which 4 ms to minimize.
[2024-05-28 19:52:37] [INFO ] Deduced a trap composed of 197 places in 299 ms of which 5 ms to minimize.
[2024-05-28 19:52:37] [INFO ] Deduced a trap composed of 197 places in 308 ms of which 5 ms to minimize.
[2024-05-28 19:52:38] [INFO ] Deduced a trap composed of 197 places in 255 ms of which 4 ms to minimize.
[2024-05-28 19:52:38] [INFO ] Deduced a trap composed of 201 places in 237 ms of which 4 ms to minimize.
[2024-05-28 19:52:38] [INFO ] Deduced a trap composed of 197 places in 232 ms of which 4 ms to minimize.
[2024-05-28 19:52:38] [INFO ] Deduced a trap composed of 197 places in 287 ms of which 4 ms to minimize.
[2024-05-28 19:52:39] [INFO ] Deduced a trap composed of 197 places in 316 ms of which 3 ms to minimize.
[2024-05-28 19:52:39] [INFO ] Deduced a trap composed of 197 places in 336 ms of which 11 ms to minimize.
[2024-05-28 19:52:39] [INFO ] Deduced a trap composed of 197 places in 360 ms of which 5 ms to minimize.
[2024-05-28 19:52:40] [INFO ] Deduced a trap composed of 197 places in 305 ms of which 5 ms to minimize.
[2024-05-28 19:52:40] [INFO ] Deduced a trap composed of 201 places in 353 ms of which 5 ms to minimize.
[2024-05-28 19:52:41] [INFO ] Deduced a trap composed of 197 places in 356 ms of which 5 ms to minimize.
[2024-05-28 19:52:41] [INFO ] Deduced a trap composed of 197 places in 289 ms of which 4 ms to minimize.
[2024-05-28 19:52:41] [INFO ] Deduced a trap composed of 197 places in 275 ms of which 4 ms to minimize.
[2024-05-28 19:52:41] [INFO ] Deduced a trap composed of 197 places in 230 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/766 variables, 20/232 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 19:52:43] [INFO ] Deduced a trap composed of 197 places in 237 ms of which 4 ms to minimize.
[2024-05-28 19:52:43] [INFO ] Deduced a trap composed of 197 places in 245 ms of which 4 ms to minimize.
[2024-05-28 19:52:44] [INFO ] Deduced a trap composed of 197 places in 235 ms of which 4 ms to minimize.
[2024-05-28 19:52:44] [INFO ] Deduced a trap composed of 197 places in 231 ms of which 3 ms to minimize.
[2024-05-28 19:52:44] [INFO ] Deduced a trap composed of 197 places in 234 ms of which 4 ms to minimize.
[2024-05-28 19:52:44] [INFO ] Deduced a trap composed of 197 places in 238 ms of which 4 ms to minimize.
[2024-05-28 19:52:45] [INFO ] Deduced a trap composed of 197 places in 250 ms of which 4 ms to minimize.
[2024-05-28 19:52:45] [INFO ] Deduced a trap composed of 197 places in 236 ms of which 3 ms to minimize.
[2024-05-28 19:52:45] [INFO ] Deduced a trap composed of 197 places in 217 ms of which 4 ms to minimize.
[2024-05-28 19:52:45] [INFO ] Deduced a trap composed of 197 places in 235 ms of which 4 ms to minimize.
[2024-05-28 19:52:46] [INFO ] Deduced a trap composed of 197 places in 261 ms of which 3 ms to minimize.
[2024-05-28 19:52:46] [INFO ] Deduced a trap composed of 197 places in 269 ms of which 4 ms to minimize.
[2024-05-28 19:52:46] [INFO ] Deduced a trap composed of 197 places in 290 ms of which 4 ms to minimize.
[2024-05-28 19:52:47] [INFO ] Deduced a trap composed of 197 places in 269 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/1871 variables, and 246 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1098 constraints, Known Traps: 114/114 constraints]
After SMT, in 62845ms problems are : Problem set: 0 solved, 1098 unsolved
Search for dead transitions found 0 dead transitions in 62865ms
Starting structural reductions in SI_LTL mode, iteration 1 : 771/772 places, 1104/1105 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 110667 ms. Remains : 771/772 places, 1104/1105 transitions.
Built C files in :
/tmp/ltsmin5540128573600225711
[2024-05-28 19:52:47] [INFO ] Computing symmetric may disable matrix : 1104 transitions.
[2024-05-28 19:52:47] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:52:47] [INFO ] Computing symmetric may enable matrix : 1104 transitions.
[2024-05-28 19:52:47] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:52:48] [INFO ] Computing Do-Not-Accords matrix : 1104 transitions.
[2024-05-28 19:52:48] [INFO ] Computation of Completed DNA matrix. took 39 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:52:48] [INFO ] Built C files in 340ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5540128573600225711
Running compilation step : cd /tmp/ltsmin5540128573600225711;'/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/ltsmin5540128573600225711;'/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/ltsmin5540128573600225711;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 19:52:51] [INFO ] Flatten gal took : 64 ms
[2024-05-28 19:52:51] [INFO ] Flatten gal took : 58 ms
[2024-05-28 19:52:51] [INFO ] Time to serialize gal into /tmp/LTL4441659012231749937.gal : 20 ms
[2024-05-28 19:52:51] [INFO ] Time to serialize properties into /tmp/LTL2941601836602824580.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/LTL4441659012231749937.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7365418714086311297.hoa' '-atoms' '/tmp/LTL2941601836602824580.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/LTL2941601836602824580.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7365418714086311297.hoa
Detected timeout of ITS tools.
[2024-05-28 19:53:06] [INFO ] Flatten gal took : 64 ms
[2024-05-28 19:53:06] [INFO ] Flatten gal took : 62 ms
[2024-05-28 19:53:06] [INFO ] Time to serialize gal into /tmp/LTL18738434533734268.gal : 13 ms
[2024-05-28 19:53:06] [INFO ] Time to serialize properties into /tmp/LTL832280670941911282.ltl : 6 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/LTL18738434533734268.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL832280670941911282.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...272
Read 1 LTL properties
Checking formula 0 : !((G(F(("((((place_482_0+place_482_1)+(place_482_2+place_482_3))+place_482_4)<=cSources)")||(G("(place_518>CanInjectEvent)"))))))
Formula 0 simplified : G(F!"(place_518>CanInjectEvent)" & FG!"((((place_482_0+place_482_1)+(place_482_2+place_482_3))+place_482_4)<=cSources)")
Detected timeout of ITS tools.
[2024-05-28 19:53:21] [INFO ] Flatten gal took : 45 ms
[2024-05-28 19:53:21] [INFO ] Applying decomposition
[2024-05-28 19:53:21] [INFO ] Flatten gal took : 44 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/graph9354975490735945790.txt' '-o' '/tmp/graph9354975490735945790.bin' '-w' '/tmp/graph9354975490735945790.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9354975490735945790.bin' '-l' '-1' '-v' '-w' '/tmp/graph9354975490735945790.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:53:22] [INFO ] Decomposing Gal with order
[2024-05-28 19:53:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:53:22] [INFO ] Removed a total of 380 redundant transitions.
[2024-05-28 19:53:22] [INFO ] Flatten gal took : 391 ms
[2024-05-28 19:53:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 632 labels/synchronizations in 38 ms.
[2024-05-28 19:53:22] [INFO ] Time to serialize gal into /tmp/LTL830690894703116316.gal : 16 ms
[2024-05-28 19:53:22] [INFO ] Time to serialize properties into /tmp/LTL10011566213529488227.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL830690894703116316.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10011566213529488227.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F(("((((gu26.place_482_0+gu26.place_482_1)+(gu26.place_482_2+gu26.place_482_3))+gu26.place_482_4)<=gu26.cSources)")||(G("(gu25.pl...190
Formula 0 simplified : G(F!"(gu25.place_518>gu25.CanInjectEvent)" & FG!"((((gu26.place_482_0+gu26.place_482_1)+(gu26.place_482_2+gu26.place_482_3))+gu26.pl...183
Detected timeout of ITS tools.
Treatment of property PolyORBNT-COL-S05J60-LTLCardinality-07 finished in 358299 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 903/903 places, 1236/1236 transitions.
Applied a total of 0 rules in 24 ms. Remains 903 /903 variables (removed 0) and now considering 1236/1236 (removed 0) transitions.
Running 1230 sub problems to find dead transitions.
[2024-05-28 19:53:38] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
// Phase 1: matrix 1232 rows 903 cols
[2024-05-28 19:53:38] [INFO ] Computed 137 invariants in 29 ms
[2024-05-28 19:53:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2135 variables, and 131 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/2135 variables, and 136 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 0/0 constraints]
After SMT, in 43119ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 43136ms
[2024-05-28 19:54:21] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 19:54:21] [INFO ] Invariant cache hit.
[2024-05-28 19:54:22] [INFO ] Implicit Places using invariants in 952 ms returned []
[2024-05-28 19:54:22] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 19:54:22] [INFO ] Invariant cache hit.
[2024-05-28 19:54:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:54:27] [INFO ] Implicit Places using invariants and state equation in 5318 ms returned []
Implicit Place search using SMT with State Equation took 6274 ms to find 0 implicit places.
Running 1230 sub problems to find dead transitions.
[2024-05-28 19:54:27] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 19:54:27] [INFO ] Invariant cache hit.
[2024-05-28 19:54:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/2135 variables, and 136 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-05-28 19:55:24] [INFO ] Deduced a trap composed of 304 places in 383 ms of which 8 ms to minimize.
[2024-05-28 19:55:25] [INFO ] Deduced a trap composed of 12 places in 328 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/2135 variables, and 138 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 2/2 constraints]
After SMT, in 62880ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 62904ms
Finished structural reductions in LTL mode , in 1 iterations and 112348 ms. Remains : 903/903 places, 1236/1236 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J60-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J60-LTLCardinality-11 finished in 112546 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 903/903 places, 1236/1236 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 903 transition count 1171
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 130 place count 838 transition count 1171
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 130 place count 838 transition count 1107
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 258 place count 774 transition count 1107
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 264 place count 771 transition count 1104
Applied a total of 264 rules in 92 ms. Remains 771 /903 variables (removed 132) and now considering 1104/1236 (removed 132) transitions.
Running 1098 sub problems to find dead transitions.
[2024-05-28 19:55:30] [INFO ] Flow matrix only has 1100 transitions (discarded 4 similar events)
// Phase 1: matrix 1100 rows 771 cols
[2024-05-28 19:55:30] [INFO ] Computed 137 invariants in 23 ms
[2024-05-28 19:55:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 19:55:44] [INFO ] Deduced a trap composed of 240 places in 257 ms of which 5 ms to minimize.
[2024-05-28 19:55:45] [INFO ] Deduced a trap composed of 197 places in 282 ms of which 4 ms to minimize.
[2024-05-28 19:55:45] [INFO ] Deduced a trap composed of 246 places in 300 ms of which 5 ms to minimize.
[2024-05-28 19:55:45] [INFO ] Deduced a trap composed of 197 places in 266 ms of which 4 ms to minimize.
[2024-05-28 19:55:46] [INFO ] Deduced a trap composed of 197 places in 263 ms of which 4 ms to minimize.
[2024-05-28 19:55:46] [INFO ] Deduced a trap composed of 197 places in 277 ms of which 4 ms to minimize.
[2024-05-28 19:55:46] [INFO ] Deduced a trap composed of 231 places in 303 ms of which 4 ms to minimize.
[2024-05-28 19:55:46] [INFO ] Deduced a trap composed of 197 places in 288 ms of which 4 ms to minimize.
[2024-05-28 19:55:47] [INFO ] Deduced a trap composed of 197 places in 255 ms of which 4 ms to minimize.
[2024-05-28 19:55:47] [INFO ] Deduced a trap composed of 197 places in 267 ms of which 4 ms to minimize.
[2024-05-28 19:55:47] [INFO ] Deduced a trap composed of 197 places in 271 ms of which 5 ms to minimize.
[2024-05-28 19:55:48] [INFO ] Deduced a trap composed of 197 places in 269 ms of which 4 ms to minimize.
[2024-05-28 19:55:48] [INFO ] Deduced a trap composed of 197 places in 320 ms of which 7 ms to minimize.
[2024-05-28 19:55:48] [INFO ] Deduced a trap composed of 197 places in 276 ms of which 4 ms to minimize.
[2024-05-28 19:55:49] [INFO ] Deduced a trap composed of 197 places in 282 ms of which 4 ms to minimize.
[2024-05-28 19:55:49] [INFO ] Deduced a trap composed of 197 places in 265 ms of which 5 ms to minimize.
[2024-05-28 19:55:49] [INFO ] Deduced a trap composed of 197 places in 322 ms of which 5 ms to minimize.
[2024-05-28 19:55:50] [INFO ] Deduced a trap composed of 197 places in 329 ms of which 5 ms to minimize.
[2024-05-28 19:55:50] [INFO ] Deduced a trap composed of 197 places in 331 ms of which 5 ms to minimize.
[2024-05-28 19:55:50] [INFO ] Deduced a trap composed of 223 places in 355 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 766/1871 variables, and 152 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1098/1098 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1098 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 19:55:56] [INFO ] Deduced a trap composed of 13 places in 214 ms of which 3 ms to minimize.
[2024-05-28 19:56:05] [INFO ] Deduced a trap composed of 234 places in 305 ms of which 5 ms to minimize.
[2024-05-28 19:56:05] [INFO ] Deduced a trap composed of 297 places in 256 ms of which 5 ms to minimize.
[2024-05-28 19:56:06] [INFO ] Deduced a trap composed of 14 places in 335 ms of which 5 ms to minimize.
[2024-05-28 19:56:10] [INFO ] Deduced a trap composed of 299 places in 272 ms of which 4 ms to minimize.
[2024-05-28 19:56:10] [INFO ] Deduced a trap composed of 299 places in 326 ms of which 5 ms to minimize.
[2024-05-28 19:56:10] [INFO ] Deduced a trap composed of 301 places in 325 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/766 variables, 7/159 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/1871 variables, and 159 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1098 constraints, Known Traps: 27/27 constraints]
After SMT, in 43109ms problems are : Problem set: 0 solved, 1098 unsolved
Search for dead transitions found 0 dead transitions in 43125ms
[2024-05-28 19:56:13] [INFO ] Flow matrix only has 1100 transitions (discarded 4 similar events)
[2024-05-28 19:56:13] [INFO ] Invariant cache hit.
[2024-05-28 19:56:14] [INFO ] Implicit Places using invariants in 954 ms returned []
[2024-05-28 19:56:14] [INFO ] Flow matrix only has 1100 transitions (discarded 4 similar events)
[2024-05-28 19:56:14] [INFO ] Invariant cache hit.
[2024-05-28 19:56:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:56:19] [INFO ] Implicit Places using invariants and state equation in 4427 ms returned []
Implicit Place search using SMT with State Equation took 5383 ms to find 0 implicit places.
[2024-05-28 19:56:19] [INFO ] Redundant transitions in 9 ms returned []
Running 1098 sub problems to find dead transitions.
[2024-05-28 19:56:19] [INFO ] Flow matrix only has 1100 transitions (discarded 4 similar events)
[2024-05-28 19:56:19] [INFO ] Invariant cache hit.
[2024-05-28 19:56:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 19:56:33] [INFO ] Deduced a trap composed of 197 places in 276 ms of which 4 ms to minimize.
[2024-05-28 19:56:34] [INFO ] Deduced a trap composed of 258 places in 277 ms of which 4 ms to minimize.
[2024-05-28 19:56:34] [INFO ] Deduced a trap composed of 197 places in 239 ms of which 3 ms to minimize.
[2024-05-28 19:56:34] [INFO ] Deduced a trap composed of 246 places in 258 ms of which 4 ms to minimize.
[2024-05-28 19:56:35] [INFO ] Deduced a trap composed of 231 places in 235 ms of which 4 ms to minimize.
[2024-05-28 19:56:35] [INFO ] Deduced a trap composed of 197 places in 261 ms of which 4 ms to minimize.
[2024-05-28 19:56:35] [INFO ] Deduced a trap composed of 197 places in 275 ms of which 4 ms to minimize.
[2024-05-28 19:56:35] [INFO ] Deduced a trap composed of 249 places in 287 ms of which 4 ms to minimize.
[2024-05-28 19:56:36] [INFO ] Deduced a trap composed of 252 places in 285 ms of which 4 ms to minimize.
[2024-05-28 19:56:36] [INFO ] Deduced a trap composed of 231 places in 266 ms of which 4 ms to minimize.
[2024-05-28 19:56:36] [INFO ] Deduced a trap composed of 225 places in 249 ms of which 4 ms to minimize.
[2024-05-28 19:56:37] [INFO ] Deduced a trap composed of 240 places in 251 ms of which 4 ms to minimize.
[2024-05-28 19:56:37] [INFO ] Deduced a trap composed of 246 places in 248 ms of which 4 ms to minimize.
[2024-05-28 19:56:37] [INFO ] Deduced a trap composed of 240 places in 252 ms of which 3 ms to minimize.
[2024-05-28 19:56:37] [INFO ] Deduced a trap composed of 225 places in 252 ms of which 4 ms to minimize.
[2024-05-28 19:56:38] [INFO ] Deduced a trap composed of 243 places in 251 ms of which 4 ms to minimize.
[2024-05-28 19:56:38] [INFO ] Deduced a trap composed of 197 places in 247 ms of which 4 ms to minimize.
[2024-05-28 19:56:38] [INFO ] Deduced a trap composed of 243 places in 257 ms of which 4 ms to minimize.
[2024-05-28 19:56:38] [INFO ] Deduced a trap composed of 197 places in 266 ms of which 4 ms to minimize.
[2024-05-28 19:56:39] [INFO ] Deduced a trap composed of 197 places in 264 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 19:56:40] [INFO ] Deduced a trap composed of 246 places in 333 ms of which 6 ms to minimize.
[2024-05-28 19:56:40] [INFO ] Deduced a trap composed of 197 places in 323 ms of which 5 ms to minimize.
[2024-05-28 19:56:40] [INFO ] Deduced a trap composed of 197 places in 330 ms of which 5 ms to minimize.
[2024-05-28 19:56:41] [INFO ] Deduced a trap composed of 246 places in 331 ms of which 5 ms to minimize.
[2024-05-28 19:56:41] [INFO ] Deduced a trap composed of 240 places in 324 ms of which 5 ms to minimize.
[2024-05-28 19:56:41] [INFO ] Deduced a trap composed of 197 places in 300 ms of which 5 ms to minimize.
[2024-05-28 19:56:42] [INFO ] Deduced a trap composed of 249 places in 284 ms of which 4 ms to minimize.
[2024-05-28 19:56:42] [INFO ] Deduced a trap composed of 237 places in 257 ms of which 4 ms to minimize.
[2024-05-28 19:56:42] [INFO ] Deduced a trap composed of 252 places in 281 ms of which 5 ms to minimize.
[2024-05-28 19:56:43] [INFO ] Deduced a trap composed of 246 places in 278 ms of which 4 ms to minimize.
[2024-05-28 19:56:43] [INFO ] Deduced a trap composed of 258 places in 290 ms of which 4 ms to minimize.
[2024-05-28 19:56:43] [INFO ] Deduced a trap composed of 246 places in 254 ms of which 4 ms to minimize.
[2024-05-28 19:56:43] [INFO ] Deduced a trap composed of 243 places in 266 ms of which 5 ms to minimize.
[2024-05-28 19:56:44] [INFO ] Deduced a trap composed of 234 places in 331 ms of which 5 ms to minimize.
[2024-05-28 19:56:44] [INFO ] Deduced a trap composed of 252 places in 328 ms of which 5 ms to minimize.
[2024-05-28 19:56:45] [INFO ] Deduced a trap composed of 197 places in 336 ms of which 6 ms to minimize.
[2024-05-28 19:56:45] [INFO ] Deduced a trap composed of 243 places in 312 ms of which 6 ms to minimize.
[2024-05-28 19:56:45] [INFO ] Deduced a trap composed of 258 places in 328 ms of which 5 ms to minimize.
[2024-05-28 19:56:46] [INFO ] Deduced a trap composed of 225 places in 329 ms of which 6 ms to minimize.
[2024-05-28 19:56:46] [INFO ] Deduced a trap composed of 197 places in 260 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 (/ 2.0 3.0))
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 (/ 2.0 3.0))
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 (/ 1.0 3.0))
(s308 0.0)
(s309 0.0)
(s310 (/ 1.0 3.0))
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 1.0)
(s356 1.0)
(s357 0.0)
(s358 1.0)
(s359 0.0)
(s360 1.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 4.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 9.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/766 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 766/1871 variables, and 172 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1098/1098 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1098 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 19:56:56] [INFO ] Deduced a trap composed of 197 places in 258 ms of which 10 ms to minimize.
[2024-05-28 19:56:59] [INFO ] Deduced a trap composed of 197 places in 326 ms of which 5 ms to minimize.
[2024-05-28 19:56:59] [INFO ] Deduced a trap composed of 197 places in 294 ms of which 5 ms to minimize.
[2024-05-28 19:57:00] [INFO ] Deduced a trap composed of 200 places in 314 ms of which 5 ms to minimize.
[2024-05-28 19:57:01] [INFO ] Deduced a trap composed of 197 places in 376 ms of which 5 ms to minimize.
[2024-05-28 19:57:01] [INFO ] Deduced a trap composed of 200 places in 366 ms of which 5 ms to minimize.
[2024-05-28 19:57:02] [INFO ] Deduced a trap composed of 197 places in 315 ms of which 5 ms to minimize.
[2024-05-28 19:57:02] [INFO ] Deduced a trap composed of 200 places in 356 ms of which 6 ms to minimize.
[2024-05-28 19:57:02] [INFO ] Deduced a trap composed of 197 places in 294 ms of which 4 ms to minimize.
[2024-05-28 19:57:03] [INFO ] Deduced a trap composed of 200 places in 243 ms of which 4 ms to minimize.
[2024-05-28 19:57:03] [INFO ] Deduced a trap composed of 197 places in 242 ms of which 3 ms to minimize.
[2024-05-28 19:57:03] [INFO ] Deduced a trap composed of 200 places in 228 ms of which 4 ms to minimize.
[2024-05-28 19:57:03] [INFO ] Deduced a trap composed of 197 places in 286 ms of which 4 ms to minimize.
[2024-05-28 19:57:04] [INFO ] Deduced a trap composed of 197 places in 303 ms of which 4 ms to minimize.
[2024-05-28 19:57:04] [INFO ] Deduced a trap composed of 197 places in 288 ms of which 4 ms to minimize.
[2024-05-28 19:57:04] [INFO ] Deduced a trap composed of 197 places in 250 ms of which 4 ms to minimize.
[2024-05-28 19:57:05] [INFO ] Deduced a trap composed of 197 places in 364 ms of which 6 ms to minimize.
[2024-05-28 19:57:06] [INFO ] Deduced a trap composed of 197 places in 340 ms of which 5 ms to minimize.
[2024-05-28 19:57:07] [INFO ] Deduced a trap composed of 200 places in 341 ms of which 5 ms to minimize.
[2024-05-28 19:57:07] [INFO ] Deduced a trap composed of 197 places in 284 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/766 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 19:57:12] [INFO ] Deduced a trap composed of 243 places in 305 ms of which 6 ms to minimize.
[2024-05-28 19:57:12] [INFO ] Deduced a trap composed of 243 places in 254 ms of which 5 ms to minimize.
[2024-05-28 19:57:13] [INFO ] Deduced a trap composed of 237 places in 323 ms of which 5 ms to minimize.
[2024-05-28 19:57:13] [INFO ] Deduced a trap composed of 234 places in 272 ms of which 5 ms to minimize.
[2024-05-28 19:57:13] [INFO ] Deduced a trap composed of 237 places in 271 ms of which 5 ms to minimize.
[2024-05-28 19:57:14] [INFO ] Deduced a trap composed of 252 places in 301 ms of which 5 ms to minimize.
[2024-05-28 19:57:14] [INFO ] Deduced a trap composed of 197 places in 327 ms of which 4 ms to minimize.
[2024-05-28 19:57:14] [INFO ] Deduced a trap composed of 200 places in 302 ms of which 5 ms to minimize.
[2024-05-28 19:57:15] [INFO ] Deduced a trap composed of 197 places in 305 ms of which 4 ms to minimize.
[2024-05-28 19:57:15] [INFO ] Deduced a trap composed of 197 places in 247 ms of which 3 ms to minimize.
[2024-05-28 19:57:15] [INFO ] Deduced a trap composed of 197 places in 324 ms of which 5 ms to minimize.
[2024-05-28 19:57:16] [INFO ] Deduced a trap composed of 197 places in 274 ms of which 5 ms to minimize.
[2024-05-28 19:57:16] [INFO ] Deduced a trap composed of 197 places in 316 ms of which 4 ms to minimize.
[2024-05-28 19:57:16] [INFO ] Deduced a trap composed of 200 places in 294 ms of which 5 ms to minimize.
[2024-05-28 19:57:17] [INFO ] Deduced a trap composed of 200 places in 305 ms of which 5 ms to minimize.
[2024-05-28 19:57:17] [INFO ] Deduced a trap composed of 200 places in 365 ms of which 5 ms to minimize.
[2024-05-28 19:57:17] [INFO ] Deduced a trap composed of 255 places in 339 ms of which 5 ms to minimize.
[2024-05-28 19:57:18] [INFO ] Deduced a trap composed of 261 places in 381 ms of which 5 ms to minimize.
[2024-05-28 19:57:18] [INFO ] Deduced a trap composed of 197 places in 372 ms of which 5 ms to minimize.
[2024-05-28 19:57:19] [INFO ] Deduced a trap composed of 197 places in 370 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/766 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/1871 variables, and 212 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1098 constraints, Known Traps: 80/80 constraints]
After SMT, in 62889ms problems are : Problem set: 0 solved, 1098 unsolved
Search for dead transitions found 0 dead transitions in 62899ms
Starting structural reductions in SI_LTL mode, iteration 1 : 771/903 places, 1104/1236 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 111523 ms. Remains : 771/903 places, 1104/1236 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J60-LTLCardinality-12
Stuttering criterion allowed to conclude after 1118 steps with 138 reset in 11 ms.
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J60-LTLCardinality-12 finished in 111681 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(p0))&&G(p1))))'
Support contains 307 out of 903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 903/903 places, 1236/1236 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 903 transition count 1171
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 130 place count 838 transition count 1171
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 130 place count 838 transition count 1106
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 260 place count 773 transition count 1106
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 266 place count 770 transition count 1103
Applied a total of 266 rules in 104 ms. Remains 770 /903 variables (removed 133) and now considering 1103/1236 (removed 133) transitions.
Running 1097 sub problems to find dead transitions.
[2024-05-28 19:57:22] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
// Phase 1: matrix 1099 rows 770 cols
[2024-05-28 19:57:22] [INFO ] Computed 137 invariants in 51 ms
[2024-05-28 19:57:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:57:36] [INFO ] Deduced a trap composed of 239 places in 321 ms of which 5 ms to minimize.
[2024-05-28 19:57:36] [INFO ] Deduced a trap composed of 233 places in 222 ms of which 3 ms to minimize.
[2024-05-28 19:57:36] [INFO ] Deduced a trap composed of 227 places in 221 ms of which 3 ms to minimize.
[2024-05-28 19:57:37] [INFO ] Deduced a trap composed of 236 places in 336 ms of which 5 ms to minimize.
[2024-05-28 19:57:37] [INFO ] Deduced a trap composed of 196 places in 229 ms of which 3 ms to minimize.
[2024-05-28 19:57:37] [INFO ] Deduced a trap composed of 196 places in 313 ms of which 5 ms to minimize.
[2024-05-28 19:57:38] [INFO ] Deduced a trap composed of 196 places in 226 ms of which 3 ms to minimize.
[2024-05-28 19:57:38] [INFO ] Deduced a trap composed of 196 places in 225 ms of which 3 ms to minimize.
[2024-05-28 19:57:38] [INFO ] Deduced a trap composed of 196 places in 225 ms of which 4 ms to minimize.
[2024-05-28 19:57:38] [INFO ] Deduced a trap composed of 196 places in 233 ms of which 4 ms to minimize.
[2024-05-28 19:57:38] [INFO ] Deduced a trap composed of 196 places in 222 ms of which 3 ms to minimize.
[2024-05-28 19:57:39] [INFO ] Deduced a trap composed of 196 places in 234 ms of which 4 ms to minimize.
[2024-05-28 19:57:39] [INFO ] Deduced a trap composed of 196 places in 308 ms of which 5 ms to minimize.
[2024-05-28 19:57:39] [INFO ] Deduced a trap composed of 196 places in 212 ms of which 3 ms to minimize.
[2024-05-28 19:57:40] [INFO ] Deduced a trap composed of 196 places in 224 ms of which 3 ms to minimize.
[2024-05-28 19:57:40] [INFO ] Deduced a trap composed of 196 places in 225 ms of which 3 ms to minimize.
[2024-05-28 19:57:40] [INFO ] Deduced a trap composed of 196 places in 313 ms of which 5 ms to minimize.
[2024-05-28 19:57:40] [INFO ] Deduced a trap composed of 196 places in 216 ms of which 4 ms to minimize.
[2024-05-28 19:57:41] [INFO ] Deduced a trap composed of 196 places in 227 ms of which 4 ms to minimize.
[2024-05-28 19:57:41] [INFO ] Deduced a trap composed of 196 places in 238 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:57:42] [INFO ] Deduced a trap composed of 196 places in 307 ms of which 4 ms to minimize.
[2024-05-28 19:57:42] [INFO ] Deduced a trap composed of 196 places in 220 ms of which 3 ms to minimize.
[2024-05-28 19:57:42] [INFO ] Deduced a trap composed of 196 places in 215 ms of which 4 ms to minimize.
[2024-05-28 19:57:42] [INFO ] Deduced a trap composed of 196 places in 213 ms of which 4 ms to minimize.
[2024-05-28 19:57:43] [INFO ] Deduced a trap composed of 196 places in 229 ms of which 4 ms to minimize.
[2024-05-28 19:57:43] [INFO ] Deduced a trap composed of 196 places in 226 ms of which 3 ms to minimize.
[2024-05-28 19:57:43] [INFO ] Deduced a trap composed of 196 places in 225 ms of which 4 ms to minimize.
[2024-05-28 19:57:43] [INFO ] Deduced a trap composed of 196 places in 227 ms of which 3 ms to minimize.
[2024-05-28 19:57:44] [INFO ] Deduced a trap composed of 196 places in 214 ms of which 3 ms to minimize.
[2024-05-28 19:57:44] [INFO ] Deduced a trap composed of 196 places in 209 ms of which 3 ms to minimize.
[2024-05-28 19:57:44] [INFO ] Deduced a trap composed of 196 places in 223 ms of which 3 ms to minimize.
[2024-05-28 19:57:44] [INFO ] Deduced a trap composed of 196 places in 233 ms of which 3 ms to minimize.
[2024-05-28 19:57:45] [INFO ] Deduced a trap composed of 196 places in 221 ms of which 4 ms to minimize.
[2024-05-28 19:57:45] [INFO ] Deduced a trap composed of 196 places in 221 ms of which 3 ms to minimize.
SMT process timed out in 23318ms, After SMT, problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 23333ms
[2024-05-28 19:57:45] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:57:45] [INFO ] Invariant cache hit.
[2024-05-28 19:57:46] [INFO ] Implicit Places using invariants in 672 ms returned []
[2024-05-28 19:57:46] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:57:46] [INFO ] Invariant cache hit.
[2024-05-28 19:57:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:57:51] [INFO ] Implicit Places using invariants and state equation in 5477 ms returned []
Implicit Place search using SMT with State Equation took 6150 ms to find 0 implicit places.
[2024-05-28 19:57:51] [INFO ] Redundant transitions in 23 ms returned []
Running 1097 sub problems to find dead transitions.
[2024-05-28 19:57:51] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:57:51] [INFO ] Invariant cache hit.
[2024-05-28 19:57:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:58:05] [INFO ] Deduced a trap composed of 245 places in 322 ms of which 5 ms to minimize.
[2024-05-28 19:58:05] [INFO ] Deduced a trap composed of 196 places in 274 ms of which 5 ms to minimize.
[2024-05-28 19:58:05] [INFO ] Deduced a trap composed of 233 places in 238 ms of which 4 ms to minimize.
[2024-05-28 19:58:06] [INFO ] Deduced a trap composed of 196 places in 270 ms of which 3 ms to minimize.
[2024-05-28 19:58:06] [INFO ] Deduced a trap composed of 230 places in 246 ms of which 4 ms to minimize.
[2024-05-28 19:58:06] [INFO ] Deduced a trap composed of 196 places in 282 ms of which 4 ms to minimize.
[2024-05-28 19:58:07] [INFO ] Deduced a trap composed of 196 places in 262 ms of which 4 ms to minimize.
[2024-05-28 19:58:07] [INFO ] Deduced a trap composed of 245 places in 220 ms of which 3 ms to minimize.
[2024-05-28 19:58:07] [INFO ] Deduced a trap composed of 196 places in 214 ms of which 3 ms to minimize.
[2024-05-28 19:58:07] [INFO ] Deduced a trap composed of 196 places in 214 ms of which 4 ms to minimize.
[2024-05-28 19:58:08] [INFO ] Deduced a trap composed of 196 places in 210 ms of which 3 ms to minimize.
[2024-05-28 19:58:08] [INFO ] Deduced a trap composed of 196 places in 275 ms of which 4 ms to minimize.
[2024-05-28 19:58:08] [INFO ] Deduced a trap composed of 196 places in 219 ms of which 3 ms to minimize.
[2024-05-28 19:58:08] [INFO ] Deduced a trap composed of 254 places in 233 ms of which 4 ms to minimize.
[2024-05-28 19:58:09] [INFO ] Deduced a trap composed of 196 places in 279 ms of which 4 ms to minimize.
[2024-05-28 19:58:09] [INFO ] Deduced a trap composed of 196 places in 265 ms of which 4 ms to minimize.
[2024-05-28 19:58:09] [INFO ] Deduced a trap composed of 242 places in 269 ms of which 4 ms to minimize.
[2024-05-28 19:58:10] [INFO ] Deduced a trap composed of 196 places in 221 ms of which 3 ms to minimize.
[2024-05-28 19:58:10] [INFO ] Deduced a trap composed of 196 places in 300 ms of which 5 ms to minimize.
[2024-05-28 19:58:10] [INFO ] Deduced a trap composed of 242 places in 231 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:58:11] [INFO ] Deduced a trap composed of 254 places in 198 ms of which 4 ms to minimize.
[2024-05-28 19:58:11] [INFO ] Deduced a trap composed of 245 places in 234 ms of which 4 ms to minimize.
[2024-05-28 19:58:11] [INFO ] Deduced a trap composed of 248 places in 220 ms of which 3 ms to minimize.
[2024-05-28 19:58:12] [INFO ] Deduced a trap composed of 196 places in 298 ms of which 4 ms to minimize.
[2024-05-28 19:58:12] [INFO ] Deduced a trap composed of 251 places in 223 ms of which 4 ms to minimize.
[2024-05-28 19:58:12] [INFO ] Deduced a trap composed of 196 places in 219 ms of which 4 ms to minimize.
[2024-05-28 19:58:13] [INFO ] Deduced a trap composed of 233 places in 226 ms of which 3 ms to minimize.
[2024-05-28 19:58:13] [INFO ] Deduced a trap composed of 236 places in 217 ms of which 3 ms to minimize.
[2024-05-28 19:58:13] [INFO ] Deduced a trap composed of 196 places in 223 ms of which 4 ms to minimize.
[2024-05-28 19:58:13] [INFO ] Deduced a trap composed of 230 places in 266 ms of which 3 ms to minimize.
[2024-05-28 19:58:14] [INFO ] Deduced a trap composed of 260 places in 230 ms of which 3 ms to minimize.
[2024-05-28 19:58:14] [INFO ] Deduced a trap composed of 236 places in 218 ms of which 3 ms to minimize.
[2024-05-28 19:58:14] [INFO ] Deduced a trap composed of 196 places in 238 ms of which 4 ms to minimize.
[2024-05-28 19:58:14] [INFO ] Deduced a trap composed of 196 places in 247 ms of which 4 ms to minimize.
[2024-05-28 19:58:15] [INFO ] Deduced a trap composed of 196 places in 256 ms of which 4 ms to minimize.
[2024-05-28 19:58:15] [INFO ] Deduced a trap composed of 196 places in 243 ms of which 4 ms to minimize.
[2024-05-28 19:58:15] [INFO ] Deduced a trap composed of 196 places in 250 ms of which 4 ms to minimize.
[2024-05-28 19:58:15] [INFO ] Deduced a trap composed of 196 places in 263 ms of which 4 ms to minimize.
[2024-05-28 19:58:16] [INFO ] Deduced a trap composed of 196 places in 254 ms of which 4 ms to minimize.
[2024-05-28 19:58:16] [INFO ] Deduced a trap composed of 196 places in 250 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 172 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:58:29] [INFO ] Deduced a trap composed of 200 places in 285 ms of which 4 ms to minimize.
[2024-05-28 19:58:29] [INFO ] Deduced a trap composed of 196 places in 324 ms of which 4 ms to minimize.
[2024-05-28 19:58:29] [INFO ] Deduced a trap composed of 196 places in 260 ms of which 4 ms to minimize.
[2024-05-28 19:58:30] [INFO ] Deduced a trap composed of 196 places in 262 ms of which 4 ms to minimize.
[2024-05-28 19:58:30] [INFO ] Deduced a trap composed of 200 places in 260 ms of which 4 ms to minimize.
[2024-05-28 19:58:30] [INFO ] Deduced a trap composed of 196 places in 291 ms of which 4 ms to minimize.
[2024-05-28 19:58:31] [INFO ] Deduced a trap composed of 200 places in 291 ms of which 4 ms to minimize.
[2024-05-28 19:58:31] [INFO ] Deduced a trap composed of 196 places in 309 ms of which 4 ms to minimize.
[2024-05-28 19:58:31] [INFO ] Deduced a trap composed of 200 places in 249 ms of which 4 ms to minimize.
[2024-05-28 19:58:31] [INFO ] Deduced a trap composed of 196 places in 252 ms of which 4 ms to minimize.
[2024-05-28 19:58:32] [INFO ] Deduced a trap composed of 196 places in 251 ms of which 4 ms to minimize.
[2024-05-28 19:58:32] [INFO ] Deduced a trap composed of 200 places in 265 ms of which 4 ms to minimize.
[2024-05-28 19:58:32] [INFO ] Deduced a trap composed of 196 places in 232 ms of which 3 ms to minimize.
[2024-05-28 19:58:32] [INFO ] Deduced a trap composed of 196 places in 218 ms of which 3 ms to minimize.
[2024-05-28 19:58:33] [INFO ] Deduced a trap composed of 196 places in 235 ms of which 4 ms to minimize.
[2024-05-28 19:58:33] [INFO ] Deduced a trap composed of 196 places in 241 ms of which 4 ms to minimize.
[2024-05-28 19:58:33] [INFO ] Deduced a trap composed of 200 places in 327 ms of which 4 ms to minimize.
[2024-05-28 19:58:34] [INFO ] Deduced a trap composed of 196 places in 247 ms of which 4 ms to minimize.
[2024-05-28 19:58:34] [INFO ] Deduced a trap composed of 200 places in 304 ms of which 3 ms to minimize.
[2024-05-28 19:58:34] [INFO ] Deduced a trap composed of 196 places in 227 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:58:37] [INFO ] Deduced a trap composed of 249 places in 336 ms of which 5 ms to minimize.
[2024-05-28 19:58:38] [INFO ] Deduced a trap composed of 248 places in 287 ms of which 5 ms to minimize.
[2024-05-28 19:58:38] [INFO ] Deduced a trap composed of 237 places in 300 ms of which 5 ms to minimize.
[2024-05-28 19:58:38] [INFO ] Deduced a trap composed of 230 places in 288 ms of which 4 ms to minimize.
[2024-05-28 19:58:39] [INFO ] Deduced a trap composed of 248 places in 299 ms of which 5 ms to minimize.
[2024-05-28 19:58:39] [INFO ] Deduced a trap composed of 255 places in 382 ms of which 5 ms to minimize.
[2024-05-28 19:58:39] [INFO ] Deduced a trap composed of 237 places in 307 ms of which 5 ms to minimize.
[2024-05-28 19:58:40] [INFO ] Deduced a trap composed of 248 places in 309 ms of which 5 ms to minimize.
[2024-05-28 19:58:40] [INFO ] Deduced a trap composed of 242 places in 209 ms of which 4 ms to minimize.
[2024-05-28 19:58:40] [INFO ] Deduced a trap composed of 236 places in 217 ms of which 6 ms to minimize.
[2024-05-28 19:58:40] [INFO ] Deduced a trap composed of 254 places in 229 ms of which 4 ms to minimize.
[2024-05-28 19:58:41] [INFO ] Deduced a trap composed of 245 places in 300 ms of which 4 ms to minimize.
[2024-05-28 19:58:42] [INFO ] Deduced a trap composed of 196 places in 374 ms of which 5 ms to minimize.
[2024-05-28 19:58:42] [INFO ] Deduced a trap composed of 196 places in 327 ms of which 5 ms to minimize.
[2024-05-28 19:58:42] [INFO ] Deduced a trap composed of 216 places in 333 ms of which 5 ms to minimize.
[2024-05-28 19:58:43] [INFO ] Deduced a trap composed of 196 places in 279 ms of which 3 ms to minimize.
[2024-05-28 19:58:43] [INFO ] Deduced a trap composed of 196 places in 240 ms of which 4 ms to minimize.
[2024-05-28 19:58:43] [INFO ] Deduced a trap composed of 196 places in 252 ms of which 4 ms to minimize.
[2024-05-28 19:58:44] [INFO ] Deduced a trap composed of 261 places in 339 ms of which 3 ms to minimize.
[2024-05-28 19:58:44] [INFO ] Deduced a trap composed of 196 places in 243 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1869 variables, and 212 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1097 constraints, Known Traps: 80/80 constraints]
After SMT, in 62546ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 62565ms
Starting structural reductions in SI_LTL mode, iteration 1 : 770/903 places, 1103/1236 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 92193 ms. Remains : 770/903 places, 1103/1236 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J60-LTLCardinality-15
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 2 ms.
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J60-LTLCardinality-15 finished in 92357 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
[2024-05-28 19:58:54] [INFO ] Flatten gal took : 110 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6197055573716155493
[2024-05-28 19:58:54] [INFO ] Computing symmetric may disable matrix : 1236 transitions.
[2024-05-28 19:58:54] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:58:55] [INFO ] Computing symmetric may enable matrix : 1236 transitions.
[2024-05-28 19:58:55] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:58:55] [INFO ] Applying decomposition
[2024-05-28 19:58:55] [INFO ] Flatten gal took : 126 ms
[2024-05-28 19:58:55] [INFO ] Computing Do-Not-Accords matrix : 1236 transitions.
[2024-05-28 19:58:55] [INFO ] Computation of Completed DNA matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:58:55] [INFO ] Built C files in 352ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6197055573716155493
Running compilation step : cd /tmp/ltsmin6197055573716155493;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/graph6007977857356140419.txt' '-o' '/tmp/graph6007977857356140419.bin' '-w' '/tmp/graph6007977857356140419.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6007977857356140419.bin' '-l' '-1' '-v' '-w' '/tmp/graph6007977857356140419.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:58:55] [INFO ] Decomposing Gal with order
[2024-05-28 19:58:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:58:55] [INFO ] Removed a total of 1346 redundant transitions.
[2024-05-28 19:58:55] [INFO ] Flatten gal took : 298 ms
[2024-05-28 19:58:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 690 labels/synchronizations in 84 ms.
[2024-05-28 19:58:56] [INFO ] Time to serialize gal into /tmp/LTLCardinality9532361094756146427.gal : 8 ms
[2024-05-28 19:58:56] [INFO ] Time to serialize properties into /tmp/LTLCardinality8528203635896442311.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/LTLCardinality9532361094756146427.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8528203635896442311.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((G(F(("((((gu58.place_482_0+gu58.place_482_1)+(gu58.place_482_2+gu58.place_482_3))+gu58.place_482_4)<=gu58.cSources)")||(G("(gu98.pl...190
Formula 0 simplified : G(F!"(gu98.place_518>gu98.CanInjectEvent)" & FG!"((((gu58.place_482_0+gu58.place_482_1)+(gu58.place_482_2+gu58.place_482_3))+gu58.pl...183
Compilation finished in 5360 ms.
Running link step : cd /tmp/ltsmin6197055573716155493;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 194 ms.
Running LTSmin : cd /tmp/ltsmin6197055573716155493;'/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)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-28 20:24:43] [INFO ] Applying decomposition
[2024-05-28 20:24:43] [INFO ] Flatten gal took : 136 ms
[2024-05-28 20:24:43] [INFO ] Decomposing Gal with order
[2024-05-28 20:24:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:24:43] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to block in partition [CreatedJobs_0],[CreatedJobs_1],[CreatedJobs_2],[CreatedJobs_3],[CreatedJobs_4],[CreatedJobs_5],[CreatedJobs_6],[CreatedJobs_7],[CreatedJobs_8],[CreatedJobs_9],[CreatedJobs_10],[CreatedJobs_11],[CreatedJobs_12],[CreatedJobs_13],[CreatedJobs_14],[CreatedJobs_15],[CreatedJobs_16],[CreatedJobs_17],[CreatedJobs_18],[CreatedJobs_19],[CreatedJobs_20],[CreatedJobs_21],[CreatedJobs_22],[CreatedJobs_23],[CreatedJobs_24],[CreatedJobs_25],[CreatedJobs_26],[CreatedJobs_27],[CreatedJobs_28],[CreatedJobs_29],[CreatedJobs_30],[CreatedJobs_31],[CreatedJobs_32],[CreatedJobs_33],[CreatedJobs_34],[CreatedJobs_35],[CreatedJobs_36],[CreatedJobs_37],[CreatedJobs_38],[CreatedJobs_39],[CreatedJobs_40],[CreatedJobs_41],[CreatedJobs_42],[CreatedJobs_43],[CreatedJobs_44],[CreatedJobs_45],[CreatedJobs_46],[CreatedJobs_47],[CreatedJobs_48],[CreatedJobs_49],[CreatedJobs_50],[CreatedJobs_51],[CreatedJobs_52],[CreatedJobs_53],[CreatedJobs_54],[CreatedJobs_55],[CreatedJobs_56],[CreatedJobs_57],[CreatedJobs_58],[CreatedJobs_59],[CreatedJobs_60],[CreatedJobs_61],[CreatedJobs_62],[CreatedJobs_63],[CreatedJobs_64],[CreatedJobs_65],[CreatedJobs_66],[CreatedJobs_67],[CreatedJobs_68],[CreatedJobs_69],[CreatedJobs_70],[CreatedJobs_71],[CreatedJobs_72],[CreatedJobs_73],[CreatedJobs_74],[CreatedJobs_75],[CreatedJobs_76],[CreatedJobs_77],[CreatedJobs_78],[CreatedJobs_79],[CreatedJobs_80],[CreatedJobs_81],[CreatedJobs_82],[CreatedJobs_83],[CreatedJobs_84],[CreatedJobs_85],[CreatedJobs_86],[CreatedJobs_87],[CreatedJobs_88],[CreatedJobs_89],[CreatedJobs_90],[CreatedJobs_91],[CreatedJobs_92],[CreatedJobs_93],[CreatedJobs_94],[CreatedJobs_95],[CreatedJobs_96],[CreatedJobs_97],[CreatedJobs_98],[CreatedJobs_99],[CreatedJobs_100],[CreatedJobs_101],[CreatedJobs_102],[CreatedJobs_103],[CreatedJobs_104],[CreatedJobs_105],[CreatedJobs_106],[CreatedJobs_107],[CreatedJobs_108],[CreatedJobs_109],[CreatedJobs_110],[CreatedJobs_111],[CreatedJobs_112],[CreatedJobs_113],[CreatedJobs_114],[CreatedJobs_115],[CreatedJobs_116],[CreatedJobs_117],[CreatedJobs_118],[CreatedJobs_119],[CreatedJobs_120],[CreatedJobs_121],[CreatedJobs_122],[CreatedJobs_123],[CreatedJobs_124],[CreatedJobs_125],[CreatedJobs_126],[CreatedJobs_127],[CreatedJobs_128],[CreatedJobs_129],[CreatedJobs_130],[CreatedJobs_131],[CreatedJobs_132],[CreatedJobs_133],[CreatedJobs_134],[CreatedJobs_135],[CreatedJobs_136],[CreatedJobs_137],[CreatedJobs_138],[CreatedJobs_139],[CreatedJobs_140],[CreatedJobs_141],[CreatedJobs_142],[CreatedJobs_143],[CreatedJobs_144],[CreatedJobs_145],[CreatedJobs_146],[CreatedJobs_147],[CreatedJobs_148],[CreatedJobs_149],[CreatedJobs_150],[CreatedJobs_151],[CreatedJobs_152],[CreatedJobs_153],[CreatedJobs_154],[CreatedJobs_155],[CreatedJobs_156],[CreatedJobs_157],[CreatedJobs_158],[CreatedJobs_159],[CreatedJobs_160],[CreatedJobs_161],[CreatedJobs_162],[CreatedJobs_163],[CreatedJobs_164],[CreatedJobs_165],[CreatedJobs_166],[CreatedJobs_167],[CreatedJobs_168],[CreatedJobs_169],[CreatedJobs_170],[CreatedJobs_171],[CreatedJobs_172],[CreatedJobs_173],[CreatedJobs_174],[CreatedJobs_175],[CreatedJobs_176],[CreatedJobs_177],[CreatedJobs_178],[CreatedJobs_179],[CreatedJobs_180],[CreatedJobs_181],[CreatedJobs_182],[CreatedJobs_183],[CreatedJobs_184],[CreatedJobs_185],[CreatedJobs_186],[CreatedJobs_187],[CreatedJobs_188],[CreatedJobs_189],[CreatedJobs_190],[CreatedJobs_191],[CreatedJobs_192],[CreatedJobs_193],[CreatedJobs_194],[CreatedJobs_195],[CreatedJobs_196],[CreatedJobs_197],[CreatedJobs_198],[CreatedJobs_199],[CreatedJobs_200],[CreatedJobs_201],[CreatedJobs_202],[CreatedJobs_203],[CreatedJobs_204],[CreatedJobs_205],[CreatedJobs_206],[CreatedJobs_207],[CreatedJobs_208],[CreatedJobs_209],[CreatedJobs_210],[CreatedJobs_211],[CreatedJobs_212],[CreatedJobs_213],[CreatedJobs_214],[CreatedJobs_215],[CreatedJobs_216],[CreatedJobs_217],[CreatedJobs_218],[CreatedJobs_219],[CreatedJobs_220],[CreatedJobs_221],[CreatedJobs_222],[CreatedJobs_223],[CreatedJobs_224],[CreatedJobs_225],[CreatedJobs_226],[CreatedJobs_227],[CreatedJobs_228],[CreatedJobs_229],[CreatedJobs_230],[CreatedJobs_231],[CreatedJobs_232],[CreatedJobs_233],[CreatedJobs_234],[CreatedJobs_235],[CreatedJobs_236],[CreatedJobs_237],[CreatedJobs_238],[CreatedJobs_239],[CreatedJobs_240],[CreatedJobs_241],[CreatedJobs_242],[CreatedJobs_243],[CreatedJobs_244],[CreatedJobs_245],[CreatedJobs_246],[CreatedJobs_247],[CreatedJobs_248],[CreatedJobs_249],[CreatedJobs_250],[CreatedJobs_251],[CreatedJobs_252],[CreatedJobs_253],[CreatedJobs_254],[CreatedJobs_255],[CreatedJobs_256],[CreatedJobs_257],[CreatedJobs_258],[CreatedJobs_259],[CreatedJobs_260],[CreatedJobs_261],[CreatedJobs_262],[CreatedJobs_263],[CreatedJobs_264],[CreatedJobs_265],[CreatedJobs_266],[CreatedJobs_267],[CreatedJobs_268],[CreatedJobs_269],[CreatedJobs_270],[CreatedJobs_271],[CreatedJobs_272],[CreatedJobs_273],[CreatedJobs_274],[CreatedJobs_275],[CreatedJobs_276],[CreatedJobs_277],[CreatedJobs_278],[CreatedJobs_279],[CreatedJobs_280],[CreatedJobs_281],[CreatedJobs_282],[CreatedJobs_283],[CreatedJobs_284],[CreatedJobs_285],[CreatedJobs_286],[CreatedJobs_287],[CreatedJobs_288],[CreatedJobs_289],[CreatedJobs_290],[CreatedJobs_291],[CreatedJobs_292],[CreatedJobs_293],[CreatedJobs_294],[CreatedJobs_295],[CreatedJobs_296],[CreatedJobs_297],[CreatedJobs_298],[CreatedJobs_299],[CreatedJobs_300],[CreatedJobs_301],[CreatedJobs_302],[CreatedJobs_303],[CreatedJobs_304],[Schedule_Task_E_0],[Schedule_Task_E_1],[Schedule_Task_E_2],[Schedule_Task_E_3],[Schedule_Task_E_4],[Schedule_Task_E_5],[Schedule_Task_E_6],[Schedule_Task_E_7],[Schedule_Task_E_8],[Schedule_Task_E_9],[Schedule_Task_E_10],[Schedule_Task_E_11],[Schedule_Task_E_12],[Schedule_Task_E_13],[Schedule_Task_E_14],[Schedule_Task_E_15],[Schedule_Task_E_16],[Schedule_Task_E_17],[Schedule_Task_E_18],[Schedule_Task_E_19],[Schedule_Task_E_20],[Schedule_Task_E_21],[Schedule_Task_E_22],[Schedule_Task_E_23],[Schedule_Task_E_24],[Schedule_Task_E_25],[Schedule_Task_E_26],[Schedule_Task_E_27],[Schedule_Task_E_28],[Schedule_Task_E_29],[Schedule_Task_E_30],[Schedule_Task_E_31],[Schedule_Task_E_32],[Schedule_Task_E_33],[Schedule_Task_E_34],[Schedule_Task_E_35],[Schedule_Task_E_36],[Schedule_Task_E_37],[Schedule_Task_E_38],[Schedule_Task_E_39],[Schedule_Task_E_40],[Schedule_Task_E_41],[Schedule_Task_E_42],[Schedule_Task_E_43],[Schedule_Task_E_44],[Schedule_Task_E_45],[Schedule_Task_E_46],[Schedule_Task_E_47],[Schedule_Task_E_48],[Schedule_Task_E_49],[Schedule_Task_E_50],[Schedule_Task_E_51],[Schedule_Task_E_52],[Schedule_Task_E_53],[Schedule_Task_E_54],[Schedule_Task_E_55],[Schedule_Task_E_56],[Schedule_Task_E_57],[Schedule_Task_E_58],[Schedule_Task_E_59],[Schedule_Task_E_60],[Schedule_Task_E_61],[f3_0, f2_0, f1_0, AvailableJobId_0],[f3_1, f2_1, f1_1, AvailableJobId_1],[f3_2, f2_2, f1_2, AvailableJobId_2],[f3_3, f2_3, f1_3, AvailableJobId_3],[f3_4, f2_4, f1_4, AvailableJobId_4],[f3_5, f2_5, f1_5, AvailableJobId_5],[f3_6, f2_6, f1_6, AvailableJobId_6],[f3_7, f2_7, f1_7, AvailableJobId_7],[f3_8, f2_8, f1_8, AvailableJobId_8],[f3_9, f2_9, f1_9, AvailableJobId_9],[f3_10, f2_10, f1_10, AvailableJobId_10],[f3_11, f2_11, f1_11, AvailableJobId_11],[f3_12, f2_12, f1_12, AvailableJobId_12],[f3_13, f2_13, f1_13, AvailableJobId_13],[f3_14, f2_14, f1_14, AvailableJobId_14],[f3_15, f2_15, f1_15, AvailableJobId_15],[f3_16, f2_16, f1_16, AvailableJobId_16],[f3_17, f2_17, f1_17, AvailableJobId_17],[f3_18, f2_18, f1_18, AvailableJobId_18],[f3_19, f2_19, f1_19, AvailableJobId_19],[f3_20, f2_20, f1_20, AvailableJobId_20],[f3_21, f2_21, f1_21, AvailableJobId_21],[f3_22, f2_22, f1_22, AvailableJobId_22],[f3_23, f2_23, f1_23, AvailableJobId_23],[f3_24, f2_24, f1_24, AvailableJobId_24],[f3_25, f2_25, f1_25, AvailableJobId_25],[f3_26, f2_26, f1_26, AvailableJobId_26],[f3_27, f2_27, f1_27, AvailableJobId_27],[f3_28, f2_28, f1_28, AvailableJobId_28],[f3_29, f2_29, f1_29, AvailableJobId_29],[f3_30, f2_30, f1_30, AvailableJobId_30],[f3_31, f2_31, f1_31, AvailableJobId_31],[f3_32, f2_32, f1_32, AvailableJobId_32],[f3_33, f2_33, f1_33, AvailableJobId_33],[f3_34, f2_34, f1_34, AvailableJobId_34],[f3_35, f2_35, f1_35, AvailableJobId_35],[f3_36, f2_36, f1_36, AvailableJobId_36],[f3_37, f2_37, f1_37, AvailableJobId_37],[f3_38, f2_38, f1_38, AvailableJobId_38],[f3_39, f2_39, f1_39, AvailableJobId_39],[f3_40, f2_40, f1_40, AvailableJobId_40],[f3_41, f2_41, f1_41, AvailableJobId_41],[f3_42, f2_42, f1_42, AvailableJobId_42],[f3_43, f2_43, f1_43, AvailableJobId_43],[f3_44, f2_44, f1_44, AvailableJobId_44],[f3_45, f2_45, f1_45, AvailableJobId_45],[f3_46, f2_46, f1_46, AvailableJobId_46],[f3_47, f2_47, f1_47, AvailableJobId_47],[f3_48, f2_48, f1_48, AvailableJobId_48],[f3_49, f2_49, f1_49, AvailableJobId_49],[f3_50, f2_50, f1_50, AvailableJobId_50],[f3_51, f2_51, f1_51, AvailableJobId_51],[f3_52, f2_52, f1_52, AvailableJobId_52],[f3_53, f2_53, f1_53, AvailableJobId_53],[f3_54, f2_54, f1_54, AvailableJobId_54],[f3_55, f2_55, f1_55, AvailableJobId_55],[f3_56, f2_56, f1_56, AvailableJobId_56],[f3_57, f2_57, f1_57, AvailableJobId_57],[f3_58, f2_58, f1_58, AvailableJobId_58],[f3_59, f2_59, f1_59, AvailableJobId_59],[f3_60, f2_60, f1_60, AvailableJobId_60],[FetchJobE_0, QueueJobB_0, NotifyEventJobQueuedB_0, Perform_Work_B_0],[FetchJobE_1, QueueJobB_1, NotifyEventJobQueuedB_1, Perform_Work_B_1],[FetchJobE_2, QueueJobB_2, NotifyEventJobQueuedB_2, Perform_Work_B_2],[FetchJobE_3, QueueJobB_3, NotifyEventJobQueuedB_3, Perform_Work_B_3],[FetchJobE_4, QueueJobB_4, NotifyEventJobQueuedB_4, Perform_Work_B_4],[FetchJobE_5, QueueJobB_5, NotifyEventJobQueuedB_5, Perform_Work_B_5],[FetchJobE_6, QueueJobB_6, NotifyEventJobQueuedB_6, Perform_Work_B_6],[FetchJobE_7, QueueJobB_7, NotifyEventJobQueuedB_7, Perform_Work_B_7],[FetchJobE_8, QueueJobB_8, NotifyEventJobQueuedB_8, Perform_Work_B_8],[FetchJobE_9, QueueJobB_9, NotifyEventJobQueuedB_9, Perform_Work_B_9],[FetchJobE_10, QueueJobB_10, NotifyEventJobQueuedB_10, Perform_Work_B_10],[FetchJobE_11, QueueJobB_11, NotifyEventJobQueuedB_11, Perform_Work_B_11],[FetchJobE_12, QueueJobB_12, NotifyEventJobQueuedB_12, Perform_Work_B_12],[FetchJobE_13, QueueJobB_13, NotifyEventJobQueuedB_13, Perform_Work_B_13],[FetchJobE_14, QueueJobB_14, NotifyEventJobQueuedB_14, Perform_Work_B_14],[FetchJobE_15, QueueJobB_15, NotifyEventJobQueuedB_15, Perform_Work_B_15],[FetchJobE_16, QueueJobB_16, NotifyEventJobQueuedB_16, Perform_Work_B_16],[FetchJobE_17, QueueJobB_17, NotifyEventJobQueuedB_17, Perform_Work_B_17],[FetchJobE_18, QueueJobB_18, NotifyEventJobQueuedB_18, Perform_Work_B_18],[FetchJobE_19, QueueJobB_19, NotifyEventJobQueuedB_19, Perform_Work_B_19],[FetchJobE_20, QueueJobB_20, NotifyEventJobQueuedB_20, Perform_Work_B_20],[FetchJobE_21, QueueJobB_21, NotifyEventJobQueuedB_21, Perform_Work_B_21],[FetchJobE_22, QueueJobB_22, NotifyEventJobQueuedB_22, Perform_Work_B_22],[FetchJobE_23, QueueJobB_23, NotifyEventJobQueuedB_23, Perform_Work_B_23],[FetchJobE_24, QueueJobB_24, NotifyEventJobQueuedB_24, Perform_Work_B_24],[FetchJobE_25, QueueJobB_25, NotifyEventJobQueuedB_25, Perform_Work_B_25],[FetchJobE_26, QueueJobB_26, NotifyEventJobQueuedB_26, Perform_Work_B_26],[FetchJobE_27, QueueJobB_27, NotifyEventJobQueuedB_27, Perform_Work_B_27],[FetchJobE_28, QueueJobB_28, NotifyEventJobQueuedB_28, Perform_Work_B_28],[FetchJobE_29, QueueJobB_29, NotifyEventJobQueuedB_29, Perform_Work_B_29],[FetchJobE_30, QueueJobB_30, NotifyEventJobQueuedB_30, Perform_Work_B_30],[FetchJobE_31, QueueJobB_31, NotifyEventJobQueuedB_31, Perform_Work_B_31],[FetchJobE_32, QueueJobB_32, NotifyEventJobQueuedB_32, Perform_Work_B_32],[FetchJobE_33, QueueJobB_33, NotifyEventJobQueuedB_33, Perform_Work_B_33],[FetchJobE_34, QueueJobB_34, NotifyEventJobQueuedB_34, Perform_Work_B_34],[FetchJobE_35, QueueJobB_35, NotifyEventJobQueuedB_35, Perform_Work_B_35],[FetchJobE_36, QueueJobB_36, NotifyEventJobQueuedB_36, Perform_Work_B_36],[FetchJobE_37, QueueJobB_37, NotifyEventJobQueuedB_37, Perform_Work_B_37],[FetchJobE_38, QueueJobB_38, NotifyEventJobQueuedB_38, Perform_Work_B_38],[FetchJobE_39, QueueJobB_39, NotifyEventJobQueuedB_39, Perform_Work_B_39],[FetchJobE_40, QueueJobB_40, NotifyEventJobQueuedB_40, Perform_Work_B_40],[FetchJobE_41, QueueJobB_41, NotifyEventJobQueuedB_41, Perform_Work_B_41],[FetchJobE_42, QueueJobB_42, NotifyEventJobQueuedB_42, Perform_Work_B_42],[FetchJobE_43, QueueJobB_43, NotifyEventJobQueuedB_43, Perform_Work_B_43],[FetchJobE_44, QueueJobB_44, NotifyEventJobQueuedB_44, Perform_Work_B_44],[FetchJobE_45, QueueJobB_45, NotifyEventJobQueuedB_45, Perform_Work_B_45],[FetchJobE_46, QueueJobB_46, NotifyEventJobQueuedB_46, Perform_Work_B_46],[FetchJobE_47, QueueJobB_47, NotifyEventJobQueuedB_47, Perform_Work_B_47],[FetchJobE_48, QueueJobB_48, NotifyEventJobQueuedB_48, Perform_Work_B_48],[FetchJobE_49, QueueJobB_49, NotifyEventJobQueuedB_49, Perform_Work_B_49],[FetchJobE_50, QueueJobB_50, NotifyEventJobQueuedB_50, Perform_Work_B_50],[FetchJobE_51, QueueJobB_51, NotifyEventJobQueuedB_51, Perform_Work_B_51],[FetchJobE_52, QueueJobB_52, NotifyEventJobQueuedB_52, Perform_Work_B_52],[FetchJobE_53, QueueJobB_53, NotifyEventJobQueuedB_53, Perform_Work_B_53],[FetchJobE_54, QueueJobB_54, NotifyEventJobQueuedB_54, Perform_Work_B_54],[FetchJobE_55, QueueJobB_55, NotifyEventJobQueuedB_55, Perform_Work_B_55],[FetchJobE_56, QueueJobB_56, NotifyEventJobQueuedB_56, Perform_Work_B_56],[FetchJobE_57, QueueJobB_57, NotifyEventJobQueuedB_57, Perform_Work_B_57],[FetchJobE_58, QueueJobB_58, NotifyEventJobQueuedB_58, Perform_Work_B_58],[FetchJobE_59, QueueJobB_59, NotifyEventJobQueuedB_59, Perform_Work_B_59],[FetchJobE_60, QueueJobB_60, NotifyEventJobQueuedB_60, Perform_Work_B_60],[place_482_0],[place_482_1],[place_482_2],[place_482_3],[place_482_4],[ModifiedSrc_0, DataOnSrc_0],[ModifiedSrc_1, DataOnSrc_1],[ModifiedSrc_2, DataOnSrc_2],[ModifiedSrc_3, DataOnSrc_3],[ModifiedSrc_4, DataOnSrc_4],

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

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is PolyORBNT-COL-S05J60, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r290-tajo-171654447000387"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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