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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K 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 Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M 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-050-ReachabilityFireability-2024-00
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-2024-01
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-2024-02
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-2024-03
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-2024-04
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-2024-05
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-2024-06
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-2023-07
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-2024-08
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-2024-09
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-2024-10
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-2024-11
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-2024-12
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-2024-13
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-2024-14
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717191989215

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-050
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:46:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 21:46:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:46:30] [INFO ] Load time of PNML (sax parser for PT used): 438 ms
[2024-05-31 21:46:30] [INFO ] Transformed 5604 places.
[2024-05-31 21:46:30] [INFO ] Transformed 15300 transitions.
[2024-05-31 21:46:30] [INFO ] Parsed PT model containing 5604 places and 15300 transitions and 41000 arcs in 623 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (30 resets) in 2740 ms. (14 steps per ms) remains 7/16 properties
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 712 ms. (56 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 764 ms. (52 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 7/7 properties
// Phase 1: matrix 15300 rows 5604 cols
[2024-05-31 21:46:33] [INFO ] Computed 53 invariants in 1137 ms
[2024-05-31 21:46:34] [INFO ] State equation strengthened by 4950 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 5422/5554 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5554 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 46/5600 variables, 23/50 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5600 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5600 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 1/5601 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5601 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20901/20904 variables, and 5653 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5054 ms.
Refiners :[Positive P Invariants (semi-flows): 50/51 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 5601/5604 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 5422/5554 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 21:46:40] [INFO ] Deduced a trap composed of 5 places in 601 ms of which 72 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5554 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5554 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 46/5600 variables, 23/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5600 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5600 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/5601 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5601/20904 variables, and 53 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5096 ms.
Refiners :[Positive P Invariants (semi-flows): 50/51 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/5604 constraints, ReadFeed: 0/4950 constraints, PredecessorRefiner: 0/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 11604ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 132 out of 5604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5604/5604 places, 15300/15300 transitions.
Graph (complete) has 20751 edges and 5604 vertex of which 5603 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.25 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 300 transitions
Trivial Post-agglo rules discarded 300 transitions
Performed 300 trivial Post agglomeration. Transition count delta: 300
Iterating post reduction 0 with 300 rules applied. Total rules applied 301 place count 5603 transition count 15000
Reduce places removed 300 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 301 rules applied. Total rules applied 602 place count 5303 transition count 14999
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 603 place count 5302 transition count 14999
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 603 place count 5302 transition count 14981
Deduced a syphon composed of 18 places in 7 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 639 place count 5284 transition count 14981
Performed 2386 Post agglomeration using F-continuation condition.Transition count delta: 2386
Deduced a syphon composed of 2386 places in 9 ms
Reduce places removed 2386 places and 0 transitions.
Iterating global reduction 3 with 4772 rules applied. Total rules applied 5411 place count 2898 transition count 12595
Drop transitions (Redundant composition of simpler transitions.) removed 2308 transitions
Redundant transition composition rules discarded 2308 transitions
Iterating global reduction 3 with 2308 rules applied. Total rules applied 7719 place count 2898 transition count 10287
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 3 with 28 rules applied. Total rules applied 7747 place count 2898 transition count 10259
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 7775 place count 2870 transition count 10259
Partial Free-agglomeration rule applied 2576 times.
Drop transitions (Partial Free agglomeration) removed 2576 transitions
Iterating global reduction 4 with 2576 rules applied. Total rules applied 10351 place count 2870 transition count 10259
Partial Free-agglomeration rule applied 934 times.
Drop transitions (Partial Free agglomeration) removed 934 transitions
Iterating global reduction 4 with 934 rules applied. Total rules applied 11285 place count 2870 transition count 10259
Applied a total of 11285 rules in 4154 ms. Remains 2870 /5604 variables (removed 2734) and now considering 10259/15300 (removed 5041) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4166 ms. Remains : 2870/5604 places, 10259/15300 transitions.
RANDOM walk for 40000 steps (157 resets) in 1156 ms. (34 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 119 ms. (333 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 49093 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :0 out of 7
Probabilistic random walk after 49093 steps, saw 26785 distinct states, run finished after 3005 ms. (steps per millisecond=16 ) properties seen :0
// Phase 1: matrix 10259 rows 2870 cols
[2024-05-31 21:46:52] [INFO ] Computed 52 invariants in 422 ms
[2024-05-31 21:46:52] [INFO ] State equation strengthened by 9861 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 2689/2821 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2821 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 46/2867 variables, 23/50 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2867 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2867 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 1/2868 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2868 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 10259/13127 variables, 2868/2920 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/13127 variables, 9861/12781 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/13127 variables, 0/12781 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 2/13129 variables, 2/12783 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/13129 variables, 0/12783 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/13129 variables, 0/12783 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13129/13129 variables, and 12783 constraints, problems are : Problem set: 0 solved, 7 unsolved in 22609 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 2870/2870 constraints, ReadFeed: 9861/9861 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 2689/2821 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 21:47:16] [INFO ] Deduced a trap composed of 2 places in 226 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2821 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2821 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 46/2867 variables, 23/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2867 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2867 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/2868 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2868 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 10259/13127 variables, 2868/2921 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/13127 variables, 9861/12782 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/13127 variables, 7/12789 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 13127/13129 variables, and 12789 constraints, problems are : Problem set: 0 solved, 7 unsolved in 45077 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 2868/2870 constraints, ReadFeed: 9861/9861 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 68359ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 132 out of 2870 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2870/2870 places, 10259/10259 transitions.
Applied a total of 0 rules in 360 ms. Remains 2870 /2870 variables (removed 0) and now considering 10259/10259 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 360 ms. Remains : 2870/2870 places, 10259/10259 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2870/2870 places, 10259/10259 transitions.
Applied a total of 0 rules in 351 ms. Remains 2870 /2870 variables (removed 0) and now considering 10259/10259 (removed 0) transitions.
[2024-05-31 21:48:01] [INFO ] Invariant cache hit.
[2024-05-31 21:48:04] [INFO ] Implicit Places using invariants in 2935 ms returned []
Implicit Place search using SMT only with invariants took 2943 ms to find 0 implicit places.
Running 10209 sub problems to find dead transitions.
[2024-05-31 21:48:04] [INFO ] Invariant cache hit.
[2024-05-31 21:48:04] [INFO ] State equation strengthened by 9861 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2869 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10209 unsolved
SMT process timed out in 43864ms, After SMT, problems are : Problem set: 0 solved, 10209 unsolved
Search for dead transitions found 0 dead transitions in 43950ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47271 ms. Remains : 2870/2870 places, 10259/10259 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 7793 edges and 2870 vertex of which 1557 / 2870 are part of one of the 1 SCC in 12 ms
Free SCC test removed 1556 places
Drop transitions (Empty/Sink Transition effects.) removed 3921 transitions
Ensure Unique test removed 2039 transitions
Reduce isomorphic transitions removed 5960 transitions.
Graph (complete) has 4669 edges and 1314 vertex of which 1241 are kept as prefixes of interest. Removing 73 places using SCC suffix rule.1 ms
Discarding 73 places :
Also discarding 24 output transitions
Drop transitions (Output transitions of discarded places.) removed 24 transitions
Drop transitions (Empty/Sink Transition effects.) removed 371 transitions
Reduce isomorphic transitions removed 371 transitions.
Iterating post reduction 0 with 371 rules applied. Total rules applied 373 place count 1241 transition count 3904
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 373 place count 1241 transition count 3897
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 387 place count 1234 transition count 3897
Discarding 570 places :
Symmetric choice reduction at 1 with 570 rule applications. Total rules 957 place count 664 transition count 2430
Iterating global reduction 1 with 570 rules applied. Total rules applied 1527 place count 664 transition count 2430
Ensure Unique test removed 519 transitions
Reduce isomorphic transitions removed 519 transitions.
Iterating post reduction 1 with 519 rules applied. Total rules applied 2046 place count 664 transition count 1911
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 2073 place count 637 transition count 1857
Iterating global reduction 2 with 27 rules applied. Total rules applied 2100 place count 637 transition count 1857
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 2127 place count 637 transition count 1830
Drop transitions (Redundant composition of simpler transitions.) removed 59 transitions
Redundant transition composition rules discarded 59 transitions
Iterating global reduction 3 with 59 rules applied. Total rules applied 2186 place count 637 transition count 1771
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 3 with 18 rules applied. Total rules applied 2204 place count 637 transition count 1753
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 2222 place count 619 transition count 1753
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 2223 place count 619 transition count 1752
Free-agglomeration rule applied 32 times.
Iterating global reduction 5 with 32 rules applied. Total rules applied 2255 place count 619 transition count 1720
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 5 with 67 rules applied. Total rules applied 2322 place count 587 transition count 1685
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 2330 place count 587 transition count 1677
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 2333 place count 587 transition count 1674
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 2336 place count 584 transition count 1674
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 2337 place count 584 transition count 1673
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 7 with 2 rules applied. Total rules applied 2339 place count 583 transition count 1672
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 2341 place count 583 transition count 1670
Partial Free-agglomeration rule applied 338 times.
Drop transitions (Partial Free agglomeration) removed 338 transitions
Iterating global reduction 7 with 338 rules applied. Total rules applied 2679 place count 583 transition count 1670
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 2682 place count 583 transition count 1667
Partial Post-agglomeration rule applied 49 times.
Drop transitions (Partial Post agglomeration) removed 49 transitions
Iterating global reduction 7 with 49 rules applied. Total rules applied 2731 place count 583 transition count 1667
Discarding 49 places :
Symmetric choice reduction at 7 with 49 rule applications. Total rules 2780 place count 534 transition count 1618
Iterating global reduction 7 with 49 rules applied. Total rules applied 2829 place count 534 transition count 1618
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 7 with 42 rules applied. Total rules applied 2871 place count 534 transition count 1576
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 2884 place count 534 transition count 1563
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 2885 place count 533 transition count 1562
Applied a total of 2885 rules in 7252 ms. Remains 533 /2870 variables (removed 2337) and now considering 1562/10259 (removed 8697) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 1562 rows 533 cols
[2024-05-31 21:48:55] [INFO ] Computed 26 invariants in 11 ms
[2024-05-31 21:48:55] [INFO ] [Real]Absence check using 26 positive place invariants in 4 ms returned sat
[2024-05-31 21:48:55] [INFO ] After 172ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-31 21:48:55] [INFO ] [Nat]Absence check using 26 positive place invariants in 4 ms returned sat
[2024-05-31 21:48:56] [INFO ] After 705ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
TRAPS : Iteration 0
[2024-05-31 21:48:57] [INFO ] After 1352ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
[2024-05-31 21:48:57] [INFO ] After 1995ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Over-approximation ignoring read arcs solved 0 properties in 9488 ms.
[2024-05-31 21:48:57] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-05-31 21:48:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2870 places, 10259 transitions and 40738 arcs took 39 ms.
[2024-05-31 21:48:58] [INFO ] Flatten gal took : 539 ms
Total runtime 148176 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-050-ReachabilityFireability-2024-02
Could not compute solution for formula : CANInsertWithFailure-PT-050-ReachabilityFireability-2024-04
Could not compute solution for formula : CANInsertWithFailure-PT-050-ReachabilityFireability-2023-07
Could not compute solution for formula : CANInsertWithFailure-PT-050-ReachabilityFireability-2024-09
Could not compute solution for formula : CANInsertWithFailure-PT-050-ReachabilityFireability-2024-10
Could not compute solution for formula : CANInsertWithFailure-PT-050-ReachabilityFireability-2024-11
Could not compute solution for formula : CANInsertWithFailure-PT-050-ReachabilityFireability-2024-15

BK_STOP 1717192138814

--------------------
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-050-ReachabilityFireability-2024-02
rfs formula type AG
rfs formula formula --invariant=/tmp/552/inv_0_
rfs formula name CANInsertWithFailure-PT-050-ReachabilityFireability-2024-04
rfs formula type AG
rfs formula formula --invariant=/tmp/552/inv_1_
rfs formula name CANInsertWithFailure-PT-050-ReachabilityFireability-2023-07
rfs formula type EF
rfs formula formula --invariant=/tmp/552/inv_2_
rfs formula name CANInsertWithFailure-PT-050-ReachabilityFireability-2024-09
rfs formula type AG
rfs formula formula --invariant=/tmp/552/inv_3_
rfs formula name CANInsertWithFailure-PT-050-ReachabilityFireability-2024-10
rfs formula type EF
rfs formula formula --invariant=/tmp/552/inv_4_
rfs formula name CANInsertWithFailure-PT-050-ReachabilityFireability-2024-11
rfs formula type EF
rfs formula formula --invariant=/tmp/552/inv_5_
rfs formula name CANInsertWithFailure-PT-050-ReachabilityFireability-2024-15
rfs formula type EF
rfs formula formula --invariant=/tmp/552/inv_6_
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-050"
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-050, 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-171620505200135"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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