Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813695100735.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
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 r041-tajo-167813695100735
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 9.3K Feb 26 01:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 01:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 00:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 00:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 01:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 26 01:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 01:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 9.8M Mar 5 18:22 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-00
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-01
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-02
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-03
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-04
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-05
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-06
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-07
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-08
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-09
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-10
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-11
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-12
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-13
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-14
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678662196827

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
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
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 23:03:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 23:03:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 23:03:19] [INFO ] Load time of PNML (sax parser for PT used): 510 ms
[2023-03-12 23:03:19] [INFO ] Transformed 3684 places.
[2023-03-12 23:03:19] [INFO ] Transformed 9840 transitions.
[2023-03-12 23:03:19] [INFO ] Parsed PT model containing 3684 places and 9840 transitions and 26400 arcs in 705 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 10 resets, run finished after 589 ms. (steps per millisecond=16 ) properties (out of 16) seen :6
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 9840 rows 3684 cols
[2023-03-12 23:03:21] [INFO ] Computed 43 place invariants in 479 ms
[2023-03-12 23:03:23] [INFO ] [Real]Absence check using 41 positive place invariants in 91 ms returned sat
[2023-03-12 23:03:23] [INFO ] [Real]Absence check using 41 positive and 2 generalized place invariants in 67 ms returned sat
[2023-03-12 23:03:23] [INFO ] After 1965ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 23:03:25] [INFO ] [Nat]Absence check using 41 positive place invariants in 304 ms returned sat
[2023-03-12 23:03:25] [INFO ] [Nat]Absence check using 41 positive and 2 generalized place invariants in 68 ms returned sat
[2023-03-12 23:03:41] [INFO ] After 14338ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-12 23:03:41] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-12 23:03:48] [INFO ] After 7552ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-12 23:03:48] [INFO ] After 7556ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-12 23:03:48] [INFO ] After 25065ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 969 ms.
Support contains 145 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.17 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions 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 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Iterating post reduction 1 with 220 rules applied. Total rules applied 400 place count 3504 transition count 9620
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 441 place count 3463 transition count 9620
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 441 place count 3463 transition count 9604
Deduced a syphon composed of 16 places in 5 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 473 place count 3447 transition count 9604
Performed 1487 Post agglomeration using F-continuation condition.Transition count delta: 1487
Deduced a syphon composed of 1487 places in 8 ms
Reduce places removed 1487 places and 0 transitions.
Iterating global reduction 3 with 2974 rules applied. Total rules applied 3447 place count 1960 transition count 8117
Drop transitions removed 1427 transitions
Redundant transition composition rules discarded 1427 transitions
Iterating global reduction 3 with 1427 rules applied. Total rules applied 4874 place count 1960 transition count 6690
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4875 place count 1960 transition count 6689
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4876 place count 1959 transition count 6689
Partial Free-agglomeration rule applied 1574 times.
Drop transitions removed 1574 transitions
Iterating global reduction 4 with 1574 rules applied. Total rules applied 6450 place count 1959 transition count 6689
Partial Free-agglomeration rule applied 630 times.
Drop transitions removed 630 transitions
Iterating global reduction 4 with 630 rules applied. Total rules applied 7080 place count 1959 transition count 6689
Applied a total of 7080 rules in 2447 ms. Remains 1959 /3684 variables (removed 1725) and now considering 6689/9840 (removed 3151) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2449 ms. Remains : 1959/3684 places, 6689/9840 transitions.
Incomplete random walk after 10000 steps, including 48 resets, run finished after 375 ms. (steps per millisecond=26 ) properties (out of 10) seen :3
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :1
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 6689 rows 1959 cols
[2023-03-12 23:03:52] [INFO ] Computed 42 place invariants in 201 ms
[2023-03-12 23:03:53] [INFO ] [Real]Absence check using 40 positive place invariants in 24 ms returned sat
[2023-03-12 23:03:53] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2023-03-12 23:03:53] [INFO ] After 450ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 23:03:53] [INFO ] [Nat]Absence check using 40 positive place invariants in 24 ms returned sat
[2023-03-12 23:03:53] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 26 ms returned sat
[2023-03-12 23:03:58] [INFO ] After 4158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 23:03:58] [INFO ] State equation strengthened by 6184 read => feed constraints.
[2023-03-12 23:04:04] [INFO ] After 5721ms SMT Verify possible using 6184 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 23:04:08] [INFO ] After 9885ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2598 ms.
[2023-03-12 23:04:10] [INFO ] After 17368ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 225 ms.
Support contains 104 out of 1959 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1959/1959 places, 6689/6689 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1959 transition count 6687
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1957 transition count 6687
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 5 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 48 place count 1935 transition count 6665
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 58 place count 1935 transition count 6665
Applied a total of 58 rules in 624 ms. Remains 1935 /1959 variables (removed 24) and now considering 6665/6689 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 625 ms. Remains : 1935/1959 places, 6665/6689 transitions.
Incomplete random walk after 10000 steps, including 49 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 74397 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 74397 steps, saw 29058 distinct states, run finished after 3007 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 6665 rows 1935 cols
[2023-03-12 23:04:15] [INFO ] Computed 42 place invariants in 146 ms
[2023-03-12 23:04:15] [INFO ] [Real]Absence check using 40 positive place invariants in 18 ms returned sat
[2023-03-12 23:04:15] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2023-03-12 23:04:15] [INFO ] After 398ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 23:04:15] [INFO ] [Nat]Absence check using 40 positive place invariants in 16 ms returned sat
[2023-03-12 23:04:15] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 17 ms returned sat
[2023-03-12 23:04:19] [INFO ] After 2961ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 23:04:19] [INFO ] State equation strengthened by 6227 read => feed constraints.
[2023-03-12 23:04:22] [INFO ] After 3639ms SMT Verify possible using 6227 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 23:04:25] [INFO ] After 6276ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1635 ms.
[2023-03-12 23:04:27] [INFO ] After 11415ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 77 ms.
Support contains 99 out of 1935 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1935/1935 places, 6665/6665 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1933 transition count 6663
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 1933 transition count 6663
Applied a total of 5 rules in 542 ms. Remains 1933 /1935 variables (removed 2) and now considering 6663/6665 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 542 ms. Remains : 1933/1935 places, 6663/6665 transitions.
Incomplete random walk after 10000 steps, including 50 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 4) seen :1
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 6663 rows 1933 cols
[2023-03-12 23:04:28] [INFO ] Computed 42 place invariants in 159 ms
[2023-03-12 23:04:28] [INFO ] [Real]Absence check using 40 positive place invariants in 19 ms returned sat
[2023-03-12 23:04:28] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 23 ms returned sat
[2023-03-12 23:04:28] [INFO ] After 425ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 23:04:28] [INFO ] [Nat]Absence check using 40 positive place invariants in 19 ms returned sat
[2023-03-12 23:04:29] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 27 ms returned sat
[2023-03-12 23:04:32] [INFO ] After 3137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 23:04:32] [INFO ] State equation strengthened by 6230 read => feed constraints.
[2023-03-12 23:04:35] [INFO ] After 2761ms SMT Verify possible using 6230 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 23:04:36] [INFO ] After 4472ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1413 ms.
[2023-03-12 23:04:38] [INFO ] After 9545ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 61 ms.
Support contains 84 out of 1933 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1933/1933 places, 6663/6663 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 1927 transition count 6657
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 1927 transition count 6657
Applied a total of 18 rules in 547 ms. Remains 1927 /1933 variables (removed 6) and now considering 6657/6663 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 547 ms. Remains : 1927/1933 places, 6657/6663 transitions.
Incomplete random walk after 10000 steps, including 51 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 87059 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 87059 steps, saw 30005 distinct states, run finished after 3002 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 6657 rows 1927 cols
[2023-03-12 23:04:42] [INFO ] Computed 42 place invariants in 193 ms
[2023-03-12 23:04:42] [INFO ] [Real]Absence check using 40 positive place invariants in 20 ms returned sat
[2023-03-12 23:04:42] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 23 ms returned sat
[2023-03-12 23:04:45] [INFO ] After 3514ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 23:04:46] [INFO ] [Nat]Absence check using 40 positive place invariants in 34 ms returned sat
[2023-03-12 23:04:46] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 34 ms returned sat
[2023-03-12 23:04:49] [INFO ] After 2821ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 23:04:49] [INFO ] State equation strengthened by 6278 read => feed constraints.
[2023-03-12 23:04:51] [INFO ] After 2210ms SMT Verify possible using 6278 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 23:04:53] [INFO ] After 3986ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1343 ms.
[2023-03-12 23:04:54] [INFO ] After 8652ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 34 ms.
Support contains 84 out of 1927 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1927/1927 places, 6657/6657 transitions.
Applied a total of 0 rules in 229 ms. Remains 1927 /1927 variables (removed 0) and now considering 6657/6657 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 232 ms. Remains : 1927/1927 places, 6657/6657 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1927/1927 places, 6657/6657 transitions.
Applied a total of 0 rules in 281 ms. Remains 1927 /1927 variables (removed 0) and now considering 6657/6657 (removed 0) transitions.
[2023-03-12 23:04:55] [INFO ] Invariant cache hit.
[2023-03-12 23:04:56] [INFO ] Implicit Places using invariants in 1692 ms returned []
[2023-03-12 23:04:56] [INFO ] Invariant cache hit.
[2023-03-12 23:04:57] [INFO ] State equation strengthened by 6278 read => feed constraints.
[2023-03-12 23:05:07] [INFO ] Implicit Places using invariants and state equation in 11075 ms returned []
Implicit Place search using SMT with State Equation took 12771 ms to find 0 implicit places.
[2023-03-12 23:05:08] [INFO ] Redundant transitions in 747 ms returned []
[2023-03-12 23:05:08] [INFO ] Invariant cache hit.
[2023-03-12 23:05:11] [INFO ] Dead Transitions using invariants and state equation in 2965 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16779 ms. Remains : 1927/1927 places, 6657/6657 transitions.
Graph (trivial) has 5611 edges and 1927 vertex of which 1372 / 1927 are part of one of the 2 SCC in 8 ms
Free SCC test removed 1370 places
Drop transitions removed 3620 transitions
Ensure Unique test removed 1543 transitions
Reduce isomorphic transitions removed 5163 transitions.
Graph (complete) has 1737 edges and 557 vertex of which 529 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.1 ms
Discarding 28 places :
Also discarding 0 output transitions
Discarding 223 places :
Symmetric choice reduction at 0 with 223 rule applications. Total rules 225 place count 306 transition count 876
Iterating global reduction 0 with 223 rules applied. Total rules applied 448 place count 306 transition count 876
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 197 transitions.
Iterating post reduction 0 with 197 rules applied. Total rules applied 645 place count 306 transition count 679
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 1 with 2 rules applied. Total rules applied 647 place count 305 transition count 678
Drop transitions removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 1 with 49 rules applied. Total rules applied 696 place count 305 transition count 629
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 697 place count 304 transition count 626
Iterating global reduction 1 with 1 rules applied. Total rules applied 698 place count 304 transition count 626
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 699 place count 304 transition count 625
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 707 place count 300 transition count 621
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 709 place count 300 transition count 619
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 718 place count 300 transition count 610
Free-agglomeration rule applied 18 times.
Iterating global reduction 3 with 18 rules applied. Total rules applied 736 place count 300 transition count 592
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 755 place count 282 transition count 591
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 759 place count 278 transition count 587
Iterating global reduction 4 with 4 rules applied. Total rules applied 763 place count 278 transition count 587
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 766 place count 275 transition count 581
Iterating global reduction 4 with 3 rules applied. Total rules applied 769 place count 275 transition count 581
Partial Free-agglomeration rule applied 101 times.
Drop transitions removed 101 transitions
Iterating global reduction 4 with 101 rules applied. Total rules applied 870 place count 275 transition count 581
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 872 place count 275 transition count 579
Applied a total of 872 rules in 491 ms. Remains 275 /1927 variables (removed 1652) and now considering 579/6657 (removed 6078) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 579 rows 275 cols
[2023-03-12 23:05:12] [INFO ] Computed 14 place invariants in 5 ms
[2023-03-12 23:05:12] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-12 23:05:12] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 23:05:12] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-12 23:05:12] [INFO ] After 224ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 23:05:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 23:05:12] [INFO ] After 125ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 23:05:12] [INFO ] After 305ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 145 ms.
[2023-03-12 23:05:12] [INFO ] After 755ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-12 23:05:12] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2023-03-12 23:05:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1927 places, 6657 transitions and 26226 arcs took 56 ms.
[2023-03-12 23:05:13] [INFO ] Flatten gal took : 368 ms
Total runtime 114609 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/539/inv_0_ --invariant=/tmp/539/inv_1_ --invariant=/tmp/539/inv_2_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 13436228 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16085432 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023

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-5348"
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 r041-tajo-167813695100735"
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 ;