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

--------------------
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 1678746324008

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-040
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 22:25:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 22:25:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 22:25:26] [INFO ] Load time of PNML (sax parser for PT used): 339 ms
[2023-03-13 22:25:26] [INFO ] Transformed 3684 places.
[2023-03-13 22:25:26] [INFO ] Transformed 9840 transitions.
[2023-03-13 22:25:26] [INFO ] Parsed PT model containing 3684 places and 9840 transitions and 26400 arcs in 473 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 10 resets, run finished after 922 ms. (steps per millisecond=10 ) properties (out of 16) seen :7
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-01 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 81 ms. (steps per millisecond=123 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) 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 9) 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 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 9840 rows 3684 cols
[2023-03-13 22:25:28] [INFO ] Computed 43 place invariants in 549 ms
[2023-03-13 22:25:30] [INFO ] After 1757ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-13 22:25:32] [INFO ] [Nat]Absence check using 41 positive place invariants in 80 ms returned sat
[2023-03-13 22:25:32] [INFO ] [Nat]Absence check using 41 positive and 2 generalized place invariants in 57 ms returned sat
[2023-03-13 22:25:45] [INFO ] After 12765ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-13 22:25:45] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-13 22:25:55] [INFO ] After 10354ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :2 sat :6
[2023-03-13 22:25:55] [INFO ] After 10356ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :6
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-13 22:25:55] [INFO ] After 25065ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :6
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 7 different solutions.
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 576 ms.
Support contains 72 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.18 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 260 transitions
Trivial Post-agglo rules discarded 260 transitions
Performed 260 trivial Post agglomeration. Transition count delta: 260
Iterating post reduction 0 with 260 rules applied. Total rules applied 261 place count 3683 transition count 9580
Reduce places removed 260 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 266 rules applied. Total rules applied 527 place count 3423 transition count 9574
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 533 place count 3417 transition count 9574
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 533 place count 3417 transition count 9572
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 537 place count 3415 transition count 9572
Performed 1493 Post agglomeration using F-continuation condition.Transition count delta: 1493
Deduced a syphon composed of 1493 places in 14 ms
Reduce places removed 1493 places and 0 transitions.
Iterating global reduction 3 with 2986 rules applied. Total rules applied 3523 place count 1922 transition count 8079
Drop transitions removed 1419 transitions
Redundant transition composition rules discarded 1419 transitions
Iterating global reduction 3 with 1419 rules applied. Total rules applied 4942 place count 1922 transition count 6660
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 4947 place count 1922 transition count 6655
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 4952 place count 1917 transition count 6655
Partial Free-agglomeration rule applied 1724 times.
Drop transitions removed 1724 transitions
Iterating global reduction 4 with 1724 rules applied. Total rules applied 6676 place count 1917 transition count 6655
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 4 with 78 rules applied. Total rules applied 6754 place count 1917 transition count 6655
Applied a total of 6754 rules in 2883 ms. Remains 1917 /3684 variables (removed 1767) and now considering 6655/9840 (removed 3185) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2889 ms. Remains : 1917/3684 places, 6655/9840 transitions.
Incomplete random walk after 10000 steps, including 49 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 5) seen :1
FORMULA CANInsertWithFailure-PT-040-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 6655 rows 1917 cols
[2023-03-13 22:26:00] [INFO ] Computed 42 place invariants in 286 ms
[2023-03-13 22:26:00] [INFO ] After 595ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 22:26:01] [INFO ] [Nat]Absence check using 40 positive place invariants in 19 ms returned sat
[2023-03-13 22:26:01] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 18 ms returned sat
[2023-03-13 22:26:04] [INFO ] After 2958ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 22:26:04] [INFO ] State equation strengthened by 6294 read => feed constraints.
[2023-03-13 22:26:08] [INFO ] After 3747ms SMT Verify possible using 6294 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 22:26:10] [INFO ] After 5831ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1530 ms.
[2023-03-13 22:26:11] [INFO ] After 10930ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 124 ms.
Support contains 44 out of 1917 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1917/1917 places, 6655/6655 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 1917 transition count 6653
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1915 transition count 6653
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 34 place count 1900 transition count 6638
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 1900 transition count 6637
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 1899 transition count 6637
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 48 place count 1899 transition count 6637
Applied a total of 48 rules in 725 ms. Remains 1899 /1917 variables (removed 18) and now considering 6637/6655 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 725 ms. Remains : 1899/1917 places, 6637/6655 transitions.
Incomplete random walk after 10000 steps, including 49 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 114413 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 114413 steps, saw 36613 distinct states, run finished after 3003 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 6637 rows 1899 cols
[2023-03-13 22:26:16] [INFO ] Computed 42 place invariants in 149 ms
[2023-03-13 22:26:16] [INFO ] After 388ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 22:26:16] [INFO ] [Nat]Absence check using 40 positive place invariants in 25 ms returned sat
[2023-03-13 22:26:16] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 23 ms returned sat
[2023-03-13 22:26:19] [INFO ] After 2933ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 22:26:20] [INFO ] State equation strengthened by 6370 read => feed constraints.
[2023-03-13 22:26:23] [INFO ] After 3674ms SMT Verify possible using 6370 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 22:26:25] [INFO ] After 5643ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1387 ms.
[2023-03-13 22:26:27] [INFO ] After 10533ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 72 ms.
Support contains 44 out of 1899 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1899/1899 places, 6637/6637 transitions.
Applied a total of 0 rules in 205 ms. Remains 1899 /1899 variables (removed 0) and now considering 6637/6637 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 1899/1899 places, 6637/6637 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1899/1899 places, 6637/6637 transitions.
Applied a total of 0 rules in 212 ms. Remains 1899 /1899 variables (removed 0) and now considering 6637/6637 (removed 0) transitions.
[2023-03-13 22:26:27] [INFO ] Invariant cache hit.
[2023-03-13 22:26:29] [INFO ] Implicit Places using invariants in 2375 ms returned []
[2023-03-13 22:26:29] [INFO ] Invariant cache hit.
[2023-03-13 22:26:31] [INFO ] State equation strengthened by 6370 read => feed constraints.
[2023-03-13 22:26:41] [INFO ] Implicit Places using invariants and state equation in 11566 ms returned []
Implicit Place search using SMT with State Equation took 13946 ms to find 0 implicit places.
[2023-03-13 22:26:42] [INFO ] Redundant transitions in 691 ms returned []
[2023-03-13 22:26:42] [INFO ] Invariant cache hit.
[2023-03-13 22:26:45] [INFO ] Dead Transitions using invariants and state equation in 2869 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17748 ms. Remains : 1899/1899 places, 6637/6637 transitions.
Graph (trivial) has 6170 edges and 1899 vertex of which 1654 / 1899 are part of one of the 2 SCC in 6 ms
Free SCC test removed 1652 places
Drop transitions removed 4573 transitions
Ensure Unique test removed 1623 transitions
Reduce isomorphic transitions removed 6196 transitions.
Graph (complete) has 683 edges and 247 vertex of which 136 are kept as prefixes of interest. Removing 111 places using SCC suffix rule.0 ms
Discarding 111 places :
Also discarding 35 output transitions
Drop transitions removed 35 transitions
Drop transitions removed 111 transitions
Reduce isomorphic transitions removed 111 transitions.
Iterating post reduction 0 with 111 rules applied. Total rules applied 113 place count 136 transition count 295
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 181 place count 68 transition count 191
Iterating global reduction 1 with 68 rules applied. Total rules applied 249 place count 68 transition count 191
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 285 place count 68 transition count 155
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 2 with 2 rules applied. Total rules applied 287 place count 67 transition count 154
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 2 with 2 rules applied. Total rules applied 289 place count 66 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 290 place count 66 transition count 152
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 296 place count 66 transition count 146
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 297 place count 66 transition count 145
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 299 place count 65 transition count 144
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 301 place count 63 transition count 142
Applied a total of 301 rules in 39 ms. Remains 63 /1899 variables (removed 1836) and now considering 142/6637 (removed 6495) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 142 rows 63 cols
[2023-03-13 22:26:45] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-13 22:26:45] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 22:26:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-13 22:26:45] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 22:26:45] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-13 22:26:45] [INFO ] After 102ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-13 22:26:45] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-03-13 22:26:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1899 places, 6637 transitions and 26414 arcs took 29 ms.
[2023-03-13 22:26:46] [INFO ] Flatten gal took : 610 ms
Total runtime 80117 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: 1899 NrTr: 6637 NrArc: 26414)

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

net check time: 0m 0.022sec

init dd package: 0m 3.375sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 9905520 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16086348 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:
++ 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
++ sed s/.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.127sec

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="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-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 r042-tajo-167813696200734"
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 ;