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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 7.8K Feb 25 12:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 12:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 12:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 12:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 12:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 163K Feb 25 12:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 12:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 45K 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 BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678696791478

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=BridgeAndVehicles-COL-V80P50N10
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 08:39:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 08:39:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 08:39:53] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-13 08:39:53] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-13 08:39:53] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 428 ms
[2023-03-13 08:39:53] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 188 PT places and 289218.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 08:39:53] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 4 ms.
[2023-03-13 08:39:53] [INFO ] Skeletonized 15 HLPN properties in 1 ms.
Remains 15 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
[2023-03-13 08:39:53] [INFO ] Flatten gal took : 13 ms
[2023-03-13 08:39:53] [INFO ] Flatten gal took : 2 ms
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-00 TRUE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-01 FALSE TECHNIQUES CPN_APPROX
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-14 TRUE TECHNIQUES CPN_APPROX
Arc [1:1*[(MOD (ADD $cA 1) 81)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 81) 81) 81)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 11)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2023-03-13 08:39:54] [INFO ] Unfolded HLPN to a Petri net with 188 places and 2108 transitions 15950 arcs in 94 ms.
[2023-03-13 08:39:54] [INFO ] Unfolded 15 HLPN properties in 2 ms.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 491 ms. (steps per millisecond=20 ) properties (out of 12) seen :4
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-13 08:39:55] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 188 cols
[2023-03-13 08:39:55] [INFO ] Computed 7 place invariants in 19 ms
[2023-03-13 08:39:55] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-13 08:39:56] [INFO ] After 403ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:4
[2023-03-13 08:39:56] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-13 08:39:56] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :2
[2023-03-13 08:39:56] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 08:39:56] [INFO ] After 88ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :6 sat :2
[2023-03-13 08:39:56] [INFO ] After 236ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :2
Attempting to minimize the solution found.
Minimization took 110 ms.
[2023-03-13 08:39:56] [INFO ] After 552ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :2
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 26 ms.
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 1882 edges and 188 vertex of which 187 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 381 ms. Remains 187 /188 variables (removed 1) and now considering 2108/2108 (removed 0) transitions.
[2023-03-13 08:39:57] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 187 cols
[2023-03-13 08:39:57] [INFO ] Computed 6 place invariants in 15 ms
[2023-03-13 08:39:57] [INFO ] Dead Transitions using invariants and state equation in 859 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1255 ms. Remains : 187/188 places, 2108/2108 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 215177 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 215177 steps, saw 59651 distinct states, run finished after 3004 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-13 08:40:01] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-13 08:40:01] [INFO ] Invariant cache hit.
[2023-03-13 08:40:01] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-13 08:40:01] [INFO ] After 342ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 08:40:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-13 08:40:01] [INFO ] After 239ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 08:40:01] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 08:40:02] [INFO ] After 175ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 08:40:02] [INFO ] After 301ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-13 08:40:02] [INFO ] After 706ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 18 ms.
Support contains 3 out of 187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 2108/2108 transitions.
Applied a total of 0 rules in 265 ms. Remains 187 /187 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 265 ms. Remains : 187/187 places, 2108/2108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 2108/2108 transitions.
Applied a total of 0 rules in 193 ms. Remains 187 /187 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2023-03-13 08:40:02] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-13 08:40:02] [INFO ] Invariant cache hit.
[2023-03-13 08:40:03] [INFO ] Implicit Places using invariants in 429 ms returned []
[2023-03-13 08:40:03] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-13 08:40:03] [INFO ] Invariant cache hit.
[2023-03-13 08:40:03] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 08:40:05] [INFO ] Implicit Places using invariants and state equation in 1992 ms returned [83, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2435 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 185/187 places, 2108/2108 transitions.
Applied a total of 0 rules in 201 ms. Remains 185 /185 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2833 ms. Remains : 185/187 places, 2108/2108 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 263003 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 263003 steps, saw 72428 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-13 08:40:08] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 185 cols
[2023-03-13 08:40:08] [INFO ] Computed 5 place invariants in 10 ms
[2023-03-13 08:40:08] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-13 08:40:08] [INFO ] After 201ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 08:40:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-13 08:40:09] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 08:40:09] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 08:40:09] [INFO ] After 102ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 08:40:09] [INFO ] After 268ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 98 ms.
[2023-03-13 08:40:09] [INFO ] After 568ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 20 ms.
Support contains 3 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2108/2108 transitions.
Applied a total of 0 rules in 217 ms. Remains 185 /185 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 217 ms. Remains : 185/185 places, 2108/2108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2108/2108 transitions.
Applied a total of 0 rules in 205 ms. Remains 185 /185 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2023-03-13 08:40:09] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-13 08:40:09] [INFO ] Invariant cache hit.
[2023-03-13 08:40:10] [INFO ] Implicit Places using invariants in 297 ms returned []
[2023-03-13 08:40:10] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-13 08:40:10] [INFO ] Invariant cache hit.
[2023-03-13 08:40:10] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 08:40:12] [INFO ] Implicit Places using invariants and state equation in 2431 ms returned []
Implicit Place search using SMT with State Equation took 2735 ms to find 0 implicit places.
[2023-03-13 08:40:12] [INFO ] Redundant transitions in 182 ms returned []
[2023-03-13 08:40:12] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-13 08:40:12] [INFO ] Invariant cache hit.
[2023-03-13 08:40:13] [INFO ] Dead Transitions using invariants and state equation in 748 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3893 ms. Remains : 185/185 places, 2108/2108 transitions.
Ensure Unique test removed 1738 transitions
Reduce isomorphic transitions removed 1738 transitions.
Iterating post reduction 0 with 1738 rules applied. Total rules applied 1738 place count 185 transition count 370
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1742 place count 183 transition count 368
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1744 place count 183 transition count 366
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1746 place count 181 transition count 366
Applied a total of 1746 rules in 23 ms. Remains 181 /185 variables (removed 4) and now considering 366/2108 (removed 1742) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 366 rows 181 cols
[2023-03-13 08:40:13] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-13 08:40:13] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-13 08:40:13] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 08:40:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-13 08:40:14] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 08:40:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-13 08:40:14] [INFO ] After 30ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 08:40:14] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-13 08:40:14] [INFO ] After 269ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-13 08:40:14] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-13 08:40:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 185 places, 2108 transitions and 15627 arcs took 13 ms.
[2023-03-13 08:40:14] [INFO ] Flatten gal took : 140 ms
Total runtime 21037 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: BridgeAndVehicles_COL_V80P50N10_unf
(NrP: 185 NrTr: 2108 NrArc: 15627)

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

