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.r516-tajo-171654446800283.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 ltsminxred
Input is PolyORBLF-PT-S04J04T10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446800283
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.7M
-rw-r--r-- 1 mcc users 27K Apr 11 17:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 154K Apr 11 17:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 111K Apr 11 17:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 530K Apr 11 17:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 12K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 45K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 19K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 11 17:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 11 17:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 263K Apr 11 17:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 11 17:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.7K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 4.2M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717254147939

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J04T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:02:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 15:02:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:02:29] [INFO ] Load time of PNML (sax parser for PT used): 352 ms
[2024-06-01 15:02:29] [INFO ] Transformed 870 places.
[2024-06-01 15:02:29] [INFO ] Transformed 5034 transitions.
[2024-06-01 15:02:29] [INFO ] Parsed PT model containing 870 places and 5034 transitions and 34774 arcs in 513 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
Ensure Unique test removed 2710 transitions
Reduce redundant transitions removed 2710 transitions.
FORMULA PolyORBLF-PT-S04J04T10-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T10-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T10-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T10-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T10-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T10-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T10-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 117 out of 870 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 866 transition count 2324
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 12 place count 858 transition count 2316
Iterating global reduction 1 with 8 rules applied. Total rules applied 20 place count 858 transition count 2316
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 28 place count 850 transition count 2308
Iterating global reduction 1 with 8 rules applied. Total rules applied 36 place count 850 transition count 2308
Applied a total of 36 rules in 195 ms. Remains 850 /870 variables (removed 20) and now considering 2308/2324 (removed 16) transitions.
Running 2304 sub problems to find dead transitions.
[2024-06-01 15:02:30] [INFO ] Flow matrix only has 2268 transitions (discarded 40 similar events)
// Phase 1: matrix 2268 rows 850 cols
[2024-06-01 15:02:30] [INFO ] Computed 54 invariants in 175 ms
[2024-06-01 15:02:30] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/846 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2304 unsolved
SMT process timed out in 32666ms, After SMT, problems are : Problem set: 0 solved, 2304 unsolved
Search for dead transitions found 0 dead transitions in 32738ms
[2024-06-01 15:03:03] [INFO ] Flow matrix only has 2268 transitions (discarded 40 similar events)
[2024-06-01 15:03:03] [INFO ] Invariant cache hit.
[2024-06-01 15:03:04] [INFO ] Implicit Places using invariants in 988 ms returned [163, 276, 359, 360, 394, 506, 528, 622, 716, 840]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1000 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 840/870 places, 2308/2324 transitions.
Applied a total of 0 rules in 22 ms. Remains 840 /840 variables (removed 0) and now considering 2308/2308 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34029 ms. Remains : 840/870 places, 2308/2324 transitions.
Support contains 117 out of 840 places after structural reductions.
[2024-06-01 15:03:04] [INFO ] Flatten gal took : 232 ms
[2024-06-01 15:03:04] [INFO ] Flatten gal took : 161 ms
[2024-06-01 15:03:04] [INFO ] Input system was already deterministic with 2308 transitions.
Support contains 116 out of 840 places (down from 117) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2172 ms. (18 steps per ms) remains 9/19 properties
BEST_FIRST walk for 40003 steps (8 resets) in 464 ms. (86 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (10 resets) in 291 ms. (136 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 320 ms. (124 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 297 ms. (134 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (9 resets) in 294 ms. (135 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 266 ms. (149 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 309 ms. (129 steps per ms) remains 9/9 properties
[2024-06-01 15:03:06] [INFO ] Flow matrix only has 2268 transitions (discarded 40 similar events)
// Phase 1: matrix 2268 rows 840 cols
[2024-06-01 15:03:06] [INFO ] Computed 44 invariants in 57 ms
[2024-06-01 15:03:06] [INFO ] State equation strengthened by 200 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 1 (OVERLAPS) 21/48 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp14 is UNSAT
At refinement iteration 3 (OVERLAPS) 741/789 variables, 16/18 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/789 variables, 0/18 constraints. Problems are: Problem set: 3 solved, 6 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp7 is UNSAT
At refinement iteration 5 (OVERLAPS) 20/809 variables, 10/28 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/809 variables, 0/28 constraints. Problems are: Problem set: 5 solved, 4 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
After SMT solving in domain Real declared 838/3108 variables, and 43 constraints, problems are : Problem set: 9 solved, 0 unsolved in 506 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 0/840 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 659ms problems are : Problem set: 9 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 9 atomic propositions for a total of 9 simplifications.
FORMULA PolyORBLF-PT-S04J04T10-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T10-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T10-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA PolyORBLF-PT-S04J04T10-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 840 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 840/840 places, 2308/2308 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 840 transition count 2234
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 148 place count 766 transition count 2234
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 148 place count 766 transition count 2134
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 348 place count 666 transition count 2134
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 349 place count 665 transition count 2133
Iterating global reduction 2 with 1 rules applied. Total rules applied 350 place count 665 transition count 2133
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 2 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 530 place count 575 transition count 2043
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 535 place count 570 transition count 2038
Iterating global reduction 2 with 5 rules applied. Total rules applied 540 place count 570 transition count 2038
Applied a total of 540 rules in 335 ms. Remains 570 /840 variables (removed 270) and now considering 2038/2308 (removed 270) transitions.
Running 2034 sub problems to find dead transitions.
[2024-06-01 15:03:07] [INFO ] Flow matrix only has 1998 transitions (discarded 40 similar events)
// Phase 1: matrix 1998 rows 570 cols
[2024-06-01 15:03:07] [INFO ] Computed 44 invariants in 56 ms
[2024-06-01 15:03:07] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/566 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2034 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 2034 unsolved
[2024-06-01 15:03:35] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 15 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 1.0)
(s5 0.0)
(s6 9.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 2.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 3.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 2.0)
(s33 0.0)
(s34 3.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 4.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 3.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 2.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.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 2.0)
(s90 1.0)
(s91 1.0)
(s92 0.0)
(s93 1.0)
(s94 1.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 1.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 2.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 1.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 4.0)
(s148 0.0)
(s149 2.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 1.0)
(s156 2.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 1.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 4.0)
(s171 0.0)
(s172 4.0)
(s173 0.0)
(s174 1.0)
(s175 1.0)
(s176 0.0)
(s177 3.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 1.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 2.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 2.0)
(s221 0.0)
(s222 0.0)
(s223 10.0)
(s224 0.0)
(s225 1.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 4.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 4.0)
(s234 0.0)
(s235 0.0)
(s236 1.0)
(s237 2.0)
(s238 0.0)
(s239 3.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 2.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 1.0)
(s276 4.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s307 0.0)
(s308 0.0)
(s309 2.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 4.0)
(s317 0.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 3.0)
(s325 0.0)
(s326 1.0)
(s327 0.0)
(s328 1.0)
(s329 1.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 1.0)
(s334 0.0)
(s335 0.0)
(s336 2.0)
(s337 0.0)
(s338 0.0)
(s339 1.0)
(s340 1.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 2.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 1.0)
(s353 0.0)
(s354 0.0)
(s355 1.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 1.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 2.0)
(s368 0.0)
(s369 0.0)
(s371 1.0)
(s372 0.0)
(s373 1.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 3.0)
(s378 1.0)
(s379 1.0)
(s380 4.0)
(s381 0.0)
(s382 0.0)
(s383 1.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 0.0)
(s392 1.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 1.0)
(s397 3.0)
(s398 0.0)
(s399 4.0)
(s400 0.0)
(s401 3.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 2.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 1.0)
(s410 0.0)
(s411 1.0)
(s412 0.0)
(s413 0.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 0.0)
(s419 4.0)
(s420 1.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 1.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 1.0)
(s432 0.0)
(s433 1.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 1.0)
(s441 0.0)
(s442 0.0)
(s443 1.0)
(s444 1.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 2.0)
(s460 2.0)
(s461 0.0)
(s462 0.0)
(s463 1.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 1.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 4.0)
(s475 0.0)
(s476 0.0)
(s477 1.0)
(s478 0.0)
(s479 0.0)
(s480 1.0)
(s481 0.0)
(s482 0.0)
(s483 1.0)
(s485 1.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 1.0)
(s491 0.0)
(s492 0.0)
(s493 3.0)
(s494 0.0)
(s495 10.0)
(s496 1.0)
(s497 1.0)
(s498 0.0)
(s499 1.0)
(s500 1.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 1.0)
(s513 0.0)
(s514 1.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 1.0)
(s525 0.0)
(s526 0.0)
(s527 1.0)
(s528 0.0)
(s529 0.0)
(s530 1.0)
(s531 0.0)
(s532 1.0)
(s533 4.0)
(s534 0.0)
(s535 0.0)
(s536 1.0)
(s537 1.0)
(s538 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 566/2568 variables, and 36 constraints, problems are : Problem set: 0 solved, 2034 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 24/33 constraints, State Equation: 0/570 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2034/2034 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2034 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/566 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2034 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 2034 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/566 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 2034 unsolved
[2024-06-01 15:03:43] [INFO ] Deduced a trap composed of 48 places in 401 ms of which 3 ms to minimize.
[2024-06-01 15:03:43] [INFO ] Deduced a trap composed of 48 places in 153 ms of which 2 ms to minimize.
[2024-06-01 15:03:43] [INFO ] Deduced a trap composed of 47 places in 118 ms of which 2 ms to minimize.
[2024-06-01 15:03:44] [INFO ] Deduced a trap composed of 48 places in 127 ms of which 2 ms to minimize.
[2024-06-01 15:03:44] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 5 ms to minimize.
[2024-06-01 15:03:44] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:03:45] [INFO ] Deduced a trap composed of 47 places in 502 ms of which 3 ms to minimize.
[2024-06-01 15:03:46] [INFO ] Deduced a trap composed of 39 places in 337 ms of which 3 ms to minimize.
[2024-06-01 15:03:46] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:03:46] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:03:49] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 0 ms to minimize.
[2024-06-01 15:03:50] [INFO ] Deduced a trap composed of 42 places in 195 ms of which 2 ms to minimize.
[2024-06-01 15:03:53] [INFO ] Deduced a trap composed of 65 places in 349 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 1)
(s5 1)
(s6 6)
(s7 1)
(s8 0)
(s9 0)
(s10 1)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 1)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 1)
(s28 0)
(s29 1)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 1)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 1)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 1)
(s72 0)
(s73 1)
(s74 1)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 1)
(s89 2)
(s90 1)
(s91 1)
(s92 0)
(s93 0)
(s94 1)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 1)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 1)
(s107 0)
(s108 0)
(s109 1)
(s110 0)
(s111 1)
(s112 1)
(s113 0)
(s114 0)
(s115 1)
(s116 0)
(s117 1)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 1)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 1)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 1)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 1)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(s152 0)
(s153 0)
(s154 1)
(s155 0)
(s156 2)
(s157 1)
(s158 1)
(s159 1)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 1)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 4)
(s173 0)
(s174 1)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 1)
(s182 1)
(s183 0)
(s184 1)
(s185 0)
(s186 0)
(s187 0)
(s188 1)
(s189 2)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 1)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 1)
(s202 1)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 1)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 1)
(s220 2)
(s221 0)
(s222 0)
(s223 10)
(s224 0)
(s225 0)
(s226 0)
(s227 1)
(s228 0)
(s229 4)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 1)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 1)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 1)
(s251 1)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 1)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 1)
(s267 0)
(s268 0)
(s269 0)
(s270 1)
(s271 1)
(s272 0)
(s273 0)
(s274 0)
(s275 1)
(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 1)
(s290 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 566/2568 variables, and 49 constraints, problems are : Problem set: 0 solved, 2034 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 24/33 constraints, State Equation: 0/570 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2034 constraints, Known Traps: 14/14 constraints]
After SMT, in 52513ms problems are : Problem set: 0 solved, 2034 unsolved
Search for dead transitions found 0 dead transitions in 52535ms
[2024-06-01 15:04:00] [INFO ] Flow matrix only has 1998 transitions (discarded 40 similar events)
[2024-06-01 15:04:00] [INFO ] Invariant cache hit.
[2024-06-01 15:04:01] [INFO ] Implicit Places using invariants in 887 ms returned []
[2024-06-01 15:04:01] [INFO ] Flow matrix only has 1998 transitions (discarded 40 similar events)
[2024-06-01 15:04:01] [INFO ] Invariant cache hit.
[2024-06-01 15:04:02] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 15:04:27] [INFO ] Implicit Places using invariants and state equation in 26072 ms returned []
Implicit Place search using SMT with State Equation took 26966 ms to find 0 implicit places.
[2024-06-01 15:04:27] [INFO ] Redundant transitions in 151 ms returned []
Running 2034 sub problems to find dead transitions.
[2024-06-01 15:04:27] [INFO ] Flow matrix only has 1998 transitions (discarded 40 similar events)
[2024-06-01 15:04:27] [INFO ] Invariant cache hit.
[2024-06-01 15:04:27] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/566 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2034 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 2034 unsolved
[2024-06-01 15:04:55] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 2 ms to minimize.
[2024-06-01 15:05:01] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 566/2568 variables, and 37 constraints, problems are : Problem set: 0 solved, 2034 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 24/33 constraints, State Equation: 0/570 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2034/2034 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2034 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/566 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2034 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 2034 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/566 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2034 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/566 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2034 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1148 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1349 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1366 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1382 is UNSAT
Problem TDEAD1383 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1390 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1396 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1401 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1403 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1409 is UNSAT
Problem TDEAD1410 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1423 is UNSAT
Problem TDEAD1426 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1430 is UNSAT
At refinement iteration 4 (OVERLAPS) 4/570 variables, 9/46 constraints. Problems are: Problem set: 540 solved, 1494 unsolved
[2024-06-01 15:05:38] [INFO ] Deduced a trap composed of 48 places in 476 ms of which 4 ms to minimize.
[2024-06-01 15:05:39] [INFO ] Deduced a trap composed of 47 places in 491 ms of which 4 ms to minimize.
[2024-06-01 15:05:39] [INFO ] Deduced a trap composed of 47 places in 446 ms of which 3 ms to minimize.
[2024-06-01 15:05:39] [INFO ] Deduced a trap composed of 47 places in 427 ms of which 3 ms to minimize.
[2024-06-01 15:05:40] [INFO ] Deduced a trap composed of 47 places in 412 ms of which 3 ms to minimize.
[2024-06-01 15:05:40] [INFO ] Deduced a trap composed of 47 places in 391 ms of which 5 ms to minimize.
[2024-06-01 15:05:41] [INFO ] Deduced a trap composed of 48 places in 401 ms of which 4 ms to minimize.
[2024-06-01 15:05:41] [INFO ] Deduced a trap composed of 270 places in 388 ms of which 3 ms to minimize.
SMT process timed out in 74018ms, After SMT, problems are : Problem set: 540 solved, 1494 unsolved
Search for dead transitions found 540 dead transitions in 74054ms
Found 540 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 540 transitions
Dead transitions reduction (with SMT) removed 540 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 570/840 places, 1498/2308 transitions.
Applied a total of 0 rules in 60 ms. Remains 570 /570 variables (removed 0) and now considering 1498/1498 (removed 0) transitions.
[2024-06-01 15:05:41] [INFO ] Redundant transitions in 142 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 154298 ms. Remains : 570/840 places, 1498/2308 transitions.
Stuttering acceptance computed with spot in 321 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J04T10-LTLCardinality-01
Product exploration explored 100000 steps with 13565 reset in 601 ms.
Product exploration explored 100000 steps with 13321 reset in 569 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 141 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 52 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 16 steps (0 resets) in 5 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 165 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 44 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0), (NOT p0)]
[2024-06-01 15:05:43] [INFO ] Flow matrix only has 1458 transitions (discarded 40 similar events)
// Phase 1: matrix 1458 rows 570 cols
[2024-06-01 15:05:43] [INFO ] Computed 44 invariants in 29 ms
[2024-06-01 15:05:44] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-06-01 15:05:44] [INFO ] [Real]Absence check using 12 positive and 32 generalized place invariants in 127 ms returned sat
[2024-06-01 15:05:45] [INFO ] [Real]Absence check using state equation in 1408 ms returned sat
[2024-06-01 15:05:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:05:46] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-06-01 15:05:46] [INFO ] [Nat]Absence check using 12 positive and 32 generalized place invariants in 105 ms returned sat
[2024-06-01 15:05:52] [INFO ] [Nat]Absence check using state equation in 5757 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1 out of 570 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 570/570 places, 1498/1498 transitions.
Applied a total of 0 rules in 36 ms. Remains 570 /570 variables (removed 0) and now considering 1498/1498 (removed 0) transitions.
Running 1494 sub problems to find dead transitions.
[2024-06-01 15:05:52] [INFO ] Flow matrix only has 1458 transitions (discarded 40 similar events)
[2024-06-01 15:05:52] [INFO ] Invariant cache hit.
[2024-06-01 15:05:52] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/566 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1494 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 1494 unsolved
[2024-06-01 15:06:06] [INFO ] Deduced a trap composed of 48 places in 363 ms of which 4 ms to minimize.
[2024-06-01 15:06:06] [INFO ] Deduced a trap composed of 47 places in 303 ms of which 3 ms to minimize.
[2024-06-01 15:06:06] [INFO ] Deduced a trap composed of 47 places in 307 ms of which 4 ms to minimize.
[2024-06-01 15:06:07] [INFO ] Deduced a trap composed of 47 places in 304 ms of which 3 ms to minimize.
[2024-06-01 15:06:07] [INFO ] Deduced a trap composed of 47 places in 310 ms of which 3 ms to minimize.
[2024-06-01 15:06:07] [INFO ] Deduced a trap composed of 266 places in 298 ms of which 4 ms to minimize.
[2024-06-01 15:06:07] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-06-01 15:06:07] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:06:07] [INFO ] Deduced a trap composed of 48 places in 36 ms of which 0 ms to minimize.
[2024-06-01 15:06:08] [INFO ] Deduced a trap composed of 220 places in 281 ms of which 4 ms to minimize.
[2024-06-01 15:06:08] [INFO ] Deduced a trap composed of 23 places in 241 ms of which 6 ms to minimize.
[2024-06-01 15:06:08] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 0 ms to minimize.
[2024-06-01 15:06:09] [INFO ] Deduced a trap composed of 263 places in 374 ms of which 4 ms to minimize.
[2024-06-01 15:06:09] [INFO ] Deduced a trap composed of 265 places in 350 ms of which 4 ms to minimize.
[2024-06-01 15:06:09] [INFO ] Deduced a trap composed of 259 places in 325 ms of which 4 ms to minimize.
[2024-06-01 15:06:10] [INFO ] Deduced a trap composed of 294 places in 296 ms of which 3 ms to minimize.
[2024-06-01 15:06:10] [INFO ] Deduced a trap composed of 282 places in 287 ms of which 3 ms to minimize.
[2024-06-01 15:06:10] [INFO ] Deduced a trap composed of 274 places in 291 ms of which 4 ms to minimize.
[2024-06-01 15:06:11] [INFO ] Deduced a trap composed of 274 places in 351 ms of which 4 ms to minimize.
[2024-06-01 15:06:11] [INFO ] Deduced a trap composed of 272 places in 327 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/566 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1494 unsolved
[2024-06-01 15:06:12] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 1 ms to minimize.
[2024-06-01 15:06:13] [INFO ] Deduced a trap composed of 266 places in 362 ms of which 4 ms to minimize.
[2024-06-01 15:06:14] [INFO ] Deduced a trap composed of 307 places in 297 ms of which 3 ms to minimize.
[2024-06-01 15:06:14] [INFO ] Deduced a trap composed of 84 places in 171 ms of which 2 ms to minimize.
[2024-06-01 15:06:14] [INFO ] Deduced a trap composed of 49 places in 128 ms of which 2 ms to minimize.
[2024-06-01 15:06:15] [INFO ] Deduced a trap composed of 317 places in 318 ms of which 4 ms to minimize.
SMT process timed out in 22532ms, After SMT, problems are : Problem set: 0 solved, 1494 unsolved
Search for dead transitions found 0 dead transitions in 22547ms
[2024-06-01 15:06:15] [INFO ] Flow matrix only has 1458 transitions (discarded 40 similar events)
[2024-06-01 15:06:15] [INFO ] Invariant cache hit.
[2024-06-01 15:06:15] [INFO ] Implicit Places using invariants in 606 ms returned []
[2024-06-01 15:06:15] [INFO ] Flow matrix only has 1458 transitions (discarded 40 similar events)
[2024-06-01 15:06:15] [INFO ] Invariant cache hit.
[2024-06-01 15:06:17] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 15:06:37] [INFO ] Implicit Places using invariants and state equation in 21707 ms returned []
Implicit Place search using SMT with State Equation took 22316 ms to find 0 implicit places.
[2024-06-01 15:06:37] [INFO ] Redundant transitions in 35 ms returned []
Running 1494 sub problems to find dead transitions.
[2024-06-01 15:06:37] [INFO ] Flow matrix only has 1458 transitions (discarded 40 similar events)
[2024-06-01 15:06:37] [INFO ] Invariant cache hit.
[2024-06-01 15:06:37] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/566 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1494 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 1494 unsolved
[2024-06-01 15:06:50] [INFO ] Deduced a trap composed of 48 places in 269 ms of which 4 ms to minimize.
[2024-06-01 15:06:50] [INFO ] Deduced a trap composed of 47 places in 284 ms of which 3 ms to minimize.
[2024-06-01 15:06:50] [INFO ] Deduced a trap composed of 47 places in 257 ms of which 3 ms to minimize.
[2024-06-01 15:06:51] [INFO ] Deduced a trap composed of 47 places in 258 ms of which 3 ms to minimize.
[2024-06-01 15:06:51] [INFO ] Deduced a trap composed of 47 places in 265 ms of which 3 ms to minimize.
[2024-06-01 15:06:51] [INFO ] Deduced a trap composed of 266 places in 289 ms of which 14 ms to minimize.
[2024-06-01 15:06:51] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:06:51] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 2 ms to minimize.
[2024-06-01 15:06:51] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 0 ms to minimize.
[2024-06-01 15:06:52] [INFO ] Deduced a trap composed of 220 places in 272 ms of which 3 ms to minimize.
[2024-06-01 15:06:52] [INFO ] Deduced a trap composed of 23 places in 246 ms of which 2 ms to minimize.
[2024-06-01 15:06:52] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 1 ms to minimize.
[2024-06-01 15:06:52] [INFO ] Deduced a trap composed of 263 places in 290 ms of which 5 ms to minimize.
[2024-06-01 15:06:53] [INFO ] Deduced a trap composed of 265 places in 268 ms of which 3 ms to minimize.
[2024-06-01 15:06:53] [INFO ] Deduced a trap composed of 259 places in 264 ms of which 3 ms to minimize.
[2024-06-01 15:06:53] [INFO ] Deduced a trap composed of 294 places in 270 ms of which 3 ms to minimize.
[2024-06-01 15:06:54] [INFO ] Deduced a trap composed of 282 places in 267 ms of which 3 ms to minimize.
[2024-06-01 15:06:54] [INFO ] Deduced a trap composed of 274 places in 262 ms of which 3 ms to minimize.
[2024-06-01 15:06:54] [INFO ] Deduced a trap composed of 274 places in 261 ms of which 3 ms to minimize.
[2024-06-01 15:06:54] [INFO ] Deduced a trap composed of 272 places in 264 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/566 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1494 unsolved
[2024-06-01 15:06:55] [INFO ] Deduced a trap composed of 49 places in 36 ms of which 1 ms to minimize.
[2024-06-01 15:06:56] [INFO ] Deduced a trap composed of 266 places in 255 ms of which 3 ms to minimize.
[2024-06-01 15:06:57] [INFO ] Deduced a trap composed of 307 places in 253 ms of which 3 ms to minimize.
[2024-06-01 15:06:57] [INFO ] Deduced a trap composed of 84 places in 146 ms of which 2 ms to minimize.
[2024-06-01 15:06:57] [INFO ] Deduced a trap composed of 49 places in 151 ms of which 2 ms to minimize.
[2024-06-01 15:06:57] [INFO ] Deduced a trap composed of 317 places in 258 ms of which 3 ms to minimize.
[2024-06-01 15:06:58] [INFO ] Deduced a trap composed of 366 places in 242 ms of which 3 ms to minimize.
[2024-06-01 15:06:58] [INFO ] Deduced a trap composed of 313 places in 249 ms of which 3 ms to minimize.
[2024-06-01 15:06:58] [INFO ] Deduced a trap composed of 272 places in 263 ms of which 3 ms to minimize.
[2024-06-01 15:06:59] [INFO ] Deduced a trap composed of 277 places in 240 ms of which 3 ms to minimize.
[2024-06-01 15:07:00] [INFO ] Deduced a trap composed of 291 places in 552 ms of which 2 ms to minimize.
[2024-06-01 15:07:00] [INFO ] Deduced a trap composed of 262 places in 276 ms of which 3 ms to minimize.
[2024-06-01 15:07:00] [INFO ] Deduced a trap composed of 293 places in 244 ms of which 3 ms to minimize.
[2024-06-01 15:07:00] [INFO ] Deduced a trap composed of 304 places in 264 ms of which 5 ms to minimize.
[2024-06-01 15:07:01] [INFO ] Deduced a trap composed of 194 places in 272 ms of which 3 ms to minimize.
[2024-06-01 15:07:01] [INFO ] Deduced a trap composed of 276 places in 278 ms of which 3 ms to minimize.
[2024-06-01 15:07:01] [INFO ] Deduced a trap composed of 275 places in 247 ms of which 3 ms to minimize.
[2024-06-01 15:07:02] [INFO ] Deduced a trap composed of 266 places in 267 ms of which 3 ms to minimize.
[2024-06-01 15:07:02] [INFO ] Deduced a trap composed of 270 places in 267 ms of which 3 ms to minimize.
[2024-06-01 15:07:02] [INFO ] Deduced a trap composed of 282 places in 251 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/566 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1494 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 566/2028 variables, and 79 constraints, problems are : Problem set: 0 solved, 1494 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 27/32 constraints, State Equation: 0/570 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1494/1494 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1494 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/566 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1494 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 1494 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/566 variables, 40/79 constraints. Problems are: Problem set: 0 solved, 1494 unsolved
[2024-06-01 15:07:20] [INFO ] Deduced a trap composed of 287 places in 335 ms of which 4 ms to minimize.
[2024-06-01 15:07:21] [INFO ] Deduced a trap composed of 264 places in 307 ms of which 2 ms to minimize.
[2024-06-01 15:07:21] [INFO ] Deduced a trap composed of 223 places in 304 ms of which 2 ms to minimize.
[2024-06-01 15:07:21] [INFO ] Deduced a trap composed of 212 places in 251 ms of which 3 ms to minimize.
[2024-06-01 15:07:21] [INFO ] Deduced a trap composed of 297 places in 250 ms of which 3 ms to minimize.
[2024-06-01 15:07:22] [INFO ] Deduced a trap composed of 212 places in 284 ms of which 3 ms to minimize.
[2024-06-01 15:07:22] [INFO ] Deduced a trap composed of 310 places in 253 ms of which 3 ms to minimize.
[2024-06-01 15:07:22] [INFO ] Deduced a trap composed of 284 places in 249 ms of which 3 ms to minimize.
[2024-06-01 15:07:23] [INFO ] Deduced a trap composed of 295 places in 269 ms of which 3 ms to minimize.
[2024-06-01 15:07:23] [INFO ] Deduced a trap composed of 249 places in 251 ms of which 3 ms to minimize.
[2024-06-01 15:07:23] [INFO ] Deduced a trap composed of 254 places in 248 ms of which 2 ms to minimize.
[2024-06-01 15:07:23] [INFO ] Deduced a trap composed of 234 places in 257 ms of which 3 ms to minimize.
[2024-06-01 15:07:24] [INFO ] Deduced a trap composed of 249 places in 267 ms of which 3 ms to minimize.
[2024-06-01 15:07:24] [INFO ] Deduced a trap composed of 271 places in 247 ms of which 2 ms to minimize.
[2024-06-01 15:07:24] [INFO ] Deduced a trap composed of 283 places in 270 ms of which 3 ms to minimize.
[2024-06-01 15:07:25] [INFO ] Deduced a trap composed of 279 places in 264 ms of which 3 ms to minimize.
[2024-06-01 15:07:25] [INFO ] Deduced a trap composed of 266 places in 265 ms of which 3 ms to minimize.
[2024-06-01 15:07:25] [INFO ] Deduced a trap composed of 251 places in 248 ms of which 3 ms to minimize.
[2024-06-01 15:07:25] [INFO ] Deduced a trap composed of 249 places in 250 ms of which 3 ms to minimize.
[2024-06-01 15:07:26] [INFO ] Deduced a trap composed of 246 places in 274 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/566 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 1494 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 566/2028 variables, and 99 constraints, problems are : Problem set: 0 solved, 1494 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 27/32 constraints, State Equation: 0/570 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1494 constraints, Known Traps: 60/60 constraints]
After SMT, in 62204ms problems are : Problem set: 0 solved, 1494 unsolved
Search for dead transitions found 0 dead transitions in 62216ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 107163 ms. Remains : 570/570 places, 1498/1498 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 165 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 79 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 13 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 162 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 90 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
[2024-06-01 15:07:40] [INFO ] Flow matrix only has 1458 transitions (discarded 40 similar events)
[2024-06-01 15:07:40] [INFO ] Invariant cache hit.
[2024-06-01 15:07:41] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2024-06-01 15:07:41] [INFO ] [Real]Absence check using 12 positive and 32 generalized place invariants in 132 ms returned sat
[2024-06-01 15:07:43] [INFO ] [Real]Absence check using state equation in 2154 ms returned sat
[2024-06-01 15:07:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:07:44] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-06-01 15:07:44] [INFO ] [Nat]Absence check using 12 positive and 32 generalized place invariants in 63 ms returned sat
[2024-06-01 15:07:48] [INFO ] [Nat]Absence check using state equation in 4450 ms returned sat
[2024-06-01 15:07:48] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 15:07:50] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 15:07:51] [INFO ] [Nat]Added 200 Read/Feed constraints in 2875 ms returned sat
[2024-06-01 15:07:51] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2024-06-01 15:07:52] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:07:52] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:07:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1125 ms
[2024-06-01 15:07:52] [INFO ] Computed and/alt/rep : 624/2764/594 causal constraints (skipped 860 transitions) in 127 ms.
[2024-06-01 15:07:54] [INFO ] Added : 49 causal constraints over 10 iterations in 2195 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13539 reset in 572 ms.
Product exploration explored 100000 steps with 13681 reset in 505 ms.
Support contains 1 out of 570 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 570/570 places, 1498/1498 transitions.
Applied a total of 0 rules in 24 ms. Remains 570 /570 variables (removed 0) and now considering 1498/1498 (removed 0) transitions.
Running 1494 sub problems to find dead transitions.
[2024-06-01 15:07:55] [INFO ] Flow matrix only has 1458 transitions (discarded 40 similar events)
[2024-06-01 15:07:55] [INFO ] Invariant cache hit.
[2024-06-01 15:07:56] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/566 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1494 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 1494 unsolved
[2024-06-01 15:08:08] [INFO ] Deduced a trap composed of 48 places in 254 ms of which 3 ms to minimize.
[2024-06-01 15:08:09] [INFO ] Deduced a trap composed of 47 places in 263 ms of which 2 ms to minimize.
[2024-06-01 15:08:09] [INFO ] Deduced a trap composed of 47 places in 269 ms of which 3 ms to minimize.
[2024-06-01 15:08:09] [INFO ] Deduced a trap composed of 47 places in 249 ms of which 3 ms to minimize.
[2024-06-01 15:08:09] [INFO ] Deduced a trap composed of 47 places in 256 ms of which 3 ms to minimize.
[2024-06-01 15:08:10] [INFO ] Deduced a trap composed of 266 places in 286 ms of which 3 ms to minimize.
[2024-06-01 15:08:10] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2024-06-01 15:08:10] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 1 ms to minimize.
[2024-06-01 15:08:10] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
[2024-06-01 15:08:10] [INFO ] Deduced a trap composed of 220 places in 239 ms of which 3 ms to minimize.
[2024-06-01 15:08:10] [INFO ] Deduced a trap composed of 23 places in 265 ms of which 2 ms to minimize.
[2024-06-01 15:08:10] [INFO ] Deduced a trap composed of 47 places in 29 ms of which 1 ms to minimize.
[2024-06-01 15:08:11] [INFO ] Deduced a trap composed of 263 places in 269 ms of which 3 ms to minimize.
[2024-06-01 15:08:11] [INFO ] Deduced a trap composed of 265 places in 253 ms of which 3 ms to minimize.
[2024-06-01 15:08:11] [INFO ] Deduced a trap composed of 259 places in 254 ms of which 3 ms to minimize.
[2024-06-01 15:08:12] [INFO ] Deduced a trap composed of 294 places in 259 ms of which 3 ms to minimize.
[2024-06-01 15:08:12] [INFO ] Deduced a trap composed of 282 places in 277 ms of which 2 ms to minimize.
[2024-06-01 15:08:12] [INFO ] Deduced a trap composed of 274 places in 251 ms of which 2 ms to minimize.
[2024-06-01 15:08:13] [INFO ] Deduced a trap composed of 274 places in 249 ms of which 2 ms to minimize.
[2024-06-01 15:08:13] [INFO ] Deduced a trap composed of 272 places in 258 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/566 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1494 unsolved
[2024-06-01 15:08:14] [INFO ] Deduced a trap composed of 49 places in 32 ms of which 1 ms to minimize.
[2024-06-01 15:08:14] [INFO ] Deduced a trap composed of 266 places in 260 ms of which 3 ms to minimize.
[2024-06-01 15:08:15] [INFO ] Deduced a trap composed of 307 places in 264 ms of which 2 ms to minimize.
[2024-06-01 15:08:15] [INFO ] Deduced a trap composed of 84 places in 135 ms of which 2 ms to minimize.
[2024-06-01 15:08:15] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 2 ms to minimize.
[2024-06-01 15:08:15] [INFO ] Deduced a trap composed of 317 places in 249 ms of which 3 ms to minimize.
[2024-06-01 15:08:16] [INFO ] Deduced a trap composed of 366 places in 250 ms of which 3 ms to minimize.
[2024-06-01 15:08:16] [INFO ] Deduced a trap composed of 313 places in 243 ms of which 3 ms to minimize.
[2024-06-01 15:08:16] [INFO ] Deduced a trap composed of 272 places in 242 ms of which 3 ms to minimize.
[2024-06-01 15:08:17] [INFO ] Deduced a trap composed of 277 places in 231 ms of which 4 ms to minimize.
[2024-06-01 15:08:17] [INFO ] Deduced a trap composed of 291 places in 239 ms of which 3 ms to minimize.
[2024-06-01 15:08:18] [INFO ] Deduced a trap composed of 262 places in 245 ms of which 2 ms to minimize.
[2024-06-01 15:08:18] [INFO ] Deduced a trap composed of 293 places in 252 ms of which 3 ms to minimize.
[2024-06-01 15:08:18] [INFO ] Deduced a trap composed of 304 places in 278 ms of which 3 ms to minimize.
SMT process timed out in 22661ms, After SMT, problems are : Problem set: 0 solved, 1494 unsolved
Search for dead transitions found 0 dead transitions in 22685ms
[2024-06-01 15:08:18] [INFO ] Flow matrix only has 1458 transitions (discarded 40 similar events)
[2024-06-01 15:08:18] [INFO ] Invariant cache hit.
[2024-06-01 15:08:19] [INFO ] Implicit Places using invariants in 539 ms returned []
[2024-06-01 15:08:19] [INFO ] Flow matrix only has 1458 transitions (discarded 40 similar events)
[2024-06-01 15:08:19] [INFO ] Invariant cache hit.
[2024-06-01 15:08:21] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 15:08:39] [INFO ] Implicit Places using invariants and state equation in 20491 ms returned []
Implicit Place search using SMT with State Equation took 21045 ms to find 0 implicit places.
[2024-06-01 15:08:39] [INFO ] Redundant transitions in 66 ms returned []
Running 1494 sub problems to find dead transitions.
[2024-06-01 15:08:39] [INFO ] Flow matrix only has 1458 transitions (discarded 40 similar events)
[2024-06-01 15:08:39] [INFO ] Invariant cache hit.
[2024-06-01 15:08:39] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/566 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1494 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 1494 unsolved
[2024-06-01 15:08:53] [INFO ] Deduced a trap composed of 48 places in 338 ms of which 3 ms to minimize.
[2024-06-01 15:08:53] [INFO ] Deduced a trap composed of 47 places in 310 ms of which 3 ms to minimize.
[2024-06-01 15:08:53] [INFO ] Deduced a trap composed of 47 places in 279 ms of which 3 ms to minimize.
[2024-06-01 15:08:54] [INFO ] Deduced a trap composed of 47 places in 256 ms of which 3 ms to minimize.
[2024-06-01 15:08:54] [INFO ] Deduced a trap composed of 47 places in 260 ms of which 3 ms to minimize.
[2024-06-01 15:08:54] [INFO ] Deduced a trap composed of 266 places in 326 ms of which 3 ms to minimize.
[2024-06-01 15:08:54] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2024-06-01 15:08:54] [INFO ] Deduced a trap composed of 48 places in 33 ms of which 0 ms to minimize.
[2024-06-01 15:08:55] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:08:55] [INFO ] Deduced a trap composed of 220 places in 357 ms of which 3 ms to minimize.
[2024-06-01 15:08:55] [INFO ] Deduced a trap composed of 23 places in 299 ms of which 4 ms to minimize.
[2024-06-01 15:08:55] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 1 ms to minimize.
[2024-06-01 15:08:56] [INFO ] Deduced a trap composed of 263 places in 371 ms of which 4 ms to minimize.
[2024-06-01 15:08:56] [INFO ] Deduced a trap composed of 265 places in 303 ms of which 3 ms to minimize.
[2024-06-01 15:08:57] [INFO ] Deduced a trap composed of 259 places in 323 ms of which 3 ms to minimize.
[2024-06-01 15:08:57] [INFO ] Deduced a trap composed of 294 places in 304 ms of which 3 ms to minimize.
[2024-06-01 15:08:57] [INFO ] Deduced a trap composed of 282 places in 292 ms of which 3 ms to minimize.
[2024-06-01 15:08:58] [INFO ] Deduced a trap composed of 274 places in 367 ms of which 4 ms to minimize.
[2024-06-01 15:08:58] [INFO ] Deduced a trap composed of 274 places in 322 ms of which 4 ms to minimize.
[2024-06-01 15:08:58] [INFO ] Deduced a trap composed of 272 places in 321 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/566 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1494 unsolved
[2024-06-01 15:08:59] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:09:00] [INFO ] Deduced a trap composed of 266 places in 334 ms of which 3 ms to minimize.
[2024-06-01 15:09:01] [INFO ] Deduced a trap composed of 307 places in 289 ms of which 3 ms to minimize.
[2024-06-01 15:09:01] [INFO ] Deduced a trap composed of 84 places in 159 ms of which 2 ms to minimize.
[2024-06-01 15:09:01] [INFO ] Deduced a trap composed of 49 places in 127 ms of which 1 ms to minimize.
[2024-06-01 15:09:01] [INFO ] Deduced a trap composed of 317 places in 325 ms of which 4 ms to minimize.
[2024-06-01 15:09:02] [INFO ] Deduced a trap composed of 366 places in 299 ms of which 3 ms to minimize.
[2024-06-01 15:09:02] [INFO ] Deduced a trap composed of 313 places in 268 ms of which 3 ms to minimize.
[2024-06-01 15:09:02] [INFO ] Deduced a trap composed of 272 places in 246 ms of which 3 ms to minimize.
[2024-06-01 15:09:03] [INFO ] Deduced a trap composed of 277 places in 227 ms of which 3 ms to minimize.
[2024-06-01 15:09:03] [INFO ] Deduced a trap composed of 291 places in 296 ms of which 3 ms to minimize.
[2024-06-01 15:09:04] [INFO ] Deduced a trap composed of 262 places in 266 ms of which 3 ms to minimize.
[2024-06-01 15:09:04] [INFO ] Deduced a trap composed of 293 places in 244 ms of which 3 ms to minimize.
[2024-06-01 15:09:04] [INFO ] Deduced a trap composed of 304 places in 464 ms of which 4 ms to minimize.
[2024-06-01 15:09:05] [INFO ] Deduced a trap composed of 194 places in 318 ms of which 3 ms to minimize.
[2024-06-01 15:09:05] [INFO ] Deduced a trap composed of 276 places in 279 ms of which 3 ms to minimize.
[2024-06-01 15:09:05] [INFO ] Deduced a trap composed of 275 places in 264 ms of which 3 ms to minimize.
[2024-06-01 15:09:06] [INFO ] Deduced a trap composed of 266 places in 260 ms of which 3 ms to minimize.
[2024-06-01 15:09:06] [INFO ] Deduced a trap composed of 270 places in 250 ms of which 3 ms to minimize.
[2024-06-01 15:09:06] [INFO ] Deduced a trap composed of 282 places in 230 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/566 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1494 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 566/2028 variables, and 79 constraints, problems are : Problem set: 0 solved, 1494 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 27/32 constraints, State Equation: 0/570 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1494/1494 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1494 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/566 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1494 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 1494 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/566 variables, 40/79 constraints. Problems are: Problem set: 0 solved, 1494 unsolved
[2024-06-01 15:09:24] [INFO ] Deduced a trap composed of 287 places in 305 ms of which 4 ms to minimize.
[2024-06-01 15:09:24] [INFO ] Deduced a trap composed of 264 places in 274 ms of which 3 ms to minimize.
[2024-06-01 15:09:24] [INFO ] Deduced a trap composed of 223 places in 343 ms of which 3 ms to minimize.
[2024-06-01 15:09:25] [INFO ] Deduced a trap composed of 212 places in 274 ms of which 3 ms to minimize.
[2024-06-01 15:09:25] [INFO ] Deduced a trap composed of 297 places in 277 ms of which 3 ms to minimize.
[2024-06-01 15:09:25] [INFO ] Deduced a trap composed of 212 places in 281 ms of which 4 ms to minimize.
[2024-06-01 15:09:25] [INFO ] Deduced a trap composed of 310 places in 254 ms of which 3 ms to minimize.
[2024-06-01 15:09:26] [INFO ] Deduced a trap composed of 284 places in 266 ms of which 4 ms to minimize.
[2024-06-01 15:09:26] [INFO ] Deduced a trap composed of 295 places in 271 ms of which 14 ms to minimize.
[2024-06-01 15:09:26] [INFO ] Deduced a trap composed of 249 places in 273 ms of which 4 ms to minimize.
[2024-06-01 15:09:27] [INFO ] Deduced a trap composed of 254 places in 289 ms of which 3 ms to minimize.
[2024-06-01 15:09:27] [INFO ] Deduced a trap composed of 234 places in 258 ms of which 3 ms to minimize.
[2024-06-01 15:09:27] [INFO ] Deduced a trap composed of 249 places in 260 ms of which 3 ms to minimize.
[2024-06-01 15:09:27] [INFO ] Deduced a trap composed of 271 places in 244 ms of which 3 ms to minimize.
[2024-06-01 15:09:28] [INFO ] Deduced a trap composed of 283 places in 354 ms of which 4 ms to minimize.
[2024-06-01 15:09:28] [INFO ] Deduced a trap composed of 279 places in 260 ms of which 3 ms to minimize.
[2024-06-01 15:09:28] [INFO ] Deduced a trap composed of 266 places in 264 ms of which 3 ms to minimize.
[2024-06-01 15:09:29] [INFO ] Deduced a trap composed of 251 places in 261 ms of which 3 ms to minimize.
[2024-06-01 15:09:29] [INFO ] Deduced a trap composed of 249 places in 336 ms of which 3 ms to minimize.
[2024-06-01 15:09:29] [INFO ] Deduced a trap composed of 246 places in 320 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/566 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 1494 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 566/2028 variables, and 99 constraints, problems are : Problem set: 0 solved, 1494 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 27/32 constraints, State Equation: 0/570 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1494 constraints, Known Traps: 60/60 constraints]
After SMT, in 63405ms problems are : Problem set: 0 solved, 1494 unsolved
Search for dead transitions found 0 dead transitions in 63427ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 107263 ms. Remains : 570/570 places, 1498/1498 transitions.
Treatment of property PolyORBLF-PT-S04J04T10-LTLCardinality-01 finished in 396208 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U G(p1))))'
Support contains 40 out of 840 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 840/840 places, 2308/2308 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 838 transition count 2306
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 838 transition count 2306
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 836 transition count 2304
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 836 transition count 2304
Applied a total of 8 rules in 49 ms. Remains 836 /840 variables (removed 4) and now considering 2304/2308 (removed 4) transitions.
Running 2300 sub problems to find dead transitions.
[2024-06-01 15:09:43] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
// Phase 1: matrix 2264 rows 836 cols
[2024-06-01 15:09:43] [INFO ] Computed 44 invariants in 47 ms
[2024-06-01 15:09:43] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
SMT process timed out in 33055ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 33076ms
[2024-06-01 15:10:16] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-06-01 15:10:16] [INFO ] Invariant cache hit.
[2024-06-01 15:10:17] [INFO ] Implicit Places using invariants in 691 ms returned []
[2024-06-01 15:10:17] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-06-01 15:10:17] [INFO ] Invariant cache hit.
[2024-06-01 15:10:18] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 15:10:48] [INFO ] Performed 750/836 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 15:10:51] [INFO ] Implicit Places using invariants and state equation in 33554 ms returned []
Implicit Place search using SMT with State Equation took 34253 ms to find 0 implicit places.
Running 2300 sub problems to find dead transitions.
[2024-06-01 15:10:51] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
[2024-06-01 15:10:51] [INFO ] Invariant cache hit.
[2024-06-01 15:10:51] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/832 variables, 26/39 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
[2024-06-01 15:11:26] [INFO ] Deduced a trap composed of 59 places in 218 ms of which 2 ms to minimize.
[2024-06-01 15:11:27] [INFO ] Deduced a trap composed of 162 places in 310 ms of which 4 ms to minimize.
[2024-06-01 15:11:28] [INFO ] Deduced a trap composed of 217 places in 324 ms of which 4 ms to minimize.
[2024-06-01 15:11:31] [INFO ] Deduced a trap composed of 427 places in 362 ms of which 3 ms to minimize.
[2024-06-01 15:11:31] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 20 ms to minimize.
[2024-06-01 15:11:32] [INFO ] Deduced a trap composed of 426 places in 340 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 832/3100 variables, and 45 constraints, problems are : Problem set: 0 solved, 2300 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 26/30 constraints, State Equation: 0/836 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2300/2300 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/832 variables, 26/39 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/832 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 832/3100 variables, and 45 constraints, problems are : Problem set: 0 solved, 2300 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 26/30 constraints, State Equation: 0/836 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2300 constraints, Known Traps: 6/6 constraints]
After SMT, in 73903ms problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 73974ms
Starting structural reductions in LTL mode, iteration 1 : 836/840 places, 2304/2308 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 141363 ms. Remains : 836/840 places, 2304/2308 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J04T10-LTLCardinality-04
Product exploration explored 100000 steps with 2 reset in 529 ms.
Stack based approach found an accepted trace after 4623 steps with 0 reset with depth 4624 and stack size 4624 in 28 ms.
FORMULA PolyORBLF-PT-S04J04T10-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-PT-S04J04T10-LTLCardinality-04 finished in 142052 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 840 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 840/840 places, 2308/2308 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 840 transition count 2245
Reduce places removed 63 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 73 rules applied. Total rules applied 136 place count 777 transition count 2235
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 146 place count 767 transition count 2235
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 146 place count 767 transition count 2135
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 346 place count 667 transition count 2135
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 347 place count 666 transition count 2134
Iterating global reduction 3 with 1 rules applied. Total rules applied 348 place count 666 transition count 2134
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 548 place count 566 transition count 2034
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 553 place count 561 transition count 2029
Iterating global reduction 3 with 5 rules applied. Total rules applied 558 place count 561 transition count 2029
Applied a total of 558 rules in 232 ms. Remains 561 /840 variables (removed 279) and now considering 2029/2308 (removed 279) transitions.
Running 2025 sub problems to find dead transitions.
[2024-06-01 15:12:06] [INFO ] Flow matrix only has 1989 transitions (discarded 40 similar events)
// Phase 1: matrix 1989 rows 561 cols
[2024-06-01 15:12:06] [INFO ] Computed 44 invariants in 52 ms
[2024-06-01 15:12:06] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/557 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/557 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-06-01 15:12:31] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 2 ms to minimize.
[2024-06-01 15:12:37] [INFO ] Deduced a trap composed of 59 places in 110 ms of which 1 ms to minimize.
[2024-06-01 15:12:37] [INFO ] Deduced a trap composed of 43 places in 137 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 557/2550 variables, and 38 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 23/30 constraints, State Equation: 0/561 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/557 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/557 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-06-01 15:12:43] [INFO ] Deduced a trap composed of 47 places in 308 ms of which 2 ms to minimize.
[2024-06-01 15:12:43] [INFO ] Deduced a trap composed of 46 places in 306 ms of which 2 ms to minimize.
[2024-06-01 15:12:44] [INFO ] Deduced a trap composed of 46 places in 309 ms of which 3 ms to minimize.
[2024-06-01 15:12:44] [INFO ] Deduced a trap composed of 47 places in 86 ms of which 1 ms to minimize.
[2024-06-01 15:12:44] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:12:44] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:12:44] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 0 ms to minimize.
[2024-06-01 15:12:45] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 0 ms to minimize.
[2024-06-01 15:12:46] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 1 ms to minimize.
[2024-06-01 15:12:49] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 0 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 557/2550 variables, and 48 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 23/30 constraints, State Equation: 0/561 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 13/13 constraints]
After SMT, in 52732ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 52747ms
[2024-06-01 15:12:58] [INFO ] Flow matrix only has 1989 transitions (discarded 40 similar events)
[2024-06-01 15:12:58] [INFO ] Invariant cache hit.
[2024-06-01 15:12:59] [INFO ] Implicit Places using invariants in 855 ms returned []
[2024-06-01 15:12:59] [INFO ] Flow matrix only has 1989 transitions (discarded 40 similar events)
[2024-06-01 15:12:59] [INFO ] Invariant cache hit.
[2024-06-01 15:13:00] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 15:13:21] [INFO ] Implicit Places using invariants and state equation in 21646 ms returned []
Implicit Place search using SMT with State Equation took 22515 ms to find 0 implicit places.
[2024-06-01 15:13:21] [INFO ] Redundant transitions in 102 ms returned []
Running 2025 sub problems to find dead transitions.
[2024-06-01 15:13:21] [INFO ] Flow matrix only has 1989 transitions (discarded 40 similar events)
[2024-06-01 15:13:21] [INFO ] Invariant cache hit.
[2024-06-01 15:13:21] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/557 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/557 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-06-01 15:13:47] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 2 ms to minimize.
[2024-06-01 15:13:58] [INFO ] Deduced a trap composed of 44 places in 116 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 557/2550 variables, and 37 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 23/30 constraints, State Equation: 0/561 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2025/2025 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/557 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/557 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-06-01 15:14:08] [INFO ] Deduced a trap composed of 46 places in 352 ms of which 3 ms to minimize.
[2024-06-01 15:14:08] [INFO ] Deduced a trap composed of 64 places in 223 ms of which 3 ms to minimize.
[2024-06-01 15:14:08] [INFO ] Deduced a trap composed of 47 places in 234 ms of which 2 ms to minimize.
[2024-06-01 15:14:08] [INFO ] Deduced a trap composed of 46 places in 210 ms of which 15 ms to minimize.
[2024-06-01 15:14:09] [INFO ] Deduced a trap composed of 47 places in 231 ms of which 3 ms to minimize.
[2024-06-01 15:14:09] [INFO ] Deduced a trap composed of 48 places in 202 ms of which 3 ms to minimize.
[2024-06-01 15:14:09] [INFO ] Deduced a trap composed of 54 places in 204 ms of which 2 ms to minimize.
[2024-06-01 15:14:09] [INFO ] Deduced a trap composed of 46 places in 189 ms of which 2 ms to minimize.
[2024-06-01 15:14:09] [INFO ] Deduced a trap composed of 54 places in 182 ms of which 3 ms to minimize.
[2024-06-01 15:14:10] [INFO ] Deduced a trap composed of 54 places in 207 ms of which 2 ms to minimize.
[2024-06-01 15:14:10] [INFO ] Deduced a trap composed of 42 places in 180 ms of which 2 ms to minimize.
[2024-06-01 15:14:10] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-06-01 15:14:12] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 1 ms to minimize.
[2024-06-01 15:14:12] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 0 ms to minimize.
[2024-06-01 15:14:12] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 0 ms to minimize.
[2024-06-01 15:14:20] [INFO ] Deduced a trap composed of 39 places in 255 ms of which 3 ms to minimize.
[2024-06-01 15:14:20] [INFO ] Deduced a trap composed of 55 places in 154 ms of which 2 ms to minimize.
[2024-06-01 15:14:20] [INFO ] Deduced a trap composed of 87 places in 155 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/557 variables, 18/55 constraints. Problems are: Problem set: 0 solved, 2025 unsolved
[2024-06-01 15:14:28] [INFO ] Deduced a trap composed of 23 places in 287 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 557/2550 variables, and 56 constraints, problems are : Problem set: 0 solved, 2025 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 23/30 constraints, State Equation: 0/561 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2025 constraints, Known Traps: 21/21 constraints]
After SMT, in 73380ms problems are : Problem set: 0 solved, 2025 unsolved
Search for dead transitions found 0 dead transitions in 73402ms
Starting structural reductions in SI_LTL mode, iteration 1 : 561/840 places, 2029/2308 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 149042 ms. Remains : 561/840 places, 2029/2308 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J04T10-LTLCardinality-09
Product exploration explored 100000 steps with 163 reset in 588 ms.
Product exploration explored 100000 steps with 148 reset in 544 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 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 1560 steps (1 resets) in 19 ms. (78 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 73 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 41 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 561/561 places, 2029/2029 transitions.
Applied a total of 0 rules in 33 ms. Remains 561 /561 variables (removed 0) and now considering 2029/2029 (removed 0) transitions.
Running 2025 sub problems to find dead transitions.
[2024-06-01 15:14:36] [INFO ] Flow matrix only has 1989 transitions (discarded 40 similar events)
[2024-06-01 15:14:36] [INFO ] Invariant cache hit.
[2024-06-01 15:14:36] [INFO ] State equation strengthened by 200 read => feed constraints.
FORMULA PolyORBLF-PT-S04J04T10-LTLCardinality-00 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : PolyORBLF-PT-S04J04T10-LTLCardinality-01
FORMULA PolyORBLF-PT-S04J04T10-LTLCardinality-02 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : PolyORBLF-PT-S04J04T10-LTLCardinality-03
FORMULA PolyORBLF-PT-S04J04T10-LTLCardinality-04 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J04T10-LTLCardinality-05 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J04T10-LTLCardinality-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J04T10-LTLCardinality-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J04T10-LTLCardinality-08 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : PolyORBLF-PT-S04J04T10-LTLCardinality-09
FORMULA PolyORBLF-PT-S04J04T10-LTLCardinality-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J04T10-LTLCardinality-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J04T10-LTLCardinality-12 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J04T10-LTLCardinality-13 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J04T10-LTLCardinality-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J04T10-LTLCardinality-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717255572902

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

+ 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name PolyORBLF-PT-S04J04T10-LTLCardinality-00
ltl formula formula --ltl=/tmp/1612/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 870 places, 5034 transitions and 34774 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.010 real 0.320 user 0.330 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1612/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1612/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1612/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1612/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 891 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 871, there are 5035 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 1
pnml2lts-mc( 0/ 4): unique transitions count: 0
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4 states 4 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 784.0 B/state, compr.: 22.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5151 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S04J04T10-LTLCardinality-01
ltl formula formula --ltl=/tmp/1612/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 870 places, 5034 transitions and 34774 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.010 real 0.270 user 0.200 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1612/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1612/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1612/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1612/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 891 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 871, there are 5040 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~94 levels ~10000 states ~23440 transitions
pnml2lts-mc( 0/ 4): ~94 levels ~20000 states ~49288 transitions
pnml2lts-mc( 3/ 4): ~93 levels ~40000 states ~104000 transitions
pnml2lts-mc( 3/ 4): ~93 levels ~80000 states ~216004 transitions
pnml2lts-mc( 3/ 4): ~100 levels ~160000 states ~434064 transitions
pnml2lts-mc( 1/ 4): ~136 levels ~320000 states ~855572 transitions
pnml2lts-mc( 3/ 4): ~100 levels ~640000 states ~1820536 transitions
pnml2lts-mc( 3/ 4): ~100 levels ~1280000 states ~3844436 transitions
ltl formula name PolyORBLF-PT-S04J04T10-LTLCardinality-02
ltl formula formula --ltl=/tmp/1612/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 870 places, 5034 transitions and 34774 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.750 real 0.280 user 0.210 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1612/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1612/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1612/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1612/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 890 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 871, there are 5039 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 5
pnml2lts-mc( 0/ 4): unique states count: 5
pnml2lts-mc( 0/ 4): unique transitions count: 4
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 1
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 13
pnml2lts-mc( 0/ 4): - cum. max stack depth: 8
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 13 states 20 transitions, fanout: 1.538
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 270.4 B/state, compr.: 7.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5151 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S04J04T10-LTLCardinality-03
ltl formula formula --ltl=/tmp/1612/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 870 places, 5034 transitions and 34774 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.650 real 0.290 user 0.180 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1612/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1612/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1612/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1612/ltl_3_
ltl formula name PolyORBLF-PT-S04J04T10-LTLCardinality-04
ltl formula formula --ltl=/tmp/1612/ltl_4_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 870 places, 5034 transitions and 34774 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.640 real 0.270 user 0.190 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1612/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1612/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1612/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1612/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 890 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 871, there are 5048 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~641!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 28
pnml2lts-mc( 0/ 4): unique states count: 2405
pnml2lts-mc( 0/ 4): unique transitions count: 12384
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 2409
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2381
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2409 states 12420 transitions, fanout: 5.156
pnml2lts-mc( 0/ 4): Total exploration time 0.390 sec (0.390 sec minimum, 0.390 sec on average)
pnml2lts-mc( 0/ 4): States per second: 6177, Transitions per second: 31846
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.4MB, 34.5 B/state, compr.: 1.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5151 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.4MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S04J04T10-LTLCardinality-05
ltl formula formula --ltl=/tmp/1612/ltl_5_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 870 places, 5034 transitions and 34774 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.680 real 0.220 user 0.180 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1612/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1612/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1612/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1612/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 890 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 871, there are 5040 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 1
pnml2lts-mc( 0/ 4): unique transitions count: 0
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4 states 4 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.000 sec minimum, 0.002 sec on average)
pnml2lts-mc( 0/ 4): States per second: 400, Transitions per second: 400
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 784.0 B/state, compr.: 22.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5151 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S04J04T10-LTLCardinality-06
ltl formula formula --ltl=/tmp/1612/ltl_6_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 870 places, 5034 transitions and 34774 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.670 real 0.190 user 0.250 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1612/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1612/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1612/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1612/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 891 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 871, there are 5040 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~788!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 2972
pnml2lts-mc( 0/ 4): unique transitions count: 7228
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 2976
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2976
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2976 states 7248 transitions, fanout: 2.435
pnml2lts-mc( 0/ 4): Total exploration time 0.420 sec (0.420 sec minimum, 0.420 sec on average)
pnml2lts-mc( 0/ 4): States per second: 7086, Transitions per second: 17257
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.3MB, 46.9 B/state, compr.: 1.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5151 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.3MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S04J04T10-LTLCardinality-07
ltl formula formula --ltl=/tmp/1612/ltl_7_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 870 places, 5034 transitions and 34774 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.620 real 0.230 user 0.220 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1612/ltl_7_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1612/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1612/ltl_7_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1612/ltl_7_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 891 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 871, there are 5040 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~250!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 730
pnml2lts-mc( 0/ 4): unique transitions count: 1632
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 734
pnml2lts-mc( 0/ 4): - cum. max stack depth: 734
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 734 states 1652 transitions, fanout: 2.251
pnml2lts-mc( 0/ 4): Total exploration time 0.140 sec (0.140 sec minimum, 0.140 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5243, Transitions per second: 11800
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 56.0 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5151 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S04J04T10-LTLCardinality-08
ltl formula formula --ltl=/tmp/1612/ltl_8_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 870 places, 5034 transitions and 34774 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.640 real 0.270 user 0.180 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1612/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1612/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1612/ltl_8_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1612/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 891 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 871, there are 5039 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 1
pnml2lts-mc( 0/ 4): unique transitions count: 0
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4 states 4 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 784.0 B/state, compr.: 22.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5151 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S04J04T10-LTLCardinality-09
ltl formula formula --ltl=/tmp/1612/ltl_9_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 870 places, 5034 transitions and 34774 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.700 real 0.260 user 0.170 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1612/ltl_9_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1612/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1612/ltl_9_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1612/ltl_9_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 891 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 871, there are 5037 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~2389 levels ~10000 states ~21572 transitions
pnml2lts-mc( 0/ 4): ~4797 levels ~20000 states ~42776 transitions
pnml2lts-mc( 0/ 4): ~9243 levels ~40000 states ~83828 transitions
pnml2lts-mc( 0/ 4): ~17804 levels ~80000 states ~157468 transitions
pnml2lts-mc( 0/ 4): ~34437 levels ~160000 states ~309572 transitions
pnml2lts-mc( 0/ 4): ~66069 levels ~320000 states ~613852 transitions
pnml2lts-mc( 2/ 4): ~106300 levels ~640000 states ~1300496 transitions
pnml2lts-mc( 0/ 4): ~249237 levels ~1280000 states ~2461380 transitions
ltl formula name PolyORBLF-PT-S04J04T10-LTLCardinality-10
ltl formula formula --ltl=/tmp/1612/ltl_10_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 870 places, 5034 transitions and 34774 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.710 real 0.240 user 0.210 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1612/ltl_10_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1612/ltl_10_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1612/ltl_10_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1612/ltl_10_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 891 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 871, there are 5040 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~1308!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 4978
pnml2lts-mc( 0/ 4): unique transitions count: 11236
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 17
pnml2lts-mc( 0/ 4): - claim success count: 4981
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4977
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4981 states 11252 transitions, fanout: 2.259
pnml2lts-mc( 0/ 4): Total exploration time 0.670 sec (0.670 sec minimum, 0.670 sec on average)
pnml2lts-mc( 0/ 4): States per second: 7434, Transitions per second: 16794
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.5MB, 47.4 B/state, compr.: 1.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5151 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.5MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S04J04T10-LTLCardinality-11
ltl formula formula --ltl=/tmp/1612/ltl_11_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 870 places, 5034 transitions and 34774 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.690 real 0.220 user 0.200 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1612/ltl_11_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1612/ltl_11_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1612/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1612/ltl_11_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 891 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 871, there are 5051 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~645!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 2101
pnml2lts-mc( 0/ 4): unique transitions count: 5269
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 2105
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2105
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2105 states 5289 transitions, fanout: 2.513
pnml2lts-mc( 0/ 4): Total exploration time 0.330 sec (0.330 sec minimum, 0.330 sec on average)
pnml2lts-mc( 0/ 4): States per second: 6379, Transitions per second: 16027
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 50.0 B/state, compr.: 1.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5151 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S04J04T10-LTLCardinality-12
ltl formula formula --ltl=/tmp/1612/ltl_12_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 870 places, 5034 transitions and 34774 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.640 real 0.250 user 0.190 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1612/ltl_12_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1612/ltl_12_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1612/ltl_12_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1612/ltl_12_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 891 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 871, there are 5042 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 1
pnml2lts-mc( 0/ 4): unique transitions count: 0
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4 states 4 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.000 sec minimum, 0.002 sec on average)
pnml2lts-mc( 0/ 4): States per second: 400, Transitions per second: 400
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 784.0 B/state, compr.: 22.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5151 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S04J04T10-LTLCardinality-13
ltl formula formula --ltl=/tmp/1612/ltl_13_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 870 places, 5034 transitions and 34774 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.750 real 0.230 user 0.220 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1612/ltl_13_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1612/ltl_13_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1612/ltl_13_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1612/ltl_13_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 891 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 871, there are 5035 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 1
pnml2lts-mc( 0/ 4): unique transitions count: 0
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4 states 4 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 784.0 B/state, compr.: 22.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5151 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S04J04T10-LTLCardinality-14
ltl formula formula --ltl=/tmp/1612/ltl_14_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 870 places, 5034 transitions and 34774 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.730 real 0.260 user 0.200 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1612/ltl_14_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1612/ltl_14_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1612/ltl_14_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1612/ltl_14_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 891 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 871, there are 5037 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~585!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 2043
pnml2lts-mc( 0/ 4): unique transitions count: 4801
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 2048
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2048
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2048 states 4825 transitions, fanout: 2.356
pnml2lts-mc( 0/ 4): Total exploration time 0.360 sec (0.360 sec minimum, 0.360 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5689, Transitions per second: 13403
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 49.0 B/state, compr.: 1.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5151 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S04J04T10-LTLCardinality-15
ltl formula formula --ltl=/tmp/1612/ltl_15_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 870 places, 5034 transitions and 34774 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S04J04T10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.680 real 0.270 user 0.140 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1612/ltl_15_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1612/ltl_15_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1612/ltl_15_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1612/ltl_15_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 890 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 871, there are 5038 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~871!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 3691
pnml2lts-mc( 0/ 4): unique transitions count: 9104
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 3695
pnml2lts-mc( 0/ 4): - cum. max stack depth: 3695
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 3695 states 9124 transitions, fanout: 2.469
pnml2lts-mc( 0/ 4): Total exploration time 0.530 sec (0.530 sec minimum, 0.530 sec on average)
pnml2lts-mc( 0/ 4): States per second: 6972, Transitions per second: 17215
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.4MB, 47.5 B/state, compr.: 1.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5151 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.4MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S04J04T10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is PolyORBLF-PT-S04J04T10, 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 r516-tajo-171654446800283"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S04J04T10.tgz
mv PolyORBLF-PT-S04J04T10 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 ;