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.r289-tajo-171654445500233.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 greatspnxred
Input is PolyORBLF-PT-S02J04T10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445500233
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 25K Apr 11 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 11 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 46K Apr 11 16:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 243K Apr 11 16:46 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 9.5K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 58K Apr 11 16:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 293K Apr 11 16:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 93K Apr 11 16:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 478K Apr 11 16:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K 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 906K 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-S02J04T10-CTLCardinality-2024-00
FORMULA_NAME PolyORBLF-PT-S02J04T10-CTLCardinality-2024-01
FORMULA_NAME PolyORBLF-PT-S02J04T10-CTLCardinality-2024-02
FORMULA_NAME PolyORBLF-PT-S02J04T10-CTLCardinality-2024-03
FORMULA_NAME PolyORBLF-PT-S02J04T10-CTLCardinality-2024-04
FORMULA_NAME PolyORBLF-PT-S02J04T10-CTLCardinality-2024-05
FORMULA_NAME PolyORBLF-PT-S02J04T10-CTLCardinality-2024-06
FORMULA_NAME PolyORBLF-PT-S02J04T10-CTLCardinality-2024-07
FORMULA_NAME PolyORBLF-PT-S02J04T10-CTLCardinality-2024-08
FORMULA_NAME PolyORBLF-PT-S02J04T10-CTLCardinality-2024-09
FORMULA_NAME PolyORBLF-PT-S02J04T10-CTLCardinality-2024-10
FORMULA_NAME PolyORBLF-PT-S02J04T10-CTLCardinality-2024-11
FORMULA_NAME PolyORBLF-PT-S02J04T10-CTLCardinality-2024-12
FORMULA_NAME PolyORBLF-PT-S02J04T10-CTLCardinality-2024-13
FORMULA_NAME PolyORBLF-PT-S02J04T10-CTLCardinality-2024-14
FORMULA_NAME PolyORBLF-PT-S02J04T10-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716859940205

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J04T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 01:32:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 01:32:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 01:32:21] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2024-05-28 01:32:21] [INFO ] Transformed 752 places.
[2024-05-28 01:32:21] [INFO ] Transformed 1572 transitions.
[2024-05-28 01:32:21] [INFO ] Parsed PT model containing 752 places and 1572 transitions and 7262 arcs in 336 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 22 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Support contains 550 out of 752 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 745 transition count 1405
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 745 transition count 1405
Applied a total of 14 rules in 71 ms. Remains 745 /752 variables (removed 7) and now considering 1405/1412 (removed 7) transitions.
Running 1403 sub problems to find dead transitions.
[2024-05-28 01:32:22] [INFO ] Flow matrix only has 1385 transitions (discarded 20 similar events)
// Phase 1: matrix 1385 rows 745 cols
[2024-05-28 01:32:22] [INFO ] Computed 54 invariants in 80 ms
[2024-05-28 01:32:22] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1403 unsolved
[2024-05-28 01:32:39] [INFO ] Deduced a trap composed of 65 places in 173 ms of which 19 ms to minimize.
[2024-05-28 01:32:39] [INFO ] Deduced a trap composed of 64 places in 100 ms of which 2 ms to minimize.
[2024-05-28 01:32:39] [INFO ] Deduced a trap composed of 66 places in 65 ms of which 1 ms to minimize.
[2024-05-28 01:32:40] [INFO ] Deduced a trap composed of 64 places in 116 ms of which 9 ms to minimize.
[2024-05-28 01:32:40] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-05-28 01:32:40] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 1 ms to minimize.
[2024-05-28 01:32:40] [INFO ] Deduced a trap composed of 67 places in 58 ms of which 1 ms to minimize.
[2024-05-28 01:32:40] [INFO ] Deduced a trap composed of 66 places in 56 ms of which 2 ms to minimize.
[2024-05-28 01:32:40] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 2 ms to minimize.
[2024-05-28 01:32:40] [INFO ] Deduced a trap composed of 397 places in 326 ms of which 5 ms to minimize.
[2024-05-28 01:32:41] [INFO ] Deduced a trap composed of 379 places in 338 ms of which 5 ms to minimize.
[2024-05-28 01:32:41] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 2 ms to minimize.
[2024-05-28 01:32:42] [INFO ] Deduced a trap composed of 524 places in 415 ms of which 5 ms to minimize.
[2024-05-28 01:32:42] [INFO ] Deduced a trap composed of 504 places in 391 ms of which 5 ms to minimize.
[2024-05-28 01:32:43] [INFO ] Deduced a trap composed of 497 places in 333 ms of which 5 ms to minimize.
[2024-05-28 01:32:43] [INFO ] Deduced a trap composed of 478 places in 324 ms of which 4 ms to minimize.
[2024-05-28 01:32:43] [INFO ] Deduced a trap composed of 506 places in 359 ms of which 4 ms to minimize.
[2024-05-28 01:32:44] [INFO ] Deduced a trap composed of 492 places in 322 ms of which 4 ms to minimize.
[2024-05-28 01:32:44] [INFO ] Deduced a trap composed of 298 places in 332 ms of which 4 ms to minimize.
SMT process timed out in 22360ms, After SMT, problems are : Problem set: 0 solved, 1403 unsolved
Search for dead transitions found 0 dead transitions in 22409ms
[2024-05-28 01:32:44] [INFO ] Flow matrix only has 1385 transitions (discarded 20 similar events)
[2024-05-28 01:32:44] [INFO ] Invariant cache hit.
[2024-05-28 01:32:44] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-05-28 01:32:44] [INFO ] Flow matrix only has 1385 transitions (discarded 20 similar events)
[2024-05-28 01:32:44] [INFO ] Invariant cache hit.
[2024-05-28 01:32:46] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 01:32:50] [INFO ] Implicit Places using invariants and state equation in 5990 ms returned []
Implicit Place search using SMT with State Equation took 6309 ms to find 0 implicit places.
Running 1403 sub problems to find dead transitions.
[2024-05-28 01:32:50] [INFO ] Flow matrix only has 1385 transitions (discarded 20 similar events)
[2024-05-28 01:32:50] [INFO ] Invariant cache hit.
[2024-05-28 01:32:51] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1403 unsolved
[2024-05-28 01:33:07] [INFO ] Deduced a trap composed of 64 places in 200 ms of which 3 ms to minimize.
[2024-05-28 01:33:07] [INFO ] Deduced a trap composed of 66 places in 154 ms of which 3 ms to minimize.
[2024-05-28 01:33:07] [INFO ] Deduced a trap composed of 64 places in 144 ms of which 5 ms to minimize.
[2024-05-28 01:33:08] [INFO ] Deduced a trap composed of 64 places in 110 ms of which 2 ms to minimize.
[2024-05-28 01:33:08] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 2 ms to minimize.
[2024-05-28 01:33:08] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 1 ms to minimize.
[2024-05-28 01:33:08] [INFO ] Deduced a trap composed of 67 places in 77 ms of which 1 ms to minimize.
[2024-05-28 01:33:08] [INFO ] Deduced a trap composed of 66 places in 60 ms of which 2 ms to minimize.
[2024-05-28 01:33:08] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 1 ms to minimize.
[2024-05-28 01:33:09] [INFO ] Deduced a trap composed of 386 places in 392 ms of which 5 ms to minimize.
[2024-05-28 01:33:09] [INFO ] Deduced a trap composed of 457 places in 423 ms of which 5 ms to minimize.
[2024-05-28 01:33:09] [INFO ] Deduced a trap composed of 391 places in 414 ms of which 5 ms to minimize.
[2024-05-28 01:33:10] [INFO ] Deduced a trap composed of 396 places in 474 ms of which 5 ms to minimize.
[2024-05-28 01:33:10] [INFO ] Deduced a trap composed of 64 places in 385 ms of which 5 ms to minimize.
[2024-05-28 01:33:12] [INFO ] Deduced a trap composed of 399 places in 428 ms of which 7 ms to minimize.
[2024-05-28 01:33:12] [INFO ] Deduced a trap composed of 399 places in 450 ms of which 7 ms to minimize.
[2024-05-28 01:33:13] [INFO ] Deduced a trap composed of 405 places in 588 ms of which 19 ms to minimize.
[2024-05-28 01:33:14] [INFO ] Deduced a trap composed of 263 places in 451 ms of which 6 ms to minimize.
[2024-05-28 01:33:14] [INFO ] Deduced a trap composed of 237 places in 605 ms of which 19 ms to minimize.
[2024-05-28 01:33:15] [INFO ] Deduced a trap composed of 229 places in 468 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/741 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1403 unsolved
[2024-05-28 01:33:19] [INFO ] Deduced a trap composed of 417 places in 473 ms of which 5 ms to minimize.
[2024-05-28 01:33:19] [INFO ] Deduced a trap composed of 403 places in 335 ms of which 4 ms to minimize.
[2024-05-28 01:33:20] [INFO ] Deduced a trap composed of 403 places in 342 ms of which 4 ms to minimize.
[2024-05-28 01:33:20] [INFO ] Deduced a trap composed of 430 places in 337 ms of which 4 ms to minimize.
[2024-05-28 01:33:20] [INFO ] Deduced a trap composed of 482 places in 337 ms of which 4 ms to minimize.
[2024-05-28 01:33:21] [INFO ] Deduced a trap composed of 433 places in 322 ms of which 4 ms to minimize.
[2024-05-28 01:33:21] [INFO ] Deduced a trap composed of 388 places in 385 ms of which 4 ms to minimize.
[2024-05-28 01:33:22] [INFO ] Deduced a trap composed of 46 places in 339 ms of which 5 ms to minimize.
[2024-05-28 01:33:22] [INFO ] Deduced a trap composed of 75 places in 290 ms of which 5 ms to minimize.
[2024-05-28 01:33:23] [INFO ] Deduced a trap composed of 214 places in 409 ms of which 5 ms to minimize.
SMT process timed out in 32749ms, After SMT, problems are : Problem set: 0 solved, 1403 unsolved
Search for dead transitions found 0 dead transitions in 32777ms
Starting structural reductions in LTL mode, iteration 1 : 745/752 places, 1405/1412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61642 ms. Remains : 745/752 places, 1405/1412 transitions.
Support contains 550 out of 745 places after structural reductions.
[2024-05-28 01:33:24] [INFO ] Flatten gal took : 136 ms
[2024-05-28 01:33:24] [INFO ] Flatten gal took : 85 ms
[2024-05-28 01:33:24] [INFO ] Input system was already deterministic with 1405 transitions.
RANDOM walk for 40000 steps (14 resets) in 3037 ms. (13 steps per ms) remains 74/100 properties
BEST_FIRST walk for 4003 steps (8 resets) in 91 ms. (43 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 105 ms. (37 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 133 ms. (29 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 88 ms. (44 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 91 ms. (43 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 72 ms. (54 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 65 ms. (60 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 63 ms. (62 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 64 ms. (61 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 66 ms. (59 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 94 ms. (42 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 80 ms. (49 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 60 ms. (65 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 80 ms. (49 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (9 resets) in 70 ms. (56 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 63 ms. (62 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 74 ms. (53 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 75 ms. (52 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 67 ms. (58 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 78 ms. (50 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 57 ms. (69 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 52 ms. (75 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 73 ms. (54 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 57 ms. (69 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 75 ms. (52 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4000 steps (8 resets) in 54 ms. (72 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 52 ms. (75 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 77 ms. (51 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 69 ms. (57 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 70 ms. (56 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 63 ms. (62 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 79 ms. (50 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 64 ms. (61 steps per ms) remains 74/74 properties
[2024-05-28 01:33:26] [INFO ] Flow matrix only has 1385 transitions (discarded 20 similar events)
[2024-05-28 01:33:26] [INFO ] Invariant cache hit.
[2024-05-28 01:33:26] [INFO ] State equation strengthened by 120 read => feed constraints.
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp44 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 71 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp10 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 1/4 constraints. Problems are: Problem set: 5 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/407 variables, 0/4 constraints. Problems are: Problem set: 5 solved, 69 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp87 is UNSAT
Problem AtomicPropp91 is UNSAT
Problem AtomicPropp93 is UNSAT
Problem AtomicPropp94 is UNSAT
Problem AtomicPropp98 is UNSAT
At refinement iteration 3 (OVERLAPS) 69/476 variables, 8/12 constraints. Problems are: Problem set: 18 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/476 variables, 0/12 constraints. Problems are: Problem set: 18 solved, 56 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp85 is UNSAT
Problem AtomicPropp86 is UNSAT
Problem AtomicPropp90 is UNSAT
Problem AtomicPropp97 is UNSAT
Problem AtomicPropp99 is UNSAT
At refinement iteration 5 (OVERLAPS) 266/742 variables, 39/51 constraints. Problems are: Problem set: 65 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/742 variables, 0/51 constraints. Problems are: Problem set: 65 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 2/744 variables, 2/53 constraints. Problems are: Problem set: 65 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/744 variables, 0/53 constraints. Problems are: Problem set: 65 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1/745 variables, 1/54 constraints. Problems are: Problem set: 65 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/745 variables, 0/54 constraints. Problems are: Problem set: 65 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 1385/2130 variables, 745/799 constraints. Problems are: Problem set: 65 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2130 variables, 120/919 constraints. Problems are: Problem set: 65 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2130/2130 variables, and 919 constraints, problems are : Problem set: 65 solved, 9 unsolved in 5026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 745/745 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 65 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 65 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/47 variables, 2/2 constraints. Problems are: Problem set: 65 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 65 solved, 9 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 3 (OVERLAPS) 646/693 variables, 18/20 constraints. Problems are: Problem set: 66 solved, 8 unsolved
[2024-05-28 01:33:32] [INFO ] Deduced a trap composed of 456 places in 403 ms of which 5 ms to minimize.
[2024-05-28 01:33:32] [INFO ] Deduced a trap composed of 446 places in 339 ms of which 4 ms to minimize.
[2024-05-28 01:33:33] [INFO ] Deduced a trap composed of 404 places in 331 ms of which 4 ms to minimize.
[2024-05-28 01:33:33] [INFO ] Deduced a trap composed of 430 places in 278 ms of which 4 ms to minimize.
[2024-05-28 01:33:33] [INFO ] Deduced a trap composed of 433 places in 275 ms of which 4 ms to minimize.
[2024-05-28 01:33:34] [INFO ] Deduced a trap composed of 433 places in 308 ms of which 4 ms to minimize.
[2024-05-28 01:33:34] [INFO ] Deduced a trap composed of 437 places in 302 ms of which 4 ms to minimize.
[2024-05-28 01:33:34] [INFO ] Deduced a trap composed of 419 places in 312 ms of which 5 ms to minimize.
[2024-05-28 01:33:35] [INFO ] Deduced a trap composed of 450 places in 313 ms of which 5 ms to minimize.
[2024-05-28 01:33:35] [INFO ] Deduced a trap composed of 448 places in 321 ms of which 4 ms to minimize.
[2024-05-28 01:33:35] [INFO ] Deduced a trap composed of 405 places in 321 ms of which 4 ms to minimize.
[2024-05-28 01:33:36] [INFO ] Deduced a trap composed of 433 places in 318 ms of which 4 ms to minimize.
[2024-05-28 01:33:36] [INFO ] Deduced a trap composed of 442 places in 321 ms of which 4 ms to minimize.
[2024-05-28 01:33:36] [INFO ] Deduced a trap composed of 447 places in 355 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 693/2130 variables, and 34 constraints, problems are : Problem set: 66 solved, 8 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/13 constraints, Generalized P Invariants (flows): 18/41 constraints, State Equation: 0/745 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/74 constraints, Known Traps: 14/14 constraints]
After SMT, in 10235ms problems are : Problem set: 66 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 745 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 745/745 places, 1405/1405 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 77 rules applied. Total rules applied 77 place count 743 transition count 1330
Reduce places removed 75 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 76 rules applied. Total rules applied 153 place count 668 transition count 1329
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 154 place count 667 transition count 1329
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 79 Pre rules applied. Total rules applied 154 place count 667 transition count 1250
Deduced a syphon composed of 79 places in 3 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 312 place count 588 transition count 1250
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 1 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 164 rules applied. Total rules applied 476 place count 506 transition count 1168
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 496 place count 506 transition count 1148
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 516 place count 486 transition count 1148
Applied a total of 516 rules in 281 ms. Remains 486 /745 variables (removed 259) and now considering 1148/1405 (removed 257) transitions.
Running 1146 sub problems to find dead transitions.
[2024-05-28 01:33:37] [INFO ] Flow matrix only has 1128 transitions (discarded 20 similar events)
// Phase 1: matrix 1128 rows 486 cols
[2024-05-28 01:33:37] [INFO ] Computed 52 invariants in 24 ms
[2024-05-28 01:33:37] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/484 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/484 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1146 unsolved
[2024-05-28 01:33:47] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 2 ms to minimize.
[2024-05-28 01:33:47] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-05-28 01:33:47] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 2 ms to minimize.
[2024-05-28 01:33:47] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-05-28 01:33:47] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-05-28 01:33:47] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-05-28 01:33:47] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 1 ms to minimize.
[2024-05-28 01:33:48] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2024-05-28 01:33:48] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-28 01:33:48] [INFO ] Deduced a trap composed of 60 places in 188 ms of which 3 ms to minimize.
[2024-05-28 01:33:48] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-28 01:33:49] [INFO ] Deduced a trap composed of 67 places in 303 ms of which 4 ms to minimize.
[2024-05-28 01:33:49] [INFO ] Deduced a trap composed of 98 places in 309 ms of which 4 ms to minimize.
[2024-05-28 01:33:50] [INFO ] Deduced a trap composed of 280 places in 269 ms of which 4 ms to minimize.
[2024-05-28 01:33:50] [INFO ] Deduced a trap composed of 305 places in 269 ms of which 3 ms to minimize.
[2024-05-28 01:33:50] [INFO ] Deduced a trap composed of 303 places in 243 ms of which 4 ms to minimize.
[2024-05-28 01:33:51] [INFO ] Deduced a trap composed of 301 places in 312 ms of which 4 ms to minimize.
[2024-05-28 01:33:51] [INFO ] Deduced a trap composed of 23 places in 186 ms of which 3 ms to minimize.
[2024-05-28 01:33:53] [INFO ] Deduced a trap composed of 193 places in 305 ms of which 3 ms to minimize.
[2024-05-28 01:33:54] [INFO ] Deduced a trap composed of 172 places in 300 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/484 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1146 unsolved
[2024-05-28 01:33:58] [INFO ] Deduced a trap composed of 185 places in 287 ms of which 4 ms to minimize.
[2024-05-28 01:33:59] [INFO ] Deduced a trap composed of 276 places in 274 ms of which 3 ms to minimize.
[2024-05-28 01:33:59] [INFO ] Deduced a trap composed of 297 places in 265 ms of which 3 ms to minimize.
SMT process timed out in 22754ms, After SMT, problems are : Problem set: 0 solved, 1146 unsolved
Search for dead transitions found 0 dead transitions in 22767ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23052 ms. Remains : 486/745 places, 1148/1405 transitions.
RANDOM walk for 40000 steps (14 resets) in 953 ms. (41 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (10 resets) in 285 ms. (139 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (10 resets) in 196 ms. (203 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 175 ms. (227 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (10 resets) in 174 ms. (228 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (9 resets) in 161 ms. (246 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 160 ms. (248 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (11 resets) in 160 ms. (248 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (10 resets) in 150 ms. (264 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 91450 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :0 out of 8
Probabilistic random walk after 91450 steps, saw 62028 distinct states, run finished after 3007 ms. (steps per millisecond=30 ) properties seen :0
[2024-05-28 01:34:03] [INFO ] Flow matrix only has 1128 transitions (discarded 20 similar events)
[2024-05-28 01:34:03] [INFO ] Invariant cache hit.
[2024-05-28 01:34:03] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 33/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 389/436 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 13/449 variables, 9/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/449 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 35/484 variables, 22/51 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 1128/1612 variables, 484/535 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1612 variables, 120/655 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1612 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 2/1614 variables, 2/657 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1614 variables, 1/658 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1614 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 0/1614 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1614/1614 variables, and 658 constraints, problems are : Problem set: 0 solved, 8 unsolved in 6608 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 486/486 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 33/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 389/436 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-28 01:34:11] [INFO ] Deduced a trap composed of 222 places in 329 ms of which 3 ms to minimize.
[2024-05-28 01:34:11] [INFO ] Deduced a trap composed of 234 places in 287 ms of which 4 ms to minimize.
[2024-05-28 01:34:11] [INFO ] Deduced a trap composed of 277 places in 243 ms of which 2 ms to minimize.
[2024-05-28 01:34:11] [INFO ] Deduced a trap composed of 238 places in 291 ms of which 3 ms to minimize.
[2024-05-28 01:34:12] [INFO ] Deduced a trap composed of 252 places in 315 ms of which 5 ms to minimize.
[2024-05-28 01:34:12] [INFO ] Deduced a trap composed of 240 places in 280 ms of which 3 ms to minimize.
[2024-05-28 01:34:12] [INFO ] Deduced a trap composed of 246 places in 348 ms of which 3 ms to minimize.
[2024-05-28 01:34:13] [INFO ] Deduced a trap composed of 246 places in 293 ms of which 3 ms to minimize.
[2024-05-28 01:34:13] [INFO ] Deduced a trap composed of 294 places in 272 ms of which 3 ms to minimize.
[2024-05-28 01:34:13] [INFO ] Deduced a trap composed of 243 places in 247 ms of which 3 ms to minimize.
[2024-05-28 01:34:13] [INFO ] Deduced a trap composed of 245 places in 206 ms of which 2 ms to minimize.
[2024-05-28 01:34:14] [INFO ] Deduced a trap composed of 242 places in 249 ms of which 3 ms to minimize.
[2024-05-28 01:34:14] [INFO ] Deduced a trap composed of 242 places in 213 ms of which 2 ms to minimize.
[2024-05-28 01:34:14] [INFO ] Deduced a trap composed of 242 places in 213 ms of which 3 ms to minimize.
[2024-05-28 01:34:14] [INFO ] Deduced a trap composed of 296 places in 197 ms of which 3 ms to minimize.
[2024-05-28 01:34:15] [INFO ] Deduced a trap composed of 239 places in 211 ms of which 2 ms to minimize.
[2024-05-28 01:34:15] [INFO ] Deduced a trap composed of 292 places in 201 ms of which 3 ms to minimize.
[2024-05-28 01:34:15] [INFO ] Deduced a trap composed of 240 places in 213 ms of which 3 ms to minimize.
[2024-05-28 01:34:15] [INFO ] Deduced a trap composed of 254 places in 215 ms of which 2 ms to minimize.
[2024-05-28 01:34:16] [INFO ] Deduced a trap composed of 249 places in 213 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-28 01:34:22] [INFO ] Deduced a trap composed of 143 places in 277 ms of which 3 ms to minimize.
[2024-05-28 01:34:22] [INFO ] Deduced a trap composed of 160 places in 297 ms of which 3 ms to minimize.
[2024-05-28 01:34:23] [INFO ] Deduced a trap composed of 177 places in 268 ms of which 4 ms to minimize.
[2024-05-28 01:34:23] [INFO ] Deduced a trap composed of 203 places in 311 ms of which 3 ms to minimize.
[2024-05-28 01:34:23] [INFO ] Deduced a trap composed of 194 places in 243 ms of which 4 ms to minimize.
[2024-05-28 01:34:24] [INFO ] Deduced a trap composed of 269 places in 283 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-28 01:34:26] [INFO ] Deduced a trap composed of 222 places in 301 ms of which 3 ms to minimize.
[2024-05-28 01:34:26] [INFO ] Deduced a trap composed of 252 places in 311 ms of which 3 ms to minimize.
[2024-05-28 01:34:27] [INFO ] Deduced a trap composed of 238 places in 260 ms of which 3 ms to minimize.
[2024-05-28 01:34:27] [INFO ] Deduced a trap composed of 238 places in 243 ms of which 3 ms to minimize.
[2024-05-28 01:34:27] [INFO ] Deduced a trap composed of 242 places in 274 ms of which 3 ms to minimize.
[2024-05-28 01:34:27] [INFO ] Deduced a trap composed of 246 places in 283 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 13/449 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-28 01:34:30] [INFO ] Deduced a trap composed of 132 places in 290 ms of which 3 ms to minimize.
[2024-05-28 01:34:30] [INFO ] Deduced a trap composed of 198 places in 249 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/449 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/449 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 35/484 variables, 22/85 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-28 01:34:33] [INFO ] Deduced a trap composed of 39 places in 190 ms of which 3 ms to minimize.
[2024-05-28 01:34:33] [INFO ] Deduced a trap composed of 41 places in 120 ms of which 2 ms to minimize.
[2024-05-28 01:34:33] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 3 ms to minimize.
[2024-05-28 01:34:33] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2024-05-28 01:34:33] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 2 ms to minimize.
[2024-05-28 01:34:33] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 2 ms to minimize.
[2024-05-28 01:34:34] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-05-28 01:34:35] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2024-05-28 01:34:35] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 1 ms to minimize.
[2024-05-28 01:34:35] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 0 ms to minimize.
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp70 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/484 variables, 10/95 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 0/95 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 1128/1612 variables, 484/579 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1612 variables, 120/699 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1612/1614 variables, and 705 constraints, problems are : Problem set: 2 solved, 6 unsolved in 45036 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 484/486 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 6/8 constraints, Known Traps: 44/44 constraints]
After SMT, in 51666ms problems are : Problem set: 2 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 1148/1148 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 486 transition count 1147
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 485 transition count 1147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 484 transition count 1146
Applied a total of 4 rules in 77 ms. Remains 484 /486 variables (removed 2) and now considering 1146/1148 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 484/486 places, 1146/1148 transitions.
RANDOM walk for 40000 steps (22 resets) in 614 ms. (65 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (12 resets) in 172 ms. (231 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (9 resets) in 169 ms. (235 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (10 resets) in 169 ms. (235 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (9 resets) in 164 ms. (242 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (13 resets) in 163 ms. (243 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (11 resets) in 170 ms. (233 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 99023 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :0 out of 6
Probabilistic random walk after 99023 steps, saw 64281 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
[2024-05-28 01:34:59] [INFO ] Flow matrix only has 1126 transitions (discarded 20 similar events)
// Phase 1: matrix 1126 rows 484 cols
[2024-05-28 01:34:59] [INFO ] Computed 52 invariants in 22 ms
[2024-05-28 01:34:59] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 71/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 347/430 variables, 15/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/430 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 13/443 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 39/482 variables, 24/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/482 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1126/1608 variables, 482/533 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1608 variables, 120/653 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1608 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 2/1610 variables, 2/655 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1610 variables, 1/656 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1610 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/1610 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 656 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1992 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 484/484 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 71/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 347/430 variables, 15/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/430 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 13/443 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 39/482 variables, 24/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 01:35:01] [INFO ] Deduced a trap composed of 38 places in 156 ms of which 2 ms to minimize.
[2024-05-28 01:35:01] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 3 ms to minimize.
[2024-05-28 01:35:01] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 2 ms to minimize.
[2024-05-28 01:35:02] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 2 ms to minimize.
[2024-05-28 01:35:02] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 1 ms to minimize.
[2024-05-28 01:35:02] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2024-05-28 01:35:02] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-05-28 01:35:02] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-05-28 01:35:02] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/482 variables, 9/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/482 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 1126/1608 variables, 482/542 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1608 variables, 120/662 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp88 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/1608 variables, 6/668 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-28 01:35:38] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2024-05-28 01:35:46] [INFO ] Deduced a trap composed of 73 places in 355 ms of which 4 ms to minimize.
[2024-05-28 01:35:48] [INFO ] Deduced a trap composed of 212 places in 355 ms of which 4 ms to minimize.
[2024-05-28 01:35:48] [INFO ] Deduced a trap composed of 226 places in 330 ms of which 5 ms to minimize.
[2024-05-28 01:35:49] [INFO ] Deduced a trap composed of 177 places in 352 ms of which 4 ms to minimize.
[2024-05-28 01:35:49] [INFO ] Deduced a trap composed of 181 places in 324 ms of which 3 ms to minimize.
[2024-05-28 01:35:50] [INFO ] Deduced a trap composed of 272 places in 328 ms of which 4 ms to minimize.
[2024-05-28 01:35:50] [INFO ] Deduced a trap composed of 180 places in 305 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1608 variables, 8/676 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1608 variables, 0/676 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 678 constraints, problems are : Problem set: 2 solved, 4 unsolved in 75023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 484/484 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 17/17 constraints]
After SMT, in 77065ms problems are : Problem set: 2 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 484 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 484/484 places, 1146/1146 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 481 transition count 1143
Applied a total of 6 rules in 59 ms. Remains 481 /484 variables (removed 3) and now considering 1143/1146 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 481/484 places, 1143/1146 transitions.
Successfully simplified 70 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-PT-S02J04T10-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T10-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 01:36:16] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-28 01:36:16] [INFO ] Flatten gal took : 81 ms
[2024-05-28 01:36:16] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBLF-PT-S02J04T10-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T10-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T10-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T10-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 01:36:16] [INFO ] Flatten gal took : 81 ms
[2024-05-28 01:36:16] [INFO ] Input system was already deterministic with 1405 transitions.
Support contains 131 out of 745 places (down from 190) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 745/745 places, 1405/1405 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 743 transition count 1405
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 733 transition count 1395
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 733 transition count 1395
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 730 transition count 1392
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 730 transition count 1392
Applied a total of 28 rules in 88 ms. Remains 730 /745 variables (removed 15) and now considering 1392/1405 (removed 13) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-28 01:36:16] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 730 cols
[2024-05-28 01:36:16] [INFO ] Computed 52 invariants in 42 ms
[2024-05-28 01:36:16] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 01:36:33] [INFO ] Deduced a trap composed of 64 places in 99 ms of which 2 ms to minimize.
[2024-05-28 01:36:33] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 1 ms to minimize.
[2024-05-28 01:36:33] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 1 ms to minimize.
[2024-05-28 01:36:33] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 1 ms to minimize.
[2024-05-28 01:36:33] [INFO ] Deduced a trap composed of 63 places in 53 ms of which 1 ms to minimize.
[2024-05-28 01:36:33] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-05-28 01:36:34] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-05-28 01:36:34] [INFO ] Deduced a trap composed of 63 places in 60 ms of which 1 ms to minimize.
[2024-05-28 01:36:34] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 1 ms to minimize.
[2024-05-28 01:36:34] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 1 ms to minimize.
[2024-05-28 01:36:34] [INFO ] Deduced a trap composed of 387 places in 430 ms of which 5 ms to minimize.
[2024-05-28 01:36:35] [INFO ] Deduced a trap composed of 388 places in 402 ms of which 6 ms to minimize.
[2024-05-28 01:36:35] [INFO ] Deduced a trap composed of 380 places in 334 ms of which 4 ms to minimize.
[2024-05-28 01:36:36] [INFO ] Deduced a trap composed of 369 places in 396 ms of which 5 ms to minimize.
[2024-05-28 01:36:37] [INFO ] Deduced a trap composed of 496 places in 390 ms of which 5 ms to minimize.
[2024-05-28 01:36:37] [INFO ] Deduced a trap composed of 517 places in 415 ms of which 5 ms to minimize.
[2024-05-28 01:36:37] [INFO ] Deduced a trap composed of 494 places in 378 ms of which 6 ms to minimize.
[2024-05-28 01:36:38] [INFO ] Deduced a trap composed of 527 places in 328 ms of which 4 ms to minimize.
[2024-05-28 01:36:38] [INFO ] Deduced a trap composed of 504 places in 325 ms of which 4 ms to minimize.
SMT process timed out in 22005ms, After SMT, problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 22026ms
Finished structural reductions in LTL mode , in 1 iterations and 22120 ms. Remains : 730/745 places, 1392/1405 transitions.
[2024-05-28 01:36:38] [INFO ] Flatten gal took : 54 ms
[2024-05-28 01:36:38] [INFO ] Flatten gal took : 55 ms
[2024-05-28 01:36:38] [INFO ] Input system was already deterministic with 1392 transitions.
Starting structural reductions in LTL mode, iteration 0 : 745/745 places, 1405/1405 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 743 transition count 1405
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 733 transition count 1395
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 733 transition count 1395
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 730 transition count 1392
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 730 transition count 1392
Applied a total of 28 rules in 67 ms. Remains 730 /745 variables (removed 15) and now considering 1392/1405 (removed 13) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-28 01:36:39] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 01:36:39] [INFO ] Invariant cache hit.
[2024-05-28 01:36:39] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 01:36:54] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 2 ms to minimize.
[2024-05-28 01:36:54] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 1 ms to minimize.
[2024-05-28 01:36:54] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 2 ms to minimize.
[2024-05-28 01:36:54] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 2 ms to minimize.
[2024-05-28 01:36:54] [INFO ] Deduced a trap composed of 63 places in 44 ms of which 1 ms to minimize.
[2024-05-28 01:36:54] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-05-28 01:36:54] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 2 ms to minimize.
[2024-05-28 01:36:54] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 2 ms to minimize.
[2024-05-28 01:36:55] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-05-28 01:36:55] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 1 ms to minimize.
[2024-05-28 01:36:55] [INFO ] Deduced a trap composed of 372 places in 345 ms of which 4 ms to minimize.
[2024-05-28 01:36:55] [INFO ] Deduced a trap composed of 373 places in 413 ms of which 6 ms to minimize.
[2024-05-28 01:36:56] [INFO ] Deduced a trap composed of 98 places in 342 ms of which 4 ms to minimize.
[2024-05-28 01:36:57] [INFO ] Deduced a trap composed of 369 places in 341 ms of which 5 ms to minimize.
[2024-05-28 01:36:57] [INFO ] Deduced a trap composed of 409 places in 386 ms of which 6 ms to minimize.
[2024-05-28 01:36:58] [INFO ] Deduced a trap composed of 490 places in 346 ms of which 4 ms to minimize.
[2024-05-28 01:36:58] [INFO ] Deduced a trap composed of 250 places in 423 ms of which 6 ms to minimize.
[2024-05-28 01:36:59] [INFO ] Deduced a trap composed of 208 places in 420 ms of which 6 ms to minimize.
[2024-05-28 01:37:00] [INFO ] Deduced a trap composed of 401 places in 349 ms of which 4 ms to minimize.
[2024-05-28 01:37:01] [INFO ] Deduced a trap composed of 400 places in 540 ms of which 5 ms to minimize.
SMT process timed out in 22300ms, After SMT, problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 22315ms
Finished structural reductions in LTL mode , in 1 iterations and 22387 ms. Remains : 730/745 places, 1392/1405 transitions.
[2024-05-28 01:37:01] [INFO ] Flatten gal took : 59 ms
[2024-05-28 01:37:01] [INFO ] Flatten gal took : 65 ms
[2024-05-28 01:37:01] [INFO ] Input system was already deterministic with 1392 transitions.
Starting structural reductions in LTL mode, iteration 0 : 745/745 places, 1405/1405 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 743 transition count 1405
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 733 transition count 1395
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 733 transition count 1395
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 730 transition count 1392
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 730 transition count 1392
Applied a total of 28 rules in 49 ms. Remains 730 /745 variables (removed 15) and now considering 1392/1405 (removed 13) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-28 01:37:01] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 01:37:01] [INFO ] Invariant cache hit.
[2024-05-28 01:37:01] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 01:37:18] [INFO ] Deduced a trap composed of 64 places in 123 ms of which 3 ms to minimize.
[2024-05-28 01:37:18] [INFO ] Deduced a trap composed of 63 places in 137 ms of which 2 ms to minimize.
[2024-05-28 01:37:18] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2024-05-28 01:37:18] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 2 ms to minimize.
[2024-05-28 01:37:18] [INFO ] Deduced a trap composed of 63 places in 51 ms of which 1 ms to minimize.
[2024-05-28 01:37:18] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 2 ms to minimize.
[2024-05-28 01:37:18] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2024-05-28 01:37:18] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 1 ms to minimize.
[2024-05-28 01:37:18] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 1 ms to minimize.
[2024-05-28 01:37:19] [INFO ] Deduced a trap composed of 63 places in 60 ms of which 1 ms to minimize.
[2024-05-28 01:37:19] [INFO ] Deduced a trap composed of 372 places in 397 ms of which 5 ms to minimize.
[2024-05-28 01:37:19] [INFO ] Deduced a trap composed of 373 places in 492 ms of which 5 ms to minimize.
[2024-05-28 01:37:20] [INFO ] Deduced a trap composed of 98 places in 366 ms of which 4 ms to minimize.
[2024-05-28 01:37:21] [INFO ] Deduced a trap composed of 369 places in 420 ms of which 5 ms to minimize.
[2024-05-28 01:37:21] [INFO ] Deduced a trap composed of 409 places in 400 ms of which 4 ms to minimize.
[2024-05-28 01:37:22] [INFO ] Deduced a trap composed of 490 places in 423 ms of which 5 ms to minimize.
[2024-05-28 01:37:23] [INFO ] Deduced a trap composed of 250 places in 457 ms of which 4 ms to minimize.
[2024-05-28 01:37:23] [INFO ] Deduced a trap composed of 208 places in 376 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2102 variables, and 68 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 18/68 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 01:37:42] [INFO ] Deduced a trap composed of 398 places in 395 ms of which 6 ms to minimize.
[2024-05-28 01:37:43] [INFO ] Deduced a trap composed of 420 places in 393 ms of which 5 ms to minimize.
[2024-05-28 01:37:43] [INFO ] Deduced a trap composed of 405 places in 308 ms of which 5 ms to minimize.
[2024-05-28 01:37:43] [INFO ] Deduced a trap composed of 398 places in 312 ms of which 5 ms to minimize.
[2024-05-28 01:37:43] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 3 ms to minimize.
SMT process timed out in 42275ms, After SMT, problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 42295ms
Finished structural reductions in LTL mode , in 1 iterations and 42349 ms. Remains : 730/745 places, 1392/1405 transitions.
[2024-05-28 01:37:44] [INFO ] Flatten gal took : 42 ms
[2024-05-28 01:37:44] [INFO ] Flatten gal took : 43 ms
[2024-05-28 01:37:44] [INFO ] Input system was already deterministic with 1392 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 745/745 places, 1405/1405 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 743 transition count 1339
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 677 transition count 1339
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 132 place count 677 transition count 1309
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 192 place count 647 transition count 1309
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 1 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 366 place count 560 transition count 1222
Applied a total of 366 rules in 82 ms. Remains 560 /745 variables (removed 185) and now considering 1222/1405 (removed 183) transitions.
Running 1220 sub problems to find dead transitions.
[2024-05-28 01:37:44] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
// Phase 1: matrix 1202 rows 560 cols
[2024-05-28 01:37:44] [INFO ] Computed 52 invariants in 17 ms
[2024-05-28 01:37:44] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/558 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/558 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
[2024-05-28 01:37:55] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 2 ms to minimize.
[2024-05-28 01:37:56] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 2 ms to minimize.
[2024-05-28 01:37:56] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 2 ms to minimize.
[2024-05-28 01:37:56] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 2 ms to minimize.
[2024-05-28 01:37:56] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2024-05-28 01:37:56] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 0 ms to minimize.
[2024-05-28 01:37:56] [INFO ] Deduced a trap composed of 47 places in 38 ms of which 1 ms to minimize.
[2024-05-28 01:37:56] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-05-28 01:37:56] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
[2024-05-28 01:37:56] [INFO ] Deduced a trap composed of 47 places in 37 ms of which 0 ms to minimize.
[2024-05-28 01:37:56] [INFO ] Deduced a trap composed of 204 places in 288 ms of which 4 ms to minimize.
[2024-05-28 01:37:57] [INFO ] Deduced a trap composed of 91 places in 283 ms of which 8 ms to minimize.
[2024-05-28 01:37:57] [INFO ] Deduced a trap composed of 56 places in 324 ms of which 4 ms to minimize.
[2024-05-28 01:37:58] [INFO ] Deduced a trap composed of 90 places in 287 ms of which 3 ms to minimize.
[2024-05-28 01:37:58] [INFO ] Deduced a trap composed of 239 places in 296 ms of which 4 ms to minimize.
[2024-05-28 01:37:59] [INFO ] Deduced a trap composed of 65 places in 188 ms of which 3 ms to minimize.
[2024-05-28 01:37:59] [INFO ] Deduced a trap composed of 243 places in 320 ms of which 3 ms to minimize.
[2024-05-28 01:38:01] [INFO ] Deduced a trap composed of 37 places in 250 ms of which 4 ms to minimize.
[2024-05-28 01:38:01] [INFO ] Deduced a trap composed of 350 places in 294 ms of which 4 ms to minimize.
[2024-05-28 01:38:05] [INFO ] Deduced a trap composed of 232 places in 286 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/558 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 558/1762 variables, and 70 constraints, problems are : Problem set: 0 solved, 1220 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 36/37 constraints, State Equation: 0/560 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1220/1220 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/558 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/558 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/558 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
[2024-05-28 01:38:15] [INFO ] Deduced a trap composed of 239 places in 343 ms of which 4 ms to minimize.
[2024-05-28 01:38:17] [INFO ] Deduced a trap composed of 31 places in 228 ms of which 3 ms to minimize.
[2024-05-28 01:38:22] [INFO ] Deduced a trap composed of 262 places in 274 ms of which 5 ms to minimize.
[2024-05-28 01:38:22] [INFO ] Deduced a trap composed of 351 places in 278 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 558/1762 variables, and 74 constraints, problems are : Problem set: 0 solved, 1220 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 36/37 constraints, State Equation: 0/560 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1220 constraints, Known Traps: 24/24 constraints]
After SMT, in 42158ms problems are : Problem set: 0 solved, 1220 unsolved
Search for dead transitions found 0 dead transitions in 42168ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 42253 ms. Remains : 560/745 places, 1222/1405 transitions.
[2024-05-28 01:38:26] [INFO ] Flatten gal took : 66 ms
[2024-05-28 01:38:26] [INFO ] Flatten gal took : 55 ms
[2024-05-28 01:38:26] [INFO ] Input system was already deterministic with 1222 transitions.
RANDOM walk for 133 steps (0 resets) in 5 ms. (22 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-PT-S02J04T10-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 745/745 places, 1405/1405 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 743 transition count 1405
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 733 transition count 1395
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 733 transition count 1395
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 730 transition count 1392
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 730 transition count 1392
Applied a total of 28 rules in 41 ms. Remains 730 /745 variables (removed 15) and now considering 1392/1405 (removed 13) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-28 01:38:26] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 730 cols
[2024-05-28 01:38:26] [INFO ] Computed 52 invariants in 38 ms
[2024-05-28 01:38:26] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 01:38:42] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 2 ms to minimize.
[2024-05-28 01:38:42] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 1 ms to minimize.
[2024-05-28 01:38:42] [INFO ] Deduced a trap composed of 63 places in 51 ms of which 1 ms to minimize.
[2024-05-28 01:38:42] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 1 ms to minimize.
[2024-05-28 01:38:42] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 2 ms to minimize.
[2024-05-28 01:38:42] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 0 ms to minimize.
[2024-05-28 01:38:42] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
[2024-05-28 01:38:42] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 1 ms to minimize.
[2024-05-28 01:38:42] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 1 ms to minimize.
[2024-05-28 01:38:42] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 1 ms to minimize.
[2024-05-28 01:38:43] [INFO ] Deduced a trap composed of 387 places in 417 ms of which 5 ms to minimize.
[2024-05-28 01:38:43] [INFO ] Deduced a trap composed of 388 places in 397 ms of which 4 ms to minimize.
[2024-05-28 01:38:44] [INFO ] Deduced a trap composed of 380 places in 369 ms of which 5 ms to minimize.
[2024-05-28 01:38:44] [INFO ] Deduced a trap composed of 369 places in 418 ms of which 4 ms to minimize.
[2024-05-28 01:38:45] [INFO ] Deduced a trap composed of 496 places in 437 ms of which 5 ms to minimize.
[2024-05-28 01:38:46] [INFO ] Deduced a trap composed of 517 places in 583 ms of which 4 ms to minimize.
[2024-05-28 01:38:46] [INFO ] Deduced a trap composed of 494 places in 346 ms of which 5 ms to minimize.
[2024-05-28 01:38:47] [INFO ] Deduced a trap composed of 527 places in 390 ms of which 4 ms to minimize.
[2024-05-28 01:38:47] [INFO ] Deduced a trap composed of 504 places in 388 ms of which 4 ms to minimize.
[2024-05-28 01:38:47] [INFO ] Deduced a trap composed of 494 places in 387 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2102 variables, and 70 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2102 variables, and 70 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20066 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 20/20 constraints]
After SMT, in 42193ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 42211ms
Finished structural reductions in LTL mode , in 1 iterations and 42257 ms. Remains : 730/745 places, 1392/1405 transitions.
[2024-05-28 01:39:09] [INFO ] Flatten gal took : 38 ms
[2024-05-28 01:39:09] [INFO ] Flatten gal took : 41 ms
[2024-05-28 01:39:09] [INFO ] Input system was already deterministic with 1392 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 745/745 places, 1405/1405 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 76 rules applied. Total rules applied 76 place count 743 transition count 1329
Reduce places removed 76 places and 0 transitions.
Iterating post reduction 1 with 76 rules applied. Total rules applied 152 place count 667 transition count 1329
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 152 place count 667 transition count 1249
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 312 place count 587 transition count 1249
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 1 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 484 place count 501 transition count 1163
Applied a total of 484 rules in 105 ms. Remains 501 /745 variables (removed 244) and now considering 1163/1405 (removed 242) transitions.
Running 1161 sub problems to find dead transitions.
[2024-05-28 01:39:09] [INFO ] Flow matrix only has 1143 transitions (discarded 20 similar events)
// Phase 1: matrix 1143 rows 501 cols
[2024-05-28 01:39:09] [INFO ] Computed 52 invariants in 29 ms
[2024-05-28 01:39:09] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1161 unsolved
[2024-05-28 01:39:18] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 4 ms to minimize.
[2024-05-28 01:39:18] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 2 ms to minimize.
[2024-05-28 01:39:19] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 12 ms to minimize.
[2024-05-28 01:39:19] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
[2024-05-28 01:39:19] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 1 ms to minimize.
[2024-05-28 01:39:19] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 0 ms to minimize.
[2024-05-28 01:39:19] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 0 ms to minimize.
[2024-05-28 01:39:19] [INFO ] Deduced a trap composed of 108 places in 273 ms of which 3 ms to minimize.
[2024-05-28 01:39:20] [INFO ] Deduced a trap composed of 105 places in 221 ms of which 2 ms to minimize.
[2024-05-28 01:39:20] [INFO ] Deduced a trap composed of 42 places in 239 ms of which 3 ms to minimize.
[2024-05-28 01:39:20] [INFO ] Deduced a trap composed of 40 places in 254 ms of which 3 ms to minimize.
[2024-05-28 01:39:20] [INFO ] Deduced a trap composed of 40 places in 232 ms of which 3 ms to minimize.
[2024-05-28 01:39:21] [INFO ] Deduced a trap composed of 194 places in 339 ms of which 3 ms to minimize.
[2024-05-28 01:39:21] [INFO ] Deduced a trap composed of 167 places in 264 ms of which 3 ms to minimize.
[2024-05-28 01:39:21] [INFO ] Deduced a trap composed of 305 places in 260 ms of which 3 ms to minimize.
[2024-05-28 01:39:22] [INFO ] Deduced a trap composed of 176 places in 260 ms of which 3 ms to minimize.
[2024-05-28 01:39:22] [INFO ] Deduced a trap composed of 84 places in 190 ms of which 2 ms to minimize.
[2024-05-28 01:39:22] [INFO ] Deduced a trap composed of 94 places in 245 ms of which 2 ms to minimize.
[2024-05-28 01:39:23] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 3 ms to minimize.
[2024-05-28 01:39:23] [INFO ] Deduced a trap composed of 37 places in 229 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1161 unsolved
[2024-05-28 01:39:27] [INFO ] Deduced a trap composed of 317 places in 277 ms of which 2 ms to minimize.
[2024-05-28 01:39:27] [INFO ] Deduced a trap composed of 292 places in 285 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 499/1644 variables, and 72 constraints, problems are : Problem set: 0 solved, 1161 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/501 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1161/1161 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 22/72 constraints. Problems are: Problem set: 0 solved, 1161 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 499/1644 variables, and 72 constraints, problems are : Problem set: 0 solved, 1161 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/501 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1161 constraints, Known Traps: 22/22 constraints]
After SMT, in 42088ms problems are : Problem set: 0 solved, 1161 unsolved
Search for dead transitions found 0 dead transitions in 42101ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 42211 ms. Remains : 501/745 places, 1163/1405 transitions.
[2024-05-28 01:39:51] [INFO ] Flatten gal took : 49 ms
[2024-05-28 01:39:51] [INFO ] Flatten gal took : 48 ms
[2024-05-28 01:39:51] [INFO ] Input system was already deterministic with 1163 transitions.
Starting structural reductions in LTL mode, iteration 0 : 745/745 places, 1405/1405 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 743 transition count 1405
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 733 transition count 1395
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 733 transition count 1395
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 730 transition count 1392
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 730 transition count 1392
Applied a total of 28 rules in 37 ms. Remains 730 /745 variables (removed 15) and now considering 1392/1405 (removed 13) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-28 01:39:51] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 730 cols
[2024-05-28 01:39:51] [INFO ] Computed 52 invariants in 33 ms
[2024-05-28 01:39:51] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 01:40:05] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 2 ms to minimize.
[2024-05-28 01:40:06] [INFO ] Deduced a trap composed of 63 places in 88 ms of which 1 ms to minimize.
[2024-05-28 01:40:06] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 0 ms to minimize.
[2024-05-28 01:40:06] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-05-28 01:40:06] [INFO ] Deduced a trap composed of 63 places in 46 ms of which 1 ms to minimize.
[2024-05-28 01:40:06] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 1 ms to minimize.
[2024-05-28 01:40:06] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
[2024-05-28 01:40:06] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 1 ms to minimize.
[2024-05-28 01:40:06] [INFO ] Deduced a trap composed of 63 places in 86 ms of which 2 ms to minimize.
[2024-05-28 01:40:06] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 1 ms to minimize.
[2024-05-28 01:40:07] [INFO ] Deduced a trap composed of 387 places in 476 ms of which 5 ms to minimize.
[2024-05-28 01:40:07] [INFO ] Deduced a trap composed of 388 places in 323 ms of which 4 ms to minimize.
[2024-05-28 01:40:08] [INFO ] Deduced a trap composed of 380 places in 418 ms of which 5 ms to minimize.
[2024-05-28 01:40:08] [INFO ] Deduced a trap composed of 369 places in 341 ms of which 4 ms to minimize.
[2024-05-28 01:40:09] [INFO ] Deduced a trap composed of 496 places in 418 ms of which 5 ms to minimize.
[2024-05-28 01:40:09] [INFO ] Deduced a trap composed of 517 places in 400 ms of which 5 ms to minimize.
[2024-05-28 01:40:10] [INFO ] Deduced a trap composed of 494 places in 387 ms of which 5 ms to minimize.
[2024-05-28 01:40:10] [INFO ] Deduced a trap composed of 527 places in 298 ms of which 3 ms to minimize.
[2024-05-28 01:40:10] [INFO ] Deduced a trap composed of 504 places in 393 ms of which 5 ms to minimize.
[2024-05-28 01:40:11] [INFO ] Deduced a trap composed of 494 places in 359 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2102 variables, and 70 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2102 variables, and 70 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 20/20 constraints]
After SMT, in 42262ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 42274ms
Finished structural reductions in LTL mode , in 1 iterations and 42316 ms. Remains : 730/745 places, 1392/1405 transitions.
[2024-05-28 01:40:33] [INFO ] Flatten gal took : 32 ms
[2024-05-28 01:40:33] [INFO ] Flatten gal took : 34 ms
[2024-05-28 01:40:34] [INFO ] Input system was already deterministic with 1392 transitions.
Starting structural reductions in LTL mode, iteration 0 : 745/745 places, 1405/1405 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 743 transition count 1405
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 733 transition count 1395
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 733 transition count 1395
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 730 transition count 1392
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 730 transition count 1392
Applied a total of 28 rules in 34 ms. Remains 730 /745 variables (removed 15) and now considering 1392/1405 (removed 13) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-28 01:40:34] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 01:40:34] [INFO ] Invariant cache hit.
[2024-05-28 01:40:34] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 01:40:48] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 1 ms to minimize.
[2024-05-28 01:40:48] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 2 ms to minimize.
[2024-05-28 01:40:49] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-05-28 01:40:49] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 1 ms to minimize.
[2024-05-28 01:40:49] [INFO ] Deduced a trap composed of 63 places in 48 ms of which 1 ms to minimize.
[2024-05-28 01:40:49] [INFO ] Deduced a trap composed of 64 places in 33 ms of which 0 ms to minimize.
[2024-05-28 01:40:49] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 0 ms to minimize.
[2024-05-28 01:40:49] [INFO ] Deduced a trap composed of 65 places in 41 ms of which 1 ms to minimize.
[2024-05-28 01:40:49] [INFO ] Deduced a trap composed of 64 places in 36 ms of which 0 ms to minimize.
[2024-05-28 01:40:49] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 0 ms to minimize.
[2024-05-28 01:40:49] [INFO ] Deduced a trap composed of 372 places in 281 ms of which 4 ms to minimize.
[2024-05-28 01:40:50] [INFO ] Deduced a trap composed of 373 places in 296 ms of which 3 ms to minimize.
[2024-05-28 01:40:50] [INFO ] Deduced a trap composed of 98 places in 246 ms of which 3 ms to minimize.
[2024-05-28 01:40:51] [INFO ] Deduced a trap composed of 369 places in 406 ms of which 6 ms to minimize.
[2024-05-28 01:40:51] [INFO ] Deduced a trap composed of 409 places in 377 ms of which 5 ms to minimize.
[2024-05-28 01:40:52] [INFO ] Deduced a trap composed of 490 places in 398 ms of which 5 ms to minimize.
[2024-05-28 01:40:52] [INFO ] Deduced a trap composed of 250 places in 410 ms of which 5 ms to minimize.
[2024-05-28 01:40:53] [INFO ] Deduced a trap composed of 208 places in 388 ms of which 5 ms to minimize.
[2024-05-28 01:40:54] [INFO ] Deduced a trap composed of 401 places in 281 ms of which 4 ms to minimize.
[2024-05-28 01:40:54] [INFO ] Deduced a trap composed of 400 places in 413 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2102 variables, and 70 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 01:41:13] [INFO ] Deduced a trap composed of 65 places in 272 ms of which 3 ms to minimize.
[2024-05-28 01:41:15] [INFO ] Deduced a trap composed of 399 places in 412 ms of which 6 ms to minimize.
[2024-05-28 01:41:15] [INFO ] Deduced a trap composed of 396 places in 382 ms of which 4 ms to minimize.
[2024-05-28 01:41:15] [INFO ] Deduced a trap composed of 403 places in 303 ms of which 4 ms to minimize.
[2024-05-28 01:41:16] [INFO ] Deduced a trap composed of 509 places in 381 ms of which 5 ms to minimize.
SMT process timed out in 42039ms, After SMT, problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 42049ms
Finished structural reductions in LTL mode , in 1 iterations and 42088 ms. Remains : 730/745 places, 1392/1405 transitions.
[2024-05-28 01:41:16] [INFO ] Flatten gal took : 33 ms
[2024-05-28 01:41:16] [INFO ] Flatten gal took : 35 ms
[2024-05-28 01:41:16] [INFO ] Input system was already deterministic with 1392 transitions.
Starting structural reductions in LTL mode, iteration 0 : 745/745 places, 1405/1405 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 743 transition count 1405
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 733 transition count 1395
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 733 transition count 1395
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 730 transition count 1392
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 730 transition count 1392
Applied a total of 28 rules in 60 ms. Remains 730 /745 variables (removed 15) and now considering 1392/1405 (removed 13) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-28 01:41:16] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 01:41:16] [INFO ] Invariant cache hit.
[2024-05-28 01:41:16] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 01:41:32] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 2 ms to minimize.
[2024-05-28 01:41:32] [INFO ] Deduced a trap composed of 63 places in 93 ms of which 1 ms to minimize.
[2024-05-28 01:41:32] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2024-05-28 01:41:32] [INFO ] Deduced a trap composed of 63 places in 80 ms of which 2 ms to minimize.
[2024-05-28 01:41:32] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 1 ms to minimize.
[2024-05-28 01:41:33] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-05-28 01:41:33] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-05-28 01:41:33] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 1 ms to minimize.
[2024-05-28 01:41:33] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 1 ms to minimize.
[2024-05-28 01:41:33] [INFO ] Deduced a trap composed of 63 places in 59 ms of which 1 ms to minimize.
[2024-05-28 01:41:34] [INFO ] Deduced a trap composed of 372 places in 400 ms of which 5 ms to minimize.
[2024-05-28 01:41:34] [INFO ] Deduced a trap composed of 373 places in 404 ms of which 6 ms to minimize.
[2024-05-28 01:41:34] [INFO ] Deduced a trap composed of 98 places in 352 ms of which 5 ms to minimize.
[2024-05-28 01:41:35] [INFO ] Deduced a trap composed of 369 places in 417 ms of which 5 ms to minimize.
[2024-05-28 01:41:36] [INFO ] Deduced a trap composed of 409 places in 391 ms of which 6 ms to minimize.
[2024-05-28 01:41:36] [INFO ] Deduced a trap composed of 490 places in 401 ms of which 5 ms to minimize.
[2024-05-28 01:41:37] [INFO ] Deduced a trap composed of 250 places in 361 ms of which 4 ms to minimize.
[2024-05-28 01:41:37] [INFO ] Deduced a trap composed of 208 places in 374 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2102 variables, and 68 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 18/68 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 01:41:57] [INFO ] Deduced a trap composed of 398 places in 401 ms of which 5 ms to minimize.
[2024-05-28 01:41:57] [INFO ] Deduced a trap composed of 420 places in 373 ms of which 4 ms to minimize.
[2024-05-28 01:41:57] [INFO ] Deduced a trap composed of 405 places in 333 ms of which 4 ms to minimize.
[2024-05-28 01:41:58] [INFO ] Deduced a trap composed of 398 places in 405 ms of which 5 ms to minimize.
[2024-05-28 01:41:58] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 3 ms to minimize.
[2024-05-28 01:41:58] [INFO ] Deduced a trap composed of 69 places in 351 ms of which 4 ms to minimize.
SMT process timed out in 42522ms, After SMT, problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 42541ms
Finished structural reductions in LTL mode , in 1 iterations and 42607 ms. Remains : 730/745 places, 1392/1405 transitions.
[2024-05-28 01:41:58] [INFO ] Flatten gal took : 34 ms
[2024-05-28 01:41:58] [INFO ] Flatten gal took : 37 ms
[2024-05-28 01:41:59] [INFO ] Input system was already deterministic with 1392 transitions.
Starting structural reductions in LTL mode, iteration 0 : 745/745 places, 1405/1405 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 743 transition count 1405
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 734 transition count 1396
Iterating global reduction 1 with 9 rules applied. Total rules applied 20 place count 734 transition count 1396
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 732 transition count 1394
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 732 transition count 1394
Applied a total of 24 rules in 29 ms. Remains 732 /745 variables (removed 13) and now considering 1394/1405 (removed 11) transitions.
Running 1392 sub problems to find dead transitions.
[2024-05-28 01:41:59] [INFO ] Flow matrix only has 1374 transitions (discarded 20 similar events)
// Phase 1: matrix 1374 rows 732 cols
[2024-05-28 01:41:59] [INFO ] Computed 52 invariants in 18 ms
[2024-05-28 01:41:59] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/730 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/730 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1392 unsolved
[2024-05-28 01:42:14] [INFO ] Deduced a trap composed of 126 places in 102 ms of which 3 ms to minimize.
[2024-05-28 01:42:14] [INFO ] Deduced a trap composed of 63 places in 100 ms of which 2 ms to minimize.
[2024-05-28 01:42:14] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-05-28 01:42:14] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 1 ms to minimize.
[2024-05-28 01:42:14] [INFO ] Deduced a trap composed of 66 places in 56 ms of which 2 ms to minimize.
[2024-05-28 01:42:14] [INFO ] Deduced a trap composed of 64 places in 122 ms of which 2 ms to minimize.
[2024-05-28 01:42:14] [INFO ] Deduced a trap composed of 63 places in 80 ms of which 1 ms to minimize.
[2024-05-28 01:42:14] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 1 ms to minimize.
[2024-05-28 01:42:14] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 1 ms to minimize.
[2024-05-28 01:42:15] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 1 ms to minimize.
[2024-05-28 01:42:15] [INFO ] Deduced a trap composed of 465 places in 393 ms of which 6 ms to minimize.
[2024-05-28 01:42:15] [INFO ] Deduced a trap composed of 115 places in 373 ms of which 5 ms to minimize.
[2024-05-28 01:42:16] [INFO ] Deduced a trap composed of 384 places in 336 ms of which 4 ms to minimize.
[2024-05-28 01:42:16] [INFO ] Deduced a trap composed of 426 places in 312 ms of which 4 ms to minimize.
[2024-05-28 01:42:16] [INFO ] Deduced a trap composed of 411 places in 279 ms of which 4 ms to minimize.
[2024-05-28 01:42:17] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-05-28 01:42:18] [INFO ] Deduced a trap composed of 228 places in 398 ms of which 5 ms to minimize.
[2024-05-28 01:42:18] [INFO ] Deduced a trap composed of 31 places in 220 ms of which 4 ms to minimize.
[2024-05-28 01:42:20] [INFO ] Deduced a trap composed of 390 places in 454 ms of which 5 ms to minimize.
[2024-05-28 01:42:20] [INFO ] Deduced a trap composed of 407 places in 386 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/730 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1392 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 730/2106 variables, and 70 constraints, problems are : Problem set: 0 solved, 1392 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/732 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1392/1392 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1392 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/730 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/730 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1392 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/730 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1392 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 730/2106 variables, and 70 constraints, problems are : Problem set: 0 solved, 1392 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/732 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1392 constraints, Known Traps: 20/20 constraints]
After SMT, in 41556ms problems are : Problem set: 0 solved, 1392 unsolved
Search for dead transitions found 0 dead transitions in 41567ms
Finished structural reductions in LTL mode , in 1 iterations and 41600 ms. Remains : 732/745 places, 1394/1405 transitions.
[2024-05-28 01:42:40] [INFO ] Flatten gal took : 75 ms
[2024-05-28 01:42:40] [INFO ] Flatten gal took : 60 ms
[2024-05-28 01:42:40] [INFO ] Input system was already deterministic with 1394 transitions.
[2024-05-28 01:42:41] [INFO ] Flatten gal took : 53 ms
[2024-05-28 01:42:41] [INFO ] Flatten gal took : 54 ms
[2024-05-28 01:42:41] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-28 01:42:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 745 places, 1405 transitions and 6128 arcs took 17 ms.
Total runtime 619513 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-PT-S02J04T10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/418/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 745
TRANSITIONS: 1405
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.037s, Sys 0.008s]


SAVING FILE /home/mcc/execution/418/model (.net / .def) ...
EXPORT TIME: [User 0.006s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1779
MODEL NAME: /home/mcc/execution/418/model
745 places, 1405 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML

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-S02J04T10"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is PolyORBLF-PT-S02J04T10, 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 r289-tajo-171654445500233"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J04T10.tgz
mv PolyORBLF-PT-S02J04T10 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 ;