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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 11K Feb 25 21:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 25 21:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 21:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 21:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K 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 11K Feb 25 21:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 21:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 21:26 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 2.5M 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-040-ReachabilityFireability-00
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-01
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-02
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-03
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-04
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-05
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-06
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-07
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-08
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-09
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-10
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-11
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-12
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-13
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-14
FORMULA_NAME CANConstruction-PT-040-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678652882468

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-040
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 20:28:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 20:28:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 20:28:04] [INFO ] Load time of PNML (sax parser for PT used): 254 ms
[2023-03-12 20:28:04] [INFO ] Transformed 3682 places.
[2023-03-12 20:28:04] [INFO ] Transformed 6720 transitions.
[2023-03-12 20:28:04] [INFO ] Parsed PT model containing 3682 places and 6720 transitions and 20000 arcs in 343 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 14 resets, run finished after 491 ms. (steps per millisecond=20 ) properties (out of 16) seen :8
FORMULA CANConstruction-PT-040-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :1
FORMULA CANConstruction-PT-040-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 6720 rows 3682 cols
[2023-03-12 20:28:05] [INFO ] Computed 81 place invariants in 89 ms
[2023-03-12 20:28:06] [INFO ] [Real]Absence check using 41 positive place invariants in 64 ms returned sat
[2023-03-12 20:28:06] [INFO ] [Real]Absence check using 41 positive and 40 generalized place invariants in 42 ms returned sat
[2023-03-12 20:28:06] [INFO ] After 1025ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 20:28:07] [INFO ] [Nat]Absence check using 41 positive place invariants in 62 ms returned sat
[2023-03-12 20:28:07] [INFO ] [Nat]Absence check using 41 positive and 40 generalized place invariants in 31 ms returned sat
[2023-03-12 20:28:10] [INFO ] After 3557ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-03-12 20:28:10] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-12 20:28:13] [INFO ] After 2617ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :1 sat :6
[2023-03-12 20:28:17] [INFO ] After 6184ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 2470 ms.
[2023-03-12 20:28:19] [INFO ] After 13209ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
FORMULA CANConstruction-PT-040-ReachabilityFireability-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 5 different solutions.
FORMULA CANConstruction-PT-040-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-040-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-040-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-040-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-040-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 5 properties in 91 ms.
Support contains 50 out of 3682 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3682/3682 places, 6720/6720 transitions.
Drop transitions removed 253 transitions
Trivial Post-agglo rules discarded 253 transitions
Performed 253 trivial Post agglomeration. Transition count delta: 253
Iterating post reduction 0 with 253 rules applied. Total rules applied 253 place count 3682 transition count 6467
Reduce places removed 253 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 256 rules applied. Total rules applied 509 place count 3429 transition count 6464
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 512 place count 3426 transition count 6464
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 512 place count 3426 transition count 6455
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 530 place count 3417 transition count 6455
Discarding 1504 places :
Symmetric choice reduction at 3 with 1504 rule applications. Total rules 2034 place count 1913 transition count 3447
Iterating global reduction 3 with 1504 rules applied. Total rules applied 3538 place count 1913 transition count 3447
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 3598 place count 1883 transition count 3417
Free-agglomeration rule applied 50 times.
Iterating global reduction 3 with 50 rules applied. Total rules applied 3648 place count 1883 transition count 3367
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 3 with 50 rules applied. Total rules applied 3698 place count 1833 transition count 3367
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 4 with 14 rules applied. Total rules applied 3712 place count 1833 transition count 3353
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 3726 place count 1819 transition count 3353
Partial Free-agglomeration rule applied 36 times.
Drop transitions removed 36 transitions
Iterating global reduction 5 with 36 rules applied. Total rules applied 3762 place count 1819 transition count 3353
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 3765 place count 1819 transition count 3353
Applied a total of 3765 rules in 2075 ms. Remains 1819 /3682 variables (removed 1863) and now considering 3353/6720 (removed 3367) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2076 ms. Remains : 1819/3682 places, 3353/6720 transitions.
Incomplete random walk after 10000 steps, including 35 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 175939 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 175939 steps, saw 91274 distinct states, run finished after 3003 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 3353 rows 1819 cols
[2023-03-12 20:28:24] [INFO ] Computed 81 place invariants in 19 ms
[2023-03-12 20:28:25] [INFO ] [Real]Absence check using 41 positive place invariants in 30 ms returned sat
[2023-03-12 20:28:25] [INFO ] [Real]Absence check using 41 positive and 40 generalized place invariants in 27 ms returned sat
[2023-03-12 20:28:25] [INFO ] After 351ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 20:28:25] [INFO ] [Nat]Absence check using 41 positive place invariants in 26 ms returned sat
[2023-03-12 20:28:25] [INFO ] [Nat]Absence check using 41 positive and 40 generalized place invariants in 13 ms returned sat
[2023-03-12 20:28:26] [INFO ] After 1045ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 20:28:26] [INFO ] State equation strengthened by 3211 read => feed constraints.
[2023-03-12 20:28:27] [INFO ] After 580ms SMT Verify possible using 3211 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 20:28:27] [INFO ] After 970ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 306 ms.
[2023-03-12 20:28:27] [INFO ] After 2623ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 50 out of 1819 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1819/1819 places, 3353/3353 transitions.
Applied a total of 0 rules in 149 ms. Remains 1819 /1819 variables (removed 0) and now considering 3353/3353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 1819/1819 places, 3353/3353 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1819/1819 places, 3353/3353 transitions.
Applied a total of 0 rules in 147 ms. Remains 1819 /1819 variables (removed 0) and now considering 3353/3353 (removed 0) transitions.
[2023-03-12 20:28:28] [INFO ] Invariant cache hit.
[2023-03-12 20:28:29] [INFO ] Implicit Places using invariants in 979 ms returned [5, 11, 17, 21, 25, 31, 37, 44, 54, 58, 62, 68, 72, 76, 80, 86, 90, 96, 100, 104, 108, 112, 118, 123, 128, 134, 140, 150, 156, 160, 164, 169, 174, 181, 185, 189, 195, 200]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 983 ms to find 38 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1781/1819 places, 3353/3353 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 1781 transition count 3336
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 1764 transition count 3336
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 37 place count 1761 transition count 3333
Iterating global reduction 2 with 3 rules applied. Total rules applied 40 place count 1761 transition count 3333
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 48 place count 1757 transition count 3329
Applied a total of 48 rules in 315 ms. Remains 1757 /1781 variables (removed 24) and now considering 3329/3353 (removed 24) transitions.
// Phase 1: matrix 3329 rows 1757 cols
[2023-03-12 20:28:29] [INFO ] Computed 43 place invariants in 39 ms
[2023-03-12 20:28:30] [INFO ] Implicit Places using invariants in 926 ms returned []
[2023-03-12 20:28:30] [INFO ] Invariant cache hit.
[2023-03-12 20:28:31] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-12 20:28:53] [INFO ] Implicit Places using invariants and state equation in 23442 ms returned []
Implicit Place search using SMT with State Equation took 24375 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1757/1819 places, 3329/3353 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 25821 ms. Remains : 1757/1819 places, 3329/3353 transitions.
Incomplete random walk after 10000 steps, including 34 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 183983 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 183983 steps, saw 92306 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 20:28:57] [INFO ] Invariant cache hit.
[2023-03-12 20:28:57] [INFO ] [Real]Absence check using 41 positive place invariants in 26 ms returned sat
[2023-03-12 20:28:57] [INFO ] [Real]Absence check using 41 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-12 20:28:57] [INFO ] After 237ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 20:28:57] [INFO ] [Nat]Absence check using 41 positive place invariants in 27 ms returned sat
[2023-03-12 20:28:57] [INFO ] [Nat]Absence check using 41 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-12 20:28:58] [INFO ] After 901ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 20:28:58] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-12 20:28:59] [INFO ] After 581ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 20:28:59] [INFO ] After 875ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 267 ms.
[2023-03-12 20:28:59] [INFO ] After 2350ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 50 out of 1757 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1757/1757 places, 3329/3329 transitions.
Applied a total of 0 rules in 131 ms. Remains 1757 /1757 variables (removed 0) and now considering 3329/3329 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 1757/1757 places, 3329/3329 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1757/1757 places, 3329/3329 transitions.
Applied a total of 0 rules in 108 ms. Remains 1757 /1757 variables (removed 0) and now considering 3329/3329 (removed 0) transitions.
[2023-03-12 20:28:59] [INFO ] Invariant cache hit.
[2023-03-12 20:29:00] [INFO ] Implicit Places using invariants in 876 ms returned []
[2023-03-12 20:29:00] [INFO ] Invariant cache hit.
[2023-03-12 20:29:01] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-12 20:29:23] [INFO ] Implicit Places using invariants and state equation in 23011 ms returned []
Implicit Place search using SMT with State Equation took 23892 ms to find 0 implicit places.
[2023-03-12 20:29:24] [INFO ] Redundant transitions in 252 ms returned []
[2023-03-12 20:29:24] [INFO ] Invariant cache hit.
[2023-03-12 20:29:25] [INFO ] Dead Transitions using invariants and state equation in 1351 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25613 ms. Remains : 1757/1757 places, 3329/3329 transitions.
Graph (trivial) has 2888 edges and 1757 vertex of which 1212 / 1757 are part of one of the 30 SCC in 6 ms
Free SCC test removed 1182 places
Drop transitions removed 2334 transitions
Reduce isomorphic transitions removed 2334 transitions.
Graph (complete) has 1140 edges and 575 vertex of which 524 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.1 ms
Discarding 51 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Drop transitions removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 156 rules applied. Total rules applied 158 place count 524 transition count 815
Reduce places removed 116 places and 0 transitions.
Ensure Unique test removed 113 transitions
Reduce isomorphic transitions removed 113 transitions.
Performed 270 Post agglomeration using F-continuation condition.Transition count delta: 270
Iterating post reduction 1 with 499 rules applied. Total rules applied 657 place count 408 transition count 432
Reduce places removed 270 places and 0 transitions.
Ensure Unique test removed 262 transitions
Reduce isomorphic transitions removed 262 transitions.
Iterating post reduction 2 with 532 rules applied. Total rules applied 1189 place count 138 transition count 170
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 1189 place count 138 transition count 163
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1203 place count 131 transition count 163
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1207 place count 127 transition count 159
Iterating global reduction 3 with 4 rules applied. Total rules applied 1211 place count 127 transition count 159
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1215 place count 125 transition count 161
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 1217 place count 125 transition count 159
Free-agglomeration rule applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 1229 place count 125 transition count 147
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 1241 place count 113 transition count 147
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 1256 place count 113 transition count 147
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1264 place count 105 transition count 139
Iterating global reduction 4 with 8 rules applied. Total rules applied 1272 place count 105 transition count 139
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1274 place count 103 transition count 137
Applied a total of 1274 rules in 72 ms. Remains 103 /1757 variables (removed 1654) and now considering 137/3329 (removed 3192) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 137 rows 103 cols
[2023-03-12 20:29:25] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-12 20:29:25] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-12 20:29:25] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 20:29:25] [INFO ] [Nat]Absence check using 20 positive place invariants in 2 ms returned sat
[2023-03-12 20:29:25] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 20:29:25] [INFO ] After 74ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-12 20:29:25] [INFO ] After 129ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-12 20:29:25] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 2 ms.
[2023-03-12 20:29:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1757 places, 3329 transitions and 13120 arcs took 26 ms.
[2023-03-12 20:29:26] [INFO ] Flatten gal took : 233 ms
Total runtime 82233 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/533/inv_0_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 14604904 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16097392 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-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 CANConstruction-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-167813695000647"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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