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.r553-tall-171734901200217.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 FireWire-PT-07, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901200217
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 8.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 8.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 97K Jun 2 16:33 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 FireWire-PT-07-CTLCardinality-2024-00
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-01
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-02
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-03
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-04
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-05
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-06
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-07
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-08
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-09
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-10
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-11
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-12
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-13
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-14
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717354313206

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:51:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 18:51:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:51:54] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2024-06-02 18:51:54] [INFO ] Transformed 126 places.
[2024-06-02 18:51:54] [INFO ] Transformed 396 transitions.
[2024-06-02 18:51:54] [INFO ] Found NUPN structural information;
[2024-06-02 18:51:54] [INFO ] Parsed PT model containing 126 places and 396 transitions and 1471 arcs in 179 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FireWire-PT-07-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-07-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-07-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 100 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 343/343 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 126 transition count 337
Applied a total of 6 rules in 21 ms. Remains 126 /126 variables (removed 0) and now considering 337/343 (removed 6) transitions.
[2024-06-02 18:51:54] [INFO ] Flow matrix only has 311 transitions (discarded 26 similar events)
// Phase 1: matrix 311 rows 126 cols
[2024-06-02 18:51:54] [INFO ] Computed 8 invariants in 19 ms
[2024-06-02 18:51:54] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-06-02 18:51:54] [INFO ] Flow matrix only has 311 transitions (discarded 26 similar events)
[2024-06-02 18:51:54] [INFO ] Invariant cache hit.
[2024-06-02 18:51:55] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 18:51:55] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
Running 336 sub problems to find dead transitions.
[2024-06-02 18:51:55] [INFO ] Flow matrix only has 311 transitions (discarded 26 similar events)
[2024-06-02 18:51:55] [INFO ] Invariant cache hit.
[2024-06-02 18:51:55] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 8/133 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-02 18:51:58] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 14 ms to minimize.
[2024-06-02 18:51:58] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 4 ms to minimize.
[2024-06-02 18:51:59] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 2 ms to minimize.
[2024-06-02 18:51:59] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
[2024-06-02 18:51:59] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 1 ms to minimize.
[2024-06-02 18:52:00] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-06-02 18:52:00] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:52:00] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2024-06-02 18:52:00] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 9/143 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 6 (OVERLAPS) 310/436 variables, 126/269 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 44/313 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 9 (OVERLAPS) 1/437 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/437 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 11 (OVERLAPS) 0/437 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 336 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 314 constraints, problems are : Problem set: 0 solved, 336 unsolved in 14844 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 336 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 8/133 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 9/143 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 6 (OVERLAPS) 310/436 variables, 126/269 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 44/313 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 336/649 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 10 (OVERLAPS) 1/437 variables, 1/650 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/437 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 336 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 437/437 variables, and 650 constraints, problems are : Problem set: 0 solved, 336 unsolved in 30042 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 9/9 constraints]
After SMT, in 45253ms problems are : Problem set: 0 solved, 336 unsolved
Search for dead transitions found 0 dead transitions in 45269ms
Starting structural reductions in LTL mode, iteration 1 : 126/126 places, 337/343 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45754 ms. Remains : 126/126 places, 337/343 transitions.
Support contains 100 out of 126 places after structural reductions.
[2024-06-02 18:52:40] [INFO ] Flatten gal took : 57 ms
[2024-06-02 18:52:40] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA FireWire-PT-07-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-07-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:52:40] [INFO ] Flatten gal took : 26 ms
[2024-06-02 18:52:40] [INFO ] Input system was already deterministic with 337 transitions.
Support contains 94 out of 126 places (down from 100) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 81 to 78
RANDOM walk for 40000 steps (2246 resets) in 2052 ms. (19 steps per ms) remains 36/78 properties
BEST_FIRST walk for 4004 steps (67 resets) in 34 ms. (114 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (60 resets) in 30 ms. (129 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (43 resets) in 42 ms. (93 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (61 resets) in 45 ms. (87 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (48 resets) in 12 ms. (308 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4004 steps (63 resets) in 25 ms. (154 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (48 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (62 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (63 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (44 resets) in 27 ms. (142 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (58 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (43 resets) in 12 ms. (308 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (58 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (54 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (61 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (60 resets) in 21 ms. (181 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (69 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (50 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (46 resets) in 26 ms. (148 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (50 resets) in 12 ms. (308 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (64 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (49 resets) in 27 ms. (143 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (57 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (60 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (63 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (110 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (57 resets) in 28 ms. (138 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (68 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (61 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (51 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (59 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (61 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (62 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (52 resets) in 21 ms. (181 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (58 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (60 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
[2024-06-02 18:52:41] [INFO ] Flow matrix only has 311 transitions (discarded 26 similar events)
[2024-06-02 18:52:41] [INFO ] Invariant cache hit.
[2024-06-02 18:52:41] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Problem AtomicPropp31 is UNSAT
At refinement iteration 2 (OVERLAPS) 66/121 variables, 6/61 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 66/127 constraints. Problems are: Problem set: 1 solved, 34 unsolved
[2024-06-02 18:52:42] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:52:42] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 4 ms to minimize.
[2024-06-02 18:52:42] [INFO ] Deduced a trap composed of 75 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 3/130 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/130 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 4/125 variables, 2/132 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 4/136 constraints. Problems are: Problem set: 1 solved, 34 unsolved
[2024-06-02 18:52:42] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 1/137 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 10 (OVERLAPS) 310/435 variables, 125/262 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 44/306 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/435 variables, 0/306 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 13 (OVERLAPS) 1/436 variables, 1/307 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/436 variables, 1/308 constraints. Problems are: Problem set: 1 solved, 34 unsolved
[2024-06-02 18:52:43] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/436 variables, 1/309 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/436 variables, 0/309 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 17 (OVERLAPS) 1/437 variables, 1/310 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/437 variables, 0/310 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 19 (OVERLAPS) 0/437 variables, 0/310 constraints. Problems are: Problem set: 1 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 310 constraints, problems are : Problem set: 1 solved, 34 unsolved in 2479 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 1 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/54 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 67/121 variables, 6/60 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 67/127 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 4/131 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/131 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 4/125 variables, 2/133 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 4/137 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 1/138 constraints. Problems are: Problem set: 1 solved, 34 unsolved
[2024-06-02 18:52:44] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 1/139 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 0/139 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 11 (OVERLAPS) 310/435 variables, 125/264 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/435 variables, 44/308 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/435 variables, 31/339 constraints. Problems are: Problem set: 1 solved, 34 unsolved
[2024-06-02 18:52:45] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/435 variables, 1/340 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/435 variables, 0/340 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 16 (OVERLAPS) 1/436 variables, 1/341 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/436 variables, 1/342 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/436 variables, 3/345 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/436 variables, 0/345 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 20 (OVERLAPS) 1/437 variables, 1/346 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/437 variables, 0/346 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 22 (OVERLAPS) 0/437 variables, 0/346 constraints. Problems are: Problem set: 1 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 346 constraints, problems are : Problem set: 1 solved, 34 unsolved in 4204 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 34/35 constraints, Known Traps: 7/7 constraints]
After SMT, in 6713ms problems are : Problem set: 1 solved, 34 unsolved
Fused 34 Parikh solutions to 32 different solutions.
Parikh walk visited 11 properties in 4426 ms.
Support contains 41 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 337/337 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 126 transition count 334
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 125 transition count 332
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 125 transition count 332
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 124 transition count 334
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 9 place count 124 transition count 332
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 124 transition count 331
Applied a total of 10 rules in 49 ms. Remains 124 /126 variables (removed 2) and now considering 331/337 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 124/126 places, 331/337 transitions.
RANDOM walk for 40000 steps (2174 resets) in 418 ms. (95 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (42 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (38 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (52 resets) in 37 ms. (105 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (51 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (53 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (54 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (72 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (51 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (58 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (52 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (60 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (51 resets) in 35 ms. (111 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (64 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (51 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (56 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (48 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (112 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (67 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (53 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (50 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (69 resets) in 38 ms. (102 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (56 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (54 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 854195 steps, run timeout after 3001 ms. (steps per millisecond=284 ) properties seen :21 out of 23
Probabilistic random walk after 854195 steps, saw 180942 distinct states, run finished after 3004 ms. (steps per millisecond=284 ) properties seen :21
[2024-06-02 18:52:56] [INFO ] Flow matrix only has 307 transitions (discarded 24 similar events)
// Phase 1: matrix 307 rows 124 cols
[2024-06-02 18:52:56] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 18:52:56] [INFO ] State equation strengthened by 46 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 55/61 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 61/122 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 307/429 variables, 122/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/429 variables, 46/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/429 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/431 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/431 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 431/431 variables, and 178 constraints, problems are : Problem set: 0 solved, 2 unsolved in 145 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 55/61 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 61/122 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 307/429 variables, 122/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/429 variables, 46/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/429 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/429 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/431 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 18:52:56] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/431 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/431 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 431/431 variables, and 181 constraints, problems are : Problem set: 0 solved, 2 unsolved in 337 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 494ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 18 ms.
Support contains 6 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 331/331 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 119 transition count 318
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 119 transition count 318
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 119 transition count 316
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 116 transition count 310
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 116 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 114 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 114 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 112 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 112 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 111 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 111 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 110 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 110 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 109 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 109 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 108 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 108 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 107 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 107 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 106 transition count 286
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 106 transition count 286
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 105 transition count 288
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 42 place count 105 transition count 286
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 105 transition count 285
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 45 place count 105 transition count 311
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 51 place count 103 transition count 307
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 67 place count 103 transition count 291
Applied a total of 67 rules in 85 ms. Remains 103 /124 variables (removed 21) and now considering 291/331 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 103/124 places, 291/331 transitions.
RANDOM walk for 40000 steps (2189 resets) in 391 ms. (102 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (534 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1103 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1058876 steps, run timeout after 3001 ms. (steps per millisecond=352 ) properties seen :0 out of 2
Probabilistic random walk after 1058876 steps, saw 233908 distinct states, run finished after 3001 ms. (steps per millisecond=352 ) properties seen :0
[2024-06-02 18:53:00] [INFO ] Flow matrix only has 263 transitions (discarded 28 similar events)
// Phase 1: matrix 263 rows 103 cols
[2024-06-02 18:53:00] [INFO ] Computed 8 invariants in 6 ms
[2024-06-02 18:53:00] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 49/55 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 46/101 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 263/364 variables, 101/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/366 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/366 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 151 constraints, problems are : Problem set: 0 solved, 2 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 49/55 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 46/101 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 263/364 variables, 101/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/366 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/366 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/366 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 153 constraints, problems are : Problem set: 0 solved, 2 unsolved in 215 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 343ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 20 ms.
Support contains 6 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 291/291 transitions.
Applied a total of 0 rules in 7 ms. Remains 103 /103 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 103/103 places, 291/291 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 291/291 transitions.
Applied a total of 0 rules in 6 ms. Remains 103 /103 variables (removed 0) and now considering 291/291 (removed 0) transitions.
[2024-06-02 18:53:00] [INFO ] Flow matrix only has 263 transitions (discarded 28 similar events)
[2024-06-02 18:53:00] [INFO ] Invariant cache hit.
[2024-06-02 18:53:00] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 18:53:00] [INFO ] Flow matrix only has 263 transitions (discarded 28 similar events)
[2024-06-02 18:53:00] [INFO ] Invariant cache hit.
[2024-06-02 18:53:00] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 18:53:00] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2024-06-02 18:53:00] [INFO ] Redundant transitions in 18 ms returned []
Running 290 sub problems to find dead transitions.
[2024-06-02 18:53:00] [INFO ] Flow matrix only has 263 transitions (discarded 28 similar events)
[2024-06-02 18:53:00] [INFO ] Invariant cache hit.
[2024-06-02 18:53:00] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-06-02 18:53:02] [INFO ] Deduced a trap composed of 54 places in 105 ms of which 1 ms to minimize.
[2024-06-02 18:53:02] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2024-06-02 18:53:02] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:53:02] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:53:02] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:53:03] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-06-02 18:53:03] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 263/366 variables, 103/118 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 40/158 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-06-02 18:53:08] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/366 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (OVERLAPS) 0/366 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 159 constraints, problems are : Problem set: 0 solved, 290 unsolved in 12640 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-06-02 18:53:14] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (OVERLAPS) 263/366 variables, 103/120 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 40/160 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 290/450 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (OVERLAPS) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 450 constraints, problems are : Problem set: 0 solved, 290 unsolved in 15088 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 9/9 constraints]
After SMT, in 27954ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 27958ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28262 ms. Remains : 103/103 places, 291/291 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 94 edges and 103 vertex of which 20 / 103 are part of one of the 3 SCC in 3 ms
Free SCC test removed 17 places
Drop transitions (Empty/Sink Transition effects.) removed 82 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 103 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 85 transition count 187
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 0 with 15 rules applied. Total rules applied 18 place count 85 transition count 172
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 85 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 84 transition count 171
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 20 place count 84 transition count 170
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 83 transition count 170
Free-agglomeration rule applied 7 times with reduction of 4 identical transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 29 place count 83 transition count 159
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 41 place count 76 transition count 154
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 76 transition count 153
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 43 place count 76 transition count 152
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 46 place count 75 transition count 150
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 49 place count 75 transition count 150
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 50 place count 75 transition count 149
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 51 place count 74 transition count 148
Iterating global reduction 4 with 1 rules applied. Total rules applied 52 place count 74 transition count 148
Applied a total of 52 rules in 102 ms. Remains 74 /103 variables (removed 29) and now considering 148/291 (removed 143) transitions.
Running SMT prover for 2 properties.
[2024-06-02 18:53:28] [INFO ] Flow matrix only has 147 transitions (discarded 1 similar events)
// Phase 1: matrix 147 rows 74 cols
[2024-06-02 18:53:28] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:53:29] [INFO ] [Real]Absence check using 8 positive place invariants in 50 ms returned sat
[2024-06-02 18:53:29] [INFO ] After 409ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 18:53:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-02 18:53:29] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 18:53:29] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 18:53:29] [INFO ] After 15ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 18:53:29] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-02 18:53:29] [INFO ] After 137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 676 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
[2024-06-02 18:53:29] [INFO ] Flatten gal took : 31 ms
[2024-06-02 18:53:29] [INFO ] Flatten gal took : 28 ms
[2024-06-02 18:53:29] [INFO ] Input system was already deterministic with 337 transitions.
Computed a total of 22 stabilizing places and 47 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 120 transition count 323
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 120 transition count 323
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 120 transition count 320
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 118 transition count 316
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 118 transition count 316
Applied a total of 19 rules in 12 ms. Remains 118 /126 variables (removed 8) and now considering 316/337 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 118/126 places, 316/337 transitions.
[2024-06-02 18:53:29] [INFO ] Flatten gal took : 19 ms
[2024-06-02 18:53:29] [INFO ] Flatten gal took : 29 ms
[2024-06-02 18:53:29] [INFO ] Input system was already deterministic with 316 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 123 transition count 329
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 123 transition count 329
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 120 transition count 322
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 120 transition count 322
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 119 transition count 320
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 119 transition count 320
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 118 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 118 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 117 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 117 transition count 315
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 116 transition count 314
Applied a total of 20 rules in 45 ms. Remains 116 /126 variables (removed 10) and now considering 314/337 (removed 23) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45 ms. Remains : 116/126 places, 314/337 transitions.
[2024-06-02 18:53:29] [INFO ] Flatten gal took : 30 ms
[2024-06-02 18:53:29] [INFO ] Flatten gal took : 29 ms
[2024-06-02 18:53:29] [INFO ] Input system was already deterministic with 314 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 121 transition count 326
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 121 transition count 326
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 121 transition count 323
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 119 transition count 318
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 119 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 118 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 117 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 109 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 109 transition count 294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 108 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 108 transition count 292
Applied a total of 39 rules in 17 ms. Remains 108 /126 variables (removed 18) and now considering 292/337 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 108/126 places, 292/337 transitions.
[2024-06-02 18:53:29] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:53:29] [INFO ] Flatten gal took : 19 ms
[2024-06-02 18:53:30] [INFO ] Input system was already deterministic with 292 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 121 transition count 325
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 121 transition count 325
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 121 transition count 322
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 119 transition count 318
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 119 transition count 318
Applied a total of 17 rules in 5 ms. Remains 119 /126 variables (removed 7) and now considering 318/337 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 119/126 places, 318/337 transitions.
[2024-06-02 18:53:30] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:53:30] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:53:30] [INFO ] Input system was already deterministic with 318 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 120 transition count 323
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 120 transition count 323
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 120 transition count 320
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 117 transition count 313
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 106 transition count 287
Applied a total of 43 rules in 14 ms. Remains 106 /126 variables (removed 20) and now considering 287/337 (removed 50) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 106/126 places, 287/337 transitions.
[2024-06-02 18:53:30] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:53:30] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:53:30] [INFO ] Input system was already deterministic with 287 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 123 transition count 330
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 123 transition count 330
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 123 transition count 329
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 122 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 122 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 121 transition count 324
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 121 transition count 324
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 120 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 120 transition count 321
Applied a total of 13 rules in 16 ms. Remains 120 /126 variables (removed 6) and now considering 321/337 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 120/126 places, 321/337 transitions.
[2024-06-02 18:53:30] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:53:30] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:53:30] [INFO ] Input system was already deterministic with 321 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 122 transition count 328
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 122 transition count 328
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 122 transition count 326
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 120 transition count 321
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 120 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 119 transition count 319
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 119 transition count 319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 118 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 117 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 117 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 115 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 115 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 113 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 113 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 111 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 111 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 110 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 110 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 109 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 109 transition count 295
Applied a total of 36 rules in 27 ms. Remains 109 /126 variables (removed 17) and now considering 295/337 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 109/126 places, 295/337 transitions.
[2024-06-02 18:53:30] [INFO ] Flatten gal took : 19 ms
[2024-06-02 18:53:30] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:53:30] [INFO ] Input system was already deterministic with 295 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 123 transition count 331
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 123 transition count 331
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 123 transition count 329
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 122 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 122 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 121 transition count 324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 121 transition count 324
Applied a total of 12 rules in 9 ms. Remains 121 /126 variables (removed 5) and now considering 324/337 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 121/126 places, 324/337 transitions.
[2024-06-02 18:53:30] [INFO ] Flatten gal took : 25 ms
[2024-06-02 18:53:30] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:53:30] [INFO ] Input system was already deterministic with 324 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 124 transition count 332
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 124 transition count 332
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 124 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 123 transition count 329
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 123 transition count 329
Applied a total of 7 rules in 21 ms. Remains 123 /126 variables (removed 3) and now considering 329/337 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 123/126 places, 329/337 transitions.
[2024-06-02 18:53:30] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:53:30] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:53:30] [INFO ] Input system was already deterministic with 329 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 119 transition count 322
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 119 transition count 322
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 119 transition count 319
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 116 transition count 312
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 115 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 114 transition count 307
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 113 transition count 306
Applied a total of 27 rules in 48 ms. Remains 113 /126 variables (removed 13) and now considering 306/337 (removed 31) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 49 ms. Remains : 113/126 places, 306/337 transitions.
[2024-06-02 18:53:30] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:53:30] [INFO ] Flatten gal took : 25 ms
[2024-06-02 18:53:30] [INFO ] Input system was already deterministic with 306 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 119 transition count 322
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 119 transition count 322
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 119 transition count 319
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 116 transition count 312
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 115 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 113 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 113 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 112 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 112 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 111 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 111 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 110 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 110 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 109 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 109 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 108 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 108 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 107 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 107 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 106 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 106 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 105 transition count 286
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 105 transition count 286
Applied a total of 43 rules in 62 ms. Remains 105 /126 variables (removed 21) and now considering 286/337 (removed 51) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 62 ms. Remains : 105/126 places, 286/337 transitions.
[2024-06-02 18:53:30] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:53:30] [INFO ] Flatten gal took : 21 ms
[2024-06-02 18:53:30] [INFO ] Input system was already deterministic with 286 transitions.
[2024-06-02 18:53:30] [INFO ] Flatten gal took : 27 ms
[2024-06-02 18:53:30] [INFO ] Flatten gal took : 29 ms
[2024-06-02 18:53:30] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-02 18:53:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 126 places, 337 transitions and 1245 arcs took 8 ms.
Total runtime 96436 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 : FireWire-PT-07-CTLCardinality-2024-01
Could not compute solution for formula : FireWire-PT-07-CTLCardinality-2024-02
Could not compute solution for formula : FireWire-PT-07-CTLCardinality-2024-03
Could not compute solution for formula : FireWire-PT-07-CTLCardinality-2024-04
Could not compute solution for formula : FireWire-PT-07-CTLCardinality-2024-05
Could not compute solution for formula : FireWire-PT-07-CTLCardinality-2024-06
Could not compute solution for formula : FireWire-PT-07-CTLCardinality-2024-08
Could not compute solution for formula : FireWire-PT-07-CTLCardinality-2024-09
Could not compute solution for formula : FireWire-PT-07-CTLCardinality-2024-10
Could not compute solution for formula : FireWire-PT-07-CTLCardinality-2024-12
Could not compute solution for formula : FireWire-PT-07-CTLCardinality-2024-14

BK_STOP 1717354411203

--------------------
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 FireWire-PT-07-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/687/ctl_0_
ctl formula name FireWire-PT-07-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/687/ctl_1_
ctl formula name FireWire-PT-07-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/687/ctl_2_
ctl formula name FireWire-PT-07-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/687/ctl_3_
ctl formula name FireWire-PT-07-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/687/ctl_4_
ctl formula name FireWire-PT-07-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/687/ctl_5_
ctl formula name FireWire-PT-07-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/687/ctl_6_
ctl formula name FireWire-PT-07-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/687/ctl_7_
ctl formula name FireWire-PT-07-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/687/ctl_8_
ctl formula name FireWire-PT-07-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/687/ctl_9_
ctl formula name FireWire-PT-07-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/687/ctl_10_
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="FireWire-PT-07"
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 FireWire-PT-07, 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 r553-tall-171734901200217"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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