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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K 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 5.0K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K 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.0K 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 9.8M 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-040-ReachabilityFireability-2024-00
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-2024-01
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-2024-02
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-2024-03
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-2024-04
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-2023-05
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-2024-06
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-2024-07
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-2024-08
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-2024-09
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-2024-10
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-2024-11
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-2024-12
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-2024-13
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-2024-14
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717190587239

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-040
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:23:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 21:23:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:23:08] [INFO ] Load time of PNML (sax parser for PT used): 366 ms
[2024-05-31 21:23:08] [INFO ] Transformed 3684 places.
[2024-05-31 21:23:08] [INFO ] Transformed 9840 transitions.
[2024-05-31 21:23:08] [INFO ] Parsed PT model containing 3684 places and 9840 transitions and 26400 arcs in 498 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (39 resets) in 2554 ms. (15 steps per ms) remains 8/16 properties
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 112 ms. (354 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 356 ms. (112 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 477 ms. (83 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 8/8 properties
// Phase 1: matrix 9840 rows 3684 cols
[2024-05-31 21:23:10] [INFO ] Computed 43 invariants in 463 ms
[2024-05-31 21:23:10] [INFO ] State equation strengthened by 3160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 3478/3659 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3659 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 24/3683 variables, 12/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3683 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3683 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 1/3684 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3684 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 13524/13524 variables, and 3727 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5043 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 3684/3684 constraints, ReadFeed: 0/3160 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 3478/3659 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 21:23:17] [INFO ] Deduced a trap composed of 5 places in 464 ms of which 56 ms to minimize.
[2024-05-31 21:23:17] [INFO ] Deduced a trap composed of 5 places in 416 ms of which 7 ms to minimize.
[2024-05-31 21:23:18] [INFO ] Deduced a trap composed of 5 places in 439 ms of which 7 ms to minimize.
[2024-05-31 21:23:18] [INFO ] Deduced a trap composed of 5 places in 449 ms of which 7 ms to minimize.
[2024-05-31 21:23:18] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 1 ms to minimize.
[2024-05-31 21:23:19] [INFO ] Deduced a trap composed of 5 places in 350 ms of which 5 ms to minimize.
[2024-05-31 21:23:19] [INFO ] Deduced a trap composed of 5 places in 382 ms of which 6 ms to minimize.
[2024-05-31 21:23:20] [INFO ] Deduced a trap composed of 5 places in 377 ms of which 6 ms to minimize.
[2024-05-31 21:23:20] [INFO ] Deduced a trap composed of 5 places in 376 ms of which 6 ms to minimize.
[2024-05-31 21:23:21] [INFO ] Deduced a trap composed of 5 places in 387 ms of which 6 ms to minimize.
[2024-05-31 21:23:21] [INFO ] Deduced a trap composed of 5 places in 403 ms of which 6 ms to minimize.
SMT process timed out in 11181ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 181 out of 3684 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3684/3684 places, 9840/9840 transitions.
Graph (complete) has 13401 edges and 3684 vertex of which 3683 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 179 transitions
Trivial Post-agglo rules discarded 179 transitions
Performed 179 trivial Post agglomeration. Transition count delta: 179
Iterating post reduction 0 with 179 rules applied. Total rules applied 180 place count 3683 transition count 9661
Reduce places removed 179 places and 0 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Iterating post reduction 1 with 219 rules applied. Total rules applied 399 place count 3504 transition count 9621
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 439 place count 3464 transition count 9621
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 439 place count 3464 transition count 9608
Deduced a syphon composed of 13 places in 7 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 465 place count 3451 transition count 9608
Performed 1436 Post agglomeration using F-continuation condition.Transition count delta: 1436
Deduced a syphon composed of 1436 places in 6 ms
Reduce places removed 1436 places and 0 transitions.
Iterating global reduction 3 with 2872 rules applied. Total rules applied 3337 place count 2015 transition count 8172
Drop transitions (Redundant composition of simpler transitions.) removed 1375 transitions
Redundant transition composition rules discarded 1375 transitions
Iterating global reduction 3 with 1375 rules applied. Total rules applied 4712 place count 2015 transition count 6797
Partial Free-agglomeration rule applied 1632 times.
Drop transitions (Partial Free agglomeration) removed 1632 transitions
Iterating global reduction 3 with 1632 rules applied. Total rules applied 6344 place count 2015 transition count 6797
Partial Free-agglomeration rule applied 490 times.
Drop transitions (Partial Free agglomeration) removed 490 transitions
Iterating global reduction 3 with 490 rules applied. Total rules applied 6834 place count 2015 transition count 6797
Applied a total of 6834 rules in 2133 ms. Remains 2015 /3684 variables (removed 1669) and now considering 6797/9840 (removed 3043) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2144 ms. Remains : 2015/3684 places, 6797/9840 transitions.
RANDOM walk for 40000 steps (184 resets) in 864 ms. (46 steps per ms) remains 5/8 properties
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 5/5 properties
// Phase 1: matrix 6797 rows 2015 cols
[2024-05-31 21:23:24] [INFO ] Computed 42 invariants in 223 ms
[2024-05-31 21:23:24] [INFO ] State equation strengthened by 6114 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1824/1986 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1986 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 28/2014 variables, 14/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2014 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2014 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1/2015 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2015 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 6797/8812 variables, 2015/2057 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8812 variables, 6114/8171 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8812 variables, 0/8171 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/8812 variables, 0/8171 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8812/8812 variables, and 8171 constraints, problems are : Problem set: 0 solved, 5 unsolved in 7154 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 2015/2015 constraints, ReadFeed: 6114/6114 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1824/1986 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 21:23:32] [INFO ] Deduced a trap composed of 3 places in 234 ms of which 4 ms to minimize.
[2024-05-31 21:23:32] [INFO ] Deduced a trap composed of 3 places in 224 ms of which 4 ms to minimize.
[2024-05-31 21:23:32] [INFO ] Deduced a trap composed of 3 places in 220 ms of which 4 ms to minimize.
[2024-05-31 21:23:33] [INFO ] Deduced a trap composed of 3 places in 224 ms of which 4 ms to minimize.
[2024-05-31 21:23:33] [INFO ] Deduced a trap composed of 3 places in 221 ms of which 4 ms to minimize.
[2024-05-31 21:23:33] [INFO ] Deduced a trap composed of 3 places in 224 ms of which 4 ms to minimize.
[2024-05-31 21:23:33] [INFO ] Deduced a trap composed of 3 places in 229 ms of which 4 ms to minimize.
[2024-05-31 21:23:34] [INFO ] Deduced a trap composed of 3 places in 207 ms of which 4 ms to minimize.
[2024-05-31 21:23:34] [INFO ] Deduced a trap composed of 3 places in 209 ms of which 4 ms to minimize.
[2024-05-31 21:23:34] [INFO ] Deduced a trap composed of 3 places in 206 ms of which 3 ms to minimize.
[2024-05-31 21:23:34] [INFO ] Deduced a trap composed of 3 places in 214 ms of which 3 ms to minimize.
[2024-05-31 21:23:35] [INFO ] Deduced a trap composed of 3 places in 224 ms of which 4 ms to minimize.
[2024-05-31 21:23:35] [INFO ] Deduced a trap composed of 3 places in 224 ms of which 3 ms to minimize.
[2024-05-31 21:23:35] [INFO ] Deduced a trap composed of 3 places in 223 ms of which 3 ms to minimize.
[2024-05-31 21:23:35] [INFO ] Deduced a trap composed of 3 places in 223 ms of which 4 ms to minimize.
[2024-05-31 21:23:36] [INFO ] Deduced a trap composed of 3 places in 226 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1986 variables, 16/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1986 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 28/2014 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2014 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2014 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/2015 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2015 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 6797/8812 variables, 2015/2073 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8812 variables, 6114/8187 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8812 variables, 5/8192 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8812 variables, 0/8192 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/8812 variables, 0/8192 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8812/8812 variables, and 8192 constraints, problems are : Problem set: 0 solved, 5 unsolved in 45032 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 2015/2015 constraints, ReadFeed: 6114/6114 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 16/16 constraints]
After SMT, in 52604ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-2024-15 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 2620 ms.
Support contains 158 out of 2015 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2015/2015 places, 6797/6797 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2015 transition count 6796
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 2014 transition count 6795
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 2013 transition count 6795
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4 place count 2013 transition count 6794
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6 place count 2012 transition count 6794
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 38 place count 1996 transition count 6778
Partial Free-agglomeration rule applied 42 times.
Drop transitions (Partial Free agglomeration) removed 42 transitions
Iterating global reduction 3 with 42 rules applied. Total rules applied 80 place count 1996 transition count 6778
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 1996 transition count 6778
Applied a total of 81 rules in 917 ms. Remains 1996 /2015 variables (removed 19) and now considering 6778/6797 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 917 ms. Remains : 1996/2015 places, 6778/6797 transitions.
RANDOM walk for 40000 steps (191 resets) in 670 ms. (59 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 87659 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :0 out of 4
Probabilistic random walk after 87659 steps, saw 29007 distinct states, run finished after 3005 ms. (steps per millisecond=29 ) properties seen :0
// Phase 1: matrix 6778 rows 1996 cols
[2024-05-31 21:24:23] [INFO ] Computed 42 invariants in 164 ms
[2024-05-31 21:24:23] [INFO ] State equation strengthened by 6182 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1809/1967 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1967 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 28/1995 variables, 14/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1995 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1995 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1/1996 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1996 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 6778/8774 variables, 1996/2038 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8774 variables, 6182/8220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8774 variables, 0/8220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/8774 variables, 0/8220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8774/8774 variables, and 8220 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5034 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1996/1996 constraints, ReadFeed: 6182/6182 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1809/1967 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 21:24:29] [INFO ] Deduced a trap composed of 3 places in 225 ms of which 4 ms to minimize.
[2024-05-31 21:24:29] [INFO ] Deduced a trap composed of 3 places in 218 ms of which 3 ms to minimize.
[2024-05-31 21:24:30] [INFO ] Deduced a trap composed of 3 places in 219 ms of which 4 ms to minimize.
[2024-05-31 21:24:30] [INFO ] Deduced a trap composed of 3 places in 221 ms of which 4 ms to minimize.
[2024-05-31 21:24:30] [INFO ] Deduced a trap composed of 3 places in 225 ms of which 4 ms to minimize.
[2024-05-31 21:24:30] [INFO ] Deduced a trap composed of 5 places in 220 ms of which 4 ms to minimize.
[2024-05-31 21:24:31] [INFO ] Deduced a trap composed of 3 places in 233 ms of which 4 ms to minimize.
[2024-05-31 21:24:31] [INFO ] Deduced a trap composed of 3 places in 232 ms of which 4 ms to minimize.
[2024-05-31 21:24:31] [INFO ] Deduced a trap composed of 3 places in 233 ms of which 4 ms to minimize.
[2024-05-31 21:24:31] [INFO ] Deduced a trap composed of 4 places in 228 ms of which 3 ms to minimize.
[2024-05-31 21:24:32] [INFO ] Deduced a trap composed of 3 places in 226 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1967 variables, 11/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1967 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 28/1995 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1995 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1995 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/1996 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1996 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 6778/8774 variables, 1996/2049 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8774 variables, 6182/8231 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8774 variables, 4/8235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8774 variables, 0/8235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/8774 variables, 0/8235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8774/8774 variables, and 8235 constraints, problems are : Problem set: 0 solved, 4 unsolved in 20475 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1996/1996 constraints, ReadFeed: 6182/6182 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 11/11 constraints]
After SMT, in 25814ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 297 ms.
Support contains 158 out of 1996 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1996/1996 places, 6778/6778 transitions.
Applied a total of 0 rules in 164 ms. Remains 1996 /1996 variables (removed 0) and now considering 6778/6778 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 1996/1996 places, 6778/6778 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1996/1996 places, 6778/6778 transitions.
Applied a total of 0 rules in 153 ms. Remains 1996 /1996 variables (removed 0) and now considering 6778/6778 (removed 0) transitions.
[2024-05-31 21:24:50] [INFO ] Invariant cache hit.
[2024-05-31 21:24:51] [INFO ] Implicit Places using invariants in 1445 ms returned []
[2024-05-31 21:24:51] [INFO ] Invariant cache hit.
[2024-05-31 21:24:53] [INFO ] State equation strengthened by 6182 read => feed constraints.
[2024-05-31 21:25:23] [INFO ] Performed 1221/1996 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 21:25:40] [INFO ] Implicit Places using invariants and state equation in 48530 ms returned []
Implicit Place search using SMT with State Equation took 49981 ms to find 0 implicit places.
[2024-05-31 21:25:40] [INFO ] Redundant transitions in 671 ms returned []
Running 6738 sub problems to find dead transitions.
[2024-05-31 21:25:40] [INFO ] Invariant cache hit.
[2024-05-31 21:25:40] [INFO ] State equation strengthened by 6182 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1995 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6738 unsolved
SMT process timed out in 37053ms, After SMT, problems are : Problem set: 0 solved, 6738 unsolved
Search for dead transitions found 0 dead transitions in 37113ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87949 ms. Remains : 1996/1996 places, 6778/6778 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 5100 edges and 1996 vertex of which 1146 / 1996 are part of one of the 2 SCC in 4 ms
Free SCC test removed 1144 places
Drop transitions (Empty/Sink Transition effects.) removed 2867 transitions
Ensure Unique test removed 1394 transitions
Reduce isomorphic transitions removed 4261 transitions.
Graph (complete) has 2762 edges and 852 vertex of which 837 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 0 output transitions
Discarding 304 places :
Symmetric choice reduction at 0 with 304 rule applications. Total rules 306 place count 533 transition count 1631
Iterating global reduction 0 with 304 rules applied. Total rules applied 610 place count 533 transition count 1631
Ensure Unique test removed 265 transitions
Reduce isomorphic transitions removed 265 transitions.
Iterating post reduction 0 with 265 rules applied. Total rules applied 875 place count 533 transition count 1366
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 898 place count 510 transition count 1320
Iterating global reduction 1 with 23 rules applied. Total rules applied 921 place count 510 transition count 1320
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 944 place count 510 transition count 1297
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 946 place count 509 transition count 1296
Drop transitions (Redundant composition of simpler transitions.) removed 65 transitions
Redundant transition composition rules discarded 65 transitions
Iterating global reduction 2 with 65 rules applied. Total rules applied 1011 place count 509 transition count 1231
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 1019 place count 505 transition count 1227
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 1031 place count 505 transition count 1215
Free-agglomeration rule applied 36 times with reduction of 6 identical transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 1067 place count 505 transition count 1173
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 62 rules applied. Total rules applied 1129 place count 469 transition count 1147
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 1131 place count 469 transition count 1145
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1132 place count 469 transition count 1144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1133 place count 468 transition count 1144
Partial Free-agglomeration rule applied 245 times.
Drop transitions (Partial Free agglomeration) removed 245 transitions
Iterating global reduction 4 with 245 rules applied. Total rules applied 1378 place count 468 transition count 1144
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 1380 place count 468 transition count 1142
Applied a total of 1380 rules in 1092 ms. Remains 468 /1996 variables (removed 1528) and now considering 1142/6778 (removed 5636) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1142 rows 468 cols
[2024-05-31 21:26:19] [INFO ] Computed 27 invariants in 19 ms
[2024-05-31 21:26:19] [INFO ] [Real]Absence check using 27 positive place invariants in 8 ms returned sat
[2024-05-31 21:26:19] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-31 21:26:19] [INFO ] [Nat]Absence check using 27 positive place invariants in 8 ms returned sat
[2024-05-31 21:26:19] [INFO ] After 568ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-31 21:26:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:26:20] [INFO ] After 374ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-31 21:26:20] [INFO ] After 823ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-31 21:26:21] [INFO ] After 1900ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 3195 ms.
[2024-05-31 21:26:21] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-05-31 21:26:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1996 places, 6778 transitions and 26351 arcs took 28 ms.
[2024-05-31 21:26:21] [INFO ] Flatten gal took : 377 ms
Total runtime 193423 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-040-ReachabilityFireability-2024-01
Could not compute solution for formula : CANInsertWithFailure-PT-040-ReachabilityFireability-2023-05
Could not compute solution for formula : CANInsertWithFailure-PT-040-ReachabilityFireability-2024-06
Could not compute solution for formula : CANInsertWithFailure-PT-040-ReachabilityFireability-2024-13

BK_STOP 1717190782007

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name CANInsertWithFailure-PT-040-ReachabilityFireability-2024-01
rfs formula type AG
rfs formula formula --invariant=/tmp/669/inv_0_
rfs formula name CANInsertWithFailure-PT-040-ReachabilityFireability-2023-05
rfs formula type EF
rfs formula formula --invariant=/tmp/669/inv_1_
rfs formula name CANInsertWithFailure-PT-040-ReachabilityFireability-2024-06
rfs formula type EF
rfs formula formula --invariant=/tmp/669/inv_2_
rfs formula name CANInsertWithFailure-PT-040-ReachabilityFireability-2024-13
rfs formula type AG
rfs formula formula --invariant=/tmp/669/inv_3_
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-040"
export BK_EXAMINATION="ReachabilityFireability"
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-040, examination is ReachabilityFireability"
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-171620505200127"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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