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.r011-oct2-167813600500638.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 smartxred
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 r011-oct2-167813600500638
=====================================================================

--------------------
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 1678740655815

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-07b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 20:50:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 20:50:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 20:50:58] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2023-03-13 20:50:58] [INFO ] Transformed 323 places.
[2023-03-13 20:50:58] [INFO ] Transformed 846 transitions.
[2023-03-13 20:50:58] [INFO ] Found NUPN structural information;
[2023-03-13 20:50:58] [INFO ] Parsed PT model containing 323 places and 846 transitions and 5865 arcs in 241 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 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 95 resets, run finished after 410 ms. (steps per millisecond=24 ) properties (out of 15) seen :8
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-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 16 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :1
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :1
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :1
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 846 rows 323 cols
[2023-03-13 20:50:59] [INFO ] Computed 12 place invariants in 16 ms
[2023-03-13 20:50:59] [INFO ] After 356ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 20:51:00] [INFO ] [Nat]Absence check using 12 positive place invariants in 44 ms returned sat
[2023-03-13 20:51:00] [INFO ] After 410ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-03-13 20:51:01] [INFO ] Deduced a trap composed of 42 places in 518 ms of which 8 ms to minimize.
[2023-03-13 20:51:01] [INFO ] Deduced a trap composed of 35 places in 312 ms of which 1 ms to minimize.
[2023-03-13 20:51:01] [INFO ] Deduced a trap composed of 22 places in 315 ms of which 1 ms to minimize.
[2023-03-13 20:51:02] [INFO ] Deduced a trap composed of 46 places in 312 ms of which 1 ms to minimize.
[2023-03-13 20:51:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1654 ms
[2023-03-13 20:51:02] [INFO ] Deduced a trap composed of 12 places in 469 ms of which 2 ms to minimize.
[2023-03-13 20:51:03] [INFO ] Deduced a trap composed of 32 places in 605 ms of which 1 ms to minimize.
[2023-03-13 20:51:03] [INFO ] Deduced a trap composed of 38 places in 266 ms of which 1 ms to minimize.
[2023-03-13 20:51:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1483 ms
[2023-03-13 20:51:03] [INFO ] After 3668ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 176 ms.
[2023-03-13 20:51:04] [INFO ] After 4135ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
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 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 39 ms.
Support contains 21 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 846/846 transitions.
Drop transitions removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 323 transition count 721
Reduce places removed 125 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 1 with 153 rules applied. Total rules applied 278 place count 198 transition count 693
Reduce places removed 15 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 2 with 24 rules applied. Total rules applied 302 place count 183 transition count 684
Reduce places removed 9 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 3 with 11 rules applied. Total rules applied 313 place count 174 transition count 682
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 314 place count 173 transition count 682
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 314 place count 173 transition count 673
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 332 place count 164 transition count 673
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 357 place count 139 transition count 648
Iterating global reduction 5 with 25 rules applied. Total rules applied 382 place count 139 transition count 648
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 197 transitions.
Iterating post reduction 5 with 197 rules applied. Total rules applied 579 place count 139 transition count 451
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 579 place count 139 transition count 449
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 583 place count 137 transition count 449
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 588 place count 132 transition count 414
Iterating global reduction 6 with 5 rules applied. Total rules applied 593 place count 132 transition count 414
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 6 with 4 rules applied. Total rules applied 597 place count 132 transition count 410
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 598 place count 131 transition count 410
Performed 37 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 8 with 74 rules applied. Total rules applied 672 place count 94 transition count 372
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 676 place count 90 transition count 340
Iterating global reduction 8 with 4 rules applied. Total rules applied 680 place count 90 transition count 340
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 8 with 2 rules applied. Total rules applied 682 place count 89 transition count 340
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 684 place count 89 transition count 338
Free-agglomeration rule applied 9 times.
Iterating global reduction 8 with 9 rules applied. Total rules applied 693 place count 89 transition count 329
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 702 place count 80 transition count 329
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 703 place count 80 transition count 328
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 704 place count 80 transition count 328
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 705 place count 79 transition count 327
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 706 place count 78 transition count 327
Applied a total of 706 rules in 225 ms. Remains 78 /323 variables (removed 245) and now considering 327/846 (removed 519) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 226 ms. Remains : 78/323 places, 327/846 transitions.
Incomplete random walk after 10000 steps, including 169 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1055826 steps, run timeout after 3001 ms. (steps per millisecond=351 ) properties seen :{}
Probabilistic random walk after 1055826 steps, saw 155233 distinct states, run finished after 3013 ms. (steps per millisecond=350 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 327 rows 78 cols
[2023-03-13 20:51:07] [INFO ] Computed 11 place invariants in 5 ms
[2023-03-13 20:51:07] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 20:51:07] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 20:51:07] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 20:51:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 20:51:07] [INFO ] After 86ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 20:51:08] [INFO ] Deduced a trap composed of 7 places in 178 ms of which 1 ms to minimize.
[2023-03-13 20:51:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2023-03-13 20:51:08] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 1 ms to minimize.
[2023-03-13 20:51:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2023-03-13 20:51:08] [INFO ] After 551ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 66 ms.
[2023-03-13 20:51:08] [INFO ] After 863ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 14 ms.
Support contains 21 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 327/327 transitions.
Applied a total of 0 rules in 25 ms. Remains 78 /78 variables (removed 0) and now considering 327/327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 78/78 places, 327/327 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 327/327 transitions.
Applied a total of 0 rules in 28 ms. Remains 78 /78 variables (removed 0) and now considering 327/327 (removed 0) transitions.
[2023-03-13 20:51:08] [INFO ] Invariant cache hit.
[2023-03-13 20:51:08] [INFO ] Implicit Places using invariants in 191 ms returned []
[2023-03-13 20:51:08] [INFO ] Invariant cache hit.
[2023-03-13 20:51:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 20:51:09] [INFO ] Implicit Places using invariants and state equation in 312 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 508 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 76/78 places, 326/327 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 325
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 325
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 75 transition count 324
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 324
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 5 place count 74 transition count 324
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 324
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 324
Applied a total of 7 rules in 67 ms. Remains 73 /76 variables (removed 3) and now considering 324/326 (removed 2) transitions.
// Phase 1: matrix 324 rows 73 cols
[2023-03-13 20:51:09] [INFO ] Computed 9 place invariants in 5 ms
[2023-03-13 20:51:09] [INFO ] Implicit Places using invariants in 228 ms returned []
[2023-03-13 20:51:09] [INFO ] Invariant cache hit.
[2023-03-13 20:51:09] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 73/78 places, 324/327 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1056 ms. Remains : 73/78 places, 324/327 transitions.
Incomplete random walk after 10000 steps, including 64 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1150478 steps, run timeout after 3001 ms. (steps per millisecond=383 ) properties seen :{}
Probabilistic random walk after 1150478 steps, saw 165820 distinct states, run finished after 3001 ms. (steps per millisecond=383 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-13 20:51:12] [INFO ] Invariant cache hit.
[2023-03-13 20:51:12] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 20:51:12] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-13 20:51:13] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 20:51:13] [INFO ] Deduced a trap composed of 6 places in 305 ms of which 2 ms to minimize.
[2023-03-13 20:51:13] [INFO ] Deduced a trap composed of 7 places in 209 ms of which 0 ms to minimize.
[2023-03-13 20:51:13] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 1 ms to minimize.
[2023-03-13 20:51:13] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 0 ms to minimize.
[2023-03-13 20:51:14] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 0 ms to minimize.
[2023-03-13 20:51:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1103 ms
[2023-03-13 20:51:14] [INFO ] After 1330ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-13 20:51:14] [INFO ] After 1419ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 ms.
Support contains 21 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 324/324 transitions.
Applied a total of 0 rules in 13 ms. Remains 73 /73 variables (removed 0) and now considering 324/324 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 73/73 places, 324/324 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 324/324 transitions.
Applied a total of 0 rules in 13 ms. Remains 73 /73 variables (removed 0) and now considering 324/324 (removed 0) transitions.
[2023-03-13 20:51:14] [INFO ] Invariant cache hit.
[2023-03-13 20:51:14] [INFO ] Implicit Places using invariants in 166 ms returned []
[2023-03-13 20:51:14] [INFO ] Invariant cache hit.
[2023-03-13 20:51:14] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
[2023-03-13 20:51:14] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-13 20:51:14] [INFO ] Invariant cache hit.
[2023-03-13 20:51:15] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 811 ms. Remains : 73/73 places, 324/324 transitions.
Applied a total of 0 rules in 13 ms. Remains 73 /73 variables (removed 0) and now considering 324/324 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-13 20:51:15] [INFO ] Invariant cache hit.
[2023-03-13 20:51:15] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 20:51:15] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-13 20:51:15] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 20:51:15] [INFO ] Deduced a trap composed of 6 places in 198 ms of which 1 ms to minimize.
[2023-03-13 20:51:15] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 0 ms to minimize.
[2023-03-13 20:51:16] [INFO ] Deduced a trap composed of 7 places in 238 ms of which 0 ms to minimize.
[2023-03-13 20:51:16] [INFO ] Deduced a trap composed of 7 places in 199 ms of which 1 ms to minimize.
[2023-03-13 20:51:16] [INFO ] Deduced a trap composed of 7 places in 198 ms of which 1 ms to minimize.
[2023-03-13 20:51:16] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1096 ms
[2023-03-13 20:51:16] [INFO ] After 1303ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 80 ms.
[2023-03-13 20:51:16] [INFO ] After 1427ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-13 20:51:16] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2023-03-13 20:51:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 73 places, 324 transitions and 2994 arcs took 5 ms.
[2023-03-13 20:51:16] [INFO ] Flatten gal took : 107 ms
Total runtime 18664 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running AutonomousCar (PT), instance 07b
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 73 places, 324 transitions, 2994 arcs.
Final Score: 2479.542
Took : 45 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: AutonomousCar-PT-07b-ReachabilityCardinality-05 (reachable &!potential( ( ( ( ( (tk(P71)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P71)) ) ) & ( ( ( ( (tk(P53)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P53)) ) ) | ( ( ( (tk(P64)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P64)) ) ) & ( ( (tk(P28)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P28)) ) ) ) ) | ( ( ( ( (tk(P15)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P15)) ) ) & ( ( ( (tk(P30)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P30)) ) ) | ( ( (tk(P4)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P4)) ) ) ) ) | ( ( ( (tk(P32)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P32)) ) ) & ( ( ( (tk(P55)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P55)) ) ) | ( ( (tk(P62)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P62)) ) ) ) ) ) ) ) | ( ( ( (tk(P67)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P67)) ) ) & ( ( ( ( (tk(P41)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P41)) ) ) | ( ( ( (tk(P56)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P56)) ) ) | ( ( (tk(P28)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P28)) ) ) ) ) | ( ( ( (tk(P39)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P39)) ) ) | ( ( ( (tk(P40)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P40)) ) ) | ( ( (tk(P47)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P47)) ) ) ) ) ) ) )))
PROPERTY: AutonomousCar-PT-07b-ReachabilityCardinality-14 (reachable &!potential( ( ( ( ( (tk(P34)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P34)) ) ) | ( ( ( (tk(P23)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P23)) ) ) | ( ( (tk(P73)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P73)) ) ) ) ) | ( ( ( (tk(P20)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P20)) ) ) | ( ( ( (tk(P22)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P22)) ) ) | ( ( (tk(P28)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P28)) ) ) ) ) )))
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1678740723650

--------------------
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

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="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 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 r011-oct2-167813600500638"
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 ;