fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r009-oct2-167813598200639
Last Updated
May 14, 2023

About the Execution of LTSMin+red for AutonomousCar-PT-07b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
952.695 273372.00 943490.00 70.60 TFFTTTTTFFTTTTFT 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.r009-oct2-167813598200639.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 ltsminxred
Input is AutonomousCar-PT-07b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813598200639
=====================================================================

--------------------
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-ReachabilityFireability-00
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityFireability-01
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityFireability-02
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityFireability-03
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityFireability-04
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityFireability-05
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityFireability-06
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityFireability-07
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityFireability-08
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityFireability-09
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityFireability-10
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityFireability-11
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityFireability-12
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityFireability-13
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityFireability-14
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678638862058

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=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-07b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:34:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 16:34:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:34:25] [INFO ] Load time of PNML (sax parser for PT used): 145 ms
[2023-03-12 16:34:25] [INFO ] Transformed 323 places.
[2023-03-12 16:34:25] [INFO ] Transformed 846 transitions.
[2023-03-12 16:34:25] [INFO ] Found NUPN structural information;
[2023-03-12 16:34:25] [INFO ] Parsed PT model containing 323 places and 846 transitions and 5865 arcs in 290 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 96 resets, run finished after 497 ms. (steps per millisecond=20 ) properties (out of 16) seen :3
FORMULA AutonomousCar-PT-07b-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 846 rows 323 cols
[2023-03-12 16:34:26] [INFO ] Computed 12 place invariants in 26 ms
[2023-03-12 16:34:28] [INFO ] After 656ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-12 16:34:28] [INFO ] [Nat]Absence check using 12 positive place invariants in 11 ms returned sat
[2023-03-12 16:34:31] [INFO ] After 2363ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :10
[2023-03-12 16:34:31] [INFO ] Deduced a trap composed of 35 places in 467 ms of which 33 ms to minimize.
[2023-03-12 16:34:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 588 ms
[2023-03-12 16:34:32] [INFO ] Deduced a trap composed of 7 places in 409 ms of which 1 ms to minimize.
[2023-03-12 16:34:32] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
[2023-03-12 16:34:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 581 ms
[2023-03-12 16:34:33] [INFO ] Deduced a trap composed of 35 places in 392 ms of which 1 ms to minimize.
[2023-03-12 16:34:34] [INFO ] Deduced a trap composed of 35 places in 291 ms of which 1 ms to minimize.
[2023-03-12 16:34:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 800 ms
[2023-03-12 16:34:35] [INFO ] After 6768ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :10
Attempting to minimize the solution found.
Minimization took 2182 ms.
[2023-03-12 16:34:37] [INFO ] After 9334ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :10
FORMULA AutonomousCar-PT-07b-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-07b-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-07b-ReachabilityFireability-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 225 ms.
Support contains 89 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 846/846 transitions.
Graph (trivial) has 163 edges and 323 vertex of which 2 / 323 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 1183 edges and 322 vertex of which 319 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 73 rules applied. Total rules applied 75 place count 319 transition count 769
Reduce places removed 72 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 83 rules applied. Total rules applied 158 place count 247 transition count 758
Reduce places removed 5 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 2 with 20 rules applied. Total rules applied 178 place count 242 transition count 743
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 18 rules applied. Total rules applied 196 place count 227 transition count 740
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 197 place count 226 transition count 740
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 25 Pre rules applied. Total rules applied 197 place count 226 transition count 715
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 247 place count 201 transition count 715
Discarding 22 places :
Symmetric choice reduction at 5 with 22 rule applications. Total rules 269 place count 179 transition count 693
Iterating global reduction 5 with 22 rules applied. Total rules applied 291 place count 179 transition count 693
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 294 place count 179 transition count 690
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 294 place count 179 transition count 688
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 298 place count 177 transition count 688
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 299 place count 176 transition count 687
Iterating global reduction 6 with 1 rules applied. Total rules applied 300 place count 176 transition count 687
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 334 place count 159 transition count 670
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 338 place count 159 transition count 666
Free-agglomeration rule applied 11 times.
Iterating global reduction 6 with 11 rules applied. Total rules applied 349 place count 159 transition count 655
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 360 place count 148 transition count 655
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 361 place count 148 transition count 654
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 362 place count 148 transition count 654
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 363 place count 147 transition count 653
Applied a total of 363 rules in 361 ms. Remains 147 /323 variables (removed 176) and now considering 653/846 (removed 193) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 361 ms. Remains : 147/323 places, 653/846 transitions.
Incomplete random walk after 10000 steps, including 204 resets, run finished after 416 ms. (steps per millisecond=24 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :1
FORMULA AutonomousCar-PT-07b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 653 rows 147 cols
[2023-03-12 16:34:39] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-12 16:34:39] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-12 16:34:39] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-12 16:34:42] [INFO ] After 1979ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-12 16:34:42] [INFO ] Deduced a trap composed of 14 places in 205 ms of which 0 ms to minimize.
[2023-03-12 16:34:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
[2023-03-12 16:34:42] [INFO ] Deduced a trap composed of 10 places in 234 ms of which 1 ms to minimize.
[2023-03-12 16:34:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 282 ms
[2023-03-12 16:34:43] [INFO ] Deduced a trap composed of 17 places in 311 ms of which 1 ms to minimize.
[2023-03-12 16:34:44] [INFO ] Deduced a trap composed of 15 places in 218 ms of which 1 ms to minimize.
[2023-03-12 16:34:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 638 ms
[2023-03-12 16:34:44] [INFO ] Deduced a trap composed of 13 places in 284 ms of which 1 ms to minimize.
[2023-03-12 16:34:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 334 ms
[2023-03-12 16:34:45] [INFO ] After 5261ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 1950 ms.
[2023-03-12 16:34:47] [INFO ] After 7393ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 180 ms.
Support contains 89 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 653/653 transitions.
Applied a total of 0 rules in 16 ms. Remains 147 /147 variables (removed 0) and now considering 653/653 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 147/147 places, 653/653 transitions.
Incomplete random walk after 10000 steps, including 198 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :1
FORMULA AutonomousCar-PT-07b-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-12 16:34:48] [INFO ] Invariant cache hit.
[2023-03-12 16:34:48] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-12 16:34:48] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-12 16:34:50] [INFO ] After 1642ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-12 16:34:51] [INFO ] Deduced a trap composed of 12 places in 177 ms of which 0 ms to minimize.
[2023-03-12 16:34:51] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 1 ms to minimize.
[2023-03-12 16:34:51] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 0 ms to minimize.
[2023-03-12 16:34:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 638 ms
[2023-03-12 16:34:52] [INFO ] Deduced a trap composed of 13 places in 376 ms of which 0 ms to minimize.
[2023-03-12 16:34:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 434 ms
[2023-03-12 16:34:52] [INFO ] After 4265ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1531 ms.
[2023-03-12 16:34:54] [INFO ] After 5952ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 117 ms.
Support contains 83 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 653/653 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 147 transition count 651
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 145 transition count 651
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 145 transition count 650
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 144 transition count 650
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 142 transition count 648
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 142 transition count 648
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 139 transition count 645
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 139 transition count 645
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 138 transition count 644
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 138 transition count 644
Applied a total of 19 rules in 64 ms. Remains 138 /147 variables (removed 9) and now considering 644/653 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 138/147 places, 644/653 transitions.
Incomplete random walk after 10000 steps, including 218 resets, run finished after 326 ms. (steps per millisecond=30 ) properties (out of 8) seen :1
FORMULA AutonomousCar-PT-07b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 644 rows 138 cols
[2023-03-12 16:34:55] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-12 16:34:55] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 16:34:55] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2023-03-12 16:34:57] [INFO ] After 1218ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-12 16:34:58] [INFO ] Deduced a trap composed of 12 places in 351 ms of which 1 ms to minimize.
[2023-03-12 16:34:58] [INFO ] Deduced a trap composed of 17 places in 235 ms of which 0 ms to minimize.
[2023-03-12 16:34:58] [INFO ] Deduced a trap composed of 16 places in 223 ms of which 0 ms to minimize.
[2023-03-12 16:34:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 925 ms
[2023-03-12 16:34:59] [INFO ] Deduced a trap composed of 13 places in 258 ms of which 1 ms to minimize.
[2023-03-12 16:34:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 321 ms
[2023-03-12 16:34:59] [INFO ] After 3699ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 992 ms.
[2023-03-12 16:35:00] [INFO ] After 4877ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 62 ms.
Support contains 67 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 644/644 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 138 transition count 635
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 129 transition count 634
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 21 place count 128 transition count 633
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 21 place count 128 transition count 631
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 25 place count 126 transition count 631
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 28 place count 123 transition count 628
Iterating global reduction 3 with 3 rules applied. Total rules applied 31 place count 123 transition count 628
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 3 with 196 rules applied. Total rules applied 227 place count 123 transition count 432
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 233 place count 120 transition count 429
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 234 place count 120 transition count 428
Free-agglomeration rule applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 241 place count 120 transition count 421
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 248 place count 113 transition count 421
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 251 place count 113 transition count 421
Applied a total of 251 rules in 67 ms. Remains 113 /138 variables (removed 25) and now considering 421/644 (removed 223) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 113/138 places, 421/644 transitions.
Incomplete random walk after 10000 steps, including 277 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 35 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 561875 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :{}
Probabilistic random walk after 561875 steps, saw 79191 distinct states, run finished after 3003 ms. (steps per millisecond=187 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 421 rows 113 cols
[2023-03-12 16:35:04] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-12 16:35:04] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 16:35:04] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-12 16:35:05] [INFO ] After 781ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-12 16:35:05] [INFO ] Deduced a trap composed of 15 places in 233 ms of which 0 ms to minimize.
[2023-03-12 16:35:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 278 ms
[2023-03-12 16:35:06] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 1 ms to minimize.
[2023-03-12 16:35:06] [INFO ] Deduced a trap composed of 7 places in 359 ms of which 0 ms to minimize.
[2023-03-12 16:35:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 625 ms
[2023-03-12 16:35:06] [INFO ] After 2511ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 676 ms.
[2023-03-12 16:35:07] [INFO ] After 3301ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 80 ms.
Support contains 67 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 421/421 transitions.
Applied a total of 0 rules in 14 ms. Remains 113 /113 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 113/113 places, 421/421 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 421/421 transitions.
Applied a total of 0 rules in 10 ms. Remains 113 /113 variables (removed 0) and now considering 421/421 (removed 0) transitions.
[2023-03-12 16:35:07] [INFO ] Invariant cache hit.
[2023-03-12 16:35:07] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-12 16:35:07] [INFO ] Invariant cache hit.
[2023-03-12 16:35:08] [INFO ] Implicit Places using invariants and state equation in 289 ms returned [109]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 441 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 112/113 places, 421/421 transitions.
Applied a total of 0 rules in 14 ms. Remains 112 /112 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 466 ms. Remains : 112/113 places, 421/421 transitions.
Incomplete random walk after 10000 steps, including 196 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :1
FORMULA AutonomousCar-PT-07b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 421 rows 112 cols
[2023-03-12 16:35:08] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-12 16:35:09] [INFO ] After 258ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 16:35:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-12 16:35:09] [INFO ] After 742ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 16:35:10] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 1 ms to minimize.
[2023-03-12 16:35:10] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 1 ms to minimize.
[2023-03-12 16:35:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 415 ms
[2023-03-12 16:35:11] [INFO ] Deduced a trap composed of 11 places in 217 ms of which 1 ms to minimize.
[2023-03-12 16:35:11] [INFO ] Deduced a trap composed of 7 places in 451 ms of which 0 ms to minimize.
[2023-03-12 16:35:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 723 ms
[2023-03-12 16:35:11] [INFO ] After 2649ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 827 ms.
[2023-03-12 16:35:12] [INFO ] After 3653ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 80 ms.
Support contains 66 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 421/421 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 112 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 111 transition count 420
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 111 transition count 420
Applied a total of 3 rules in 29 ms. Remains 111 /112 variables (removed 1) and now considering 420/421 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 111/112 places, 420/421 transitions.
Incomplete random walk after 10000 steps, including 279 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 678735 steps, run timeout after 3001 ms. (steps per millisecond=226 ) properties seen :{}
Probabilistic random walk after 678735 steps, saw 98313 distinct states, run finished after 3001 ms. (steps per millisecond=226 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 420 rows 111 cols
[2023-03-12 16:35:16] [INFO ] Computed 11 place invariants in 15 ms
[2023-03-12 16:35:16] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 16:35:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-12 16:35:17] [INFO ] After 668ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 16:35:17] [INFO ] Deduced a trap composed of 9 places in 196 ms of which 1 ms to minimize.
[2023-03-12 16:35:18] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 0 ms to minimize.
[2023-03-12 16:35:18] [INFO ] Deduced a trap composed of 14 places in 217 ms of which 2 ms to minimize.
[2023-03-12 16:35:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 667 ms
[2023-03-12 16:35:18] [INFO ] After 2011ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 593 ms.
[2023-03-12 16:35:19] [INFO ] After 2685ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 66 ms.
Support contains 66 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 420/420 transitions.
Applied a total of 0 rules in 10 ms. Remains 111 /111 variables (removed 0) and now considering 420/420 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 111/111 places, 420/420 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 420/420 transitions.
Applied a total of 0 rules in 11 ms. Remains 111 /111 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2023-03-12 16:35:19] [INFO ] Invariant cache hit.
[2023-03-12 16:35:19] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-03-12 16:35:19] [INFO ] Invariant cache hit.
[2023-03-12 16:35:19] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
[2023-03-12 16:35:19] [INFO ] Redundant transitions in 54 ms returned []
[2023-03-12 16:35:19] [INFO ] Invariant cache hit.
[2023-03-12 16:35:20] [INFO ] Dead Transitions using invariants and state equation in 445 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 955 ms. Remains : 111/111 places, 420/420 transitions.
Applied a total of 0 rules in 9 ms. Remains 111 /111 variables (removed 0) and now considering 420/420 (removed 0) transitions.
Running SMT prover for 6 properties.
[2023-03-12 16:35:20] [INFO ] Invariant cache hit.
[2023-03-12 16:35:20] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 16:35:20] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-03-12 16:35:21] [INFO ] After 837ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 16:35:22] [INFO ] Deduced a trap composed of 9 places in 216 ms of which 1 ms to minimize.
[2023-03-12 16:35:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 275 ms
[2023-03-12 16:35:22] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 1 ms to minimize.
[2023-03-12 16:35:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2023-03-12 16:35:22] [INFO ] After 2059ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 575 ms.
[2023-03-12 16:35:23] [INFO ] After 2918ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-03-12 16:35:23] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 17 ms.
[2023-03-12 16:35:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 111 places, 420 transitions and 3829 arcs took 16 ms.
[2023-03-12 16:35:23] [INFO ] Flatten gal took : 128 ms
Total runtime 59178 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/648/inv_0_ --invariant=/tmp/648/inv_1_ --invariant=/tmp/648/inv_2_ --invariant=/tmp/648/inv_3_ --invariant=/tmp/648/inv_4_ --invariant=/tmp/648/inv_5_ --inv-par
FORMULA AutonomousCar-PT-07b-ReachabilityFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-07b-ReachabilityFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-07b-ReachabilityFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-07b-ReachabilityFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-07b-ReachabilityFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-07b-ReachabilityFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678639135430

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023
rfs formula name AutonomousCar-PT-07b-ReachabilityFireability-04
rfs formula type EF
rfs formula formula --invariant=/tmp/648/inv_0_
rfs formula name AutonomousCar-PT-07b-ReachabilityFireability-05
rfs formula type EF
rfs formula formula --invariant=/tmp/648/inv_1_
rfs formula name AutonomousCar-PT-07b-ReachabilityFireability-11
rfs formula type EF
rfs formula formula --invariant=/tmp/648/inv_2_
rfs formula name AutonomousCar-PT-07b-ReachabilityFireability-12
rfs formula type EF
rfs formula formula --invariant=/tmp/648/inv_3_
rfs formula name AutonomousCar-PT-07b-ReachabilityFireability-13
rfs formula type EF
rfs formula formula --invariant=/tmp/648/inv_4_
rfs formula name AutonomousCar-PT-07b-ReachabilityFireability-15
rfs formula type EF
rfs formula formula --invariant=/tmp/648/inv_5_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 111 places, 420 transitions and 3829 arcs
pnml2lts-sym: Petri net AutonomousCar_PT_07b analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.010 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 420->399 groups
pnml2lts-sym: Regrouping took 0.110 real 0.110 user 0.000 sys
pnml2lts-sym: state vector length is 111; there are 399 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/648/inv_5_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/648/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/648/inv_2_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/648/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/648/inv_4_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/648/inv_3_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: all invariants violated
pnml2lts-sym: exiting now
pnml2lts-sym: invariant detection took 210.190 real 838.980 user 1.070 sys
pnml2lts-sym: max token count: 1

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="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is AutonomousCar-PT-07b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r009-oct2-167813598200639"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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