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-167813695000655.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 CANConstruction-PT-050, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813695000655
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.2M
-rw-r--r-- 1 mcc users 7.6K Feb 25 21:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 21:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 21:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 25 21:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 21:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 21:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 25 21:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:40 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 3.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 CANConstruction-PT-050-ReachabilityFireability-00
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-01
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-02
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-03
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-04
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-05
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-06
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-07
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-08
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-09
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-10
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-11
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-12
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-13
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-14
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678653691671

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=CANConstruction-PT-050
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 20:41:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 20:41:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 20:41:33] [INFO ] Load time of PNML (sax parser for PT used): 294 ms
[2023-03-12 20:41:33] [INFO ] Transformed 5602 places.
[2023-03-12 20:41:33] [INFO ] Transformed 10400 transitions.
[2023-03-12 20:41:33] [INFO ] Parsed PT model containing 5602 places and 10400 transitions and 31000 arcs in 423 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 11 resets, run finished after 498 ms. (steps per millisecond=20 ) properties (out of 16) seen :9
FORMULA CANConstruction-PT-050-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) 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 7) 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 7) 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 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 10400 rows 5602 cols
[2023-03-12 20:41:34] [INFO ] Computed 101 place invariants in 150 ms
[2023-03-12 20:41:36] [INFO ] [Real]Absence check using 51 positive place invariants in 159 ms returned sat
[2023-03-12 20:41:36] [INFO ] [Real]Absence check using 51 positive and 50 generalized place invariants in 120 ms returned sat
[2023-03-12 20:41:36] [INFO ] After 1794ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2023-03-12 20:41:38] [INFO ] [Nat]Absence check using 51 positive place invariants in 160 ms returned sat
[2023-03-12 20:41:38] [INFO ] [Nat]Absence check using 51 positive and 50 generalized place invariants in 88 ms returned sat
[2023-03-12 20:41:45] [INFO ] After 6393ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-03-12 20:41:45] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-12 20:41:51] [INFO ] After 5565ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :1 sat :6
[2023-03-12 20:41:56] [INFO ] After 10979ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 3719 ms.
[2023-03-12 20:42:00] [INFO ] After 23212ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
FORMULA CANConstruction-PT-050-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 87 ms.
Support contains 125 out of 5602 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5602/5602 places, 10400/10400 transitions.
Drop transitions removed 295 transitions
Trivial Post-agglo rules discarded 295 transitions
Performed 295 trivial Post agglomeration. Transition count delta: 295
Iterating post reduction 0 with 295 rules applied. Total rules applied 295 place count 5602 transition count 10105
Reduce places removed 295 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 297 rules applied. Total rules applied 592 place count 5307 transition count 10103
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 594 place count 5305 transition count 10103
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 594 place count 5305 transition count 10079
Deduced a syphon composed of 24 places in 19 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 642 place count 5281 transition count 10079
Discarding 2348 places :
Symmetric choice reduction at 3 with 2348 rule applications. Total rules 2990 place count 2933 transition count 5383
Iterating global reduction 3 with 2348 rules applied. Total rules applied 5338 place count 2933 transition count 5383
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 4 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 5388 place count 2908 transition count 5358
Free-agglomeration rule applied 33 times.
Iterating global reduction 3 with 33 rules applied. Total rules applied 5421 place count 2908 transition count 5325
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 3 with 33 rules applied. Total rules applied 5454 place count 2875 transition count 5325
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 4 with 28 rules applied. Total rules applied 5482 place count 2875 transition count 5297
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 5510 place count 2847 transition count 5297
Partial Free-agglomeration rule applied 89 times.
Drop transitions removed 89 transitions
Iterating global reduction 5 with 89 rules applied. Total rules applied 5599 place count 2847 transition count 5297
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 5 with 17 rules applied. Total rules applied 5616 place count 2847 transition count 5297
Applied a total of 5616 rules in 3049 ms. Remains 2847 /5602 variables (removed 2755) and now considering 5297/10400 (removed 5103) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3050 ms. Remains : 2847/5602 places, 5297/10400 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 6) seen :2
FORMULA CANConstruction-PT-050-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 5297 rows 2847 cols
[2023-03-12 20:42:03] [INFO ] Computed 101 place invariants in 50 ms
[2023-03-12 20:42:04] [INFO ] [Real]Absence check using 51 positive place invariants in 51 ms returned sat
[2023-03-12 20:42:04] [INFO ] [Real]Absence check using 51 positive and 50 generalized place invariants in 31 ms returned sat
[2023-03-12 20:42:04] [INFO ] After 677ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 20:42:05] [INFO ] [Nat]Absence check using 51 positive place invariants in 69 ms returned sat
[2023-03-12 20:42:05] [INFO ] [Nat]Absence check using 51 positive and 50 generalized place invariants in 32 ms returned sat
[2023-03-12 20:42:07] [INFO ] After 2439ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 20:42:07] [INFO ] State equation strengthened by 5028 read => feed constraints.
[2023-03-12 20:42:10] [INFO ] After 2260ms SMT Verify possible using 5028 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 20:42:12] [INFO ] After 4347ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1655 ms.
[2023-03-12 20:42:13] [INFO ] After 9293ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 41 ms.
Support contains 100 out of 2847 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2847/2847 places, 5297/5297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 2846 transition count 5295
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 2846 transition count 5295
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 38 place count 2828 transition count 5277
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 2827 transition count 5277
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 41 place count 2827 transition count 5276
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 42 place count 2826 transition count 5276
Applied a total of 42 rules in 1254 ms. Remains 2826 /2847 variables (removed 21) and now considering 5276/5297 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1256 ms. Remains : 2826/2847 places, 5276/5297 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 4) seen :1
FORMULA CANConstruction-PT-050-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 5276 rows 2826 cols
[2023-03-12 20:42:15] [INFO ] Computed 101 place invariants in 38 ms
[2023-03-12 20:42:16] [INFO ] [Real]Absence check using 51 positive place invariants in 61 ms returned sat
[2023-03-12 20:42:16] [INFO ] [Real]Absence check using 51 positive and 50 generalized place invariants in 28 ms returned sat
[2023-03-12 20:42:16] [INFO ] After 651ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 20:42:16] [INFO ] [Nat]Absence check using 51 positive place invariants in 53 ms returned sat
[2023-03-12 20:42:16] [INFO ] [Nat]Absence check using 51 positive and 50 generalized place invariants in 26 ms returned sat
[2023-03-12 20:42:18] [INFO ] After 1994ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 20:42:18] [INFO ] State equation strengthened by 5045 read => feed constraints.
[2023-03-12 20:42:20] [INFO ] After 1905ms SMT Verify possible using 5045 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 20:42:22] [INFO ] After 3188ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1146 ms.
[2023-03-12 20:42:23] [INFO ] After 7000ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 24 ms.
Support contains 78 out of 2826 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2826/2826 places, 5276/5276 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 26 place count 2813 transition count 5263
Applied a total of 26 rules in 507 ms. Remains 2813 /2826 variables (removed 13) and now considering 5263/5276 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 507 ms. Remains : 2813/2826 places, 5263/5276 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 3) 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 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 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 93549 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 93549 steps, saw 42269 distinct states, run finished after 3003 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 5263 rows 2813 cols
[2023-03-12 20:42:27] [INFO ] Computed 101 place invariants in 49 ms
[2023-03-12 20:42:27] [INFO ] [Real]Absence check using 51 positive place invariants in 55 ms returned sat
[2023-03-12 20:42:27] [INFO ] [Real]Absence check using 51 positive and 50 generalized place invariants in 45 ms returned sat
[2023-03-12 20:42:27] [INFO ] After 577ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 20:42:28] [INFO ] [Nat]Absence check using 51 positive place invariants in 54 ms returned sat
[2023-03-12 20:42:28] [INFO ] [Nat]Absence check using 51 positive and 50 generalized place invariants in 28 ms returned sat
[2023-03-12 20:42:30] [INFO ] After 2194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 20:42:30] [INFO ] State equation strengthened by 5053 read => feed constraints.
[2023-03-12 20:42:32] [INFO ] After 2060ms SMT Verify possible using 5053 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 20:42:34] [INFO ] After 3820ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1242 ms.
[2023-03-12 20:42:35] [INFO ] After 7902ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 34 ms.
Support contains 78 out of 2813 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2813/2813 places, 5263/5263 transitions.
Applied a total of 0 rules in 315 ms. Remains 2813 /2813 variables (removed 0) and now considering 5263/5263 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 315 ms. Remains : 2813/2813 places, 5263/5263 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2813/2813 places, 5263/5263 transitions.
Applied a total of 0 rules in 309 ms. Remains 2813 /2813 variables (removed 0) and now considering 5263/5263 (removed 0) transitions.
[2023-03-12 20:42:36] [INFO ] Invariant cache hit.
[2023-03-12 20:42:38] [INFO ] Implicit Places using invariants in 1884 ms returned [6, 11, 17, 21, 25, 29, 35, 42, 48, 54, 60, 66, 72, 78, 82, 88, 92, 98, 103, 109, 116, 122, 128, 134, 141, 147, 153, 160, 166, 172, 176, 182, 186, 192, 198, 205, 211, 218, 222, 227, 232, 238, 245, 252, 256, 260, 265, 271, 277, 284]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 1891 ms to find 50 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2763/2813 places, 5263/5263 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 2763 transition count 5252
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 2752 transition count 5252
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 32 place count 2742 transition count 5242
Iterating global reduction 2 with 10 rules applied. Total rules applied 42 place count 2742 transition count 5242
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 96 place count 2715 transition count 5215
Applied a total of 96 rules in 826 ms. Remains 2715 /2763 variables (removed 48) and now considering 5215/5263 (removed 48) transitions.
// Phase 1: matrix 5215 rows 2715 cols
[2023-03-12 20:42:39] [INFO ] Computed 51 place invariants in 104 ms
[2023-03-12 20:42:40] [INFO ] Implicit Places using invariants in 1887 ms returned []
[2023-03-12 20:42:40] [INFO ] Invariant cache hit.
[2023-03-12 20:42:41] [INFO ] State equation strengthened by 4974 read => feed constraints.
[2023-03-12 20:42:52] [INFO ] Implicit Places using invariants and state equation in 11910 ms returned []
Implicit Place search using SMT with State Equation took 13799 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2715/2813 places, 5215/5263 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 16827 ms. Remains : 2715/2813 places, 5215/5263 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 340 ms. (steps per millisecond=29 ) properties (out of 3) 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 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 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 123021 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 123021 steps, saw 75463 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 20:42:56] [INFO ] Invariant cache hit.
[2023-03-12 20:42:56] [INFO ] [Real]Absence check using 51 positive place invariants in 51 ms returned sat
[2023-03-12 20:42:56] [INFO ] After 467ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 20:42:57] [INFO ] [Nat]Absence check using 51 positive place invariants in 37 ms returned sat
[2023-03-12 20:42:59] [INFO ] After 1953ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 20:42:59] [INFO ] State equation strengthened by 4974 read => feed constraints.
[2023-03-12 20:43:01] [INFO ] After 1932ms SMT Verify possible using 4974 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 20:43:02] [INFO ] After 3236ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1055 ms.
[2023-03-12 20:43:03] [INFO ] After 6732ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 32 ms.
Support contains 78 out of 2715 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2715/2715 places, 5215/5215 transitions.
Applied a total of 0 rules in 417 ms. Remains 2715 /2715 variables (removed 0) and now considering 5215/5215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 417 ms. Remains : 2715/2715 places, 5215/5215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2715/2715 places, 5215/5215 transitions.
Applied a total of 0 rules in 402 ms. Remains 2715 /2715 variables (removed 0) and now considering 5215/5215 (removed 0) transitions.
[2023-03-12 20:43:04] [INFO ] Invariant cache hit.
[2023-03-12 20:43:06] [INFO ] Implicit Places using invariants in 1734 ms returned []
[2023-03-12 20:43:06] [INFO ] Invariant cache hit.
[2023-03-12 20:43:06] [INFO ] State equation strengthened by 4974 read => feed constraints.
[2023-03-12 20:43:18] [INFO ] Implicit Places using invariants and state equation in 12263 ms returned []
Implicit Place search using SMT with State Equation took 14004 ms to find 0 implicit places.
[2023-03-12 20:43:18] [INFO ] Redundant transitions in 487 ms returned []
[2023-03-12 20:43:18] [INFO ] Invariant cache hit.
[2023-03-12 20:43:21] [INFO ] Dead Transitions using invariants and state equation in 2380 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17290 ms. Remains : 2715/2715 places, 5215/5215 transitions.
Graph (trivial) has 4207 edges and 2715 vertex of which 1710 / 2715 are part of one of the 34 SCC in 7 ms
Free SCC test removed 1676 places
Drop transitions removed 3318 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 3328 transitions.
Graph (complete) has 2073 edges and 1039 vertex of which 985 are kept as prefixes of interest. Removing 54 places using SCC suffix rule.1 ms
Discarding 54 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Drop transitions removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 97 rules applied. Total rules applied 99 place count 985 transition count 1766
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Performed 720 Post agglomeration using F-continuation condition.Transition count delta: 720
Iterating post reduction 1 with 811 rules applied. Total rules applied 910 place count 939 transition count 1001
Reduce places removed 720 places and 0 transitions.
Ensure Unique test removed 700 transitions
Reduce isomorphic transitions removed 700 transitions.
Iterating post reduction 2 with 1420 rules applied. Total rules applied 2330 place count 219 transition count 301
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 2330 place count 219 transition count 296
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 2340 place count 214 transition count 296
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 2350 place count 204 transition count 286
Iterating global reduction 3 with 10 rules applied. Total rules applied 2360 place count 204 transition count 286
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 2365 place count 204 transition count 281
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 2371 place count 201 transition count 278
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 4 with 2 rules applied. Total rules applied 2373 place count 200 transition count 279
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 2383 place count 200 transition count 269
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 4 rules applied. Total rules applied 2387 place count 200 transition count 265
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2391 place count 196 transition count 265
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2393 place count 195 transition count 265
Free-agglomeration rule applied 18 times.
Iterating global reduction 6 with 18 rules applied. Total rules applied 2411 place count 195 transition count 247
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 2429 place count 177 transition count 247
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 7 with 16 rules applied. Total rules applied 2445 place count 177 transition count 247
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 2453 place count 169 transition count 239
Iterating global reduction 7 with 8 rules applied. Total rules applied 2461 place count 169 transition count 239
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 2465 place count 165 transition count 235
Applied a total of 2465 rules in 106 ms. Remains 165 /2715 variables (removed 2550) and now considering 235/5215 (removed 4980) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 235 rows 165 cols
[2023-03-12 20:43:21] [INFO ] Computed 27 place invariants in 2 ms
[2023-03-12 20:43:21] [INFO ] [Real]Absence check using 27 positive place invariants in 3 ms returned sat
[2023-03-12 20:43:21] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 20:43:21] [INFO ] [Nat]Absence check using 27 positive place invariants in 3 ms returned sat
[2023-03-12 20:43:21] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 20:43:21] [INFO ] After 150ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 98 ms.
[2023-03-12 20:43:21] [INFO ] After 302ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-12 20:43:21] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2023-03-12 20:43:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2715 places, 5215 transitions and 20573 arcs took 47 ms.
[2023-03-12 20:43:22] [INFO ] Flatten gal took : 333 ms
Total runtime 109069 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/544/inv_0_ --invariant=/tmp/544/inv_1_ --invariant=/tmp/544/inv_2_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 13879184 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16095072 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:
++ 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.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="CANConstruction-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-5348"
echo " Executing tool ltsminxred"
echo " Input is CANConstruction-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 r041-tajo-167813695000655"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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