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-167813696100726.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-030, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813696100726
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.0M
-rw-r--r-- 1 mcc users 8.3K Feb 26 00:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 00:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 00:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 00:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 17K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 00:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 26 00:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 00:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 00:25 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 5.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-030-ReachabilityCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678744997036

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-030
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 22:03:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 22:03:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 22:03:18] [INFO ] Load time of PNML (sax parser for PT used): 250 ms
[2023-03-13 22:03:18] [INFO ] Transformed 2164 places.
[2023-03-13 22:03:18] [INFO ] Transformed 5580 transitions.
[2023-03-13 22:03:19] [INFO ] Parsed PT model containing 2164 places and 5580 transitions and 15000 arcs in 333 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 13 resets, run finished after 572 ms. (steps per millisecond=17 ) properties (out of 16) seen :6
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) 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 10) 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 10) 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 10) 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 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 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 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 5580 rows 2164 cols
[2023-03-13 22:03:20] [INFO ] Computed 33 place invariants in 450 ms
[2023-03-13 22:03:21] [INFO ] [Real]Absence check using 31 positive place invariants in 46 ms returned sat
[2023-03-13 22:03:21] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 18 ms returned sat
[2023-03-13 22:03:21] [INFO ] After 963ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-13 22:03:22] [INFO ] [Nat]Absence check using 31 positive place invariants in 31 ms returned sat
[2023-03-13 22:03:22] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 30 ms returned sat
[2023-03-13 22:03:27] [INFO ] After 5143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-13 22:03:27] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-13 22:03:35] [INFO ] After 7444ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-13 22:03:41] [INFO ] After 14291ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 3944 ms.
[2023-03-13 22:03:45] [INFO ] After 24429ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 257 ms.
Support contains 39 out of 2164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2164/2164 places, 5580/5580 transitions.
Graph (complete) has 7651 edges and 2164 vertex of which 2163 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 200 place count 2163 transition count 5381
Reduce places removed 199 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 203 rules applied. Total rules applied 403 place count 1964 transition count 5377
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 407 place count 1960 transition count 5377
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 407 place count 1960 transition count 5376
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 409 place count 1959 transition count 5376
Performed 744 Post agglomeration using F-continuation condition.Transition count delta: 744
Deduced a syphon composed of 744 places in 2 ms
Reduce places removed 744 places and 0 transitions.
Iterating global reduction 3 with 1488 rules applied. Total rules applied 1897 place count 1215 transition count 4632
Drop transitions removed 690 transitions
Redundant transition composition rules discarded 690 transitions
Iterating global reduction 3 with 690 rules applied. Total rules applied 2587 place count 1215 transition count 3942
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 2592 place count 1215 transition count 3937
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 2597 place count 1210 transition count 3937
Partial Free-agglomeration rule applied 1045 times.
Drop transitions removed 1045 transitions
Iterating global reduction 4 with 1045 rules applied. Total rules applied 3642 place count 1210 transition count 3937
Partial Free-agglomeration rule applied 34 times.
Drop transitions removed 34 transitions
Iterating global reduction 4 with 34 rules applied. Total rules applied 3676 place count 1210 transition count 3937
Applied a total of 3676 rules in 1168 ms. Remains 1210 /2164 variables (removed 954) and now considering 3937/5580 (removed 1643) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1170 ms. Remains : 1210/2164 places, 3937/5580 transitions.
Incomplete random walk after 10000 steps, including 60 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 9) seen :5
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) 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 4) 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 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 3937 rows 1210 cols
[2023-03-13 22:03:47] [INFO ] Computed 32 place invariants in 61 ms
[2023-03-13 22:03:48] [INFO ] [Real]Absence check using 30 positive place invariants in 22 ms returned sat
[2023-03-13 22:03:48] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 20 ms returned sat
[2023-03-13 22:03:48] [INFO ] After 347ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 22:03:48] [INFO ] [Nat]Absence check using 30 positive place invariants in 20 ms returned sat
[2023-03-13 22:03:48] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 14 ms returned sat
[2023-03-13 22:03:49] [INFO ] After 1409ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 22:03:49] [INFO ] State equation strengthened by 3466 read => feed constraints.
[2023-03-13 22:03:51] [INFO ] After 1131ms SMT Verify possible using 3466 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 22:03:51] [INFO ] After 2053ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 748 ms.
[2023-03-13 22:03:52] [INFO ] After 4620ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 35 ms.
Support contains 6 out of 1210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1210/1210 places, 3937/3937 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 1210 transition count 3935
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1208 transition count 3935
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 34 place count 1193 transition count 3920
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 1193 transition count 3919
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 1193 transition count 3918
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 1192 transition count 3918
Partial Free-agglomeration rule applied 97 times.
Drop transitions removed 97 transitions
Iterating global reduction 3 with 97 rules applied. Total rules applied 134 place count 1192 transition count 3918
Applied a total of 134 rules in 518 ms. Remains 1192 /1210 variables (removed 18) and now considering 3918/3937 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 518 ms. Remains : 1192/1210 places, 3918/3937 transitions.
Incomplete random walk after 10000 steps, including 65 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 4) 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 4) 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 4) 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 4) 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 4) seen :0
Interrupted probabilistic random walk after 201752 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 201752 steps, saw 37633 distinct states, run finished after 3003 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 3918 rows 1192 cols
[2023-03-13 22:03:56] [INFO ] Computed 32 place invariants in 127 ms
[2023-03-13 22:03:56] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2023-03-13 22:03:57] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 14 ms returned sat
[2023-03-13 22:03:57] [INFO ] After 304ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 22:03:57] [INFO ] [Nat]Absence check using 30 positive place invariants in 12 ms returned sat
[2023-03-13 22:03:57] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 14 ms returned sat
[2023-03-13 22:03:58] [INFO ] After 1207ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 22:03:58] [INFO ] State equation strengthened by 3710 read => feed constraints.
[2023-03-13 22:03:59] [INFO ] After 1281ms SMT Verify possible using 3710 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 22:04:00] [INFO ] After 2360ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 646 ms.
[2023-03-13 22:04:01] [INFO ] After 4528ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 28 ms.
Support contains 6 out of 1192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1192/1192 places, 3918/3918 transitions.
Applied a total of 0 rules in 129 ms. Remains 1192 /1192 variables (removed 0) and now considering 3918/3918 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 1192/1192 places, 3918/3918 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1192/1192 places, 3918/3918 transitions.
Applied a total of 0 rules in 97 ms. Remains 1192 /1192 variables (removed 0) and now considering 3918/3918 (removed 0) transitions.
[2023-03-13 22:04:01] [INFO ] Invariant cache hit.
[2023-03-13 22:04:03] [INFO ] Implicit Places using invariants in 1276 ms returned []
[2023-03-13 22:04:03] [INFO ] Invariant cache hit.
[2023-03-13 22:04:04] [INFO ] State equation strengthened by 3710 read => feed constraints.
[2023-03-13 22:04:23] [INFO ] Implicit Places using invariants and state equation in 20382 ms returned []
Implicit Place search using SMT with State Equation took 21663 ms to find 0 implicit places.
[2023-03-13 22:04:23] [INFO ] Redundant transitions in 321 ms returned []
[2023-03-13 22:04:23] [INFO ] Invariant cache hit.
[2023-03-13 22:04:25] [INFO ] Dead Transitions using invariants and state equation in 1659 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23757 ms. Remains : 1192/1192 places, 3918/3918 transitions.
Graph (trivial) has 3606 edges and 1192 vertex of which 1064 / 1192 are part of one of the 2 SCC in 4 ms
Free SCC test removed 1062 places
Drop transitions removed 2853 transitions
Ensure Unique test removed 894 transitions
Reduce isomorphic transitions removed 3747 transitions.
Graph (complete) has 351 edges and 130 vertex of which 40 are kept as prefixes of interest. Removing 90 places using SCC suffix rule.0 ms
Discarding 90 places :
Also discarding 28 output transitions
Drop transitions removed 28 transitions
Drop transitions removed 88 transitions
Reduce isomorphic transitions removed 88 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 89 rules applied. Total rules applied 91 place count 40 transition count 54
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 93 place count 39 transition count 53
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 121 place count 11 transition count 25
Iterating global reduction 2 with 28 rules applied. Total rules applied 149 place count 11 transition count 25
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 151 place count 11 transition count 23
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 11 transition count 22
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 154 place count 10 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 155 place count 9 transition count 20
Applied a total of 155 rules in 21 ms. Remains 9 /1192 variables (removed 1183) and now considering 20/3918 (removed 3898) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 20 rows 9 cols
[2023-03-13 22:04:25] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-13 22:04:25] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 22:04:25] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 22:04:25] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-13 22:04:25] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-13 22:04:25] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-03-13 22:04:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1192 places, 3918 transitions and 15742 arcs took 21 ms.
[2023-03-13 22:04:25] [INFO ] Flatten gal took : 210 ms
Total runtime 67354 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: 1192 NrTr: 3918 NrArc: 15742)

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

net check time: 0m 0.003sec

init dd package: 0m 2.938sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 9627720 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16095244 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.040sec

797831

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-030"
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-030, 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-167813696100726"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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