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-167873952200782.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-S10J60, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873952200782
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 19M
-rw-r--r-- 1 mcc users 64K Feb 26 00:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 276K Feb 26 00:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 518K Feb 26 00:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.0M Feb 26 00:19 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 14K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 36K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 120K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 53K Feb 26 01:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 254K Feb 26 01:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 300K Feb 26 01:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 981K Feb 26 01:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 14M 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-S10J60-ReachabilityCardinality-00
FORMULA_NAME PolyORBNT-PT-S10J60-ReachabilityCardinality-01
FORMULA_NAME PolyORBNT-PT-S10J60-ReachabilityCardinality-02
FORMULA_NAME PolyORBNT-PT-S10J60-ReachabilityCardinality-03
FORMULA_NAME PolyORBNT-PT-S10J60-ReachabilityCardinality-04
FORMULA_NAME PolyORBNT-PT-S10J60-ReachabilityCardinality-05
FORMULA_NAME PolyORBNT-PT-S10J60-ReachabilityCardinality-06
FORMULA_NAME PolyORBNT-PT-S10J60-ReachabilityCardinality-07
FORMULA_NAME PolyORBNT-PT-S10J60-ReachabilityCardinality-08
FORMULA_NAME PolyORBNT-PT-S10J60-ReachabilityCardinality-09
FORMULA_NAME PolyORBNT-PT-S10J60-ReachabilityCardinality-10
FORMULA_NAME PolyORBNT-PT-S10J60-ReachabilityCardinality-11
FORMULA_NAME PolyORBNT-PT-S10J60-ReachabilityCardinality-12
FORMULA_NAME PolyORBNT-PT-S10J60-ReachabilityCardinality-13
FORMULA_NAME PolyORBNT-PT-S10J60-ReachabilityCardinality-14
FORMULA_NAME PolyORBNT-PT-S10J60-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679671978064

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-S10J60
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 15:32:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-24 15:32:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 15:33:00] [INFO ] Load time of PNML (sax parser for PT used): 692 ms
[2023-03-24 15:33:00] [INFO ] Transformed 1234 places.
[2023-03-24 15:33:00] [INFO ] Transformed 12920 transitions.
[2023-03-24 15:33:00] [INFO ] Parsed PT model containing 1234 places and 12920 transitions and 116879 arcs in 959 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 29 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 560 resets, run finished after 756 ms. (steps per millisecond=13 ) properties (out of 16) seen :1
FORMULA PolyORBNT-PT-S10J60-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 15) 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 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 54363 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{2=1, 6=1}
Probabilistic random walk after 54363 steps, saw 17301 distinct states, run finished after 3003 ms. (steps per millisecond=18 ) properties seen :2
FORMULA PolyORBNT-PT-S10J60-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA PolyORBNT-PT-S10J60-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 13 properties.
[2023-03-24 15:33:04] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
// Phase 1: matrix 2801 rows 1234 cols
[2023-03-24 15:33:04] [INFO ] Computed 152 place invariants in 172 ms
[2023-03-24 15:33:06] [INFO ] [Real]Absence check using 121 positive place invariants in 46 ms returned sat
[2023-03-24 15:33:06] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 66 ms returned sat
[2023-03-24 15:33:06] [INFO ] After 851ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:10
[2023-03-24 15:33:06] [INFO ] [Nat]Absence check using 121 positive place invariants in 24 ms returned sat
[2023-03-24 15:33:06] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 64 ms returned sat
[2023-03-24 15:33:18] [INFO ] After 12016ms SMT Verify possible using state equation in natural domain returned unsat :11 sat :1
[2023-03-24 15:33:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 15:33:20] [INFO ] After 2020ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :11 sat :1
[2023-03-24 15:33:21] [INFO ] After 2182ms SMT Verify possible using trap constraints in natural domain returned unsat :11 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-24 15:33:21] [INFO ] After 14900ms SMT Verify possible using all constraints in natural domain returned unsat :11 sat :1
FORMULA PolyORBNT-PT-S10J60-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S10J60-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S10J60-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S10J60-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S10J60-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S10J60-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S10J60-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S10J60-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S10J60-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S10J60-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S10J60-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 78 out of 1234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1234/1234 places, 2810/2810 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 1224 transition count 2750
Reduce places removed 60 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 62 rules applied. Total rules applied 132 place count 1164 transition count 2748
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 134 place count 1162 transition count 2748
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 62 Pre rules applied. Total rules applied 134 place count 1162 transition count 2686
Deduced a syphon composed of 62 places in 2 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 258 place count 1100 transition count 2686
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 259 place count 1099 transition count 2685
Iterating global reduction 3 with 1 rules applied. Total rules applied 260 place count 1099 transition count 2685
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 264 place count 1097 transition count 2683
Applied a total of 264 rules in 542 ms. Remains 1097 /1234 variables (removed 137) and now considering 2683/2810 (removed 127) transitions.
[2023-03-24 15:33:21] [INFO ] Flow matrix only has 2674 transitions (discarded 9 similar events)
// Phase 1: matrix 2674 rows 1097 cols
[2023-03-24 15:33:21] [INFO ] Computed 142 place invariants in 87 ms
[2023-03-24 15:33:23] [INFO ] Dead Transitions using invariants and state equation in 2094 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 : 1097/1234 places, 2068/2810 transitions.
Applied a total of 0 rules in 72 ms. Remains 1097 /1097 variables (removed 0) and now considering 2068/2068 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2715 ms. Remains : 1097/1234 places, 2068/2810 transitions.
Incomplete random walk after 10000 steps, including 722 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :1
FORMULA PolyORBNT-PT-S10J60-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
[2023-03-24 15:33:24] [INFO ] Flow matrix only has 2059 transitions (discarded 9 similar events)
// Phase 1: matrix 2059 rows 1097 cols
[2023-03-24 15:33:24] [INFO ] Computed 142 place invariants in 45 ms
[2023-03-24 15:33:24] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 15:33:24] [INFO ] [Nat]Absence check using 121 positive place invariants in 23 ms returned sat
[2023-03-24 15:33:24] [INFO ] [Nat]Absence check using 121 positive and 21 generalized place invariants in 50 ms returned sat
[2023-03-24 15:33:34] [INFO ] After 9984ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 78 out of 1097 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1097/1097 places, 2068/2068 transitions.
Applied a total of 0 rules in 69 ms. Remains 1097 /1097 variables (removed 0) and now considering 2068/2068 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 1097/1097 places, 2068/2068 transitions.
Incomplete random walk after 10000 steps, including 719 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 135133 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 135133 steps, saw 23856 distinct states, run finished after 3004 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 15:33:37] [INFO ] Flow matrix only has 2059 transitions (discarded 9 similar events)
[2023-03-24 15:33:37] [INFO ] Invariant cache hit.
[2023-03-24 15:33:37] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 15:33:37] [INFO ] [Nat]Absence check using 121 positive place invariants in 25 ms returned sat
[2023-03-24 15:33:37] [INFO ] [Nat]Absence check using 121 positive and 21 generalized place invariants in 55 ms returned sat
[2023-03-24 15:33:51] [INFO ] After 13658ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 78 out of 1097 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1097/1097 places, 2068/2068 transitions.
Applied a total of 0 rules in 70 ms. Remains 1097 /1097 variables (removed 0) and now considering 2068/2068 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 1097/1097 places, 2068/2068 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1097/1097 places, 2068/2068 transitions.
Applied a total of 0 rules in 63 ms. Remains 1097 /1097 variables (removed 0) and now considering 2068/2068 (removed 0) transitions.
[2023-03-24 15:33:51] [INFO ] Flow matrix only has 2059 transitions (discarded 9 similar events)
[2023-03-24 15:33:51] [INFO ] Invariant cache hit.
[2023-03-24 15:33:53] [INFO ] Implicit Places using invariants in 1811 ms returned []
[2023-03-24 15:33:53] [INFO ] Flow matrix only has 2059 transitions (discarded 9 similar events)
[2023-03-24 15:33:53] [INFO ] Invariant cache hit.
[2023-03-24 15:33:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 15:34:21] [INFO ] Implicit Places using invariants and state equation in 28547 ms returned []
Implicit Place search using SMT with State Equation took 30363 ms to find 0 implicit places.
[2023-03-24 15:34:22] [INFO ] Redundant transitions in 136 ms returned []
[2023-03-24 15:34:22] [INFO ] Flow matrix only has 2059 transitions (discarded 9 similar events)
[2023-03-24 15:34:22] [INFO ] Invariant cache hit.
[2023-03-24 15:34:23] [INFO ] Dead Transitions using invariants and state equation in 1648 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32230 ms. Remains : 1097/1097 places, 2068/2068 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 1097 transition count 2059
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 1097 transition count 2058
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 1096 transition count 2058
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 1096 transition count 2057
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 1095 transition count 2057
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 20 place count 1095 transition count 2050
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 27 place count 1088 transition count 2050
Applied a total of 27 rules in 247 ms. Remains 1088 /1097 variables (removed 9) and now considering 2050/2068 (removed 18) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2050 rows 1088 cols
[2023-03-24 15:34:24] [INFO ] Computed 142 place invariants in 44 ms
[2023-03-24 15:34:24] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 15:34:24] [INFO ] [Nat]Absence check using 120 positive place invariants in 23 ms returned sat
[2023-03-24 15:34:24] [INFO ] [Nat]Absence check using 120 positive and 22 generalized place invariants in 52 ms returned sat
[2023-03-24 15:34:36] [INFO ] After 11901ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2023-03-24 15:34:36] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-03-24 15:34:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1097 places, 2068 transitions and 11833 arcs took 16 ms.
[2023-03-24 15:34:36] [INFO ] Flatten gal took : 249 ms
Total runtime 97042 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_S10J60
(NrP: 1097 NrTr: 2068 NrArc: 11833)

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

net check time: 0m 0.001sec

init dd package: 0m 2.709sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10533260 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16077752 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.038sec

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

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