fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r170-tall-167838857600671
Last Updated
May 14, 2023

About the Execution of Marcie+red for FunctionPointer-PT-b004

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7190.804 3600000.00 3632512.00 8423.10 FTFTFTFFFFTTTT?T normal

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.r170-tall-167838857600671.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 FunctionPointer-PT-b004, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857600671
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 876K
-rw-r--r-- 1 mcc users 5.8K Feb 25 11:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 25 11:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 11:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 11:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 11:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Feb 25 11:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Feb 25 11:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 391K 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 FunctionPointer-PT-b004-ReachabilityFireability-00
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityFireability-01
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityFireability-02
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityFireability-03
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityFireability-04
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityFireability-05
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityFireability-06
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityFireability-07
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityFireability-08
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityFireability-09
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityFireability-10
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityFireability-11
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityFireability-12
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityFireability-13
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityFireability-14
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678601651995

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b004
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 06:14:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 06:14:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 06:14:13] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2023-03-12 06:14:13] [INFO ] Transformed 306 places.
[2023-03-12 06:14:13] [INFO ] Transformed 840 transitions.
[2023-03-12 06:14:13] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 151 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b004-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10002 steps, including 19 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 13) seen :9
FORMULA FunctionPointer-PT-b004-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b004-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b004-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b004-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b004-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b004-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b004-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b004-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b004-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :2
FORMULA FunctionPointer-PT-b004-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-b004-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
[2023-03-12 06:14:14] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
// Phase 1: matrix 414 rows 222 cols
[2023-03-12 06:14:14] [INFO ] Computed 4 place invariants in 18 ms
[2023-03-12 06:14:14] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-12 06:14:14] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 06:14:14] [INFO ] After 196ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-12 06:14:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-12 06:14:14] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 06:14:14] [INFO ] After 192ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-12 06:14:14] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-12 06:14:14] [INFO ] After 66ms SMT Verify possible using 65 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-12 06:14:14] [INFO ] After 152ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-03-12 06:14:14] [INFO ] After 482ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
FORMULA FunctionPointer-PT-b004-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 14 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 648/648 transitions.
Graph (complete) has 932 edges and 222 vertex of which 212 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.5 ms
Discarding 10 places :
Also discarding 0 output transitions
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 25 place count 188 transition count 522
Iterating global reduction 0 with 24 rules applied. Total rules applied 49 place count 188 transition count 522
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 89 place count 188 transition count 482
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 103 place count 174 transition count 454
Iterating global reduction 1 with 14 rules applied. Total rules applied 117 place count 174 transition count 454
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 129 place count 174 transition count 442
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 136 place count 167 transition count 428
Iterating global reduction 2 with 7 rules applied. Total rules applied 143 place count 167 transition count 428
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 150 place count 160 transition count 400
Iterating global reduction 2 with 7 rules applied. Total rules applied 157 place count 160 transition count 400
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 164 place count 153 transition count 386
Iterating global reduction 2 with 7 rules applied. Total rules applied 171 place count 153 transition count 386
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 176 place count 148 transition count 366
Iterating global reduction 2 with 5 rules applied. Total rules applied 181 place count 148 transition count 366
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 186 place count 143 transition count 346
Iterating global reduction 2 with 5 rules applied. Total rules applied 191 place count 143 transition count 346
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 196 place count 138 transition count 336
Iterating global reduction 2 with 5 rules applied. Total rules applied 201 place count 138 transition count 336
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 206 place count 133 transition count 326
Iterating global reduction 2 with 5 rules applied. Total rules applied 211 place count 133 transition count 326
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 216 place count 128 transition count 316
Iterating global reduction 2 with 5 rules applied. Total rules applied 221 place count 128 transition count 316
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 226 place count 123 transition count 306
Iterating global reduction 2 with 5 rules applied. Total rules applied 231 place count 123 transition count 306
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 235 place count 119 transition count 298
Iterating global reduction 2 with 4 rules applied. Total rules applied 239 place count 119 transition count 298
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 245 place count 119 transition count 292
Applied a total of 245 rules in 154 ms. Remains 119 /222 variables (removed 103) and now considering 292/648 (removed 356) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 119/222 places, 292/648 transitions.
Incomplete random walk after 10001 steps, including 15 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1434832 steps, run timeout after 3016 ms. (steps per millisecond=475 ) properties seen :{}
Probabilistic random walk after 1434832 steps, saw 943267 distinct states, run finished after 3017 ms. (steps per millisecond=475 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 06:14:18] [INFO ] Flow matrix only has 197 transitions (discarded 95 similar events)
// Phase 1: matrix 197 rows 119 cols
[2023-03-12 06:14:18] [INFO ] Computed 2 place invariants in 11 ms
[2023-03-12 06:14:18] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 06:14:18] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 06:14:18] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 06:14:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 06:14:18] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 06:14:18] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 06:14:18] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-12 06:14:18] [INFO ] After 26ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 06:14:18] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-12 06:14:18] [INFO ] After 192ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 14 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 292/292 transitions.
Applied a total of 0 rules in 9 ms. Remains 119 /119 variables (removed 0) and now considering 292/292 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 119/119 places, 292/292 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 292/292 transitions.
Applied a total of 0 rules in 10 ms. Remains 119 /119 variables (removed 0) and now considering 292/292 (removed 0) transitions.
[2023-03-12 06:14:18] [INFO ] Flow matrix only has 197 transitions (discarded 95 similar events)
[2023-03-12 06:14:18] [INFO ] Invariant cache hit.
[2023-03-12 06:14:18] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-12 06:14:18] [INFO ] Flow matrix only has 197 transitions (discarded 95 similar events)
[2023-03-12 06:14:18] [INFO ] Invariant cache hit.
[2023-03-12 06:14:18] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-12 06:14:18] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2023-03-12 06:14:18] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-12 06:14:18] [INFO ] Flow matrix only has 197 transitions (discarded 95 similar events)
[2023-03-12 06:14:18] [INFO ] Invariant cache hit.
[2023-03-12 06:14:18] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 396 ms. Remains : 119/119 places, 292/292 transitions.
Graph (trivial) has 152 edges and 119 vertex of which 24 / 119 are part of one of the 8 SCC in 3 ms
Free SCC test removed 16 places
Drop transitions removed 40 transitions
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 119 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 103 transition count 169
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 99 transition count 169
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 9 place count 99 transition count 153
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 41 place count 83 transition count 153
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 48 place count 76 transition count 146
Iterating global reduction 2 with 7 rules applied. Total rules applied 55 place count 76 transition count 146
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 69 place count 76 transition count 132
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 97 place count 62 transition count 118
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 102 place count 57 transition count 108
Iterating global reduction 3 with 5 rules applied. Total rules applied 107 place count 57 transition count 108
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 111 place count 53 transition count 100
Iterating global reduction 3 with 4 rules applied. Total rules applied 115 place count 53 transition count 100
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 117 place count 51 transition count 96
Iterating global reduction 3 with 2 rules applied. Total rules applied 119 place count 51 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 120 place count 51 transition count 95
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 128 place count 47 transition count 102
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 138 place count 47 transition count 92
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 140 place count 47 transition count 90
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 142 place count 45 transition count 90
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 143 place count 45 transition count 89
Applied a total of 143 rules in 30 ms. Remains 45 /119 variables (removed 74) and now considering 89/292 (removed 203) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 89 rows 45 cols
[2023-03-12 06:14:18] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 06:14:18] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 06:14:18] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 06:14:18] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 06:14:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 06:14:18] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 06:14:18] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 06:14:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 06:14:18] [INFO ] After 15ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 06:14:18] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-12 06:14:18] [INFO ] After 96ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-12 06:14:18] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-12 06:14:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 119 places, 292 transitions and 1182 arcs took 2 ms.
[2023-03-12 06:14:19] [INFO ] Flatten gal took : 49 ms
Total runtime 5697 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=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: FuncPointer_2
(NrP: 119 NrTr: 292 NrArc: 1182)

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

net check time: 0m 0.000sec

init dd package: 0m 2.792sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8957672 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16101952 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -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.000sec

8566 16928 25454 34470 46670 56916 57169 65262 74115 82315 87809

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="FunctionPointer-PT-b004"
export BK_EXAMINATION="ReachabilityFireability"
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 FunctionPointer-PT-b004, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-tall-167838857600671"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-b004.tgz
mv FunctionPointer-PT-b004 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;