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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 8.9K Apr 11 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 11 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 11 17:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 11 17:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 11 17:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 11 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717249473416

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S04J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:44:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 13:44:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:44:34] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 13:44:35] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 13:44:35] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 832 ms
[2024-06-01 13:44:35] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 554 PT places and 3040.0 transition bindings in 38 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
[2024-06-01 13:44:35] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 4 ms.
[2024-06-01 13:44:35] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40000 steps (10 resets) in 1880 ms. (21 steps per ms) remains 67/97 properties
BEST_FIRST walk for 4001 steps (8 resets) in 163 ms. (24 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (8 resets) in 49 ms. (80 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (8 resets) in 25 ms. (153 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (8 resets) in 33 ms. (117 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (8 resets) in 34 ms. (114 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (8 resets) in 27 ms. (142 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (8 resets) in 36 ms. (108 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (8 resets) in 50 ms. (78 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 67/67 properties
[2024-06-01 13:44:37] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-06-01 13:44:37] [INFO ] Computed 26 invariants in 6 ms
[2024-06-01 13:44:37] [INFO ] State equation strengthened by 8 read => feed constraints.
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp87 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 4/4 constraints. Problems are: Problem set: 13 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 2/6 constraints. Problems are: Problem set: 13 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 13 solved, 54 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp83 is UNSAT
Problem AtomicPropp84 is UNSAT
Problem AtomicPropp85 is UNSAT
Problem AtomicPropp94 is UNSAT
At refinement iteration 3 (OVERLAPS) 12/71 variables, 7/13 constraints. Problems are: Problem set: 49 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/13 constraints. Problems are: Problem set: 49 solved, 18 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp88 is UNSAT
Problem AtomicPropp89 is UNSAT
Problem AtomicPropp91 is UNSAT
Problem AtomicPropp93 is UNSAT
After SMT solving in domain Real declared 81/145 variables, and 26 constraints, problems are : Problem set: 67 solved, 0 unsolved in 474 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 0/81 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints]
After SMT, in 524ms problems are : Problem set: 67 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 67 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-COL-S04J04T06-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T06-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T06-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:44:37] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-06-01 13:44:37] [INFO ] Flatten gal took : 29 ms
[2024-06-01 13:44:37] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBLF-COL-S04J04T06-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T06-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T06-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T06-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:44:37] [INFO ] Flatten gal took : 7 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-06-01 13:44:37] [INFO ] Unfolded HLPN to a Petri net with 554 places and 2998 transitions 20754 arcs in 74 ms.
[2024-06-01 13:44:37] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
Support contains 365 out of 554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 554/554 places, 1372/1372 transitions.
Applied a total of 0 rules in 26 ms. Remains 554 /554 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
Running 1368 sub problems to find dead transitions.
[2024-06-01 13:44:38] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
// Phase 1: matrix 1348 rows 554 cols
[2024-06-01 13:44:38] [INFO ] Computed 50 invariants in 66 ms
[2024-06-01 13:44:38] [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, 29/42 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-06-01 13:44:52] [INFO ] Deduced a trap composed of 75 places in 137 ms of which 18 ms to minimize.
[2024-06-01 13:44:52] [INFO ] Deduced a trap composed of 75 places in 114 ms of which 2 ms to minimize.
[2024-06-01 13:44:52] [INFO ] Deduced a trap composed of 75 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:44:52] [INFO ] Deduced a trap composed of 75 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:44:53] [INFO ] Deduced a trap composed of 75 places in 75 ms of which 1 ms to minimize.
[2024-06-01 13:44:53] [INFO ] Deduced a trap composed of 301 places in 326 ms of which 5 ms to minimize.
[2024-06-01 13:44:54] [INFO ] Deduced a trap composed of 157 places in 265 ms of which 4 ms to minimize.
[2024-06-01 13:44:54] [INFO ] Deduced a trap composed of 75 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:44:54] [INFO ] Deduced a trap composed of 302 places in 291 ms of which 4 ms to minimize.
[2024-06-01 13:44:56] [INFO ] Deduced a trap composed of 321 places in 277 ms of which 3 ms to minimize.
[2024-06-01 13:44:56] [INFO ] Deduced a trap composed of 312 places in 324 ms of which 3 ms to minimize.
[2024-06-01 13:44:56] [INFO ] Deduced a trap composed of 313 places in 324 ms of which 3 ms to minimize.
[2024-06-01 13:44:57] [INFO ] Deduced a trap composed of 314 places in 352 ms of which 4 ms to minimize.
[2024-06-01 13:44:57] [INFO ] Deduced a trap composed of 314 places in 316 ms of which 4 ms to minimize.
[2024-06-01 13:44:57] [INFO ] Deduced a trap composed of 354 places in 335 ms of which 4 ms to minimize.
[2024-06-01 13:44:58] [INFO ] Deduced a trap composed of 302 places in 389 ms of which 4 ms to minimize.
[2024-06-01 13:44:58] [INFO ] Deduced a trap composed of 336 places in 441 ms of which 4 ms to minimize.
[2024-06-01 13:44:59] [INFO ] Deduced a trap composed of 309 places in 433 ms of which 4 ms to minimize.
[2024-06-01 13:44:59] [INFO ] Deduced a trap composed of 285 places in 373 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 546/1902 variables, and 61 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 13/19 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/554 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1368/1368 constraints, Known Traps: 19/19 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, 29/42 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/546 variables, 19/61 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-06-01 13:45:05] [INFO ] Deduced a trap composed of 315 places in 369 ms of which 4 ms to minimize.
[2024-06-01 13:45:06] [INFO ] Deduced a trap composed of 324 places in 394 ms of which 4 ms to minimize.
[2024-06-01 13:45:07] [INFO ] Deduced a trap composed of 15 places in 361 ms of which 4 ms to minimize.
[2024-06-01 13:45:07] [INFO ] Deduced a trap composed of 323 places in 356 ms of which 4 ms to minimize.
[2024-06-01 13:45:08] [INFO ] Deduced a trap composed of 316 places in 394 ms of which 5 ms to minimize.
[2024-06-01 13:45:08] [INFO ] Deduced a trap composed of 280 places in 375 ms of which 4 ms to minimize.
[2024-06-01 13:45:23] [INFO ] Deduced a trap composed of 42 places in 365 ms of which 4 ms to minimize.
SMT process timed out in 45146ms, After SMT, problems are : Problem set: 0 solved, 1368 unsolved
Search for dead transitions found 0 dead transitions in 45171ms
[2024-06-01 13:45:23] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
[2024-06-01 13:45:23] [INFO ] Invariant cache hit.
[2024-06-01 13:45:23] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-06-01 13:45:23] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
[2024-06-01 13:45:23] [INFO ] Invariant cache hit.
[2024-06-01 13:45:24] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:45:26] [INFO ] Implicit Places using invariants and state equation in 3534 ms returned []
Implicit Place search using SMT with State Equation took 3780 ms to find 0 implicit places.
Running 1368 sub problems to find dead transitions.
[2024-06-01 13:45:26] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
[2024-06-01 13:45:26] [INFO ] Invariant cache hit.
[2024-06-01 13:45:26] [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, 29/42 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-06-01 13:45:41] [INFO ] Deduced a trap composed of 75 places in 110 ms of which 2 ms to minimize.
[2024-06-01 13:45:41] [INFO ] Deduced a trap composed of 75 places in 69 ms of which 2 ms to minimize.
[2024-06-01 13:45:41] [INFO ] Deduced a trap composed of 75 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:45:41] [INFO ] Deduced a trap composed of 75 places in 75 ms of which 1 ms to minimize.
[2024-06-01 13:45:41] [INFO ] Deduced a trap composed of 75 places in 70 ms of which 1 ms to minimize.
[2024-06-01 13:45:42] [INFO ] Deduced a trap composed of 171 places in 299 ms of which 3 ms to minimize.
[2024-06-01 13:45:43] [INFO ] Deduced a trap composed of 75 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:45:48] [INFO ] Deduced a trap composed of 297 places in 329 ms of which 4 ms to minimize.
[2024-06-01 13:45:55] [INFO ] Deduced a trap composed of 297 places in 308 ms of which 4 ms to minimize.
[2024-06-01 13:45:55] [INFO ] Deduced a trap composed of 280 places in 317 ms of which 4 ms to minimize.
[2024-06-01 13:45:56] [INFO ] Deduced a trap composed of 107 places in 320 ms of which 4 ms to minimize.
[2024-06-01 13:45:57] [INFO ] Deduced a trap composed of 286 places in 271 ms of which 4 ms to minimize.
[2024-06-01 13:45:57] [INFO ] Deduced a trap composed of 307 places in 318 ms of which 4 ms to minimize.
[2024-06-01 13:45:57] [INFO ] Deduced a trap composed of 303 places in 297 ms of which 5 ms to minimize.
[2024-06-01 13:45:58] [INFO ] Deduced a trap composed of 276 places in 299 ms of which 4 ms to minimize.
[2024-06-01 13:45:58] [INFO ] Deduced a trap composed of 310 places in 373 ms of which 4 ms to minimize.
[2024-06-01 13:45:59] [INFO ] Deduced a trap composed of 315 places in 349 ms of which 4 ms to minimize.
[2024-06-01 13:45:59] [INFO ] Deduced a trap composed of 59 places in 232 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 546/1902 variables, and 60 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/19 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/554 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1368/1368 constraints, Known Traps: 18/18 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, 29/42 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/546 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-06-01 13:46:04] [INFO ] Deduced a trap composed of 264 places in 330 ms of which 4 ms to minimize.
[2024-06-01 13:46:04] [INFO ] Deduced a trap composed of 266 places in 325 ms of which 4 ms to minimize.
[2024-06-01 13:46:09] [INFO ] Deduced a trap composed of 66 places in 201 ms of which 3 ms to minimize.
[2024-06-01 13:46:09] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 2 ms to minimize.
[2024-06-01 13:46:19] [INFO ] Deduced a trap composed of 278 places in 299 ms of which 4 ms to minimize.
[2024-06-01 13:46:19] [INFO ] Deduced a trap composed of 369 places in 288 ms of which 4 ms to minimize.
[2024-06-01 13:46:19] [INFO ] Deduced a trap composed of 259 places in 356 ms of which 5 ms to minimize.
[2024-06-01 13:46:21] [INFO ] Deduced a trap composed of 146 places in 364 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/546 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 546/1902 variables, and 68 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/19 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/554 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1368 constraints, Known Traps: 26/26 constraints]
After SMT, in 65201ms problems are : Problem set: 0 solved, 1368 unsolved
Search for dead transitions found 0 dead transitions in 65214ms
Finished structural reductions in LTL mode , in 1 iterations and 114217 ms. Remains : 554/554 places, 1372/1372 transitions.
Support contains 365 out of 554 places after structural reductions.
[2024-06-01 13:46:32] [INFO ] Flatten gal took : 119 ms
[2024-06-01 13:46:32] [INFO ] Flatten gal took : 96 ms
[2024-06-01 13:46:32] [INFO ] Input system was already deterministic with 1372 transitions.
RANDOM walk for 40000 steps (10 resets) in 1588 ms. (25 steps per ms) remains 40/55 properties
BEST_FIRST walk for 4001 steps (8 resets) in 73 ms. (54 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 66 ms. (59 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 57 ms. (69 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4000 steps (8 resets) in 59 ms. (66 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (8 resets) in 70 ms. (56 steps per ms) remains 40/40 properties
[2024-06-01 13:46:34] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
[2024-06-01 13:46:34] [INFO ] Invariant cache hit.
[2024-06-01 13:46:34] [INFO ] State equation strengthened by 120 read => feed constraints.
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp45 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 7/9 constraints. Problems are: Problem set: 4 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 36 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
At refinement iteration 3 (OVERLAPS) 81/362 variables, 12/21 constraints. Problems are: Problem set: 16 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 0/21 constraints. Problems are: Problem set: 16 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 10/372 variables, 5/26 constraints. Problems are: Problem set: 16 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/26 constraints. Problems are: Problem set: 16 solved, 24 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
After SMT solving in domain Real declared 554/1902 variables, and 50 constraints, problems are : Problem set: 40 solved, 0 unsolved in 794 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 0/554 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 929ms problems are : Problem set: 40 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 40 atomic propositions for a total of 9 simplifications.
[2024-06-01 13:46:35] [INFO ] Flatten gal took : 69 ms
[2024-06-01 13:46:35] [INFO ] Flatten gal took : 68 ms
[2024-06-01 13:46:35] [INFO ] Input system was already deterministic with 1372 transitions.
Support contains 121 out of 554 places (down from 151) after GAL structural reductions.
FORMULA PolyORBLF-COL-S04J04T06-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
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
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 544 transition count 1366
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 544 transition count 1366
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 538 transition count 1360
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 538 transition count 1360
Applied a total of 28 rules in 67 ms. Remains 538 /554 variables (removed 16) and now considering 1360/1372 (removed 12) transitions.
Running 1356 sub problems to find dead transitions.
[2024-06-01 13:46:35] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
// Phase 1: matrix 1336 rows 538 cols
[2024-06-01 13:46:35] [INFO ] Computed 46 invariants in 103 ms
[2024-06-01 13:46:35] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 13:46:50] [INFO ] Deduced a trap composed of 98 places in 247 ms of which 3 ms to minimize.
[2024-06-01 13:46:50] [INFO ] Deduced a trap composed of 133 places in 223 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 534/1874 variables, and 43 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 31/35 constraints, State Equation: 0/538 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/534 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/534 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 13:47:06] [INFO ] Deduced a trap composed of 15 places in 252 ms of which 3 ms to minimize.
[2024-06-01 13:47:06] [INFO ] Deduced a trap composed of 73 places in 78 ms of which 2 ms to minimize.
[2024-06-01 13:47:06] [INFO ] Deduced a trap composed of 73 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:47:06] [INFO ] Deduced a trap composed of 73 places in 54 ms of which 2 ms to minimize.
[2024-06-01 13:47:06] [INFO ] Deduced a trap composed of 73 places in 66 ms of which 2 ms to minimize.
[2024-06-01 13:47:15] [INFO ] Deduced a trap composed of 262 places in 220 ms of which 3 ms to minimize.
[2024-06-01 13:47:15] [INFO ] Deduced a trap composed of 259 places in 257 ms of which 4 ms to minimize.
[2024-06-01 13:47:16] [INFO ] Deduced a trap composed of 258 places in 269 ms of which 4 ms to minimize.
[2024-06-01 13:47:16] [INFO ] Deduced a trap composed of 272 places in 298 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/534 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/1874 variables, and 52 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 31/35 constraints, State Equation: 0/538 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 11/11 constraints]
After SMT, in 45651ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 45668ms
Finished structural reductions in LTL mode , in 1 iterations and 45740 ms. Remains : 538/554 places, 1360/1372 transitions.
[2024-06-01 13:47:21] [INFO ] Flatten gal took : 60 ms
[2024-06-01 13:47:21] [INFO ] Flatten gal took : 64 ms
[2024-06-01 13:47:21] [INFO ] Input system was already deterministic with 1360 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 554/554 places, 1372/1372 transitions.
Ensure Unique test removed 4 places
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 550 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 496 transition count 1318
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 108 place count 496 transition count 1288
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 168 place count 466 transition count 1288
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 288 place count 406 transition count 1228
Applied a total of 288 rules in 114 ms. Remains 406 /554 variables (removed 148) and now considering 1228/1372 (removed 144) transitions.
Running 1224 sub problems to find dead transitions.
[2024-06-01 13:47:21] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
// Phase 1: matrix 1204 rows 406 cols
[2024-06-01 13:47:21] [INFO ] Computed 46 invariants in 39 ms
[2024-06-01 13:47:21] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 28/37 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-06-01 13:47:33] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 3 ms to minimize.
[2024-06-01 13:47:39] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 402/1610 variables, and 39 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 9/11 constraints, Generalized P Invariants (flows): 28/35 constraints, State Equation: 0/406 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1224/1224 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 28/37 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/404 variables, 2/41 constraints. Problems are: Problem set: 174 solved, 1050 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 0/41 constraints. Problems are: Problem set: 174 solved, 1050 unsolved
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
At refinement iteration 6 (OVERLAPS) 2/406 variables, 7/48 constraints. Problems are: Problem set: 324 solved, 900 unsolved
[2024-06-01 13:48:03] [INFO ] Deduced a trap composed of 172 places in 284 ms of which 4 ms to minimize.
[2024-06-01 13:48:04] [INFO ] Deduced a trap composed of 62 places in 278 ms of which 4 ms to minimize.
[2024-06-01 13:48:04] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 1 ms to minimize.
[2024-06-01 13:48:04] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 2 ms to minimize.
[2024-06-01 13:48:04] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:48:04] [INFO ] Deduced a trap composed of 51 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:48:04] [INFO ] Deduced a trap composed of 52 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:48:05] [INFO ] Deduced a trap composed of 53 places in 265 ms of which 2 ms to minimize.
[2024-06-01 13:48:05] [INFO ] Deduced a trap composed of 211 places in 309 ms of which 3 ms to minimize.
[2024-06-01 13:48:05] [INFO ] Deduced a trap composed of 203 places in 273 ms of which 2 ms to minimize.
[2024-06-01 13:48:05] [INFO ] Deduced a trap composed of 181 places in 306 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 9)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 0)
(s90 1)
(s91 0)
(s92 1)
(s93 0)
(s94 0)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 9)
(s105 0)
(s106 1)
(s107 1)
(s108 0)
(s109 1)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 timeout
0)
(s115 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/1610 variables, and 59 constraints, problems are : Problem set: 324 solved, 900 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 0/406 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1224 constraints, Known Traps: 13/13 constraints]
After SMT, in 45037ms problems are : Problem set: 324 solved, 900 unsolved
Search for dead transitions found 324 dead transitions in 45053ms
Found 324 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 324 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 324 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 406/554 places, 904/1372 transitions.
Applied a total of 0 rules in 32 ms. Remains 406 /406 variables (removed 0) and now considering 904/904 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45203 ms. Remains : 406/554 places, 904/1372 transitions.
[2024-06-01 13:48:06] [INFO ] Flatten gal took : 43 ms
[2024-06-01 13:48:06] [INFO ] Flatten gal took : 47 ms
[2024-06-01 13:48:06] [INFO ] Input system was already deterministic with 904 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 554/554 places, 1372/1372 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 550 transition count 1336
Reduce places removed 36 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 42 rules applied. Total rules applied 78 place count 514 transition count 1330
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 84 place count 508 transition count 1330
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 84 place count 508 transition count 1270
Deduced a syphon composed of 60 places in 3 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 204 place count 448 transition count 1270
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 3 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 324 place count 388 transition count 1210
Applied a total of 324 rules in 143 ms. Remains 388 /554 variables (removed 166) and now considering 1210/1372 (removed 162) transitions.
Running 1206 sub problems to find dead transitions.
[2024-06-01 13:48:06] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
// Phase 1: matrix 1186 rows 388 cols
[2024-06-01 13:48:06] [INFO ] Computed 46 invariants in 30 ms
[2024-06-01 13:48:06] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-06-01 13:48:18] [INFO ] Deduced a trap composed of 48 places in 110 ms of which 2 ms to minimize.
[2024-06-01 13:48:18] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:48:18] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:48:18] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:48:18] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:48:18] [INFO ] Deduced a trap composed of 164 places in 291 ms of which 3 ms to minimize.
[2024-06-01 13:48:19] [INFO ] Deduced a trap composed of 58 places in 265 ms of which 2 ms to minimize.
[2024-06-01 13:48:20] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 2 ms to minimize.
[2024-06-01 13:48:28] [INFO ] Deduced a trap composed of 132 places in 262 ms of which 3 ms to minimize.
[2024-06-01 13:48:29] [INFO ] Deduced a trap composed of 125 places in 265 ms of which 2 ms to minimize.
[2024-06-01 13:48:29] [INFO ] Deduced a trap composed of 178 places in 239 ms of which 3 ms to minimize.
[2024-06-01 13:48:29] [INFO ] Deduced a trap composed of 175 places in 252 ms of which 3 ms to minimize.
[2024-06-01 13:48:29] [INFO ] Deduced a trap composed of 160 places in 232 ms of which 3 ms to minimize.
[2024-06-01 13:48:30] [INFO ] Deduced a trap composed of 190 places in 209 ms of which 2 ms to minimize.
[2024-06-01 13:48:31] [INFO ] Deduced a trap composed of 169 places in 256 ms of which 3 ms to minimize.
[2024-06-01 13:48:31] [INFO ] Deduced a trap composed of 168 places in 232 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 384/1574 variables, and 58 constraints, problems are : Problem set: 0 solved, 1206 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/388 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1206/1206 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-06-01 13:48:33] [INFO ] Deduced a trap composed of 51 places in 182 ms of which 2 ms to minimize.
[2024-06-01 13:48:34] [INFO ] Deduced a trap composed of 71 places in 281 ms of which 4 ms to minimize.
[2024-06-01 13:48:35] [INFO ] Deduced a trap composed of 138 places in 277 ms of which 3 ms to minimize.
[2024-06-01 13:48:36] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 2 ms to minimize.
[2024-06-01 13:48:44] [INFO ] Deduced a trap composed of 150 places in 261 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 384/1574 variables, and 63 constraints, problems are : Problem set: 0 solved, 1206 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/388 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1206 constraints, Known Traps: 21/21 constraints]
After SMT, in 45023ms problems are : Problem set: 0 solved, 1206 unsolved
Search for dead transitions found 0 dead transitions in 45036ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 45183 ms. Remains : 388/554 places, 1210/1372 transitions.
[2024-06-01 13:48:51] [INFO ] Flatten gal took : 47 ms
[2024-06-01 13:48:51] [INFO ] Flatten gal took : 52 ms
[2024-06-01 13:48:52] [INFO ] Input system was already deterministic with 1210 transitions.
RANDOM walk for 314 steps (0 resets) in 5 ms. (52 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-COL-S04J04T06-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 544 transition count 1366
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 544 transition count 1366
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 538 transition count 1360
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 538 transition count 1360
Applied a total of 28 rules in 40 ms. Remains 538 /554 variables (removed 16) and now considering 1360/1372 (removed 12) transitions.
Running 1356 sub problems to find dead transitions.
[2024-06-01 13:48:52] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
// Phase 1: matrix 1336 rows 538 cols
[2024-06-01 13:48:52] [INFO ] Computed 46 invariants in 44 ms
[2024-06-01 13:48:52] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 13:49:06] [INFO ] Deduced a trap composed of 73 places in 102 ms of which 2 ms to minimize.
[2024-06-01 13:49:07] [INFO ] Deduced a trap composed of 73 places in 86 ms of which 1 ms to minimize.
[2024-06-01 13:49:07] [INFO ] Deduced a trap composed of 73 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:49:07] [INFO ] Deduced a trap composed of 73 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:49:07] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 1 ms to minimize.
[2024-06-01 13:49:08] [INFO ] Deduced a trap composed of 133 places in 358 ms of which 4 ms to minimize.
[2024-06-01 13:49:09] [INFO ] Deduced a trap composed of 309 places in 324 ms of which 4 ms to minimize.
[2024-06-01 13:49:10] [INFO ] Deduced a trap composed of 73 places in 74 ms of which 2 ms to minimize.
[2024-06-01 13:49:15] [INFO ] Deduced a trap composed of 296 places in 320 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 534/1874 variables, and 51 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/538 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/534 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 13:49:24] [INFO ] Deduced a trap composed of 310 places in 270 ms of which 3 ms to minimize.
[2024-06-01 13:49:24] [INFO ] Deduced a trap composed of 274 places in 246 ms of which 3 ms to minimize.
[2024-06-01 13:49:24] [INFO ] Deduced a trap composed of 267 places in 298 ms of which 3 ms to minimize.
[2024-06-01 13:49:26] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 2 ms to minimize.
[2024-06-01 13:49:34] [INFO ] Deduced a trap composed of 282 places in 281 ms of which 4 ms to minimize.
[2024-06-01 13:49:34] [INFO ] Deduced a trap composed of 279 places in 267 ms of which 4 ms to minimize.
[2024-06-01 13:49:34] [INFO ] Deduced a trap composed of 297 places in 234 ms of which 3 ms to minimize.
[2024-06-01 13:49:34] [INFO ] Deduced a trap composed of 274 places in 232 ms of which 4 ms to minimize.
[2024-06-01 13:49:35] [INFO ] Deduced a trap composed of 59 places in 177 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 10)
(s123 1)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 1)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 1)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 1)
(s244 0)
(s245 0)
(s246 1)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s261 1)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 1)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 10)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 1)
(s447 1)
(s448 0)
(s449 0)
(s450 1)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 1)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/1874 variables, and 60 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/538 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 18/18 constraints]
After SMT, in 45035ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 45052ms
Finished structural reductions in LTL mode , in 1 iterations and 45098 ms. Remains : 538/554 places, 1360/1372 transitions.
[2024-06-01 13:49:37] [INFO ] Flatten gal took : 98 ms
[2024-06-01 13:49:37] [INFO ] Flatten gal took : 75 ms
[2024-06-01 13:49:37] [INFO ] Input system was already deterministic with 1360 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 554/554 places, 1372/1372 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 550 transition count 1330
Reduce places removed 42 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 54 rules applied. Total rules applied 96 place count 508 transition count 1318
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 108 place count 496 transition count 1318
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 108 place count 496 transition count 1258
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 228 place count 436 transition count 1258
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 336 place count 382 transition count 1204
Applied a total of 336 rules in 72 ms. Remains 382 /554 variables (removed 172) and now considering 1204/1372 (removed 168) transitions.
Running 1200 sub problems to find dead transitions.
[2024-06-01 13:49:37] [INFO ] Flow matrix only has 1180 transitions (discarded 24 similar events)
// Phase 1: matrix 1180 rows 382 cols
[2024-06-01 13:49:37] [INFO ] Computed 46 invariants in 25 ms
[2024-06-01 13:49:37] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-06-01 13:49:50] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 2 ms to minimize.
[2024-06-01 13:49:50] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 1 ms to minimize.
[2024-06-01 13:49:50] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:49:50] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:49:50] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:49:51] [INFO ] Deduced a trap composed of 151 places in 278 ms of which 3 ms to minimize.
[2024-06-01 13:49:51] [INFO ] Deduced a trap composed of 173 places in 291 ms of which 3 ms to minimize.
[2024-06-01 13:49:51] [INFO ] Deduced a trap composed of 148 places in 273 ms of which 3 ms to minimize.
[2024-06-01 13:49:52] [INFO ] Deduced a trap composed of 165 places in 250 ms of which 3 ms to minimize.
[2024-06-01 13:49:52] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:49:59] [INFO ] Deduced a trap composed of 181 places in 205 ms of which 2 ms to minimize.
[2024-06-01 13:50:00] [INFO ] Deduced a trap composed of 121 places in 271 ms of which 3 ms to minimize.
[2024-06-01 13:50:00] [INFO ] Deduced a trap composed of 166 places in 289 ms of which 3 ms to minimize.
[2024-06-01 13:50:00] [INFO ] Deduced a trap composed of 121 places in 268 ms of which 3 ms to minimize.
[2024-06-01 13:50:00] [INFO ] Deduced a trap composed of 167 places in 243 ms of which 3 ms to minimize.
[2024-06-01 13:50:01] [INFO ] Deduced a trap composed of 172 places in 249 ms of which 3 ms to minimize.
[2024-06-01 13:50:01] [INFO ] Deduced a trap composed of 162 places in 269 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/1562 variables, and 59 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-06-01 13:50:04] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 2 ms to minimize.
[2024-06-01 13:50:12] [INFO ] Deduced a trap composed of 29 places in 193 ms of which 1 ms to minimize.
[2024-06-01 13:50:13] [INFO ] Deduced a trap composed of 131 places in 226 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
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 378/1562 variables, and 62 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 20/20 constraints]
After SMT, in 45771ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 45789ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 45866 ms. Remains : 382/554 places, 1204/1372 transitions.
[2024-06-01 13:50:23] [INFO ] Flatten gal took : 43 ms
[2024-06-01 13:50:23] [INFO ] Flatten gal took : 47 ms
[2024-06-01 13:50:23] [INFO ] Input system was already deterministic with 1204 transitions.
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
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 544 transition count 1366
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 544 transition count 1366
Applied a total of 16 rules in 16 ms. Remains 544 /554 variables (removed 10) and now considering 1366/1372 (removed 6) transitions.
Running 1362 sub problems to find dead transitions.
[2024-06-01 13:50:23] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
// Phase 1: matrix 1342 rows 544 cols
[2024-06-01 13:50:23] [INFO ] Computed 46 invariants in 17 ms
[2024-06-01 13:50:23] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
[2024-06-01 13:50:38] [INFO ] Deduced a trap composed of 74 places in 69 ms of which 1 ms to minimize.
[2024-06-01 13:50:38] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 2 ms to minimize.
[2024-06-01 13:50:38] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:50:38] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:50:39] [INFO ] Deduced a trap composed of 74 places in 69 ms of which 2 ms to minimize.
[2024-06-01 13:50:39] [INFO ] Deduced a trap composed of 299 places in 321 ms of which 4 ms to minimize.
[2024-06-01 13:50:40] [INFO ] Deduced a trap composed of 121 places in 300 ms of which 4 ms to minimize.
[2024-06-01 13:50:40] [INFO ] Deduced a trap composed of 164 places in 310 ms of which 7 ms to minimize.
[2024-06-01 13:50:40] [INFO ] Deduced a trap composed of 161 places in 323 ms of which 4 ms to minimize.
[2024-06-01 13:50:41] [INFO ] Deduced a trap composed of 313 places in 328 ms of which 4 ms to minimize.
[2024-06-01 13:50:42] [INFO ] Deduced a trap composed of 289 places in 365 ms of which 4 ms to minimize.
[2024-06-01 13:50:43] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:50:44] [INFO ] Deduced a trap composed of 143 places in 273 ms of which 3 ms to minimize.
[2024-06-01 13:50:47] [INFO ] Deduced a trap composed of 15 places in 351 ms of which 4 ms to minimize.
[2024-06-01 13:50:47] [INFO ] Deduced a trap composed of 312 places in 389 ms of which 4 ms to minimize.
[2024-06-01 13:50:48] [INFO ] Deduced a trap composed of 305 places in 340 ms of which 3 ms to minimize.
[2024-06-01 13:50:48] [INFO ] Deduced a trap composed of 315 places in 295 ms of which 3 ms to minimize.
[2024-06-01 13:50:48] [INFO ] Deduced a trap composed of 297 places in 326 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 540/1886 variables, and 60 constraints, problems are : Problem set: 0 solved, 1362 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/31 constraints, State Equation: 0/544 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1362/1362 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/540 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
[2024-06-01 13:50:51] [INFO ] Deduced a trap composed of 308 places in 320 ms of which 4 ms to minimize.
[2024-06-01 13:51:05] [INFO ] Deduced a trap composed of 284 places in 247 ms of which 3 ms to minimize.
[2024-06-01 13:51:06] [INFO ] Deduced a trap composed of 286 places in 322 ms of which 4 ms to minimize.
[2024-06-01 13:51:06] [INFO ] Deduced a trap composed of 264 places in 279 ms of which 3 ms to minimize.
[2024-06-01 13:51:07] [INFO ] Deduced a trap composed of 287 places in 312 ms of which 3 ms to minimize.
[2024-06-01 13:51:07] [INFO ] Deduced a trap composed of 274 places in 314 ms of which 4 ms to minimize.
[2024-06-01 13:51:08] [INFO ] Deduced a trap composed of 259 places in 292 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/1886 variables, and 67 constraints, problems are : Problem set: 0 solved, 1362 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/31 constraints, State Equation: 0/544 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1362 constraints, Known Traps: 25/25 constraints]
After SMT, in 45677ms problems are : Problem set: 0 solved, 1362 unsolved
Search for dead transitions found 0 dead transitions in 45695ms
Finished structural reductions in LTL mode , in 1 iterations and 45714 ms. Remains : 544/554 places, 1366/1372 transitions.
[2024-06-01 13:51:09] [INFO ] Flatten gal took : 47 ms
[2024-06-01 13:51:09] [INFO ] Flatten gal took : 53 ms
[2024-06-01 13:51:09] [INFO ] Input system was already deterministic with 1366 transitions.
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 9 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 13:51:09] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
// Phase 1: matrix 1348 rows 550 cols
[2024-06-01 13:51:09] [INFO ] Computed 46 invariants in 44 ms
[2024-06-01 13:51:09] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-06-01 13:51:24] [INFO ] Deduced a trap composed of 75 places in 104 ms of which 1 ms to minimize.
[2024-06-01 13:51:24] [INFO ] Deduced a trap composed of 75 places in 92 ms of which 2 ms to minimize.
[2024-06-01 13:51:24] [INFO ] Deduced a trap composed of 75 places in 80 ms of which 1 ms to minimize.
[2024-06-01 13:51:24] [INFO ] Deduced a trap composed of 75 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:51:24] [INFO ] Deduced a trap composed of 75 places in 60 ms of which 2 ms to minimize.
[2024-06-01 13:51:24] [INFO ] Deduced a trap composed of 313 places in 319 ms of which 4 ms to minimize.
[2024-06-01 13:51:25] [INFO ] Deduced a trap composed of 167 places in 314 ms of which 4 ms to minimize.
[2024-06-01 13:51:26] [INFO ] Deduced a trap composed of 39 places in 233 ms of which 2 ms to minimize.
[2024-06-01 13:51:27] [INFO ] Deduced a trap composed of 319 places in 392 ms of which 4 ms to minimize.
[2024-06-01 13:51:28] [INFO ] Deduced a trap composed of 320 places in 385 ms of which 4 ms to minimize.
[2024-06-01 13:51:28] [INFO ] Deduced a trap composed of 317 places in 317 ms of which 3 ms to minimize.
[2024-06-01 13:51:29] [INFO ] Deduced a trap composed of 323 places in 347 ms of which 5 ms to minimize.
[2024-06-01 13:51:29] [INFO ] Deduced a trap composed of 311 places in 343 ms of which 3 ms to minimize.
[2024-06-01 13:51:29] [INFO ] Deduced a trap composed of 322 places in 339 ms of which 4 ms to minimize.
[2024-06-01 13:51:30] [INFO ] Deduced a trap composed of 313 places in 317 ms of which 3 ms to minimize.
[2024-06-01 13:51:30] [INFO ] Deduced a trap composed of 307 places in 358 ms of which 3 ms to minimize.
[2024-06-01 13:51:30] [INFO ] Deduced a trap composed of 322 places in 389 ms of which 4 ms to minimize.
[2024-06-01 13:51:31] [INFO ] Deduced a trap composed of 311 places in 384 ms of which 4 ms to minimize.
[2024-06-01 13:51:31] [INFO ] Deduced a trap composed of 315 places in 374 ms of which 3 ms to minimize.
[2024-06-01 13:51:33] [INFO ] Deduced a trap composed of 292 places in 651 ms of which 19 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/546 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-06-01 13:51:33] [INFO ] Deduced a trap composed of 75 places in 77 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 10.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 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 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s261 1.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 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 546/1898 variables, and 63 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 11/13 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/550 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1368/1368 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/546 variables, 21/63 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-06-01 13:51:37] [INFO ] Deduced a trap composed of 266 places in 311 ms of which 4 ms to minimize.
[2024-06-01 13:51:38] [INFO ] Deduced a trap composed of 280 places in 397 ms of which 4 ms to minimize.
[2024-06-01 13:51:38] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 4 ms to minimize.
[2024-06-01 13:51:42] [INFO ] Deduced a trap composed of 322 places in 313 ms of which 4 ms to minimize.
[2024-06-01 13:51:53] [INFO ] Deduced a trap composed of 284 places in 318 ms of which 4 ms to minimize.
[2024-06-01 13:51:53] [INFO ] Deduced a trap composed of 272 places in 302 ms of which 4 ms to minimize.
[2024-06-01 13:51:53] [INFO ] Deduced a trap composed of 259 places in 299 ms of which 4 ms to minimize.
[2024-06-01 13:51:54] [INFO ] Deduced a trap composed of 306 places in 339 ms of which 4 ms to minimize.
SMT process timed out in 45280ms, After SMT, problems are : Problem set: 0 solved, 1368 unsolved
Search for dead transitions found 0 dead transitions in 45298ms
Finished structural reductions in LTL mode , in 1 iterations and 45312 ms. Remains : 550/554 places, 1372/1372 transitions.
[2024-06-01 13:51:54] [INFO ] Flatten gal took : 58 ms
[2024-06-01 13:51:55] [INFO ] Flatten gal took : 66 ms
[2024-06-01 13:51:55] [INFO ] Input system was already deterministic with 1372 transitions.
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
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 544 transition count 1366
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 544 transition count 1366
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 538 transition count 1360
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 538 transition count 1360
Applied a total of 28 rules in 26 ms. Remains 538 /554 variables (removed 16) and now considering 1360/1372 (removed 12) transitions.
Running 1356 sub problems to find dead transitions.
[2024-06-01 13:51:55] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
// Phase 1: matrix 1336 rows 538 cols
[2024-06-01 13:51:55] [INFO ] Computed 46 invariants in 45 ms
[2024-06-01 13:51:55] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 13:52:10] [INFO ] Deduced a trap composed of 73 places in 97 ms of which 2 ms to minimize.
[2024-06-01 13:52:10] [INFO ] Deduced a trap composed of 73 places in 117 ms of which 2 ms to minimize.
[2024-06-01 13:52:10] [INFO ] Deduced a trap composed of 73 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:52:10] [INFO ] Deduced a trap composed of 73 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:52:10] [INFO ] Deduced a trap composed of 73 places in 58 ms of which 0 ms to minimize.
[2024-06-01 13:52:11] [INFO ] Deduced a trap composed of 133 places in 327 ms of which 4 ms to minimize.
[2024-06-01 13:52:12] [INFO ] Deduced a trap composed of 309 places in 323 ms of which 4 ms to minimize.
[2024-06-01 13:52:13] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 1 ms to minimize.
[2024-06-01 13:52:18] [INFO ] Deduced a trap composed of 296 places in 314 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 534/1874 variables, and 51 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/538 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/534 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 13:52:28] [INFO ] Deduced a trap composed of 310 places in 308 ms of which 4 ms to minimize.
[2024-06-01 13:52:28] [INFO ] Deduced a trap composed of 274 places in 300 ms of which 4 ms to minimize.
[2024-06-01 13:52:28] [INFO ] Deduced a trap composed of 267 places in 332 ms of which 3 ms to minimize.
[2024-06-01 13:52:31] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 2 ms to minimize.
[2024-06-01 13:52:39] [INFO ] Deduced a trap composed of 282 places in 300 ms of which 4 ms to minimize.
[2024-06-01 13:52:39] [INFO ] Deduced a trap composed of 279 places in 300 ms of which 4 ms to minimize.
[2024-06-01 13:52:39] [INFO ] Deduced a trap composed of 297 places in 319 ms of which 4 ms to minimize.
[2024-06-01 13:52:40] [INFO ] Deduced a trap composed of 274 places in 275 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/1874 variables, and 59 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/538 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 17/17 constraints]
After SMT, in 45658ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 45679ms
Finished structural reductions in LTL mode , in 1 iterations and 45710 ms. Remains : 538/554 places, 1360/1372 transitions.
[2024-06-01 13:52:40] [INFO ] Flatten gal took : 69 ms
[2024-06-01 13:52:41] [INFO ] Flatten gal took : 72 ms
[2024-06-01 13:52:41] [INFO ] Input system was already deterministic with 1360 transitions.
[2024-06-01 13:52:41] [INFO ] Flatten gal took : 105 ms
[2024-06-01 13:52:41] [INFO ] Flatten gal took : 78 ms
[2024-06-01 13:52:41] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 13:52:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 554 places, 1372 transitions and 6996 arcs took 15 ms.
Total runtime 486709 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-COL-S04J04T06-CTLCardinality-2024-03
Could not compute solution for formula : PolyORBLF-COL-S04J04T06-CTLCardinality-2024-04
Could not compute solution for formula : PolyORBLF-COL-S04J04T06-CTLCardinality-2024-07
Could not compute solution for formula : PolyORBLF-COL-S04J04T06-CTLCardinality-2024-10
Could not compute solution for formula : PolyORBLF-COL-S04J04T06-CTLCardinality-2024-11
Could not compute solution for formula : PolyORBLF-COL-S04J04T06-CTLCardinality-2024-14
Could not compute solution for formula : PolyORBLF-COL-S04J04T06-CTLCardinality-2024-15

BK_STOP 1717249961721

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name PolyORBLF-COL-S04J04T06-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/1249/ctl_0_
ctl formula name PolyORBLF-COL-S04J04T06-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/1249/ctl_1_
ctl formula name PolyORBLF-COL-S04J04T06-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/1249/ctl_2_
ctl formula name PolyORBLF-COL-S04J04T06-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/1249/ctl_3_
ctl formula name PolyORBLF-COL-S04J04T06-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/1249/ctl_4_
ctl formula name PolyORBLF-COL-S04J04T06-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/1249/ctl_5_
ctl formula name PolyORBLF-COL-S04J04T06-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/1249/ctl_6_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBLF-COL-S04J04T06, examination is CTLCardinality"
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-171654446400121"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S04J04T06.tgz
mv PolyORBLF-COL-S04J04T06 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;