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-167840348700478.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-35, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-167840348700478
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 12K Feb 26 02:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 02:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 02:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 02:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Feb 25 16:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 26 02:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Feb 26 02:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 02:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 02:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K 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 544K 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-35-ReachabilityCardinality-00
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-01
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-02
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-03
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-04
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-05
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-06
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-07
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-08
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-09
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-10
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-11
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-12
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-13
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-14
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678807649595

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-35
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-14 15:27:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 15:27:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 15:27:33] [INFO ] Load time of PNML (sax parser for PT used): 301 ms
[2023-03-14 15:27:33] [INFO ] Transformed 998 places.
[2023-03-14 15:27:33] [INFO ] Transformed 922 transitions.
[2023-03-14 15:27:33] [INFO ] Parsed PT model containing 998 places and 922 transitions and 2806 arcs in 482 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 45 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 10 resets, run finished after 1010 ms. (steps per millisecond=9 ) properties (out of 16) seen :9
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 922 rows 998 cols
[2023-03-14 15:27:35] [INFO ] Computed 76 place invariants in 35 ms
[2023-03-14 15:27:36] [INFO ] After 648ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-14 15:27:36] [INFO ] [Nat]Absence check using 70 positive place invariants in 54 ms returned sat
[2023-03-14 15:27:36] [INFO ] [Nat]Absence check using 70 positive and 6 generalized place invariants in 6 ms returned sat
[2023-03-14 15:27:39] [INFO ] After 2907ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :3
[2023-03-14 15:27:40] [INFO ] Deduced a trap composed of 17 places in 750 ms of which 11 ms to minimize.
[2023-03-14 15:27:41] [INFO ] Deduced a trap composed of 17 places in 628 ms of which 2 ms to minimize.
[2023-03-14 15:27:42] [INFO ] Deduced a trap composed of 60 places in 507 ms of which 2 ms to minimize.
[2023-03-14 15:27:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2178 ms
[2023-03-14 15:27:43] [INFO ] Deduced a trap composed of 13 places in 545 ms of which 16 ms to minimize.
[2023-03-14 15:27:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 689 ms
[2023-03-14 15:27:44] [INFO ] Deduced a trap composed of 58 places in 529 ms of which 2 ms to minimize.
[2023-03-14 15:27:45] [INFO ] Deduced a trap composed of 13 places in 859 ms of which 2 ms to minimize.
[2023-03-14 15:27:46] [INFO ] Deduced a trap composed of 108 places in 378 ms of which 1 ms to minimize.
[2023-03-14 15:27:47] [INFO ] Deduced a trap composed of 64 places in 856 ms of which 8 ms to minimize.
[2023-03-14 15:27:48] [INFO ] Deduced a trap composed of 124 places in 703 ms of which 2 ms to minimize.
[2023-03-14 15:27:48] [INFO ] Deduced a trap composed of 30 places in 556 ms of which 1 ms to minimize.
[2023-03-14 15:27:49] [INFO ] Deduced a trap composed of 45 places in 647 ms of which 1 ms to minimize.
[2023-03-14 15:27:50] [INFO ] Deduced a trap composed of 30 places in 553 ms of which 2 ms to minimize.
[2023-03-14 15:27:50] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 6421 ms
[2023-03-14 15:27:50] [INFO ] After 13630ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :3
Attempting to minimize the solution found.
Minimization took 1871 ms.
[2023-03-14 15:27:52] [INFO ] After 16211ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :3
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 87 ms.
Support contains 83 out of 998 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 998/998 places, 922/922 transitions.
Graph (complete) has 1924 edges and 998 vertex of which 958 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.8 ms
Discarding 40 places :
Also discarding 0 output transitions
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 310 transitions
Trivial Post-agglo rules discarded 310 transitions
Performed 310 trivial Post agglomeration. Transition count delta: 310
Iterating post reduction 0 with 317 rules applied. Total rules applied 318 place count 958 transition count 605
Reduce places removed 310 places and 0 transitions.
Graph (complete) has 1138 edges and 648 vertex of which 579 are kept as prefixes of interest. Removing 69 places using SCC suffix rule.3 ms
Discarding 69 places :
Also discarding 0 output transitions
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Iterating post reduction 1 with 336 rules applied. Total rules applied 654 place count 579 transition count 580
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Iterating post reduction 2 with 94 rules applied. Total rules applied 748 place count 554 transition count 511
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 750 place count 552 transition count 509
Iterating global reduction 3 with 2 rules applied. Total rules applied 752 place count 552 transition count 509
Free-agglomeration rule (complex) applied 47 times.
Iterating global reduction 3 with 47 rules applied. Total rules applied 799 place count 552 transition count 462
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 3 with 47 rules applied. Total rules applied 846 place count 505 transition count 462
Reduce places removed 28 places and 28 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 874 place count 477 transition count 434
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 4 with 15 rules applied. Total rules applied 889 place count 474 transition count 422
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 901 place count 462 transition count 422
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 20 Pre rules applied. Total rules applied 901 place count 462 transition count 402
Deduced a syphon composed of 20 places in 4 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 941 place count 442 transition count 402
Applied a total of 941 rules in 471 ms. Remains 442 /998 variables (removed 556) and now considering 402/922 (removed 520) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 471 ms. Remains : 442/998 places, 402/922 transitions.
Incomplete random walk after 10000 steps, including 25 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 3) seen :1
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :1
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 402 rows 442 cols
[2023-03-14 15:27:53] [INFO ] Computed 40 place invariants in 6 ms
[2023-03-14 15:27:53] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 15:27:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2023-03-14 15:27:53] [INFO ] [Nat]Absence check using 6 positive and 34 generalized place invariants in 67 ms returned sat
[2023-03-14 15:27:53] [INFO ] After 333ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 15:27:53] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-14 15:27:54] [INFO ] After 463ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 15:27:54] [INFO ] After 869ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 408 ms.
[2023-03-14 15:27:55] [INFO ] After 1776ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 27 out of 442 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 442/442 places, 402/402 transitions.
Graph (complete) has 806 edges and 442 vertex of which 433 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 433 transition count 360
Reduce places removed 37 places and 0 transitions.
Graph (complete) has 688 edges and 396 vertex of which 384 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 40 rules applied. Total rules applied 83 place count 384 transition count 358
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 97 place count 382 transition count 346
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 97 place count 382 transition count 326
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 137 place count 362 transition count 326
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 141 place count 358 transition count 322
Iterating global reduction 3 with 4 rules applied. Total rules applied 145 place count 358 transition count 322
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 146 place count 358 transition count 321
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 648 edges and 357 vertex of which 355 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 148 place count 355 transition count 321
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 150 place count 355 transition count 319
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 151 place count 354 transition count 318
Iterating global reduction 6 with 1 rules applied. Total rules applied 152 place count 354 transition count 318
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 157 place count 354 transition count 313
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 162 place count 349 transition count 313
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 165 place count 346 transition count 310
Applied a total of 165 rules in 210 ms. Remains 346 /442 variables (removed 96) and now considering 310/402 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 210 ms. Remains : 346/442 places, 310/402 transitions.
Incomplete random walk after 10000 steps, including 32 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 541938 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :{}
Probabilistic random walk after 541938 steps, saw 121386 distinct states, run finished after 3003 ms. (steps per millisecond=180 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 310 rows 346 cols
[2023-03-14 15:27:58] [INFO ] Computed 36 place invariants in 4 ms
[2023-03-14 15:27:58] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 15:27:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-03-14 15:27:58] [INFO ] [Nat]Absence check using 11 positive and 25 generalized place invariants in 36 ms returned sat
[2023-03-14 15:27:58] [INFO ] After 173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 15:27:58] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-14 15:27:59] [INFO ] After 177ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 15:27:59] [INFO ] After 394ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 147 ms.
[2023-03-14 15:27:59] [INFO ] After 858ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 27 out of 346 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 346/346 places, 310/310 transitions.
Applied a total of 0 rules in 15 ms. Remains 346 /346 variables (removed 0) and now considering 310/310 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 346/346 places, 310/310 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 346/346 places, 310/310 transitions.
Applied a total of 0 rules in 17 ms. Remains 346 /346 variables (removed 0) and now considering 310/310 (removed 0) transitions.
[2023-03-14 15:27:59] [INFO ] Invariant cache hit.
[2023-03-14 15:28:00] [INFO ] Implicit Places using invariants in 537 ms returned []
[2023-03-14 15:28:00] [INFO ] Invariant cache hit.
[2023-03-14 15:28:00] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-14 15:28:02] [INFO ] Implicit Places using invariants and state equation in 2010 ms returned []
Implicit Place search using SMT with State Equation took 2570 ms to find 0 implicit places.
[2023-03-14 15:28:02] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-14 15:28:02] [INFO ] Invariant cache hit.
[2023-03-14 15:28:02] [INFO ] Dead Transitions using invariants and state equation in 446 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3114 ms. Remains : 346/346 places, 310/310 transitions.
Graph (complete) has 362 edges and 346 vertex of which 344 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 14 places
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 214 rules applied. Total rules applied 215 place count 330 transition count 110
Reduce places removed 200 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 208 rules applied. Total rules applied 423 place count 130 transition count 102
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 431 place count 122 transition count 102
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 431 place count 122 transition count 75
Renaming transitions due to excessive name length > 1024 char.
Deduced a syphon composed of 27 places in 2 ms
Ensure Unique test removed 3 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 57 rules applied. Total rules applied 488 place count 92 transition count 75
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 3 rules applied. Total rules applied 491 place count 91 transition count 73
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 494 place count 89 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 495 place count 88 transition count 72
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 495 place count 88 transition count 71
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 497 place count 87 transition count 71
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 501 place count 85 transition count 69
Applied a total of 501 rules in 58 ms. Remains 85 /346 variables (removed 261) and now considering 69/310 (removed 241) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 69 rows 85 cols
[2023-03-14 15:28:02] [INFO ] Computed 16 place invariants in 2 ms
[2023-03-14 15:28:02] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 15:28:02] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-14 15:28:02] [INFO ] [Nat]Absence check using 9 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-14 15:28:02] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 15:28:02] [INFO ] After 92ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-14 15:28:02] [INFO ] After 174ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-14 15:28:02] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 10 ms.
[2023-03-14 15:28:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 346 places, 310 transitions and 1199 arcs took 5 ms.
[2023-03-14 15:28:03] [INFO ] Flatten gal took : 178 ms
Total runtime 30456 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: 346 NrTr: 310 NrArc: 1199)

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

