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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 07:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 12 07:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 12 07:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 126K Apr 12 07:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:32 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 202K 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-005-CTLFireability-2024-00
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2024-01
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2024-02
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2024-03
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2024-04
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2024-05
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2024-06
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2024-07
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2024-08
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2024-09
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2024-10
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2024-11
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2023-12
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2023-13
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2023-14
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717185483160

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-005
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:58:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 19:58:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:58:04] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2024-05-31 19:58:04] [INFO ] Transformed 114 places.
[2024-05-31 19:58:04] [INFO ] Transformed 180 transitions.
[2024-05-31 19:58:04] [INFO ] Parsed PT model containing 114 places and 180 transitions and 500 arcs in 164 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 77 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 180
Applied a total of 1 rules in 19 ms. Remains 113 /114 variables (removed 1) and now considering 180/180 (removed 0) transitions.
// Phase 1: matrix 180 rows 113 cols
[2024-05-31 19:58:04] [INFO ] Computed 7 invariants in 11 ms
[2024-05-31 19:58:04] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-31 19:58:04] [INFO ] Invariant cache hit.
[2024-05-31 19:58:04] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-31 19:58:04] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-31 19:58:04] [INFO ] Invariant cache hit.
[2024-05-31 19:58:04] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-31 19:58:05] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 8 ms to minimize.
[2024-05-31 19:58:06] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 2 ms to minimize.
[2024-05-31 19:58:06] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-31 19:58:06] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-31 19:58:06] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-31 19:58:06] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-31 19:58:06] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-05-31 19:58:07] [INFO ] Deduced a trap composed of 27 places in 217 ms of which 1 ms to minimize.
[2024-05-31 19:58:07] [INFO ] Deduced a trap composed of 25 places in 172 ms of which 30 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 180/292 variables, 112/128 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 45/173 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-31 19:58:09] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 1/293 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (OVERLAPS) 0/293 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 175 constraints, problems are : Problem set: 0 solved, 175 unsolved in 10628 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-31 19:58:16] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-31 19:58:16] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-05-31 19:58:16] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-31 19:58:16] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-05-31 19:58:16] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-31 19:58:16] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-31 19:58:16] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-31 19:58:16] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 180/292 variables, 112/137 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 45/182 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 175/357 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 1/293 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (OVERLAPS) 0/293 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 358 constraints, problems are : Problem set: 0 solved, 175 unsolved in 9620 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 18/18 constraints]
After SMT, in 20323ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 20345ms
Starting structural reductions in LTL mode, iteration 1 : 113/114 places, 180/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20724 ms. Remains : 113/114 places, 180/180 transitions.
Support contains 77 out of 113 places after structural reductions.
[2024-05-31 19:58:25] [INFO ] Flatten gal took : 43 ms
[2024-05-31 19:58:25] [INFO ] Flatten gal took : 13 ms
[2024-05-31 19:58:25] [INFO ] Input system was already deterministic with 180 transitions.
RANDOM walk for 40000 steps (405 resets) in 2046 ms. (19 steps per ms) remains 12/70 properties
BEST_FIRST walk for 40004 steps (87 resets) in 94 ms. (421 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (120 resets) in 201 ms. (198 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (107 resets) in 94 ms. (421 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (103 resets) in 223 ms. (178 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (108 resets) in 84 ms. (470 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (76 resets) in 254 ms. (156 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (102 resets) in 112 ms. (354 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (90 resets) in 115 ms. (344 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (99 resets) in 117 ms. (339 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (95 resets) in 99 ms. (400 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (98 resets) in 119 ms. (333 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (89 resets) in 86 ms. (459 steps per ms) remains 12/12 properties
[2024-05-31 19:58:26] [INFO ] Invariant cache hit.
[2024-05-31 19:58:26] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 79/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-31 19:58:26] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-31 19:58:27] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-31 19:58:27] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-05-31 19:58:27] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-31 19:58:27] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-31 19:58:27] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 1/113 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-31 19:58:27] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-31 19:58:27] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 180/293 variables, 113/128 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp40 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 45/173 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-05-31 19:58:27] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 1/174 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/293 variables, 0/174 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 0/293 variables, 0/174 constraints. Problems are: Problem set: 1 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 174 constraints, problems are : Problem set: 1 solved, 11 unsolved in 1142 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 1 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 80/112 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 9/15 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-05-31 19:58:28] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/16 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-05-31 19:58:28] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 1/17 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-05-31 19:58:28] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 1/18 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1/113 variables, 1/19 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 180/293 variables, 113/132 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp43 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 45/177 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/293 variables, 7/184 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/293 variables, 0/184 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/293 variables, 0/184 constraints. Problems are: Problem set: 5 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 184 constraints, problems are : Problem set: 5 solved, 7 unsolved in 663 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 7/12 constraints, Known Traps: 12/12 constraints]
After SMT, in 1817ms problems are : Problem set: 5 solved, 7 unsolved
Parikh walk visited 0 properties in 770 ms.
Support contains 23 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 113 transition count 158
Reduce places removed 22 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 24 rules applied. Total rules applied 46 place count 91 transition count 156
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 48 place count 89 transition count 156
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 48 place count 89 transition count 154
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 52 place count 87 transition count 154
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 66 place count 80 transition count 147
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 70 place count 80 transition count 143
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 74 place count 80 transition count 139
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 78 place count 76 transition count 139
Partial Free-agglomeration rule applied 26 times.
Drop transitions (Partial Free agglomeration) removed 26 transitions
Iterating global reduction 4 with 26 rules applied. Total rules applied 104 place count 76 transition count 139
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 109 place count 76 transition count 139
Applied a total of 109 rules in 43 ms. Remains 76 /113 variables (removed 37) and now considering 139/180 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 76/113 places, 139/180 transitions.
RANDOM walk for 40000 steps (1001 resets) in 517 ms. (77 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (206 resets) in 263 ms. (151 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (270 resets) in 50 ms. (784 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (180 resets) in 94 ms. (421 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (196 resets) in 66 ms. (597 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (216 resets) in 102 ms. (388 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (195 resets) in 92 ms. (430 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (250 resets) in 100 ms. (396 steps per ms) remains 7/7 properties
Probably explored full state space saw : 28253 states, properties seen :0
Probabilistic random walk after 156842 steps, saw 28253 distinct states, run finished after 597 ms. (steps per millisecond=262 ) properties seen :0
Explored full state space saw : 28253 states, properties seen :0
Exhaustive walk after 156842 steps, saw 28253 distinct states, run finished after 550 ms. (steps per millisecond=285 ) properties seen :0
Successfully simplified 12 atomic propositions for a total of 16 simplifications.
FORMULA CANInsertWithFailure-PT-005-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 19:58:31] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-31 19:58:31] [INFO ] Flatten gal took : 11 ms
FORMULA CANInsertWithFailure-PT-005-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-005-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 19:58:31] [INFO ] Flatten gal took : 9 ms
[2024-05-31 19:58:31] [INFO ] Input system was already deterministic with 180 transitions.
Computed a total of 22 stabilizing places and 35 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 113/113 places, 180/180 transitions.
[2024-05-31 19:58:31] [INFO ] Flatten gal took : 8 ms
[2024-05-31 19:58:31] [INFO ] Flatten gal took : 8 ms
[2024-05-31 19:58:31] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 113 transition count 147
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 80 transition count 147
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 66 place count 80 transition count 146
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 79 transition count 146
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 76 place count 75 transition count 142
Applied a total of 76 rules in 12 ms. Remains 75 /113 variables (removed 38) and now considering 142/180 (removed 38) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 75/113 places, 142/180 transitions.
[2024-05-31 19:58:31] [INFO ] Flatten gal took : 5 ms
[2024-05-31 19:58:31] [INFO ] Flatten gal took : 6 ms
[2024-05-31 19:58:31] [INFO ] Input system was already deterministic with 142 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 113/113 places, 180/180 transitions.
[2024-05-31 19:58:31] [INFO ] Flatten gal took : 7 ms
[2024-05-31 19:58:31] [INFO ] Flatten gal took : 7 ms
[2024-05-31 19:58:31] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 113 transition count 145
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 78 transition count 145
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 80 place count 73 transition count 140
Applied a total of 80 rules in 10 ms. Remains 73 /113 variables (removed 40) and now considering 140/180 (removed 40) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 73/113 places, 140/180 transitions.
[2024-05-31 19:58:31] [INFO ] Flatten gal took : 5 ms
[2024-05-31 19:58:31] [INFO ] Flatten gal took : 5 ms
[2024-05-31 19:58:31] [INFO ] Input system was already deterministic with 140 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 113/113 places, 180/180 transitions.
[2024-05-31 19:58:31] [INFO ] Flatten gal took : 6 ms
[2024-05-31 19:58:31] [INFO ] Flatten gal took : 6 ms
[2024-05-31 19:58:31] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 113 transition count 159
Reduce places removed 21 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 23 rules applied. Total rules applied 44 place count 92 transition count 157
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 46 place count 90 transition count 157
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 46 place count 90 transition count 153
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 54 place count 86 transition count 153
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 85 transition count 152
Partial Post-agglomeration rule applied 8 times.
Drop transitions (Partial Post agglomeration) removed 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 64 place count 85 transition count 152
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 67 place count 82 transition count 149
Iterating global reduction 3 with 3 rules applied. Total rules applied 70 place count 82 transition count 149
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 73 place count 82 transition count 146
Applied a total of 73 rules in 23 ms. Remains 82 /113 variables (removed 31) and now considering 146/180 (removed 34) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 82/113 places, 146/180 transitions.
[2024-05-31 19:58:31] [INFO ] Flatten gal took : 5 ms
[2024-05-31 19:58:31] [INFO ] Flatten gal took : 5 ms
[2024-05-31 19:58:31] [INFO ] Input system was already deterministic with 146 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 113/113 places, 180/180 transitions.
[2024-05-31 19:58:31] [INFO ] Flatten gal took : 6 ms
[2024-05-31 19:58:31] [INFO ] Flatten gal took : 7 ms
[2024-05-31 19:58:31] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 113 transition count 147
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 80 transition count 147
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 66 place count 80 transition count 146
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 79 transition count 146
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 76 place count 75 transition count 142
Applied a total of 76 rules in 11 ms. Remains 75 /113 variables (removed 38) and now considering 142/180 (removed 38) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 75/113 places, 142/180 transitions.
[2024-05-31 19:58:31] [INFO ] Flatten gal took : 5 ms
[2024-05-31 19:58:31] [INFO ] Flatten gal took : 5 ms
[2024-05-31 19:58:31] [INFO ] Input system was already deterministic with 142 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 113/113 places, 180/180 transitions.
[2024-05-31 19:58:31] [INFO ] Flatten gal took : 7 ms
[2024-05-31 19:58:31] [INFO ] Flatten gal took : 6 ms
[2024-05-31 19:58:31] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 113 transition count 145
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 78 transition count 145
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 80 place count 73 transition count 140
Applied a total of 80 rules in 9 ms. Remains 73 /113 variables (removed 40) and now considering 140/180 (removed 40) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 73/113 places, 140/180 transitions.
[2024-05-31 19:58:31] [INFO ] Flatten gal took : 4 ms
[2024-05-31 19:58:31] [INFO ] Flatten gal took : 4 ms
[2024-05-31 19:58:31] [INFO ] Input system was already deterministic with 140 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 113 transition count 159
Reduce places removed 21 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 26 rules applied. Total rules applied 47 place count 92 transition count 154
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 52 place count 87 transition count 154
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 52 place count 87 transition count 153
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 86 transition count 153
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 58 place count 84 transition count 151
Applied a total of 58 rules in 12 ms. Remains 84 /113 variables (removed 29) and now considering 151/180 (removed 29) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 84/113 places, 151/180 transitions.
[2024-05-31 19:58:31] [INFO ] Flatten gal took : 4 ms
[2024-05-31 19:58:31] [INFO ] Flatten gal took : 4 ms
[2024-05-31 19:58:31] [INFO ] Input system was already deterministic with 151 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 1 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 113/113 places, 180/180 transitions.
[2024-05-31 19:58:31] [INFO ] Flatten gal took : 5 ms
[2024-05-31 19:58:31] [INFO ] Flatten gal took : 5 ms
[2024-05-31 19:58:31] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 1 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 113/113 places, 180/180 transitions.
[2024-05-31 19:58:31] [INFO ] Flatten gal took : 5 ms
[2024-05-31 19:58:31] [INFO ] Flatten gal took : 5 ms
[2024-05-31 19:58:31] [INFO ] Input system was already deterministic with 180 transitions.
[2024-05-31 19:58:31] [INFO ] Flatten gal took : 6 ms
[2024-05-31 19:58:31] [INFO ] Flatten gal took : 6 ms
[2024-05-31 19:58:31] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2024-05-31 19:58:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 113 places, 180 transitions and 490 arcs took 4 ms.
Total runtime 27363 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-005-CTLFireability-2024-01
Could not compute solution for formula : CANInsertWithFailure-PT-005-CTLFireability-2024-02
Could not compute solution for formula : CANInsertWithFailure-PT-005-CTLFireability-2024-03
Could not compute solution for formula : CANInsertWithFailure-PT-005-CTLFireability-2024-04
Could not compute solution for formula : CANInsertWithFailure-PT-005-CTLFireability-2024-05
Could not compute solution for formula : CANInsertWithFailure-PT-005-CTLFireability-2024-06
Could not compute solution for formula : CANInsertWithFailure-PT-005-CTLFireability-2024-09
Could not compute solution for formula : CANInsertWithFailure-PT-005-CTLFireability-2024-10
Could not compute solution for formula : CANInsertWithFailure-PT-005-CTLFireability-2024-11
Could not compute solution for formula : CANInsertWithFailure-PT-005-CTLFireability-2023-12
Could not compute solution for formula : CANInsertWithFailure-PT-005-CTLFireability-2023-13
Could not compute solution for formula : CANInsertWithFailure-PT-005-CTLFireability-2023-14
Could not compute solution for formula : CANInsertWithFailure-PT-005-CTLFireability-2023-15

BK_STOP 1717185512083

--------------------
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 CANInsertWithFailure-PT-005-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/624/ctl_0_
ctl formula name CANInsertWithFailure-PT-005-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/624/ctl_1_
ctl formula name CANInsertWithFailure-PT-005-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/624/ctl_2_
ctl formula name CANInsertWithFailure-PT-005-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/624/ctl_3_
ctl formula name CANInsertWithFailure-PT-005-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/624/ctl_4_
ctl formula name CANInsertWithFailure-PT-005-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/624/ctl_5_
ctl formula name CANInsertWithFailure-PT-005-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/624/ctl_6_
ctl formula name CANInsertWithFailure-PT-005-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/624/ctl_7_
ctl formula name CANInsertWithFailure-PT-005-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/624/ctl_8_
ctl formula name CANInsertWithFailure-PT-005-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/624/ctl_9_
ctl formula name CANInsertWithFailure-PT-005-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/624/ctl_10_
ctl formula name CANInsertWithFailure-PT-005-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/624/ctl_11_
ctl formula name CANInsertWithFailure-PT-005-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/624/ctl_12_
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-005"
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-005, 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-171620505100090"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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