About the Execution of Smart+red for AutonomousCar-PT-08a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
847.188 | 116493.00 | 138991.00 | 43.30 | FFFTFTTFFTFFFTTF | normal |
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-167813600500646.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-08a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-oct2-167813600500646
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 5.2K Feb 25 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Feb 25 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 12:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 12:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 17K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 12:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 25 12:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 12:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 12:55 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 448K 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-08a-ReachabilityCardinality-00
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-01
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-02
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-03
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-04
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-05
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-06
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-07
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-08
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-09
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-10
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-11
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-12
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-13
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-14
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1678740743886
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-08a
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 20:52:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 20:52:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 20:52:26] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2023-03-13 20:52:26] [INFO ] Transformed 81 places.
[2023-03-13 20:52:26] [INFO ] Transformed 849 transitions.
[2023-03-13 20:52:26] [INFO ] Found NUPN structural information;
[2023-03-13 20:52:26] [INFO ] Parsed PT model containing 81 places and 849 transitions and 8894 arcs in 253 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 275 transitions
Reduce redundant transitions removed 275 transitions.
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 540 resets, run finished after 493 ms. (steps per millisecond=20 ) properties (out of 9) seen :4
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-13 20:52:27] [INFO ] Flow matrix only has 573 transitions (discarded 1 similar events)
// Phase 1: matrix 573 rows 81 cols
[2023-03-13 20:52:27] [INFO ] Computed 13 place invariants in 13 ms
[2023-03-13 20:52:27] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-13 20:52:27] [INFO ] After 361ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 20:52:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 20:52:28] [INFO ] After 540ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 20:52:28] [INFO ] State equation strengthened by 259 read => feed constraints.
[2023-03-13 20:52:28] [INFO ] After 222ms SMT Verify possible using 259 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-13 20:52:28] [INFO ] After 634ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 308 ms.
[2023-03-13 20:52:29] [INFO ] After 1595ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 127 ms.
Support contains 22 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 574/574 transitions.
Graph (complete) has 853 edges and 81 vertex of which 80 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 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 4 rules applied. Total rules applied 5 place count 80 transition count 569
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 77 transition count 569
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 12 place count 73 transition count 533
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 73 transition count 533
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 71 transition count 531
Free-agglomeration rule applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 27 place count 71 transition count 524
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 50 place count 64 transition count 508
Applied a total of 50 rules in 159 ms. Remains 64 /81 variables (removed 17) and now considering 508/574 (removed 66) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 64/81 places, 508/574 transitions.
Incomplete random walk after 10000 steps, including 533 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 5) seen :4
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 508 rows 64 cols
[2023-03-13 20:52:29] [INFO ] Computed 12 place invariants in 5 ms
[2023-03-13 20:52:29] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-13 20:52:29] [INFO ] After 246ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 20:52:29] [INFO ] [Nat]Absence check using 12 positive place invariants in 15 ms returned sat
[2023-03-13 20:52:30] [INFO ] After 168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 20:52:30] [INFO ] State equation strengthened by 210 read => feed constraints.
[2023-03-13 20:52:30] [INFO ] After 73ms SMT Verify possible using 210 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 20:52:30] [INFO ] After 114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-13 20:52:30] [INFO ] After 392ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 508/508 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 64 transition count 506
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 63 transition count 506
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 63 transition count 505
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 5 place count 62 transition count 505
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 8 place count 59 transition count 478
Iterating global reduction 2 with 3 rules applied. Total rules applied 11 place count 59 transition count 478
Free-agglomeration rule applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 16 place count 59 transition count 473
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 2 with 45 rules applied. Total rules applied 61 place count 54 transition count 433
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 54 transition count 433
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 63 place count 53 transition count 432
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 64 place count 52 transition count 432
Applied a total of 64 rules in 191 ms. Remains 52 /64 variables (removed 12) and now considering 432/508 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 52/64 places, 432/508 transitions.
Incomplete random walk after 10000 steps, including 96 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 66 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1696761 steps, run timeout after 3001 ms. (steps per millisecond=565 ) properties seen :{}
Probabilistic random walk after 1696761 steps, saw 215588 distinct states, run finished after 3005 ms. (steps per millisecond=564 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 432 rows 52 cols
[2023-03-13 20:52:33] [INFO ] Computed 12 place invariants in 4 ms
[2023-03-13 20:52:33] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-13 20:52:33] [INFO ] After 294ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 20:52:33] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-13 20:52:34] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 20:52:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 20:52:34] [INFO ] After 18ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 20:52:34] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-13 20:52:34] [INFO ] After 356ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 432/432 transitions.
Applied a total of 0 rules in 21 ms. Remains 52 /52 variables (removed 0) and now considering 432/432 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 52/52 places, 432/432 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 432/432 transitions.
Applied a total of 0 rules in 21 ms. Remains 52 /52 variables (removed 0) and now considering 432/432 (removed 0) transitions.
[2023-03-13 20:52:34] [INFO ] Invariant cache hit.
[2023-03-13 20:52:34] [INFO ] Implicit Places using invariants in 278 ms returned []
[2023-03-13 20:52:34] [INFO ] Invariant cache hit.
[2023-03-13 20:52:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 20:52:34] [INFO ] Implicit Places using invariants and state equation in 453 ms returned [47, 50]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 739 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 50/52 places, 432/432 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 49 transition count 431
Applied a total of 2 rules in 41 ms. Remains 49 /50 variables (removed 1) and now considering 431/432 (removed 1) transitions.
// Phase 1: matrix 431 rows 49 cols
[2023-03-13 20:52:34] [INFO ] Computed 10 place invariants in 6 ms
[2023-03-13 20:52:35] [INFO ] Implicit Places using invariants in 357 ms returned []
[2023-03-13 20:52:35] [INFO ] Invariant cache hit.
[2023-03-13 20:52:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 20:52:35] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 856 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 49/52 places, 431/432 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1658 ms. Remains : 49/52 places, 431/432 transitions.
Incomplete random walk after 10000 steps, including 110 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1921400 steps, run timeout after 3001 ms. (steps per millisecond=640 ) properties seen :{}
Probabilistic random walk after 1921400 steps, saw 238742 distinct states, run finished after 3001 ms. (steps per millisecond=640 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-13 20:52:38] [INFO ] Invariant cache hit.
[2023-03-13 20:52:38] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-13 20:52:39] [INFO ] After 243ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 20:52:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-13 20:52:39] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 20:52:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 20:52:39] [INFO ] After 34ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 20:52:39] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-13 20:52:39] [INFO ] After 383ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 431/431 transitions.
Applied a total of 0 rules in 34 ms. Remains 49 /49 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 49/49 places, 431/431 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 431/431 transitions.
Applied a total of 0 rules in 22 ms. Remains 49 /49 variables (removed 0) and now considering 431/431 (removed 0) transitions.
[2023-03-13 20:52:39] [INFO ] Invariant cache hit.
[2023-03-13 20:52:39] [INFO ] Implicit Places using invariants in 361 ms returned []
[2023-03-13 20:52:39] [INFO ] Invariant cache hit.
[2023-03-13 20:52:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 20:52:40] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 801 ms to find 0 implicit places.
[2023-03-13 20:52:40] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-13 20:52:40] [INFO ] Invariant cache hit.
[2023-03-13 20:52:40] [INFO ] Dead Transitions using invariants and state equation in 303 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1181 ms. Remains : 49/49 places, 431/431 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 49 transition count 430
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 49 transition count 429
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 48 transition count 429
Applied a total of 3 rules in 20 ms. Remains 48 /49 variables (removed 1) and now considering 429/431 (removed 2) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 429 rows 48 cols
[2023-03-13 20:52:40] [INFO ] Computed 11 place invariants in 4 ms
[2023-03-13 20:52:40] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 20:52:40] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 20:52:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-13 20:52:41] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 20:52:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 20:52:41] [INFO ] After 21ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 20:52:41] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-13 20:52:41] [INFO ] After 268ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-13 20:52:41] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2023-03-13 20:52:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 49 places, 431 transitions and 5543 arcs took 11 ms.
[2023-03-13 20:52:41] [INFO ] Flatten gal took : 158 ms
Total runtime 15612 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running AutonomousCar (PT), instance 08a
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: 49 places, 431 transitions, 5543 arcs.
Final Score: 2701.173
Took : 86 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: AutonomousCar-PT-08a-ReachabilityCardinality-03 (reachable & potential(( ( ( (tk(P27)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P27)) ) ) & ( ( ( (tk(P47)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P47)) ) ) & ( ( (tk(P24)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P24)) ) ) ) )))
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
BK_STOP 1678740860379
--------------------
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-08a"
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-08a, 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-167813600500646"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-08a.tgz
mv AutonomousCar-PT-08a 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 '
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 ;