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.r010-oct2-167813599300638.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 AutonomousCar-PT-07b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813599300638
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 6.6K Feb 25 12:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 25 12:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 12:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 12:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 25 12:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Feb 25 12:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 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 334K 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 AutonomousCar-PT-07b-ReachabilityCardinality-00
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-01
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-02
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-03
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-04
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-05
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-06
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-07
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-08
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-09
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-10
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-11
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-12
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-13
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-14
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678700444765

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=AutonomousCar-PT-07b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:40:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 09:40:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:40:47] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2023-03-13 09:40:47] [INFO ] Transformed 323 places.
[2023-03-13 09:40:47] [INFO ] Transformed 846 transitions.
[2023-03-13 09:40:47] [INFO ] Found NUPN structural information;
[2023-03-13 09:40:47] [INFO ] Parsed PT model containing 323 places and 846 transitions and 5865 arcs in 225 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 94 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 15) seen :9
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :1
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 846 rows 323 cols
[2023-03-13 09:40:48] [INFO ] Computed 12 place invariants in 16 ms
[2023-03-13 09:40:48] [INFO ] After 395ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 09:40:49] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2023-03-13 09:40:49] [INFO ] After 476ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2023-03-13 09:40:49] [INFO ] Deduced a trap composed of 22 places in 174 ms of which 15 ms to minimize.
[2023-03-13 09:40:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 261 ms
[2023-03-13 09:40:50] [INFO ] Deduced a trap composed of 32 places in 359 ms of which 1 ms to minimize.
[2023-03-13 09:40:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 408 ms
[2023-03-13 09:40:50] [INFO ] After 1357ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 231 ms.
[2023-03-13 09:40:50] [INFO ] After 1716ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 26 ms.
Support contains 47 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 846/846 transitions.
Drop transitions removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 323 transition count 754
Reduce places removed 92 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 101 rules applied. Total rules applied 193 place count 231 transition count 745
Reduce places removed 4 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 2 with 24 rules applied. Total rules applied 217 place count 227 transition count 725
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 25 rules applied. Total rules applied 242 place count 207 transition count 720
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 244 place count 205 transition count 720
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 15 Pre rules applied. Total rules applied 244 place count 205 transition count 705
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 274 place count 190 transition count 705
Discarding 22 places :
Symmetric choice reduction at 5 with 22 rule applications. Total rules 296 place count 168 transition count 683
Iterating global reduction 5 with 22 rules applied. Total rules applied 318 place count 168 transition count 683
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 5 with 198 rules applied. Total rules applied 516 place count 168 transition count 485
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 516 place count 168 transition count 483
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 520 place count 166 transition count 483
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 524 place count 162 transition count 455
Iterating global reduction 6 with 4 rules applied. Total rules applied 528 place count 162 transition count 455
Performed 30 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 588 place count 132 transition count 424
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 589 place count 131 transition count 416
Iterating global reduction 6 with 1 rules applied. Total rules applied 590 place count 131 transition count 416
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 592 place count 130 transition count 416
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 599 place count 130 transition count 409
Free-agglomeration rule applied 10 times.
Iterating global reduction 6 with 10 rules applied. Total rules applied 609 place count 130 transition count 399
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 619 place count 120 transition count 399
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 620 place count 120 transition count 399
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 621 place count 120 transition count 399
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 622 place count 119 transition count 398
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 623 place count 118 transition count 398
Applied a total of 623 rules in 294 ms. Remains 118 /323 variables (removed 205) and now considering 398/846 (removed 448) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 295 ms. Remains : 118/323 places, 398/846 transitions.
Incomplete random walk after 10000 steps, including 155 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :1
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 42 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 398 rows 118 cols
[2023-03-13 09:40:51] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-13 09:40:51] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 09:40:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 09:40:51] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 09:40:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 09:40:51] [INFO ] After 46ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 09:40:51] [INFO ] Deduced a trap composed of 13 places in 235 ms of which 1 ms to minimize.
[2023-03-13 09:40:51] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 1 ms to minimize.
[2023-03-13 09:40:52] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 0 ms to minimize.
[2023-03-13 09:40:52] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 0 ms to minimize.
[2023-03-13 09:40:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 681 ms
[2023-03-13 09:40:52] [INFO ] Deduced a trap composed of 11 places in 241 ms of which 2 ms to minimize.
[2023-03-13 09:40:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 275 ms
[2023-03-13 09:40:52] [INFO ] After 1052ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-13 09:40:52] [INFO ] After 1300ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 21 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 398/398 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 118 transition count 383
Reduce places removed 15 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 19 rules applied. Total rules applied 34 place count 103 transition count 379
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 40 place count 99 transition count 377
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 42 place count 98 transition count 376
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 42 place count 98 transition count 375
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 44 place count 97 transition count 375
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 46 place count 95 transition count 360
Iterating global reduction 4 with 2 rules applied. Total rules applied 48 place count 95 transition count 360
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 50 place count 95 transition count 358
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 51 place count 94 transition count 358
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 67 place count 86 transition count 350
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 68 place count 86 transition count 349
Free-agglomeration rule applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 74 place count 86 transition count 343
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 80 place count 80 transition count 343
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 82 place count 78 transition count 341
Applied a total of 82 rules in 84 ms. Remains 78 /118 variables (removed 40) and now considering 341/398 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 78/118 places, 341/398 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1106141 steps, run timeout after 3001 ms. (steps per millisecond=368 ) properties seen :{}
Probabilistic random walk after 1106141 steps, saw 158187 distinct states, run finished after 3005 ms. (steps per millisecond=368 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 341 rows 78 cols
[2023-03-13 09:40:55] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-13 09:40:55] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 09:40:55] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-13 09:40:56] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 09:40:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 09:40:56] [INFO ] After 64ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 09:40:56] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 0 ms to minimize.
[2023-03-13 09:40:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2023-03-13 09:40:56] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 0 ms to minimize.
[2023-03-13 09:40:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2023-03-13 09:40:56] [INFO ] After 443ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-13 09:40:56] [INFO ] After 683ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 21 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 341/341 transitions.
Applied a total of 0 rules in 13 ms. Remains 78 /78 variables (removed 0) and now considering 341/341 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 78/78 places, 341/341 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 341/341 transitions.
Applied a total of 0 rules in 12 ms. Remains 78 /78 variables (removed 0) and now considering 341/341 (removed 0) transitions.
[2023-03-13 09:40:56] [INFO ] Invariant cache hit.
[2023-03-13 09:40:56] [INFO ] Implicit Places using invariants in 239 ms returned []
[2023-03-13 09:40:56] [INFO ] Invariant cache hit.
[2023-03-13 09:40:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 09:40:57] [INFO ] Implicit Places using invariants and state equation in 196 ms returned [69, 76]
Discarding 2 places :
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 440 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 76/78 places, 340/341 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 76 transition count 339
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 75 transition count 339
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 75 transition count 338
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 74 transition count 338
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 5 place count 74 transition count 338
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6 place count 73 transition count 338
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 7 place count 73 transition count 338
Applied a total of 7 rules in 48 ms. Remains 73 /76 variables (removed 3) and now considering 338/340 (removed 2) transitions.
// Phase 1: matrix 338 rows 73 cols
[2023-03-13 09:40:57] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-13 09:40:57] [INFO ] Implicit Places using invariants in 233 ms returned []
[2023-03-13 09:40:57] [INFO ] Invariant cache hit.
[2023-03-13 09:40:57] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 73/78 places, 338/341 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 987 ms. Remains : 73/78 places, 338/341 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1625137 steps, run timeout after 3001 ms. (steps per millisecond=541 ) properties seen :{1=1}
Probabilistic random walk after 1625137 steps, saw 229995 distinct states, run finished after 3001 ms. (steps per millisecond=541 ) properties seen :1
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
[2023-03-13 09:41:00] [INFO ] Invariant cache hit.
[2023-03-13 09:41:00] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 09:41:00] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-13 09:41:00] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 09:41:01] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 1 ms to minimize.
[2023-03-13 09:41:01] [INFO ] Deduced a trap composed of 7 places in 186 ms of which 0 ms to minimize.
[2023-03-13 09:41:01] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 1 ms to minimize.
[2023-03-13 09:41:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 523 ms
[2023-03-13 09:41:01] [INFO ] After 716ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-13 09:41:01] [INFO ] After 785ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 16 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 338/338 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 73 transition count 335
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 70 transition count 334
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 69 transition count 333
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 10 place count 69 transition count 332
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 11 place count 68 transition count 332
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 12 place count 67 transition count 331
Applied a total of 12 rules in 62 ms. Remains 67 /73 variables (removed 6) and now considering 331/338 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 67/73 places, 331/338 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2438975 steps, run timeout after 3001 ms. (steps per millisecond=812 ) properties seen :{}
Probabilistic random walk after 2438975 steps, saw 333392 distinct states, run finished after 3002 ms. (steps per millisecond=812 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 331 rows 67 cols
[2023-03-13 09:41:04] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-13 09:41:04] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 09:41:04] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-13 09:41:04] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 09:41:05] [INFO ] Deduced a trap composed of 5 places in 189 ms of which 0 ms to minimize.
[2023-03-13 09:41:05] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 1 ms to minimize.
[2023-03-13 09:41:05] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 1 ms to minimize.
[2023-03-13 09:41:05] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 0 ms to minimize.
[2023-03-13 09:41:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 619 ms
[2023-03-13 09:41:05] [INFO ] After 776ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-13 09:41:05] [INFO ] After 835ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 16 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 331/331 transitions.
Applied a total of 0 rules in 9 ms. Remains 67 /67 variables (removed 0) and now considering 331/331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 67/67 places, 331/331 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 331/331 transitions.
Applied a total of 0 rules in 9 ms. Remains 67 /67 variables (removed 0) and now considering 331/331 (removed 0) transitions.
[2023-03-13 09:41:05] [INFO ] Invariant cache hit.
[2023-03-13 09:41:05] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-13 09:41:05] [INFO ] Invariant cache hit.
[2023-03-13 09:41:06] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
[2023-03-13 09:41:06] [INFO ] Redundant transitions in 38 ms returned []
[2023-03-13 09:41:06] [INFO ] Invariant cache hit.
[2023-03-13 09:41:06] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 871 ms. Remains : 67/67 places, 331/331 transitions.
Applied a total of 0 rules in 7 ms. Remains 67 /67 variables (removed 0) and now considering 331/331 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-13 09:41:06] [INFO ] Invariant cache hit.
[2023-03-13 09:41:06] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 09:41:06] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-13 09:41:06] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 09:41:06] [INFO ] Deduced a trap composed of 5 places in 117 ms of which 1 ms to minimize.
[2023-03-13 09:41:06] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 1 ms to minimize.
[2023-03-13 09:41:07] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 6 ms to minimize.
[2023-03-13 09:41:07] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2023-03-13 09:41:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 459 ms
[2023-03-13 09:41:07] [INFO ] After 582ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-13 09:41:07] [INFO ] After 628ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-13 09:41:07] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 9 ms.
[2023-03-13 09:41:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 67 places, 331 transitions and 3064 arcs took 5 ms.
[2023-03-13 09:41:07] [INFO ] Flatten gal took : 95 ms
Total runtime 19945 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: AutonomousCar_PT_07b
(NrP: 67 NrTr: 331 NrArc: 3064)

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

net check time: 0m 0.000sec

init dd package: 0m 2.868sec


RS generation: 0m 6.737sec


-> reachability set: #nodes 11467 (1.1e+04) #states 15,866,931 (7)



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

checking: AG [[[[0<=p65 & p65<=0] & [[[[[p56<=1 & 1<=p56] | [0<=p49 & p49<=0]] & [p26<=1 & 1<=p26]] | [[[1<=p3 & p3<=1] | [p24<=0 & 0<=p24]] & [0<=p13 & p13<=0]]] | [[[0<=p22 & p22<=0] & [1<=p58 & p58<=1]] | [p47<=0 & 0<=p47]]]] | [[p61<=0 & 0<=p61] & [[[[0<=p34 & p34<=0] | [0<=p41 & p41<=0]] | [p33<=1 & 1<=p33]] | [[p35<=1 & 1<=p35] | [[p50<=0 & 0<=p50] | [p22<=1 & 1<=p22]]]]]]]
normalized: ~ [E [true U ~ [[[[[[p47<=0 & 0<=p47] | [[0<=p22 & p22<=0] & [1<=p58 & p58<=1]]] | [[[p26<=1 & 1<=p26] & [[0<=p49 & p49<=0] | [p56<=1 & 1<=p56]]] | [[0<=p13 & p13<=0] & [[p24<=0 & 0<=p24] | [1<=p3 & p3<=1]]]]] & [0<=p65 & p65<=0]] | [[p61<=0 & 0<=p61] & [[[p35<=1 & 1<=p35] | [[p22<=1 & 1<=p22] | [p50<=0 & 0<=p50]]] | [[p33<=1 & 1<=p33] | [[0<=p41 & p41<=0] | [0<=p34 & p34<=0]]]]]]]]]

abstracting: (p34<=0)
states: 15,091,923 (7)
abstracting: (0<=p34)
states: 15,866,931 (7)
abstracting: (p41<=0)
states: 13,227,555 (7)
abstracting: (0<=p41)
states: 15,866,931 (7)
abstracting: (1<=p33)
states: 2,382,768 (6)
abstracting: (p33<=1)
states: 15,866,931 (7)
abstracting: (0<=p50)
states: 15,866,931 (7)
abstracting: (p50<=0)
states: 13,603,539 (7)
abstracting: (1<=p22)
states: 2,196,144 (6)
abstracting: (p22<=1)
states: 15,866,931 (7)
abstracting: (1<=p35)
states: 762,048 (5)
abstracting: (p35<=1)
states: 15,866,931 (7)
abstracting: (0<=p61)
states: 15,866,931 (7)
abstracting: (p61<=0)
states: 15,697,587 (7)
abstracting: (p65<=0)
states: 12,036,083 (7)
abstracting: (0<=p65)
states: 15,866,931 (7)
abstracting: (p3<=1)
states: 15,866,931 (7)
abstracting: (1<=p3)
states: 1,995,520 (6)
abstracting: (0<=p24)
states: 15,866,931 (7)
abstracting: (p24<=0)
states: 13,705,635 (7)
abstracting: (p13<=0)
states: 13,234,035 (7)
abstracting: (0<=p13)
states: 15,866,931 (7)
abstracting: (1<=p56)
states: 169,344 (5)
abstracting: (p56<=1)
states: 15,866,931 (7)
abstracting: (p49<=0)
states: 13,603,539 (7)
abstracting: (0<=p49)
states: 15,866,931 (7)
abstracting: (1<=p26)
states: 1,164,672 (6)
abstracting: (p26<=1)
states: 15,866,931 (7)
abstracting: (p58<=1)
states: 15,866,931 (7)
abstracting: (1<=p58)
states: 169,344 (5)
abstracting: (p22<=0)
states: 13,670,787 (7)
abstracting: (0<=p22)
states: 15,866,931 (7)
abstracting: (0<=p47)
states: 15,866,931 (7)
abstracting: (p47<=0)
states: 15,866,930 (7)
-> the formula is FALSE

FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.314sec

totally nodes used: 2074202 (2.1e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 18853357 33868466 52721823
used/not used/entry size/cache size: 27454029 39654835 16 1024MB
basic ops cache: hits/miss/sum: 1168901 2134351 3303252
used/not used/entry size/cache size: 3518402 13258814 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: 33999 74972 108971
used/not used/entry size/cache size: 74729 8313879 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 65239119
1 1692119
2 153612
3 21437
4 2356
5 203
6 17
7 1
8 0
9 0
>= 10 0

Total processing time: 0m14.076sec


BK_STOP 1678700481719

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

10689 9069 9994 9947 12552 13028 12999 12298
iterations count:827632 (2500), effective:13493 (40)

initing FirstDep: 0m 0.000sec

3186
iterations count:152176 (459), effective:3244 (9)

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="AutonomousCar-PT-07b"
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 AutonomousCar-PT-07b, 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 r010-oct2-167813599300638"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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