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.r043-tajo-167813697300734.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 smartxred
Input is CANInsertWithFailure-PT-040, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813697300734
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 9.3K Feb 26 01:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 01:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 00:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 00:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 01:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 26 01:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 01:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 9.8M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678802180173

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=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-040
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 13:56:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 13:56:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 13:56:22] [INFO ] Load time of PNML (sax parser for PT used): 295 ms
[2023-03-14 13:56:22] [INFO ] Transformed 3684 places.
[2023-03-14 13:56:22] [INFO ] Transformed 9840 transitions.
[2023-03-14 13:56:22] [INFO ] Parsed PT model containing 3684 places and 9840 transitions and 26400 arcs in 418 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 10 resets, run finished after 573 ms. (steps per millisecond=17 ) properties (out of 16) seen :6
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 9840 rows 3684 cols
[2023-03-14 13:56:23] [INFO ] Computed 43 place invariants in 441 ms
[2023-03-14 13:56:25] [INFO ] After 2029ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-14 13:56:27] [INFO ] [Nat]Absence check using 41 positive place invariants in 89 ms returned sat
[2023-03-14 13:56:27] [INFO ] [Nat]Absence check using 41 positive and 2 generalized place invariants in 63 ms returned sat
[2023-03-14 13:56:43] [INFO ] After 15556ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :9
[2023-03-14 13:56:43] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-14 13:56:50] [INFO ] After 7533ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :1 sat :8
[2023-03-14 13:56:50] [INFO ] After 7536ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-14 13:56:50] [INFO ] After 25064ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :8
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 366 ms.
Support contains 220 out of 3684 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3684/3684 places, 9840/9840 transitions.
Graph (complete) has 13401 edges and 3684 vertex of which 3683 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.17 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 249 transitions
Trivial Post-agglo rules discarded 249 transitions
Performed 249 trivial Post agglomeration. Transition count delta: 249
Iterating post reduction 0 with 249 rules applied. Total rules applied 250 place count 3683 transition count 9591
Reduce places removed 249 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 261 rules applied. Total rules applied 511 place count 3434 transition count 9579
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 523 place count 3422 transition count 9579
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 523 place count 3422 transition count 9576
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 529 place count 3419 transition count 9576
Performed 1215 Post agglomeration using F-continuation condition.Transition count delta: 1215
Deduced a syphon composed of 1215 places in 5 ms
Reduce places removed 1215 places and 0 transitions.
Iterating global reduction 3 with 2430 rules applied. Total rules applied 2959 place count 2204 transition count 8361
Drop transitions removed 1149 transitions
Redundant transition composition rules discarded 1149 transitions
Iterating global reduction 3 with 1149 rules applied. Total rules applied 4108 place count 2204 transition count 7212
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 4112 place count 2204 transition count 7208
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 4116 place count 2200 transition count 7208
Partial Free-agglomeration rule applied 1959 times.
Drop transitions removed 1959 transitions
Iterating global reduction 4 with 1959 rules applied. Total rules applied 6075 place count 2200 transition count 7208
Partial Free-agglomeration rule applied 122 times.
Drop transitions removed 122 transitions
Iterating global reduction 4 with 122 rules applied. Total rules applied 6197 place count 2200 transition count 7208
Applied a total of 6197 rules in 1911 ms. Remains 2200 /3684 variables (removed 1484) and now considering 7208/9840 (removed 2632) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1913 ms. Remains : 2200/3684 places, 7208/9840 transitions.
Incomplete random walk after 10000 steps, including 37 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 9) seen :4
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 7208 rows 2200 cols
[2023-03-14 13:56:53] [INFO ] Computed 42 place invariants in 242 ms
[2023-03-14 13:56:54] [INFO ] After 302ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-14 13:56:54] [INFO ] [Nat]Absence check using 40 positive place invariants in 24 ms returned sat
[2023-03-14 13:56:54] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 22 ms returned sat
[2023-03-14 13:56:59] [INFO ] After 5234ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-14 13:57:00] [INFO ] State equation strengthened by 6002 read => feed constraints.
[2023-03-14 13:57:04] [INFO ] After 4698ms SMT Verify possible using 6002 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2023-03-14 13:57:07] [INFO ] After 7279ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 1481 ms.
[2023-03-14 13:57:08] [INFO ] After 14632ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 49 ms.
Support contains 33 out of 2200 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2200/2200 places, 7208/7208 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 2200 transition count 7201
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 2193 transition count 7200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 2192 transition count 7200
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 3 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 188 place count 2106 transition count 7114
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 195 place count 2106 transition count 7107
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 196 place count 2106 transition count 7106
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 197 place count 2105 transition count 7106
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 198 place count 2105 transition count 7105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 199 place count 2104 transition count 7105
Partial Free-agglomeration rule applied 415 times.
Drop transitions removed 415 transitions
Iterating global reduction 5 with 415 rules applied. Total rules applied 614 place count 2104 transition count 7105
Applied a total of 614 rules in 1738 ms. Remains 2104 /2200 variables (removed 96) and now considering 7105/7208 (removed 103) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1738 ms. Remains : 2104/2200 places, 7105/7208 transitions.
Incomplete random walk after 10000 steps, including 43 resets, run finished after 378 ms. (steps per millisecond=26 ) properties (out of 4) seen :1
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 7105 rows 2104 cols
[2023-03-14 13:57:11] [INFO ] Computed 42 place invariants in 166 ms
[2023-03-14 13:57:11] [INFO ] [Real]Absence check using 40 positive place invariants in 35 ms returned sat
[2023-03-14 13:57:11] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 31 ms returned sat
[2023-03-14 13:57:11] [INFO ] After 375ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-14 13:57:11] [INFO ] [Nat]Absence check using 40 positive place invariants in 15 ms returned sat
[2023-03-14 13:57:11] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2023-03-14 13:57:14] [INFO ] After 2457ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-14 13:57:14] [INFO ] State equation strengthened by 6638 read => feed constraints.
[2023-03-14 13:57:17] [INFO ] After 2673ms SMT Verify possible using 6638 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-14 13:57:18] [INFO ] After 4070ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 809 ms.
[2023-03-14 13:57:19] [INFO ] After 7775ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 17 ms.
Support contains 30 out of 2104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2104/2104 places, 7105/7105 transitions.
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 2104 transition count 7105
Applied a total of 3 rules in 431 ms. Remains 2104 /2104 variables (removed 0) and now considering 7105/7105 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 431 ms. Remains : 2104/2104 places, 7105/7105 transitions.
Incomplete random walk after 10000 steps, including 45 resets, run finished after 285 ms. (steps per millisecond=35 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 128555 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 128555 steps, saw 39275 distinct states, run finished after 3002 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 7105 rows 2104 cols
[2023-03-14 13:57:23] [INFO ] Computed 42 place invariants in 143 ms
[2023-03-14 13:57:23] [INFO ] [Real]Absence check using 40 positive place invariants in 41 ms returned sat
[2023-03-14 13:57:23] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 18 ms returned sat
[2023-03-14 13:57:23] [INFO ] After 514ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-14 13:57:24] [INFO ] [Nat]Absence check using 40 positive place invariants in 15 ms returned sat
[2023-03-14 13:57:24] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 18 ms returned sat
[2023-03-14 13:57:26] [INFO ] After 2084ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-14 13:57:26] [INFO ] State equation strengthened by 6641 read => feed constraints.
[2023-03-14 13:57:28] [INFO ] After 2271ms SMT Verify possible using 6641 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-14 13:57:29] [INFO ] After 3481ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1058 ms.
[2023-03-14 13:57:30] [INFO ] After 7072ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 33 ms.
Support contains 30 out of 2104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2104/2104 places, 7105/7105 transitions.
Applied a total of 0 rules in 168 ms. Remains 2104 /2104 variables (removed 0) and now considering 7105/7105 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 2104/2104 places, 7105/7105 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2104/2104 places, 7105/7105 transitions.
Applied a total of 0 rules in 160 ms. Remains 2104 /2104 variables (removed 0) and now considering 7105/7105 (removed 0) transitions.
[2023-03-14 13:57:31] [INFO ] Invariant cache hit.
[2023-03-14 13:57:33] [INFO ] Implicit Places using invariants in 2442 ms returned []
[2023-03-14 13:57:33] [INFO ] Invariant cache hit.
[2023-03-14 13:57:34] [INFO ] State equation strengthened by 6641 read => feed constraints.
[2023-03-14 13:57:48] [INFO ] Implicit Places using invariants and state equation in 15158 ms returned []
Implicit Place search using SMT with State Equation took 17620 ms to find 0 implicit places.
[2023-03-14 13:57:49] [INFO ] Redundant transitions in 871 ms returned []
[2023-03-14 13:57:49] [INFO ] Invariant cache hit.
[2023-03-14 13:57:53] [INFO ] Dead Transitions using invariants and state equation in 3410 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22074 ms. Remains : 2104/2104 places, 7105/7105 transitions.
Graph (trivial) has 6468 edges and 2104 vertex of which 1871 / 2104 are part of one of the 2 SCC in 5 ms
Free SCC test removed 1869 places
Drop transitions removed 5073 transitions
Ensure Unique test removed 1588 transitions
Reduce isomorphic transitions removed 6661 transitions.
Graph (complete) has 688 edges and 235 vertex of which 121 are kept as prefixes of interest. Removing 114 places using SCC suffix rule.0 ms
Discarding 114 places :
Also discarding 36 output transitions
Drop transitions removed 36 transitions
Drop transitions removed 148 transitions
Reduce isomorphic transitions removed 148 transitions.
Iterating post reduction 0 with 148 rules applied. Total rules applied 150 place count 121 transition count 260
Discarding 70 places :
Symmetric choice reduction at 1 with 70 rule applications. Total rules 220 place count 51 transition count 154
Iterating global reduction 1 with 70 rules applied. Total rules applied 290 place count 51 transition count 154
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 324 place count 51 transition count 120
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 325 place count 50 transition count 118
Iterating global reduction 2 with 1 rules applied. Total rules applied 326 place count 50 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 327 place count 50 transition count 117
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 329 place count 49 transition count 116
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 3 with 2 rules applied. Total rules applied 331 place count 48 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 332 place count 48 transition count 114
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 338 place count 48 transition count 108
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 339 place count 48 transition count 107
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 341 place count 47 transition count 106
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 342 place count 47 transition count 105
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 344 place count 46 transition count 104
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 346 place count 44 transition count 102
Applied a total of 346 rules in 46 ms. Remains 44 /2104 variables (removed 2060) and now considering 102/7105 (removed 7003) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 102 rows 44 cols
[2023-03-14 13:57:53] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-14 13:57:53] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-14 13:57:53] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-14 13:57:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 13:57:53] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-14 13:57:53] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-14 13:57:53] [INFO ] After 118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-14 13:57:53] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 2 ms.
[2023-03-14 13:57:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2104 places, 7105 transitions and 28320 arcs took 29 ms.
[2023-03-14 13:57:54] [INFO ] Flatten gal took : 375 ms
Total runtime 92316 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running CANInsertWithFailure (PT), instance 040
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 2104 places, 7105 transitions, 28320 arcs.
Final Score: 3269728.832
Took : 69 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: CANInsertWithFailure-PT-040-ReachabilityCardinality-07 (reachable & potential((! ( (tk(P1260)) <= ( 1 ) ))))
PROPERTY: CANInsertWithFailure-PT-040-ReachabilityCardinality-10 (reachable &!potential( ( ( (tk(P396)) <= ( 1 ) ) | ( ( (! ( (tk(P70)) <= ( 1 ) )) & ( ( ( 1 ) <= (tk(P89)) ) | ( (tk(P1151)) <= (tk(P272)) ) ) ) | ( ( ( ( (tk(P1623)) <= (tk(P953)) ) | (! ( (tk(P1562)) <= (tk(P458)) )) ) | ( ( ( (tk(P770)) <= (tk(P155)) ) & ( (tk(P1641)) <= (tk(P2029)) ) ) | ( ( ( (tk(P889)) <= (tk(P193)) ) & ( (tk(P1207)) <= ( 0 ) ) ) & ( ( ( 1 ) <= (tk(P110)) ) & ( (tk(P306)) <= (tk(P1560)) ) ) ) ) ) & ( (! ( (tk(P505)) <= ( 0 ) )) | ( (! ( ( 1 ) <= (tk(P1995)) )) & (! ( (tk(P1520)) <= ( 0 ) )) ) ) ) ) )))
PROPERTY: CANInsertWithFailure-PT-040-ReachabilityCardinality-13 (reachable & potential(( ( (! ( (tk(P1841)) <= ( 0 ) )) & (! ( (tk(P259)) <= (tk(P1751)) )) ) & ( (! ( (tk(P944)) <= (tk(P337)) )) & (! ( (tk(P556)) <= (tk(P898)) )) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 14279224 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16091420 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 ReachabilityCardinality -timeout 360 -rebuildPNML
Caught signal 15, terminating.

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANInsertWithFailure-PT-040"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is CANInsertWithFailure-PT-040, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r043-tajo-167813697300734"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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