About the Execution of LTSMin+red for PolyORBLF-COL-S06J04T04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 573562.00 | 0.00 | 0.00 | ????????F???T??? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654446500170.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBLF-COL-S06J04T04, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446500170
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 7.2K Apr 11 17:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 11 17:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 11 17:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 11 17:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 17:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 11 17:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 11 17:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 11 17:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLFireability-2024-00
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLFireability-2024-01
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLFireability-2024-02
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLFireability-2024-03
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLFireability-2024-04
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLFireability-2024-05
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLFireability-2024-06
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLFireability-2024-07
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLFireability-2024-08
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLFireability-2024-09
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLFireability-2024-10
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLFireability-2024-11
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLFireability-2024-12
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLFireability-2024-13
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLFireability-2024-14
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717250813607
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S06J04T04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:06:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 14:06:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:06:55] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 14:06:55] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 14:06:56] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 823 ms
[2024-06-01 14:06:56] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 454 PT places and 7036.0 transition bindings in 30 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 17 ms.
[2024-06-01 14:06:56] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2024-06-01 14:06:56] [INFO ] Skeletonized 15 HLPN properties in 3 ms. Removed 1 properties that had guard overlaps.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 60 to 59
RANDOM walk for 40002 steps (3922 resets) in 1601 ms. (24 steps per ms) remains 31/59 properties
BEST_FIRST walk for 4002 steps (14 resets) in 67 ms. (58 steps per ms) remains 4/31 properties
BEST_FIRST walk for 4003 steps (25 resets) in 87 ms. (45 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4002 steps (15 resets) in 28 ms. (138 steps per ms) remains 3/4 properties
[2024-06-01 14:06:56] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-06-01 14:06:56] [INFO ] Computed 26 invariants in 15 ms
[2024-06-01 14:06:56] [INFO ] State equation strengthened by 8 read => feed constraints.
Problem AtomicPropp41 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 40/53 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 6/59 variables, 4/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/60 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp40 is UNSAT
After SMT solving in domain Real declared 81/145 variables, and 26 constraints, problems are : Problem set: 3 solved, 0 unsolved in 194 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 0/81 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 251ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
[2024-06-01 14:06:57] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 14:06:57] [INFO ] Flatten gal took : 27 ms
FORMULA PolyORBLF-COL-S06J04T04-CTLFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:06:57] [INFO ] Flatten gal took : 11 ms
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
[2024-06-01 14:06:57] [INFO ] Unfolded HLPN to a Petri net with 454 places and 6994 transitions 59152 arcs in 150 ms.
[2024-06-01 14:06:57] [INFO ] Unfolded 15 HLPN properties in 4 ms.
[2024-06-01 14:06:57] [INFO ] Reduced 4680 identical enabling conditions.
[2024-06-01 14:06:57] [INFO ] Reduced 60 identical enabling conditions.
[2024-06-01 14:06:57] [INFO ] Reduced 4680 identical enabling conditions.
[2024-06-01 14:06:57] [INFO ] Reduced 4680 identical enabling conditions.
[2024-06-01 14:06:57] [INFO ] Reduced 4680 identical enabling conditions.
[2024-06-01 14:06:57] [INFO ] Reduced 60 identical enabling conditions.
[2024-06-01 14:06:57] [INFO ] Reduced 640 identical enabling conditions.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Support contains 352 out of 454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 454/454 places, 1614/1614 transitions.
Applied a total of 0 rules in 34 ms. Remains 454 /454 variables (removed 0) and now considering 1614/1614 (removed 0) transitions.
Running 1608 sub problems to find dead transitions.
[2024-06-01 14:06:57] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
// Phase 1: matrix 1590 rows 454 cols
[2024-06-01 14:06:57] [INFO ] Computed 50 invariants in 78 ms
[2024-06-01 14:06:57] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-06-01 14:07:23] [INFO ] Deduced a trap composed of 85 places in 253 ms of which 19 ms to minimize.
[2024-06-01 14:07:23] [INFO ] Deduced a trap composed of 85 places in 172 ms of which 1 ms to minimize.
[2024-06-01 14:07:23] [INFO ] Deduced a trap composed of 85 places in 132 ms of which 2 ms to minimize.
[2024-06-01 14:07:24] [INFO ] Deduced a trap composed of 251 places in 523 ms of which 4 ms to minimize.
[2024-06-01 14:07:24] [INFO ] Deduced a trap composed of 260 places in 474 ms of which 5 ms to minimize.
[2024-06-01 14:07:25] [INFO ] Deduced a trap composed of 237 places in 313 ms of which 5 ms to minimize.
[2024-06-01 14:07:25] [INFO ] Deduced a trap composed of 245 places in 395 ms of which 3 ms to minimize.
[2024-06-01 14:07:25] [INFO ] Deduced a trap composed of 224 places in 350 ms of which 4 ms to minimize.
[2024-06-01 14:07:26] [INFO ] Deduced a trap composed of 107 places in 349 ms of which 3 ms to minimize.
[2024-06-01 14:07:27] [INFO ] Deduced a trap composed of 230 places in 415 ms of which 3 ms to minimize.
[2024-06-01 14:07:28] [INFO ] Deduced a trap composed of 89 places in 326 ms of which 2 ms to minimize.
[2024-06-01 14:07:29] [INFO ] Deduced a trap composed of 85 places in 366 ms of which 2 ms to minimize.
[2024-06-01 14:07:29] [INFO ] Deduced a trap composed of 90 places in 336 ms of which 2 ms to minimize.
[2024-06-01 14:07:30] [INFO ] Deduced a trap composed of 235 places in 354 ms of which 4 ms to minimize.
[2024-06-01 14:07:31] [INFO ] Deduced a trap composed of 33 places in 211 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 442/2044 variables, and 53 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 20074 ms.
Refiners :[Positive P Invariants (semi-flows): 11/19 constraints, Generalized P Invariants (flows): 27/31 constraints, State Equation: 0/454 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-06-01 14:07:34] [INFO ] Deduced a trap composed of 189 places in 299 ms of which 2 ms to minimize.
[2024-06-01 14:07:36] [INFO ] Deduced a trap composed of 220 places in 323 ms of which 3 ms to minimize.
[2024-06-01 14:07:36] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 442/2044 variables, and 56 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 11/19 constraints, Generalized P Invariants (flows): 27/31 constraints, State Equation: 0/454 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1608 constraints, Known Traps: 18/18 constraints]
After SMT, in 54925ms problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 54958ms
[2024-06-01 14:07:52] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
[2024-06-01 14:07:52] [INFO ] Invariant cache hit.
[2024-06-01 14:07:52] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-06-01 14:07:52] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
[2024-06-01 14:07:52] [INFO ] Invariant cache hit.
[2024-06-01 14:07:53] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 14:07:55] [INFO ] Implicit Places using invariants and state equation in 3072 ms returned []
Implicit Place search using SMT with State Equation took 3232 ms to find 0 implicit places.
Running 1608 sub problems to find dead transitions.
[2024-06-01 14:07:55] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
[2024-06-01 14:07:55] [INFO ] Invariant cache hit.
[2024-06-01 14:07:55] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-06-01 14:08:23] [INFO ] Deduced a trap composed of 85 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:08:23] [INFO ] Deduced a trap composed of 85 places in 76 ms of which 1 ms to minimize.
[2024-06-01 14:08:23] [INFO ] Deduced a trap composed of 85 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:08:23] [INFO ] Deduced a trap composed of 242 places in 257 ms of which 2 ms to minimize.
[2024-06-01 14:08:24] [INFO ] Deduced a trap composed of 232 places in 256 ms of which 2 ms to minimize.
[2024-06-01 14:08:24] [INFO ] Deduced a trap composed of 119 places in 366 ms of which 5 ms to minimize.
[2024-06-01 14:08:24] [INFO ] Deduced a trap composed of 131 places in 324 ms of which 3 ms to minimize.
[2024-06-01 14:08:25] [INFO ] Deduced a trap composed of 225 places in 396 ms of which 4 ms to minimize.
[2024-06-01 14:08:26] [INFO ] Deduced a trap composed of 48 places in 292 ms of which 2 ms to minimize.
[2024-06-01 14:08:27] [INFO ] Deduced a trap composed of 282 places in 461 ms of which 3 ms to minimize.
[2024-06-01 14:08:28] [INFO ] Deduced a trap composed of 85 places in 391 ms of which 4 ms to minimize.
[2024-06-01 14:08:28] [INFO ] Deduced a trap composed of 228 places in 355 ms of which 2 ms to minimize.
[2024-06-01 14:08:28] [INFO ] Deduced a trap composed of 41 places in 302 ms of which 3 ms to minimize.
[2024-06-01 14:08:29] [INFO ] Deduced a trap composed of 250 places in 319 ms of which 3 ms to minimize.
[2024-06-01 14:08:29] [INFO ] Deduced a trap composed of 272 places in 318 ms of which 3 ms to minimize.
[2024-06-01 14:08:29] [INFO ] Deduced a trap composed of 269 places in 322 ms of which 3 ms to minimize.
[2024-06-01 14:08:30] [INFO ] Deduced a trap composed of 255 places in 415 ms of which 6 ms to minimize.
[2024-06-01 14:08:30] [INFO ] Deduced a trap composed of 61 places in 455 ms of which 2 ms to minimize.
[2024-06-01 14:08:31] [INFO ] Deduced a trap composed of 11 places in 383 ms of which 2 ms to minimize.
[2024-06-01 14:08:31] [INFO ] Deduced a trap composed of 241 places in 408 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 442/2044 variables, and 58 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 11/19 constraints, Generalized P Invariants (flows): 27/31 constraints, State Equation: 0/454 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-06-01 14:08:51] [INFO ] Deduced a trap composed of 211 places in 365 ms of which 4 ms to minimize.
[2024-06-01 14:08:51] [INFO ] Deduced a trap composed of 228 places in 383 ms of which 8 ms to minimize.
[2024-06-01 14:08:52] [INFO ] Deduced a trap composed of 219 places in 401 ms of which 4 ms to minimize.
[2024-06-01 14:09:09] [INFO ] Deduced a trap composed of 199 places in 331 ms of which 3 ms to minimize.
[2024-06-01 14:09:10] [INFO ] Deduced a trap composed of 210 places in 338 ms of which 3 ms to minimize.
[2024-06-01 14:09:11] [INFO ] Deduced a trap composed of 47 places in 281 ms of which 2 ms to minimize.
[2024-06-01 14:09:14] [INFO ] Deduced a trap composed of 163 places in 306 ms of which 2 ms to minimize.
SMT process timed out in 78406ms, After SMT, problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 78433ms
Finished structural reductions in LTL mode , in 1 iterations and 136686 ms. Remains : 454/454 places, 1614/1614 transitions.
Support contains 352 out of 454 places after structural reductions.
[2024-06-01 14:09:14] [INFO ] Flatten gal took : 304 ms
[2024-06-01 14:09:15] [INFO ] Flatten gal took : 240 ms
[2024-06-01 14:09:16] [INFO ] Input system was already deterministic with 1614 transitions.
Reduction of identical properties reduced properties to check from 61 to 57
RANDOM walk for 40002 steps (241 resets) in 1081 ms. (36 steps per ms) remains 4/57 properties
BEST_FIRST walk for 40003 steps (115 resets) in 395 ms. (101 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (127 resets) in 302 ms. (132 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (135 resets) in 199 ms. (200 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1176 resets) in 307 ms. (129 steps per ms) remains 4/4 properties
[2024-06-01 14:09:17] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
[2024-06-01 14:09:17] [INFO ] Invariant cache hit.
[2024-06-01 14:09:17] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 149/204 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/216 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp37 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 221/437 variables, 21/38 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 7/444 variables, 3/41 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp36 is UNSAT
After SMT solving in domain Real declared 454/2044 variables, and 50 constraints, problems are : Problem set: 4 solved, 0 unsolved in 290 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 0/454 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 434ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 15 simplifications.
FORMULA PolyORBLF-COL-S06J04T04-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:09:17] [INFO ] Flatten gal took : 149 ms
[2024-06-01 14:09:18] [INFO ] Flatten gal took : 137 ms
[2024-06-01 14:09:18] [INFO ] Input system was already deterministic with 1614 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 454/454 places, 1614/1614 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 448 transition count 1614
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 10 place count 444 transition count 1610
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 444 transition count 1610
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 440 transition count 1606
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 440 transition count 1606
Applied a total of 22 rules in 68 ms. Remains 440 /454 variables (removed 14) and now considering 1606/1614 (removed 8) transitions.
Running 1600 sub problems to find dead transitions.
[2024-06-01 14:09:18] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
// Phase 1: matrix 1582 rows 440 cols
[2024-06-01 14:09:18] [INFO ] Computed 44 invariants in 68 ms
[2024-06-01 14:09:18] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 14:09:46] [INFO ] Deduced a trap composed of 83 places in 129 ms of which 2 ms to minimize.
[2024-06-01 14:09:46] [INFO ] Deduced a trap composed of 83 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:09:46] [INFO ] Deduced a trap composed of 83 places in 88 ms of which 1 ms to minimize.
[2024-06-01 14:09:47] [INFO ] Deduced a trap composed of 263 places in 302 ms of which 3 ms to minimize.
[2024-06-01 14:09:47] [INFO ] Deduced a trap composed of 260 places in 327 ms of which 3 ms to minimize.
[2024-06-01 14:09:48] [INFO ] Deduced a trap composed of 228 places in 326 ms of which 4 ms to minimize.
[2024-06-01 14:09:48] [INFO ] Deduced a trap composed of 236 places in 321 ms of which 3 ms to minimize.
[2024-06-01 14:09:48] [INFO ] Deduced a trap composed of 99 places in 331 ms of which 3 ms to minimize.
[2024-06-01 14:09:49] [INFO ] Deduced a trap composed of 219 places in 302 ms of which 3 ms to minimize.
[2024-06-01 14:09:50] [INFO ] Deduced a trap composed of 222 places in 342 ms of which 3 ms to minimize.
[2024-06-01 14:09:51] [INFO ] Deduced a trap composed of 230 places in 351 ms of which 2 ms to minimize.
[2024-06-01 14:09:53] [INFO ] Deduced a trap composed of 83 places in 88 ms of which 2 ms to minimize.
[2024-06-01 14:09:54] [INFO ] Deduced a trap composed of 225 places in 338 ms of which 3 ms to minimize.
[2024-06-01 14:09:55] [INFO ] Deduced a trap composed of 226 places in 387 ms of which 3 ms to minimize.
[2024-06-01 14:09:55] [INFO ] Deduced a trap composed of 247 places in 348 ms of which 3 ms to minimize.
[2024-06-01 14:09:55] [INFO ] Deduced a trap composed of 238 places in 351 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 434/2022 variables, and 54 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/17 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/440 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 14:09:59] [INFO ] Deduced a trap composed of 48 places in 345 ms of which 2 ms to minimize.
[2024-06-01 14:10:02] [INFO ] Deduced a trap composed of 87 places in 369 ms of which 2 ms to minimize.
[2024-06-01 14:10:03] [INFO ] Deduced a trap composed of 183 places in 308 ms of which 3 ms to minimize.
[2024-06-01 14:10:03] [INFO ] Deduced a trap composed of 47 places in 383 ms of which 2 ms to minimize.
[2024-06-01 14:10:04] [INFO ] Deduced a trap composed of 218 places in 387 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 6)
(s1 4)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 9)
(s83 1)
(s84 0)
(s85 1)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 1)
(s137 0)
(s138 0)
(s139 0)
(s140 1)
(s141 0)
(s142 1)
(s143 0)
(s144 1)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 1)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 1)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 1)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 1)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 1)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 1)
(s283 0)
(s284 0)
(s285 1)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 1)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 1)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 6)
(s308 0)
(s309 1)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 1)
(s350 0)
(s351 0)
(s352 1)
(s353 2)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 1)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 4)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 1)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 1)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 1)
(s416 0)timeout
(s417 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/2022 variables, and 59 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/17 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/440 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 21/21 constraints]
After SMT, in 58486ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 58505ms
Finished structural reductions in LTL mode , in 1 iterations and 58578 ms. Remains : 440/454 places, 1606/1614 transitions.
[2024-06-01 14:10:17] [INFO ] Flatten gal took : 72 ms
[2024-06-01 14:10:17] [INFO ] Flatten gal took : 76 ms
[2024-06-01 14:10:17] [INFO ] Input system was already deterministic with 1606 transitions.
Starting structural reductions in LTL mode, iteration 0 : 454/454 places, 1614/1614 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 448 transition count 1614
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 10 place count 444 transition count 1610
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 444 transition count 1610
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 440 transition count 1606
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 440 transition count 1606
Applied a total of 22 rules in 41 ms. Remains 440 /454 variables (removed 14) and now considering 1606/1614 (removed 8) transitions.
Running 1600 sub problems to find dead transitions.
[2024-06-01 14:10:17] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
[2024-06-01 14:10:17] [INFO ] Invariant cache hit.
[2024-06-01 14:10:17] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 14:10:46] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 2 ms to minimize.
[2024-06-01 14:10:46] [INFO ] Deduced a trap composed of 83 places in 82 ms of which 1 ms to minimize.
[2024-06-01 14:10:46] [INFO ] Deduced a trap composed of 83 places in 88 ms of which 1 ms to minimize.
[2024-06-01 14:10:47] [INFO ] Deduced a trap composed of 239 places in 390 ms of which 4 ms to minimize.
[2024-06-01 14:10:47] [INFO ] Deduced a trap composed of 235 places in 387 ms of which 3 ms to minimize.
[2024-06-01 14:10:48] [INFO ] Deduced a trap composed of 85 places in 350 ms of which 3 ms to minimize.
[2024-06-01 14:10:48] [INFO ] Deduced a trap composed of 114 places in 386 ms of which 3 ms to minimize.
[2024-06-01 14:10:49] [INFO ] Deduced a trap composed of 99 places in 370 ms of which 3 ms to minimize.
[2024-06-01 14:10:50] [INFO ] Deduced a trap composed of 237 places in 353 ms of which 3 ms to minimize.
[2024-06-01 14:10:50] [INFO ] Deduced a trap composed of 83 places in 88 ms of which 1 ms to minimize.
[2024-06-01 14:10:51] [INFO ] Deduced a trap composed of 264 places in 418 ms of which 3 ms to minimize.
[2024-06-01 14:10:51] [INFO ] Deduced a trap composed of 239 places in 376 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 434/2022 variables, and 50 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/17 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/440 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 14:11:00] [INFO ] Deduced a trap composed of 48 places in 300 ms of which 2 ms to minimize.
[2024-06-01 14:11:02] [INFO ] Deduced a trap composed of 72 places in 310 ms of which 2 ms to minimize.
[2024-06-01 14:11:03] [INFO ] Deduced a trap composed of 72 places in 349 ms of which 4 ms to minimize.
[2024-06-01 14:11:04] [INFO ] Deduced a trap composed of 220 places in 413 ms of which 6 ms to minimize.
[2024-06-01 14:11:05] [INFO ] Deduced a trap composed of 219 places in 341 ms of which 4 ms to minimize.
[2024-06-01 14:11:07] [INFO ] Deduced a trap composed of 90 places in 136 ms of which 2 ms to minimize.
[2024-06-01 14:11:07] [INFO ] Deduced a trap composed of 30 places in 149 ms of which 2 ms to minimize.
[2024-06-01 14:11:07] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/2022 variables, and 58 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/17 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/440 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 20/20 constraints]
After SMT, in 59861ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 59885ms
Finished structural reductions in LTL mode , in 1 iterations and 59932 ms. Remains : 440/454 places, 1606/1614 transitions.
[2024-06-01 14:11:17] [INFO ] Flatten gal took : 72 ms
[2024-06-01 14:11:17] [INFO ] Flatten gal took : 113 ms
[2024-06-01 14:11:17] [INFO ] Input system was already deterministic with 1606 transitions.
Starting structural reductions in LTL mode, iteration 0 : 454/454 places, 1614/1614 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 448 transition count 1614
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 10 place count 444 transition count 1610
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 444 transition count 1610
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 440 transition count 1606
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 440 transition count 1606
Applied a total of 22 rules in 44 ms. Remains 440 /454 variables (removed 14) and now considering 1606/1614 (removed 8) transitions.
Running 1600 sub problems to find dead transitions.
[2024-06-01 14:11:18] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
[2024-06-01 14:11:18] [INFO ] Invariant cache hit.
[2024-06-01 14:11:18] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 14:11:47] [INFO ] Deduced a trap composed of 83 places in 85 ms of which 1 ms to minimize.
[2024-06-01 14:11:47] [INFO ] Deduced a trap composed of 83 places in 80 ms of which 2 ms to minimize.
[2024-06-01 14:11:47] [INFO ] Deduced a trap composed of 83 places in 78 ms of which 1 ms to minimize.
[2024-06-01 14:11:48] [INFO ] Deduced a trap composed of 239 places in 357 ms of which 3 ms to minimize.
[2024-06-01 14:11:48] [INFO ] Deduced a trap composed of 235 places in 350 ms of which 6 ms to minimize.
[2024-06-01 14:11:48] [INFO ] Deduced a trap composed of 85 places in 324 ms of which 3 ms to minimize.
[2024-06-01 14:11:49] [INFO ] Deduced a trap composed of 114 places in 376 ms of which 3 ms to minimize.
[2024-06-01 14:11:49] [INFO ] Deduced a trap composed of 99 places in 371 ms of which 4 ms to minimize.
[2024-06-01 14:11:51] [INFO ] Deduced a trap composed of 237 places in 395 ms of which 4 ms to minimize.
[2024-06-01 14:11:51] [INFO ] Deduced a trap composed of 83 places in 85 ms of which 2 ms to minimize.
[2024-06-01 14:11:52] [INFO ] Deduced a trap composed of 264 places in 420 ms of which 3 ms to minimize.
[2024-06-01 14:11:52] [INFO ] Deduced a trap composed of 239 places in 404 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 434/2022 variables, and 50 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/17 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/440 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 14:12:00] [INFO ] Deduced a trap composed of 48 places in 293 ms of which 1 ms to minimize.
[2024-06-01 14:12:02] [INFO ] Deduced a trap composed of 72 places in 310 ms of which 3 ms to minimize.
[2024-06-01 14:12:03] [INFO ] Deduced a trap composed of 72 places in 318 ms of which 2 ms to minimize.
[2024-06-01 14:12:04] [INFO ] Deduced a trap composed of 220 places in 354 ms of which 5 ms to minimize.
[2024-06-01 14:12:05] [INFO ] Deduced a trap composed of 219 places in 369 ms of which 3 ms to minimize.
[2024-06-01 14:12:07] [INFO ] Deduced a trap composed of 90 places in 148 ms of which 2 ms to minimize.
[2024-06-01 14:12:07] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 2 ms to minimize.
[2024-06-01 14:12:07] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/2022 variables, and 58 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 13/17 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/440 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 20/20 constraints]
After SMT, in 59448ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 59475ms
Finished structural reductions in LTL mode , in 1 iterations and 59526 ms. Remains : 440/454 places, 1606/1614 transitions.
[2024-06-01 14:12:17] [INFO ] Flatten gal took : 61 ms
[2024-06-01 14:12:17] [INFO ] Flatten gal took : 70 ms
[2024-06-01 14:12:17] [INFO ] Input system was already deterministic with 1606 transitions.
Starting structural reductions in LTL mode, iteration 0 : 454/454 places, 1614/1614 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 448 transition count 1614
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 10 place count 444 transition count 1610
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 444 transition count 1610
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 440 transition count 1606
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 440 transition count 1606
Applied a total of 22 rules in 38 ms. Remains 440 /454 variables (removed 14) and now considering 1606/1614 (removed 8) transitions.
Running 1600 sub problems to find dead transitions.
[2024-06-01 14:12:17] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
[2024-06-01 14:12:17] [INFO ] Invariant cache hit.
[2024-06-01 14:12:17] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 14:12:46] [INFO ] Deduced a trap composed of 83 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:12:46] [INFO ] Deduced a trap composed of 83 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:12:47] [INFO ] Deduced a trap composed of 83 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:12:47] [INFO ] Deduced a trap composed of 239 places in 254 ms of which 2 ms to minimize.
[2024-06-01 14:12:47] [INFO ] Deduced a trap composed of 235 places in 337 ms of which 3 ms to minimize.
[2024-06-01 14:12:48] [INFO ] Deduced a trap composed of 85 places in 311 ms of which 3 ms to minimize.
[2024-06-01 14:12:48] [INFO ] Deduced a trap composed of 114 places in 367 ms of which 3 ms to minimize.
[2024-06-01 14:12:48] [INFO ] Deduced a trap composed of 99 places in 291 ms of which 3 ms to minimize.
[2024-06-01 14:12:49] [INFO ] Deduced a trap composed of 237 places in 242 ms of which 2 ms to minimize.
[2024-06-01 14:12:50] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 2 ms to minimize.
[2024-06-01 14:12:51] [INFO ] Deduced a trap composed of 264 places in 395 ms of which 3 ms to minimize.
[2024-06-01 14:12:51] [INFO ] Deduced a trap composed of 239 places in 393 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 434/2022 variables, and 50 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/17 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/440 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 14:13:00] [INFO ] Deduced a trap composed of 48 places in 257 ms of which 2 ms to minimize.
[2024-06-01 14:13:03] [INFO ] Deduced a trap composed of 72 places in 224 ms of which 2 ms to minimize.
[2024-06-01 14:13:03] [INFO ] Deduced a trap composed of 72 places in 249 ms of which 2 ms to minimize.
[2024-06-01 14:13:04] [INFO ] Deduced a trap composed of 220 places in 336 ms of which 3 ms to minimize.
[2024-06-01 14:13:05] [INFO ] Deduced a trap composed of 219 places in 278 ms of which 3 ms to minimize.
[2024-06-01 14:13:07] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 1 ms to minimize.
[2024-06-01 14:13:07] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 2 ms to minimize.
[2024-06-01 14:13:07] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/2022 variables, and 58 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/17 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/440 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 20/20 constraints]
After SMT, in 59873ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 59891ms
Finished structural reductions in LTL mode , in 1 iterations and 59933 ms. Remains : 440/454 places, 1606/1614 transitions.
[2024-06-01 14:13:17] [INFO ] Flatten gal took : 64 ms
[2024-06-01 14:13:17] [INFO ] Flatten gal took : 69 ms
[2024-06-01 14:13:18] [INFO ] Input system was already deterministic with 1606 transitions.
Starting structural reductions in LTL mode, iteration 0 : 454/454 places, 1614/1614 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 450 transition count 1610
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 450 transition count 1610
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 446 transition count 1606
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 446 transition count 1606
Applied a total of 16 rules in 23 ms. Remains 446 /454 variables (removed 8) and now considering 1606/1614 (removed 8) transitions.
Running 1600 sub problems to find dead transitions.
[2024-06-01 14:13:18] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
// Phase 1: matrix 1582 rows 446 cols
[2024-06-01 14:13:18] [INFO ] Computed 50 invariants in 79 ms
[2024-06-01 14:13:18] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 14:13:47] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2024-06-01 14:13:47] [INFO ] Deduced a trap composed of 83 places in 74 ms of which 1 ms to minimize.
[2024-06-01 14:13:47] [INFO ] Deduced a trap composed of 83 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:13:47] [INFO ] Deduced a trap composed of 241 places in 337 ms of which 3 ms to minimize.
[2024-06-01 14:13:48] [INFO ] Deduced a trap composed of 232 places in 351 ms of which 3 ms to minimize.
[2024-06-01 14:13:48] [INFO ] Deduced a trap composed of 85 places in 304 ms of which 3 ms to minimize.
[2024-06-01 14:13:48] [INFO ] Deduced a trap composed of 114 places in 325 ms of which 4 ms to minimize.
[2024-06-01 14:13:49] [INFO ] Deduced a trap composed of 99 places in 278 ms of which 2 ms to minimize.
[2024-06-01 14:13:49] [INFO ] Deduced a trap composed of 83 places in 93 ms of which 1 ms to minimize.
[2024-06-01 14:13:51] [INFO ] Deduced a trap composed of 236 places in 386 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 9.0)
(s83 1.0)
(s84 0.0)
(s85 1.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 1.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 1.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)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 434/2028 variables, and 48 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 12/18 constraints, Generalized P Invariants (flows): 26/32 constraints, State Equation: 0/446 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 14:13:59] [INFO ] Deduced a trap composed of 212 places in 255 ms of which 2 ms to minimize.
[2024-06-01 14:14:04] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/2028 variables, and 50 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/18 constraints, Generalized P Invariants (flows): 26/32 constraints, State Equation: 0/446 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 12/12 constraints]
After SMT, in 59495ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 59512ms
Finished structural reductions in LTL mode , in 1 iterations and 59540 ms. Remains : 446/454 places, 1606/1614 transitions.
[2024-06-01 14:14:17] [INFO ] Flatten gal took : 76 ms
[2024-06-01 14:14:17] [INFO ] Flatten gal took : 82 ms
[2024-06-01 14:14:17] [INFO ] Input system was already deterministic with 1606 transitions.
Starting structural reductions in LTL mode, iteration 0 : 454/454 places, 1614/1614 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 448 transition count 1614
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 10 place count 444 transition count 1610
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 444 transition count 1610
Applied a total of 14 rules in 33 ms. Remains 444 /454 variables (removed 10) and now considering 1610/1614 (removed 4) transitions.
Running 1604 sub problems to find dead transitions.
[2024-06-01 14:14:17] [INFO ] Flow matrix only has 1586 transitions (discarded 24 similar events)
// Phase 1: matrix 1586 rows 444 cols
[2024-06-01 14:14:18] [INFO ] Computed 44 invariants in 55 ms
[2024-06-01 14:14:18] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
[2024-06-01 14:14:48] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
[2024-06-01 14:14:48] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 1 ms to minimize.
[2024-06-01 14:14:48] [INFO ] Deduced a trap composed of 84 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:14:48] [INFO ] Deduced a trap composed of 243 places in 267 ms of which 3 ms to minimize.
[2024-06-01 14:14:49] [INFO ] Deduced a trap composed of 237 places in 270 ms of which 5 ms to minimize.
[2024-06-01 14:14:49] [INFO ] Deduced a trap composed of 96 places in 271 ms of which 2 ms to minimize.
[2024-06-01 14:14:49] [INFO ] Deduced a trap composed of 109 places in 259 ms of which 3 ms to minimize.
[2024-06-01 14:14:50] [INFO ] Deduced a trap composed of 241 places in 297 ms of which 4 ms to minimize.
[2024-06-01 14:14:51] [INFO ] Deduced a trap composed of 243 places in 349 ms of which 3 ms to minimize.
[2024-06-01 14:14:51] [INFO ] Deduced a trap composed of 84 places in 62 ms of which 0 ms to minimize.
[2024-06-01 14:14:52] [INFO ] Deduced a trap composed of 231 places in 309 ms of which 3 ms to minimize.
[2024-06-01 14:14:52] [INFO ] Deduced a trap composed of 220 places in 411 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/2030 variables, and 50 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/29 constraints, State Equation: 0/444 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1604/1604 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
[2024-06-01 14:15:03] [INFO ] Deduced a trap composed of 224 places in 343 ms of which 3 ms to minimize.
[2024-06-01 14:15:03] [INFO ] Deduced a trap composed of 219 places in 331 ms of which 3 ms to minimize.
[2024-06-01 14:15:05] [INFO ] Deduced a trap composed of 91 places in 154 ms of which 2 ms to minimize.
[2024-06-01 14:15:05] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/2030 variables, and 54 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/29 constraints, State Equation: 0/444 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1604 constraints, Known Traps: 16/16 constraints]
After SMT, in 59514ms problems are : Problem set: 0 solved, 1604 unsolved
Search for dead transitions found 0 dead transitions in 59536ms
Finished structural reductions in LTL mode , in 1 iterations and 59573 ms. Remains : 444/454 places, 1610/1614 transitions.
[2024-06-01 14:15:17] [INFO ] Flatten gal took : 69 ms
[2024-06-01 14:15:17] [INFO ] Flatten gal took : 68 ms
[2024-06-01 14:15:17] [INFO ] Input system was already deterministic with 1610 transitions.
Starting structural reductions in LTL mode, iteration 0 : 454/454 places, 1614/1614 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 448 transition count 1614
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 10 place count 444 transition count 1610
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 444 transition count 1610
Applied a total of 14 rules in 18 ms. Remains 444 /454 variables (removed 10) and now considering 1610/1614 (removed 4) transitions.
Running 1604 sub problems to find dead transitions.
[2024-06-01 14:15:17] [INFO ] Flow matrix only has 1586 transitions (discarded 24 similar events)
[2024-06-01 14:15:17] [INFO ] Invariant cache hit.
[2024-06-01 14:15:17] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
[2024-06-01 14:15:45] [INFO ] Deduced a trap composed of 84 places in 131 ms of which 2 ms to minimize.
[2024-06-01 14:15:45] [INFO ] Deduced a trap composed of 84 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:15:45] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 1 ms to minimize.
[2024-06-01 14:15:45] [INFO ] Deduced a trap composed of 255 places in 338 ms of which 4 ms to minimize.
[2024-06-01 14:15:46] [INFO ] Deduced a trap composed of 251 places in 344 ms of which 3 ms to minimize.
[2024-06-01 14:15:46] [INFO ] Deduced a trap composed of 250 places in 315 ms of which 2 ms to minimize.
[2024-06-01 14:15:46] [INFO ] Deduced a trap composed of 224 places in 287 ms of which 3 ms to minimize.
[2024-06-01 14:15:47] [INFO ] Deduced a trap composed of 126 places in 259 ms of which 2 ms to minimize.
[2024-06-01 14:15:47] [INFO ] Deduced a trap composed of 127 places in 281 ms of which 3 ms to minimize.
[2024-06-01 14:15:48] [INFO ] Deduced a trap composed of 194 places in 271 ms of which 3 ms to minimize.
[2024-06-01 14:15:48] [INFO ] Deduced a trap composed of 243 places in 286 ms of which 2 ms to minimize.
[2024-06-01 14:15:49] [INFO ] Deduced a trap composed of 89 places in 280 ms of which 2 ms to minimize.
[2024-06-01 14:15:50] [INFO ] Deduced a trap composed of 238 places in 352 ms of which 3 ms to minimize.
[2024-06-01 14:15:50] [INFO ] Deduced a trap composed of 262 places in 334 ms of which 3 ms to minimize.
[2024-06-01 14:15:51] [INFO ] Deduced a trap composed of 84 places in 59 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/2030 variables, and 53 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/29 constraints, State Equation: 0/444 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1604/1604 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
[2024-06-01 14:15:57] [INFO ] Deduced a trap composed of 48 places in 270 ms of which 2 ms to minimize.
[2024-06-01 14:15:58] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 2 ms to minimize.
[2024-06-01 14:16:00] [INFO ] Deduced a trap composed of 89 places in 325 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/2030 variables, and 56 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 25/29 constraints, State Equation: 0/444 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1604 constraints, Known Traps: 18/18 constraints]
After SMT, in 57131ms problems are : Problem set: 0 solved, 1604 unsolved
Search for dead transitions found 0 dead transitions in 57148ms
Finished structural reductions in LTL mode , in 1 iterations and 57170 ms. Remains : 444/454 places, 1610/1614 transitions.
[2024-06-01 14:16:15] [INFO ] Flatten gal took : 115 ms
[2024-06-01 14:16:15] [INFO ] Flatten gal took : 101 ms
[2024-06-01 14:16:15] [INFO ] Input system was already deterministic with 1610 transitions.
Starting structural reductions in LTL mode, iteration 0 : 454/454 places, 1614/1614 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 448 transition count 1614
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 10 place count 444 transition count 1610
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 444 transition count 1610
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 440 transition count 1606
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 440 transition count 1606
Applied a total of 22 rules in 33 ms. Remains 440 /454 variables (removed 14) and now considering 1606/1614 (removed 8) transitions.
Running 1600 sub problems to find dead transitions.
[2024-06-01 14:16:15] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
// Phase 1: matrix 1582 rows 440 cols
[2024-06-01 14:16:15] [INFO ] Computed 44 invariants in 54 ms
[2024-06-01 14:16:15] [INFO ] State equation strengthened by 112 read => feed constraints.
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-CTLFireability-2024-00
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-CTLFireability-2024-01
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-CTLFireability-2024-02
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-CTLFireability-2024-03
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-CTLFireability-2024-04
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-CTLFireability-2024-05
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-CTLFireability-2024-06
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-CTLFireability-2024-07
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-CTLFireability-2024-08
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-CTLFireability-2024-09
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-CTLFireability-2024-10
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-CTLFireability-2024-11
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-CTLFireability-2024-12
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-CTLFireability-2024-13
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-CTLFireability-2024-14
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-CTLFireability-2024-15
BK_STOP 1717251387169
--------------------
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 CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name PolyORBLF-COL-S06J04T04-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1131/ctl_0_
ctl formula name PolyORBLF-COL-S06J04T04-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1131/ctl_1_
ctl formula name PolyORBLF-COL-S06J04T04-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1131/ctl_2_
ctl formula name PolyORBLF-COL-S06J04T04-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1131/ctl_3_
ctl formula name PolyORBLF-COL-S06J04T04-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1131/ctl_4_
ctl formula name PolyORBLF-COL-S06J04T04-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1131/ctl_5_
ctl formula name PolyORBLF-COL-S06J04T04-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1131/ctl_6_
ctl formula name PolyORBLF-COL-S06J04T04-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1131/ctl_7_
ctl formula name PolyORBLF-COL-S06J04T04-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1131/ctl_8_
ctl formula name PolyORBLF-COL-S06J04T04-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1131/ctl_9_
ctl formula name PolyORBLF-COL-S06J04T04-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1131/ctl_10_
ctl formula name PolyORBLF-COL-S06J04T04-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1131/ctl_11_
ctl formula name PolyORBLF-COL-S06J04T04-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/1131/ctl_12_
ctl formula name PolyORBLF-COL-S06J04T04-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/1131/ctl_13_
ctl formula name PolyORBLF-COL-S06J04T04-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/1131/ctl_14_
ctl formula name PolyORBLF-COL-S06J04T04-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/1131/ctl_15_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S06J04T04"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBLF-COL-S06J04T04, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654446500170"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S06J04T04.tgz
mv PolyORBLF-COL-S06J04T04 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;