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.r042-tajo-167813696100718.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 marciexred
Input is CANInsertWithFailure-PT-020, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813696100718
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.1M
-rw-r--r-- 1 mcc users 9.6K Feb 26 00:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 00:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 00:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 00:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Feb 26 01:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 173K Feb 26 01:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 00:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 26 00:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K 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.6M 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-020-ReachabilityCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678743757681

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=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-020
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 21:42:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 21:42:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 21:42:39] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2023-03-13 21:42:39] [INFO ] Transformed 1044 places.
[2023-03-13 21:42:39] [INFO ] Transformed 2520 transitions.
[2023-03-13 21:42:39] [INFO ] Parsed PT model containing 1044 places and 2520 transitions and 6800 arcs in 267 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 20 resets, run finished after 461 ms. (steps per millisecond=21 ) properties (out of 16) seen :9
FORMULA CANInsertWithFailure-PT-020-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-020-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-020-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-020-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-020-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-020-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-020-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-020-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-020-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) 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 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :1
FORMULA CANInsertWithFailure-PT-020-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2520 rows 1044 cols
[2023-03-13 21:42:40] [INFO ] Computed 23 place invariants in 67 ms
[2023-03-13 21:42:41] [INFO ] After 368ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 21:42:41] [INFO ] [Nat]Absence check using 21 positive place invariants in 13 ms returned sat
[2023-03-13 21:42:41] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 8 ms returned sat
[2023-03-13 21:42:43] [INFO ] After 2012ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-13 21:42:43] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-13 21:42:46] [INFO ] After 3249ms SMT Verify possible using 780 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-13 21:42:48] [INFO ] After 5514ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1991 ms.
[2023-03-13 21:42:50] [INFO ] After 9861ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 108 ms.
Support contains 139 out of 1044 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1044/1044 places, 2520/2520 transitions.
Graph (complete) has 3501 edges and 1044 vertex of which 1043 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 87 place count 1043 transition count 2434
Reduce places removed 86 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 104 rules applied. Total rules applied 191 place count 957 transition count 2416
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 209 place count 939 transition count 2416
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 209 place count 939 transition count 2409
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 223 place count 932 transition count 2409
Performed 192 Post agglomeration using F-continuation condition.Transition count delta: 192
Deduced a syphon composed of 192 places in 2 ms
Reduce places removed 192 places and 0 transitions.
Iterating global reduction 3 with 384 rules applied. Total rules applied 607 place count 740 transition count 2217
Drop transitions removed 173 transitions
Redundant transition composition rules discarded 173 transitions
Iterating global reduction 3 with 173 rules applied. Total rules applied 780 place count 740 transition count 2044
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 785 place count 740 transition count 2039
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 790 place count 735 transition count 2039
Partial Free-agglomeration rule applied 560 times.
Drop transitions removed 560 transitions
Iterating global reduction 4 with 560 rules applied. Total rules applied 1350 place count 735 transition count 2039
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 4 with 99 rules applied. Total rules applied 1449 place count 735 transition count 2039
Applied a total of 1449 rules in 457 ms. Remains 735 /1044 variables (removed 309) and now considering 2039/2520 (removed 481) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 458 ms. Remains : 735/1044 places, 2039/2520 transitions.
Incomplete random walk after 10000 steps, including 52 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 224619 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 224619 steps, saw 47519 distinct states, run finished after 3002 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2039 rows 735 cols
[2023-03-13 21:42:54] [INFO ] Computed 22 place invariants in 58 ms
[2023-03-13 21:42:55] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 21:42:55] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-13 21:42:55] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-13 21:42:56] [INFO ] After 1062ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-13 21:42:56] [INFO ] State equation strengthened by 1198 read => feed constraints.
[2023-03-13 21:42:58] [INFO ] After 1745ms SMT Verify possible using 1198 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-13 21:43:00] [INFO ] After 4139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1428 ms.
[2023-03-13 21:43:02] [INFO ] After 6875ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
FORMULA CANInsertWithFailure-PT-020-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 77 ms.
Support contains 109 out of 735 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 735/735 places, 2039/2039 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 735 transition count 2037
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 733 transition count 2036
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 732 transition count 2036
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 26 place count 722 transition count 2026
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 722 transition count 2025
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 28 place count 721 transition count 2025
Partial Free-agglomeration rule applied 59 times.
Drop transitions removed 59 transitions
Iterating global reduction 4 with 59 rules applied. Total rules applied 87 place count 721 transition count 2025
Partial Free-agglomeration rule applied 45 times.
Drop transitions removed 45 transitions
Iterating global reduction 4 with 45 rules applied. Total rules applied 132 place count 721 transition count 2025
Applied a total of 132 rules in 239 ms. Remains 721 /735 variables (removed 14) and now considering 2025/2039 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 239 ms. Remains : 721/735 places, 2025/2039 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 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 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) 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 5) seen :0
Interrupted probabilistic random walk after 225490 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :{}
Probabilistic random walk after 225490 steps, saw 46083 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2025 rows 721 cols
[2023-03-13 21:43:05] [INFO ] Computed 22 place invariants in 50 ms
[2023-03-13 21:43:06] [INFO ] After 172ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 21:43:06] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2023-03-13 21:43:06] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 7 ms returned sat
[2023-03-13 21:43:07] [INFO ] After 1071ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 21:43:07] [INFO ] State equation strengthened by 1328 read => feed constraints.
[2023-03-13 21:43:08] [INFO ] After 1499ms SMT Verify possible using 1328 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-13 21:43:10] [INFO ] After 2943ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1077 ms.
[2023-03-13 21:43:11] [INFO ] After 5377ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
FORMULA CANInsertWithFailure-PT-020-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 72 ms.
Support contains 102 out of 721 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 721/721 places, 2025/2025 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 721 transition count 2024
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 720 transition count 2023
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 719 transition count 2023
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 8 place count 717 transition count 2021
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 14 place count 717 transition count 2021
Applied a total of 14 rules in 143 ms. Remains 717 /721 variables (removed 4) and now considering 2021/2025 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 717/721 places, 2021/2025 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 34 ms. (steps per millisecond=294 ) 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 3 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 224859 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 224859 steps, saw 46257 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2021 rows 717 cols
[2023-03-13 21:43:15] [INFO ] Computed 22 place invariants in 48 ms
[2023-03-13 21:43:15] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 21:43:15] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2023-03-13 21:43:15] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-13 21:43:16] [INFO ] After 919ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 21:43:16] [INFO ] State equation strengthened by 1336 read => feed constraints.
[2023-03-13 21:43:17] [INFO ] After 1537ms SMT Verify possible using 1336 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 21:43:19] [INFO ] After 2793ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 999 ms.
[2023-03-13 21:43:20] [INFO ] After 4945ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 23 ms.
Support contains 102 out of 717 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 717/717 places, 2021/2021 transitions.
Applied a total of 0 rules in 43 ms. Remains 717 /717 variables (removed 0) and now considering 2021/2021 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 717/717 places, 2021/2021 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 717/717 places, 2021/2021 transitions.
Applied a total of 0 rules in 43 ms. Remains 717 /717 variables (removed 0) and now considering 2021/2021 (removed 0) transitions.
[2023-03-13 21:43:20] [INFO ] Invariant cache hit.
[2023-03-13 21:43:20] [INFO ] Implicit Places using invariants in 505 ms returned []
[2023-03-13 21:43:20] [INFO ] Invariant cache hit.
[2023-03-13 21:43:21] [INFO ] State equation strengthened by 1336 read => feed constraints.
[2023-03-13 21:43:24] [INFO ] Implicit Places using invariants and state equation in 3650 ms returned []
Implicit Place search using SMT with State Equation took 4164 ms to find 0 implicit places.
[2023-03-13 21:43:24] [INFO ] Redundant transitions in 138 ms returned []
[2023-03-13 21:43:24] [INFO ] Invariant cache hit.
[2023-03-13 21:43:25] [INFO ] Dead Transitions using invariants and state equation in 831 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5190 ms. Remains : 717/717 places, 2021/2021 transitions.
Graph (trivial) has 1085 edges and 717 vertex of which 229 / 717 are part of one of the 2 SCC in 6 ms
Free SCC test removed 227 places
Drop transitions removed 481 transitions
Ensure Unique test removed 203 transitions
Reduce isomorphic transitions removed 684 transitions.
Graph (complete) has 1576 edges and 490 vertex of which 447 are kept as prefixes of interest. Removing 43 places using SCC suffix rule.2 ms
Discarding 43 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Drop transitions removed 141 transitions
Reduce isomorphic transitions removed 141 transitions.
Iterating post reduction 0 with 141 rules applied. Total rules applied 143 place count 447 transition count 1186
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 143 place count 447 transition count 1185
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 145 place count 446 transition count 1185
Discarding 79 places :
Symmetric choice reduction at 1 with 79 rule applications. Total rules 224 place count 367 transition count 1008
Iterating global reduction 1 with 79 rules applied. Total rules applied 303 place count 367 transition count 1008
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 344 place count 367 transition count 967
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 366 place count 345 transition count 923
Iterating global reduction 2 with 22 rules applied. Total rules applied 388 place count 345 transition count 923
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 410 place count 345 transition count 901
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 412 place count 344 transition count 900
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 413 place count 344 transition count 899
Drop transitions removed 78 transitions
Redundant transition composition rules discarded 78 transitions
Iterating global reduction 4 with 78 rules applied. Total rules applied 491 place count 344 transition count 821
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 4 with 30 rules applied. Total rules applied 521 place count 344 transition count 791
Reduce places removed 30 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 5 with 40 rules applied. Total rules applied 561 place count 314 transition count 781
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 571 place count 304 transition count 781
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 573 place count 302 transition count 778
Iterating global reduction 7 with 2 rules applied. Total rules applied 575 place count 302 transition count 778
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 576 place count 302 transition count 777
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 8 with 2 rules applied. Total rules applied 578 place count 301 transition count 776
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 580 place count 301 transition count 774
Free-agglomeration rule applied 117 times with reduction of 10 identical transitions.
Iterating global reduction 8 with 117 rules applied. Total rules applied 697 place count 301 transition count 647
Reduce places removed 117 places and 0 transitions.
Ensure Unique test removed 122 transitions
Reduce isomorphic transitions removed 122 transitions.
Iterating post reduction 8 with 239 rules applied. Total rules applied 936 place count 184 transition count 525
Drop transitions removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 9 with 31 rules applied. Total rules applied 967 place count 184 transition count 494
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 969 place count 184 transition count 494
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 974 place count 182 transition count 491
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 975 place count 182 transition count 490
Partial Free-agglomeration rule applied 26 times.
Drop transitions removed 26 transitions
Iterating global reduction 10 with 26 rules applied. Total rules applied 1001 place count 182 transition count 490
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 1004 place count 182 transition count 487
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 1006 place count 180 transition count 485
Iterating global reduction 11 with 2 rules applied. Total rules applied 1008 place count 180 transition count 485
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1009 place count 180 transition count 485
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1011 place count 178 transition count 483
Applied a total of 1011 rules in 354 ms. Remains 178 /717 variables (removed 539) and now considering 483/2021 (removed 1538) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 483 rows 178 cols
[2023-03-13 21:43:25] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-13 21:43:25] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 21:43:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-13 21:43:26] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 21:43:26] [INFO ] After 335ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 122 ms.
[2023-03-13 21:43:26] [INFO ] After 503ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-13 21:43:26] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2023-03-13 21:43:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 717 places, 2021 transitions and 7277 arcs took 14 ms.
[2023-03-13 21:43:26] [INFO ] Flatten gal took : 162 ms
Total runtime 47371 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: gen
(NrP: 717 NrTr: 2021 NrArc: 7277)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.159sec

net check time: 0m 0.001sec

init dd package: 0m 3.171sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 10034828 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16100144 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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.011sec

122739 611254

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-020"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is CANInsertWithFailure-PT-020, 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 r042-tajo-167813696100718"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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