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.r267-smll-167863541800439.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 smartxred
Input is Parking-PT-432, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-167863541800439
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 8.1K Feb 26 15:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 26 15:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 26 15:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 26 15:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 15:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 15:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 15:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 26 15:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 192K Mar 5 18:23 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 Parking-PT-432-ReachabilityFireability-00
FORMULA_NAME Parking-PT-432-ReachabilityFireability-01
FORMULA_NAME Parking-PT-432-ReachabilityFireability-02
FORMULA_NAME Parking-PT-432-ReachabilityFireability-03
FORMULA_NAME Parking-PT-432-ReachabilityFireability-04
FORMULA_NAME Parking-PT-432-ReachabilityFireability-05
FORMULA_NAME Parking-PT-432-ReachabilityFireability-06
FORMULA_NAME Parking-PT-432-ReachabilityFireability-07
FORMULA_NAME Parking-PT-432-ReachabilityFireability-08
FORMULA_NAME Parking-PT-432-ReachabilityFireability-09
FORMULA_NAME Parking-PT-432-ReachabilityFireability-10
FORMULA_NAME Parking-PT-432-ReachabilityFireability-11
FORMULA_NAME Parking-PT-432-ReachabilityFireability-12
FORMULA_NAME Parking-PT-432-ReachabilityFireability-13
FORMULA_NAME Parking-PT-432-ReachabilityFireability-14
FORMULA_NAME Parking-PT-432-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678875258043

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=smartxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-432
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-15 10:14:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 10:14:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 10:14:22] [INFO ] Load time of PNML (sax parser for PT used): 210 ms
[2023-03-15 10:14:22] [INFO ] Transformed 529 places.
[2023-03-15 10:14:22] [INFO ] Transformed 785 transitions.
[2023-03-15 10:14:22] [INFO ] Found NUPN structural information;
[2023-03-15 10:14:22] [INFO ] Parsed PT model containing 529 places and 785 transitions and 2329 arcs in 393 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 328 transitions
Reduce redundant transitions removed 328 transitions.
Incomplete random walk after 10000 steps, including 89 resets, run finished after 839 ms. (steps per millisecond=11 ) properties (out of 16) seen :10
FORMULA Parking-PT-432-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-432-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 457 rows 529 cols
[2023-03-15 10:14:23] [INFO ] Computed 124 place invariants in 40 ms
[2023-03-15 10:14:24] [INFO ] [Real]Absence check using 120 positive place invariants in 62 ms returned sat
[2023-03-15 10:14:24] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-15 10:14:24] [INFO ] After 854ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-15 10:14:25] [INFO ] [Nat]Absence check using 120 positive place invariants in 50 ms returned sat
[2023-03-15 10:14:25] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 10 ms returned sat
[2023-03-15 10:14:26] [INFO ] After 1101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-15 10:14:26] [INFO ] State equation strengthened by 108 read => feed constraints.
[2023-03-15 10:14:27] [INFO ] After 1143ms SMT Verify possible using 108 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-15 10:14:28] [INFO ] Deduced a trap composed of 67 places in 134 ms of which 14 ms to minimize.
[2023-03-15 10:14:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2023-03-15 10:14:29] [INFO ] Deduced a trap composed of 60 places in 114 ms of which 2 ms to minimize.
[2023-03-15 10:14:29] [INFO ] Deduced a trap composed of 52 places in 102 ms of which 2 ms to minimize.
[2023-03-15 10:14:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 325 ms
[2023-03-15 10:14:29] [INFO ] After 3286ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1045 ms.
[2023-03-15 10:14:30] [INFO ] After 6099ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 138 ms.
Support contains 137 out of 529 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 529/529 places, 457/457 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 529 transition count 454
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 8 place count 526 transition count 452
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 524 transition count 452
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 10 place count 524 transition count 448
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 18 place count 520 transition count 448
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 20 place count 518 transition count 446
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 518 transition count 446
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 36 place count 511 transition count 439
Free-agglomeration rule applied 32 times.
Iterating global reduction 3 with 32 rules applied. Total rules applied 68 place count 511 transition count 407
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 100 place count 479 transition count 407
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 101 place count 479 transition count 406
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 104 place count 479 transition count 406
Applied a total of 104 rules in 365 ms. Remains 479 /529 variables (removed 50) and now considering 406/457 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 366 ms. Remains : 479/529 places, 406/457 transitions.
Incomplete random walk after 10000 steps, including 125 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 294870 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :{0=1}
Probabilistic random walk after 294870 steps, saw 48659 distinct states, run finished after 3002 ms. (steps per millisecond=98 ) properties seen :1
FORMULA Parking-PT-432-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 5 properties.
// Phase 1: matrix 406 rows 479 cols
[2023-03-15 10:14:35] [INFO ] Computed 124 place invariants in 10 ms
[2023-03-15 10:14:35] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-15 10:14:35] [INFO ] [Nat]Absence check using 120 positive place invariants in 38 ms returned sat
[2023-03-15 10:14:35] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-15 10:14:36] [INFO ] After 773ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-15 10:14:36] [INFO ] State equation strengthened by 141 read => feed constraints.
[2023-03-15 10:14:37] [INFO ] After 784ms SMT Verify possible using 141 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-15 10:14:37] [INFO ] Deduced a trap composed of 52 places in 73 ms of which 2 ms to minimize.
[2023-03-15 10:14:37] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 1 ms to minimize.
[2023-03-15 10:14:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 293 ms
[2023-03-15 10:14:38] [INFO ] After 2422ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 652 ms.
[2023-03-15 10:14:39] [INFO ] After 4117ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
FORMULA Parking-PT-432-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 75 ms.
Support contains 115 out of 479 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 479/479 places, 406/406 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 479 transition count 405
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 478 transition count 405
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4 place count 476 transition count 403
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 476 transition count 403
Free-agglomeration rule applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 16 place count 476 transition count 393
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 26 place count 466 transition count 393
Applied a total of 26 rules in 138 ms. Remains 466 /479 variables (removed 13) and now considering 393/406 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 466/479 places, 393/406 transitions.
Incomplete random walk after 10000 steps, including 145 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 329336 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :{}
Probabilistic random walk after 329336 steps, saw 51655 distinct states, run finished after 3002 ms. (steps per millisecond=109 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 393 rows 466 cols
[2023-03-15 10:14:43] [INFO ] Computed 124 place invariants in 13 ms
[2023-03-15 10:14:43] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-15 10:14:43] [INFO ] [Nat]Absence check using 120 positive place invariants in 52 ms returned sat
[2023-03-15 10:14:43] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-15 10:14:44] [INFO ] After 870ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-15 10:14:44] [INFO ] State equation strengthened by 151 read => feed constraints.
[2023-03-15 10:14:45] [INFO ] After 772ms SMT Verify possible using 151 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-15 10:14:46] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 1 ms to minimize.
[2023-03-15 10:14:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2023-03-15 10:14:46] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 1 ms to minimize.
[2023-03-15 10:14:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2023-03-15 10:14:46] [INFO ] After 1654ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 685 ms.
[2023-03-15 10:14:47] [INFO ] After 3539ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA Parking-PT-432-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 15 ms.
Support contains 101 out of 466 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 466/466 places, 393/393 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 466 transition count 392
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 465 transition count 392
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 465 transition count 391
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 464 transition count 391
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 464 transition count 385
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 16 place count 458 transition count 385
Applied a total of 16 rules in 48 ms. Remains 458 /466 variables (removed 8) and now considering 385/393 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 458/466 places, 385/393 transitions.
Incomplete random walk after 10000 steps, including 159 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 321778 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{1=1}
Probabilistic random walk after 321778 steps, saw 52660 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :1
FORMULA Parking-PT-432-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 385 rows 458 cols
[2023-03-15 10:14:50] [INFO ] Computed 124 place invariants in 4 ms
[2023-03-15 10:14:50] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 10:14:50] [INFO ] [Nat]Absence check using 120 positive place invariants in 47 ms returned sat
[2023-03-15 10:14:50] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-15 10:14:51] [INFO ] After 518ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 10:14:51] [INFO ] State equation strengthened by 157 read => feed constraints.
[2023-03-15 10:14:51] [INFO ] After 337ms SMT Verify possible using 157 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 10:14:52] [INFO ] After 769ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 411 ms.
[2023-03-15 10:14:52] [INFO ] After 1928ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 17 ms.
Support contains 64 out of 458 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 385/385 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 458 transition count 382
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 455 transition count 382
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 452 transition count 379
Free-agglomeration rule applied 11 times.
Iterating global reduction 0 with 11 rules applied. Total rules applied 23 place count 452 transition count 368
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 34 place count 441 transition count 368
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 441 transition count 368
Applied a total of 35 rules in 109 ms. Remains 441 /458 variables (removed 17) and now considering 368/385 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 441/458 places, 368/385 transitions.
Incomplete random walk after 10000 steps, including 88 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 318410 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :{}
Probabilistic random walk after 318410 steps, saw 58140 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 368 rows 441 cols
[2023-03-15 10:14:56] [INFO ] Computed 124 place invariants in 4 ms
[2023-03-15 10:14:56] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 10:14:56] [INFO ] [Nat]Absence check using 120 positive place invariants in 35 ms returned sat
[2023-03-15 10:14:56] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-15 10:14:56] [INFO ] After 434ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 10:14:56] [INFO ] State equation strengthened by 208 read => feed constraints.
[2023-03-15 10:14:57] [INFO ] After 278ms SMT Verify possible using 208 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 10:14:57] [INFO ] After 506ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 151 ms.
[2023-03-15 10:14:57] [INFO ] After 1253ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA Parking-PT-432-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 4 ms.
Support contains 13 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 368/368 transitions.
Graph (complete) has 933 edges and 441 vertex of which 228 are kept as prefixes of interest. Removing 213 places using SCC suffix rule.3 ms
Discarding 213 places :
Also discarding 173 output transitions
Drop transitions removed 173 transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 228 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 13 place count 226 transition count 185
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 13 place count 226 transition count 182
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 19 place count 223 transition count 182
Free-agglomeration rule applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 29 place count 223 transition count 172
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 39 place count 213 transition count 172
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 41 place count 213 transition count 170
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 43 place count 213 transition count 170
Applied a total of 43 rules in 65 ms. Remains 213 /441 variables (removed 228) and now considering 170/368 (removed 198) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 213/441 places, 170/368 transitions.
Incomplete random walk after 10000 steps, including 185 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Finished Best-First random walk after 7406 steps, including 25 resets, run visited all 1 properties in 24 ms. (steps per millisecond=308 )
FORMULA Parking-PT-432-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 35892 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running Parking (PT), instance 432
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 529 places, 785 transitions, 2329 arcs.
Final Score: 31937.285
Took : 29 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 2092396 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16105080 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
Caught signal 15, terminating.

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="Parking-PT-432"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is Parking-PT-432, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r267-smll-167863541800439"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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