Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.3M
-rw-r--r-- 1 mcc users 17K Apr 11 17:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 11 17:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 29K Apr 11 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 157K Apr 11 17:01 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 8.4K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 33K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 11 17:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 11 17:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 40K Apr 11 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 207K Apr 11 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 2.5M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717253547102

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:52:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 14:52:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:52:28] [INFO ] Load time of PNML (sax parser for PT used): 260 ms
[2024-06-01 14:52:28] [INFO ] Transformed 554 places.
[2024-06-01 14:52:29] [INFO ] Transformed 2998 transitions.
[2024-06-01 14:52:29] [INFO ] Parsed PT model containing 554 places and 2998 transitions and 20754 arcs in 391 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 25 ms.
[2024-06-01 14:52:29] [INFO ] Reduced 36 identical enabling conditions.
[2024-06-01 14:52:29] [INFO ] Reduced 264 identical enabling conditions.
[2024-06-01 14:52:29] [INFO ] Reduced 36 identical enabling conditions.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
Support contains 354 out of 554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 554/554 places, 1372/1372 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 550 transition count 1372
Applied a total of 4 rules in 66 ms. Remains 550 /554 variables (removed 4) and now considering 1372/1372 (removed 0) transitions.
Running 1368 sub problems to find dead transitions.
[2024-06-01 14:52:29] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
// Phase 1: matrix 1348 rows 550 cols
[2024-06-01 14:52:29] [INFO ] Computed 46 invariants in 70 ms
[2024-06-01 14:52:29] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-06-01 14:52:46] [INFO ] Deduced a trap composed of 110 places in 419 ms of which 43 ms to minimize.
[2024-06-01 14:52:47] [INFO ] Deduced a trap composed of 174 places in 540 ms of which 4 ms to minimize.
[2024-06-01 14:52:47] [INFO ] Deduced a trap composed of 145 places in 267 ms of which 3 ms to minimize.
[2024-06-01 14:52:48] [INFO ] Deduced a trap composed of 276 places in 223 ms of which 3 ms to minimize.
[2024-06-01 14:52:48] [INFO ] Deduced a trap composed of 270 places in 202 ms of which 3 ms to minimize.
[2024-06-01 14:52:48] [INFO ] Deduced a trap composed of 274 places in 258 ms of which 3 ms to minimize.
[2024-06-01 14:52:49] [INFO ] Deduced a trap composed of 280 places in 242 ms of which 2 ms to minimize.
[2024-06-01 14:52:49] [INFO ] Deduced a trap composed of 274 places in 271 ms of which 4 ms to minimize.
[2024-06-01 14:52:49] [INFO ] Deduced a trap composed of 290 places in 261 ms of which 4 ms to minimize.
[2024-06-01 14:52:50] [INFO ] Deduced a trap composed of 277 places in 261 ms of which 2 ms to minimize.
[2024-06-01 14:52:50] [INFO ] Deduced a trap composed of 290 places in 278 ms of which 3 ms to minimize.
[2024-06-01 14:52:50] [INFO ] Deduced a trap composed of 265 places in 281 ms of which 3 ms to minimize.
[2024-06-01 14:52:51] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 1 ms to minimize.
[2024-06-01 14:52:52] [INFO ] Deduced a trap composed of 264 places in 310 ms of which 4 ms to minimize.
[2024-06-01 14:52:52] [INFO ] Deduced a trap composed of 277 places in 238 ms of which 4 ms to minimize.
[2024-06-01 14:52:52] [INFO ] Deduced a trap composed of 276 places in 269 ms of which 3 ms to minimize.
[2024-06-01 14:52:53] [INFO ] Deduced a trap composed of 89 places in 210 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 546/1898 variables, and 58 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 20122 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 28/32 constraints, State Equation: 0/550 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1368/1368 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/546 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-06-01 14:53:01] [INFO ] Deduced a trap composed of 77 places in 110 ms of which 2 ms to minimize.
[2024-06-01 14:53:01] [INFO ] Deduced a trap composed of 76 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:53:01] [INFO ] Deduced a trap composed of 75 places in 75 ms of which 1 ms to minimize.
[2024-06-01 14:53:03] [INFO ] Deduced a trap composed of 39 places in 188 ms of which 2 ms to minimize.
[2024-06-01 14:53:04] [INFO ] Deduced a trap composed of 77 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:53:06] [INFO ] Deduced a trap composed of 75 places in 45 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 546/1898 variables, and 64 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 28/32 constraints, State Equation: 0/550 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1368 constraints, Known Traps: 23/23 constraints]
After SMT, in 44887ms problems are : Problem set: 0 solved, 1368 unsolved
Search for dead transitions found 0 dead transitions in 44935ms
[2024-06-01 14:53:14] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
[2024-06-01 14:53:14] [INFO ] Invariant cache hit.
[2024-06-01 14:53:14] [INFO ] Implicit Places using invariants in 235 ms returned [88, 244, 274, 360, 382, 480]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 248 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 544/554 places, 1372/1372 transitions.
Applied a total of 0 rules in 16 ms. Remains 544 /544 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45319 ms. Remains : 544/554 places, 1372/1372 transitions.
Support contains 354 out of 544 places after structural reductions.
[2024-06-01 14:53:15] [INFO ] Flatten gal took : 330 ms
[2024-06-01 14:53:15] [INFO ] Flatten gal took : 194 ms
[2024-06-01 14:53:15] [INFO ] Input system was already deterministic with 1372 transitions.
Support contains 348 out of 544 places (down from 354) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 74 to 72
RANDOM walk for 40000 steps (8 resets) in 4146 ms. (9 steps per ms) remains 25/72 properties
BEST_FIRST walk for 4003 steps (8 resets) in 104 ms. (38 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (8 resets) in 67 ms. (58 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (8 resets) in 53 ms. (74 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 77 ms. (51 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (8 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 25/25 properties
[2024-06-01 14:53:17] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
// Phase 1: matrix 1348 rows 544 cols
[2024-06-01 14:53:18] [INFO ] Computed 40 invariants in 43 ms
[2024-06-01 14:53:18] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 82/142 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-01 14:53:19] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp72 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 388/530 variables, 19/30 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/530 variables, 0/30 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 4/534 variables, 4/34 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/534 variables, 0/34 constraints. Problems are: Problem set: 17 solved, 8 unsolved
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp70 is UNSAT
At refinement iteration 10 (OVERLAPS) 10/544 variables, 7/41 constraints. Problems are: Problem set: 23 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/544 variables, 0/41 constraints. Problems are: Problem set: 23 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1348/1892 variables, 544/585 constraints. Problems are: Problem set: 23 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1892 variables, 120/705 constraints. Problems are: Problem set: 23 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1892 variables, 0/705 constraints. Problems are: Problem set: 23 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1892 variables, 0/705 constraints. Problems are: Problem set: 23 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1892/1892 variables, and 705 constraints, problems are : Problem set: 23 solved, 2 unsolved in 4053 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 544/544 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 23 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 23 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 31/43 variables, 2/2 constraints. Problems are: Problem set: 23 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 23 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 470/513 variables, 16/18 constraints. Problems are: Problem set: 23 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/18 constraints. Problems are: Problem set: 23 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/523 variables, 10/28 constraints. Problems are: Problem set: 23 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 1/29 constraints. Problems are: Problem set: 23 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/523 variables, 0/29 constraints. Problems are: Problem set: 23 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 19/542 variables, 11/40 constraints. Problems are: Problem set: 23 solved, 2 unsolved
[2024-06-01 14:53:23] [INFO ] Deduced a trap composed of 76 places in 154 ms of which 2 ms to minimize.
[2024-06-01 14:53:23] [INFO ] Deduced a trap composed of 76 places in 115 ms of which 2 ms to minimize.
[2024-06-01 14:53:23] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 1 ms to minimize.
[2024-06-01 14:53:23] [INFO ] Deduced a trap composed of 76 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:53:23] [INFO ] Deduced a trap composed of 76 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/542 variables, 5/45 constraints. Problems are: Problem set: 23 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/542 variables, 0/45 constraints. Problems are: Problem set: 23 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1348/1890 variables, 542/587 constraints. Problems are: Problem set: 23 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1890 variables, 120/707 constraints. Problems are: Problem set: 23 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1890/1892 variables, and 709 constraints, problems are : Problem set: 23 solved, 2 unsolved in 4216 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 542/544 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/25 constraints, Known Traps: 6/6 constraints]
After SMT, in 8831ms problems are : Problem set: 23 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 544 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 544 transition count 1325
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 94 place count 497 transition count 1325
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 94 place count 497 transition count 1265
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 214 place count 437 transition count 1265
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 216 place count 435 transition count 1263
Iterating global reduction 2 with 2 rules applied. Total rules applied 218 place count 435 transition count 1263
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 338 place count 375 transition count 1203
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 2 with 14 rules applied. Total rules applied 352 place count 375 transition count 1189
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 366 place count 361 transition count 1189
Applied a total of 366 rules in 471 ms. Remains 361 /544 variables (removed 183) and now considering 1189/1372 (removed 183) transitions.
Running 1185 sub problems to find dead transitions.
[2024-06-01 14:53:27] [INFO ] Flow matrix only has 1165 transitions (discarded 24 similar events)
// Phase 1: matrix 1165 rows 361 cols
[2024-06-01 14:53:27] [INFO ] Computed 40 invariants in 23 ms
[2024-06-01 14:53:27] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/357 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1185 unsolved
[2024-06-01 14:53:39] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:53:39] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:53:39] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:53:39] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:53:39] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 2 ms to minimize.
[2024-06-01 14:53:39] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 10 ms to minimize.
[2024-06-01 14:53:40] [INFO ] Deduced a trap composed of 16 places in 198 ms of which 3 ms to minimize.
[2024-06-01 14:53:40] [INFO ] Deduced a trap composed of 28 places in 173 ms of which 1 ms to minimize.
[2024-06-01 14:53:41] [INFO ] Deduced a trap composed of 48 places in 228 ms of which 2 ms to minimize.
[2024-06-01 14:53:41] [INFO ] Deduced a trap composed of 143 places in 217 ms of which 2 ms to minimize.
[2024-06-01 14:53:44] [INFO ] Deduced a trap composed of 118 places in 229 ms of which 3 ms to minimize.
[2024-06-01 14:53:47] [INFO ] Deduced a trap composed of 165 places in 274 ms of which 3 ms to minimize.
[2024-06-01 14:53:47] [INFO ] Deduced a trap composed of 197 places in 315 ms of which 2 ms to minimize.
[2024-06-01 14:53:47] [INFO ] Deduced a trap composed of 162 places in 287 ms of which 3 ms to minimize.
[2024-06-01 14:53:48] [INFO ] Deduced a trap composed of 127 places in 208 ms of which 3 ms to minimize.
[2024-06-01 14:53:48] [INFO ] Deduced a trap composed of 143 places in 207 ms of which 3 ms to minimize.
[2024-06-01 14:53:49] [INFO ] Deduced a trap composed of 130 places in 201 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 1185 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 357/1526 variables, and 53 constraints, problems are : Problem set: 0 solved, 1185 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/361 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1185/1185 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/357 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 1185 unsolved
[2024-06-01 14:53:58] [INFO ] Deduced a trap composed of 176 places in 205 ms of which 2 ms to minimize.
[2024-06-01 14:54:08] [INFO ] Deduced a trap composed of 153 places in 190 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1185 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 357/1526 variables, and 55 constraints, problems are : Problem set: 0 solved, 1185 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/361 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1185 constraints, Known Traps: 19/19 constraints]
After SMT, in 46025ms problems are : Problem set: 0 solved, 1185 unsolved
Search for dead transitions found 0 dead transitions in 46043ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46522 ms. Remains : 361/544 places, 1189/1372 transitions.
RANDOM walk for 40000 steps (9 resets) in 596 ms. (67 steps per ms) remains 1/2 properties
BEST_FIRST walk for 15406 steps (3 resets) in 67 ms. (226 steps per ms) remains 0/1 properties
Successfully simplified 23 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBLF-PT-S04J04T06-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T06-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T06-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T06-CTLFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:54:13] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 14:54:13] [INFO ] Flatten gal took : 132 ms
FORMULA PolyORBLF-PT-S04J04T06-CTLFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:54:14] [INFO ] Flatten gal took : 162 ms
[2024-06-01 14:54:14] [INFO ] Input system was already deterministic with 1372 transitions.
Support contains 255 out of 544 places (down from 264) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 538 transition count 1366
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 538 transition count 1366
Applied a total of 12 rules in 21 ms. Remains 538 /544 variables (removed 6) and now considering 1366/1372 (removed 6) transitions.
Running 1362 sub problems to find dead transitions.
[2024-06-01 14:54:14] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
// Phase 1: matrix 1342 rows 538 cols
[2024-06-01 14:54:14] [INFO ] Computed 40 invariants in 54 ms
[2024-06-01 14:54:14] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
[2024-06-01 14:54:29] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:54:31] [INFO ] Deduced a trap composed of 104 places in 110 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 534/1880 variables, and 33 constraints, problems are : Problem set: 0 solved, 1362 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/538 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1362/1362 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/534 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
[2024-06-01 14:54:40] [INFO ] Deduced a trap composed of 34 places in 240 ms of which 3 ms to minimize.
[2024-06-01 14:54:40] [INFO ] Deduced a trap composed of 75 places in 91 ms of which 2 ms to minimize.
[2024-06-01 14:54:40] [INFO ] Deduced a trap composed of 75 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:54:40] [INFO ] Deduced a trap composed of 75 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:54:40] [INFO ] Deduced a trap composed of 76 places in 67 ms of which 2 ms to minimize.
[2024-06-01 14:54:40] [INFO ] Deduced a trap composed of 75 places in 50 ms of which 3 ms to minimize.
[2024-06-01 14:54:41] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 6 ms to minimize.
[2024-06-01 14:54:41] [INFO ] Deduced a trap composed of 75 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:54:44] [INFO ] Deduced a trap composed of 33 places in 257 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/534 variables, 9/42 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
[2024-06-01 14:54:56] [INFO ] Deduced a trap composed of 39 places in 167 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/1880 variables, and 43 constraints, problems are : Problem set: 0 solved, 1362 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/538 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1362 constraints, Known Traps: 12/12 constraints]
After SMT, in 44075ms problems are : Problem set: 0 solved, 1362 unsolved
Search for dead transitions found 0 dead transitions in 44091ms
Finished structural reductions in LTL mode , in 1 iterations and 44119 ms. Remains : 538/544 places, 1366/1372 transitions.
[2024-06-01 14:54:58] [INFO ] Flatten gal took : 95 ms
[2024-06-01 14:54:58] [INFO ] Flatten gal took : 87 ms
[2024-06-01 14:54:58] [INFO ] Input system was already deterministic with 1366 transitions.
Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 538 transition count 1366
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 538 transition count 1366
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 532 transition count 1360
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 532 transition count 1360
Applied a total of 24 rules in 55 ms. Remains 532 /544 variables (removed 12) and now considering 1360/1372 (removed 12) transitions.
Running 1356 sub problems to find dead transitions.
[2024-06-01 14:54:58] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
// Phase 1: matrix 1336 rows 532 cols
[2024-06-01 14:54:58] [INFO ] Computed 40 invariants in 30 ms
[2024-06-01 14:54:59] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 14:55:12] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:55:14] [INFO ] Deduced a trap composed of 98 places in 124 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 10.0)
(s5 2.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 4.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 1.0)
(s20 1.0)
(s21 4.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 1.0)
(s27 1.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 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 3.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 2.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 4.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 1.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 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 1.0)
(s103 0.0)
(s104 1.0)
(s105 1.0)
(s106 2.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 1.0)
(s111 0.0)
(s112 9.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 1.0)
(s123 1.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 3.0)
(s136 4.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 2.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 4.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 1.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 4.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 1.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 1.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 1.0)
(s228 2.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 0.0)
(s249 2.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 2.0)
(s257 0.0)
(s258 1.0)
(s259 1.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 1.0)
(s267 0.0)
(s268 1.0)
(s269 1.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 1.0)
(s287 2.0)
(s288 1.0)
(s289 1.0)
(s290 0.0)
(s291 1.0)
(s292 0.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 1.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 1.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 1.0)
(s329 1.0)
(s330 1.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 1.0)
(s340 0.0)
(s341 1.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 4.0)
(s347 0.0)
(s348 0.0)
(s349 1.0)
(s350 1.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 1.0)
(s358 1.0)
(s359 0.0)
(s360 1.0)
(s361 0.0)
(s362 2.0)
(s363 10.0)
(s364 0.0)
(s365 1.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 1.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 1.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 1.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 2.0)
(s399 0.0)
(s400 2.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s406 1.0)
(s407 1.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 2.0)
(s414 0.0)
(s416timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 32 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 17/26 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 14:55:29] [INFO ] Deduced a trap composed of 33 places in 289 ms of which 2 ms to minimize.
[2024-06-01 14:55:29] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 2 ms to minimize.
[2024-06-01 14:55:29] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 1 ms to minimize.
[2024-06-01 14:55:30] [INFO ] Deduced a trap composed of 74 places in 80 ms of which 1 ms to minimize.
[2024-06-01 14:55:30] [INFO ] Deduced a trap composed of 74 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:55:30] [INFO ] Deduced a trap composed of 75 places in 77 ms of which 1 ms to minimize.
[2024-06-01 14:55:32] [INFO ] Deduced a trap composed of 75 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:55:32] [INFO ] Deduced a trap composed of 74 places in 49 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 8/40 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 14:55:39] [INFO ] Deduced a trap composed of 47 places in 253 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1868 variables, and 41 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 17/26 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 11/11 constraints]
After SMT, in 45185ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 45206ms
Finished structural reductions in LTL mode , in 1 iterations and 45266 ms. Remains : 532/544 places, 1360/1372 transitions.
[2024-06-01 14:55:44] [INFO ] Flatten gal took : 68 ms
[2024-06-01 14:55:44] [INFO ] Flatten gal took : 59 ms
[2024-06-01 14:55:44] [INFO ] Input system was already deterministic with 1360 transitions.
Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Applied a total of 0 rules in 12 ms. Remains 544 /544 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
Running 1368 sub problems to find dead transitions.
[2024-06-01 14:55:44] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
// Phase 1: matrix 1348 rows 544 cols
[2024-06-01 14:55:44] [INFO ] Computed 40 invariants in 21 ms
[2024-06-01 14:55:44] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-06-01 14:55:58] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 2 ms to minimize.
[2024-06-01 14:56:00] [INFO ] Deduced a trap composed of 112 places in 174 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 540/1892 variables, and 33 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/544 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1368/1368 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/540 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-06-01 14:56:19] [INFO ] Deduced a trap composed of 42 places in 272 ms of which 4 ms to minimize.
[2024-06-01 14:56:19] [INFO ] Deduced a trap composed of 76 places in 284 ms of which 3 ms to minimize.
[2024-06-01 14:56:19] [INFO ] Deduced a trap composed of 76 places in 255 ms of which 2 ms to minimize.
[2024-06-01 14:56:20] [INFO ] Deduced a trap composed of 76 places in 263 ms of which 2 ms to minimize.
[2024-06-01 14:56:20] [INFO ] Deduced a trap composed of 33 places in 252 ms of which 2 ms to minimize.
[2024-06-01 14:56:20] [INFO ] Deduced a trap composed of 76 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:56:23] [INFO ] Deduced a trap composed of 112 places in 100 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/540 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-06-01 14:56:26] [INFO ] Deduced a trap composed of 76 places in 136 ms of which 2 ms to minimize.
[2024-06-01 14:56:26] [INFO ] Deduced a trap composed of 77 places in 74 ms of which 1 ms to minimize.
[2024-06-01 14:56:27] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 2 ms to minimize.
[2024-06-01 14:56:27] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/1892 variables, and 44 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/544 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1368 constraints, Known Traps: 13/13 constraints]
After SMT, in 44642ms problems are : Problem set: 0 solved, 1368 unsolved
Search for dead transitions found 0 dead transitions in 44659ms
Finished structural reductions in LTL mode , in 1 iterations and 44675 ms. Remains : 544/544 places, 1372/1372 transitions.
[2024-06-01 14:56:29] [INFO ] Flatten gal took : 48 ms
[2024-06-01 14:56:29] [INFO ] Flatten gal took : 52 ms
[2024-06-01 14:56:29] [INFO ] Input system was already deterministic with 1372 transitions.
Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 538 transition count 1366
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 538 transition count 1366
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 532 transition count 1360
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 532 transition count 1360
Applied a total of 24 rules in 25 ms. Remains 532 /544 variables (removed 12) and now considering 1360/1372 (removed 12) transitions.
Running 1356 sub problems to find dead transitions.
[2024-06-01 14:56:29] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
// Phase 1: matrix 1336 rows 532 cols
[2024-06-01 14:56:29] [INFO ] Computed 40 invariants in 20 ms
[2024-06-01 14:56:29] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 14:56:44] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 2 ms to minimize.
[2024-06-01 14:56:47] [INFO ] Deduced a trap composed of 98 places in 132 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 9.0)
(s5 2.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 4.0)
(s11 3.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 4.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 3.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 32 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 17/26 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 14:57:01] [INFO ] Deduced a trap composed of 33 places in 329 ms of which 3 ms to minimize.
[2024-06-01 14:57:01] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 2 ms to minimize.
[2024-06-01 14:57:01] [INFO ] Deduced a trap composed of 74 places in 98 ms of which 2 ms to minimize.
[2024-06-01 14:57:01] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:57:01] [INFO ] Deduced a trap composed of 74 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:57:01] [INFO ] Deduced a trap composed of 75 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:57:03] [INFO ] Deduced a trap composed of 75 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:57:03] [INFO ] Deduced a trap composed of 74 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 8/40 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 14:57:10] [INFO ] Deduced a trap composed of 47 places in 280 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1868 variables, and 41 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 17/26 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 11/11 constraints]
After SMT, in 45306ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 45324ms
Finished structural reductions in LTL mode , in 1 iterations and 45355 ms. Remains : 532/544 places, 1360/1372 transitions.
[2024-06-01 14:57:14] [INFO ] Flatten gal took : 36 ms
[2024-06-01 14:57:14] [INFO ] Flatten gal took : 38 ms
[2024-06-01 14:57:14] [INFO ] Input system was already deterministic with 1360 transitions.
Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Applied a total of 0 rules in 7 ms. Remains 544 /544 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
Running 1368 sub problems to find dead transitions.
[2024-06-01 14:57:14] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
// Phase 1: matrix 1348 rows 544 cols
[2024-06-01 14:57:14] [INFO ] Computed 40 invariants in 45 ms
[2024-06-01 14:57:14] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-06-01 14:57:29] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 2 ms to minimize.
[2024-06-01 14:57:31] [INFO ] Deduced a trap composed of 112 places in 192 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 540/1892 variables, and 33 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/544 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1368/1368 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/540 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-06-01 14:57:50] [INFO ] Deduced a trap composed of 42 places in 271 ms of which 2 ms to minimize.
[2024-06-01 14:57:50] [INFO ] Deduced a trap composed of 76 places in 269 ms of which 3 ms to minimize.
[2024-06-01 14:57:50] [INFO ] Deduced a trap composed of 76 places in 248 ms of which 2 ms to minimize.
[2024-06-01 14:57:51] [INFO ] Deduced a trap composed of 76 places in 292 ms of which 3 ms to minimize.
[2024-06-01 14:57:51] [INFO ] Deduced a trap composed of 33 places in 286 ms of which 3 ms to minimize.
[2024-06-01 14:57:51] [INFO ] Deduced a trap composed of 76 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:57:55] [INFO ] Deduced a trap composed of 112 places in 125 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/540 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-06-01 14:57:57] [INFO ] Deduced a trap composed of 76 places in 80 ms of which 1 ms to minimize.
[2024-06-01 14:57:57] [INFO ] Deduced a trap composed of 77 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:57:58] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 1 ms to minimize.
[2024-06-01 14:57:58] [INFO ] Deduced a trap composed of 15 places in 69 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 Int declared 540/1892 variables, and 44 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/544 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1368 constraints, Known Traps: 13/13 constraints]
After SMT, in 44449ms problems are : Problem set: 0 solved, 1368 unsolved
Search for dead transitions found 0 dead transitions in 44461ms
Finished structural reductions in LTL mode , in 1 iterations and 44471 ms. Remains : 544/544 places, 1372/1372 transitions.
[2024-06-01 14:57:59] [INFO ] Flatten gal took : 41 ms
[2024-06-01 14:57:59] [INFO ] Flatten gal took : 44 ms
[2024-06-01 14:57:59] [INFO ] Input system was already deterministic with 1372 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 544 transition count 1354
Reduce places removed 18 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 24 rules applied. Total rules applied 42 place count 526 transition count 1348
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 48 place count 520 transition count 1348
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 48 place count 520 transition count 1312
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 120 place count 484 transition count 1312
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 126 place count 478 transition count 1306
Iterating global reduction 3 with 6 rules applied. Total rules applied 132 place count 478 transition count 1306
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 240 place count 424 transition count 1252
Applied a total of 240 rules in 86 ms. Remains 424 /544 variables (removed 120) and now considering 1252/1372 (removed 120) transitions.
Running 1248 sub problems to find dead transitions.
[2024-06-01 14:57:59] [INFO ] Flow matrix only has 1228 transitions (discarded 24 similar events)
// Phase 1: matrix 1228 rows 424 cols
[2024-06-01 14:57:59] [INFO ] Computed 40 invariants in 36 ms
[2024-06-01 14:57:59] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 19/31 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
[2024-06-01 14:58:12] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 2 ms to minimize.
[2024-06-01 14:58:12] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/1652 variables, and 33 constraints, problems are : Problem set: 0 solved, 1248 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 19/27 constraints, State Equation: 0/424 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1248/1248 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 19/31 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
[2024-06-01 14:58:26] [INFO ] Deduced a trap composed of 56 places in 314 ms of which 3 ms to minimize.
[2024-06-01 14:58:26] [INFO ] Deduced a trap composed of 56 places in 91 ms of which 1 ms to minimize.
[2024-06-01 14:58:27] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:58:27] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:58:27] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:58:27] [INFO ] Deduced a trap composed of 32 places in 254 ms of which 2 ms to minimize.
[2024-06-01 14:58:31] [INFO ] Deduced a trap composed of 57 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
[2024-06-01 14:58:40] [INFO ] Deduced a trap composed of 27 places in 188 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/1652 variables, and 41 constraints, problems are : Problem set: 0 solved, 1248 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 19/27 constraints, State Equation: 0/424 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1248 constraints, Known Traps: 10/10 constraints]
After SMT, in 45540ms problems are : Problem set: 0 solved, 1248 unsolved
Search for dead transitions found 0 dead transitions in 45556ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 45646 ms. Remains : 424/544 places, 1252/1372 transitions.
[2024-06-01 14:58:45] [INFO ] Flatten gal took : 39 ms
[2024-06-01 14:58:45] [INFO ] Flatten gal took : 44 ms
[2024-06-01 14:58:45] [INFO ] Input system was already deterministic with 1252 transitions.
Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 538 transition count 1366
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 538 transition count 1366
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 532 transition count 1360
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 532 transition count 1360
Applied a total of 24 rules in 19 ms. Remains 532 /544 variables (removed 12) and now considering 1360/1372 (removed 12) transitions.
Running 1356 sub problems to find dead transitions.
[2024-06-01 14:58:45] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
// Phase 1: matrix 1336 rows 532 cols
[2024-06-01 14:58:45] [INFO ] Computed 40 invariants in 45 ms
[2024-06-01 14:58:45] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 14:58:59] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 2 ms to minimize.
[2024-06-01 14:59:01] [INFO ] Deduced a trap composed of 98 places in 125 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 32 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 17/26 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 14:59:15] [INFO ] Deduced a trap composed of 33 places in 269 ms of which 3 ms to minimize.
[2024-06-01 14:59:16] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 2 ms to minimize.
[2024-06-01 14:59:16] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 2 ms to minimize.
[2024-06-01 14:59:16] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 2 ms to minimize.
[2024-06-01 14:59:16] [INFO ] Deduced a trap composed of 74 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:59:16] [INFO ] Deduced a trap composed of 75 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:59:18] [INFO ] Deduced a trap composed of 75 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:59:18] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 8/40 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 14:59:26] [INFO ] Deduced a trap composed of 47 places in 277 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1868 variables, and 41 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 17/26 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 11/11 constraints]
After SMT, in 44324ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 44336ms
Finished structural reductions in LTL mode , in 1 iterations and 44358 ms. Remains : 532/544 places, 1360/1372 transitions.
[2024-06-01 14:59:29] [INFO ] Flatten gal took : 85 ms
[2024-06-01 14:59:29] [INFO ] Flatten gal took : 66 ms
[2024-06-01 14:59:29] [INFO ] Input system was already deterministic with 1360 transitions.
Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Applied a total of 0 rules in 8 ms. Remains 544 /544 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
Running 1368 sub problems to find dead transitions.
[2024-06-01 14:59:30] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
// Phase 1: matrix 1348 rows 544 cols
[2024-06-01 14:59:30] [INFO ] Computed 40 invariants in 48 ms
[2024-06-01 14:59:30] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-06-01 14:59:45] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 3 ms to minimize.
[2024-06-01 14:59:47] [INFO ] Deduced a trap composed of 112 places in 173 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 540/1892 variables, and 33 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/544 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1368/1368 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/540 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-06-01 15:00:08] [INFO ] Deduced a trap composed of 42 places in 261 ms of which 3 ms to minimize.
[2024-06-01 15:00:08] [INFO ] Deduced a trap composed of 76 places in 245 ms of which 2 ms to minimize.
[2024-06-01 15:00:08] [INFO ] Deduced a trap composed of 76 places in 289 ms of which 3 ms to minimize.
[2024-06-01 15:00:09] [INFO ] Deduced a trap composed of 76 places in 275 ms of which 2 ms to minimize.
[2024-06-01 15:00:09] [INFO ] Deduced a trap composed of 33 places in 277 ms of which 3 ms to minimize.
[2024-06-01 15:00:09] [INFO ] Deduced a trap composed of 76 places in 64 ms of which 1 ms to minimize.
[2024-06-01 15:00:12] [INFO ] Deduced a trap composed of 112 places in 151 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/540 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-06-01 15:00:15] [INFO ] Deduced a trap composed of 76 places in 82 ms of which 1 ms to minimize.
[2024-06-01 15:00:15] [INFO ] Deduced a trap composed of 77 places in 50 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 Int declared 540/1892 variables, and 42 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/544 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1368 constraints, Known Traps: 11/11 constraints]
After SMT, in 46086ms problems are : Problem set: 0 solved, 1368 unsolved
Search for dead transitions found 0 dead transitions in 46103ms
Finished structural reductions in LTL mode , in 1 iterations and 46115 ms. Remains : 544/544 places, 1372/1372 transitions.
[2024-06-01 15:00:16] [INFO ] Flatten gal took : 45 ms
[2024-06-01 15:00:16] [INFO ] Flatten gal took : 42 ms
[2024-06-01 15:00:16] [INFO ] Input system was already deterministic with 1372 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 544 transition count 1318
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 490 transition count 1318
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 108 place count 490 transition count 1258
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 228 place count 430 transition count 1258
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 230 place count 428 transition count 1256
Iterating global reduction 2 with 2 rules applied. Total rules applied 232 place count 428 transition count 1256
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 344 place count 372 transition count 1200
Applied a total of 344 rules in 125 ms. Remains 372 /544 variables (removed 172) and now considering 1200/1372 (removed 172) transitions.
Running 1196 sub problems to find dead transitions.
[2024-06-01 15:00:16] [INFO ] Flow matrix only has 1176 transitions (discarded 24 similar events)
// Phase 1: matrix 1176 rows 372 cols
[2024-06-01 15:00:16] [INFO ] Computed 40 invariants in 24 ms
[2024-06-01 15:00:16] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/368 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/368 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1196 unsolved
[2024-06-01 15:00:29] [INFO ] Deduced a trap composed of 131 places in 175 ms of which 1 ms to minimize.
[2024-06-01 15:00:29] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 1 ms to minimize.
[2024-06-01 15:00:29] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 4 ms to minimize.
[2024-06-01 15:00:29] [INFO ] Deduced a trap composed of 64 places in 210 ms of which 2 ms to minimize.
[2024-06-01 15:00:30] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 1 ms to minimize.
[2024-06-01 15:00:30] [INFO ] Deduced a trap composed of 31 places in 174 ms of which 2 ms to minimize.
[2024-06-01 15:00:30] [INFO ] Deduced a trap composed of 89 places in 162 ms of which 1 ms to minimize.
[2024-06-01 15:00:30] [INFO ] Deduced a trap composed of 61 places in 217 ms of which 3 ms to minimize.
[2024-06-01 15:00:30] [INFO ] Deduced a trap composed of 61 places in 173 ms of which 1 ms to minimize.
[2024-06-01 15:00:31] [INFO ] Deduced a trap composed of 65 places in 154 ms of which 2 ms to minimize.
[2024-06-01 15:00:31] [INFO ] Deduced a trap composed of 62 places in 226 ms of which 2 ms to minimize.
[2024-06-01 15:00:31] [INFO ] Deduced a trap composed of 61 places in 138 ms of which 2 ms to minimize.
[2024-06-01 15:00:31] [INFO ] Deduced a trap composed of 59 places in 150 ms of which 1 ms to minimize.
[2024-06-01 15:00:32] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 1 ms to minimize.
[2024-06-01 15:00:38] [INFO ] Deduced a trap composed of 126 places in 171 ms of which 2 ms to minimize.
[2024-06-01 15:00:39] [INFO ] Deduced a trap composed of 124 places in 196 ms of which 2 ms to minimize.
[2024-06-01 15:00:39] [INFO ] Deduced a trap composed of 37 places in 195 ms of which 2 ms to minimize.
[2024-06-01 15:00:39] [INFO ] Deduced a trap composed of 64 places in 152 ms of which 2 ms to minimize.
[2024-06-01 15:00:39] [INFO ] Deduced a trap composed of 30 places in 153 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/368 variables, 19/54 constraints. Problems are: Problem set: 0 solved, 1196 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 9.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 2.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 1.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 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 9.0)
(s84 0.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 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 2.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 1.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 2.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 1.0)
(s170 0.0)
(s171 2.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 1.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 1.0)
(s200 0.0)
(s201 0.0)
(s202 1.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 1.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 368/1548 variables, and 54 constraints, problems are : Problem set: 0 solved, 1196 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/372 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1196/1196 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/368 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/368 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/368 variables, 19/54 constraints. Problems are: Problem set: 0 solved, 1196 unsolved
[2024-06-01 15:00:52] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 1 ms to minimize.
[2024-06-01 15:00:52] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2024-06-01 15:00:53] [INFO ] Deduced a trap composed of 47 places in 34 ms of which 1 ms to minimize.
[2024-06-01 15:00:53] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2024-06-01 15:00:53] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:00:55] [INFO ] Deduced a trap composed of 106 places in 214 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/368 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 1196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/1548 variables, and 60 constraints, problems are : Problem set: 0 solved, 1196 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/372 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1196 constraints, Known Traps: 25/25 constraints]
After SMT, in 45269ms problems are : Problem set: 0 solved, 1196 unsolved
Search for dead transitions found 0 dead transitions in 45281ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 45410 ms. Remains : 372/544 places, 1200/1372 transitions.
[2024-06-01 15:01:01] [INFO ] Flatten gal took : 73 ms
[2024-06-01 15:01:01] [INFO ] Flatten gal took : 57 ms
[2024-06-01 15:01:01] [INFO ] Input system was already deterministic with 1200 transitions.
RANDOM walk for 660 steps (0 resets) in 12 ms. (50 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-PT-S04J04T06-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 538 transition count 1366
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 538 transition count 1366
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 532 transition count 1360
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 532 transition count 1360
Applied a total of 24 rules in 53 ms. Remains 532 /544 variables (removed 12) and now considering 1360/1372 (removed 12) transitions.
Running 1356 sub problems to find dead transitions.
[2024-06-01 15:01:02] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
// Phase 1: matrix 1336 rows 532 cols
[2024-06-01 15:01:02] [INFO ] Computed 40 invariants in 45 ms
[2024-06-01 15:01:02] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 15:01:17] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-06-01 15:01:19] [INFO ] Deduced a trap composed of 98 places in 119 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 32 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 17/26 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 15:01:33] [INFO ] Deduced a trap composed of 33 places in 332 ms of which 3 ms to minimize.
[2024-06-01 15:01:34] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 2 ms to minimize.
[2024-06-01 15:01:34] [INFO ] Deduced a trap composed of 74 places in 112 ms of which 2 ms to minimize.
[2024-06-01 15:01:34] [INFO ] Deduced a trap composed of 74 places in 91 ms of which 1 ms to minimize.
[2024-06-01 15:01:34] [INFO ] Deduced a trap composed of 74 places in 62 ms of which 0 ms to minimize.
[2024-06-01 15:01:34] [INFO ] Deduced a trap composed of 75 places in 73 ms of which 1 ms to minimize.
[2024-06-01 15:01:37] [INFO ] Deduced a trap composed of 75 places in 49 ms of which 1 ms to minimize.
[2024-06-01 15:01:37] [INFO ] Deduced a trap composed of 74 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 8/40 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 15:01:45] [INFO ] Deduced a trap composed of 47 places in 247 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1868 variables, and 41 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 17/26 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 11/11 constraints]
After SMT, in 45179ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 45201ms
Finished structural reductions in LTL mode , in 1 iterations and 45261 ms. Remains : 532/544 places, 1360/1372 transitions.
[2024-06-01 15:01:47] [INFO ] Flatten gal took : 38 ms
[2024-06-01 15:01:47] [INFO ] Flatten gal took : 43 ms
[2024-06-01 15:01:47] [INFO ] Input system was already deterministic with 1360 transitions.
Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 538 transition count 1366
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 538 transition count 1366
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 532 transition count 1360
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 532 transition count 1360
Applied a total of 24 rules in 23 ms. Remains 532 /544 variables (removed 12) and now considering 1360/1372 (removed 12) transitions.
Running 1356 sub problems to find dead transitions.
[2024-06-01 15:01:47] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-06-01 15:01:47] [INFO ] Invariant cache hit.
[2024-06-01 15:01:47] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 15:02:03] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 2 ms to minimize.
[2024-06-01 15:02:04] [INFO ] Deduced a trap composed of 100 places in 160 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 32 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 17/26 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 15:02:26] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1868 variables, and 33 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 17/26 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 3/3 constraints]
After SMT, in 45072ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 45086ms
Finished structural reductions in LTL mode , in 1 iterations and 45113 ms. Remains : 532/544 places, 1360/1372 transitions.
[2024-06-01 15:02:32] [INFO ] Flatten gal took : 42 ms
[2024-06-01 15:02:32] [INFO ] Flatten gal took : 45 ms
[2024-06-01 15:02:32] [INFO ] Input system was already deterministic with 1360 transitions.
[2024-06-01 15:02:32] [INFO ] Flatten gal took : 67 ms
[2024-06-01 15:02:32] [INFO ] Flatten gal took : 75 ms
[2024-06-01 15:02:33] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLFireability.sr.xml took 17 ms.
[2024-06-01 15:02:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 544 places, 1372 transitions and 6956 arcs took 13 ms.
Total runtime 604472 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : PolyORBLF-PT-S04J04T06-CTLFireability-2024-00
Could not compute solution for formula : PolyORBLF-PT-S04J04T06-CTLFireability-2024-01
Could not compute solution for formula : PolyORBLF-PT-S04J04T06-CTLFireability-2024-02
Could not compute solution for formula : PolyORBLF-PT-S04J04T06-CTLFireability-2024-03
Could not compute solution for formula : PolyORBLF-PT-S04J04T06-CTLFireability-2024-04
Could not compute solution for formula : PolyORBLF-PT-S04J04T06-CTLFireability-2024-05
Could not compute solution for formula : PolyORBLF-PT-S04J04T06-CTLFireability-2024-06
Could not compute solution for formula : PolyORBLF-PT-S04J04T06-CTLFireability-2024-07
Could not compute solution for formula : PolyORBLF-PT-S04J04T06-CTLFireability-2024-11
Could not compute solution for formula : PolyORBLF-PT-S04J04T06-CTLFireability-2024-13

BK_STOP 1717254153531

--------------------
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-PT-S04J04T06-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1234/ctl_0_
ctl formula name PolyORBLF-PT-S04J04T06-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1234/ctl_1_
ctl formula name PolyORBLF-PT-S04J04T06-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1234/ctl_2_
ctl formula name PolyORBLF-PT-S04J04T06-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1234/ctl_3_
ctl formula name PolyORBLF-PT-S04J04T06-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1234/ctl_4_
ctl formula name PolyORBLF-PT-S04J04T06-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1234/ctl_5_
ctl formula name PolyORBLF-PT-S04J04T06-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1234/ctl_6_
ctl formula name PolyORBLF-PT-S04J04T06-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1234/ctl_7_
ctl formula name PolyORBLF-PT-S04J04T06-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1234/ctl_8_
ctl formula name PolyORBLF-PT-S04J04T06-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/1234/ctl_9_
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-PT-S04J04T06"
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-PT-S04J04T06, 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-171654446700266"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S04J04T06.tgz
mv PolyORBLF-PT-S04J04T06 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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;