Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.0M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 12 18:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Apr 12 18:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 18:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Apr 12 18:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 2.5M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717178512177

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-040
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:01:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 18:01:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:01:53] [INFO ] Load time of PNML (sax parser for PT used): 220 ms
[2024-05-31 18:01:53] [INFO ] Transformed 3682 places.
[2024-05-31 18:01:53] [INFO ] Transformed 6720 transitions.
[2024-05-31 18:01:53] [INFO ] Parsed PT model containing 3682 places and 6720 transitions and 20000 arcs in 405 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA CANConstruction-PT-040-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 59 out of 3682 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3682/3682 places, 6720/6720 transitions.
Discarding 1503 places :
Symmetric choice reduction at 0 with 1503 rule applications. Total rules 1503 place count 2179 transition count 3714
Iterating global reduction 0 with 1503 rules applied. Total rules applied 3006 place count 2179 transition count 3714
Applied a total of 3006 rules in 450 ms. Remains 2179 /3682 variables (removed 1503) and now considering 3714/6720 (removed 3006) transitions.
// Phase 1: matrix 3714 rows 2179 cols
[2024-05-31 18:01:54] [INFO ] Computed 81 invariants in 68 ms
[2024-05-31 18:01:55] [INFO ] Implicit Places using invariants in 1436 ms returned [12, 26, 40, 54, 68, 82, 96, 110, 124, 138, 152, 166, 180, 194, 208, 222, 236, 250, 264, 278, 292, 306, 320, 334, 348, 362, 376, 390, 404, 418, 432, 446, 460, 474, 488, 502, 516, 530, 544, 558]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 1472 ms to find 40 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2139/3682 places, 3714/6720 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 2099 transition count 3674
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 2099 transition count 3674
Applied a total of 80 rules in 457 ms. Remains 2099 /2139 variables (removed 40) and now considering 3674/3714 (removed 40) transitions.
// Phase 1: matrix 3674 rows 2099 cols
[2024-05-31 18:01:56] [INFO ] Computed 41 invariants in 48 ms
[2024-05-31 18:01:57] [INFO ] Implicit Places using invariants in 1026 ms returned []
[2024-05-31 18:01:57] [INFO ] Invariant cache hit.
[2024-05-31 18:01:58] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 18:02:24] [INFO ] Implicit Places using invariants and state equation in 27059 ms returned []
Implicit Place search using SMT with State Equation took 28096 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 2099/3682 places, 3674/6720 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30494 ms. Remains : 2099/3682 places, 3674/6720 transitions.
Support contains 59 out of 2099 places after structural reductions.
[2024-05-31 18:02:24] [INFO ] Flatten gal took : 226 ms
[2024-05-31 18:02:25] [INFO ] Flatten gal took : 141 ms
[2024-05-31 18:02:25] [INFO ] Input system was already deterministic with 3674 transitions.
Support contains 58 out of 2099 places (down from 59) after GAL structural reductions.
RANDOM walk for 40000 steps (55 resets) in 2679 ms. (14 steps per ms) remains 1/39 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
[2024-05-31 18:02:26] [INFO ] Invariant cache hit.
[2024-05-31 18:02:26] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2058/2059 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 18:02:28] [INFO ] Deduced a trap composed of 5 places in 1529 ms of which 27 ms to minimize.
[2024-05-31 18:02:29] [INFO ] Deduced a trap composed of 5 places in 1347 ms of which 85 ms to minimize.
[2024-05-31 18:02:30] [INFO ] Deduced a trap composed of 5 places in 1236 ms of which 12 ms to minimize.
[2024-05-31 18:02:32] [INFO ] Deduced a trap composed of 5 places in 1228 ms of which 12 ms to minimize.
SMT process timed out in 5821ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2099 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2099/2099 places, 3674/3674 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 265 transitions
Trivial Post-agglo rules discarded 265 transitions
Performed 265 trivial Post agglomeration. Transition count delta: 265
Iterating post reduction 0 with 265 rules applied. Total rules applied 265 place count 2099 transition count 3409
Reduce places removed 265 places and 0 transitions.
Iterating post reduction 1 with 265 rules applied. Total rules applied 530 place count 1834 transition count 3409
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 530 place count 1834 transition count 3369
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 610 place count 1794 transition count 3369
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 626 place count 1778 transition count 3337
Iterating global reduction 2 with 16 rules applied. Total rules applied 642 place count 1778 transition count 3337
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 2 with 14 rules applied. Total rules applied 656 place count 1778 transition count 3323
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 670 place count 1764 transition count 3323
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 6 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 752 place count 1723 transition count 3282
Applied a total of 752 rules in 566 ms. Remains 1723 /2099 variables (removed 376) and now considering 3282/3674 (removed 392) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 568 ms. Remains : 1723/2099 places, 3282/3674 transitions.
RANDOM walk for 28051 steps (98 resets) in 433 ms. (64 steps per ms) remains 0/1 properties
Computed a total of 121 stabilizing places and 160 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0)||X(G(p1))))||(X(!p2) U ((!p0&&X(!p2))||X(G(!p2))))))'
Support contains 5 out of 2099 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2099/2099 places, 3674/3674 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 2083 transition count 3642
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 2083 transition count 3642
Applied a total of 32 rules in 389 ms. Remains 2083 /2099 variables (removed 16) and now considering 3642/3674 (removed 32) transitions.
// Phase 1: matrix 3642 rows 2083 cols
[2024-05-31 18:02:33] [INFO ] Computed 41 invariants in 27 ms
[2024-05-31 18:02:34] [INFO ] Implicit Places using invariants in 1100 ms returned []
[2024-05-31 18:02:34] [INFO ] Invariant cache hit.
[2024-05-31 18:02:35] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 18:03:00] [INFO ] Implicit Places using invariants and state equation in 25450 ms returned []
Implicit Place search using SMT with State Equation took 26560 ms to find 0 implicit places.
Running 3602 sub problems to find dead transitions.
[2024-05-31 18:03:00] [INFO ] Invariant cache hit.
[2024-05-31 18:03:00] [INFO ] State equation strengthened by 3160 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2082 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2082/5725 variables, and 41 constraints, problems are : Problem set: 0 solved, 3602 unsolved in 30096 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 0/2083 constraints, ReadFeed: 0/3160 constraints, PredecessorRefiner: 3602/3602 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2082 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3602 unsolved
[2024-05-31 18:03:53] [INFO ] Deduced a trap composed of 52 places in 819 ms of which 13 ms to minimize.
[2024-05-31 18:03:57] [INFO ] Deduced a trap composed of 52 places in 745 ms of which 13 ms to minimize.
[2024-05-31 18:03:58] [INFO ] Deduced a trap composed of 52 places in 646 ms of which 11 ms to minimize.
[2024-05-31 18:03:59] [INFO ] Deduced a trap composed of 52 places in 689 ms of which 11 ms to minimize.
[2024-05-31 18:03:59] [INFO ] Deduced a trap composed of 52 places in 682 ms of which 11 ms to minimize.
[2024-05-31 18:04:00] [INFO ] Deduced a trap composed of 52 places in 647 ms of which 10 ms to minimize.
[2024-05-31 18:04:01] [INFO ] Deduced a trap composed of 52 places in 662 ms of which 10 ms to minimize.
[2024-05-31 18:04:01] [INFO ] Deduced a trap composed of 52 places in 643 ms of which 10 ms to minimize.
[2024-05-31 18:04:02] [INFO ] Deduced a trap composed of 52 places in 639 ms of which 11 ms to minimize.
[2024-05-31 18:04:03] [INFO ] Deduced a trap composed of 52 places in 609 ms of which 10 ms to minimize.
SMT process timed out in 63065ms, After SMT, problems are : Problem set: 0 solved, 3602 unsolved
Search for dead transitions found 0 dead transitions in 63108ms
Starting structural reductions in LTL mode, iteration 1 : 2083/2099 places, 3642/3674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 90070 ms. Remains : 2083/2099 places, 3642/3674 transitions.
Stuttering acceptance computed with spot in 382 ms :[(NOT p0), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 1020 ms.
Product exploration explored 100000 steps with 50000 reset in 834 ms.
Computed a total of 121 stabilizing places and 160 stable transitions
Computed a total of 121 stabilizing places and 160 stable transitions
Detected a total of 121/2083 stabilizing places and 160/3642 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 23 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-040-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-040-LTLFireability-00 finished in 92456 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p1))))'
Support contains 4 out of 2099 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2099/2099 places, 3674/3674 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 2082 transition count 3640
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 2082 transition count 3640
Applied a total of 34 rules in 206 ms. Remains 2082 /2099 variables (removed 17) and now considering 3640/3674 (removed 34) transitions.
// Phase 1: matrix 3640 rows 2082 cols
[2024-05-31 18:04:05] [INFO ] Computed 41 invariants in 23 ms
[2024-05-31 18:04:06] [INFO ] Implicit Places using invariants in 1019 ms returned []
[2024-05-31 18:04:06] [INFO ] Invariant cache hit.
[2024-05-31 18:04:08] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 18:04:29] [INFO ] Implicit Places using invariants and state equation in 22552 ms returned []
Implicit Place search using SMT with State Equation took 23577 ms to find 0 implicit places.
Running 3600 sub problems to find dead transitions.
[2024-05-31 18:04:29] [INFO ] Invariant cache hit.
[2024-05-31 18:04:29] [INFO ] State equation strengthened by 3160 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2081 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2081/5722 variables, and 41 constraints, problems are : Problem set: 0 solved, 3600 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 0/2082 constraints, ReadFeed: 0/3160 constraints, PredecessorRefiner: 3600/3600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2081 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3600 unsolved
[2024-05-31 18:05:25] [INFO ] Deduced a trap composed of 52 places in 729 ms of which 12 ms to minimize.
[2024-05-31 18:05:26] [INFO ] Deduced a trap composed of 52 places in 694 ms of which 11 ms to minimize.
[2024-05-31 18:05:26] [INFO ] Deduced a trap composed of 52 places in 654 ms of which 11 ms to minimize.
[2024-05-31 18:05:27] [INFO ] Deduced a trap composed of 52 places in 626 ms of which 10 ms to minimize.
[2024-05-31 18:05:28] [INFO ] Deduced a trap composed of 52 places in 634 ms of which 11 ms to minimize.
[2024-05-31 18:05:28] [INFO ] Deduced a trap composed of 52 places in 621 ms of which 10 ms to minimize.
[2024-05-31 18:05:29] [INFO ] Deduced a trap composed of 52 places in 592 ms of which 10 ms to minimize.
[2024-05-31 18:05:30] [INFO ] Deduced a trap composed of 52 places in 619 ms of which 10 ms to minimize.
[2024-05-31 18:05:30] [INFO ] Deduced a trap composed of 52 places in 595 ms of which 10 ms to minimize.
[2024-05-31 18:05:31] [INFO ] Deduced a trap composed of 52 places in 576 ms of which 10 ms to minimize.
[2024-05-31 18:05:32] [INFO ] Deduced a trap composed of 52 places in 577 ms of which 11 ms to minimize.
[2024-05-31 18:05:32] [INFO ] Deduced a trap composed of 52 places in 545 ms of which 10 ms to minimize.
SMT process timed out in 63109ms, After SMT, problems are : Problem set: 0 solved, 3600 unsolved
Search for dead transitions found 0 dead transitions in 63151ms
Starting structural reductions in LTL mode, iteration 1 : 2082/2099 places, 3640/3674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86956 ms. Remains : 2082/2099 places, 3640/3674 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 774 ms.
Product exploration explored 100000 steps with 50000 reset in 791 ms.
Computed a total of 121 stabilizing places and 160 stable transitions
Computed a total of 121 stabilizing places and 160 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 99 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-040-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-040-LTLFireability-01 finished in 88778 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&X(G((!p1 U p2)))))&&F(p3)))'
Support contains 7 out of 2099 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2099/2099 places, 3674/3674 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 265 transitions
Trivial Post-agglo rules discarded 265 transitions
Performed 265 trivial Post agglomeration. Transition count delta: 265
Iterating post reduction 0 with 265 rules applied. Total rules applied 265 place count 2099 transition count 3409
Reduce places removed 265 places and 0 transitions.
Iterating post reduction 1 with 265 rules applied. Total rules applied 530 place count 1834 transition count 3409
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 530 place count 1834 transition count 3369
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 610 place count 1794 transition count 3369
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 626 place count 1778 transition count 3337
Iterating global reduction 2 with 16 rules applied. Total rules applied 642 place count 1778 transition count 3337
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 2 with 14 rules applied. Total rules applied 656 place count 1778 transition count 3323
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 670 place count 1764 transition count 3323
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 746 place count 1726 transition count 3285
Applied a total of 746 rules in 481 ms. Remains 1726 /2099 variables (removed 373) and now considering 3285/3674 (removed 389) transitions.
// Phase 1: matrix 3285 rows 1726 cols
[2024-05-31 18:05:34] [INFO ] Computed 41 invariants in 30 ms
[2024-05-31 18:05:35] [INFO ] Implicit Places using invariants in 972 ms returned []
[2024-05-31 18:05:35] [INFO ] Invariant cache hit.
[2024-05-31 18:05:36] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 18:05:55] [INFO ] Implicit Places using invariants and state equation in 19347 ms returned []
Implicit Place search using SMT with State Equation took 20326 ms to find 0 implicit places.
[2024-05-31 18:05:55] [INFO ] Redundant transitions in 189 ms returned []
Running 3245 sub problems to find dead transitions.
[2024-05-31 18:05:55] [INFO ] Invariant cache hit.
[2024-05-31 18:05:55] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1725 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1725/5011 variables, and 41 constraints, problems are : Problem set: 0 solved, 3245 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 0/1726 constraints, ReadFeed: 0/3160 constraints, PredecessorRefiner: 3245/3245 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3245 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1725 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3245 unsolved
[2024-05-31 18:06:29] [INFO ] Deduced a trap composed of 43 places in 631 ms of which 10 ms to minimize.
[2024-05-31 18:06:32] [INFO ] Deduced a trap composed of 43 places in 1234 ms of which 11 ms to minimize.
[2024-05-31 18:06:33] [INFO ] Deduced a trap composed of 44 places in 1208 ms of which 11 ms to minimize.
[2024-05-31 18:06:34] [INFO ] Deduced a trap composed of 44 places in 1134 ms of which 11 ms to minimize.
[2024-05-31 18:06:38] [INFO ] Deduced a trap composed of 43 places in 1172 ms of which 11 ms to minimize.
[2024-05-31 18:06:40] [INFO ] Deduced a trap composed of 44 places in 1198 ms of which 10 ms to minimize.
[2024-05-31 18:06:41] [INFO ] Deduced a trap composed of 43 places in 1094 ms of which 11 ms to minimize.
[2024-05-31 18:06:42] [INFO ] Deduced a trap composed of 43 places in 1206 ms of which 11 ms to minimize.
[2024-05-31 18:06:43] [INFO ] Deduced a trap composed of 43 places in 1129 ms of which 13 ms to minimize.
[2024-05-31 18:06:44] [INFO ] Deduced a trap composed of 43 places in 1162 ms of which 11 ms to minimize.
[2024-05-31 18:06:45] [INFO ] Deduced a trap composed of 45 places in 1083 ms of which 10 ms to minimize.
[2024-05-31 18:06:47] [INFO ] Deduced a trap composed of 45 places in 1087 ms of which 10 ms to minimize.
[2024-05-31 18:06:48] [INFO ] Deduced a trap composed of 43 places in 1142 ms of which 10 ms to minimize.
[2024-05-31 18:06:49] [INFO ] Deduced a trap composed of 51 places in 1195 ms of which 11 ms to minimize.
[2024-05-31 18:06:50] [INFO ] Deduced a trap composed of 43 places in 1207 ms of which 11 ms to minimize.
[2024-05-31 18:06:51] [INFO ] Deduced a trap composed of 55 places in 1186 ms of which 11 ms to minimize.
[2024-05-31 18:06:53] [INFO ] Deduced a trap composed of 43 places in 1047 ms of which 10 ms to minimize.
[2024-05-31 18:06:54] [INFO ] Deduced a trap composed of 43 places in 1130 ms of which 10 ms to minimize.
[2024-05-31 18:06:55] [INFO ] Deduced a trap composed of 43 places in 1085 ms of which 10 ms to minimize.
[2024-05-31 18:06:56] [INFO ] Deduced a trap composed of 43 places in 1114 ms of which 11 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1725 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 3245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1725/5011 variables, and 61 constraints, problems are : Problem set: 0 solved, 3245 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 0/1726 constraints, ReadFeed: 0/3160 constraints, PredecessorRefiner: 0/3245 constraints, Known Traps: 20/20 constraints]
After SMT, in 62046ms problems are : Problem set: 0 solved, 3245 unsolved
Search for dead transitions found 0 dead transitions in 62073ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1726/2099 places, 3285/3674 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 83100 ms. Remains : 1726/2099 places, 3285/3674 transitions.
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p0) (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p0)), (NOT p3), (NOT p2), (NOT p2)]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-02
Stuttering criterion allowed to conclude after 2716 steps with 9 reset in 30 ms.
FORMULA CANConstruction-PT-040-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLFireability-02 finished in 83392 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)))'
Support contains 1 out of 2099 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2099/2099 places, 3674/3674 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 2083 transition count 3642
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 2083 transition count 3642
Applied a total of 32 rules in 304 ms. Remains 2083 /2099 variables (removed 16) and now considering 3642/3674 (removed 32) transitions.
// Phase 1: matrix 3642 rows 2083 cols
[2024-05-31 18:06:58] [INFO ] Computed 41 invariants in 21 ms
[2024-05-31 18:06:59] [INFO ] Implicit Places using invariants in 1052 ms returned []
[2024-05-31 18:06:59] [INFO ] Invariant cache hit.
[2024-05-31 18:07:00] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 18:07:23] [INFO ] Implicit Places using invariants and state equation in 24556 ms returned []
Implicit Place search using SMT with State Equation took 25612 ms to find 0 implicit places.
Running 3602 sub problems to find dead transitions.
[2024-05-31 18:07:23] [INFO ] Invariant cache hit.
[2024-05-31 18:07:23] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2082 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2082/5725 variables, and 41 constraints, problems are : Problem set: 0 solved, 3602 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 0/2083 constraints, ReadFeed: 0/3160 constraints, PredecessorRefiner: 3602/3602 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2082 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3602 unsolved
[2024-05-31 18:08:19] [INFO ] Deduced a trap composed of 52 places in 709 ms of which 11 ms to minimize.
[2024-05-31 18:08:20] [INFO ] Deduced a trap composed of 52 places in 685 ms of which 11 ms to minimize.
[2024-05-31 18:08:20] [INFO ] Deduced a trap composed of 52 places in 651 ms of which 10 ms to minimize.
[2024-05-31 18:08:21] [INFO ] Deduced a trap composed of 52 places in 629 ms of which 9 ms to minimize.
[2024-05-31 18:08:21] [INFO ] Deduced a trap composed of 52 places in 609 ms of which 11 ms to minimize.
[2024-05-31 18:08:22] [INFO ] Deduced a trap composed of 52 places in 615 ms of which 13 ms to minimize.
[2024-05-31 18:08:23] [INFO ] Deduced a trap composed of 52 places in 606 ms of which 10 ms to minimize.
[2024-05-31 18:08:23] [INFO ] Deduced a trap composed of 52 places in 574 ms of which 10 ms to minimize.
[2024-05-31 18:08:24] [INFO ] Deduced a trap composed of 52 places in 618 ms of which 10 ms to minimize.
[2024-05-31 18:08:25] [INFO ] Deduced a trap composed of 52 places in 609 ms of which 10 ms to minimize.
[2024-05-31 18:08:25] [INFO ] Deduced a trap composed of 52 places in 692 ms of which 13 ms to minimize.
[2024-05-31 18:08:26] [INFO ] Deduced a trap composed of 52 places in 613 ms of which 10 ms to minimize.
SMT process timed out in 62779ms, After SMT, problems are : Problem set: 0 solved, 3602 unsolved
Search for dead transitions found 0 dead transitions in 62814ms
Starting structural reductions in LTL mode, iteration 1 : 2083/2099 places, 3642/3674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 88740 ms. Remains : 2083/2099 places, 3642/3674 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 778 ms.
Product exploration explored 100000 steps with 50000 reset in 785 ms.
Computed a total of 121 stabilizing places and 160 stable transitions
Computed a total of 121 stabilizing places and 160 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-040-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-040-LTLFireability-03 finished in 90450 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((p0&&F(p1))))&&F(!p1)))'
Support contains 3 out of 2099 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2099/2099 places, 3674/3674 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 2083 transition count 3642
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 2083 transition count 3642
Applied a total of 32 rules in 247 ms. Remains 2083 /2099 variables (removed 16) and now considering 3642/3674 (removed 32) transitions.
// Phase 1: matrix 3642 rows 2083 cols
[2024-05-31 18:08:28] [INFO ] Computed 41 invariants in 25 ms
[2024-05-31 18:08:29] [INFO ] Implicit Places using invariants in 1054 ms returned []
[2024-05-31 18:08:29] [INFO ] Invariant cache hit.
[2024-05-31 18:08:30] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 18:08:52] [INFO ] Implicit Places using invariants and state equation in 23170 ms returned []
Implicit Place search using SMT with State Equation took 24226 ms to find 0 implicit places.
Running 3602 sub problems to find dead transitions.
[2024-05-31 18:08:52] [INFO ] Invariant cache hit.
[2024-05-31 18:08:52] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2082 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2082/5725 variables, and 41 constraints, problems are : Problem set: 0 solved, 3602 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 0/2083 constraints, ReadFeed: 0/3160 constraints, PredecessorRefiner: 3602/3602 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2082 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3602 unsolved
[2024-05-31 18:09:46] [INFO ] Deduced a trap composed of 52 places in 782 ms of which 11 ms to minimize.
[2024-05-31 18:09:49] [INFO ] Deduced a trap composed of 52 places in 725 ms of which 11 ms to minimize.
[2024-05-31 18:09:50] [INFO ] Deduced a trap composed of 52 places in 674 ms of which 11 ms to minimize.
[2024-05-31 18:09:50] [INFO ] Deduced a trap composed of 52 places in 704 ms of which 10 ms to minimize.
[2024-05-31 18:09:51] [INFO ] Deduced a trap composed of 52 places in 646 ms of which 10 ms to minimize.
[2024-05-31 18:09:52] [INFO ] Deduced a trap composed of 52 places in 640 ms of which 11 ms to minimize.
[2024-05-31 18:09:52] [INFO ] Deduced a trap composed of 52 places in 611 ms of which 10 ms to minimize.
[2024-05-31 18:09:53] [INFO ] Deduced a trap composed of 52 places in 595 ms of which 10 ms to minimize.
[2024-05-31 18:09:54] [INFO ] Deduced a trap composed of 52 places in 571 ms of which 10 ms to minimize.
[2024-05-31 18:09:54] [INFO ] Deduced a trap composed of 52 places in 583 ms of which 10 ms to minimize.
[2024-05-31 18:09:55] [INFO ] Deduced a trap composed of 52 places in 532 ms of which 9 ms to minimize.
SMT process timed out in 62595ms, After SMT, problems are : Problem set: 0 solved, 3602 unsolved
Search for dead transitions found 0 dead transitions in 62630ms
Starting structural reductions in LTL mode, iteration 1 : 2083/2099 places, 3642/3674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 87115 ms. Remains : 2083/2099 places, 3642/3674 transitions.
Stuttering acceptance computed with spot in 217 ms :[true, (OR (NOT p0) (NOT p1)), p1, true, (NOT p1)]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-040-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLFireability-04 finished in 87360 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(F(p0))&&F(p1))))))'
Support contains 3 out of 2099 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2099/2099 places, 3674/3674 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 2083 transition count 3642
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 2083 transition count 3642
Applied a total of 32 rules in 241 ms. Remains 2083 /2099 variables (removed 16) and now considering 3642/3674 (removed 32) transitions.
// Phase 1: matrix 3642 rows 2083 cols
[2024-05-31 18:09:55] [INFO ] Computed 41 invariants in 19 ms
[2024-05-31 18:09:56] [INFO ] Implicit Places using invariants in 1051 ms returned []
[2024-05-31 18:09:56] [INFO ] Invariant cache hit.
[2024-05-31 18:09:58] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 18:10:23] [INFO ] Implicit Places using invariants and state equation in 26242 ms returned []
Implicit Place search using SMT with State Equation took 27298 ms to find 0 implicit places.
Running 3602 sub problems to find dead transitions.
[2024-05-31 18:10:23] [INFO ] Invariant cache hit.
[2024-05-31 18:10:23] [INFO ] State equation strengthened by 3160 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2082 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2082/5725 variables, and 41 constraints, problems are : Problem set: 0 solved, 3602 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 0/2083 constraints, ReadFeed: 0/3160 constraints, PredecessorRefiner: 3602/3602 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2082 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3602 unsolved
[2024-05-31 18:11:20] [INFO ] Deduced a trap composed of 52 places in 715 ms of which 11 ms to minimize.
[2024-05-31 18:11:20] [INFO ] Deduced a trap composed of 52 places in 739 ms of which 10 ms to minimize.
[2024-05-31 18:11:21] [INFO ] Deduced a trap composed of 52 places in 678 ms of which 10 ms to minimize.
[2024-05-31 18:11:22] [INFO ] Deduced a trap composed of 52 places in 650 ms of which 11 ms to minimize.
[2024-05-31 18:11:23] [INFO ] Deduced a trap composed of 52 places in 708 ms of which 11 ms to minimize.
[2024-05-31 18:11:23] [INFO ] Deduced a trap composed of 52 places in 678 ms of which 11 ms to minimize.
[2024-05-31 18:11:24] [INFO ] Deduced a trap composed of 52 places in 746 ms of which 10 ms to minimize.
[2024-05-31 18:11:25] [INFO ] Deduced a trap composed of 62 places in 741 ms of which 10 ms to minimize.
[2024-05-31 18:11:26] [INFO ] Deduced a trap composed of 52 places in 643 ms of which 10 ms to minimize.
SMT process timed out in 62823ms, After SMT, problems are : Problem set: 0 solved, 3602 unsolved
Search for dead transitions found 0 dead transitions in 62854ms
Starting structural reductions in LTL mode, iteration 1 : 2083/2099 places, 3642/3674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 90400 ms. Remains : 2083/2099 places, 3642/3674 transitions.
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-05
Stuttering criterion allowed to conclude after 953 steps with 1 reset in 6 ms.
FORMULA CANConstruction-PT-040-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLFireability-05 finished in 90679 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(F(p1)&&F((p2||G(p3)))))))'
Support contains 7 out of 2099 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2099/2099 places, 3674/3674 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 261 transitions
Trivial Post-agglo rules discarded 261 transitions
Performed 261 trivial Post agglomeration. Transition count delta: 261
Iterating post reduction 0 with 261 rules applied. Total rules applied 261 place count 2099 transition count 3413
Reduce places removed 261 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 262 rules applied. Total rules applied 523 place count 1838 transition count 3412
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 524 place count 1837 transition count 3412
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 524 place count 1837 transition count 3373
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 602 place count 1798 transition count 3373
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 619 place count 1781 transition count 3339
Iterating global reduction 3 with 17 rules applied. Total rules applied 636 place count 1781 transition count 3339
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 3 with 15 rules applied. Total rules applied 651 place count 1781 transition count 3324
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 666 place count 1766 transition count 3324
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 740 place count 1729 transition count 3287
Applied a total of 740 rules in 706 ms. Remains 1729 /2099 variables (removed 370) and now considering 3287/3674 (removed 387) transitions.
// Phase 1: matrix 3287 rows 1729 cols
[2024-05-31 18:11:27] [INFO ] Computed 41 invariants in 51 ms
[2024-05-31 18:11:28] [INFO ] Implicit Places using invariants in 1109 ms returned []
[2024-05-31 18:11:28] [INFO ] Invariant cache hit.
[2024-05-31 18:11:29] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 18:11:50] [INFO ] Implicit Places using invariants and state equation in 22531 ms returned []
Implicit Place search using SMT with State Equation took 23656 ms to find 0 implicit places.
[2024-05-31 18:11:50] [INFO ] Redundant transitions in 146 ms returned []
Running 3247 sub problems to find dead transitions.
[2024-05-31 18:11:50] [INFO ] Invariant cache hit.
[2024-05-31 18:11:50] [INFO ] State equation strengthened by 3160 read => feed constraints.
(s741 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 1.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 1.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 1.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 1.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 1.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 1.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 1.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 1.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 1.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 1.0)
(s740 0.0)
(s741 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1728 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3247 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1728/5016 variables, and 41 constraints, problems are : Problem set: 0 solved, 3247 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 0/1729 constraints, ReadFeed: 0/3160 constraints, PredecessorRefiner: 3247/3247 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1728 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3247 unsolved
[2024-05-31 18:12:30] [INFO ] Deduced a trap composed of 43 places in 1249 ms of which 10 ms to minimize.
[2024-05-31 18:12:32] [INFO ] Deduced a trap composed of 43 places in 1225 ms of which 11 ms to minimize.
[2024-05-31 18:12:33] [INFO ] Deduced a trap composed of 43 places in 1219 ms of which 18 ms to minimize.
[2024-05-31 18:12:34] [INFO ] Deduced a trap composed of 43 places in 1259 ms of which 12 ms to minimize.
[2024-05-31 18:12:35] [INFO ] Deduced a trap composed of 43 places in 1207 ms of which 11 ms to minimize.
[2024-05-31 18:12:37] [INFO ] Deduced a trap composed of 45 places in 1201 ms of which 12 ms to minimize.
[2024-05-31 18:12:38] [INFO ] Deduced a trap composed of 43 places in 1221 ms of which 11 ms to minimize.
[2024-05-31 18:12:39] [INFO ] Deduced a trap composed of 43 places in 1165 ms of which 11 ms to minimize.
[2024-05-31 18:12:40] [INFO ] Deduced a trap composed of 43 places in 1147 ms of which 10 ms to minimize.
[2024-05-31 18:12:41] [INFO ] Deduced a trap composed of 43 places in 1104 ms of which 12 ms to minimize.
[2024-05-31 18:12:43] [INFO ] Deduced a trap composed of 44 places in 1113 ms of which 11 ms to minimize.
[2024-05-31 18:12:44] [INFO ] Deduced a trap composed of 43 places in 1104 ms of which 11 ms to minimize.
[2024-05-31 18:12:45] [INFO ] Deduced a trap composed of 49 places in 1094 ms of which 10 ms to minimize.
[2024-05-31 18:12:46] [INFO ] Deduced a trap composed of 53 places in 1104 ms of which 11 ms to minimize.
[2024-05-31 18:12:47] [INFO ] Deduced a trap composed of 43 places in 1076 ms of which 11 ms to minimize.
[2024-05-31 18:12:48] [INFO ] Deduced a trap composed of 44 places in 1053 ms of which 11 ms to minimize.
[2024-05-31 18:12:49] [INFO ] Deduced a trap composed of 43 places in 1014 ms of which 10 ms to minimize.
[2024-05-31 18:12:50] [INFO ] Deduced a trap composed of 43 places in 1106 ms of which 10 ms to minimize.
[2024-05-31 18:12:51] [INFO ] Deduced a trap composed of 43 places in 993 ms of which 11 ms to minimize.
[2024-05-31 18:12:52] [INFO ] Deduced a trap composed of 53 places in 983 ms of which 10 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1728 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 3247 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1728/5016 variables, and 61 constraints, problems are : Problem set: 0 solved, 3247 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 0/1729 constraints, ReadFeed: 0/3160 constraints, PredecessorRefiner: 0/3247 constraints, Known Traps: 20/20 constraints]
After SMT, in 62413ms problems are : Problem set: 0 solved, 3247 unsolved
Search for dead transitions found 0 dead transitions in 62441ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1729/2099 places, 3287/3674 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 86979 ms. Remains : 1729/2099 places, 3287/3674 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-06
Stuttering criterion allowed to conclude after 268 steps with 0 reset in 2 ms.
FORMULA CANConstruction-PT-040-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLFireability-06 finished in 87242 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0 U (p1||G(p0)))&&X(G((p0||G(p2))))))))'
Support contains 5 out of 2099 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2099/2099 places, 3674/3674 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 2083 transition count 3642
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 2083 transition count 3642
Applied a total of 32 rules in 252 ms. Remains 2083 /2099 variables (removed 16) and now considering 3642/3674 (removed 32) transitions.
// Phase 1: matrix 3642 rows 2083 cols
[2024-05-31 18:12:53] [INFO ] Computed 41 invariants in 15 ms
[2024-05-31 18:12:54] [INFO ] Implicit Places using invariants in 1060 ms returned []
[2024-05-31 18:12:54] [INFO ] Invariant cache hit.
[2024-05-31 18:12:56] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 18:13:20] [INFO ] Implicit Places using invariants and state equation in 25719 ms returned []
Implicit Place search using SMT with State Equation took 26793 ms to find 0 implicit places.
Running 3602 sub problems to find dead transitions.
[2024-05-31 18:13:20] [INFO ] Invariant cache hit.
[2024-05-31 18:13:20] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2082 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2082/5725 variables, and 41 constraints, problems are : Problem set: 0 solved, 3602 unsolved in 30070 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 0/2083 constraints, ReadFeed: 0/3160 constraints, PredecessorRefiner: 3602/3602 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2082 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3602 unsolved
[2024-05-31 18:14:16] [INFO ] Deduced a trap composed of 52 places in 711 ms of which 11 ms to minimize.
[2024-05-31 18:14:17] [INFO ] Deduced a trap composed of 52 places in 672 ms of which 10 ms to minimize.
[2024-05-31 18:14:17] [INFO ] Deduced a trap composed of 52 places in 647 ms of which 11 ms to minimize.
[2024-05-31 18:14:18] [INFO ] Deduced a trap composed of 52 places in 600 ms of which 10 ms to minimize.
[2024-05-31 18:14:19] [INFO ] Deduced a trap composed of 52 places in 596 ms of which 10 ms to minimize.
[2024-05-31 18:14:19] [INFO ] Deduced a trap composed of 52 places in 616 ms of which 10 ms to minimize.
[2024-05-31 18:14:20] [INFO ] Deduced a trap composed of 52 places in 621 ms of which 10 ms to minimize.
[2024-05-31 18:14:21] [INFO ] Deduced a trap composed of 52 places in 582 ms of which 10 ms to minimize.
[2024-05-31 18:14:21] [INFO ] Deduced a trap composed of 52 places in 568 ms of which 10 ms to minimize.
[2024-05-31 18:14:22] [INFO ] Deduced a trap composed of 52 places in 549 ms of which 10 ms to minimize.
[2024-05-31 18:14:22] [INFO ] Deduced a trap composed of 52 places in 526 ms of which 9 ms to minimize.
[2024-05-31 18:14:23] [INFO ] Deduced a trap composed of 52 places in 575 ms of which 9 ms to minimize.
SMT process timed out in 62753ms, After SMT, problems are : Problem set: 0 solved, 3602 unsolved
Search for dead transitions found 0 dead transitions in 62783ms
Starting structural reductions in LTL mode, iteration 1 : 2083/2099 places, 3642/3674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89837 ms. Remains : 2083/2099 places, 3642/3674 transitions.
Stuttering acceptance computed with spot in 271 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-07
Entered a terminal (fully accepting) state of product in 2003 steps with 2 reset in 14 ms.
FORMULA CANConstruction-PT-040-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLFireability-07 finished in 90163 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(p0))||(X(p2)&&p1))))'
Support contains 5 out of 2099 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2099/2099 places, 3674/3674 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 2083 transition count 3642
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 2083 transition count 3642
Applied a total of 32 rules in 276 ms. Remains 2083 /2099 variables (removed 16) and now considering 3642/3674 (removed 32) transitions.
// Phase 1: matrix 3642 rows 2083 cols
[2024-05-31 18:14:24] [INFO ] Computed 41 invariants in 20 ms
[2024-05-31 18:14:25] [INFO ] Implicit Places using invariants in 1072 ms returned []
[2024-05-31 18:14:25] [INFO ] Invariant cache hit.
[2024-05-31 18:14:26] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 18:14:47] [INFO ] Implicit Places using invariants and state equation in 22167 ms returned []
Implicit Place search using SMT with State Equation took 23255 ms to find 0 implicit places.
Running 3602 sub problems to find dead transitions.
[2024-05-31 18:14:47] [INFO ] Invariant cache hit.
[2024-05-31 18:14:47] [INFO ] State equation strengthened by 3160 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2082 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2082/5725 variables, and 41 constraints, problems are : Problem set: 0 solved, 3602 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 0/2083 constraints, ReadFeed: 0/3160 constraints, PredecessorRefiner: 3602/3602 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2082 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3602 unsolved
[2024-05-31 18:15:43] [INFO ] Deduced a trap composed of 52 places in 816 ms of which 12 ms to minimize.
[2024-05-31 18:15:44] [INFO ] Deduced a trap composed of 52 places in 747 ms of which 10 ms to minimize.
[2024-05-31 18:15:45] [INFO ] Deduced a trap composed of 52 places in 666 ms of which 10 ms to minimize.
[2024-05-31 18:15:45] [INFO ] Deduced a trap composed of 52 places in 643 ms of which 10 ms to minimize.
[2024-05-31 18:15:46] [INFO ] Deduced a trap composed of 52 places in 655 ms of which 10 ms to minimize.
[2024-05-31 18:15:47] [INFO ] Deduced a trap composed of 52 places in 667 ms of which 11 ms to minimize.
[2024-05-31 18:15:47] [INFO ] Deduced a trap composed of 52 places in 747 ms of which 12 ms to minimize.
[2024-05-31 18:15:48] [INFO ] Deduced a trap composed of 52 places in 667 ms of which 10 ms to minimize.
[2024-05-31 18:15:49] [INFO ] Deduced a trap composed of 52 places in 688 ms of which 11 ms to minimize.
[2024-05-31 18:15:50] [INFO ] Deduced a trap composed of 52 places in 688 ms of which 11 ms to minimize.
SMT process timed out in 62853ms, After SMT, problems are : Problem set: 0 solved, 3602 unsolved
Search for dead transitions found 0 dead transitions in 62886ms
Starting structural reductions in LTL mode, iteration 1 : 2083/2099 places, 3642/3674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86428 ms. Remains : 2083/2099 places, 3642/3674 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 924 ms.
Product exploration explored 100000 steps with 50000 reset in 846 ms.
Computed a total of 121 stabilizing places and 160 stable transitions
Computed a total of 121 stabilizing places and 160 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 22 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-040-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-040-LTLFireability-08 finished in 88484 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(p1)))))'
Support contains 4 out of 2099 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2099/2099 places, 3674/3674 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 2084 transition count 3644
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 2084 transition count 3644
Applied a total of 30 rules in 242 ms. Remains 2084 /2099 variables (removed 15) and now considering 3644/3674 (removed 30) transitions.
// Phase 1: matrix 3644 rows 2084 cols
[2024-05-31 18:15:52] [INFO ] Computed 41 invariants in 22 ms
[2024-05-31 18:15:53] [INFO ] Implicit Places using invariants in 1078 ms returned []
[2024-05-31 18:15:53] [INFO ] Invariant cache hit.
[2024-05-31 18:15:54] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 18:16:18] [INFO ] Implicit Places using invariants and state equation in 24720 ms returned []
Implicit Place search using SMT with State Equation took 25800 ms to find 0 implicit places.
Running 3604 sub problems to find dead transitions.
[2024-05-31 18:16:18] [INFO ] Invariant cache hit.
[2024-05-31 18:16:18] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2083 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2083/5728 variables, and 41 constraints, problems are : Problem set: 0 solved, 3604 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 0/2084 constraints, ReadFeed: 0/3160 constraints, PredecessorRefiner: 3604/3604 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2083 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3604 unsolved
[2024-05-31 18:17:14] [INFO ] Deduced a trap composed of 52 places in 727 ms of which 12 ms to minimize.
[2024-05-31 18:17:14] [INFO ] Deduced a trap composed of 52 places in 657 ms of which 11 ms to minimize.
[2024-05-31 18:17:15] [INFO ] Deduced a trap composed of 52 places in 614 ms of which 10 ms to minimize.
[2024-05-31 18:17:16] [INFO ] Deduced a trap composed of 52 places in 631 ms of which 10 ms to minimize.
[2024-05-31 18:17:16] [INFO ] Deduced a trap composed of 52 places in 619 ms of which 10 ms to minimize.
[2024-05-31 18:17:17] [INFO ] Deduced a trap composed of 52 places in 598 ms of which 10 ms to minimize.
[2024-05-31 18:17:18] [INFO ] Deduced a trap composed of 52 places in 624 ms of which 10 ms to minimize.
[2024-05-31 18:17:18] [INFO ] Deduced a trap composed of 52 places in 624 ms of which 10 ms to minimize.
[2024-05-31 18:17:19] [INFO ] Deduced a trap composed of 52 places in 583 ms of which 10 ms to minimize.
[2024-05-31 18:17:19] [INFO ] Deduced a trap composed of 52 places in 594 ms of which 10 ms to minimize.
[2024-05-31 18:17:20] [INFO ] Deduced a trap composed of 52 places in 582 ms of which 10 ms to minimize.
[2024-05-31 18:17:21] [INFO ] Deduced a trap composed of 52 places in 565 ms of which 10 ms to minimize.
SMT process timed out in 62813ms, After SMT, problems are : Problem set: 0 solved, 3604 unsolved
Search for dead transitions found 0 dead transitions in 62844ms
Starting structural reductions in LTL mode, iteration 1 : 2084/2099 places, 3644/3674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 88894 ms. Remains : 2084/2099 places, 3644/3674 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-09
Product exploration explored 100000 steps with 142 reset in 552 ms.
Product exploration explored 100000 steps with 143 reset in 719 ms.
Computed a total of 121 stabilizing places and 160 stable transitions
Computed a total of 121 stabilizing places and 160 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 130 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (53 resets) in 636 ms. (62 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 1/1 properties
[2024-05-31 18:17:23] [INFO ] Invariant cache hit.
[2024-05-31 18:17:23] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2043/2047 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 18:17:24] [INFO ] Deduced a trap composed of 5 places in 1357 ms of which 12 ms to minimize.
[2024-05-31 18:17:26] [INFO ] Deduced a trap composed of 5 places in 1312 ms of which 12 ms to minimize.
[2024-05-31 18:17:27] [INFO ] Deduced a trap composed of 5 places in 1242 ms of which 12 ms to minimize.
[2024-05-31 18:17:28] [INFO ] Deduced a trap composed of 5 places in 1291 ms of which 12 ms to minimize.
SMT process timed out in 5608ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 2084 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2084/2084 places, 3644/3644 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 2084 transition count 3366
Reduce places removed 278 places and 0 transitions.
Iterating post reduction 1 with 278 rules applied. Total rules applied 556 place count 1806 transition count 3366
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 556 place count 1806 transition count 3326
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 636 place count 1766 transition count 3326
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 718 place count 1725 transition count 3285
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 719 place count 1725 transition count 3284
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 720 place count 1724 transition count 3284
Applied a total of 720 rules in 406 ms. Remains 1724 /2084 variables (removed 360) and now considering 3284/3644 (removed 360) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 407 ms. Remains : 1724/2084 places, 3284/3644 transitions.
RANDOM walk for 38293 steps (137 resets) in 399 ms. (95 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 13 factoid took 427 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 2084 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2084/2084 places, 3644/3644 transitions.
Applied a total of 0 rules in 128 ms. Remains 2084 /2084 variables (removed 0) and now considering 3644/3644 (removed 0) transitions.
[2024-05-31 18:17:29] [INFO ] Invariant cache hit.
[2024-05-31 18:17:31] [INFO ] Implicit Places using invariants in 1040 ms returned []
[2024-05-31 18:17:31] [INFO ] Invariant cache hit.
[2024-05-31 18:17:32] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 18:17:54] [INFO ] Implicit Places using invariants and state equation in 23339 ms returned []
Implicit Place search using SMT with State Equation took 24381 ms to find 0 implicit places.
Running 3604 sub problems to find dead transitions.
[2024-05-31 18:17:54] [INFO ] Invariant cache hit.
[2024-05-31 18:17:54] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2083 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2083/5728 variables, and 41 constraints, problems are : Problem set: 0 solved, 3604 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 0/2084 constraints, ReadFeed: 0/3160 constraints, PredecessorRefiner: 3604/3604 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2083 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3604 unsolved
[2024-05-31 18:18:50] [INFO ] Deduced a trap composed of 52 places in 739 ms of which 13 ms to minimize.
[2024-05-31 18:18:50] [INFO ] Deduced a trap composed of 52 places in 675 ms of which 10 ms to minimize.
[2024-05-31 18:18:51] [INFO ] Deduced a trap composed of 52 places in 649 ms of which 11 ms to minimize.
[2024-05-31 18:18:52] [INFO ] Deduced a trap composed of 52 places in 675 ms of which 11 ms to minimize.
[2024-05-31 18:18:53] [INFO ] Deduced a trap composed of 52 places in 658 ms of which 11 ms to minimize.
[2024-05-31 18:18:53] [INFO ] Deduced a trap composed of 52 places in 628 ms of which 10 ms to minimize.
[2024-05-31 18:18:54] [INFO ] Deduced a trap composed of 52 places in 570 ms of which 10 ms to minimize.
[2024-05-31 18:18:54] [INFO ] Deduced a trap composed of 52 places in 628 ms of which 10 ms to minimize.
[2024-05-31 18:18:55] [INFO ] Deduced a trap composed of 52 places in 590 ms of which 10 ms to minimize.
[2024-05-31 18:18:56] [INFO ] Deduced a trap composed of 52 places in 592 ms of which 10 ms to minimize.
[2024-05-31 18:18:56] [INFO ] Deduced a trap composed of 52 places in 607 ms of which 10 ms to minimize.
SMT process timed out in 62441ms, After SMT, problems are : Problem set: 0 solved, 3604 unsolved
Search for dead transitions found 0 dead transitions in 62478ms
Finished structural reductions in LTL mode , in 1 iterations and 87007 ms. Remains : 2084/2084 places, 3644/3644 transitions.
Computed a total of 121 stabilizing places and 160 stable transitions
Computed a total of 121 stabilizing places and 160 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 134 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (55 resets) in 717 ms. (55 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
[2024-05-31 18:18:57] [INFO ] Invariant cache hit.
[2024-05-31 18:18:57] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2043/2047 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 18:18:58] [INFO ] Deduced a trap composed of 5 places in 1288 ms of which 12 ms to minimize.
[2024-05-31 18:19:00] [INFO ] Deduced a trap composed of 5 places in 1169 ms of which 11 ms to minimize.
[2024-05-31 18:19:01] [INFO ] Deduced a trap composed of 5 places in 1299 ms of which 12 ms to minimize.
[2024-05-31 18:19:02] [INFO ] Deduced a trap composed of 5 places in 1327 ms of which 13 ms to minimize.
SMT process timed out in 5485ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 2084 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2084/2084 places, 3644/3644 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 2084 transition count 3366
Reduce places removed 278 places and 0 transitions.
Iterating post reduction 1 with 278 rules applied. Total rules applied 556 place count 1806 transition count 3366
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 556 place count 1806 transition count 3326
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 636 place count 1766 transition count 3326
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 718 place count 1725 transition count 3285
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 719 place count 1725 transition count 3284
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 720 place count 1724 transition count 3284
Applied a total of 720 rules in 386 ms. Remains 1724 /2084 variables (removed 360) and now considering 3284/3644 (removed 360) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 386 ms. Remains : 1724/2084 places, 3284/3644 transitions.
RANDOM walk for 40000 steps (144 resets) in 463 ms. (86 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 129192 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 1
Probabilistic random walk after 129192 steps, saw 37460 distinct states, run finished after 3005 ms. (steps per millisecond=42 ) properties seen :0
// Phase 1: matrix 3284 rows 1724 cols
[2024-05-31 18:19:06] [INFO ] Computed 41 invariants in 22 ms
[2024-05-31 18:19:06] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1683/1687 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 18:19:07] [INFO ] Deduced a trap composed of 2 places in 1077 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1687 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1687 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 36/1723 variables, 36/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 18:19:09] [INFO ] Deduced a trap composed of 43 places in 1121 ms of which 11 ms to minimize.
[2024-05-31 18:19:10] [INFO ] Deduced a trap composed of 43 places in 1124 ms of which 11 ms to minimize.
[2024-05-31 18:19:11] [INFO ] Deduced a trap composed of 43 places in 1118 ms of which 10 ms to minimize.
[2024-05-31 18:19:12] [INFO ] Deduced a trap composed of 43 places in 1147 ms of which 11 ms to minimize.
[2024-05-31 18:19:13] [INFO ] Deduced a trap composed of 49 places in 1154 ms of which 12 ms to minimize.
[2024-05-31 18:19:14] [INFO ] Deduced a trap composed of 49 places in 1126 ms of which 11 ms to minimize.
[2024-05-31 18:19:15] [INFO ] Deduced a trap composed of 49 places in 1116 ms of which 11 ms to minimize.
[2024-05-31 18:19:17] [INFO ] Deduced a trap composed of 51 places in 1094 ms of which 11 ms to minimize.
[2024-05-31 18:19:18] [INFO ] Deduced a trap composed of 43 places in 1178 ms of which 15 ms to minimize.
[2024-05-31 18:19:19] [INFO ] Deduced a trap composed of 43 places in 1141 ms of which 11 ms to minimize.
[2024-05-31 18:19:20] [INFO ] Deduced a trap composed of 43 places in 1164 ms of which 11 ms to minimize.
[2024-05-31 18:19:21] [INFO ] Deduced a trap composed of 43 places in 1164 ms of which 11 ms to minimize.
[2024-05-31 18:19:23] [INFO ] Deduced a trap composed of 43 places in 1163 ms of which 11 ms to minimize.
[2024-05-31 18:19:24] [INFO ] Deduced a trap composed of 43 places in 1162 ms of which 12 ms to minimize.
[2024-05-31 18:19:25] [INFO ] Deduced a trap composed of 43 places in 1164 ms of which 11 ms to minimize.
[2024-05-31 18:19:26] [INFO ] Deduced a trap composed of 43 places in 1158 ms of which 12 ms to minimize.
[2024-05-31 18:19:27] [INFO ] Deduced a trap composed of 43 places in 1152 ms of which 12 ms to minimize.
[2024-05-31 18:19:28] [INFO ] Deduced a trap composed of 44 places in 1143 ms of which 11 ms to minimize.
[2024-05-31 18:19:30] [INFO ] Deduced a trap composed of 44 places in 1171 ms of which 11 ms to minimize.
[2024-05-31 18:19:31] [INFO ] Deduced a trap composed of 43 places in 1137 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1723 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 18:19:32] [INFO ] Deduced a trap composed of 44 places in 1173 ms of which 11 ms to minimize.
[2024-05-31 18:19:33] [INFO ] Deduced a trap composed of 44 places in 1135 ms of which 11 ms to minimize.
[2024-05-31 18:19:34] [INFO ] Deduced a trap composed of 44 places in 1142 ms of which 11 ms to minimize.
[2024-05-31 18:19:36] [INFO ] Deduced a trap composed of 43 places in 1130 ms of which 11 ms to minimize.
[2024-05-31 18:19:37] [INFO ] Deduced a trap composed of 43 places in 1103 ms of which 11 ms to minimize.
[2024-05-31 18:19:38] [INFO ] Deduced a trap composed of 54 places in 1109 ms of which 11 ms to minimize.
[2024-05-31 18:19:39] [INFO ] Deduced a trap composed of 43 places in 1093 ms of which 11 ms to minimize.
[2024-05-31 18:19:40] [INFO ] Deduced a trap composed of 44 places in 1085 ms of which 11 ms to minimize.
[2024-05-31 18:19:41] [INFO ] Deduced a trap composed of 43 places in 1098 ms of which 11 ms to minimize.
[2024-05-31 18:19:42] [INFO ] Deduced a trap composed of 43 places in 1090 ms of which 11 ms to minimize.
[2024-05-31 18:19:43] [INFO ] Deduced a trap composed of 43 places in 1086 ms of which 10 ms to minimize.
[2024-05-31 18:19:45] [INFO ] Deduced a trap composed of 43 places in 1094 ms of which 11 ms to minimize.
[2024-05-31 18:19:46] [INFO ] Deduced a trap composed of 43 places in 1103 ms of which 11 ms to minimize.
[2024-05-31 18:19:47] [INFO ] Deduced a trap composed of 47 places in 1107 ms of which 11 ms to minimize.
[2024-05-31 18:19:48] [INFO ] Deduced a trap composed of 44 places in 1089 ms of which 11 ms to minimize.
[2024-05-31 18:19:49] [INFO ] Deduced a trap composed of 43 places in 1082 ms of which 11 ms to minimize.
[2024-05-31 18:19:50] [INFO ] Deduced a trap composed of 44 places in 1083 ms of which 11 ms to minimize.
[2024-05-31 18:19:51] [INFO ] Deduced a trap composed of 43 places in 1091 ms of which 11 ms to minimize.
SMT process timed out in 45359ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1724 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1724/1724 places, 3284/3284 transitions.
Applied a total of 0 rules in 121 ms. Remains 1724 /1724 variables (removed 0) and now considering 3284/3284 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 1724/1724 places, 3284/3284 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1724/1724 places, 3284/3284 transitions.
Applied a total of 0 rules in 123 ms. Remains 1724 /1724 variables (removed 0) and now considering 3284/3284 (removed 0) transitions.
[2024-05-31 18:19:52] [INFO ] Invariant cache hit.
[2024-05-31 18:19:52] [INFO ] Implicit Places using invariants in 990 ms returned []
[2024-05-31 18:19:52] [INFO ] Invariant cache hit.
[2024-05-31 18:19:53] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 18:20:13] [INFO ] Implicit Places using invariants and state equation in 20766 ms returned []
Implicit Place search using SMT with State Equation took 21768 ms to find 0 implicit places.
[2024-05-31 18:20:13] [INFO ] Redundant transitions in 84 ms returned []
Running 3244 sub problems to find dead transitions.
[2024-05-31 18:20:13] [INFO ] Invariant cache hit.
[2024-05-31 18:20:13] [INFO ] State equation strengthened by 3160 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 2.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 timeout
0.0)
(s134 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1723 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3244 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1723/5008 variables, and 41 constraints, problems are : Problem set: 0 solved, 3244 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 0/1724 constraints, ReadFeed: 0/3160 constraints, PredecessorRefiner: 3244/3244 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3244 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1723 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3244 unsolved
[2024-05-31 18:20:48] [INFO ] Deduced a trap composed of 43 places in 673 ms of which 11 ms to minimize.
[2024-05-31 18:20:49] [INFO ] Deduced a trap composed of 43 places in 650 ms of which 11 ms to minimize.
[2024-05-31 18:20:51] [INFO ] Deduced a trap composed of 43 places in 1255 ms of which 11 ms to minimize.
[2024-05-31 18:20:52] [INFO ] Deduced a trap composed of 44 places in 1221 ms of which 10 ms to minimize.
[2024-05-31 18:20:54] [INFO ] Deduced a trap composed of 43 places in 1247 ms of which 11 ms to minimize.
[2024-05-31 18:20:55] [INFO ] Deduced a trap composed of 43 places in 1250 ms of which 11 ms to minimize.
[2024-05-31 18:20:56] [INFO ] Deduced a trap composed of 44 places in 1250 ms of which 10 ms to minimize.
[2024-05-31 18:20:59] [INFO ] Deduced a trap composed of 43 places in 687 ms of which 19 ms to minimize.
[2024-05-31 18:21:00] [INFO ] Deduced a trap composed of 43 places in 680 ms of which 11 ms to minimize.
[2024-05-31 18:21:00] [INFO ] Deduced a trap composed of 43 places in 657 ms of which 10 ms to minimize.
[2024-05-31 18:21:01] [INFO ] Deduced a trap composed of 43 places in 666 ms of which 11 ms to minimize.
[2024-05-31 18:21:03] [INFO ] Deduced a trap composed of 43 places in 606 ms of which 10 ms to minimize.
[2024-05-31 18:21:03] [INFO ] Deduced a trap composed of 43 places in 585 ms of which 10 ms to minimize.
[2024-05-31 18:21:04] [INFO ] Deduced a trap composed of 43 places in 603 ms of which 10 ms to minimize.
[2024-05-31 18:21:05] [INFO ] Deduced a trap composed of 43 places in 614 ms of which 9 ms to minimize.
[2024-05-31 18:21:06] [INFO ] Deduced a trap composed of 48 places in 1262 ms of which 11 ms to minimize.
[2024-05-31 18:21:07] [INFO ] Deduced a trap composed of 43 places in 1250 ms of which 11 ms to minimize.
[2024-05-31 18:21:08] [INFO ] Deduced a trap composed of 49 places in 1272 ms of which 11 ms to minimize.
[2024-05-31 18:21:10] [INFO ] Deduced a trap composed of 43 places in 1265 ms of which 12 ms to minimize.
[2024-05-31 18:21:11] [INFO ] Deduced a trap composed of 50 places in 1236 ms of which 11 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1723 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 3244 unsolved
[2024-05-31 18:21:12] [INFO ] Deduced a trap composed of 43 places in 565 ms of which 9 ms to minimize.
[2024-05-31 18:21:13] [INFO ] Deduced a trap composed of 43 places in 616 ms of which 9 ms to minimize.
[2024-05-31 18:21:14] [INFO ] Deduced a trap composed of 43 places in 621 ms of which 10 ms to minimize.
[2024-05-31 18:21:14] [INFO ] Deduced a trap composed of 43 places in 566 ms of which 9 ms to minimize.
[2024-05-31 18:21:15] [INFO ] Deduced a trap composed of 51 places in 630 ms of which 13 ms to minimize.
[2024-05-31 18:21:15] [INFO ] Deduced a trap composed of 43 places in 622 ms of which 9 ms to minimize.
[2024-05-31 18:21:16] [INFO ] Deduced a trap composed of 43 places in 630 ms of which 9 ms to minimize.
SMT process timed out in 62745ms, After SMT, problems are : Problem set: 0 solved, 3244 unsolved
Search for dead transitions found 0 dead transitions in 62788ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84782 ms. Remains : 1724/1724 places, 3284/3284 transitions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 13 factoid took 335 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 144 reset in 556 ms.
Product exploration explored 100000 steps with 142 reset in 550 ms.
Support contains 4 out of 2084 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2084/2084 places, 3644/3644 transitions.
Applied a total of 0 rules in 127 ms. Remains 2084 /2084 variables (removed 0) and now considering 3644/3644 (removed 0) transitions.
// Phase 1: matrix 3644 rows 2084 cols
[2024-05-31 18:21:18] [INFO ] Computed 41 invariants in 21 ms
[2024-05-31 18:21:19] [INFO ] Implicit Places using invariants in 1009 ms returned []
[2024-05-31 18:21:19] [INFO ] Invariant cache hit.
[2024-05-31 18:21:20] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 18:21:43] [INFO ] Implicit Places using invariants and state equation in 23518 ms returned []
Implicit Place search using SMT with State Equation took 24528 ms to find 0 implicit places.
Running 3604 sub problems to find dead transitions.
[2024-05-31 18:21:43] [INFO ] Invariant cache hit.
[2024-05-31 18:21:43] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2083 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2083/5728 variables, and 41 constraints, problems are : Problem set: 0 solved, 3604 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 0/2084 constraints, ReadFeed: 0/3160 constraints, PredecessorRefiner: 3604/3604 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2083 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3604 unsolved
[2024-05-31 18:22:39] [INFO ] Deduced a trap composed of 52 places in 733 ms of which 12 ms to minimize.
[2024-05-31 18:22:40] [INFO ] Deduced a trap composed of 52 places in 675 ms of which 11 ms to minimize.
[2024-05-31 18:22:40] [INFO ] Deduced a trap composed of 52 places in 589 ms of which 10 ms to minimize.
[2024-05-31 18:22:41] [INFO ] Deduced a trap composed of 52 places in 666 ms of which 11 ms to minimize.
[2024-05-31 18:22:42] [INFO ] Deduced a trap composed of 52 places in 655 ms of which 11 ms to minimize.
[2024-05-31 18:22:42] [INFO ] Deduced a trap composed of 52 places in 625 ms of which 10 ms to minimize.
[2024-05-31 18:22:43] [INFO ] Deduced a trap composed of 52 places in 588 ms of which 10 ms to minimize.
[2024-05-31 18:22:44] [INFO ] Deduced a trap composed of 52 places in 614 ms of which 10 ms to minimize.
[2024-05-31 18:22:44] [INFO ] Deduced a trap composed of 52 places in 577 ms of which 10 ms to minimize.
[2024-05-31 18:22:45] [INFO ] Deduced a trap composed of 52 places in 576 ms of which 9 ms to minimize.
[2024-05-31 18:22:45] [INFO ] Deduced a trap composed of 52 places in 579 ms of which 10 ms to minimize.
SMT process timed out in 62647ms, After SMT, problems are : Problem set: 0 solved, 3604 unsolved
Search for dead transitions found 0 dead transitions in 62682ms
Finished structural reductions in LTL mode , in 1 iterations and 87346 ms. Remains : 2084/2084 places, 3644/3644 transitions.
Treatment of property CANConstruction-PT-040-LTLFireability-09 finished in 413942 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||X(p1)))&&F(p2)))'
Support contains 4 out of 2099 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2099/2099 places, 3674/3674 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 2084 transition count 3644
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 2084 transition count 3644
Applied a total of 30 rules in 288 ms. Remains 2084 /2099 variables (removed 15) and now considering 3644/3674 (removed 30) transitions.
// Phase 1: matrix 3644 rows 2084 cols
[2024-05-31 18:22:46] [INFO ] Computed 41 invariants in 22 ms
[2024-05-31 18:22:47] [INFO ] Implicit Places using invariants in 1096 ms returned []
[2024-05-31 18:22:47] [INFO ] Invariant cache hit.
[2024-05-31 18:22:48] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 18:23:12] [INFO ] Implicit Places using invariants and state equation in 25118 ms returned []
Implicit Place search using SMT with State Equation took 26222 ms to find 0 implicit places.
Running 3604 sub problems to find dead transitions.
[2024-05-31 18:23:12] [INFO ] Invariant cache hit.
[2024-05-31 18:23:12] [INFO ] State equation strengthened by 3160 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2083 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2083/5728 variables, and 41 constraints, problems are : Problem set: 0 solved, 3604 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 0/2084 constraints, ReadFeed: 0/3160 constraints, PredecessorRefiner: 3604/3604 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2083 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3604 unsolved
[2024-05-31 18:24:07] [INFO ] Deduced a trap composed of 52 places in 783 ms of which 11 ms to minimize.
[2024-05-31 18:24:09] [INFO ] Deduced a trap composed of 52 places in 690 ms of which 11 ms to minimize.
[2024-05-31 18:24:09] [INFO ] Deduced a trap composed of 52 places in 673 ms of which 11 ms to minimize.
[2024-05-31 18:24:10] [INFO ] Deduced a trap composed of 52 places in 612 ms of which 10 ms to minimize.
[2024-05-31 18:24:11] [INFO ] Deduced a trap composed of 52 places in 621 ms of which 10 ms to minimize.
[2024-05-31 18:24:11] [INFO ] Deduced a trap composed of 52 places in 609 ms of which 11 ms to minimize.
[2024-05-31 18:24:12] [INFO ] Deduced a trap composed of 52 places in 585 ms of which 10 ms to minimize.
[2024-05-31 18:24:13] [INFO ] Deduced a trap composed of 52 places in 565 ms of which 9 ms to minimize.
[2024-05-31 18:24:13] [INFO ] Deduced a trap composed of 52 places in 551 ms of which 10 ms to minimize.
[2024-05-31 18:24:14] [INFO ] Deduced a trap composed of 52 places in 558 ms of which 10 ms to minimize.
[2024-05-31 18:24:14] [INFO ] Deduced a trap composed of 52 places in 535 ms of which 9 ms to minimize.
[2024-05-31 18:24:15] [INFO ] Deduced a trap composed of 52 places in 542 ms of which 9 ms to minimize.
SMT process timed out in 62720ms, After SMT, problems are : Problem set: 0 solved, 3604 unsolved
Search for dead transitions found 0 dead transitions in 62755ms
Starting structural reductions in LTL mode, iteration 1 : 2084/2099 places, 3644/3674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89277 ms. Remains : 2084/2099 places, 3644/3674 transitions.
Stuttering acceptance computed with spot in 189 ms :[true, (OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-040-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLFireability-10 finished in 89494 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 2099 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2099/2099 places, 3674/3674 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 2083 transition count 3642
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 2083 transition count 3642
Applied a total of 32 rules in 248 ms. Remains 2083 /2099 variables (removed 16) and now considering 3642/3674 (removed 32) transitions.
// Phase 1: matrix 3642 rows 2083 cols
[2024-05-31 18:24:15] [INFO ] Computed 41 invariants in 22 ms
[2024-05-31 18:24:16] [INFO ] Implicit Places using invariants in 1077 ms returned []
[2024-05-31 18:24:16] [INFO ] Invariant cache hit.
[2024-05-31 18:24:18] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 18:24:42] [INFO ] Implicit Places using invariants and state equation in 25304 ms returned []
Implicit Place search using SMT with State Equation took 26386 ms to find 0 implicit places.
Running 3602 sub problems to find dead transitions.
[2024-05-31 18:24:42] [INFO ] Invariant cache hit.
[2024-05-31 18:24:42] [INFO ] State equation strengthened by 3160 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2082 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2082/5725 variables, and 41 constraints, problems are : Problem set: 0 solved, 3602 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 0/2083 constraints, ReadFeed: 0/3160 constraints, PredecessorRefiner: 3602/3602 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2082 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3602 unsolved
[2024-05-31 18:25:38] [INFO ] Deduced a trap composed of 52 places in 715 ms of which 12 ms to minimize.
[2024-05-31 18:25:39] [INFO ] Deduced a trap composed of 52 places in 648 ms of which 11 ms to minimize.
[2024-05-31 18:25:39] [INFO ] Deduced a trap composed of 52 places in 625 ms of which 11 ms to minimize.
[2024-05-31 18:25:40] [INFO ] Deduced a trap composed of 52 places in 606 ms of which 10 ms to minimize.
[2024-05-31 18:25:41] [INFO ] Deduced a trap composed of 52 places in 637 ms of which 10 ms to minimize.
[2024-05-31 18:25:41] [INFO ] Deduced a trap composed of 52 places in 604 ms of which 10 ms to minimize.
[2024-05-31 18:25:42] [INFO ] Deduced a trap composed of 52 places in 594 ms of which 10 ms to minimize.
[2024-05-31 18:25:43] [INFO ] Deduced a trap composed of 52 places in 578 ms of which 9 ms to minimize.
[2024-05-31 18:25:43] [INFO ] Deduced a trap composed of 52 places in 536 ms of which 9 ms to minimize.
[2024-05-31 18:25:44] [INFO ] Deduced a trap composed of 52 places in 553 ms of which 10 ms to minimize.
[2024-05-31 18:25:44] [INFO ] Deduced a trap composed of 52 places in 572 ms of which 9 ms to minimize.
SMT process timed out in 62513ms, After SMT, problems are : Problem set: 0 solved, 3602 unsolved
Search for dead transitions found 0 dead transitions in 62552ms
Starting structural reductions in LTL mode, iteration 1 : 2083/2099 places, 3642/3674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89202 ms. Remains : 2083/2099 places, 3642/3674 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-11
Entered a terminal (fully accepting) state of product in 278 steps with 0 reset in 4 ms.
FORMULA CANConstruction-PT-040-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLFireability-11 finished in 89318 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G((p0&&X(p1)))||(p2&&X(G(p3)))))))'
Support contains 6 out of 2099 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2099/2099 places, 3674/3674 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 2084 transition count 3644
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 2084 transition count 3644
Applied a total of 30 rules in 280 ms. Remains 2084 /2099 variables (removed 15) and now considering 3644/3674 (removed 30) transitions.
// Phase 1: matrix 3644 rows 2084 cols
[2024-05-31 18:25:45] [INFO ] Computed 41 invariants in 24 ms
[2024-05-31 18:25:46] [INFO ] Implicit Places using invariants in 1078 ms returned []
[2024-05-31 18:25:46] [INFO ] Invariant cache hit.
[2024-05-31 18:25:47] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 18:26:15] [INFO ] Implicit Places using invariants and state equation in 28825 ms returned []
Implicit Place search using SMT with State Equation took 29907 ms to find 0 implicit places.
Running 3604 sub problems to find dead transitions.
[2024-05-31 18:26:15] [INFO ] Invariant cache hit.
[2024-05-31 18:26:15] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2083 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2083/5728 variables, and 41 constraints, problems are : Problem set: 0 solved, 3604 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 0/2084 constraints, ReadFeed: 0/3160 constraints, PredecessorRefiner: 3604/3604 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2083 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3604 unsolved
[2024-05-31 18:27:10] [INFO ] Deduced a trap composed of 52 places in 708 ms of which 11 ms to minimize.
[2024-05-31 18:27:11] [INFO ] Deduced a trap composed of 52 places in 657 ms of which 11 ms to minimize.
[2024-05-31 18:27:12] [INFO ] Deduced a trap composed of 52 places in 623 ms of which 11 ms to minimize.
[2024-05-31 18:27:12] [INFO ] Deduced a trap composed of 52 places in 650 ms of which 13 ms to minimize.
[2024-05-31 18:27:13] [INFO ] Deduced a trap composed of 52 places in 615 ms of which 10 ms to minimize.
[2024-05-31 18:27:14] [INFO ] Deduced a trap composed of 52 places in 579 ms of which 11 ms to minimize.
[2024-05-31 18:27:14] [INFO ] Deduced a trap composed of 52 places in 574 ms of which 9 ms to minimize.
[2024-05-31 18:27:15] [INFO ] Deduced a trap composed of 52 places in 573 ms of which 10 ms to minimize.
[2024-05-31 18:27:15] [INFO ] Deduced a trap composed of 52 places in 568 ms of which 10 ms to minimize.
[2024-05-31 18:27:16] [INFO ] Deduced a trap composed of 52 places in 529 ms of which 9 ms to minimize.
[2024-05-31 18:27:17] [INFO ] Deduced a trap composed of 52 places in 569 ms of which 9 ms to minimize.
[2024-05-31 18:27:17] [INFO ] Deduced a trap composed of 52 places in 507 ms of which 9 ms to minimize.
SMT process timed out in 62479ms, After SMT, problems are : Problem set: 0 solved, 3604 unsolved
Search for dead transitions found 0 dead transitions in 62513ms
Starting structural reductions in LTL mode, iteration 1 : 2084/2099 places, 3644/3674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92706 ms. Remains : 2084/2099 places, 3644/3674 transitions.
Stuttering acceptance computed with spot in 351 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), true, (OR (NOT p1) (NOT p0)), (NOT p3), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-040-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLFireability-13 finished in 93096 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 2099 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2099/2099 places, 3674/3674 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 264 transitions
Trivial Post-agglo rules discarded 264 transitions
Performed 264 trivial Post agglomeration. Transition count delta: 264
Iterating post reduction 0 with 264 rules applied. Total rules applied 264 place count 2099 transition count 3410
Reduce places removed 264 places and 0 transitions.
Iterating post reduction 1 with 264 rules applied. Total rules applied 528 place count 1835 transition count 3410
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 528 place count 1835 transition count 3370
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 608 place count 1795 transition count 3370
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 624 place count 1779 transition count 3338
Iterating global reduction 2 with 16 rules applied. Total rules applied 640 place count 1779 transition count 3338
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 2 with 14 rules applied. Total rules applied 654 place count 1779 transition count 3324
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 668 place count 1765 transition count 3324
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 748 place count 1725 transition count 3284
Applied a total of 748 rules in 398 ms. Remains 1725 /2099 variables (removed 374) and now considering 3284/3674 (removed 390) transitions.
// Phase 1: matrix 3284 rows 1725 cols
[2024-05-31 18:27:18] [INFO ] Computed 41 invariants in 27 ms
[2024-05-31 18:27:19] [INFO ] Implicit Places using invariants in 978 ms returned []
[2024-05-31 18:27:19] [INFO ] Invariant cache hit.
[2024-05-31 18:27:20] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 18:27:39] [INFO ] Implicit Places using invariants and state equation in 20411 ms returned []
Implicit Place search using SMT with State Equation took 21391 ms to find 0 implicit places.
[2024-05-31 18:27:40] [INFO ] Redundant transitions in 178 ms returned []
Running 3244 sub problems to find dead transitions.
[2024-05-31 18:27:40] [INFO ] Invariant cache hit.
[2024-05-31 18:27:40] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1724 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3244 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1724/5009 variables, and 41 constraints, problems are : Problem set: 0 solved, 3244 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 0/1725 constraints, ReadFeed: 0/3160 constraints, PredecessorRefiner: 3244/3244 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3244 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1724 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3244 unsolved
[2024-05-31 18:28:14] [INFO ] Deduced a trap composed of 43 places in 650 ms of which 10 ms to minimize.
[2024-05-31 18:28:17] [INFO ] Deduced a trap composed of 43 places in 1266 ms of which 10 ms to minimize.
[2024-05-31 18:28:18] [INFO ] Deduced a trap composed of 43 places in 1252 ms of which 10 ms to minimize.
[2024-05-31 18:28:19] [INFO ] Deduced a trap composed of 43 places in 1246 ms of which 11 ms to minimize.
[2024-05-31 18:28:20] [INFO ] Deduced a trap composed of 43 places in 1218 ms of which 14 ms to minimize.
[2024-05-31 18:28:22] [INFO ] Deduced a trap composed of 43 places in 1224 ms of which 10 ms to minimize.
[2024-05-31 18:28:24] [INFO ] Deduced a trap composed of 43 places in 631 ms of which 11 ms to minimize.
[2024-05-31 18:28:25] [INFO ] Deduced a trap composed of 44 places in 595 ms of which 10 ms to minimize.
[2024-05-31 18:28:26] [INFO ] Deduced a trap composed of 44 places in 580 ms of which 9 ms to minimize.
[2024-05-31 18:28:26] [INFO ] Deduced a trap composed of 43 places in 603 ms of which 10 ms to minimize.
[2024-05-31 18:28:27] [INFO ] Deduced a trap composed of 43 places in 652 ms of which 10 ms to minimize.
[2024-05-31 18:28:28] [INFO ] Deduced a trap composed of 44 places in 598 ms of which 10 ms to minimize.
[2024-05-31 18:28:28] [INFO ] Deduced a trap composed of 43 places in 629 ms of which 9 ms to minimize.
[2024-05-31 18:28:29] [INFO ] Deduced a trap composed of 44 places in 618 ms of which 10 ms to minimize.
[2024-05-31 18:28:31] [INFO ] Deduced a trap composed of 44 places in 1220 ms of which 11 ms to minimize.
[2024-05-31 18:28:32] [INFO ] Deduced a trap composed of 43 places in 1202 ms of which 11 ms to minimize.
[2024-05-31 18:28:34] [INFO ] Deduced a trap composed of 43 places in 1298 ms of which 10 ms to minimize.
[2024-05-31 18:28:35] [INFO ] Deduced a trap composed of 43 places in 1153 ms of which 10 ms to minimize.
[2024-05-31 18:28:36] [INFO ] Deduced a trap composed of 43 places in 1138 ms of which 10 ms to minimize.
[2024-05-31 18:28:37] [INFO ] Deduced a trap composed of 44 places in 1165 ms of which 11 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1724 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 3244 unsolved
[2024-05-31 18:28:39] [INFO ] Deduced a trap composed of 43 places in 603 ms of which 10 ms to minimize.
[2024-05-31 18:28:39] [INFO ] Deduced a trap composed of 43 places in 603 ms of which 9 ms to minimize.
[2024-05-31 18:28:40] [INFO ] Deduced a trap composed of 43 places in 661 ms of which 9 ms to minimize.
[2024-05-31 18:28:41] [INFO ] Deduced a trap composed of 44 places in 606 ms of which 9 ms to minimize.
[2024-05-31 18:28:41] [INFO ] Deduced a trap composed of 44 places in 616 ms of which 9 ms to minimize.
[2024-05-31 18:28:42] [INFO ] Deduced a trap composed of 44 places in 617 ms of which 10 ms to minimize.
SMT process timed out in 62416ms, After SMT, problems are : Problem set: 0 solved, 3244 unsolved
Search for dead transitions found 0 dead transitions in 62447ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1725/2099 places, 3284/3674 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 84434 ms. Remains : 1725/2099 places, 3284/3674 transitions.
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-14
Stuttering criterion allowed to conclude after 261 steps with 0 reset in 2 ms.
FORMULA CANConstruction-PT-040-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLFireability-14 finished in 84490 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&&(!p1 U (G(!p1)||(!p1&&G(p2))))))))'
Support contains 4 out of 2099 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2099/2099 places, 3674/3674 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 265 transitions
Trivial Post-agglo rules discarded 265 transitions
Performed 265 trivial Post agglomeration. Transition count delta: 265
Iterating post reduction 0 with 265 rules applied. Total rules applied 265 place count 2099 transition count 3409
Reduce places removed 265 places and 0 transitions.
Iterating post reduction 1 with 265 rules applied. Total rules applied 530 place count 1834 transition count 3409
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 530 place count 1834 transition count 3369
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 610 place count 1794 transition count 3369
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 625 place count 1779 transition count 3339
Iterating global reduction 2 with 15 rules applied. Total rules applied 640 place count 1779 transition count 3339
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 2 with 13 rules applied. Total rules applied 653 place count 1779 transition count 3326
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 666 place count 1766 transition count 3326
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 748 place count 1725 transition count 3285
Applied a total of 748 rules in 411 ms. Remains 1725 /2099 variables (removed 374) and now considering 3285/3674 (removed 389) transitions.
// Phase 1: matrix 3285 rows 1725 cols
[2024-05-31 18:28:42] [INFO ] Computed 41 invariants in 17 ms
[2024-05-31 18:28:43] [INFO ] Implicit Places using invariants in 975 ms returned []
[2024-05-31 18:28:43] [INFO ] Invariant cache hit.
[2024-05-31 18:28:44] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 18:29:03] [INFO ] Implicit Places using invariants and state equation in 19373 ms returned []
Implicit Place search using SMT with State Equation took 20350 ms to find 0 implicit places.
[2024-05-31 18:29:03] [INFO ] Redundant transitions in 83 ms returned []
Running 3245 sub problems to find dead transitions.
[2024-05-31 18:29:03] [INFO ] Invariant cache hit.
[2024-05-31 18:29:03] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1724 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1724/5010 variables, and 41 constraints, problems are : Problem set: 0 solved, 3245 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 0/1725 constraints, ReadFeed: 0/3160 constraints, PredecessorRefiner: 3245/3245 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3245 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1724 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3245 unsolved
[2024-05-31 18:29:38] [INFO ] Deduced a trap composed of 43 places in 685 ms of which 10 ms to minimize.
[2024-05-31 18:29:38] [INFO ] Deduced a trap composed of 43 places in 664 ms of which 9 ms to minimize.
[2024-05-31 18:29:42] [INFO ] Deduced a trap composed of 54 places in 645 ms of which 9 ms to minimize.
[2024-05-31 18:29:43] [INFO ] Deduced a trap composed of 43 places in 676 ms of which 10 ms to minimize.
[2024-05-31 18:29:44] [INFO ] Deduced a trap composed of 54 places in 647 ms of which 9 ms to minimize.
[2024-05-31 18:29:44] [INFO ] Deduced a trap composed of 44 places in 660 ms of which 10 ms to minimize.
[2024-05-31 18:29:45] [INFO ] Deduced a trap composed of 44 places in 632 ms of which 10 ms to minimize.
[2024-05-31 18:29:46] [INFO ] Deduced a trap composed of 53 places in 635 ms of which 10 ms to minimize.
[2024-05-31 18:29:46] [INFO ] Deduced a trap composed of 44 places in 639 ms of which 10 ms to minimize.
[2024-05-31 18:29:47] [INFO ] Deduced a trap composed of 44 places in 625 ms of which 9 ms to minimize.
[2024-05-31 18:29:47] [INFO ] Deduced a trap composed of 43 places in 604 ms of which 9 ms to minimize.
[2024-05-31 18:29:48] [INFO ] Deduced a trap composed of 44 places in 618 ms of which 10 ms to minimize.
[2024-05-31 18:29:49] [INFO ] Deduced a trap composed of 43 places in 605 ms of which 10 ms to minimize.
[2024-05-31 18:29:49] [INFO ] Deduced a trap composed of 43 places in 590 ms of which 9 ms to minimize.
[2024-05-31 18:29:50] [INFO ] Deduced a trap composed of 43 places in 599 ms of which 9 ms to minimize.
[2024-05-31 18:29:51] [INFO ] Deduced a trap composed of 44 places in 621 ms of which 9 ms to minimize.
[2024-05-31 18:29:51] [INFO ] Deduced a trap composed of 43 places in 590 ms of which 9 ms to minimize.
[2024-05-31 18:29:52] [INFO ] Deduced a trap composed of 43 places in 625 ms of which 10 ms to minimize.
[2024-05-31 18:29:54] [INFO ] Deduced a trap composed of 49 places in 1246 ms of which 10 ms to minimize.
[2024-05-31 18:29:56] [INFO ] Deduced a trap composed of 43 places in 1218 ms of which 9 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1724 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 3245 unsolved
[2024-05-31 18:29:57] [INFO ] Deduced a trap composed of 43 places in 569 ms of which 9 ms to minimize.
[2024-05-31 18:29:57] [INFO ] Deduced a trap composed of 43 places in 589 ms of which 9 ms to minimize.
[2024-05-31 18:29:58] [INFO ] Deduced a trap composed of 52 places in 631 ms of which 9 ms to minimize.
[2024-05-31 18:29:59] [INFO ] Deduced a trap composed of 43 places in 623 ms of which 9 ms to minimize.
[2024-05-31 18:29:59] [INFO ] Deduced a trap composed of 43 places in 625 ms of which 9 ms to minimize.
[2024-05-31 18:30:00] [INFO ] Deduced a trap composed of 43 places in 603 ms of which 9 ms to minimize.
[2024-05-31 18:30:01] [INFO ] Deduced a trap composed of 43 places in 604 ms of which 9 ms to minimize.
[2024-05-31 18:30:01] [INFO ] Deduced a trap composed of 43 places in 584 ms of which 9 ms to minimize.
[2024-05-31 18:30:02] [INFO ] Deduced a trap composed of 43 places in 556 ms of which 9 ms to minimize.
[2024-05-31 18:30:03] [INFO ] Deduced a trap composed of 43 places in 613 ms of which 9 ms to minimize.
[2024-05-31 18:30:03] [INFO ] Deduced a trap composed of 43 places in 644 ms of which 9 ms to minimize.
[2024-05-31 18:30:04] [INFO ] Deduced a trap composed of 43 places in 621 ms of which 9 ms to minimize.
[2024-05-31 18:30:04] [INFO ] Deduced a trap composed of 43 places in 606 ms of which 9 ms to minimize.
[2024-05-31 18:30:05] [INFO ] Deduced a trap composed of 43 places in 598 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1724/5010 variables, and 75 constraints, problems are : Problem set: 0 solved, 3245 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 0/1725 constraints, ReadFeed: 0/3160 constraints, PredecessorRefiner: 0/3245 constraints, Known Traps: 34/34 constraints]
After SMT, in 62242ms problems are : Problem set: 0 solved, 3245 unsolved
Search for dead transitions found 0 dead transitions in 62271ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1725/2099 places, 3285/3674 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 83137 ms. Remains : 1725/2099 places, 3285/3674 transitions.
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-15
Product exploration explored 100000 steps with 366 reset in 751 ms.
Stack based approach found an accepted trace after 87814 steps with 319 reset with depth 173 and stack size 172 in 688 ms.
FORMULA CANConstruction-PT-040-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-040-LTLFireability-15 finished in 84844 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(p1)))))'
Found a Lengthening insensitive property : CANConstruction-PT-040-LTLFireability-09
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 2099 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2099/2099 places, 3674/3674 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 265 transitions
Trivial Post-agglo rules discarded 265 transitions
Performed 265 trivial Post agglomeration. Transition count delta: 265
Iterating post reduction 0 with 265 rules applied. Total rules applied 265 place count 2099 transition count 3409
Reduce places removed 265 places and 0 transitions.
Iterating post reduction 1 with 265 rules applied. Total rules applied 530 place count 1834 transition count 3409
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 530 place count 1834 transition count 3369
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 610 place count 1794 transition count 3369
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 625 place count 1779 transition count 3339
Iterating global reduction 2 with 15 rules applied. Total rules applied 640 place count 1779 transition count 3339
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 2 with 13 rules applied. Total rules applied 653 place count 1779 transition count 3326
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 666 place count 1766 transition count 3326
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 748 place count 1725 transition count 3285
Applied a total of 748 rules in 409 ms. Remains 1725 /2099 variables (removed 374) and now considering 3285/3674 (removed 389) transitions.
// Phase 1: matrix 3285 rows 1725 cols
[2024-05-31 18:30:07] [INFO ] Computed 41 invariants in 17 ms
[2024-05-31 18:30:09] [INFO ] Implicit Places using invariants in 1050 ms returned []
[2024-05-31 18:30:09] [INFO ] Invariant cache hit.
[2024-05-31 18:30:09] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 18:30:31] [INFO ] Implicit Places using invariants and state equation in 22422 ms returned []
Implicit Place search using SMT with State Equation took 23482 ms to find 0 implicit places.
Running 3245 sub problems to find dead transitions.
[2024-05-31 18:30:31] [INFO ] Invariant cache hit.
[2024-05-31 18:30:31] [INFO ] State equation strengthened by 3160 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1724 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1724/5010 variables, and 41 constraints, problems are : Problem set: 0 solved, 3245 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 0/1725 constraints, ReadFeed: 0/3160 constraints, PredecessorRefiner: 3245/3245 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3245 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1724 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3245 unsolved
[2024-05-31 18:31:05] [INFO ] Deduced a trap composed of 43 places in 656 ms of which 10 ms to minimize.
[2024-05-31 18:31:07] [INFO ] Deduced a trap composed of 43 places in 1113 ms of which 11 ms to minimize.
[2024-05-31 18:31:08] [INFO ] Deduced a trap composed of 43 places in 1099 ms of which 10 ms to minimize.
[2024-05-31 18:31:10] [INFO ] Deduced a trap composed of 44 places in 1098 ms of which 10 ms to minimize.
[2024-05-31 18:31:11] [INFO ] Deduced a trap composed of 43 places in 1124 ms of which 10 ms to minimize.
[2024-05-31 18:31:12] [INFO ] Deduced a trap composed of 43 places in 1070 ms of which 10 ms to minimize.
[2024-05-31 18:31:13] [INFO ] Deduced a trap composed of 43 places in 1178 ms of which 10 ms to minimize.
[2024-05-31 18:31:15] [INFO ] Deduced a trap composed of 43 places in 1212 ms of which 10 ms to minimize.
[2024-05-31 18:31:16] [INFO ] Deduced a trap composed of 43 places in 1170 ms of which 10 ms to minimize.
[2024-05-31 18:31:17] [INFO ] Deduced a trap composed of 44 places in 1189 ms of which 11 ms to minimize.
[2024-05-31 18:31:20] [INFO ] Deduced a trap composed of 43 places in 635 ms of which 9 ms to minimize.
[2024-05-31 18:31:20] [INFO ] Deduced a trap composed of 43 places in 658 ms of which 9 ms to minimize.
[2024-05-31 18:31:21] [INFO ] Deduced a trap composed of 43 places in 658 ms of which 10 ms to minimize.
[2024-05-31 18:31:22] [INFO ] Deduced a trap composed of 3 places in 1207 ms of which 10 ms to minimize.
[2024-05-31 18:31:24] [INFO ] Deduced a trap composed of 3 places in 1216 ms of which 11 ms to minimize.
[2024-05-31 18:31:25] [INFO ] Deduced a trap composed of 2 places in 1172 ms of which 11 ms to minimize.
[2024-05-31 18:31:26] [INFO ] Deduced a trap composed of 2 places in 1226 ms of which 11 ms to minimize.
[2024-05-31 18:31:27] [INFO ] Deduced a trap composed of 3 places in 1226 ms of which 10 ms to minimize.
[2024-05-31 18:31:28] [INFO ] Deduced a trap composed of 3 places in 1172 ms of which 10 ms to minimize.
[2024-05-31 18:31:30] [INFO ] Deduced a trap composed of 42 places in 1248 ms of which 11 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1724 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 3245 unsolved
[2024-05-31 18:31:33] [INFO ] Deduced a trap composed of 43 places in 1179 ms of which 10 ms to minimize.
[2024-05-31 18:31:34] [INFO ] Deduced a trap composed of 43 places in 1235 ms of which 10 ms to minimize.
SMT process timed out in 63078ms, After SMT, problems are : Problem set: 0 solved, 3245 unsolved
Search for dead transitions found 0 dead transitions in 63104ms
Starting structural reductions in LI_LTL mode, iteration 1 : 1725/2099 places, 3285/3674 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 87008 ms. Remains : 1725/2099 places, 3285/3674 transitions.
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-09
Product exploration explored 100000 steps with 359 reset in 688 ms.
Product exploration explored 100000 steps with 359 reset in 766 ms.
Computed a total of 41 stabilizing places and 80 stable transitions
Computed a total of 41 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 140 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 39198 steps (141 resets) in 463 ms. (84 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 13 factoid took 351 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1725 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1725/1725 places, 3285/3285 transitions.
Applied a total of 0 rules in 86 ms. Remains 1725 /1725 variables (removed 0) and now considering 3285/3285 (removed 0) transitions.
[2024-05-31 18:31:37] [INFO ] Invariant cache hit.
[2024-05-31 18:31:37] [INFO ] Implicit Places using invariants in 902 ms returned []
[2024-05-31 18:31:37] [INFO ] Invariant cache hit.
[2024-05-31 18:31:38] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 18:32:00] [INFO ] Implicit Places using invariants and state equation in 22137 ms returned []
Implicit Place search using SMT with State Equation took 23041 ms to find 0 implicit places.
Running 3245 sub problems to find dead transitions.
[2024-05-31 18:32:00] [INFO ] Invariant cache hit.
[2024-05-31 18:32:00] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1724 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1724/5010 variables, and 41 constraints, problems are : Problem set: 0 solved, 3245 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 0/1725 constraints, ReadFeed: 0/3160 constraints, PredecessorRefiner: 3245/3245 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3245 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1724 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3245 unsolved
[2024-05-31 18:32:34] [INFO ] Deduced a trap composed of 43 places in 691 ms of which 11 ms to minimize.
[2024-05-31 18:32:36] [INFO ] Deduced a trap composed of 43 places in 1179 ms of which 12 ms to minimize.
[2024-05-31 18:32:38] [INFO ] Deduced a trap composed of 43 places in 1163 ms of which 10 ms to minimize.
[2024-05-31 18:32:39] [INFO ] Deduced a trap composed of 44 places in 1176 ms of which 11 ms to minimize.
[2024-05-31 18:32:40] [INFO ] Deduced a trap composed of 43 places in 1187 ms of which 11 ms to minimize.
[2024-05-31 18:32:41] [INFO ] Deduced a trap composed of 43 places in 1129 ms of which 11 ms to minimize.
[2024-05-31 18:32:43] [INFO ] Deduced a trap composed of 43 places in 1223 ms of which 11 ms to minimize.
[2024-05-31 18:32:44] [INFO ] Deduced a trap composed of 43 places in 1268 ms of which 11 ms to minimize.
[2024-05-31 18:32:45] [INFO ] Deduced a trap composed of 43 places in 1186 ms of which 9 ms to minimize.
[2024-05-31 18:32:46] [INFO ] Deduced a trap composed of 44 places in 1191 ms of which 11 ms to minimize.
[2024-05-31 18:32:49] [INFO ] Deduced a trap composed of 43 places in 624 ms of which 10 ms to minimize.
[2024-05-31 18:32:50] [INFO ] Deduced a trap composed of 43 places in 670 ms of which 10 ms to minimize.
[2024-05-31 18:32:51] [INFO ] Deduced a trap composed of 43 places in 670 ms of which 10 ms to minimize.
[2024-05-31 18:32:52] [INFO ] Deduced a trap composed of 3 places in 1209 ms of which 11 ms to minimize.
[2024-05-31 18:32:53] [INFO ] Deduced a trap composed of 3 places in 1171 ms of which 11 ms to minimize.
[2024-05-31 18:32:54] [INFO ] Deduced a trap composed of 2 places in 1269 ms of which 12 ms to minimize.
[2024-05-31 18:32:56] [INFO ] Deduced a trap composed of 2 places in 1282 ms of which 11 ms to minimize.
[2024-05-31 18:32:57] [INFO ] Deduced a trap composed of 3 places in 1247 ms of which 11 ms to minimize.
[2024-05-31 18:32:58] [INFO ] Deduced a trap composed of 3 places in 1234 ms of which 11 ms to minimize.
[2024-05-31 18:32:59] [INFO ] Deduced a trap composed of 42 places in 1301 ms of which 11 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1724 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 3245 unsolved
[2024-05-31 18:33:03] [INFO ] Deduced a trap composed of 43 places in 1211 ms of which 10 ms to minimize.
SMT process timed out in 62955ms, After SMT, problems are : Problem set: 0 solved, 3245 unsolved
Search for dead transitions found 0 dead transitions in 62988ms
Finished structural reductions in LTL mode , in 1 iterations and 86121 ms. Remains : 1725/1725 places, 3285/3285 transitions.
Computed a total of 41 stabilizing places and 80 stable transitions
Computed a total of 41 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 130 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (144 resets) in 1960 ms. (20 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
[2024-05-31 18:33:03] [INFO ] Invariant cache hit.
[2024-05-31 18:33:04] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1684/1688 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 18:33:05] [INFO ] Deduced a trap composed of 2 places in 1068 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1688 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1688 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 36/1724 variables, 36/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 18:33:06] [INFO ] Deduced a trap composed of 43 places in 1235 ms of which 11 ms to minimize.
[2024-05-31 18:33:07] [INFO ] Deduced a trap composed of 43 places in 1287 ms of which 11 ms to minimize.
[2024-05-31 18:33:09] [INFO ] Deduced a trap composed of 43 places in 1240 ms of which 11 ms to minimize.
SMT process timed out in 5245ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1725 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1725/1725 places, 3285/3285 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1725 transition count 3284
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1724 transition count 3284
Applied a total of 2 rules in 236 ms. Remains 1724 /1725 variables (removed 1) and now considering 3284/3285 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 236 ms. Remains : 1724/1725 places, 3284/3285 transitions.
RANDOM walk for 40000 steps (144 resets) in 380 ms. (104 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 120250 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 1
Probabilistic random walk after 120250 steps, saw 33648 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
// Phase 1: matrix 3284 rows 1724 cols
[2024-05-31 18:33:12] [INFO ] Computed 41 invariants in 24 ms
[2024-05-31 18:33:12] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1683/1687 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 18:33:13] [INFO ] Deduced a trap composed of 2 places in 1058 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1687 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1687 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 36/1723 variables, 36/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 18:33:15] [INFO ] Deduced a trap composed of 43 places in 1159 ms of which 11 ms to minimize.
[2024-05-31 18:33:16] [INFO ] Deduced a trap composed of 43 places in 1177 ms of which 14 ms to minimize.
[2024-05-31 18:33:17] [INFO ] Deduced a trap composed of 44 places in 1174 ms of which 11 ms to minimize.
[2024-05-31 18:33:18] [INFO ] Deduced a trap composed of 44 places in 1176 ms of which 11 ms to minimize.
[2024-05-31 18:33:20] [INFO ] Deduced a trap composed of 43 places in 1124 ms of which 11 ms to minimize.
[2024-05-31 18:33:21] [INFO ] Deduced a trap composed of 43 places in 1107 ms of which 11 ms to minimize.
[2024-05-31 18:33:22] [INFO ] Deduced a trap composed of 43 places in 1128 ms of which 11 ms to minimize.
[2024-05-31 18:33:23] [INFO ] Deduced a trap composed of 43 places in 1100 ms of which 11 ms to minimize.
[2024-05-31 18:33:24] [INFO ] Deduced a trap composed of 43 places in 1138 ms of which 11 ms to minimize.
[2024-05-31 18:33:25] [INFO ] Deduced a trap composed of 43 places in 1109 ms of which 11 ms to minimize.
[2024-05-31 18:33:26] [INFO ] Deduced a trap composed of 44 places in 1136 ms of which 12 ms to minimize.
[2024-05-31 18:33:27] [INFO ] Deduced a trap composed of 43 places in 1084 ms of which 10 ms to minimize.
[2024-05-31 18:33:29] [INFO ] Deduced a trap composed of 44 places in 1046 ms of which 10 ms to minimize.
[2024-05-31 18:33:30] [INFO ] Deduced a trap composed of 43 places in 1034 ms of which 10 ms to minimize.
[2024-05-31 18:33:31] [INFO ] Deduced a trap composed of 43 places in 1047 ms of which 11 ms to minimize.
[2024-05-31 18:33:32] [INFO ] Deduced a trap composed of 45 places in 975 ms of which 10 ms to minimize.
[2024-05-31 18:33:33] [INFO ] Deduced a trap composed of 43 places in 988 ms of which 10 ms to minimize.
[2024-05-31 18:33:34] [INFO ] Deduced a trap composed of 43 places in 992 ms of which 11 ms to minimize.
[2024-05-31 18:33:35] [INFO ] Deduced a trap composed of 43 places in 1003 ms of which 11 ms to minimize.
[2024-05-31 18:33:36] [INFO ] Deduced a trap composed of 45 places in 942 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1723 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 18:33:37] [INFO ] Deduced a trap composed of 46 places in 897 ms of which 11 ms to minimize.
[2024-05-31 18:33:38] [INFO ] Deduced a trap composed of 43 places in 918 ms of which 9 ms to minimize.
[2024-05-31 18:33:39] [INFO ] Deduced a trap composed of 43 places in 931 ms of which 10 ms to minimize.
[2024-05-31 18:33:40] [INFO ] Deduced a trap composed of 43 places in 953 ms of which 11 ms to minimize.
[2024-05-31 18:33:41] [INFO ] Deduced a trap composed of 43 places in 944 ms of which 10 ms to minimize.
[2024-05-31 18:33:41] [INFO ] Deduced a trap composed of 43 places in 939 ms of which 10 ms to minimize.
[2024-05-31 18:33:42] [INFO ] Deduced a trap composed of 43 places in 938 ms of which 10 ms to minimize.
[2024-05-31 18:33:43] [INFO ] Deduced a trap composed of 43 places in 932 ms of which 10 ms to minimize.
[2024-05-31 18:33:44] [INFO ] Deduced a trap composed of 45 places in 961 ms of which 10 ms to minimize.
[2024-05-31 18:33:45] [INFO ] Deduced a trap composed of 44 places in 970 ms of which 10 ms to minimize.
[2024-05-31 18:33:46] [INFO ] Deduced a trap composed of 43 places in 938 ms of which 11 ms to minimize.
[2024-05-31 18:33:47] [INFO ] Deduced a trap composed of 43 places in 966 ms of which 11 ms to minimize.
[2024-05-31 18:33:48] [INFO ] Deduced a trap composed of 43 places in 895 ms of which 10 ms to minimize.
[2024-05-31 18:33:49] [INFO ] Deduced a trap composed of 43 places in 963 ms of which 10 ms to minimize.
[2024-05-31 18:33:50] [INFO ] Deduced a trap composed of 43 places in 940 ms of which 10 ms to minimize.
[2024-05-31 18:33:51] [INFO ] Deduced a trap composed of 43 places in 868 ms of which 11 ms to minimize.
[2024-05-31 18:33:52] [INFO ] Deduced a trap composed of 43 places in 874 ms of which 10 ms to minimize.
[2024-05-31 18:33:53] [INFO ] Deduced a trap composed of 50 places in 903 ms of which 11 ms to minimize.
[2024-05-31 18:33:54] [INFO ] Deduced a trap composed of 50 places in 930 ms of which 11 ms to minimize.
[2024-05-31 18:33:55] [INFO ] Deduced a trap composed of 43 places in 932 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1723 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 18:33:56] [INFO ] Deduced a trap composed of 43 places in 941 ms of which 10 ms to minimize.
[2024-05-31 18:33:57] [INFO ] Deduced a trap composed of 43 places in 944 ms of which 10 ms to minimize.
[2024-05-31 18:33:58] [INFO ] Deduced a trap composed of 43 places in 935 ms of which 11 ms to minimize.
SMT process timed out in 45699ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1724 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1724/1724 places, 3284/3284 transitions.
Applied a total of 0 rules in 129 ms. Remains 1724 /1724 variables (removed 0) and now considering 3284/3284 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 1724/1724 places, 3284/3284 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1724/1724 places, 3284/3284 transitions.
Applied a total of 0 rules in 112 ms. Remains 1724 /1724 variables (removed 0) and now considering 3284/3284 (removed 0) transitions.
[2024-05-31 18:33:58] [INFO ] Invariant cache hit.
[2024-05-31 18:33:59] [INFO ] Implicit Places using invariants in 950 ms returned []
[2024-05-31 18:33:59] [INFO ] Invariant cache hit.
[2024-05-31 18:34:00] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 18:34:23] [INFO ] Implicit Places using invariants and state equation in 23514 ms returned []
Implicit Place search using SMT with State Equation took 24466 ms to find 0 implicit places.
[2024-05-31 18:34:23] [INFO ] Redundant transitions in 84 ms returned []
Running 3244 sub problems to find dead transitions.
[2024-05-31 18:34:23] [INFO ] Invariant cache hit.
[2024-05-31 18:34:23] [INFO ] State equation strengthened by 3160 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 2.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1723 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3244 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1723/5008 variables, and 41 constraints, problems are : Problem set: 0 solved, 3244 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 0/1724 constraints, ReadFeed: 0/3160 constraints, PredecessorRefiner: 3244/3244 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3244 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1723 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3244 unsolved
[2024-05-31 18:34:57] [INFO ] Deduced a trap composed of 43 places in 715 ms of which 10 ms to minimize.
[2024-05-31 18:34:58] [INFO ] Deduced a trap composed of 43 places in 656 ms of which 10 ms to minimize.
[2024-05-31 18:35:00] [INFO ] Deduced a trap composed of 43 places in 1231 ms of which 11 ms to minimize.
[2024-05-31 18:35:01] [INFO ] Deduced a trap composed of 43 places in 1242 ms of which 11 ms to minimize.
[2024-05-31 18:35:03] [INFO ] Deduced a trap composed of 43 places in 1251 ms of which 11 ms to minimize.
[2024-05-31 18:35:04] [INFO ] Deduced a trap composed of 43 places in 1241 ms of which 11 ms to minimize.
[2024-05-31 18:35:05] [INFO ] Deduced a trap composed of 43 places in 1228 ms of which 11 ms to minimize.
[2024-05-31 18:35:09] [INFO ] Deduced a trap composed of 43 places in 611 ms of which 10 ms to minimize.
[2024-05-31 18:35:10] [INFO ] Deduced a trap composed of 43 places in 600 ms of which 9 ms to minimize.
[2024-05-31 18:35:11] [INFO ] Deduced a trap composed of 43 places in 597 ms of which 9 ms to minimize.
[2024-05-31 18:35:11] [INFO ] Deduced a trap composed of 43 places in 590 ms of which 10 ms to minimize.
[2024-05-31 18:35:12] [INFO ] Deduced a trap composed of 43 places in 597 ms of which 10 ms to minimize.
[2024-05-31 18:35:13] [INFO ] Deduced a trap composed of 43 places in 1228 ms of which 11 ms to minimize.
[2024-05-31 18:35:14] [INFO ] Deduced a trap composed of 43 places in 1243 ms of which 11 ms to minimize.
[2024-05-31 18:35:16] [INFO ] Deduced a trap composed of 50 places in 1227 ms of which 12 ms to minimize.
[2024-05-31 18:35:17] [INFO ] Deduced a trap composed of 43 places in 1189 ms of which 10 ms to minimize.
[2024-05-31 18:35:18] [INFO ] Deduced a trap composed of 43 places in 1204 ms of which 11 ms to minimize.
[2024-05-31 18:35:19] [INFO ] Deduced a trap composed of 47 places in 1188 ms of which 14 ms to minimize.
[2024-05-31 18:35:20] [INFO ] Deduced a trap composed of 45 places in 1105 ms of which 10 ms to minimize.
[2024-05-31 18:35:22] [INFO ] Deduced a trap composed of 44 places in 1142 ms of which 11 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1723 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 3244 unsolved
[2024-05-31 18:35:23] [INFO ] Deduced a trap composed of 52 places in 647 ms of which 9 ms to minimize.
[2024-05-31 18:35:24] [INFO ] Deduced a trap composed of 43 places in 674 ms of which 11 ms to minimize.
[2024-05-31 18:35:24] [INFO ] Deduced a trap composed of 50 places in 626 ms of which 9 ms to minimize.
[2024-05-31 18:35:25] [INFO ] Deduced a trap composed of 47 places in 653 ms of which 10 ms to minimize.
SMT process timed out in 62378ms, After SMT, problems are : Problem set: 0 solved, 3244 unsolved
Search for dead transitions found 0 dead transitions in 62406ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87083 ms. Remains : 1724/1724 places, 3284/3284 transitions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 13 factoid took 375 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 361 reset in 733 ms.
Product exploration explored 100000 steps with 361 reset in 736 ms.
Support contains 4 out of 1725 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1725/1725 places, 3285/3285 transitions.
Applied a total of 0 rules in 80 ms. Remains 1725 /1725 variables (removed 0) and now considering 3285/3285 (removed 0) transitions.
// Phase 1: matrix 3285 rows 1725 cols
[2024-05-31 18:35:27] [INFO ] Computed 41 invariants in 31 ms
[2024-05-31 18:35:28] [INFO ] Implicit Places using invariants in 946 ms returned []
[2024-05-31 18:35:28] [INFO ] Invariant cache hit.
[2024-05-31 18:35:29] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 18:35:52] [INFO ] Implicit Places using invariants and state equation in 23338 ms returned []
Implicit Place search using SMT with State Equation took 24287 ms to find 0 implicit places.
Running 3245 sub problems to find dead transitions.
[2024-05-31 18:35:52] [INFO ] Invariant cache hit.
[2024-05-31 18:35:52] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1724 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1724/5010 variables, and 41 constraints, problems are : Problem set: 0 solved, 3245 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 0/1725 constraints, ReadFeed: 0/3160 constraints, PredecessorRefiner: 3245/3245 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3245 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1724 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3245 unsolved
[2024-05-31 18:36:26] [INFO ] Deduced a trap composed of 43 places in 676 ms of which 11 ms to minimize.
[2024-05-31 18:36:28] [INFO ] Deduced a trap composed of 43 places in 1183 ms of which 11 ms to minimize.
[2024-05-31 18:36:30] [INFO ] Deduced a trap composed of 43 places in 1175 ms of which 11 ms to minimize.
[2024-05-31 18:36:31] [INFO ] Deduced a trap composed of 44 places in 1180 ms of which 11 ms to minimize.
[2024-05-31 18:36:32] [INFO ] Deduced a trap composed of 43 places in 1123 ms of which 11 ms to minimize.
[2024-05-31 18:36:33] [INFO ] Deduced a trap composed of 43 places in 1114 ms of which 11 ms to minimize.
[2024-05-31 18:36:34] [INFO ] Deduced a trap composed of 43 places in 1183 ms of which 10 ms to minimize.
[2024-05-31 18:36:36] [INFO ] Deduced a trap composed of 43 places in 1251 ms of which 11 ms to minimize.
[2024-05-31 18:36:37] [INFO ] Deduced a trap composed of 43 places in 1199 ms of which 12 ms to minimize.
[2024-05-31 18:36:38] [INFO ] Deduced a trap composed of 44 places in 1221 ms of which 11 ms to minimize.
[2024-05-31 18:36:41] [INFO ] Deduced a trap composed of 43 places in 627 ms of which 10 ms to minimize.
[2024-05-31 18:36:42] [INFO ] Deduced a trap composed of 43 places in 659 ms of which 10 ms to minimize.
[2024-05-31 18:36:42] [INFO ] Deduced a trap composed of 43 places in 663 ms of which 10 ms to minimize.
[2024-05-31 18:36:44] [INFO ] Deduced a trap composed of 3 places in 1289 ms of which 11 ms to minimize.
[2024-05-31 18:36:45] [INFO ] Deduced a trap composed of 3 places in 1182 ms of which 11 ms to minimize.
[2024-05-31 18:36:46] [INFO ] Deduced a trap composed of 2 places in 1275 ms of which 11 ms to minimize.
[2024-05-31 18:36:48] [INFO ] Deduced a trap composed of 2 places in 1263 ms of which 11 ms to minimize.
[2024-05-31 18:36:49] [INFO ] Deduced a trap composed of 3 places in 1244 ms of which 11 ms to minimize.
[2024-05-31 18:36:50] [INFO ] Deduced a trap composed of 3 places in 1249 ms of which 11 ms to minimize.
[2024-05-31 18:36:51] [INFO ] Deduced a trap composed of 42 places in 1303 ms of which 10 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1724 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 3245 unsolved
[2024-05-31 18:36:54] [INFO ] Deduced a trap composed of 43 places in 1272 ms of which 11 ms to minimize.
SMT process timed out in 62817ms, After SMT, problems are : Problem set: 0 solved, 3245 unsolved
Search for dead transitions found 0 dead transitions in 62844ms
Finished structural reductions in LTL mode , in 1 iterations and 87215 ms. Remains : 1725/1725 places, 3285/3285 transitions.
Treatment of property CANConstruction-PT-040-LTLFireability-09 finished in 407707 ms.
[2024-05-31 18:36:55] [INFO ] Flatten gal took : 105 ms
[2024-05-31 18:36:55] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-31 18:36:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2099 places, 3674 transitions and 13748 arcs took 21 ms.
Total runtime 2101924 ms.
There are residual formulas that ITS could not solve within timeout

BK_TIME_CONFINEMENT_REACHED

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024

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="CANConstruction-PT-040"
export BK_EXAMINATION="LTLFireability"
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 CANConstruction-PT-040, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r476-tall-171620505000036"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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