About the Execution of Marcie+red for HirschbergSinclair-PT-30
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5486.388 | 39571.00 | 59508.00 | 592.90 | TTTFTFTFFTTFTFTF | 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.r202-smll-167840348700470.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 HirschbergSinclair-PT-30, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-167840348700470
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 9.2K Feb 26 02:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 02:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 02:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 02:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 16:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 26 02:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 26 02:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 02:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K Feb 26 02:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 357K 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 HirschbergSinclair-PT-30-ReachabilityCardinality-00
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-01
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-02
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-03
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-04
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-05
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-06
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-07
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-08
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-09
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-10
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-11
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-12
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-13
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-14
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1678803550215
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=HirschbergSinclair-PT-30
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-14 14:19:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 14:19:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 14:19:14] [INFO ] Load time of PNML (sax parser for PT used): 183 ms
[2023-03-14 14:19:14] [INFO ] Transformed 670 places.
[2023-03-14 14:19:14] [INFO ] Transformed 605 transitions.
[2023-03-14 14:19:14] [INFO ] Parsed PT model containing 670 places and 605 transitions and 1849 arcs in 438 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 35 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 16 resets, run finished after 1063 ms. (steps per millisecond=9 ) properties (out of 16) seen :11
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 605 rows 670 cols
[2023-03-14 14:19:15] [INFO ] Computed 65 place invariants in 30 ms
[2023-03-14 14:19:16] [INFO ] After 619ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-14 14:19:16] [INFO ] [Nat]Absence check using 60 positive place invariants in 69 ms returned sat
[2023-03-14 14:19:16] [INFO ] [Nat]Absence check using 60 positive and 5 generalized place invariants in 23 ms returned sat
[2023-03-14 14:19:18] [INFO ] After 1542ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2023-03-14 14:19:19] [INFO ] Deduced a trap composed of 21 places in 321 ms of which 9 ms to minimize.
[2023-03-14 14:19:20] [INFO ] Deduced a trap composed of 11 places in 449 ms of which 2 ms to minimize.
[2023-03-14 14:19:20] [INFO ] Deduced a trap composed of 95 places in 445 ms of which 2 ms to minimize.
[2023-03-14 14:19:21] [INFO ] Deduced a trap composed of 95 places in 425 ms of which 4 ms to minimize.
[2023-03-14 14:19:22] [INFO ] Deduced a trap composed of 33 places in 439 ms of which 2 ms to minimize.
[2023-03-14 14:19:22] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3114 ms
[2023-03-14 14:19:23] [INFO ] Deduced a trap composed of 17 places in 385 ms of which 1 ms to minimize.
[2023-03-14 14:19:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 546 ms
[2023-03-14 14:19:23] [INFO ] After 6355ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 1223 ms.
[2023-03-14 14:19:24] [INFO ] After 8185ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 46 ms.
Support contains 106 out of 670 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 670/670 places, 605/605 transitions.
Graph (complete) has 1278 edges and 670 vertex of which 641 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.10 ms
Discarding 29 places :
Also discarding 0 output transitions
Drop transitions removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 0 with 151 rules applied. Total rules applied 152 place count 641 transition count 454
Reduce places removed 151 places and 0 transitions.
Graph (complete) has 848 edges and 490 vertex of which 439 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.2 ms
Discarding 51 places :
Also discarding 0 output transitions
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 1 with 175 rules applied. Total rules applied 327 place count 439 transition count 431
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 2 with 74 rules applied. Total rules applied 401 place count 416 transition count 380
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 403 place count 414 transition count 378
Iterating global reduction 3 with 2 rules applied. Total rules applied 405 place count 414 transition count 378
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 406 place count 413 transition count 377
Iterating global reduction 3 with 1 rules applied. Total rules applied 407 place count 413 transition count 377
Free-agglomeration rule (complex) applied 33 times.
Iterating global reduction 3 with 33 rules applied. Total rules applied 440 place count 413 transition count 344
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 3 with 33 rules applied. Total rules applied 473 place count 380 transition count 344
Reduce places removed 16 places and 16 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 489 place count 364 transition count 328
Applied a total of 489 rules in 327 ms. Remains 364 /670 variables (removed 306) and now considering 328/605 (removed 277) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 328 ms. Remains : 364/670 places, 328/605 transitions.
Incomplete random walk after 10000 steps, including 30 resets, run finished after 272 ms. (steps per millisecond=36 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 390769 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :{1=1}
Probabilistic random walk after 390769 steps, saw 95006 distinct states, run finished after 3002 ms. (steps per millisecond=130 ) properties seen :1
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 328 rows 364 cols
[2023-03-14 14:19:28] [INFO ] Computed 36 place invariants in 6 ms
[2023-03-14 14:19:28] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 14:19:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 13 ms returned sat
[2023-03-14 14:19:28] [INFO ] [Nat]Absence check using 1 positive and 35 generalized place invariants in 100 ms returned sat
[2023-03-14 14:19:29] [INFO ] After 491ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 14:19:29] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-14 14:19:29] [INFO ] After 517ms SMT Verify possible using 59 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-14 14:19:30] [INFO ] After 850ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 248 ms.
[2023-03-14 14:19:30] [INFO ] After 1831ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 18 ms.
Support contains 87 out of 364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 328/328 transitions.
Graph (complete) has 647 edges and 364 vertex of which 360 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 360 transition count 311
Reduce places removed 13 places and 0 transitions.
Graph (complete) has 613 edges and 347 vertex of which 344 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 16 rules applied. Total rules applied 34 place count 344 transition count 309
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 39 place count 342 transition count 306
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 44 place count 342 transition count 301
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 49 place count 337 transition count 301
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 50 place count 336 transition count 300
Applied a total of 50 rules in 102 ms. Remains 336 /364 variables (removed 28) and now considering 300/328 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 336/364 places, 300/328 transitions.
Incomplete random walk after 10000 steps, including 33 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 391026 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :{}
Probabilistic random walk after 391026 steps, saw 89324 distinct states, run finished after 3006 ms. (steps per millisecond=130 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 300 rows 336 cols
[2023-03-14 14:19:34] [INFO ] Computed 36 place invariants in 3 ms
[2023-03-14 14:19:34] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 14:19:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-14 14:19:34] [INFO ] [Nat]Absence check using 1 positive and 35 generalized place invariants in 66 ms returned sat
[2023-03-14 14:19:34] [INFO ] After 387ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 14:19:34] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-14 14:19:35] [INFO ] After 648ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-14 14:19:35] [INFO ] After 1026ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 288 ms.
[2023-03-14 14:19:36] [INFO ] After 1878ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 18 ms.
Support contains 87 out of 336 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 336/336 places, 300/300 transitions.
Applied a total of 0 rules in 22 ms. Remains 336 /336 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 336/336 places, 300/300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 336/336 places, 300/300 transitions.
Applied a total of 0 rules in 25 ms. Remains 336 /336 variables (removed 0) and now considering 300/300 (removed 0) transitions.
[2023-03-14 14:19:36] [INFO ] Invariant cache hit.
[2023-03-14 14:19:36] [INFO ] Implicit Places using invariants in 574 ms returned []
[2023-03-14 14:19:36] [INFO ] Invariant cache hit.
[2023-03-14 14:19:37] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-14 14:19:38] [INFO ] Implicit Places using invariants and state equation in 1796 ms returned []
Implicit Place search using SMT with State Equation took 2373 ms to find 0 implicit places.
[2023-03-14 14:19:38] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-14 14:19:38] [INFO ] Invariant cache hit.
[2023-03-14 14:19:39] [INFO ] Dead Transitions using invariants and state equation in 443 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2883 ms. Remains : 336/336 places, 300/300 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 336 transition count 230
Reduce places removed 70 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 77 rules applied. Total rules applied 147 place count 266 transition count 223
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 154 place count 259 transition count 223
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 154 place count 259 transition count 189
Deduced a syphon composed of 34 places in 2 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 222 place count 225 transition count 189
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 224 place count 224 transition count 188
Applied a total of 224 rules in 37 ms. Remains 224 /336 variables (removed 112) and now considering 188/300 (removed 112) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 188 rows 224 cols
[2023-03-14 14:19:39] [INFO ] Computed 36 place invariants in 2 ms
[2023-03-14 14:19:39] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 14:19:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-14 14:19:39] [INFO ] [Nat]Absence check using 1 positive and 35 generalized place invariants in 60 ms returned sat
[2023-03-14 14:19:39] [INFO ] After 331ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 14:19:39] [INFO ] After 548ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 159 ms.
[2023-03-14 14:19:40] [INFO ] After 848ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-14 14:19:40] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-14 14:19:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 336 places, 300 transitions and 1057 arcs took 3 ms.
[2023-03-14 14:19:40] [INFO ] Flatten gal took : 81 ms
Total runtime 26710 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: leader
(NrP: 336 NrTr: 300 NrArc: 1057)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.016sec
net check time: 0m 0.000sec
init dd package: 0m 3.532sec
RS generation: 0m 1.167sec
-> reachability set: #nodes 10356 (1.0e+04) #states 4,478,824,692,000 (12)
starting MCC model checker
--------------------------
checking: EF [[[p128<=1 & [p335<=p206 & ~ [p324<=p131]]] & [p260<=0 & [1<=p293 & ~ [p74<=p61]]]]]
normalized: E [true U [[p128<=1 & [p335<=p206 & ~ [p324<=p131]]] & [[~ [p74<=p61] & 1<=p293] & p260<=0]]]
abstracting: (p260<=0)
states: 4,454,492,934,816 (12)
abstracting: (1<=p293)
states: 26,341,697,664 (10)
abstracting: (p74<=p61)
states: 3,446,311,604,040 (12)
abstracting: (p324<=p131)
states: 4,458,360,997,152 (12)
abstracting: (p335<=p206)
states: 4,477,595,213,088 (12)
abstracting: (p128<=1)
states: 4,478,824,692,000 (12)
-> the formula is TRUE
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.839sec
checking: EF [[[[[[[[~ [p57<=p1] & ~ [p137<=p108]] | [1<=p190 & p123<=1]] | ~ [p329<=p80]] | [p169<=0 | ~ [p79<=0]]] & [p72<=p210 | [[[[~ [1<=p326] & ~ [1<=p151]] | p59<=p262] | [p238<=p48 | ~ [p162<=0]]] & [[[p101<=0 & p322<=1] | [[[p161<=p56 & 1<=p296] & ~ [1<=p64]] & [1<=p223 & ~ [p49<=p139]]]] | p76<=0]]]] & [1<=p185 & ~ [p49<=0]]] | [[[~ [p231<=p18] & p77<=1] & [~ [p254<=p158] & [[[[[~ [1<=p24] | ~ [1<=p134]] | [~ [p45<=1] | ~ [p270<=p35]]] & [~ [p46<=p159] | ~ [p272<=p316]]] & [1<=p277 & p256<=0]] | [[[[~ [p101<=0] & ~ [p331<=p225]] | [~ [p52<=p248] & ~ [1<=p125]]] & [~ [p94<=p176] | [~ [p129<=1] | ~ [1<=p213]]]] & [[p159<=p152 | p118<=p74] & [1<=p38 | p30<=0]]]]]] | [[1<=p131 & [1<=p141 & p30<=0]] & [[p63<=p155 | [p235<=0 & [[~ [p145<=1] | [p301<=p231 & [p237<=p69 & [1<=p192 | ~ [1<=p280]]]]] & [p333<=0 | [p81<=0 & [p53<=p283 & [p70<=1 | p298<=1]]]]]]] & [[~ [p295<=0] | ~ [1<=p54]] & [~ [p333<=1] | ~ [1<=p92]]]]]]]]
normalized: E [true U [[[[[[~ [1<=p92] | ~ [p333<=1]] & [~ [1<=p54] | ~ [p295<=0]]] & [p63<=p155 | [p235<=0 & [[p333<=0 | [p81<=0 & [p53<=p283 & [p70<=1 | p298<=1]]]] & [[p301<=p231 & [p237<=p69 & [1<=p192 | ~ [1<=p280]]]] | ~ [p145<=1]]]]]] & [1<=p131 & [1<=p141 & p30<=0]]] | [[[[[[1<=p38 | p30<=0] & [p159<=p152 | p118<=p74]] & [[[~ [1<=p213] | ~ [p129<=1]] | ~ [p94<=p176]] & [[~ [1<=p125] & ~ [p52<=p248]] | [~ [p331<=p225] & ~ [p101<=0]]]]] | [[1<=p277 & p256<=0] & [[~ [p272<=p316] | ~ [p46<=p159]] & [[~ [p270<=p35] | ~ [p45<=1]] | [~ [1<=p134] | ~ [1<=p24]]]]]] & ~ [p254<=p158]] & [p77<=1 & ~ [p231<=p18]]]] | [[1<=p185 & ~ [p49<=0]] & [[p72<=p210 | [[p76<=0 | [[[1<=p223 & ~ [p49<=p139]] & [~ [1<=p64] & [p161<=p56 & 1<=p296]]] | [p101<=0 & p322<=1]]] & [[p238<=p48 | ~ [p162<=0]] | [p59<=p262 | [~ [1<=p151] & ~ [1<=p326]]]]]] & [[p169<=0 | ~ [p79<=0]] | [~ [p329<=p80] | [[1<=p190 & p123<=1] | [~ [p137<=p108] & ~ [p57<=p1]]]]]]]]]
abstracting: (p57<=p1)
states: 4,142,009,742,048 (12)
abstracting: (p137<=p108)
states: 4,423,109,729,760 (12)
abstracting: (p123<=1)
states: 4,478,824,692,000 (12)
abstracting: (1<=p190)
states: 28,603,860,480 (10)
abstracting: (p329<=p80)
states: 4,472,790,018,336 (12)
abstracting: (p79<=0)
states: 3,046,590,487,872 (12)
abstracting: (p169<=0)
states: 4,441,903,466,400 (12)
abstracting: (1<=p326)
states: 20,463,694,848 (10)
abstracting: (1<=p151)
states: 73,842,451,200 (10)
abstracting: (p59<=p262)
states: 3,497,870,890,656 (12)
abstracting: (p162<=0)
states: 4,429,596,391,200 (12)
abstracting: (p238<=p48)
states: 4,459,971,002,400 (12)
abstracting: (p322<=1)
states: 4,478,824,692,000 (12)
abstracting: (p101<=0)
states: 4,447,733,133,600 (12)
abstracting: (1<=p296)
states: 26,341,697,664 (10)
abstracting: (p161<=p56)
states: 4,438,973,210,400 (12)
abstracting: (1<=p64)
states: 1,908,487,941,120 (12)
abstracting: (p49<=p139)
states: 2,490,984,591,120 (12)
abstracting: (1<=p223)
states: 27,509,870,592 (10)
abstracting: (p76<=0)
states: 3,108,528,254,592 (12)
abstracting: (p72<=p210)
states: 3,050,084,940,192 (12)
abstracting: (p49<=0)
states: 2,467,499,360,400 (12)
abstracting: (1<=p185)
states: 35,993,937,600 (10)
abstracting: (p231<=p18)
states: 4,450,544,157,600 (12)
abstracting: (p77<=1)
states: 4,478,824,692,000 (12)
abstracting: (p254<=p158)
states: 4,453,473,967,776 (12)
abstracting: (1<=p24)
states: 1,979,652,908,160 (12)
abstracting: (1<=p134)
states: 61,905,513,600 (10)
abstracting: (p45<=1)
states: 4,478,824,692,000 (12)
abstracting: (p270<=p35)
states: 4,453,473,967,776 (12)
abstracting: (p46<=p159)
states: 2,295,341,679,600 (12)
abstracting: (p272<=p316)
states: 4,464,303,571,872 (12)
abstracting: (p256<=0)
states: 4,453,473,967,776 (12)
abstracting: (1<=p277)
states: 25,350,724,224 (10)
abstracting: (p101<=0)
states: 4,447,733,133,600 (12)
abstracting: (p331<=p225)
states: 4,469,772,681,504 (12)
abstracting: (p52<=p248)
states: 3,367,774,210,104 (12)
abstracting: (1<=p125)
states: 61,905,513,600 (10)
abstracting: (p94<=p176)
states: 4,445,142,170,400 (12)
abstracting: (p129<=1)
states: 4,478,824,692,000 (12)
abstracting: (1<=p213)
states: 48,142,273,536 (10)
abstracting: (p118<=p74)
states: 4,453,174,156,320 (12)
abstracting: (p159<=p152)
states: 4,429,596,391,200 (12)
abstracting: (p30<=0)
states: 4,334,361,528,960 (12)
abstracting: (1<=p38)
states: 22,742,899,200 (10)
abstracting: (p30<=0)
states: 4,334,361,528,960 (12)
abstracting: (1<=p141)
states: 37,143,308,160 (10)
abstracting: (1<=p131)
states: 61,905,513,600 (10)
abstracting: (p145<=1)
states: 4,478,824,692,000 (12)
abstracting: (1<=p280)
states: 16,860,172,032 (10)
abstracting: (1<=p192)
states: 28,603,860,480 (10)
abstracting: (p237<=p69)
states: 4,456,817,523,360 (12)
abstracting: (p301<=p231)
states: 4,463,255,491,488 (12)
abstracting: (p298<=1)
states: 4,478,824,692,000 (12)
abstracting: (p70<=1)
states: 4,478,824,692,000 (12)
abstracting: (p53<=p283)
states: 3,364,924,881,528 (12)
abstracting: (p81<=0)
states: 2,994,792,889,536 (12)
abstracting: (p333<=0)
states: 4,476,238,083,360 (12)
abstracting: (p235<=0)
states: 4,450,544,157,600 (12)
abstracting: (p63<=p155)
states: 3,049,760,237,760 (12)
abstracting: (p295<=0)
states: 4,452,382,217,376 (12)
abstracting: (1<=p54)
states: 1,121,105,062,656 (12)
abstracting: (p333<=1)
states: 4,478,824,692,000 (12)
abstracting: (1<=p92)
states: 33,682,521,600 (10)
-> the formula is TRUE
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.846sec
totally nodes used: 790495 (7.9e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 984265 5381338 6365603
used/not used/entry size/cache size: 5589996 61518868 16 1024MB
basic ops cache: hits/miss/sum: 146618 1062820 1209438
used/not used/entry size/cache size: 1795285 14981931 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: 23743 142812 166555
used/not used/entry size/cache size: 141896 8246712 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 66392484
1 649138
2 60882
3 5879
4 450
5 30
6 1
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 8.364sec
BK_STOP 1678803589786
--------------------
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.007sec
iterations count:6782 (22), effective:387 (1)
initing FirstDep: 0m 0.002sec
iterations count:4390 (14), effective:280 (0)
iterations count:2015 (6), effective:130 (0)
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="HirschbergSinclair-PT-30"
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 HirschbergSinclair-PT-30, 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 r202-smll-167840348700470"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-30.tgz
mv HirschbergSinclair-PT-30 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 '
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 ;