Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r492-smll-171636266300185.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is EisenbergMcGuire-PT-08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636266300185
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.7M May 18 16:42 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 EisenbergMcGuire-PT-08-CTLCardinality-2024-00
FORMULA_NAME EisenbergMcGuire-PT-08-CTLCardinality-2024-01
FORMULA_NAME EisenbergMcGuire-PT-08-CTLCardinality-2024-02
FORMULA_NAME EisenbergMcGuire-PT-08-CTLCardinality-2024-03
FORMULA_NAME EisenbergMcGuire-PT-08-CTLCardinality-2024-04
FORMULA_NAME EisenbergMcGuire-PT-08-CTLCardinality-2024-05
FORMULA_NAME EisenbergMcGuire-PT-08-CTLCardinality-2024-06
FORMULA_NAME EisenbergMcGuire-PT-08-CTLCardinality-2024-07
FORMULA_NAME EisenbergMcGuire-PT-08-CTLCardinality-2024-08
FORMULA_NAME EisenbergMcGuire-PT-08-CTLCardinality-2024-09
FORMULA_NAME EisenbergMcGuire-PT-08-CTLCardinality-2024-10
FORMULA_NAME EisenbergMcGuire-PT-08-CTLCardinality-2024-11
FORMULA_NAME EisenbergMcGuire-PT-08-CTLCardinality-2023-12
FORMULA_NAME EisenbergMcGuire-PT-08-CTLCardinality-2023-13
FORMULA_NAME EisenbergMcGuire-PT-08-CTLCardinality-2023-14
FORMULA_NAME EisenbergMcGuire-PT-08-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717228882746

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:01:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 08:01:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:01:25] [INFO ] Load time of PNML (sax parser for PT used): 428 ms
[2024-06-01 08:01:25] [INFO ] Transformed 712 places.
[2024-06-01 08:01:25] [INFO ] Transformed 2816 transitions.
[2024-06-01 08:01:25] [INFO ] Found NUPN structural information;
[2024-06-01 08:01:25] [INFO ] Parsed PT model containing 712 places and 2816 transitions and 13440 arcs in 696 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 27 ms.
FORMULA EisenbergMcGuire-PT-08-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 97 out of 712 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 712/712 places, 2816/2816 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 662 transition count 2416
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 662 transition count 2416
Applied a total of 100 rules in 186 ms. Remains 662 /712 variables (removed 50) and now considering 2416/2816 (removed 400) transitions.
[2024-06-01 08:01:26] [INFO ] Flow matrix only has 968 transitions (discarded 1448 similar events)
// Phase 1: matrix 968 rows 662 cols
[2024-06-01 08:01:26] [INFO ] Computed 25 invariants in 47 ms
[2024-06-01 08:01:27] [INFO ] Implicit Places using invariants in 1486 ms returned []
[2024-06-01 08:01:27] [INFO ] Flow matrix only has 968 transitions (discarded 1448 similar events)
[2024-06-01 08:01:27] [INFO ] Invariant cache hit.
[2024-06-01 08:01:28] [INFO ] State equation strengthened by 326 read => feed constraints.
[2024-06-01 08:01:33] [INFO ] Implicit Places using invariants and state equation in 5600 ms returned []
Implicit Place search using SMT with State Equation took 7138 ms to find 0 implicit places.
Running 2408 sub problems to find dead transitions.
[2024-06-01 08:01:33] [INFO ] Flow matrix only has 968 transitions (discarded 1448 similar events)
[2024-06-01 08:01:33] [INFO ] Invariant cache hit.
[2024-06-01 08:01:33] [INFO ] State equation strengthened by 326 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2408 unsolved
SMT process timed out in 32619ms, After SMT, problems are : Problem set: 0 solved, 2408 unsolved
Search for dead transitions found 0 dead transitions in 32726ms
Starting structural reductions in LTL mode, iteration 1 : 662/712 places, 2416/2816 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40122 ms. Remains : 662/712 places, 2416/2816 transitions.
Support contains 97 out of 662 places after structural reductions.
[2024-06-01 08:02:07] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 08:02:07] [INFO ] Flatten gal took : 352 ms
FORMULA EisenbergMcGuire-PT-08-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 08:02:07] [INFO ] Flatten gal took : 187 ms
[2024-06-01 08:02:07] [INFO ] Input system was already deterministic with 2416 transitions.
Support contains 95 out of 662 places (down from 97) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2415 ms. (16 steps per ms) remains 23/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
[2024-06-01 08:02:08] [INFO ] Flow matrix only has 968 transitions (discarded 1448 similar events)
[2024-06-01 08:02:08] [INFO ] Invariant cache hit.
[2024-06-01 08:02:08] [INFO ] State equation strengthened by 326 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 595/638 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/638 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 1/639 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/639 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 15/654 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/654 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 968/1622 variables, 654/678 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1622 variables, 326/1004 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1622 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (OVERLAPS) 8/1630 variables, 8/1012 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1630 variables, 1/1013 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1630/1630 variables, and 1013 constraints, problems are : Problem set: 0 solved, 23 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 662/662 constraints, ReadFeed: 326/326 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 595/638 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 08:02:14] [INFO ] Deduced a trap composed of 3 places in 200 ms of which 22 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/638 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/638 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 1/639 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/639 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 15/654 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 08:02:17] [INFO ] Deduced a trap composed of 53 places in 565 ms of which 12 ms to minimize.
[2024-06-01 08:02:18] [INFO ] Deduced a trap composed of 35 places in 583 ms of which 8 ms to minimize.
[2024-06-01 08:02:18] [INFO ] Deduced a trap composed of 3 places in 485 ms of which 7 ms to minimize.
[2024-06-01 08:02:19] [INFO ] Deduced a trap composed of 63 places in 560 ms of which 6 ms to minimize.
SMT process timed out in 10363ms, After SMT, problems are : Problem set: 0 solved, 23 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 43 out of 662 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 662/662 places, 2416/2416 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 662 transition count 2410
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 656 transition count 2410
Performed 176 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 176 Pre rules applied. Total rules applied 12 place count 656 transition count 2234
Deduced a syphon composed of 176 places in 4 ms
Reduce places removed 176 places and 0 transitions.
Iterating global reduction 2 with 352 rules applied. Total rules applied 364 place count 480 transition count 2234
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 369 place count 475 transition count 2194
Iterating global reduction 2 with 5 rules applied. Total rules applied 374 place count 475 transition count 2194
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 7 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 472 place count 426 transition count 2145
Applied a total of 472 rules in 514 ms. Remains 426 /662 variables (removed 236) and now considering 2145/2416 (removed 271) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 515 ms. Remains : 426/662 places, 2145/2416 transitions.
RANDOM walk for 40000 steps (8 resets) in 1015 ms. (39 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 134856 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :17 out of 23
Probabilistic random walk after 134856 steps, saw 87498 distinct states, run finished after 3006 ms. (steps per millisecond=44 ) properties seen :17
[2024-06-01 08:02:23] [INFO ] Flow matrix only has 697 transitions (discarded 1448 similar events)
// Phase 1: matrix 697 rows 426 cols
[2024-06-01 08:02:23] [INFO ] Computed 25 invariants in 4 ms
[2024-06-01 08:02:23] [INFO ] State equation strengthened by 291 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 336/352 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/354 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 12/366 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 611/977 variables, 366/387 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/977 variables, 140/527 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/977 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 22/999 variables, 8/535 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/999 variables, 1/536 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/999 variables, 75/611 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/999 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 22/1021 variables, 10/621 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1021 variables, 10/631 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1021 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 40/1061 variables, 2/633 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1061 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 2/1063 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1063 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 60/1123 variables, 42/676 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1123 variables, 66/742 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1123 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 0/1123 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1123/1123 variables, and 742 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2013 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 426/426 constraints, ReadFeed: 291/291 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/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 336/352 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 08:02:25] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2/354 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 12/366 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 08:02:26] [INFO ] Deduced a trap composed of 24 places in 273 ms of which 3 ms to minimize.
[2024-06-01 08:02:26] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 5 ms to minimize.
[2024-06-01 08:02:26] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 2 ms to minimize.
[2024-06-01 08:02:26] [INFO ] Deduced a trap composed of 41 places in 166 ms of which 2 ms to minimize.
[2024-06-01 08:02:26] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2024-06-01 08:02:26] [INFO ] Deduced a trap composed of 61 places in 168 ms of which 2 ms to minimize.
[2024-06-01 08:02:27] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 2 ms to minimize.
[2024-06-01 08:02:27] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 2 ms to minimize.
[2024-06-01 08:02:27] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 2 ms to minimize.
[2024-06-01 08:02:27] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-06-01 08:02:27] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 1 ms to minimize.
[2024-06-01 08:02:27] [INFO ] Deduced a trap composed of 21 places in 181 ms of which 2 ms to minimize.
[2024-06-01 08:02:27] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 2 ms to minimize.
Problem AtomicPropp25 is UNSAT
[2024-06-01 08:02:28] [INFO ] Deduced a trap composed of 25 places in 332 ms of which 4 ms to minimize.
[2024-06-01 08:02:28] [INFO ] Deduced a trap composed of 31 places in 261 ms of which 4 ms to minimize.
[2024-06-01 08:02:28] [INFO ] Deduced a trap composed of 32 places in 283 ms of which 4 ms to minimize.
[2024-06-01 08:02:29] [INFO ] Deduced a trap composed of 46 places in 223 ms of which 3 ms to minimize.
[2024-06-01 08:02:29] [INFO ] Deduced a trap composed of 75 places in 213 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 18/40 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 08:02:29] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 1/41 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 611/977 variables, 366/407 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/977 variables, 140/547 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/977 variables, 1/548 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/977 variables, 0/548 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 22/999 variables, 8/556 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/999 variables, 1/557 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/999 variables, 75/632 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/999 variables, 1/633 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/999 variables, 0/633 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 22/1021 variables, 10/643 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1021 variables, 10/653 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 08:02:31] [INFO ] Deduced a trap composed of 61 places in 181 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1021 variables, 1/654 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1021 variables, 0/654 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 40/1061 variables, 2/656 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 08:02:32] [INFO ] Deduced a trap composed of 91 places in 574 ms of which 6 ms to minimize.
[2024-06-01 08:02:32] [INFO ] Deduced a trap composed of 82 places in 594 ms of which 6 ms to minimize.
[2024-06-01 08:02:33] [INFO ] Deduced a trap composed of 77 places in 571 ms of which 6 ms to minimize.
[2024-06-01 08:02:34] [INFO ] Deduced a trap composed of 68 places in 568 ms of which 6 ms to minimize.
[2024-06-01 08:02:34] [INFO ] Deduced a trap composed of 77 places in 618 ms of which 7 ms to minimize.
[2024-06-01 08:02:35] [INFO ] Deduced a trap composed of 98 places in 648 ms of which 8 ms to minimize.
[2024-06-01 08:02:36] [INFO ] Deduced a trap composed of 64 places in 569 ms of which 6 ms to minimize.
[2024-06-01 08:02:36] [INFO ] Deduced a trap composed of 102 places in 526 ms of which 6 ms to minimize.
[2024-06-01 08:02:37] [INFO ] Deduced a trap composed of 88 places in 489 ms of which 15 ms to minimize.
[2024-06-01 08:02:37] [INFO ] Deduced a trap composed of 106 places in 420 ms of which 5 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1061 variables, 10/666 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1061 variables, 0/666 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 26 (OVERLAPS) 2/1063 variables, 1/667 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1063 variables, 3/670 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1063 variables, 0/670 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 29 (OVERLAPS) 60/1123 variables, 42/712 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1123 variables, 66/778 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 08:02:39] [INFO ] Deduced a trap composed of 86 places in 497 ms of which 5 ms to minimize.
[2024-06-01 08:02:40] [INFO ] Deduced a trap composed of 109 places in 457 ms of which 5 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/1123 variables, 2/780 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1123 variables, 0/780 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 33 (OVERLAPS) 0/1123 variables, 0/780 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1123/1123 variables, and 780 constraints, problems are : Problem set: 1 solved, 5 unsolved in 16066 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 426/426 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 33/33 constraints]
After SMT, in 18119ms problems are : Problem set: 1 solved, 5 unsolved
Parikh walk visited 0 properties in 2779 ms.
Support contains 14 out of 426 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 426/426 places, 2145/2145 transitions.
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 19 Pre rules applied. Total rules applied 0 place count 426 transition count 2126
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 407 transition count 2126
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 406 transition count 2118
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 406 transition count 2118
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 403 transition count 2115
Applied a total of 46 rules in 142 ms. Remains 403 /426 variables (removed 23) and now considering 2115/2145 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 403/426 places, 2115/2145 transitions.
RANDOM walk for 40000 steps (8 resets) in 318 ms. (125 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 157221 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :0 out of 5
Probabilistic random walk after 157221 steps, saw 97352 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
[2024-06-01 08:02:47] [INFO ] Flow matrix only has 667 transitions (discarded 1448 similar events)
// Phase 1: matrix 667 rows 403 cols
[2024-06-01 08:02:47] [INFO ] Computed 25 invariants in 11 ms
[2024-06-01 08:02:47] [INFO ] State equation strengthened by 284 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, 5 unsolved
At refinement iteration 1 (OVERLAPS) 317/331 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3/334 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 13/347 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 585/932 variables, 347/368 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/932 variables, 140/508 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/932 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 22/954 variables, 8/516 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/954 variables, 1/517 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/954 variables, 68/585 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/954 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 22/976 variables, 10/595 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/976 variables, 10/605 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/976 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 36/1012 variables, 2/607 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1012 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 2/1014 variables, 1/608 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1014 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 56/1070 variables, 38/646 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1070 variables, 66/712 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1070 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 0/1070 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1070/1070 variables, and 712 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1518 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 403/403 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 317/331 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 08:02:49] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 3/334 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 13/347 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 08:02:50] [INFO ] Deduced a trap composed of 15 places in 435 ms of which 6 ms to minimize.
[2024-06-01 08:02:50] [INFO ] Deduced a trap composed of 62 places in 356 ms of which 5 ms to minimize.
[2024-06-01 08:02:50] [INFO ] Deduced a trap composed of 24 places in 209 ms of which 2 ms to minimize.
[2024-06-01 08:02:50] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 2 ms to minimize.
[2024-06-01 08:02:51] [INFO ] Deduced a trap composed of 23 places in 270 ms of which 4 ms to minimize.
[2024-06-01 08:02:51] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 2 ms to minimize.
[2024-06-01 08:02:51] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 2 ms to minimize.
[2024-06-01 08:02:51] [INFO ] Deduced a trap composed of 35 places in 213 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 08:02:51] [INFO ] Deduced a trap composed of 50 places in 147 ms of which 2 ms to minimize.
[2024-06-01 08:02:52] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 08:02:52] [INFO ] Deduced a trap composed of 36 places in 202 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 585/932 variables, 347/380 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/932 variables, 140/520 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/932 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/932 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 22/954 variables, 8/529 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/954 variables, 1/530 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/954 variables, 68/598 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/954 variables, 1/599 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 08:02:53] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/954 variables, 1/600 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/954 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 22/976 variables, 10/610 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/976 variables, 10/620 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/976 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 36/1012 variables, 2/622 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 08:02:54] [INFO ] Deduced a trap composed of 66 places in 319 ms of which 4 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1012 variables, 1/623 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 08:02:55] [INFO ] Deduced a trap composed of 79 places in 391 ms of which 5 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1012 variables, 1/624 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 08:02:55] [INFO ] Deduced a trap composed of 89 places in 513 ms of which 6 ms to minimize.
[2024-06-01 08:02:56] [INFO ] Deduced a trap composed of 79 places in 599 ms of which 6 ms to minimize.
[2024-06-01 08:02:57] [INFO ] Deduced a trap composed of 71 places in 540 ms of which 5 ms to minimize.
[2024-06-01 08:02:57] [INFO ] Deduced a trap composed of 105 places in 526 ms of which 6 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1012 variables, 4/628 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1012 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (OVERLAPS) 2/1014 variables, 1/629 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1014 variables, 3/632 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 08:02:58] [INFO ] Deduced a trap composed of 80 places in 507 ms of which 5 ms to minimize.
[2024-06-01 08:02:59] [INFO ] Deduced a trap composed of 75 places in 447 ms of which 6 ms to minimize.
[2024-06-01 08:02:59] [INFO ] Deduced a trap composed of 68 places in 413 ms of which 5 ms to minimize.
[2024-06-01 08:03:00] [INFO ] Deduced a trap composed of 103 places in 342 ms of which 4 ms to minimize.
[2024-06-01 08:03:00] [INFO ] Deduced a trap composed of 107 places in 463 ms of which 5 ms to minimize.
[2024-06-01 08:03:00] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 2 ms to minimize.
[2024-06-01 08:03:00] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2024-06-01 08:03:01] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 2 ms to minimize.
[2024-06-01 08:03:01] [INFO ] Deduced a trap composed of 95 places in 479 ms of which 5 ms to minimize.
[2024-06-01 08:03:01] [INFO ] Deduced a trap composed of 27 places in 192 ms of which 2 ms to minimize.
[2024-06-01 08:03:02] [INFO ] Deduced a trap composed of 106 places in 615 ms of which 7 ms to minimize.
[2024-06-01 08:03:03] [INFO ] Deduced a trap composed of 60 places in 578 ms of which 6 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/1014 variables, 12/644 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 08:03:04] [INFO ] Deduced a trap composed of 66 places in 468 ms of which 5 ms to minimize.
[2024-06-01 08:03:04] [INFO ] Deduced a trap composed of 79 places in 430 ms of which 5 ms to minimize.
[2024-06-01 08:03:05] [INFO ] Deduced a trap composed of 71 places in 567 ms of which 6 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/1014 variables, 3/647 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1014 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 34 (OVERLAPS) 56/1070 variables, 38/685 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1070 variables, 66/751 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1070 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (OVERLAPS) 0/1070 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1070/1070 variables, and 751 constraints, problems are : Problem set: 0 solved, 5 unsolved in 18397 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 403/403 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 34/34 constraints]
After SMT, in 19952ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 2631 ms.
Support contains 14 out of 403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 2115/2115 transitions.
Applied a total of 0 rules in 75 ms. Remains 403 /403 variables (removed 0) and now considering 2115/2115 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 403/403 places, 2115/2115 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 2115/2115 transitions.
Applied a total of 0 rules in 87 ms. Remains 403 /403 variables (removed 0) and now considering 2115/2115 (removed 0) transitions.
[2024-06-01 08:03:10] [INFO ] Flow matrix only has 667 transitions (discarded 1448 similar events)
[2024-06-01 08:03:10] [INFO ] Invariant cache hit.
[2024-06-01 08:03:11] [INFO ] Implicit Places using invariants in 747 ms returned []
[2024-06-01 08:03:11] [INFO ] Flow matrix only has 667 transitions (discarded 1448 similar events)
[2024-06-01 08:03:11] [INFO ] Invariant cache hit.
[2024-06-01 08:03:11] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-06-01 08:03:14] [INFO ] Implicit Places using invariants and state equation in 3201 ms returned []
Implicit Place search using SMT with State Equation took 3952 ms to find 0 implicit places.
[2024-06-01 08:03:14] [INFO ] Redundant transitions in 206 ms returned []
Running 2107 sub problems to find dead transitions.
[2024-06-01 08:03:14] [INFO ] Flow matrix only has 667 transitions (discarded 1448 similar events)
[2024-06-01 08:03:14] [INFO ] Invariant cache hit.
[2024-06-01 08:03:14] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2107 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 403/1070 variables, and 25 constraints, problems are : Problem set: 0 solved, 2107 unsolved in 30093 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/403 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2107/2107 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2107 unsolved
[2024-06-01 08:03:49] [INFO ] Deduced a trap composed of 3 places in 434 ms of which 6 ms to minimize.
[2024-06-01 08:03:50] [INFO ] Deduced a trap composed of 3 places in 620 ms of which 6 ms to minimize.
[2024-06-01 08:03:50] [INFO ] Deduced a trap composed of 27 places in 208 ms of which 3 ms to minimize.
[2024-06-01 08:03:50] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 2 ms to minimize.
[2024-06-01 08:03:51] [INFO ] Deduced a trap composed of 46 places in 237 ms of which 3 ms to minimize.
[2024-06-01 08:03:51] [INFO ] Deduced a trap composed of 19 places in 214 ms of which 3 ms to minimize.
[2024-06-01 08:03:51] [INFO ] Deduced a trap composed of 97 places in 478 ms of which 4 ms to minimize.
[2024-06-01 08:03:53] [INFO ] Deduced a trap composed of 25 places in 145 ms of which 2 ms to minimize.
[2024-06-01 08:03:53] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 2 ms to minimize.
[2024-06-01 08:03:54] [INFO ] Deduced a trap composed of 11 places in 372 ms of which 5 ms to minimize.
[2024-06-01 08:03:55] [INFO ] Deduced a trap composed of 64 places in 420 ms of which 5 ms to minimize.
[2024-06-01 08:03:55] [INFO ] Deduced a trap composed of 53 places in 395 ms of which 6 ms to minimize.
[2024-06-01 08:03:56] [INFO ] Deduced a trap composed of 45 places in 430 ms of which 6 ms to minimize.
[2024-06-01 08:03:56] [INFO ] Deduced a trap composed of 43 places in 451 ms of which 5 ms to minimize.
[2024-06-01 08:03:57] [INFO ] Deduced a trap composed of 43 places in 413 ms of which 5 ms to minimize.
[2024-06-01 08:03:57] [INFO ] Deduced a trap composed of 44 places in 400 ms of which 5 ms to minimize.
[2024-06-01 08:03:58] [INFO ] Deduced a trap composed of 80 places in 448 ms of which 5 ms to minimize.
[2024-06-01 08:03:58] [INFO ] Deduced a trap composed of 50 places in 403 ms of which 5 ms to minimize.
[2024-06-01 08:03:59] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 2 ms to minimize.
[2024-06-01 08:03:59] [INFO ] Deduced a trap composed of 82 places in 446 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2107 unsolved
[2024-06-01 08:04:01] [INFO ] Deduced a trap composed of 66 places in 461 ms of which 5 ms to minimize.
[2024-06-01 08:04:01] [INFO ] Deduced a trap composed of 85 places in 368 ms of which 5 ms to minimize.
[2024-06-01 08:04:02] [INFO ] Deduced a trap composed of 86 places in 394 ms of which 5 ms to minimize.
[2024-06-01 08:04:11] [INFO ] Deduced a trap composed of 76 places in 226 ms of which 3 ms to minimize.
[2024-06-01 08:04:11] [INFO ] Deduced a trap composed of 62 places in 442 ms of which 5 ms to minimize.
[2024-06-01 08:04:12] [INFO ] Deduced a trap composed of 65 places in 473 ms of which 6 ms to minimize.
[2024-06-01 08:04:12] [INFO ] Deduced a trap composed of 53 places in 466 ms of which 6 ms to minimize.
[2024-06-01 08:04:13] [INFO ] Deduced a trap composed of 87 places in 485 ms of which 6 ms to minimize.
[2024-06-01 08:04:14] [INFO ] Deduced a trap composed of 83 places in 506 ms of which 6 ms to minimize.
[2024-06-01 08:04:14] [INFO ] Deduced a trap composed of 68 places in 535 ms of which 6 ms to minimize.
[2024-06-01 08:04:15] [INFO ] Deduced a trap composed of 71 places in 464 ms of which 5 ms to minimize.
[2024-06-01 08:04:15] [INFO ] Deduced a trap composed of 25 places in 424 ms of which 5 ms to minimize.
[2024-06-01 08:04:16] [INFO ] Deduced a trap composed of 69 places in 488 ms of which 5 ms to minimize.
[2024-06-01 08:04:16] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 403/1070 variables, and 59 constraints, problems are : Problem set: 0 solved, 2107 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/403 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 0/2107 constraints, Known Traps: 34/34 constraints]
After SMT, in 61850ms problems are : Problem set: 0 solved, 2107 unsolved
Search for dead transitions found 0 dead transitions in 61912ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66173 ms. Remains : 403/403 places, 2115/2115 transitions.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2024-06-01 08:04:16] [INFO ] Flatten gal took : 150 ms
[2024-06-01 08:04:16] [INFO ] Flatten gal took : 166 ms
[2024-06-01 08:04:17] [INFO ] Input system was already deterministic with 2416 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 662/662 places, 2416/2416 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 656 transition count 2368
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 656 transition count 2368
Applied a total of 12 rules in 32 ms. Remains 656 /662 variables (removed 6) and now considering 2368/2416 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 656/662 places, 2368/2416 transitions.
[2024-06-01 08:04:17] [INFO ] Flatten gal took : 76 ms
[2024-06-01 08:04:17] [INFO ] Flatten gal took : 85 ms
[2024-06-01 08:04:17] [INFO ] Input system was already deterministic with 2368 transitions.
Starting structural reductions in LTL mode, iteration 0 : 662/662 places, 2416/2416 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 659 transition count 2392
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 659 transition count 2392
Applied a total of 6 rules in 61 ms. Remains 659 /662 variables (removed 3) and now considering 2392/2416 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62 ms. Remains : 659/662 places, 2392/2416 transitions.
[2024-06-01 08:04:17] [INFO ] Flatten gal took : 101 ms
[2024-06-01 08:04:17] [INFO ] Flatten gal took : 109 ms
[2024-06-01 08:04:18] [INFO ] Input system was already deterministic with 2392 transitions.
Starting structural reductions in LTL mode, iteration 0 : 662/662 places, 2416/2416 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 656 transition count 2368
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 656 transition count 2368
Applied a total of 12 rules in 32 ms. Remains 656 /662 variables (removed 6) and now considering 2368/2416 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 656/662 places, 2368/2416 transitions.
[2024-06-01 08:04:18] [INFO ] Flatten gal took : 66 ms
[2024-06-01 08:04:18] [INFO ] Flatten gal took : 68 ms
[2024-06-01 08:04:18] [INFO ] Input system was already deterministic with 2368 transitions.
Starting structural reductions in LTL mode, iteration 0 : 662/662 places, 2416/2416 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 656 transition count 2368
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 656 transition count 2368
Applied a total of 12 rules in 31 ms. Remains 656 /662 variables (removed 6) and now considering 2368/2416 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 656/662 places, 2368/2416 transitions.
[2024-06-01 08:04:18] [INFO ] Flatten gal took : 55 ms
[2024-06-01 08:04:18] [INFO ] Flatten gal took : 64 ms
[2024-06-01 08:04:18] [INFO ] Input system was already deterministic with 2368 transitions.
Starting structural reductions in LTL mode, iteration 0 : 662/662 places, 2416/2416 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 658 transition count 2384
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 658 transition count 2384
Applied a total of 8 rules in 32 ms. Remains 658 /662 variables (removed 4) and now considering 2384/2416 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 658/662 places, 2384/2416 transitions.
[2024-06-01 08:04:18] [INFO ] Flatten gal took : 56 ms
[2024-06-01 08:04:19] [INFO ] Flatten gal took : 66 ms
[2024-06-01 08:04:19] [INFO ] Input system was already deterministic with 2384 transitions.
Starting structural reductions in LTL mode, iteration 0 : 662/662 places, 2416/2416 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 656 transition count 2368
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 656 transition count 2368
Applied a total of 12 rules in 29 ms. Remains 656 /662 variables (removed 6) and now considering 2368/2416 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 656/662 places, 2368/2416 transitions.
[2024-06-01 08:04:19] [INFO ] Flatten gal took : 54 ms
[2024-06-01 08:04:19] [INFO ] Flatten gal took : 64 ms
[2024-06-01 08:04:19] [INFO ] Input system was already deterministic with 2368 transitions.
Starting structural reductions in LTL mode, iteration 0 : 662/662 places, 2416/2416 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 656 transition count 2368
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 656 transition count 2368
Applied a total of 12 rules in 30 ms. Remains 656 /662 variables (removed 6) and now considering 2368/2416 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 656/662 places, 2368/2416 transitions.
[2024-06-01 08:04:19] [INFO ] Flatten gal took : 53 ms
[2024-06-01 08:04:19] [INFO ] Flatten gal took : 63 ms
[2024-06-01 08:04:19] [INFO ] Input system was already deterministic with 2368 transitions.
Starting structural reductions in LTL mode, iteration 0 : 662/662 places, 2416/2416 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 656 transition count 2368
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 656 transition count 2368
Applied a total of 12 rules in 27 ms. Remains 656 /662 variables (removed 6) and now considering 2368/2416 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 656/662 places, 2368/2416 transitions.
[2024-06-01 08:04:19] [INFO ] Flatten gal took : 51 ms
[2024-06-01 08:04:19] [INFO ] Flatten gal took : 62 ms
[2024-06-01 08:04:20] [INFO ] Input system was already deterministic with 2368 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 662/662 places, 2416/2416 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 662 transition count 2408
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 654 transition count 2408
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 654 transition count 2208
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 454 transition count 2208
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 422 place count 448 transition count 2160
Iterating global reduction 2 with 6 rules applied. Total rules applied 428 place count 448 transition count 2160
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 3 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 110 rules applied. Total rules applied 538 place count 393 transition count 2105
Applied a total of 538 rules in 224 ms. Remains 393 /662 variables (removed 269) and now considering 2105/2416 (removed 311) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 225 ms. Remains : 393/662 places, 2105/2416 transitions.
[2024-06-01 08:04:20] [INFO ] Flatten gal took : 52 ms
[2024-06-01 08:04:20] [INFO ] Flatten gal took : 61 ms
[2024-06-01 08:04:20] [INFO ] Input system was already deterministic with 2105 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 662/662 places, 2416/2416 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 662 transition count 2408
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 654 transition count 2408
Performed 197 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 197 Pre rules applied. Total rules applied 16 place count 654 transition count 2211
Deduced a syphon composed of 197 places in 2 ms
Reduce places removed 197 places and 0 transitions.
Iterating global reduction 2 with 394 rules applied. Total rules applied 410 place count 457 transition count 2211
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 415 place count 452 transition count 2171
Iterating global reduction 2 with 5 rules applied. Total rules applied 420 place count 452 transition count 2171
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 532 place count 396 transition count 2115
Applied a total of 532 rules in 184 ms. Remains 396 /662 variables (removed 266) and now considering 2115/2416 (removed 301) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 184 ms. Remains : 396/662 places, 2115/2416 transitions.
[2024-06-01 08:04:20] [INFO ] Flatten gal took : 46 ms
[2024-06-01 08:04:20] [INFO ] Flatten gal took : 55 ms
[2024-06-01 08:04:20] [INFO ] Input system was already deterministic with 2115 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 662/662 places, 2416/2416 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 662 transition count 2408
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 654 transition count 2408
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 654 transition count 2208
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 454 transition count 2208
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 422 place count 448 transition count 2160
Iterating global reduction 2 with 6 rules applied. Total rules applied 428 place count 448 transition count 2160
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 540 place count 392 transition count 2104
Applied a total of 540 rules in 142 ms. Remains 392 /662 variables (removed 270) and now considering 2104/2416 (removed 312) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 142 ms. Remains : 392/662 places, 2104/2416 transitions.
[2024-06-01 08:04:21] [INFO ] Flatten gal took : 74 ms
[2024-06-01 08:04:21] [INFO ] Flatten gal took : 51 ms
[2024-06-01 08:04:21] [INFO ] Input system was already deterministic with 2104 transitions.
Starting structural reductions in LTL mode, iteration 0 : 662/662 places, 2416/2416 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 656 transition count 2368
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 656 transition count 2368
Applied a total of 12 rules in 40 ms. Remains 656 /662 variables (removed 6) and now considering 2368/2416 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 656/662 places, 2368/2416 transitions.
[2024-06-01 08:04:21] [INFO ] Flatten gal took : 77 ms
[2024-06-01 08:04:21] [INFO ] Flatten gal took : 91 ms
[2024-06-01 08:04:21] [INFO ] Input system was already deterministic with 2368 transitions.
Starting structural reductions in LTL mode, iteration 0 : 662/662 places, 2416/2416 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 656 transition count 2368
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 656 transition count 2368
Applied a total of 12 rules in 28 ms. Remains 656 /662 variables (removed 6) and now considering 2368/2416 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 656/662 places, 2368/2416 transitions.
[2024-06-01 08:04:21] [INFO ] Flatten gal took : 50 ms
[2024-06-01 08:04:21] [INFO ] Flatten gal took : 60 ms
[2024-06-01 08:04:21] [INFO ] Input system was already deterministic with 2368 transitions.
Starting structural reductions in LTL mode, iteration 0 : 662/662 places, 2416/2416 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 656 transition count 2368
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 656 transition count 2368
Applied a total of 12 rules in 58 ms. Remains 656 /662 variables (removed 6) and now considering 2368/2416 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58 ms. Remains : 656/662 places, 2368/2416 transitions.
[2024-06-01 08:04:22] [INFO ] Flatten gal took : 50 ms
[2024-06-01 08:04:22] [INFO ] Flatten gal took : 60 ms
[2024-06-01 08:04:22] [INFO ] Input system was already deterministic with 2368 transitions.
[2024-06-01 08:04:22] [INFO ] Flatten gal took : 59 ms
[2024-06-01 08:04:22] [INFO ] Flatten gal took : 63 ms
[2024-06-01 08:04:22] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 5 ms.
[2024-06-01 08:04:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 662 places, 2416 transitions and 11840 arcs took 19 ms.
Total runtime 177381 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : EisenbergMcGuire-PT-08-CTLCardinality-2024-00
Could not compute solution for formula : EisenbergMcGuire-PT-08-CTLCardinality-2024-02
Could not compute solution for formula : EisenbergMcGuire-PT-08-CTLCardinality-2024-03
Could not compute solution for formula : EisenbergMcGuire-PT-08-CTLCardinality-2024-04
Could not compute solution for formula : EisenbergMcGuire-PT-08-CTLCardinality-2024-05
Could not compute solution for formula : EisenbergMcGuire-PT-08-CTLCardinality-2024-06
Could not compute solution for formula : EisenbergMcGuire-PT-08-CTLCardinality-2024-07
Could not compute solution for formula : EisenbergMcGuire-PT-08-CTLCardinality-2024-08
Could not compute solution for formula : EisenbergMcGuire-PT-08-CTLCardinality-2024-09
Could not compute solution for formula : EisenbergMcGuire-PT-08-CTLCardinality-2024-10
Could not compute solution for formula : EisenbergMcGuire-PT-08-CTLCardinality-2023-12
Could not compute solution for formula : EisenbergMcGuire-PT-08-CTLCardinality-2023-13
Could not compute solution for formula : EisenbergMcGuire-PT-08-CTLCardinality-2023-14
Could not compute solution for formula : EisenbergMcGuire-PT-08-CTLCardinality-2023-15

BK_STOP 1717229062965

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name EisenbergMcGuire-PT-08-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/882/ctl_0_
ctl formula name EisenbergMcGuire-PT-08-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/882/ctl_1_
ctl formula name EisenbergMcGuire-PT-08-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/882/ctl_2_
ctl formula name EisenbergMcGuire-PT-08-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/882/ctl_3_
ctl formula name EisenbergMcGuire-PT-08-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/882/ctl_4_
ctl formula name EisenbergMcGuire-PT-08-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/882/ctl_5_
ctl formula name EisenbergMcGuire-PT-08-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/882/ctl_6_
ctl formula name EisenbergMcGuire-PT-08-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/882/ctl_7_
ctl formula name EisenbergMcGuire-PT-08-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/882/ctl_8_
ctl formula name EisenbergMcGuire-PT-08-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/882/ctl_9_
ctl formula name EisenbergMcGuire-PT-08-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/882/ctl_10_
ctl formula name EisenbergMcGuire-PT-08-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/882/ctl_11_
ctl formula name EisenbergMcGuire-PT-08-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/882/ctl_12_
ctl formula name EisenbergMcGuire-PT-08-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/882/ctl_13_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is EisenbergMcGuire-PT-08, 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 r492-smll-171636266300185"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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