About the Execution of Marcie+red for DiscoveryGPU-PT-12b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5897.651 | 78663.00 | 90295.00 | 812.30 | FFFTTFTFTFFTTFFF | 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.r138-smll-167819420500391.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 DiscoveryGPU-PT-12b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-167819420500391
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.0K Feb 25 13:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 13:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 13:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 13:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Feb 25 13:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 13:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 13:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 13:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 89K 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 DiscoveryGPU-PT-12b-ReachabilityFireability-00
FORMULA_NAME DiscoveryGPU-PT-12b-ReachabilityFireability-01
FORMULA_NAME DiscoveryGPU-PT-12b-ReachabilityFireability-02
FORMULA_NAME DiscoveryGPU-PT-12b-ReachabilityFireability-03
FORMULA_NAME DiscoveryGPU-PT-12b-ReachabilityFireability-04
FORMULA_NAME DiscoveryGPU-PT-12b-ReachabilityFireability-05
FORMULA_NAME DiscoveryGPU-PT-12b-ReachabilityFireability-06
FORMULA_NAME DiscoveryGPU-PT-12b-ReachabilityFireability-07
FORMULA_NAME DiscoveryGPU-PT-12b-ReachabilityFireability-08
FORMULA_NAME DiscoveryGPU-PT-12b-ReachabilityFireability-09
FORMULA_NAME DiscoveryGPU-PT-12b-ReachabilityFireability-10
FORMULA_NAME DiscoveryGPU-PT-12b-ReachabilityFireability-11
FORMULA_NAME DiscoveryGPU-PT-12b-ReachabilityFireability-12
FORMULA_NAME DiscoveryGPU-PT-12b-ReachabilityFireability-13
FORMULA_NAME DiscoveryGPU-PT-12b-ReachabilityFireability-14
FORMULA_NAME DiscoveryGPU-PT-12b-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1678791473465
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=DiscoveryGPU-PT-12b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-14 10:57:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 10:57:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 10:57:57] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2023-03-14 10:57:57] [INFO ] Transformed 352 places.
[2023-03-14 10:57:57] [INFO ] Transformed 374 transitions.
[2023-03-14 10:57:57] [INFO ] Found NUPN structural information;
[2023-03-14 10:57:57] [INFO ] Parsed PT model containing 352 places and 374 transitions and 977 arcs in 331 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 25 resets, run finished after 806 ms. (steps per millisecond=12 ) properties (out of 16) seen :12
FORMULA DiscoveryGPU-PT-12b-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-12b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-12b-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-12b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-12b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-12b-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-12b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-12b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-12b-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-12b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-12b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-12b-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :1
FORMULA DiscoveryGPU-PT-12b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :1
FORMULA DiscoveryGPU-PT-12b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 374 rows 352 cols
[2023-03-14 10:57:58] [INFO ] Computed 14 place invariants in 19 ms
[2023-03-14 10:57:59] [INFO ] After 535ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 10:57:59] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2023-03-14 10:57:59] [INFO ] After 420ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 10:58:00] [INFO ] Deduced a trap composed of 10 places in 234 ms of which 12 ms to minimize.
[2023-03-14 10:58:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 346 ms
[2023-03-14 10:58:00] [INFO ] After 1009ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 306 ms.
[2023-03-14 10:58:00] [INFO ] After 1602ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA DiscoveryGPU-PT-12b-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 13 ms.
Support contains 16 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 374/374 transitions.
Graph (complete) has 608 edges and 352 vertex of which 304 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.2 ms
Discarding 48 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 74 rules applied. Total rules applied 75 place count 304 transition count 276
Reduce places removed 63 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 70 rules applied. Total rules applied 145 place count 241 transition count 269
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 152 place count 234 transition count 269
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 152 place count 234 transition count 243
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 204 place count 208 transition count 243
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 219 place count 193 transition count 228
Iterating global reduction 3 with 15 rules applied. Total rules applied 234 place count 193 transition count 228
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 243 place count 184 transition count 219
Iterating global reduction 3 with 9 rules applied. Total rules applied 252 place count 184 transition count 219
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 261 place count 175 transition count 210
Iterating global reduction 3 with 9 rules applied. Total rules applied 270 place count 175 transition count 210
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 278 place count 167 transition count 194
Iterating global reduction 3 with 8 rules applied. Total rules applied 286 place count 167 transition count 194
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 294 place count 159 transition count 186
Iterating global reduction 3 with 8 rules applied. Total rules applied 302 place count 159 transition count 186
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 416 place count 102 transition count 129
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 422 place count 96 transition count 117
Iterating global reduction 3 with 6 rules applied. Total rules applied 428 place count 96 transition count 117
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 434 place count 90 transition count 111
Iterating global reduction 3 with 6 rules applied. Total rules applied 440 place count 90 transition count 111
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 444 place count 86 transition count 107
Iterating global reduction 3 with 4 rules applied. Total rules applied 448 place count 86 transition count 107
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 452 place count 82 transition count 103
Iterating global reduction 3 with 4 rules applied. Total rules applied 456 place count 82 transition count 103
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 460 place count 78 transition count 95
Iterating global reduction 3 with 4 rules applied. Total rules applied 464 place count 78 transition count 95
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 468 place count 74 transition count 91
Iterating global reduction 3 with 4 rules applied. Total rules applied 472 place count 74 transition count 91
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 473 place count 74 transition count 90
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 474 place count 73 transition count 90
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 475 place count 73 transition count 90
Applied a total of 475 rules in 179 ms. Remains 73 /352 variables (removed 279) and now considering 90/374 (removed 284) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 73/352 places, 90/374 transitions.
Incomplete random walk after 10000 steps, including 40 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2152887 steps, run timeout after 3001 ms. (steps per millisecond=717 ) properties seen :{}
Probabilistic random walk after 2152887 steps, saw 391105 distinct states, run finished after 3004 ms. (steps per millisecond=716 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 10:58:04] [INFO ] Flow matrix only has 80 transitions (discarded 10 similar events)
// Phase 1: matrix 80 rows 73 cols
[2023-03-14 10:58:04] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-14 10:58:04] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 10:58:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 10:58:04] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 10:58:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-14 10:58:04] [INFO ] After 26ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 10:58:04] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-14 10:58:04] [INFO ] After 160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 16 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 90/90 transitions.
Applied a total of 0 rules in 4 ms. Remains 73 /73 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 73/73 places, 90/90 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 90/90 transitions.
Applied a total of 0 rules in 4 ms. Remains 73 /73 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-14 10:58:04] [INFO ] Flow matrix only has 80 transitions (discarded 10 similar events)
[2023-03-14 10:58:04] [INFO ] Invariant cache hit.
[2023-03-14 10:58:04] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-14 10:58:04] [INFO ] Flow matrix only has 80 transitions (discarded 10 similar events)
[2023-03-14 10:58:04] [INFO ] Invariant cache hit.
[2023-03-14 10:58:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-14 10:58:04] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2023-03-14 10:58:04] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-14 10:58:04] [INFO ] Flow matrix only has 80 transitions (discarded 10 similar events)
[2023-03-14 10:58:04] [INFO ] Invariant cache hit.
[2023-03-14 10:58:04] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 342 ms. Remains : 73/73 places, 90/90 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 73 transition count 80
Applied a total of 10 rules in 4 ms. Remains 73 /73 variables (removed 0) and now considering 80/90 (removed 10) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 80 rows 73 cols
[2023-03-14 10:58:04] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-14 10:58:04] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 10:58:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 10:58:04] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 10:58:04] [INFO ] After 97ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-14 10:58:04] [INFO ] After 174ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-14 10:58:04] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-14 10:58:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 73 places, 90 transitions and 322 arcs took 2 ms.
[2023-03-14 10:58:05] [INFO ] Flatten gal took : 69 ms
Total runtime 8327 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: DiscoveryGPU_PT_12b
(NrP: 73 NrTr: 90 NrArc: 322)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec
net check time: 0m 0.000sec
init dd package: 0m 3.662sec
RS generation: 0m51.757sec
-> reachability set: #nodes 216240 (2.2e+05) #states 95,770,828,657 (10)
starting MCC model checker
--------------------------
checking: AG [[[[[[1<=p37 & p37<=1] & [[p14<=0 & 0<=p14] & [p39<=0 & 0<=p39]]] | [[[p44<=0 & 0<=p44] & [p0<=0 & 0<=p0]] | [[[p57<=1 & 1<=p57] & [p2<=1 & 1<=p2]] & [[p47<=1 & 1<=p47] & [[p48<=1 & 1<=p48] & [p72<=1 & 1<=p72]]]]]] | [[p46<=0 & 0<=p46] | [p70<=0 & 0<=p70]]] | [[[p5<=0 & 0<=p5] | [p65<=0 & 0<=p65]] | [[p62<=0 & 0<=p62] | [p31<=0 & 0<=p31]]]]]
normalized: ~ [E [true U ~ [[[[[p65<=0 & 0<=p65] | [p5<=0 & 0<=p5]] | [[p62<=0 & 0<=p62] | [p31<=0 & 0<=p31]]] | [[[p70<=0 & 0<=p70] | [p46<=0 & 0<=p46]] | [[[[[[p48<=1 & 1<=p48] & [p72<=1 & 1<=p72]] & [p47<=1 & 1<=p47]] & [[p2<=1 & 1<=p2] & [p57<=1 & 1<=p57]]] | [[p0<=0 & 0<=p0] & [p44<=0 & 0<=p44]]] | [[[p39<=0 & 0<=p39] & [p14<=0 & 0<=p14]] & [1<=p37 & p37<=1]]]]]]]]
abstracting: (p37<=1)
states: 95,770,828,657 (10)
abstracting: (1<=p37)
states: 9,472,339,200 (9)
abstracting: (0<=p14)
states: 95,770,828,657 (10)
abstracting: (p14<=0)
states: 86,700,400,273 (10)
abstracting: (0<=p39)
states: 95,770,828,657 (10)
abstracting: (p39<=0)
states: 84,283,518,577 (10)
abstracting: (0<=p44)
states: 95,770,828,657 (10)
abstracting: (p44<=0)
states: 68,820,209,425 (10)
abstracting: (0<=p0)
states: 95,770,828,657 (10)
abstracting: (p0<=0)
states: 95,770,828,656 (10)
abstracting: (1<=p57)
states: 9,472,371,120 (9)
abstracting: (p57<=1)
states: 95,770,828,657 (10)
abstracting: (1<=p2)
states: 296,784 (5)
abstracting: (p2<=1)
states: 95,770,828,657 (10)
abstracting: (1<=p47)
states: 7,980,902,388 (9)
abstracting: (p47<=1)
states: 95,770,828,657 (10)
abstracting: (1<=p72)
states: 47,885,414,328 (10)
abstracting: (p72<=1)
states: 95,770,828,657 (10)
abstracting: (1<=p48)
states: 7,980,902,388 (9)
abstracting: (p48<=1)
states: 95,770,828,657 (10)
abstracting: (0<=p46)
states: 95,770,828,657 (10)
abstracting: (p46<=0)
states: 87,789,926,269 (10)
abstracting: (0<=p70)
states: 95,770,828,657 (10)
abstracting: (p70<=0)
states: 47,885,414,329 (10)
abstracting: (0<=p31)
states: 95,770,828,657 (10)
abstracting: (p31<=0)
states: 86,298,489,457 (10)
abstracting: (0<=p62)
states: 95,770,828,657 (10)
abstracting: (p62<=0)
states: 86,298,457,537 (10)
abstracting: (0<=p5)
states: 95,770,828,657 (10)
abstracting: (p5<=0)
states: 86,700,400,273 (10)
abstracting: (0<=p65)
states: 95,770,828,657 (10)
abstracting: (p65<=0)
states: 82,736,092,081 (10)
-> the formula is FALSE
FORMULA DiscoveryGPU-PT-12b-ReachabilityFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 7.052sec
totally nodes used: 5511467 (5.5e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 66961796 92611133 159572929
used/not used/entry size/cache size: 50192682 16916182 16 1024MB
basic ops cache: hits/miss/sum: 6442866 9762260 16205126
used/not used/entry size/cache size: 9453531 7323685 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 591288 744639 1335927
used/not used/entry size/cache size: 714313 7674295 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 62110008
1 4564414
2 383206
3 43583
4 4569
5 1032
6 306
7 169
8 272
9 327
>= 10 978
Total processing time: 1m 5.505sec
BK_STOP 1678791552128
--------------------
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 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
iterations count:14924 (165), effective:695 (7)
initing FirstDep: 0m 0.000sec
iterations count:1722 (19), effective:97 (1)
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="DiscoveryGPU-PT-12b"
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 DiscoveryGPU-PT-12b, 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 r138-smll-167819420500391"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-12b.tgz
mv DiscoveryGPU-PT-12b 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 '
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 ;