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

About the Execution of LTSMin+red for CANInsertWithFailure-PT-080

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
11409.955 563659.00 666949.00 1584.60 ????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.r476-tall-171620505300154.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 CANInsertWithFailure-PT-080, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505300154
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 39M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 39M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717195896419

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-080
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:51:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 22:51:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:51:38] [INFO ] Load time of PNML (sax parser for PT used): 990 ms
[2024-05-31 22:51:38] [INFO ] Transformed 13764 places.
[2024-05-31 22:51:38] [INFO ] Transformed 38880 transitions.
[2024-05-31 22:51:38] [INFO ] Parsed PT model containing 13764 places and 38880 transitions and 104000 arcs in 1235 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 25 ms.
Support contains 150 out of 13764 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13764/13764 places, 38880/38880 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13763 transition count 38880
Applied a total of 1 rules in 4725 ms. Remains 13763 /13764 variables (removed 1) and now considering 38880/38880 (removed 0) transitions.
// Phase 1: matrix 38880 rows 13763 cols
[2024-05-31 22:51:55] [INFO ] Computed 82 invariants in 11051 ms
[2024-05-31 22:52:09] [INFO ] Implicit Places using invariants in 25649 ms returned []
Implicit Place search using SMT only with invariants took 25678 ms to find 0 implicit places.
Running 38800 sub problems to find dead transitions.
[2024-05-31 22:52:10] [INFO ] Invariant cache hit.
[2024-05-31 22:52:10] [INFO ] State equation strengthened by 12720 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13762 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 38800 unsolved
SMT process timed out in 172932ms, After SMT, problems are : Problem set: 0 solved, 38800 unsolved
Search for dead transitions found 0 dead transitions in 173283ms
Starting structural reductions in LTL mode, iteration 1 : 13763/13764 places, 38880/38880 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 203821 ms. Remains : 13763/13764 places, 38880/38880 transitions.
Support contains 150 out of 13763 places after structural reductions.
[2024-05-31 22:55:04] [INFO ] Flatten gal took : 1080 ms
[2024-05-31 22:55:05] [INFO ] Flatten gal took : 822 ms
[2024-05-31 22:55:06] [INFO ] Input system was already deterministic with 38880 transitions.
Support contains 146 out of 13763 places (down from 150) after GAL structural reductions.
RANDOM walk for 40000 steps (18 resets) in 3854 ms. (10 steps per ms) remains 47/87 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 47/47 properties
[2024-05-31 22:55:08] [INFO ] Invariant cache hit.
[2024-05-31 22:55:08] [INFO ] State equation strengthened by 12720 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 13545/13624 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-05-31 22:55:11] [INFO ] Deduced a trap composed of 5 places in 713 ms of which 42 ms to minimize.
[2024-05-31 22:55:12] [INFO ] Deduced a trap composed of 5 places in 694 ms of which 6 ms to minimize.
[2024-05-31 22:55:13] [INFO ] Deduced a trap composed of 5 places in 637 ms of which 5 ms to minimize.
[2024-05-31 22:55:14] [INFO ] Deduced a trap composed of 5 places in 642 ms of which 4 ms to minimize.
SMT process timed out in 5669ms, After SMT, problems are : Problem set: 0 solved, 47 unsolved
Fused 47 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 79 out of 13763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 544 transitions
Trivial Post-agglo rules discarded 544 transitions
Performed 544 trivial Post agglomeration. Transition count delta: 544
Iterating post reduction 0 with 544 rules applied. Total rules applied 544 place count 13763 transition count 38336
Reduce places removed 544 places and 0 transitions.
Iterating post reduction 1 with 544 rules applied. Total rules applied 1088 place count 13219 transition count 38336
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1088 place count 13219 transition count 38332
Deduced a syphon composed of 4 places in 14 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1096 place count 13215 transition count 38332
Performed 6273 Post agglomeration using F-continuation condition.Transition count delta: 6273
Deduced a syphon composed of 6273 places in 20 ms
Reduce places removed 6273 places and 0 transitions.
Iterating global reduction 2 with 12546 rules applied. Total rules applied 13642 place count 6942 transition count 32059
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 2 with 13 rules applied. Total rules applied 13655 place count 6942 transition count 32046
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 13668 place count 6929 transition count 32046
Partial Free-agglomeration rule applied 6465 times.
Drop transitions (Partial Free agglomeration) removed 6465 transitions
Iterating global reduction 3 with 6465 rules applied. Total rules applied 20133 place count 6929 transition count 32046
Partial Free-agglomeration rule applied 320 times.
Drop transitions (Partial Free agglomeration) removed 320 transitions
Iterating global reduction 3 with 320 rules applied. Total rules applied 20453 place count 6929 transition count 32046
Applied a total of 20453 rules in 16648 ms. Remains 6929 /13763 variables (removed 6834) and now considering 32046/38880 (removed 6834) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16653 ms. Remains : 6929/13763 places, 32046/38880 transitions.
RANDOM walk for 40000 steps (81 resets) in 2154 ms. (18 steps per ms) remains 19/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
[2024-05-31 22:55:31] [INFO ] Flow matrix only has 32027 transitions (discarded 19 similar events)
// Phase 1: matrix 32027 rows 6929 cols
[2024-05-31 22:55:34] [INFO ] Computed 82 invariants in 2790 ms
[2024-05-31 22:55:34] [INFO ] State equation strengthened by 31635 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 6736/6778 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-31 22:55:36] [INFO ] Deduced a trap composed of 2 places in 278 ms of which 2 ms to minimize.
[2024-05-31 22:55:36] [INFO ] Deduced a trap composed of 2 places in 252 ms of which 2 ms to minimize.
[2024-05-31 22:55:36] [INFO ] Deduced a trap composed of 2 places in 254 ms of which 2 ms to minimize.
[2024-05-31 22:55:37] [INFO ] Deduced a trap composed of 2 places in 257 ms of which 2 ms to minimize.
[2024-05-31 22:55:37] [INFO ] Deduced a trap composed of 2 places in 238 ms of which 1 ms to minimize.
[2024-05-31 22:55:37] [INFO ] Deduced a trap composed of 2 places in 244 ms of which 1 ms to minimize.
[2024-05-31 22:55:38] [INFO ] Deduced a trap composed of 2 places in 236 ms of which 1 ms to minimize.
[2024-05-31 22:55:38] [INFO ] Deduced a trap composed of 2 places in 240 ms of which 1 ms to minimize.
[2024-05-31 22:55:38] [INFO ] Deduced a trap composed of 2 places in 238 ms of which 1 ms to minimize.
[2024-05-31 22:55:39] [INFO ] Deduced a trap composed of 2 places in 260 ms of which 1 ms to minimize.
[2024-05-31 22:55:39] [INFO ] Deduced a trap composed of 2 places in 250 ms of which 2 ms to minimize.
[2024-05-31 22:55:39] [INFO ] Deduced a trap composed of 2 places in 250 ms of which 2 ms to minimize.
[2024-05-31 22:55:40] [INFO ] Deduced a trap composed of 2 places in 255 ms of which 1 ms to minimize.
[2024-05-31 22:55:40] [INFO ] Deduced a trap composed of 2 places in 249 ms of which 1 ms to minimize.
[2024-05-31 22:55:40] [INFO ] Deduced a trap composed of 2 places in 247 ms of which 2 ms to minimize.
[2024-05-31 22:55:41] [INFO ] Deduced a trap composed of 2 places in 255 ms of which 2 ms to minimize.
[2024-05-31 22:55:41] [INFO ] Deduced a trap composed of 2 places in 236 ms of which 1 ms to minimize.
[2024-05-31 22:55:41] [INFO ] Deduced a trap composed of 2 places in 242 ms of which 1 ms to minimize.
[2024-05-31 22:55:42] [INFO ] Deduced a trap composed of 2 places in 254 ms of which 2 ms to minimize.
[2024-05-31 22:55:42] [INFO ] Deduced a trap composed of 2 places in 237 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6778 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6778 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 148/6926 variables, 74/100 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6926 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6926 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 1/6927 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6927 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 32027/38954 variables, 6927/7029 constraints. Problems are: Problem set: 0 solved, 19 unsolved
SMT process timed out in 48232ms, After SMT, problems are : Problem set: 0 solved, 19 unsolved
Fused 19 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 594 ms.
Support contains 42 out of 6929 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6929/6929 places, 32046/32046 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 5 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 6909 transition count 32026
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 51 place count 6909 transition count 32026
Applied a total of 51 rules in 5965 ms. Remains 6909 /6929 variables (removed 20) and now considering 32026/32046 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5965 ms. Remains : 6909/6929 places, 32026/32046 transitions.
RANDOM walk for 40000 steps (81 resets) in 1990 ms. (20 steps per ms) remains 11/19 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 11/11 properties
[2024-05-31 22:56:27] [INFO ] Flow matrix only has 32017 transitions (discarded 9 similar events)
// Phase 1: matrix 32017 rows 6909 cols
[2024-05-31 22:56:30] [INFO ] Computed 82 invariants in 2453 ms
[2024-05-31 22:56:30] [INFO ] State equation strengthened by 31696 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 6725/6758 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-31 22:56:31] [INFO ] Deduced a trap composed of 2 places in 235 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6758 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6758 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 148/6906 variables, 74/81 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6906 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6906 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/6907 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6907 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 32017/38924 variables, 6907/6990 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/38924 variables, 31696/38686 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/38924 variables, 0/38686 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 2/38926 variables, 2/38688 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 38926/38926 variables, and 38688 constraints, problems are : Problem set: 0 solved, 11 unsolved in 75086 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 6909/6909 constraints, ReadFeed: 31696/31696 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 6725/6758 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6758 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-31 22:57:46] [INFO ] Deduced a trap composed of 2 places in 254 ms of which 1 ms to minimize.
[2024-05-31 22:57:47] [INFO ] Deduced a trap composed of 2 places in 231 ms of which 1 ms to minimize.
[2024-05-31 22:57:47] [INFO ] Deduced a trap composed of 2 places in 235 ms of which 1 ms to minimize.
[2024-05-31 22:57:47] [INFO ] Deduced a trap composed of 2 places in 233 ms of which 2 ms to minimize.
[2024-05-31 22:57:48] [INFO ] Deduced a trap composed of 2 places in 226 ms of which 1 ms to minimize.
[2024-05-31 22:57:48] [INFO ] Deduced a trap composed of 2 places in 228 ms of which 1 ms to minimize.
[2024-05-31 22:57:48] [INFO ] Deduced a trap composed of 2 places in 233 ms of which 1 ms to minimize.
[2024-05-31 22:57:48] [INFO ] Deduced a trap composed of 2 places in 231 ms of which 1 ms to minimize.
[2024-05-31 22:57:49] [INFO ] Deduced a trap composed of 2 places in 233 ms of which 2 ms to minimize.
[2024-05-31 22:57:49] [INFO ] Deduced a trap composed of 2 places in 232 ms of which 5 ms to minimize.
[2024-05-31 22:57:49] [INFO ] Deduced a trap composed of 2 places in 224 ms of which 2 ms to minimize.
[2024-05-31 22:57:50] [INFO ] Deduced a trap composed of 2 places in 238 ms of which 1 ms to minimize.
[2024-05-31 22:57:50] [INFO ] Deduced a trap composed of 2 places in 239 ms of which 2 ms to minimize.
[2024-05-31 22:57:50] [INFO ] Deduced a trap composed of 2 places in 240 ms of which 2 ms to minimize.
[2024-05-31 22:57:51] [INFO ] Deduced a trap composed of 2 places in 242 ms of which 2 ms to minimize.
[2024-05-31 22:57:51] [INFO ] Deduced a trap composed of 2 places in 236 ms of which 1 ms to minimize.
[2024-05-31 22:57:51] [INFO ] Deduced a trap composed of 2 places in 234 ms of which 1 ms to minimize.
[2024-05-31 22:57:52] [INFO ] Deduced a trap composed of 2 places in 223 ms of which 1 ms to minimize.
[2024-05-31 22:57:52] [INFO ] Deduced a trap composed of 2 places in 229 ms of which 1 ms to minimize.
[2024-05-31 22:57:52] [INFO ] Deduced a trap composed of 2 places in 236 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/6758 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6758 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 148/6906 variables, 74/101 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6906 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6906 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1/6907 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/6907 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 32017/38924 variables, 6907/7010 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/38924 variables, 31696/38706 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 38924/38926 variables, and 38717 constraints, problems are : Problem set: 0 solved, 11 unsolved in 75155 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 6907/6909 constraints, ReadFeed: 31696/31696 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 21/21 constraints]
After SMT, in 153136ms problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 33 out of 6909 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6909/6909 places, 32026/32026 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 5 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 6902 transition count 32019
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 6902 transition count 32019
Applied a total of 16 rules in 6009 ms. Remains 6902 /6909 variables (removed 7) and now considering 32019/32026 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6009 ms. Remains : 6902/6909 places, 32019/32026 transitions.
[2024-05-31 22:59:07] [INFO ] Flatten gal took : 630 ms
[2024-05-31 22:59:08] [INFO ] Flatten gal took : 685 ms
[2024-05-31 22:59:09] [INFO ] Input system was already deterministic with 38880 transitions.
Computed a total of 322 stabilizing places and 560 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 13763 transition count 38322
Reduce places removed 558 places and 0 transitions.
Iterating post reduction 1 with 558 rules applied. Total rules applied 1116 place count 13205 transition count 38322
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1116 place count 13205 transition count 38321
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1118 place count 13204 transition count 38321
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 8 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 1276 place count 13125 transition count 38242
Applied a total of 1276 rules in 6862 ms. Remains 13125 /13763 variables (removed 638) and now considering 38242/38880 (removed 638) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6864 ms. Remains : 13125/13763 places, 38242/38880 transitions.
[2024-05-31 22:59:17] [INFO ] Flatten gal took : 595 ms
[2024-05-31 22:59:17] [INFO ] Flatten gal took : 657 ms
[2024-05-31 22:59:18] [INFO ] Input system was already deterministic with 38242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3129 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3131 ms. Remains : 13763/13763 places, 38880/38880 transitions.
[2024-05-31 22:59:22] [INFO ] Flatten gal took : 632 ms
[2024-05-31 22:59:23] [INFO ] Flatten gal took : 636 ms
[2024-05-31 22:59:24] [INFO ] Input system was already deterministic with 38880 transitions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3271 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3272 ms. Remains : 13763/13763 places, 38880/38880 transitions.
[2024-05-31 22:59:28] [INFO ] Flatten gal took : 595 ms
[2024-05-31 22:59:29] [INFO ] Flatten gal took : 664 ms
[2024-05-31 22:59:30] [INFO ] Input system was already deterministic with 38880 transitions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3313 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3314 ms. Remains : 13763/13763 places, 38880/38880 transitions.
[2024-05-31 22:59:34] [INFO ] Flatten gal took : 600 ms
[2024-05-31 22:59:35] [INFO ] Flatten gal took : 661 ms
[2024-05-31 22:59:36] [INFO ] Input system was already deterministic with 38880 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 13763 transition count 38320
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 13203 transition count 38320
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 7 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 1280 place count 13123 transition count 38240
Applied a total of 1280 rules in 6722 ms. Remains 13123 /13763 variables (removed 640) and now considering 38240/38880 (removed 640) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6722 ms. Remains : 13123/13763 places, 38240/38880 transitions.
[2024-05-31 22:59:43] [INFO ] Flatten gal took : 586 ms
[2024-05-31 22:59:44] [INFO ] Flatten gal took : 655 ms
[2024-05-31 22:59:45] [INFO ] Input system was already deterministic with 38240 transitions.
RANDOM walk for 39674 steps (44 resets) in 1579 ms. (25 steps per ms) remains 0/1 properties
FORMULA CANInsertWithFailure-PT-080-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3138 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3139 ms. Remains : 13763/13763 places, 38880/38880 transitions.
[2024-05-31 22:59:50] [INFO ] Flatten gal took : 607 ms
[2024-05-31 22:59:50] [INFO ] Flatten gal took : 667 ms
[2024-05-31 22:59:51] [INFO ] Input system was already deterministic with 38880 transitions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3246 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3247 ms. Remains : 13763/13763 places, 38880/38880 transitions.
[2024-05-31 22:59:55] [INFO ] Flatten gal took : 606 ms
[2024-05-31 22:59:56] [INFO ] Flatten gal took : 667 ms
[2024-05-31 22:59:57] [INFO ] Input system was already deterministic with 38880 transitions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3253 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3254 ms. Remains : 13763/13763 places, 38880/38880 transitions.
[2024-05-31 23:00:01] [INFO ] Flatten gal took : 602 ms
[2024-05-31 23:00:02] [INFO ] Flatten gal took : 667 ms
[2024-05-31 23:00:03] [INFO ] Input system was already deterministic with 38880 transitions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3251 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3252 ms. Remains : 13763/13763 places, 38880/38880 transitions.
[2024-05-31 23:00:07] [INFO ] Flatten gal took : 608 ms
[2024-05-31 23:00:08] [INFO ] Flatten gal took : 677 ms
[2024-05-31 23:00:09] [INFO ] Input system was already deterministic with 38880 transitions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3375 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3376 ms. Remains : 13763/13763 places, 38880/38880 transitions.
[2024-05-31 23:00:13] [INFO ] Flatten gal took : 602 ms
[2024-05-31 23:00:14] [INFO ] Flatten gal took : 667 ms
[2024-05-31 23:00:15] [INFO ] Input system was already deterministic with 38880 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 13763 transition count 38320
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 13203 transition count 38320
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 8 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 1280 place count 13123 transition count 38240
Applied a total of 1280 rules in 6969 ms. Remains 13123 /13763 variables (removed 640) and now considering 38240/38880 (removed 640) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6970 ms. Remains : 13123/13763 places, 38240/38880 transitions.
[2024-05-31 23:00:23] [INFO ] Flatten gal took : 589 ms
[2024-05-31 23:00:23] [INFO ] Flatten gal took : 652 ms
[2024-05-31 23:00:24] [INFO ] Input system was already deterministic with 38240 transitions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3211 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3212 ms. Remains : 13763/13763 places, 38880/38880 transitions.
[2024-05-31 23:00:28] [INFO ] Flatten gal took : 609 ms
[2024-05-31 23:00:29] [INFO ] Flatten gal took : 676 ms
[2024-05-31 23:00:30] [INFO ] Input system was already deterministic with 38880 transitions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3294 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3297 ms. Remains : 13763/13763 places, 38880/38880 transitions.
[2024-05-31 23:00:34] [INFO ] Flatten gal took : 611 ms
[2024-05-31 23:00:35] [INFO ] Flatten gal took : 674 ms
[2024-05-31 23:00:36] [INFO ] Input system was already deterministic with 38880 transitions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3408 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3410 ms. Remains : 13763/13763 places, 38880/38880 transitions.
[2024-05-31 23:00:40] [INFO ] Flatten gal took : 618 ms
[2024-05-31 23:00:41] [INFO ] Flatten gal took : 674 ms
[2024-05-31 23:00:42] [INFO ] Input system was already deterministic with 38880 transitions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3425 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3426 ms. Remains : 13763/13763 places, 38880/38880 transitions.
[2024-05-31 23:00:46] [INFO ] Flatten gal took : 641 ms
[2024-05-31 23:00:47] [INFO ] Flatten gal took : 702 ms
[2024-05-31 23:00:48] [INFO ] Input system was already deterministic with 38880 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 559 transitions
Trivial Post-agglo rules discarded 559 transitions
Performed 559 trivial Post agglomeration. Transition count delta: 559
Iterating post reduction 0 with 559 rules applied. Total rules applied 559 place count 13763 transition count 38321
Reduce places removed 559 places and 0 transitions.
Iterating post reduction 1 with 559 rules applied. Total rules applied 1118 place count 13204 transition count 38321
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 7 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 1278 place count 13124 transition count 38241
Applied a total of 1278 rules in 6816 ms. Remains 13124 /13763 variables (removed 639) and now considering 38241/38880 (removed 639) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6817 ms. Remains : 13124/13763 places, 38241/38880 transitions.
[2024-05-31 23:00:56] [INFO ] Flatten gal took : 605 ms
[2024-05-31 23:00:56] [INFO ] Flatten gal took : 663 ms
[2024-05-31 23:00:58] [INFO ] Input system was already deterministic with 38241 transitions.
[2024-05-31 23:00:58] [INFO ] Flatten gal took : 635 ms
[2024-05-31 23:00:59] [INFO ] Flatten gal took : 672 ms
[2024-05-31 23:00:59] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-05-31 23:00:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 13763 places, 38880 transitions and 103840 arcs took 92 ms.
Total runtime 562074 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 : CANInsertWithFailure-PT-080-CTLFireability-2024-00
Could not compute solution for formula : CANInsertWithFailure-PT-080-CTLFireability-2024-01
Could not compute solution for formula : CANInsertWithFailure-PT-080-CTLFireability-2024-02
Could not compute solution for formula : CANInsertWithFailure-PT-080-CTLFireability-2024-03
Could not compute solution for formula : CANInsertWithFailure-PT-080-CTLFireability-2024-05
Could not compute solution for formula : CANInsertWithFailure-PT-080-CTLFireability-2024-06
Could not compute solution for formula : CANInsertWithFailure-PT-080-CTLFireability-2024-07
Could not compute solution for formula : CANInsertWithFailure-PT-080-CTLFireability-2024-08
Could not compute solution for formula : CANInsertWithFailure-PT-080-CTLFireability-2024-09
Could not compute solution for formula : CANInsertWithFailure-PT-080-CTLFireability-2024-10
Could not compute solution for formula : CANInsertWithFailure-PT-080-CTLFireability-2024-11
Could not compute solution for formula : CANInsertWithFailure-PT-080-CTLFireability-2023-12
Could not compute solution for formula : CANInsertWithFailure-PT-080-CTLFireability-2023-13
Could not compute solution for formula : CANInsertWithFailure-PT-080-CTLFireability-2023-14
Could not compute solution for formula : CANInsertWithFailure-PT-080-CTLFireability-2023-15