net check time: 0m 0.001sec

init dd package: 0m 3.053sec


RS generation: 16m25.172sec


-> reachability set: #nodes 8469681 (8.5e+06) #states 2,432,864,514 (9)



starting MCC model checker
--------------------------

checking: AG [p165<=47]
normalized: ~ [E [true U ~ [p165<=47]]]

abstracting: (p165<=47)
states: 2,432,864,514 (9)
-> the formula is TRUE

FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.400sec

checking: EF [[~ [36<=p167] & ~ [p83<=24]]]
normalized: E [true U [~ [36<=p167] & ~ [p83<=24]]]

abstracting: (p83<=24)
states: 2,432,864,514 (9)
abstracting: (36<=p167)

before gc: list nodes free: 1243716

after gc: idd nodes used:8469864, unused:55530136; list nodes free:295270270
states: 769,973,960 (8)
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m29.963sec

totally nodes used: 70583826 (7.1e+07)
number of garbage collections: 1
fire ops cache: hits/miss/sum: 631328444 2864688099 3496016543
used/not used/entry size/cache size: 0 67108864 16 1024MB
basic ops cache: hits/miss/sum: 22293679 37606598 59900277
used/not used/entry size/cache size: 12779459 3997757 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 28906888 11715839 40622727
used/not used/entry size/cache size: 2688267 5700341 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 56242024
1 7765505
2 2335384
3 597128
4 121158
5 21340
6 5134
7 3588
8 2946
9 2878
>= 10 11779

Total processing time: 17m17.354sec


BK_STOP 1678697852002

--------------------
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.003sec

380124 522571 525720 526731 529357 532767 539150 540830 543794 546330 551524 554994 556389 560137 565875 567262 568962 572889 575561 577413 580964 581823 583344 585375 585681 592759 601062 593084 590172 594095 575471 571817 559662 554173 539671 533958 545933 542307 538875 538869 540806 547445 542010 542863 542633 543616 550615 544528 543405 543451 542522 542630 541630 541553 541572 540852 543164 542135 541447 541317 542170 543866 544616 543798 7411350
iterations count:6502417 (3084), effective:81123 (38)

initing FirstDep: 0m 0.008sec

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="BridgeAndVehicles-COL-V80P50N10"
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 BridgeAndVehicles-COL-V80P50N10, 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-167813695400142"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V80P50N10.tgz
mv BridgeAndVehicles-COL-V80P50N10 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 ;