Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r298-tall-167873952200758.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is PolyORBNT-PT-S10J20, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873952200758
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 22M
-rw-r--r-- 1 mcc users 17K Feb 26 01:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 26 01:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1002K Feb 26 01:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.7M Feb 26 01:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 30K Feb 26 03:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 196K Feb 26 03:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 708K Feb 26 02:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.7M Feb 26 02:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.1K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 13M Mar 5 18:23 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 PolyORBNT-PT-S10J20-ReachabilityCardinality-00
FORMULA_NAME PolyORBNT-PT-S10J20-ReachabilityCardinality-01
FORMULA_NAME PolyORBNT-PT-S10J20-ReachabilityCardinality-02
FORMULA_NAME PolyORBNT-PT-S10J20-ReachabilityCardinality-03
FORMULA_NAME PolyORBNT-PT-S10J20-ReachabilityCardinality-04
FORMULA_NAME PolyORBNT-PT-S10J20-ReachabilityCardinality-05
FORMULA_NAME PolyORBNT-PT-S10J20-ReachabilityCardinality-06
FORMULA_NAME PolyORBNT-PT-S10J20-ReachabilityCardinality-07
FORMULA_NAME PolyORBNT-PT-S10J20-ReachabilityCardinality-08
FORMULA_NAME PolyORBNT-PT-S10J20-ReachabilityCardinality-09
FORMULA_NAME PolyORBNT-PT-S10J20-ReachabilityCardinality-10
FORMULA_NAME PolyORBNT-PT-S10J20-ReachabilityCardinality-11
FORMULA_NAME PolyORBNT-PT-S10J20-ReachabilityCardinality-12
FORMULA_NAME PolyORBNT-PT-S10J20-ReachabilityCardinality-13
FORMULA_NAME PolyORBNT-PT-S10J20-ReachabilityCardinality-14
FORMULA_NAME PolyORBNT-PT-S10J20-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679661571241

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=PolyORBNT-PT-S10J20
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 12:39:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-24 12:39:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 12:39:33] [INFO ] Load time of PNML (sax parser for PT used): 538 ms
[2023-03-24 12:39:33] [INFO ] Transformed 474 places.
[2023-03-24 12:39:33] [INFO ] Transformed 11760 transitions.
[2023-03-24 12:39:33] [INFO ] Parsed PT model containing 474 places and 11760 transitions and 111119 arcs in 923 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Incomplete random walk after 10000 steps, including 561 resets, run finished after 917 ms. (steps per millisecond=10 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 94033 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{14=1}
Probabilistic random walk after 94033 steps, saw 27540 distinct states, run finished after 3002 ms. (steps per millisecond=31 ) properties seen :1
FORMULA PolyORBNT-PT-S10J20-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 15 properties.
[2023-03-24 12:39:37] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 474 cols
[2023-03-24 12:39:38] [INFO ] Computed 72 place invariants in 74 ms
[2023-03-24 12:39:38] [INFO ] [Real]Absence check using 45 positive place invariants in 21 ms returned sat
[2023-03-24 12:39:39] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 28 ms returned sat
[2023-03-24 12:39:39] [INFO ] After 442ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:14
[2023-03-24 12:39:39] [INFO ] [Nat]Absence check using 45 positive place invariants in 15 ms returned sat
[2023-03-24 12:39:39] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 24 ms returned sat
[2023-03-24 12:39:49] [INFO ] After 10234ms SMT Verify possible using state equation in natural domain returned unsat :13 sat :1
[2023-03-24 12:39:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 12:39:49] [INFO ] After 210ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :13 sat :1
[2023-03-24 12:39:50] [INFO ] After 492ms SMT Verify possible using trap constraints in natural domain returned unsat :13 sat :1
Attempting to minimize the solution found.
Minimization took 192 ms.
[2023-03-24 12:39:50] [INFO ] After 11217ms SMT Verify possible using all constraints in natural domain returned unsat :13 sat :1
FORMULA PolyORBNT-PT-S10J20-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S10J20-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S10J20-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S10J20-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S10J20-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S10J20-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S10J20-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S10J20-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S10J20-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S10J20-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S10J20-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S10J20-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S10J20-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 15 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 55 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 1650/1650 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 464 transition count 1630
Reduce places removed 20 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 22 rules applied. Total rules applied 52 place count 444 transition count 1628
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 54 place count 442 transition count 1628
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 54 place count 442 transition count 1607
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 96 place count 421 transition count 1607
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 420 transition count 1606
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 420 transition count 1606
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 102 place count 418 transition count 1604
Applied a total of 102 rules in 323 ms. Remains 418 /474 variables (removed 56) and now considering 1604/1650 (removed 46) transitions.
[2023-03-24 12:39:50] [INFO ] Flow matrix only has 1595 transitions (discarded 9 similar events)
// Phase 1: matrix 1595 rows 418 cols
[2023-03-24 12:39:50] [INFO ] Computed 62 place invariants in 37 ms
[2023-03-24 12:39:51] [INFO ] Dead Transitions using invariants and state equation in 731 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 418/474 places, 989/1650 transitions.
Applied a total of 0 rules in 29 ms. Remains 418 /418 variables (removed 0) and now considering 989/989 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1086 ms. Remains : 418/474 places, 989/1650 transitions.
Incomplete random walk after 10000 steps, including 685 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 2) seen :1
FORMULA PolyORBNT-PT-S10J20-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 106 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-24 12:39:51] [INFO ] Flow matrix only has 980 transitions (discarded 9 similar events)
// Phase 1: matrix 980 rows 418 cols
[2023-03-24 12:39:51] [INFO ] Computed 62 place invariants in 16 ms
[2023-03-24 12:39:51] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 12:39:51] [INFO ] [Nat]Absence check using 44 positive place invariants in 7 ms returned sat
[2023-03-24 12:39:51] [INFO ] [Nat]Absence check using 44 positive and 18 generalized place invariants in 20 ms returned sat
[2023-03-24 12:39:53] [INFO ] After 1946ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 12:39:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 12:39:54] [INFO ] After 617ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 12:39:54] [INFO ] After 1188ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1065 ms.
[2023-03-24 12:39:55] [INFO ] After 4297ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 53 out of 418 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 989/989 transitions.
Applied a total of 0 rules in 26 ms. Remains 418 /418 variables (removed 0) and now considering 989/989 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 418/418 places, 989/989 transitions.
Incomplete random walk after 10000 steps, including 682 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 244171 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 244171 steps, saw 69900 distinct states, run finished after 3005 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 12:39:59] [INFO ] Flow matrix only has 980 transitions (discarded 9 similar events)
[2023-03-24 12:39:59] [INFO ] Invariant cache hit.
[2023-03-24 12:39:59] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 12:39:59] [INFO ] [Nat]Absence check using 44 positive place invariants in 16 ms returned sat
[2023-03-24 12:39:59] [INFO ] [Nat]Absence check using 44 positive and 18 generalized place invariants in 16 ms returned sat
[2023-03-24 12:40:00] [INFO ] After 941ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 12:40:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 12:40:00] [INFO ] After 680ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 12:40:02] [INFO ] After 2535ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1280 ms.
[2023-03-24 12:40:04] [INFO ] After 4861ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 53 out of 418 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 989/989 transitions.
Applied a total of 0 rules in 23 ms. Remains 418 /418 variables (removed 0) and now considering 989/989 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 418/418 places, 989/989 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 989/989 transitions.
Applied a total of 0 rules in 22 ms. Remains 418 /418 variables (removed 0) and now considering 989/989 (removed 0) transitions.
[2023-03-24 12:40:04] [INFO ] Flow matrix only has 980 transitions (discarded 9 similar events)
[2023-03-24 12:40:04] [INFO ] Invariant cache hit.
[2023-03-24 12:40:04] [INFO ] Implicit Places using invariants in 496 ms returned []
[2023-03-24 12:40:04] [INFO ] Flow matrix only has 980 transitions (discarded 9 similar events)
[2023-03-24 12:40:04] [INFO ] Invariant cache hit.
[2023-03-24 12:40:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 12:40:08] [INFO ] Implicit Places using invariants and state equation in 3566 ms returned []
Implicit Place search using SMT with State Equation took 4066 ms to find 0 implicit places.
[2023-03-24 12:40:08] [INFO ] Redundant transitions in 54 ms returned []
[2023-03-24 12:40:08] [INFO ] Flow matrix only has 980 transitions (discarded 9 similar events)
[2023-03-24 12:40:08] [INFO ] Invariant cache hit.
[2023-03-24 12:40:08] [INFO ] Dead Transitions using invariants and state equation in 479 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4630 ms. Remains : 418/418 places, 989/989 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 418 transition count 980
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 418 transition count 972
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 25 place count 410 transition count 972
Applied a total of 25 rules in 53 ms. Remains 410 /418 variables (removed 8) and now considering 972/989 (removed 17) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 972 rows 410 cols
[2023-03-24 12:40:08] [INFO ] Computed 62 place invariants in 17 ms
[2023-03-24 12:40:08] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 12:40:08] [INFO ] [Nat]Absence check using 44 positive place invariants in 7 ms returned sat
[2023-03-24 12:40:08] [INFO ] [Nat]Absence check using 44 positive and 18 generalized place invariants in 13 ms returned sat
[2023-03-24 12:40:10] [INFO ] After 1733ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 12:40:11] [INFO ] After 2463ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 272 ms.
[2023-03-24 12:40:11] [INFO ] After 2852ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-24 12:40:11] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-03-24 12:40:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 418 places, 989 transitions and 6635 arcs took 9 ms.
[2023-03-24 12:40:12] [INFO ] Flatten gal took : 131 ms
Total runtime 39285 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: PolyORBNT_PT_S10J20
(NrP: 418 NrTr: 989 NrArc: 6635)

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

net check time: 0m 0.000sec

init dd package: 0m 2.762sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 10537360 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16076756 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.010sec

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="PolyORBNT-PT-S10J20"
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 PolyORBNT-PT-S10J20, 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 r298-tall-167873952200758"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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