net check time: 0m 0.000sec

init dd package: 0m 3.511sec


RS generation: 0m 0.656sec


-> reachability set: #nodes 4847 (4.8e+03) #states 39,737,952 (7)



starting MCC model checker
--------------------------

checking: AG [[[p35<=p106 | ~ [p13<=p310]] | [~ [p45<=p47] | [[[p138<=1 | [p37<=p210 & ~ [1<=p317]]] & [[[[[~ [p192<=p228] | ~ [p288<=p86]] & [~ [p157<=p2] | ~ [p267<=1]]] & [p43<=p300 & [~ [1<=p320] | ~ [1<=p192]]]] & [[p108<=1 & p187<=0] & [1<=p39 & 1<=p102]]] | p342<=p8]] & p244<=0]]]]
normalized: ~ [E [true U ~ [[[[[[p138<=1 | [p37<=p210 & ~ [1<=p317]]] & [p342<=p8 | [[[p108<=1 & p187<=0] & [1<=p39 & 1<=p102]] & [[[~ [1<=p192] | ~ [1<=p320]] & p43<=p300] & [[~ [p157<=p2] | ~ [p267<=1]] & [~ [p288<=p86] | ~ [p192<=p228]]]]]]] & p244<=0] | ~ [p45<=p47]] | [~ [p13<=p310] | p35<=p106]]]]]

