fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r553-tall-171734901200250
Last Updated
July 7, 2024

About the Execution of LTSMin+red for FireWire-PT-11

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
380.728 25045.00 60346.00 36.90 ??????T????????? normal

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-171734901200250.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-11, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901200250
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 7.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K 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 125K 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-11-CTLFireability-2024-00
FORMULA_NAME FireWire-PT-11-CTLFireability-2024-01
FORMULA_NAME FireWire-PT-11-CTLFireability-2024-02
FORMULA_NAME FireWire-PT-11-CTLFireability-2024-03
FORMULA_NAME FireWire-PT-11-CTLFireability-2024-04
FORMULA_NAME FireWire-PT-11-CTLFireability-2024-05
FORMULA_NAME FireWire-PT-11-CTLFireability-2024-06
FORMULA_NAME FireWire-PT-11-CTLFireability-2024-07
FORMULA_NAME FireWire-PT-11-CTLFireability-2024-08
FORMULA_NAME FireWire-PT-11-CTLFireability-2024-09
FORMULA_NAME FireWire-PT-11-CTLFireability-2024-10
FORMULA_NAME FireWire-PT-11-CTLFireability-2024-11
FORMULA_NAME FireWire-PT-11-CTLFireability-2024-12
FORMULA_NAME FireWire-PT-11-CTLFireability-2024-13
FORMULA_NAME FireWire-PT-11-CTLFireability-2024-14
FORMULA_NAME FireWire-PT-11-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717355180210

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:06:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 19:06:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:06:21] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2024-06-02 19:06:21] [INFO ] Transformed 169 places.
[2024-06-02 19:06:21] [INFO ] Transformed 508 transitions.
[2024-06-02 19:06:21] [INFO ] Found NUPN structural information;
[2024-06-02 19:06:21] [INFO ] Parsed PT model containing 169 places and 508 transitions and 1883 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Ensure Unique test removed 65 transitions
Reduce redundant transitions removed 65 transitions.
Support contains 102 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 443/443 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 169 transition count 437
Applied a total of 6 rules in 28 ms. Remains 169 /169 variables (removed 0) and now considering 437/443 (removed 6) transitions.
[2024-06-02 19:06:21] [INFO ] Flow matrix only has 405 transitions (discarded 32 similar events)
// Phase 1: matrix 405 rows 169 cols
[2024-06-02 19:06:21] [INFO ] Computed 10 invariants in 19 ms
[2024-06-02 19:06:21] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-06-02 19:06:21] [INFO ] Flow matrix only has 405 transitions (discarded 32 similar events)
[2024-06-02 19:06:21] [INFO ] Invariant cache hit.
[2024-06-02 19:06:21] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 19:06:22] [INFO ] Implicit Places using invariants and state equation in 247 ms returned [167]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 520 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 168/169 places, 437/443 transitions.
Applied a total of 0 rules in 6 ms. Remains 168 /168 variables (removed 0) and now considering 437/437 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 572 ms. Remains : 168/169 places, 437/443 transitions.
Support contains 102 out of 168 places after structural reductions.
[2024-06-02 19:06:22] [INFO ] Flatten gal took : 56 ms
[2024-06-02 19:06:22] [INFO ] Flatten gal took : 28 ms
[2024-06-02 19:06:22] [INFO ] Input system was already deterministic with 437 transitions.
Reduction of identical properties reduced properties to check from 78 to 77
RANDOM walk for 40000 steps (1114 resets) in 1825 ms. (21 steps per ms) remains 30/77 properties
BEST_FIRST walk for 4003 steps (18 resets) in 45 ms. (87 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (18 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (23 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (21 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (24 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (15 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (12 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (14 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (11 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (9 resets) in 28 ms. (138 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (25 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (22 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (18 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (24 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (21 resets) in 10 ms. (363 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (19 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (14 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (21 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (24 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (19 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (24 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (20 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
[2024-06-02 19:06:23] [INFO ] Flow matrix only has 405 transitions (discarded 32 similar events)
// Phase 1: matrix 405 rows 168 cols
[2024-06-02 19:06:23] [INFO ] Computed 9 invariants in 7 ms
[2024-06-02 19:06:23] [INFO ] State equation strengthened by 58 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp69 is UNSAT
At refinement iteration 2 (OVERLAPS) 100/163 variables, 9/72 constraints. Problems are: Problem set: 13 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 100/172 constraints. Problems are: Problem set: 13 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/172 constraints. Problems are: Problem set: 13 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 401/564 variables, 163/335 constraints. Problems are: Problem set: 13 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 57/392 constraints. Problems are: Problem set: 13 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/564 variables, 0/392 constraints. Problems are: Problem set: 13 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 8/572 variables, 5/397 constraints. Problems are: Problem set: 13 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 5/402 constraints. Problems are: Problem set: 13 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 0/402 constraints. Problems are: Problem set: 13 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 1/573 variables, 1/403 constraints. Problems are: Problem set: 13 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/573 variables, 0/403 constraints. Problems are: Problem set: 13 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 0/573 variables, 0/403 constraints. Problems are: Problem set: 13 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 573/573 variables, and 403 constraints, problems are : Problem set: 13 solved, 17 unsolved in 1198 ms.
Refiners :[Domain max(s): 168/168 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 168/168 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 13 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 13 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 13 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 125/154 variables, 6/35 constraints. Problems are: Problem set: 13 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 125/160 constraints. Problems are: Problem set: 13 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/160 constraints. Problems are: Problem set: 13 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 9/163 variables, 3/163 constraints. Problems are: Problem set: 13 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 9/172 constraints. Problems are: Problem set: 13 solved, 17 unsolved
[2024-06-02 19:06:24] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 1/173 constraints. Problems are: Problem set: 13 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/173 constraints. Problems are: Problem set: 13 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 401/564 variables, 163/336 constraints. Problems are: Problem set: 13 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/564 variables, 57/393 constraints. Problems are: Problem set: 13 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/564 variables, 16/409 constraints. Problems are: Problem set: 13 solved, 17 unsolved
[2024-06-02 19:06:25] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 1/410 constraints. Problems are: Problem set: 13 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/564 variables, 0/410 constraints. Problems are: Problem set: 13 solved, 17 unsolved
At refinement iteration 14 (OVERLAPS) 8/572 variables, 5/415 constraints. Problems are: Problem set: 13 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/572 variables, 5/420 constraints. Problems are: Problem set: 13 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/572 variables, 1/421 constraints. Problems are: Problem set: 13 solved, 17 unsolved
[2024-06-02 19:06:26] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/572 variables, 1/422 constraints. Problems are: Problem set: 13 solved, 17 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/572 variables, 0/422 constraints. Problems are: Problem set: 13 solved, 17 unsolved
At refinement iteration 19 (OVERLAPS) 1/573 variables, 1/423 constraints. Problems are: Problem set: 13 solved, 17 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/573 variables, 0/423 constraints. Problems are: Problem set: 13 solved, 17 unsolved
At refinement iteration 21 (OVERLAPS) 0/573 variables, 0/423 constraints. Problems are: Problem set: 13 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 573/573 variables, and 423 constraints, problems are : Problem set: 13 solved, 17 unsolved in 3644 ms.
Refiners :[Domain max(s): 168/168 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 168/168 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 17/30 constraints, Known Traps: 3/3 constraints]
After SMT, in 4960ms problems are : Problem set: 13 solved, 17 unsolved
Parikh walk visited 8 properties in 7354 ms.
Support contains 14 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 437/437 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 168 transition count 434
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 3 place count 168 transition count 428
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 15 place count 162 transition count 428
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 160 transition count 424
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 160 transition count 424
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 25 place count 157 transition count 432
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 31 place count 157 transition count 426
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 34 place count 157 transition count 423
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 37 place count 157 transition count 428
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 45 place count 154 transition count 423
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 49 place count 154 transition count 419
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 154 transition count 419
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 153 transition count 418
Applied a total of 51 rules in 101 ms. Remains 153 /168 variables (removed 15) and now considering 418/437 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 153/168 places, 418/437 transitions.
RANDOM walk for 40000 steps (1273 resets) in 760 ms. (52 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (280 resets) in 63 ms. (625 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (385 resets) in 53 ms. (740 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (10 resets) in 72 ms. (547 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 50 ms. (784 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (258 resets) in 73 ms. (540 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (9 resets) in 62 ms. (634 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (299 resets) in 46 ms. (851 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40002 steps (251 resets) in 34 ms. (1142 steps per ms) remains 7/7 properties
[2024-06-02 19:06:36] [INFO ] Flow matrix only has 382 transitions (discarded 36 similar events)
// Phase 1: matrix 382 rows 153 cols
[2024-06-02 19:06:36] [INFO ] Computed 9 invariants in 7 ms
[2024-06-02 19:06:36] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 123/134 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 371/505 variables, 134/138 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/505 variables, 56/194 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 27/532 variables, 16/210 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 5/215 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 3/535 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/535 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/535 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 218 constraints, problems are : Problem set: 0 solved, 7 unsolved in 598 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 123/134 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 371/505 variables, 134/138 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/505 variables, 56/194 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 6/200 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 27/532 variables, 16/216 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 5/221 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/532 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 3/535 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/535 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/535 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 225 constraints, problems are : Problem set: 0 solved, 7 unsolved in 722 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 1341ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 1 properties in 4233 ms.
Support contains 10 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 418/418 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 153 transition count 421
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 7 place count 151 transition count 418
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 151 transition count 416
Applied a total of 9 rules in 26 ms. Remains 151 /153 variables (removed 2) and now considering 416/418 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 151/153 places, 416/418 transitions.
RANDOM walk for 40000 steps (1283 resets) in 168 ms. (236 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (291 resets) in 71 ms. (555 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (395 resets) in 65 ms. (606 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 33 ms. (1176 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (275 resets) in 92 ms. (430 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (279 resets) in 78 ms. (506 steps per ms) remains 3/6 properties
[2024-06-02 19:06:42] [INFO ] Flow matrix only has 379 transitions (discarded 37 similar events)
// Phase 1: matrix 379 rows 151 cols
[2024-06-02 19:06:42] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 19:06:42] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 126/131 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 367/498 variables, 131/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/498 variables, 56/191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/498 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 29/527 variables, 17/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/527 variables, 5/213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/527 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 3/530 variables, 3/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/530 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 530/530 variables, and 216 constraints, problems are : Problem set: 0 solved, 3 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 126/131 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 367/498 variables, 131/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/498 variables, 56/191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/498 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/498 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 29/527 variables, 17/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/527 variables, 5/215 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/527 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/527 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 3/530 variables, 3/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/530 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/530 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 530/530 variables, and 219 constraints, problems are : Problem set: 0 solved, 3 unsolved in 373 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 151/151 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 680ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 619 ms.
Support contains 5 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 416/416 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 150 transition count 416
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 150 transition count 416
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 5 place count 149 transition count 415
Applied a total of 5 rules in 18 ms. Remains 149 /151 variables (removed 2) and now considering 415/416 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 149/151 places, 415/416 transitions.
RANDOM walk for 40000 steps (1301 resets) in 119 ms. (333 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (262 resets) in 37 ms. (1052 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (379 resets) in 34 ms. (1142 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (293 resets) in 41 ms. (952 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 26509 steps, run visited all 3 properties in 132 ms. (steps per millisecond=200 )
Probabilistic random walk after 26509 steps, saw 9375 distinct states, run finished after 139 ms. (steps per millisecond=190 ) properties seen :3
Successfully simplified 13 atomic propositions for a total of 16 simplifications.
[2024-06-02 19:06:43] [INFO ] Flatten gal took : 23 ms
[2024-06-02 19:06:43] [INFO ] Flatten gal took : 23 ms
[2024-06-02 19:06:43] [INFO ] Input system was already deterministic with 437 transitions.
Support contains 80 out of 168 places (down from 88) after GAL structural reductions.
Computed a total of 24 stabilizing places and 37 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 168/168 places, 437/437 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 167 transition count 430
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 161 transition count 430
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 159 transition count 426
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 159 transition count 426
Applied a total of 16 rules in 21 ms. Remains 159 /168 variables (removed 9) and now considering 426/437 (removed 11) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 159/168 places, 426/437 transitions.
[2024-06-02 19:06:43] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:06:43] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:06:43] [INFO ] Input system was already deterministic with 426 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 168/168 places, 437/437 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 167 transition count 430
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 161 transition count 430
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 158 transition count 424
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 158 transition count 424
Applied a total of 18 rules in 15 ms. Remains 158 /168 variables (removed 10) and now considering 424/437 (removed 13) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 158/168 places, 424/437 transitions.
[2024-06-02 19:06:43] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:06:43] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:06:43] [INFO ] Input system was already deterministic with 424 transitions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 437/437 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 165 transition count 431
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 165 transition count 431
Applied a total of 6 rules in 4 ms. Remains 165 /168 variables (removed 3) and now considering 431/437 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 165/168 places, 431/437 transitions.
[2024-06-02 19:06:43] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:06:43] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:06:43] [INFO ] Input system was already deterministic with 431 transitions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 437/437 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 165 transition count 431
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 165 transition count 431
Applied a total of 6 rules in 7 ms. Remains 165 /168 variables (removed 3) and now considering 431/437 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 165/168 places, 431/437 transitions.
[2024-06-02 19:06:44] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:06:44] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:06:44] [INFO ] Input system was already deterministic with 431 transitions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 437/437 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 165 transition count 431
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 165 transition count 431
Applied a total of 6 rules in 3 ms. Remains 165 /168 variables (removed 3) and now considering 431/437 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 165/168 places, 431/437 transitions.
[2024-06-02 19:06:44] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:06:44] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:06:44] [INFO ] Input system was already deterministic with 431 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 168/168 places, 437/437 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 168 transition count 431
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 162 transition count 431
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 161 transition count 429
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 161 transition count 429
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 161 transition count 429
Applied a total of 15 rules in 23 ms. Remains 161 /168 variables (removed 7) and now considering 429/437 (removed 8) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 161/168 places, 429/437 transitions.
[2024-06-02 19:06:44] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:06:44] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:06:44] [INFO ] Input system was already deterministic with 429 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 168/168 places, 437/437 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 168 transition count 431
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 162 transition count 431
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 159 transition count 425
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 159 transition count 425
Applied a total of 18 rules in 14 ms. Remains 159 /168 variables (removed 9) and now considering 425/437 (removed 12) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 159/168 places, 425/437 transitions.
[2024-06-02 19:06:44] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:06:44] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:06:44] [INFO ] Input system was already deterministic with 425 transitions.
RANDOM walk for 3437 steps (105 resets) in 22 ms. (149 steps per ms) remains 0/1 properties
FORMULA FireWire-PT-11-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 437/437 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 165 transition count 431
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 165 transition count 431
Applied a total of 6 rules in 3 ms. Remains 165 /168 variables (removed 3) and now considering 431/437 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 165/168 places, 431/437 transitions.
[2024-06-02 19:06:44] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:06:44] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:06:44] [INFO ] Input system was already deterministic with 431 transitions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 437/437 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 165 transition count 431
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 165 transition count 431
Applied a total of 6 rules in 3 ms. Remains 165 /168 variables (removed 3) and now considering 431/437 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 165/168 places, 431/437 transitions.
[2024-06-02 19:06:44] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:06:44] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:06:44] [INFO ] Input system was already deterministic with 431 transitions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 437/437 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 165 transition count 431
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 165 transition count 431
Applied a total of 6 rules in 4 ms. Remains 165 /168 variables (removed 3) and now considering 431/437 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 165/168 places, 431/437 transitions.
[2024-06-02 19:06:44] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:06:44] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:06:44] [INFO ] Input system was already deterministic with 431 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 168/168 places, 437/437 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 167 transition count 431
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 162 transition count 431
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 159 transition count 425
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 159 transition count 425
Applied a total of 16 rules in 14 ms. Remains 159 /168 variables (removed 9) and now considering 425/437 (removed 12) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 159/168 places, 425/437 transitions.
[2024-06-02 19:06:44] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:06:44] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:06:44] [INFO ] Input system was already deterministic with 425 transitions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 437/437 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 165 transition count 431
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 165 transition count 431
Applied a total of 6 rules in 4 ms. Remains 165 /168 variables (removed 3) and now considering 431/437 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 165/168 places, 431/437 transitions.
[2024-06-02 19:06:44] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:06:44] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:06:44] [INFO ] Input system was already deterministic with 431 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 168/168 places, 437/437 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 168 transition count 432
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 163 transition count 432
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 161 transition count 428
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 161 transition count 428
Applied a total of 14 rules in 12 ms. Remains 161 /168 variables (removed 7) and now considering 428/437 (removed 9) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 161/168 places, 428/437 transitions.
[2024-06-02 19:06:44] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:06:44] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:06:44] [INFO ] Input system was already deterministic with 428 transitions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 437/437 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 165 transition count 431
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 165 transition count 431
Applied a total of 6 rules in 3 ms. Remains 165 /168 variables (removed 3) and now considering 431/437 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 165/168 places, 431/437 transitions.
[2024-06-02 19:06:44] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:06:44] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:06:44] [INFO ] Input system was already deterministic with 431 transitions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 437/437 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 165 transition count 431
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 165 transition count 431
Applied a total of 6 rules in 3 ms. Remains 165 /168 variables (removed 3) and now considering 431/437 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 165/168 places, 431/437 transitions.
[2024-06-02 19:06:44] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:06:44] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:06:44] [INFO ] Input system was already deterministic with 431 transitions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 437/437 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 165 transition count 431
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 165 transition count 431
Applied a total of 6 rules in 3 ms. Remains 165 /168 variables (removed 3) and now considering 431/437 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 165/168 places, 431/437 transitions.
[2024-06-02 19:06:44] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:06:44] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:06:44] [INFO ] Input system was already deterministic with 431 transitions.
[2024-06-02 19:06:44] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:06:44] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:06:44] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-06-02 19:06:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 168 places, 437 transitions and 1598 arcs took 2 ms.
Total runtime 23620 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-11-CTLFireability-2024-00
Could not compute solution for formula : FireWire-PT-11-CTLFireability-2024-01
Could not compute solution for formula : FireWire-PT-11-CTLFireability-2024-02
Could not compute solution for formula : FireWire-PT-11-CTLFireability-2024-03
Could not compute solution for formula : FireWire-PT-11-CTLFireability-2024-04
Could not compute solution for formula : FireWire-PT-11-CTLFireability-2024-05
Could not compute solution for formula : FireWire-PT-11-CTLFireability-2024-07
Could not compute solution for formula : FireWire-PT-11-CTLFireability-2024-08
Could not compute solution for formula : FireWire-PT-11-CTLFireability-2024-09
Could not compute solution for formula : FireWire-PT-11-CTLFireability-2024-10
Could not compute solution for formula : FireWire-PT-11-CTLFireability-2024-11
Could not compute solution for formula : FireWire-PT-11-CTLFireability-2024-12
Could not compute solution for formula : FireWire-PT-11-CTLFireability-2024-13
Could not compute solution for formula : FireWire-PT-11-CTLFireability-2024-14
Could not compute solution for formula : FireWire-PT-11-CTLFireability-2024-15

BK_STOP 1717355205255

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name FireWire-PT-11-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/538/ctl_0_
ctl formula name FireWire-PT-11-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/538/ctl_1_
ctl formula name FireWire-PT-11-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/538/ctl_2_
ctl formula name FireWire-PT-11-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/538/ctl_3_
ctl formula name FireWire-PT-11-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/538/ctl_4_
ctl formula name FireWire-PT-11-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/538/ctl_5_
ctl formula name FireWire-PT-11-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/538/ctl_6_
ctl formula name FireWire-PT-11-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/538/ctl_7_
ctl formula name FireWire-PT-11-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/538/ctl_8_
ctl formula name FireWire-PT-11-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/538/ctl_9_
ctl formula name FireWire-PT-11-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/538/ctl_10_
ctl formula name FireWire-PT-11-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/538/ctl_11_
ctl formula name FireWire-PT-11-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/538/ctl_12_
ctl formula name FireWire-PT-11-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/538/ctl_13_
ctl formula name FireWire-PT-11-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/538/ctl_14_
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-11"
export BK_EXAMINATION="CTLFireability"
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-11, examination is CTLFireability"
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-171734901200250"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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