BK_STOP 1717196460078

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 CANInsertWithFailure-PT-080-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/692/ctl_0_
ctl formula name CANInsertWithFailure-PT-080-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/692/ctl_1_
ctl formula name CANInsertWithFailure-PT-080-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/692/ctl_2_
ctl formula name CANInsertWithFailure-PT-080-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/692/ctl_3_
ctl formula name CANInsertWithFailure-PT-080-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/692/ctl_4_
ctl formula name CANInsertWithFailure-PT-080-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/692/ctl_5_
ctl formula name CANInsertWithFailure-PT-080-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/692/ctl_6_
ctl formula name CANInsertWithFailure-PT-080-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/692/ctl_7_
ctl formula name CANInsertWithFailure-PT-080-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/692/ctl_8_
ctl formula name CANInsertWithFailure-PT-080-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/692/ctl_9_
ctl formula name CANInsertWithFailure-PT-080-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/692/ctl_10_
ctl formula name CANInsertWithFailure-PT-080-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/692/ctl_11_
ctl formula name CANInsertWithFailure-PT-080-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/692/ctl_12_
ctl formula name CANInsertWithFailure-PT-080-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/692/ctl_13_
ctl formula name CANInsertWithFailure-PT-080-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/692/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="CANInsertWithFailure-PT-080"
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 CANInsertWithFailure-PT-080, 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 r476-tall-171620505300154"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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