abstracting: (p35<=p106)
states: 26,560,656 (7)
abstracting: (p13<=p310)
states: 17,886,906 (7)
abstracting: (p45<=p47)
states: 30,907,296 (7)
abstracting: (p244<=0)
states: 39,381,228 (7)
abstracting: (p192<=p228)
states: 39,404,556 (7)
abstracting: (p288<=p86)
states: 39,538,206 (7)
abstracting: (p267<=1)
states: 39,737,952 (7)
abstracting: (p157<=p2)
states: 39,398,724 (7)
abstracting: (p43<=p300)
states: 20,564,442 (7)
abstracting: (1<=p320)
states: 205,092 (5)
abstracting: (1<=p192)
states: 339,228 (5)
abstracting: (1<=p102)
states: 206,064 (5)
abstracting: (1<=p39)
states: 13,245,984 (7)
abstracting: (p187<=0)
states: 39,398,724 (7)
abstracting: (p108<=1)
states: 39,737,952 (7)
abstracting: (p342<=p8)
states: 39,536,262 (7)
abstracting: (1<=p317)
states: 136,728 (5)
abstracting: (p37<=p210)
states: 26,650,620 (7)
abstracting: (p138<=1)
states: 39,737,952 (7)
-> the formula is FALSE

FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.314sec

totally nodes used: 513455 (5.1e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1253437 4942606 6196043
used/not used/entry size/cache size: 5107085 62001779 16 1024MB
basic ops cache: hits/miss/sum: 100029 448902 548931
used/not used/entry size/cache size: 899835 15877381 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: 5243 28726 33969
used/not used/entry size/cache size: 28718 8359890 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 66619542
1 466489
2 21568
3 1236
4 26
5 2
6 0
7 0
8 1
9 0
>= 10 0

Total processing time: 0m 7.264sec


BK_STOP 1678807691802

--------------------
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.001sec


iterations count:6153 (19), effective:371 (1)

initing FirstDep: 0m 0.001sec


iterations count:6699 (21), effective:413 (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="HirschbergSinclair-PT-35"
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-35, 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-167840348700478"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-35.tgz
mv HirschbergSinclair-PT-35 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;