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

About the Execution of ITS-Tools for AutonomousCar-PT-05b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
421.264 8328.00 23213.00 39.50 TTTFFTFFTFTFTTFT 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.r005-oct2-167813593400607.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 itstools
Input is AutonomousCar-PT-05b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813593400607
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.5K Feb 25 12:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 12:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 12:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 15:33 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 11K Feb 25 12:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Feb 25 12:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 12:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K 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 159K 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-05b-ReachabilityFireability-00
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-01
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-02
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-03
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-04
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-05
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-06
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-07
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-08
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-09
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-10
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-11
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-12
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-13
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-14
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678521036368

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=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-05b
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202303021504
[2023-03-11 07:50:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 07:50:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 07:50:39] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2023-03-11 07:50:39] [INFO ] Transformed 255 places.
[2023-03-11 07:50:39] [INFO ] Transformed 490 transitions.
[2023-03-11 07:50:39] [INFO ] Found NUPN structural information;
[2023-03-11 07:50:39] [INFO ] Parsed PT model containing 255 places and 490 transitions and 2527 arcs in 240 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 18 resets, run finished after 393 ms. (steps per millisecond=25 ) properties (out of 16) seen :9
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 7) seen :0
[2023-03-11 07:50:39] [INFO ] Flatten gal took : 172 ms
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
[2023-03-11 07:50:39] [INFO ] Flatten gal took : 80 ms
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 7) seen :0
[2023-03-11 07:50:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10801572451016234795.gal : 43 ms
[2023-03-11 07:50:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8288643572770058469.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10801572451016234795.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8288643572770058469.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 7) seen :0
Loading property file /tmp/ReachabilityCardinality8288643572770058469.prop.
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 7) seen :1
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :5 after 6
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :6 after 21
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :21 after 30
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :30 after 51
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :51 after 11171
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 6) seen :0
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :11171 after 24061
Running SMT prover for 6 properties.
// Phase 1: matrix 490 rows 255 cols
[2023-03-11 07:50:40] [INFO ] Computed 10 place invariants in 15 ms
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :24061 after 127471
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :127471 after 625167
[2023-03-11 07:50:40] [INFO ] After 259ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 07:50:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-11 07:50:41] [INFO ] After 326ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :3
[2023-03-11 07:50:41] [INFO ] After 629ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :3
Attempting to minimize the solution found.
Minimization took 308 ms.
[2023-03-11 07:50:41] [INFO ] After 1058ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :3
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 30 ms.
Support contains 44 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 490/490 transitions.
Graph (trivial) has 160 edges and 255 vertex of which 4 / 255 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 759 edges and 253 vertex of which 246 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 80 rules applied. Total rules applied 82 place count 246 transition count 401
Reduce places removed 78 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 99 rules applied. Total rules applied 181 place count 168 transition count 380
Reduce places removed 11 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 13 rules applied. Total rules applied 194 place count 157 transition count 378
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 196 place count 155 transition count 378
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 196 place count 155 transition count 360
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 232 place count 137 transition count 360
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 256 place count 113 transition count 336
Iterating global reduction 4 with 24 rules applied. Total rules applied 280 place count 113 transition count 336
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 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 4 with 103 rules applied. Total rules applied 383 place count 113 transition count 233
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 384 place count 112 transition count 233
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 387 place count 109 transition count 222
Iterating global reduction 6 with 3 rules applied. Total rules applied 390 place count 109 transition count 222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 391 place count 109 transition count 221
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 7 with 36 rules applied. Total rules applied 427 place count 91 transition count 203
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 428 place count 91 transition count 202
Free-agglomeration rule applied 9 times.
Iterating global reduction 7 with 9 rules applied. Total rules applied 437 place count 91 transition count 193
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 446 place count 82 transition count 193
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 449 place count 82 transition count 190
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 450 place count 81 transition count 189
Applied a total of 450 rules in 223 ms. Remains 81 /255 variables (removed 174) and now considering 189/490 (removed 301) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 223 ms. Remains : 81/255 places, 189/490 transitions.
Incomplete random walk after 10000 steps, including 273 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :1
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 189 rows 81 cols
[2023-03-11 07:50:42] [INFO ] Computed 10 place invariants in 5 ms
[2023-03-11 07:50:42] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :625167 after 3.15128e+06
[2023-03-11 07:50:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-11 07:50:42] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 07:50:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:50:42] [INFO ] After 72ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 07:50:42] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 1 ms to minimize.
[2023-03-11 07:50:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2023-03-11 07:50:42] [INFO ] After 311ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-03-11 07:50:42] [INFO ] After 545ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 13 ms.
Support contains 40 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 189/189 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 1 rules applied. Total rules applied 1 place count 81 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 80 transition count 188
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 5 place count 80 transition count 185
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 8 place count 77 transition count 185
Applied a total of 8 rules in 11 ms. Remains 77 /81 variables (removed 4) and now considering 185/189 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 77/81 places, 185/189 transitions.
Incomplete random walk after 10000 steps, including 224 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 2) seen :1
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 77 cols
[2023-03-11 07:50:43] [INFO ] Computed 10 place invariants in 13 ms
[2023-03-11 07:50:43] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-11 07:50:43] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 07:50:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-11 07:50:43] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 07:50:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:50:43] [INFO ] After 32ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 07:50:43] [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 28 ms.
[2023-03-11 07:50:43] [INFO ] After 269ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 185/185 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 77 transition count 176
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 68 transition count 176
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 18 place count 68 transition count 171
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 28 place count 63 transition count 171
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 61 transition count 165
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 61 transition count 165
Ensure Unique test 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 2 with 2 rules applied. Total rules applied 34 place count 61 transition count 163
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 35 place count 60 transition count 163
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 49 place count 53 transition count 156
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 53 place count 49 transition count 132
Iterating global reduction 4 with 4 rules applied. Total rules applied 57 place count 49 transition count 132
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 67 place count 44 transition count 127
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 73 place count 44 transition count 121
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 89 place count 38 transition count 111
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 90 place count 38 transition count 111
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 91 place count 37 transition count 110
Applied a total of 91 rules in 51 ms. Remains 37 /77 variables (removed 40) and now considering 110/185 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 37/77 places, 110/185 transitions.
Incomplete random walk after 10000 steps, including 141 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Finished probabilistic random walk after 291381 steps, run visited all 1 properties in 511 ms. (steps per millisecond=570 )
Probabilistic random walk after 291381 steps, saw 48705 distinct states, run finished after 523 ms. (steps per millisecond=557 ) properties seen :1
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
All properties solved without resorting to model-checking.
Total runtime 5209 ms.

BK_STOP 1678521044696

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-05b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is AutonomousCar-PT-05b, 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 r005-oct2-167813593400607"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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