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-167813600600686.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-10b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-oct2-167813600600686
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.8K Feb 25 12:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 25 12:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 12:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 25 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 12:53 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 1.6M 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-10b-ReachabilityCardinality-00
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-01
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-02
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-03
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-04
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-05
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-06
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-07
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-08
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-09
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-10
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-11
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-12
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-13
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-14
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678742740029

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-10b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 21:25:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 21:25:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 21:25:43] [INFO ] Load time of PNML (sax parser for PT used): 261 ms
[2023-03-13 21:25:43] [INFO ] Transformed 425 places.
[2023-03-13 21:25:43] [INFO ] Transformed 2252 transitions.
[2023-03-13 21:25:43] [INFO ] Found NUPN structural information;
[2023-03-13 21:25:43] [INFO ] Parsed PT model containing 425 places and 2252 transitions and 29816 arcs in 375 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 77 resets, run finished after 426 ms. (steps per millisecond=23 ) properties (out of 14) seen :9
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :1
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2252 rows 425 cols
[2023-03-13 21:25:44] [INFO ] Computed 15 place invariants in 26 ms
[2023-03-13 21:25:44] [INFO ] After 438ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 21:25:44] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-03-13 21:25:46] [INFO ] After 1453ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 21:25:47] [INFO ] Deduced a trap composed of 16 places in 1479 ms of which 28 ms to minimize.
[2023-03-13 21:25:49] [INFO ] Deduced a trap composed of 35 places in 1216 ms of which 2 ms to minimize.
[2023-03-13 21:25:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2967 ms
[2023-03-13 21:25:50] [INFO ] Deduced a trap composed of 35 places in 1005 ms of which 1 ms to minimize.
[2023-03-13 21:25:51] [INFO ] Deduced a trap composed of 50 places in 1178 ms of which 13 ms to minimize.
[2023-03-13 21:25:53] [INFO ] Deduced a trap composed of 51 places in 1170 ms of which 2 ms to minimize.
[2023-03-13 21:25:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 3536 ms
[2023-03-13 21:25:54] [INFO ] Deduced a trap composed of 35 places in 1139 ms of which 3 ms to minimize.
[2023-03-13 21:25:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1352 ms
[2023-03-13 21:25:54] [INFO ] After 9854ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 213 ms.
[2023-03-13 21:25:54] [INFO ] After 10258ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 95 ms.
Support contains 48 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 2252/2252 transitions.
Graph (trivial) has 321 edges and 425 vertex of which 2 / 425 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1996 edges and 424 vertex of which 420 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.19 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 133 rules applied. Total rules applied 135 place count 420 transition count 2114
Reduce places removed 132 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 154 rules applied. Total rules applied 289 place count 288 transition count 2092
Reduce places removed 10 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 2 with 29 rules applied. Total rules applied 318 place count 278 transition count 2073
Reduce places removed 19 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 21 rules applied. Total rules applied 339 place count 259 transition count 2071
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 340 place count 258 transition count 2071
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 16 Pre rules applied. Total rules applied 340 place count 258 transition count 2055
Deduced a syphon composed of 16 places in 4 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 372 place count 242 transition count 2055
Discarding 27 places :
Symmetric choice reduction at 5 with 27 rule applications. Total rules 399 place count 215 transition count 2028
Iterating global reduction 5 with 27 rules applied. Total rules applied 426 place count 215 transition count 2028
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 428 place count 215 transition count 2026
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 428 place count 215 transition count 2025
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 430 place count 214 transition count 2025
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 437 place count 207 transition count 1885
Iterating global reduction 6 with 7 rules applied. Total rules applied 444 place count 207 transition count 1885
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 446 place count 207 transition count 1883
Performed 51 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 51 places in 2 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 7 with 102 rules applied. Total rules applied 548 place count 156 transition count 1831
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 553 place count 151 transition count 1726
Iterating global reduction 7 with 5 rules applied. Total rules applied 558 place count 151 transition count 1726
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 562 place count 149 transition count 1727
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 563 place count 149 transition count 1726
Drop transitions removed 287 transitions
Redundant transition composition rules discarded 287 transitions
Iterating global reduction 8 with 287 rules applied. Total rules applied 850 place count 149 transition count 1439
Free-agglomeration rule applied 17 times.
Iterating global reduction 8 with 17 rules applied. Total rules applied 867 place count 149 transition count 1422
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 884 place count 132 transition count 1422
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 886 place count 132 transition count 1420
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 887 place count 132 transition count 1420
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 888 place count 131 transition count 1419
Applied a total of 888 rules in 891 ms. Remains 131 /425 variables (removed 294) and now considering 1419/2252 (removed 833) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 893 ms. Remains : 131/425 places, 1419/2252 transitions.
Incomplete random walk after 10000 steps, including 271 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 553126 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :{}
Probabilistic random walk after 553126 steps, saw 75702 distinct states, run finished after 3002 ms. (steps per millisecond=184 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1419 rows 131 cols
[2023-03-13 21:25:59] [INFO ] Computed 15 place invariants in 31 ms
[2023-03-13 21:25:59] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 21:25:59] [INFO ] [Nat]Absence check using 15 positive place invariants in 31 ms returned sat
[2023-03-13 21:26:00] [INFO ] After 680ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 21:26:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 21:26:00] [INFO ] After 282ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 21:26:01] [INFO ] Deduced a trap composed of 10 places in 1079 ms of which 1 ms to minimize.
[2023-03-13 21:26:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1213 ms
[2023-03-13 21:26:01] [INFO ] After 1845ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 244 ms.
[2023-03-13 21:26:02] [INFO ] After 2874ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 40 ms.
Support contains 48 out of 131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 1419/1419 transitions.
Applied a total of 0 rules in 106 ms. Remains 131 /131 variables (removed 0) and now considering 1419/1419 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 131/131 places, 1419/1419 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 1419/1419 transitions.
Applied a total of 0 rules in 75 ms. Remains 131 /131 variables (removed 0) and now considering 1419/1419 (removed 0) transitions.
[2023-03-13 21:26:02] [INFO ] Invariant cache hit.
[2023-03-13 21:26:03] [INFO ] Implicit Places using invariants in 1165 ms returned []
[2023-03-13 21:26:03] [INFO ] Invariant cache hit.
[2023-03-13 21:26:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 21:26:04] [INFO ] Implicit Places using invariants and state equation in 1305 ms returned []
Implicit Place search using SMT with State Equation took 2473 ms to find 0 implicit places.
[2023-03-13 21:26:05] [INFO ] Redundant transitions in 118 ms returned []
[2023-03-13 21:26:05] [INFO ] Invariant cache hit.
[2023-03-13 21:26:05] [INFO ] Dead Transitions using invariants and state equation in 719 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3396 ms. Remains : 131/131 places, 1419/1419 transitions.
Applied a total of 0 rules in 69 ms. Remains 131 /131 variables (removed 0) and now considering 1419/1419 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-13 21:26:05] [INFO ] Invariant cache hit.
[2023-03-13 21:26:05] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 21:26:06] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-03-13 21:26:06] [INFO ] After 720ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 21:26:07] [INFO ] Deduced a trap composed of 10 places in 1028 ms of which 1 ms to minimize.
[2023-03-13 21:26:09] [INFO ] Deduced a trap composed of 12 places in 1191 ms of which 1 ms to minimize.
[2023-03-13 21:26:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2375 ms
[2023-03-13 21:26:10] [INFO ] Deduced a trap composed of 10 places in 936 ms of which 1 ms to minimize.
[2023-03-13 21:26:11] [INFO ] Deduced a trap composed of 38 places in 1183 ms of which 0 ms to minimize.
[2023-03-13 21:26:12] [INFO ] Deduced a trap composed of 12 places in 737 ms of which 0 ms to minimize.
[2023-03-13 21:26:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3024 ms
[2023-03-13 21:26:12] [INFO ] After 6428ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 226 ms.
[2023-03-13 21:26:12] [INFO ] After 6760ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-13 21:26:12] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2023-03-13 21:26:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 131 places, 1419 transitions and 25051 arcs took 54 ms.
[2023-03-13 21:26:13] [INFO ] Flatten gal took : 471 ms
Total runtime 30851 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running AutonomousCar (PT), instance 10b
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: 131 places, 1419 transitions, 25051 arcs.
Final Score: 14562.269
Took : 127 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: AutonomousCar-PT-10b-ReachabilityCardinality-02 (reachable &!potential( ( ( ( ( ( (tk(P52)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P52)) ) ) | ( ( (tk(P75)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P75)) ) ) ) | ( ( ( (tk(P18)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P18)) ) ) | ( ( ( (tk(P39)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P39)) ) ) & ( ( (tk(P14)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P14)) ) ) ) ) ) | ( ( ( ( ( ( ( ( (tk(P89)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P89)) ) ) | ( ( ( (tk(P41)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P41)) ) ) | ( ( (tk(P88)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P88)) ) ) ) ) | ( ( ( (tk(P124)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P124)) ) ) | ( ( ( (tk(P45)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P45)) ) ) | ( ( (tk(P67)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P67)) ) ) ) ) ) & ( ( ( ( (tk(P26)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P26)) ) ) | ( ( (tk(P128)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P128)) ) ) ) | ( ( ( (tk(P94)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P94)) ) ) | ( ( ( ( (tk(P2)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2)) ) ) & ( ( (tk(P71)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P71)) ) ) ) | ( ( ( (tk(P109)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P109)) ) ) & ( ( ( (tk(P91)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P91)) ) ) | ( ( (tk(P97)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P97)) ) ) ) ) ) ) ) ) & ( ( ( ( ( (tk(P46)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P46)) ) ) | ( ( (tk(P78)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P78)) ) ) ) | ( ( ( (tk(P83)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P83)) ) ) | ( ( (tk(P38)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P38)) ) ) ) ) & ( ( ( (tk(P117)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P117)) ) ) | ( ( ( (tk(P113)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P113)) ) ) | ( ( (tk(P21)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P21)) ) ) ) ) ) ) | ( ( ( (tk(P49)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P49)) ) ) & ( ( ( (tk(P59)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P59)) ) ) | ( ( (tk(P115)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P115)) ) ) ) ) ) | ( ( ( ( ( (tk(P57)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P57)) ) ) | ( ( ( (tk(P100)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P100)) ) ) & ( ( (tk(P111)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P111)) ) ) ) ) & ( ( ( (tk(P75)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P75)) ) ) | ( ( ( (tk(P25)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P25)) ) ) & ( ( (tk(P121)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P121)) ) ) ) ) ) | ( ( ( (tk(P126)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P126)) ) ) & ( ( ( (tk(P22)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P22)) ) ) | ( ( (tk(P40)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P40)) ) ) ) ) ) ) )))
PROPERTY: AutonomousCar-PT-10b-ReachabilityCardinality-12 (reachable &!potential( ( ( ( (tk(P101)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P101)) ) ) | ( ( (tk(P30)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P30)) ) ) )))
PROPERTY: AutonomousCar-PT-10b-ReachabilityCardinality-14 (reachable &!potential( ( ( ( ( (tk(P9)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P9)) ) ) | ( ( (tk(P16)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P16)) ) ) ) | ( ( ( (tk(P81)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P81)) ) ) | ( ( ( ( (tk(P78)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P78)) ) ) & ( ( (tk(P47)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P47)) ) ) ) | ( ( ( ( (tk(P55)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P55)) ) ) & ( ( (tk(P119)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P119)) ) ) ) & ( ( ( (tk(P1)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1)) ) ) & ( ( ( (tk(P31)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P31)) ) ) | ( ( (tk(P66)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P66)) ) ) ) ) ) ) ) )))

BK_STOP 1678746141687

--------------------
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:
++ 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
++ sed s/.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
/home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//smart.sh: line 116: 589 Killed ${SMART}/smart ${INPUT_SM}

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-10b"
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-10b, 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-167813600600686"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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