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

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717253513830

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:51:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 14:51:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:51:55] [INFO ] Load time of PNML (sax parser for PT used): 206 ms
[2024-06-01 14:51:55] [INFO ] Transformed 554 places.
[2024-06-01 14:51:55] [INFO ] Transformed 2998 transitions.
[2024-06-01 14:51:55] [INFO ] Parsed PT model containing 554 places and 2998 transitions and 20754 arcs in 389 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 56 ms.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
Support contains 340 out of 554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 554/554 places, 1372/1372 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 550 transition count 1372
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 68 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 14:51:56] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
// Phase 1: matrix 1342 rows 544 cols
[2024-06-01 14:51:56] [INFO ] Computed 46 invariants in 47 ms
[2024-06-01 14:51:56] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 26/42 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
[2024-06-01 14:52:12] [INFO ] Deduced a trap composed of 74 places in 131 ms of which 14 ms to minimize.
[2024-06-01 14:52:12] [INFO ] Deduced a trap composed of 75 places in 77 ms of which 1 ms to minimize.
[2024-06-01 14:52:12] [INFO ] Deduced a trap composed of 76 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:52:13] [INFO ] Deduced a trap composed of 74 places in 78 ms of which 1 ms to minimize.
[2024-06-01 14:52:13] [INFO ] Deduced a trap composed of 39 places in 407 ms of which 2 ms to minimize.
[2024-06-01 14:52:13] [INFO ] Deduced a trap composed of 74 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:52:14] [INFO ] Deduced a trap composed of 132 places in 272 ms of which 11 ms to minimize.
[2024-06-01 14:52:14] [INFO ] Deduced a trap composed of 230 places in 364 ms of which 4 ms to minimize.
[2024-06-01 14:52:14] [INFO ] Deduced a trap composed of 165 places in 239 ms of which 3 ms to minimize.
[2024-06-01 14:52:15] [INFO ] Deduced a trap composed of 336 places in 258 ms of which 3 ms to minimize.
[2024-06-01 14:52:15] [INFO ] Deduced a trap composed of 271 places in 260 ms of which 3 ms to minimize.
[2024-06-01 14:52:15] [INFO ] Deduced a trap composed of 74 places in 41 ms of which 0 ms to minimize.
[2024-06-01 14:52:15] [INFO ] Deduced a trap composed of 282 places in 223 ms of which 3 ms to minimize.
[2024-06-01 14:52:16] [INFO ] Deduced a trap composed of 268 places in 209 ms of which 3 ms to minimize.
[2024-06-01 14:52:16] [INFO ] Deduced a trap composed of 15 places in 197 ms of which 3 ms to minimize.
[2024-06-01 14:52:18] [INFO ] Deduced a trap composed of 264 places in 341 ms of which 4 ms to minimize.
[2024-06-01 14:52:18] [INFO ] Deduced a trap composed of 295 places in 336 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 59 constraints, problems are : Problem set: 0 solved, 1362 unsolved in 20089 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/544 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1362/1362 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 26/42 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/540 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
[2024-06-01 14:52:31] [INFO ] Deduced a trap composed of 322 places in 399 ms of which 4 ms to minimize.
[2024-06-01 14:52:32] [INFO ] Deduced a trap composed of 290 places in 344 ms of which 4 ms to minimize.
[2024-06-01 14:52:34] [INFO ] Deduced a trap composed of 298 places in 321 ms of which 3 ms to minimize.
[2024-06-01 14:52:34] [INFO ] Deduced a trap composed of 259 places in 300 ms of which 4 ms to minimize.
[2024-06-01 14:52:34] [INFO ] Deduced a trap composed of 281 places in 315 ms of which 4 ms to minimize.
[2024-06-01 14:52:35] [INFO ] Deduced a trap composed of 321 places in 304 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/1886 variables, and 65 constraints, problems are : Problem set: 0 solved, 1362 unsolved in 20055 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/544 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1362 constraints, Known Traps: 23/23 constraints]
After SMT, in 44674ms problems are : Problem set: 0 solved, 1362 unsolved
Search for dead transitions found 0 dead transitions in 44724ms
[2024-06-01 14:52:40] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
[2024-06-01 14:52:40] [INFO ] Invariant cache hit.
[2024-06-01 14:52:41] [INFO ] Implicit Places using invariants in 353 ms returned [89, 244, 274, 361, 383, 480]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 363 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 538/554 places, 1366/1372 transitions.
Applied a total of 0 rules in 17 ms. Remains 538 /538 variables (removed 0) and now considering 1366/1366 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45236 ms. Remains : 538/554 places, 1366/1372 transitions.
Support contains 340 out of 538 places after structural reductions.
[2024-06-01 14:52:41] [INFO ] Flatten gal took : 160 ms
[2024-06-01 14:52:41] [INFO ] Flatten gal took : 109 ms
[2024-06-01 14:52:41] [INFO ] Input system was already deterministic with 1366 transitions.
Support contains 335 out of 538 places (down from 340) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2117 ms. (18 steps per ms) remains 51/80 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 39 ms. (100 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 60 ms. (65 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4000 steps (8 resets) in 30 ms. (129 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4000 steps (8 resets) in 49 ms. (80 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 53 ms. (74 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 58 ms. (67 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4000 steps (8 resets) in 37 ms. (105 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 33 ms. (117 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 58 ms. (67 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 51/51 properties
[2024-06-01 14:52:43] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
// Phase 1: matrix 1342 rows 538 cols
[2024-06-01 14:52:43] [INFO ] Computed 40 invariants in 20 ms
[2024-06-01 14:52:43] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp72 is UNSAT
At refinement iteration 1 (OVERLAPS) 221/436 variables, 11/11 constraints. Problems are: Problem set: 25 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 0/11 constraints. Problems are: Problem set: 25 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 2/438 variables, 2/13 constraints. Problems are: Problem set: 25 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/438 variables, 0/13 constraints. Problems are: Problem set: 25 solved, 26 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp79 is UNSAT
After SMT solving in domain Real declared 537/1880 variables, and 39 constraints, problems are : Problem set: 51 solved, 0 unsolved in 937 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/538 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints]
After SMT, in 1051ms problems are : Problem set: 51 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 51 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBLF-PT-S04J04T06-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T06-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T06-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T06-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:52:44] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 14:52:44] [INFO ] Flatten gal took : 60 ms
[2024-06-01 14:52:44] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBLF-PT-S04J04T06-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T06-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:52:44] [INFO ] Flatten gal took : 56 ms
[2024-06-01 14:52:44] [INFO ] Input system was already deterministic with 1366 transitions.
Support contains 89 out of 538 places (down from 91) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 1366/1366 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 532 transition count 1360
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 532 transition count 1360
Applied a total of 12 rules in 29 ms. Remains 532 /538 variables (removed 6) and now considering 1360/1366 (removed 6) transitions.
Running 1356 sub problems to find dead transitions.
[2024-06-01 14:52:44] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
// Phase 1: matrix 1336 rows 532 cols
[2024-06-01 14:52:45] [INFO ] Computed 40 invariants in 22 ms
[2024-06-01 14:52:45] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 14:53:00] [INFO ] Deduced a trap composed of 39 places in 212 ms of which 2 ms to minimize.
[2024-06-01 14:53:00] [INFO ] Deduced a trap composed of 139 places in 253 ms of which 2 ms to minimize.
[2024-06-01 14:53:01] [INFO ] Deduced a trap composed of 304 places in 289 ms of which 2 ms to minimize.
[2024-06-01 14:53:01] [INFO ] Deduced a trap composed of 278 places in 239 ms of which 2 ms to minimize.
[2024-06-01 14:53:01] [INFO ] Deduced a trap composed of 258 places in 199 ms of which 3 ms to minimize.
[2024-06-01 14:53:02] [INFO ] Deduced a trap composed of 286 places in 215 ms of which 2 ms to minimize.
[2024-06-01 14:53:03] [INFO ] Deduced a trap composed of 299 places in 264 ms of which 3 ms to minimize.
[2024-06-01 14:53:03] [INFO ] Deduced a trap composed of 253 places in 273 ms of which 3 ms to minimize.
[2024-06-01 14:53:03] [INFO ] Deduced a trap composed of 41 places in 176 ms of which 2 ms to minimize.
[2024-06-01 14:53:03] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 2 ms to minimize.
[2024-06-01 14:53:03] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 2 ms to minimize.
[2024-06-01 14:53:06] [INFO ] Deduced a trap composed of 289 places in 248 ms of which 7 ms to minimize.
[2024-06-01 14:53:06] [INFO ] Deduced a trap composed of 348 places in 214 ms of which 3 ms to minimize.
[2024-06-01 14:53:07] [INFO ] Deduced a trap composed of 291 places in 223 ms of which 2 ms to minimize.
[2024-06-01 14:53:07] [INFO ] Deduced a trap composed of 42 places in 290 ms of which 3 ms to minimize.
[2024-06-01 14:53:08] [INFO ] Deduced a trap composed of 321 places in 211 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 43 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 12/25 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 14:53:16] [INFO ] Deduced a trap composed of 344 places in 336 ms of which 4 ms to minimize.
[2024-06-01 14:53:24] [INFO ] Deduced a trap composed of 5 places in 359 ms of which 4 ms to minimize.
[2024-06-01 14:53:25] [INFO ] Deduced a trap composed of 3 places in 297 ms of which 4 ms to minimize.
[2024-06-01 14:53:25] [INFO ] Deduced a trap composed of 5 places in 293 ms of which 3 ms to minimize.
[2024-06-01 14:53:25] [INFO ] Deduced a trap composed of 74 places in 245 ms of which 3 ms to minimize.
[2024-06-01 14:53:25] [INFO ] Deduced a trap composed of 28 places in 233 ms of which 3 ms to minimize.
[2024-06-01 14:53:26] [INFO ] Deduced a trap composed of 28 places in 232 ms of which 3 ms to minimize.
[2024-06-01 14:53:26] [INFO ] Deduced a trap composed of 303 places in 235 ms of which 3 ms to minimize.
[2024-06-01 14:53:26] [INFO ] Deduced a trap composed of 75 places in 281 ms of which 4 ms to minimize.
[2024-06-01 14:53:27] [INFO ] Deduced a trap composed of 74 places in 290 ms of which 4 ms to minimize.
[2024-06-01 14:53:27] [INFO ] Deduced a trap composed of 75 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:53:27] [INFO ] Deduced a trap composed of 317 places in 282 ms of which 3 ms to minimize.
[2024-06-01 14:53:27] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:53:28] [INFO ] Deduced a trap composed of 342 places in 314 ms of which 4 ms to minimize.
[2024-06-01 14:53:28] [INFO ] Deduced a trap composed of 314 places in 305 ms of which 3 ms to minimize.
[2024-06-01 14:53:28] [INFO ] Deduced a trap composed of 310 places in 263 ms of which 2 ms to minimize.
[2024-06-01 14:53:29] [INFO ] Deduced a trap composed of 337 places in 319 ms of which 4 ms to minimize.
SMT process timed out in 44210ms, After SMT, problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 44224ms
Finished structural reductions in LTL mode , in 1 iterations and 44257 ms. Remains : 532/538 places, 1360/1366 transitions.
[2024-06-01 14:53:29] [INFO ] Flatten gal took : 43 ms
[2024-06-01 14:53:29] [INFO ] Flatten gal took : 44 ms
[2024-06-01 14:53:29] [INFO ] Input system was already deterministic with 1360 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 538/538 places, 1366/1366 transitions.
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 538 transition count 1324
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 496 transition count 1324
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 84 place count 496 transition count 1294
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 144 place count 466 transition count 1294
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 276 place count 400 transition count 1228
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 278 place count 398 transition count 1226
Iterating global reduction 2 with 2 rules applied. Total rules applied 280 place count 398 transition count 1226
Applied a total of 280 rules in 189 ms. Remains 398 /538 variables (removed 140) and now considering 1226/1366 (removed 140) transitions.
Running 1222 sub problems to find dead transitions.
[2024-06-01 14:53:29] [INFO ] Flow matrix only has 1202 transitions (discarded 24 similar events)
// Phase 1: matrix 1202 rows 398 cols
[2024-06-01 14:53:29] [INFO ] Computed 40 invariants in 25 ms
[2024-06-01 14:53:29] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 14:53:41] [INFO ] Deduced a trap composed of 3 places in 162 ms of which 2 ms to minimize.
[2024-06-01 14:53:43] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 394/1600 variables, and 35 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/398 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 14:53:56] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2024-06-01 14:53:57] [INFO ] Deduced a trap composed of 51 places in 79 ms of which 2 ms to minimize.
[2024-06-01 14:53:57] [INFO ] Deduced a trap composed of 52 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:53:57] [INFO ] Deduced a trap composed of 53 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 14:54:10] [INFO ] Deduced a trap composed of 52 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:54:10] [INFO ] Deduced a trap composed of 52 places in 40 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/1600 variables, and 41 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/398 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1222 constraints, Known Traps: 8/8 constraints]
After SMT, in 44345ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 44355ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 44547 ms. Remains : 398/538 places, 1226/1366 transitions.
[2024-06-01 14:54:14] [INFO ] Flatten gal took : 57 ms
[2024-06-01 14:54:14] [INFO ] Flatten gal took : 50 ms
[2024-06-01 14:54:14] [INFO ] Input system was already deterministic with 1226 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 538/538 places, 1366/1366 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 538 transition count 1342
Reduce places removed 24 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 30 rules applied. Total rules applied 54 place count 514 transition count 1336
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 60 place count 508 transition count 1336
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 60 place count 508 transition count 1276
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 180 place count 448 transition count 1276
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 2 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 312 place count 382 transition count 1210
Applied a total of 312 rules in 93 ms. Remains 382 /538 variables (removed 156) and now considering 1210/1366 (removed 156) transitions.
Running 1206 sub problems to find dead transitions.
[2024-06-01 14:54:14] [INFO ] Flow matrix only has 1186 transitions (discarded 24 similar events)
// Phase 1: matrix 1186 rows 382 cols
[2024-06-01 14:54:14] [INFO ] Computed 40 invariants in 16 ms
[2024-06-01 14:54:14] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-06-01 14:54:24] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 1 ms to minimize.
[2024-06-01 14:54:24] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 1 ms to minimize.
[2024-06-01 14:54:24] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 5 ms to minimize.
[2024-06-01 14:54:25] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 1 ms to minimize.
[2024-06-01 14:54:25] [INFO ] Deduced a trap composed of 67 places in 115 ms of which 1 ms to minimize.
[2024-06-01 14:54:32] [INFO ] Deduced a trap composed of 132 places in 182 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-06-01 14:54:37] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/1568 variables, and 42 constraints, problems are : Problem set: 0 solved, 1206 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1206/1206 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 7/42 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
[2024-06-01 14:54:40] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 2 ms to minimize.
[2024-06-01 14:54:40] [INFO ] Deduced a trap composed of 49 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:54:40] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 0 ms to minimize.
[2024-06-01 14:54:40] [INFO ] Deduced a trap composed of 49 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:54:47] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:54:55] [INFO ] Deduced a trap composed of 115 places in 242 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/1568 variables, and 48 constraints, problems are : Problem set: 0 solved, 1206 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1206 constraints, Known Traps: 13/13 constraints]
After SMT, in 43222ms problems are : Problem set: 0 solved, 1206 unsolved
Search for dead transitions found 0 dead transitions in 43233ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 43331 ms. Remains : 382/538 places, 1210/1366 transitions.
[2024-06-01 14:54:57] [INFO ] Flatten gal took : 56 ms
[2024-06-01 14:54:57] [INFO ] Flatten gal took : 58 ms
[2024-06-01 14:54:57] [INFO ] Input system was already deterministic with 1210 transitions.
RANDOM walk for 454 steps (0 resets) in 7 ms. (56 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-PT-S04J04T06-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 1366/1366 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 532 transition count 1360
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 532 transition count 1360
Applied a total of 12 rules in 43 ms. Remains 532 /538 variables (removed 6) and now considering 1360/1366 (removed 6) transitions.
Running 1356 sub problems to find dead transitions.
[2024-06-01 14:54:57] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
// Phase 1: matrix 1336 rows 532 cols
[2024-06-01 14:54:57] [INFO ] Computed 40 invariants in 26 ms
[2024-06-01 14:54:57] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 14:55:12] [INFO ] Deduced a trap composed of 39 places in 196 ms of which 2 ms to minimize.
[2024-06-01 14:55:12] [INFO ] Deduced a trap composed of 139 places in 198 ms of which 3 ms to minimize.
[2024-06-01 14:55:12] [INFO ] Deduced a trap composed of 304 places in 206 ms of which 3 ms to minimize.
[2024-06-01 14:55:13] [INFO ] Deduced a trap composed of 278 places in 208 ms of which 3 ms to minimize.
[2024-06-01 14:55:13] [INFO ] Deduced a trap composed of 258 places in 207 ms of which 2 ms to minimize.
[2024-06-01 14:55:14] [INFO ] Deduced a trap composed of 286 places in 283 ms of which 3 ms to minimize.
[2024-06-01 14:55:14] [INFO ] Deduced a trap composed of 299 places in 308 ms of which 3 ms to minimize.
[2024-06-01 14:55:15] [INFO ] Deduced a trap composed of 253 places in 301 ms of which 3 ms to minimize.
[2024-06-01 14:55:15] [INFO ] Deduced a trap composed of 41 places in 191 ms of which 2 ms to minimize.
[2024-06-01 14:55:15] [INFO ] Deduced a trap composed of 82 places in 164 ms of which 1 ms to minimize.
[2024-06-01 14:55:15] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 2 ms to minimize.
[2024-06-01 14:55:17] [INFO ] Deduced a trap composed of 289 places in 238 ms of which 3 ms to minimize.
[2024-06-01 14:55:18] [INFO ] Deduced a trap composed of 348 places in 207 ms of which 3 ms to minimize.
[2024-06-01 14:55:18] [INFO ] Deduced a trap composed of 291 places in 170 ms of which 2 ms to minimize.
[2024-06-01 14:55:18] [INFO ] Deduced a trap composed of 42 places in 264 ms of which 4 ms to minimize.
[2024-06-01 14:55:20] [INFO ] Deduced a trap composed of 321 places in 312 ms of which 3 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 528/1868 variables, and 43 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 12/25 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 14:55:29] [INFO ] Deduced a trap composed of 344 places in 341 ms of which 4 ms to minimize.
[2024-06-01 14:55:37] [INFO ] Deduced a trap composed of 5 places in 360 ms of which 4 ms to minimize.
[2024-06-01 14:55:37] [INFO ] Deduced a trap composed of 3 places in 309 ms of which 3 ms to minimize.
[2024-06-01 14:55:38] [INFO ] Deduced a trap composed of 5 places in 302 ms of which 3 ms to minimize.
[2024-06-01 14:55:38] [INFO ] Deduced a trap composed of 74 places in 265 ms of which 2 ms to minimize.
[2024-06-01 14:55:38] [INFO ] Deduced a trap composed of 28 places in 227 ms of which 3 ms to minimize.
[2024-06-01 14:55:38] [INFO ] Deduced a trap composed of 28 places in 252 ms of which 3 ms to minimize.
[2024-06-01 14:55:39] [INFO ] Deduced a trap composed of 303 places in 232 ms of which 3 ms to minimize.
[2024-06-01 14:55:39] [INFO ] Deduced a trap composed of 75 places in 230 ms of which 3 ms to minimize.
[2024-06-01 14:55:39] [INFO ] Deduced a trap composed of 74 places in 223 ms of which 3 ms to minimize.
[2024-06-01 14:55:39] [INFO ] Deduced a trap composed of 75 places in 35 ms of which 0 ms to minimize.
[2024-06-01 14:55:39] [INFO ] Deduced a trap composed of 317 places in 231 ms of which 2 ms to minimize.
[2024-06-01 14:55:40] [INFO ] Deduced a trap composed of 74 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:55:41] [INFO ] Deduced a trap composed of 342 places in 363 ms of which 3 ms to minimize.
[2024-06-01 14:55:41] [INFO ] Deduced a trap composed of 314 places in 338 ms of which 4 ms to minimize.
[2024-06-01 14:55:41] [INFO ] Deduced a trap composed of 310 places in 302 ms of which 3 ms to minimize.
[2024-06-01 14:55:41] [INFO ] Deduced a trap composed of 337 places in 232 ms of which 3 ms to minimize.
SMT process timed out in 44155ms, After SMT, problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 44169ms
Finished structural reductions in LTL mode , in 1 iterations and 44228 ms. Remains : 532/538 places, 1360/1366 transitions.
[2024-06-01 14:55:42] [INFO ] Flatten gal took : 36 ms
[2024-06-01 14:55:42] [INFO ] Flatten gal took : 39 ms
[2024-06-01 14:55:42] [INFO ] Input system was already deterministic with 1360 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 538/538 places, 1366/1366 transitions.
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 538 transition count 1324
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 496 transition count 1324
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 84 place count 496 transition count 1264
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 204 place count 436 transition count 1264
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 2 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 334 place count 371 transition count 1199
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 336 place count 369 transition count 1197
Iterating global reduction 2 with 2 rules applied. Total rules applied 338 place count 369 transition count 1197
Applied a total of 338 rules in 66 ms. Remains 369 /538 variables (removed 169) and now considering 1197/1366 (removed 169) transitions.
Running 1193 sub problems to find dead transitions.
[2024-06-01 14:55:42] [INFO ] Flow matrix only has 1173 transitions (discarded 24 similar events)
// Phase 1: matrix 1173 rows 369 cols
[2024-06-01 14:55:42] [INFO ] Computed 40 invariants in 21 ms
[2024-06-01 14:55:42] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-06-01 14:55:52] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:55:52] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:55:52] [INFO ] Deduced a trap composed of 47 places in 37 ms of which 0 ms to minimize.
[2024-06-01 14:55:52] [INFO ] Deduced a trap composed of 47 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:55:52] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 0 ms to minimize.
[2024-06-01 14:55:52] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 1 ms to minimize.
[2024-06-01 14:55:53] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 1 ms to minimize.
[2024-06-01 14:55:53] [INFO ] Deduced a trap composed of 38 places in 163 ms of which 2 ms to minimize.
[2024-06-01 14:55:53] [INFO ] Deduced a trap composed of 128 places in 201 ms of which 2 ms to minimize.
[2024-06-01 14:55:54] [INFO ] Deduced a trap composed of 138 places in 202 ms of which 2 ms to minimize.
[2024-06-01 14:55:54] [INFO ] Deduced a trap composed of 47 places in 183 ms of which 2 ms to minimize.
[2024-06-01 14:55:54] [INFO ] Deduced a trap composed of 156 places in 232 ms of which 2 ms to minimize.
[2024-06-01 14:55:55] [INFO ] Deduced a trap composed of 160 places in 205 ms of which 3 ms to minimize.
[2024-06-01 14:55:55] [INFO ] Deduced a trap composed of 123 places in 206 ms of which 2 ms to minimize.
[2024-06-01 14:55:58] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 2 ms to minimize.
[2024-06-01 14:56:03] [INFO ] Deduced a trap composed of 163 places in 210 ms of which 2 ms to minimize.
[2024-06-01 14:56:03] [INFO ] Deduced a trap composed of 175 places in 272 ms of which 3 ms to minimize.
[2024-06-01 14:56:03] [INFO ] Deduced a trap composed of 137 places in 235 ms of which 2 ms to minimize.
[2024-06-01 14:56:04] [INFO ] Deduced a trap composed of 121 places in 211 ms of which 3 ms to minimize.
[2024-06-01 14:56:04] [INFO ] Deduced a trap composed of 212 places in 188 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-06-01 14:56:05] [INFO ] Deduced a trap composed of 56 places in 239 ms of which 3 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 365/1542 variables, and 57 constraints, problems are : Problem set: 0 solved, 1193 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/369 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1193/1193 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 21/57 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-06-01 14:56:11] [INFO ] Deduced a trap composed of 178 places in 294 ms of which 3 ms to minimize.
[2024-06-01 14:56:11] [INFO ] Deduced a trap composed of 156 places in 271 ms of which 3 ms to minimize.
[2024-06-01 14:56:15] [INFO ] Deduced a trap composed of 179 places in 244 ms of which 3 ms to minimize.
[2024-06-01 14:56:24] [INFO ] Deduced a trap composed of 140 places in 160 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/1542 variables, and 61 constraints, problems are : Problem set: 0 solved, 1193 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/369 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1193 constraints, Known Traps: 25/25 constraints]
After SMT, in 43810ms problems are : Problem set: 0 solved, 1193 unsolved
Search for dead transitions found 0 dead transitions in 43820ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 43888 ms. Remains : 369/538 places, 1197/1366 transitions.
[2024-06-01 14:56:26] [INFO ] Flatten gal took : 35 ms
[2024-06-01 14:56:26] [INFO ] Flatten gal took : 38 ms
[2024-06-01 14:56:26] [INFO ] Input system was already deterministic with 1197 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 538/538 places, 1366/1366 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 538 transition count 1325
Reduce places removed 41 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 42 rules applied. Total rules applied 83 place count 497 transition count 1324
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 84 place count 496 transition count 1324
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 496 transition count 1264
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 204 place count 436 transition count 1264
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 334 place count 371 transition count 1199
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 336 place count 369 transition count 1197
Iterating global reduction 3 with 2 rules applied. Total rules applied 338 place count 369 transition count 1197
Applied a total of 338 rules in 64 ms. Remains 369 /538 variables (removed 169) and now considering 1197/1366 (removed 169) transitions.
Running 1193 sub problems to find dead transitions.
[2024-06-01 14:56:26] [INFO ] Flow matrix only has 1173 transitions (discarded 24 similar events)
// Phase 1: matrix 1173 rows 369 cols
[2024-06-01 14:56:26] [INFO ] Computed 40 invariants in 37 ms
[2024-06-01 14:56:26] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-06-01 14:56:36] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 2 ms to minimize.
[2024-06-01 14:56:36] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:56:36] [INFO ] Deduced a trap composed of 47 places in 31 ms of which 1 ms to minimize.
[2024-06-01 14:56:36] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:56:36] [INFO ] Deduced a trap composed of 47 places in 34 ms of which 1 ms to minimize.
[2024-06-01 14:56:36] [INFO ] Deduced a trap composed of 39 places in 169 ms of which 2 ms to minimize.
[2024-06-01 14:56:36] [INFO ] Deduced a trap composed of 47 places in 28 ms of which 0 ms to minimize.
[2024-06-01 14:56:36] [INFO ] Deduced a trap composed of 149 places in 162 ms of which 3 ms to minimize.
[2024-06-01 14:56:37] [INFO ] Deduced a trap composed of 140 places in 156 ms of which 1 ms to minimize.
[2024-06-01 14:56:37] [INFO ] Deduced a trap composed of 143 places in 161 ms of which 2 ms to minimize.
[2024-06-01 14:56:37] [INFO ] Deduced a trap composed of 146 places in 161 ms of which 2 ms to minimize.
[2024-06-01 14:56:37] [INFO ] Deduced a trap composed of 45 places in 141 ms of which 2 ms to minimize.
[2024-06-01 14:56:38] [INFO ] Deduced a trap composed of 15 places in 188 ms of which 2 ms to minimize.
[2024-06-01 14:56:38] [INFO ] Deduced a trap composed of 60 places in 245 ms of which 2 ms to minimize.
[2024-06-01 14:56:39] [INFO ] Deduced a trap composed of 121 places in 178 ms of which 2 ms to minimize.
[2024-06-01 14:56:47] [INFO ] Deduced a trap composed of 148 places in 247 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-06-01 14:56:49] [INFO ] Deduced a trap composed of 152 places in 243 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 365/1542 variables, and 53 constraints, problems are : Problem set: 0 solved, 1193 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/369 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1193/1193 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-06-01 14:56:56] [INFO ] Deduced a trap composed of 198 places in 255 ms of which 3 ms to minimize.
[2024-06-01 14:56:56] [INFO ] Deduced a trap composed of 199 places in 228 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/1542 variables, and 55 constraints, problems are : Problem set: 0 solved, 1193 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/369 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1193 constraints, Known Traps: 19/19 constraints]
After SMT, in 43718ms problems are : Problem set: 0 solved, 1193 unsolved
Search for dead transitions found 0 dead transitions in 43727ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 43793 ms. Remains : 369/538 places, 1197/1366 transitions.
[2024-06-01 14:57:10] [INFO ] Flatten gal took : 62 ms
[2024-06-01 14:57:10] [INFO ] Flatten gal took : 55 ms
[2024-06-01 14:57:10] [INFO ] Input system was already deterministic with 1197 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 538/538 places, 1366/1366 transitions.
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 538 transition count 1324
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 496 transition count 1324
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 59 Pre rules applied. Total rules applied 84 place count 496 transition count 1265
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 202 place count 437 transition count 1265
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 2 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 334 place count 371 transition count 1199
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 336 place count 369 transition count 1197
Iterating global reduction 2 with 2 rules applied. Total rules applied 338 place count 369 transition count 1197
Applied a total of 338 rules in 77 ms. Remains 369 /538 variables (removed 169) and now considering 1197/1366 (removed 169) transitions.
Running 1193 sub problems to find dead transitions.
[2024-06-01 14:57:10] [INFO ] Flow matrix only has 1173 transitions (discarded 24 similar events)
// Phase 1: matrix 1173 rows 369 cols
[2024-06-01 14:57:10] [INFO ] Computed 40 invariants in 17 ms
[2024-06-01 14:57:10] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-06-01 14:57:21] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 1 ms to minimize.
[2024-06-01 14:57:21] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 1 ms to minimize.
[2024-06-01 14:57:21] [INFO ] Deduced a trap composed of 28 places in 188 ms of which 2 ms to minimize.
[2024-06-01 14:57:21] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 2 ms to minimize.
[2024-06-01 14:57:21] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 1 ms to minimize.
[2024-06-01 14:57:21] [INFO ] Deduced a trap composed of 55 places in 120 ms of which 1 ms to minimize.
[2024-06-01 14:57:22] [INFO ] Deduced a trap composed of 67 places in 103 ms of which 1 ms to minimize.
[2024-06-01 14:57:23] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 1 ms to minimize.
[2024-06-01 14:57:29] [INFO ] Deduced a trap composed of 121 places in 206 ms of which 2 ms to minimize.
[2024-06-01 14:57:31] [INFO ] Deduced a trap composed of 108 places in 169 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 1193 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 Real declared 365/1542 variables, and 45 constraints, problems are : Problem set: 0 solved, 1193 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 19/24 constraints, State Equation: 0/369 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1193/1193 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-06-01 14:57:35] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:57:35] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:57:35] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 0 ms to minimize.
[2024-06-01 14:57:36] [INFO ] Deduced a trap composed of 48 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:57:36] [INFO ] Deduced a trap composed of 47 places in 32 ms of which 1 ms to minimize.
[2024-06-01 14:57:36] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/365 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 1193 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 365/1542 variables, and 51 constraints, problems are : Problem set: 0 solved, 1193 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 19/24 constraints, State Equation: 0/369 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1193 constraints, Known Traps: 16/16 constraints]
After SMT, in 43685ms problems are : Problem set: 0 solved, 1193 unsolved
Search for dead transitions found 0 dead transitions in 43697ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 43777 ms. Remains : 369/538 places, 1197/1366 transitions.
[2024-06-01 14:57:54] [INFO ] Flatten gal took : 79 ms
[2024-06-01 14:57:54] [INFO ] Flatten gal took : 61 ms
[2024-06-01 14:57:54] [INFO ] Input system was already deterministic with 1197 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 538/538 places, 1366/1366 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 538 transition count 1325
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 82 place count 497 transition count 1325
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 59 Pre rules applied. Total rules applied 82 place count 497 transition count 1266
Deduced a syphon composed of 59 places in 2 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 200 place count 438 transition count 1266
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 326 place count 375 transition count 1203
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 327 place count 374 transition count 1202
Iterating global reduction 2 with 1 rules applied. Total rules applied 328 place count 374 transition count 1202
Applied a total of 328 rules in 78 ms. Remains 374 /538 variables (removed 164) and now considering 1202/1366 (removed 164) transitions.
Running 1198 sub problems to find dead transitions.
[2024-06-01 14:57:54] [INFO ] Flow matrix only has 1178 transitions (discarded 24 similar events)
// Phase 1: matrix 1178 rows 374 cols
[2024-06-01 14:57:54] [INFO ] Computed 40 invariants in 36 ms
[2024-06-01 14:57:54] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-06-01 14:58:06] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:58:06] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 2 ms to minimize.
[2024-06-01 14:58:06] [INFO ] Deduced a trap composed of 49 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:58:06] [INFO ] Deduced a trap composed of 47 places in 34 ms of which 1 ms to minimize.
[2024-06-01 14:58:06] [INFO ] Deduced a trap composed of 47 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:58:06] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:58:06] [INFO ] Deduced a trap composed of 71 places in 130 ms of which 1 ms to minimize.
[2024-06-01 14:58:07] [INFO ] Deduced a trap composed of 55 places in 238 ms of which 3 ms to minimize.
[2024-06-01 14:58:07] [INFO ] Deduced a trap composed of 82 places in 194 ms of which 2 ms to minimize.
[2024-06-01 14:58:07] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 2 ms to minimize.
[2024-06-01 14:58:08] [INFO ] Deduced a trap composed of 123 places in 206 ms of which 2 ms to minimize.
[2024-06-01 14:58:10] [INFO ] Deduced a trap composed of 120 places in 174 ms of which 2 ms to minimize.
[2024-06-01 14:58:15] [INFO ] Deduced a trap composed of 167 places in 226 ms of which 2 ms to minimize.
[2024-06-01 14:58:15] [INFO ] Deduced a trap composed of 157 places in 191 ms of which 2 ms to minimize.
[2024-06-01 14:58:16] [INFO ] Deduced a trap composed of 182 places in 195 ms of which 2 ms to minimize.
[2024-06-01 14:58:16] [INFO ] Deduced a trap composed of 176 places in 171 ms of which 2 ms to minimize.
[2024-06-01 14:58:16] [INFO ] Deduced a trap composed of 182 places in 235 ms of which 2 ms to minimize.
[2024-06-01 14:58:17] [INFO ] Deduced a trap composed of 178 places in 190 ms of which 2 ms to minimize.
[2024-06-01 14:58:17] [INFO ] Deduced a trap composed of 143 places in 183 ms of which 2 ms to minimize.
[2024-06-01 14:58:17] [INFO ] Deduced a trap composed of 175 places in 245 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 370/1552 variables, and 56 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/25 constraints, State Equation: 0/374 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1198/1198 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-06-01 14:58:23] [INFO ] Deduced a trap composed of 181 places in 316 ms of which 2 ms to minimize.
[2024-06-01 14:58:23] [INFO ] Deduced a trap composed of 186 places in 265 ms of which 2 ms to minimize.
[2024-06-01 14:58:23] [INFO ] Deduced a trap composed of 198 places in 268 ms of which 13 ms to minimize.
[2024-06-01 14:58:24] [INFO ] Deduced a trap composed of 178 places in 225 ms of which 3 ms to minimize.
[2024-06-01 14:58:24] [INFO ] Deduced a trap composed of 212 places in 262 ms of which 2 ms to minimize.
[2024-06-01 14:58:24] [INFO ] Deduced a trap composed of 178 places in 196 ms of which 2 ms to minimize.
[2024-06-01 14:58:24] [INFO ] Deduced a trap composed of 207 places in 187 ms of which 2 ms to minimize.
[2024-06-01 14:58:24] [INFO ] Deduced a trap composed of 179 places in 183 ms of which 2 ms to minimize.
[2024-06-01 14:58:25] [INFO ] Deduced a trap composed of 186 places in 187 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/1552 variables, and 65 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/25 constraints, State Equation: 0/374 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1198 constraints, Known Traps: 29/29 constraints]
After SMT, in 44101ms problems are : Problem set: 0 solved, 1198 unsolved
Search for dead transitions found 0 dead transitions in 44112ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 44193 ms. Remains : 374/538 places, 1202/1366 transitions.
[2024-06-01 14:58:38] [INFO ] Flatten gal took : 35 ms
[2024-06-01 14:58:38] [INFO ] Flatten gal took : 38 ms
[2024-06-01 14:58:38] [INFO ] Input system was already deterministic with 1202 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 538/538 places, 1366/1366 transitions.
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 538 transition count 1324
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 496 transition count 1324
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 84 place count 496 transition count 1264
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 204 place count 436 transition count 1264
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 334 place count 371 transition count 1199
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 336 place count 369 transition count 1197
Iterating global reduction 2 with 2 rules applied. Total rules applied 338 place count 369 transition count 1197
Applied a total of 338 rules in 66 ms. Remains 369 /538 variables (removed 169) and now considering 1197/1366 (removed 169) transitions.
Running 1193 sub problems to find dead transitions.
[2024-06-01 14:58:38] [INFO ] Flow matrix only has 1173 transitions (discarded 24 similar events)
// Phase 1: matrix 1173 rows 369 cols
[2024-06-01 14:58:38] [INFO ] Computed 40 invariants in 25 ms
[2024-06-01 14:58:38] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-06-01 14:58:49] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:58:49] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:58:49] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:58:49] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:58:49] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 1 ms to minimize.
[2024-06-01 14:58:49] [INFO ] Deduced a trap composed of 47 places in 31 ms of which 0 ms to minimize.
[2024-06-01 14:58:49] [INFO ] Deduced a trap composed of 26 places in 199 ms of which 2 ms to minimize.
[2024-06-01 14:58:49] [INFO ] Deduced a trap composed of 61 places in 167 ms of which 2 ms to minimize.
[2024-06-01 14:58:50] [INFO ] Deduced a trap composed of 27 places in 181 ms of which 2 ms to minimize.
[2024-06-01 14:58:50] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 2 ms to minimize.
[2024-06-01 14:58:51] [INFO ] Deduced a trap composed of 139 places in 227 ms of which 2 ms to minimize.
[2024-06-01 14:58:51] [INFO ] Deduced a trap composed of 120 places in 251 ms of which 3 ms to minimize.
[2024-06-01 14:58:54] [INFO ] Deduced a trap composed of 149 places in 258 ms of which 3 ms to minimize.
[2024-06-01 14:58:58] [INFO ] Deduced a trap composed of 203 places in 236 ms of which 3 ms to minimize.
[2024-06-01 14:58:58] [INFO ] Deduced a trap composed of 179 places in 167 ms of which 2 ms to minimize.
[2024-06-01 14:58:59] [INFO ] Deduced a trap composed of 194 places in 235 ms of which 2 ms to minimize.
[2024-06-01 14:59:00] [INFO ] Deduced a trap composed of 137 places in 243 ms of which 3 ms to minimize.
[2024-06-01 14:59:00] [INFO ] Deduced a trap composed of 189 places in 238 ms of which 2 ms to minimize.
[2024-06-01 14:59:00] [INFO ] Deduced a trap composed of 173 places in 236 ms of which 2 ms to minimize.
[2024-06-01 14:59:01] [INFO ] Deduced a trap composed of 182 places in 200 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 365/1542 variables, and 56 constraints, problems are : Problem set: 0 solved, 1193 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/369 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1193/1193 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-06-01 14:59:10] [INFO ] Deduced a trap composed of 178 places in 279 ms of which 3 ms to minimize.
[2024-06-01 14:59:11] [INFO ] Deduced a trap composed of 172 places in 265 ms of which 2 ms to minimize.
[2024-06-01 14:59:11] [INFO ] Deduced a trap composed of 188 places in 228 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 9)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 2)
(s9 1)
(s10 0)
(s11 0)
(s12 1)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 1)
(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)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 1)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 1)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 8)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 1)
(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 1)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 1)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 1)
(s142 0)
(s143 0)
(s144 1)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s173 0)
(s174 0)
(s175 0)
(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 1)
(s218 0)
(s219 0)
(s220 1)
(s221 0)
(s222 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 1)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 1)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 9)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 1)
(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)
(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 1)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(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 1)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/1542 variables, and 59 constraints, problems are : Problem set: 0 solved, 1193 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/369 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1193 constraints, Known Traps: 23/23 constraints]
After SMT, in 44003ms problems are : Problem set: 0 solved, 1193 unsolved
Search for dead transitions found 0 dead transitions in 44012ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 44081 ms. Remains : 369/538 places, 1197/1366 transitions.
[2024-06-01 14:59:22] [INFO ] Flatten gal took : 41 ms
[2024-06-01 14:59:22] [INFO ] Flatten gal took : 40 ms
[2024-06-01 14:59:22] [INFO ] Input system was already deterministic with 1197 transitions.
RANDOM walk for 10555 steps (2 resets) in 115 ms. (90 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-PT-S04J04T06-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 538/538 places, 1366/1366 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 538 transition count 1326
Reduce places removed 40 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 41 rules applied. Total rules applied 81 place count 498 transition count 1325
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 497 transition count 1325
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 82 place count 497 transition count 1265
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 202 place count 437 transition count 1265
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 332 place count 372 transition count 1200
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 334 place count 370 transition count 1198
Iterating global reduction 3 with 2 rules applied. Total rules applied 336 place count 370 transition count 1198
Applied a total of 336 rules in 111 ms. Remains 370 /538 variables (removed 168) and now considering 1198/1366 (removed 168) transitions.
Running 1194 sub problems to find dead transitions.
[2024-06-01 14:59:23] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
// Phase 1: matrix 1174 rows 370 cols
[2024-06-01 14:59:23] [INFO ] Computed 40 invariants in 30 ms
[2024-06-01 14:59:23] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-06-01 14:59:33] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:59:33] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:59:39] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/1544 variables, and 34 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1194/1194 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-06-01 14:59:48] [INFO ] Deduced a trap composed of 47 places in 181 ms of which 1 ms to minimize.
[2024-06-01 14:59:49] [INFO ] Deduced a trap composed of 27 places in 212 ms of which 2 ms to minimize.
[2024-06-01 14:59:49] [INFO ] Deduced a trap composed of 49 places in 33 ms of which 0 ms to minimize.
[2024-06-01 14:59:49] [INFO ] Deduced a trap composed of 46 places in 31 ms of which 1 ms to minimize.
[2024-06-01 14:59:53] [INFO ] Deduced a trap composed of 47 places in 235 ms of which 2 ms to minimize.
[2024-06-01 14:59:53] [INFO ] Deduced a trap composed of 119 places in 154 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 6/40 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-06-01 14:59:58] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-06-01 15:00:05] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/1544 variables, and 42 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1194 constraints, Known Traps: 11/11 constraints]
After SMT, in 43929ms problems are : Problem set: 0 solved, 1194 unsolved
Search for dead transitions found 0 dead transitions in 43940ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 44055 ms. Remains : 370/538 places, 1198/1366 transitions.
[2024-06-01 15:00:07] [INFO ] Flatten gal took : 49 ms
[2024-06-01 15:00:07] [INFO ] Flatten gal took : 54 ms
[2024-06-01 15:00:07] [INFO ] Input system was already deterministic with 1198 transitions.
[2024-06-01 15:00:07] [INFO ] Flatten gal took : 62 ms
[2024-06-01 15:00:07] [INFO ] Flatten gal took : 57 ms
[2024-06-01 15:00:07] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 15:00:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 538 places, 1366 transitions and 6944 arcs took 17 ms.
Total runtime 492197 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : PolyORBLF-PT-S04J04T06-CTLCardinality-2024-03
Could not compute solution for formula : PolyORBLF-PT-S04J04T06-CTLCardinality-2024-04
Could not compute solution for formula : PolyORBLF-PT-S04J04T06-CTLCardinality-2024-07
Could not compute solution for formula : PolyORBLF-PT-S04J04T06-CTLCardinality-2024-08
Could not compute solution for formula : PolyORBLF-PT-S04J04T06-CTLCardinality-2024-09
Could not compute solution for formula : PolyORBLF-PT-S04J04T06-CTLCardinality-2024-10
Could not compute solution for formula : PolyORBLF-PT-S04J04T06-CTLCardinality-2024-11
Could not compute solution for formula : PolyORBLF-PT-S04J04T06-CTLCardinality-2024-14

BK_STOP 1717254007771

--------------------
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-PT-S04J04T06-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/1378/ctl_0_
ctl formula name PolyORBLF-PT-S04J04T06-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/1378/ctl_1_
ctl formula name PolyORBLF-PT-S04J04T06-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/1378/ctl_2_
ctl formula name PolyORBLF-PT-S04J04T06-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/1378/ctl_3_
ctl formula name PolyORBLF-PT-S04J04T06-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/1378/ctl_4_
ctl formula name PolyORBLF-PT-S04J04T06-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/1378/ctl_5_
ctl formula name PolyORBLF-PT-S04J04T06-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/1378/ctl_6_
ctl formula name PolyORBLF-PT-S04J04T06-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/1378/ctl_7_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S04J04T06"
export BK_EXAMINATION="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-PT-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-171654446700265"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S04J04T06.tgz
mv PolyORBLF-PT-S04J04T06 execution
cd execution
if [ "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 ;