Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r026-smll-171620167500335.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is AutonomousCar-PT-08a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620167500335
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 12 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 448K May 18 16:42 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-ReachabilityFireability-2024-00
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityFireability-2024-01
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityFireability-2024-02
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityFireability-2024-03
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityFireability-2024-04
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityFireability-2024-05
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityFireability-2024-06
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityFireability-2024-07
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityFireability-2024-08
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityFireability-2024-09
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityFireability-2024-10
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityFireability-2024-11
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityFireability-2024-12
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityFireability-2024-13
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityFireability-2024-14
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716340174269

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-08a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-22 01:09:36] [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]
[2024-05-22 01:09:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 01:09:36] [INFO ] Load time of PNML (sax parser for PT used): 303 ms
[2024-05-22 01:09:36] [INFO ] Transformed 81 places.
[2024-05-22 01:09:36] [INFO ] Transformed 849 transitions.
[2024-05-22 01:09:36] [INFO ] Found NUPN structural information;
[2024-05-22 01:09:36] [INFO ] Parsed PT model containing 81 places and 849 transitions and 8894 arcs in 558 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 120 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 275 transitions
Reduce redundant transitions removed 275 transitions.
RANDOM walk for 40000 steps (2056 resets) in 4854 ms. (8 steps per ms) remains 11/16 properties
FORMULA AutonomousCar-PT-08a-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08a-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08a-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08a-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08a-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-22 01:09:38] [INFO ] Flatten gal took : 552 ms
[2024-05-22 01:09:38] [INFO ] Flatten gal took : 279 ms
[2024-05-22 01:09:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5339503271521737372.gal : 158 ms
[2024-05-22 01:09:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3776109052484760469.prop : 20 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5339503271521737372.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3776109052484760469.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality3776109052484760469.prop.
BEST_FIRST walk for 40004 steps (139 resets) in 4094 ms. (9 steps per ms) remains 9/11 properties
FORMULA AutonomousCar-PT-08a-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-08a-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :8 after 10
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :10 after 46
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :46 after 58
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :58 after 338
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :338 after 1906
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :1906 after 11790
BEST_FIRST walk for 40004 steps (138 resets) in 2118 ms. (18 steps per ms) remains 8/9 properties
FORMULA AutonomousCar-PT-08a-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (174 resets) in 535 ms. (74 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (145 resets) in 180 ms. (221 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (187 resets) in 272 ms. (146 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (144 resets) in 120 ms. (330 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (137 resets) in 76 ms. (519 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (134 resets) in 97 ms. (408 steps per ms) remains 8/8 properties
[2024-05-22 01:09:40] [INFO ] Flow matrix only has 573 transitions (discarded 1 similar events)
// Phase 1: matrix 573 rows 81 cols
[2024-05-22 01:09:40] [INFO ] Computed 13 invariants in 40 ms
[2024-05-22 01:09:40] [INFO ] State equation strengthened by 259 read => feed constraints.
Problem AutonomousCar-PT-08a-ReachabilityFireability-2024-04 is UNSAT
FORMULA AutonomousCar-PT-08a-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 63/63 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/63 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem AutonomousCar-PT-08a-ReachabilityFireability-2024-00 is UNSAT
FORMULA AutonomousCar-PT-08a-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem AutonomousCar-PT-08a-ReachabilityFireability-2024-06 is UNSAT
FORMULA AutonomousCar-PT-08a-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 16/79 variables, 12/75 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 16/91 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/91 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 2/81 variables, 1/92 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 2/94 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/94 constraints. Problems are: Problem set: 3 solved, 5 unsolved
Invariant property AutonomousCar-PT-08a-ReachabilityFireability-2024-03 does not hold.
FORMULA AutonomousCar-PT-08a-ReachabilityFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
At refinement iteration 8 (OVERLAPS) 572/653 variables, 81/175 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/653 variables, 258/433 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/653 variables, 0/433 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/654 variables, 1/434 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/654 variables, 0/434 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/654 variables, 0/434 constraints. Problems are: Problem set: 4 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 654/654 variables, and 434 constraints, problems are : Problem set: 4 solved, 4 unsolved in 871 ms.
Refiners :[Domain max(s): 81/81 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 81/81 constraints, ReadFeed: 259/259 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 20/20 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 52/72 variables, 11/31 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 52/83 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/83 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 9/81 variables, 2/85 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 9/94 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/94 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 572/653 variables, 81/175 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/653 variables, 258/433 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/653 variables, 4/437 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/653 variables, 0/437 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/654 variables, 1/438 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/654 variables, 0/438 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/654 variables, 0/438 constraints. Problems are: Problem set: 4 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 654/654 variables, and 438 constraints, problems are : Problem set: 4 solved, 4 unsolved in 1974 ms.
Refiners :[Domain max(s): 81/81 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 81/81 constraints, ReadFeed: 259/259 constraints, PredecessorRefiner: 4/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 3821ms problems are : Problem set: 4 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 772 ms.
Support contains 20 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.14 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 80 transition count 566
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 75 transition count 566
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 13 place count 75 transition count 565
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 74 transition count 565
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 18 place count 71 transition count 538
Iterating global reduction 2 with 3 rules applied. Total rules applied 21 place count 71 transition count 538
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 70 transition count 537
Free-agglomeration rule applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 33 place count 70 transition count 527
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 75 place count 60 transition count 495
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 60 transition count 495
Applied a total of 76 rules in 289 ms. Remains 60 /81 variables (removed 21) and now considering 495/574 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 305 ms. Remains : 60/81 places, 495/574 transitions.
RANDOM walk for 40000 steps (1346 resets) in 683 ms. (58 steps per ms) remains 1/4 properties
FORMULA AutonomousCar-PT-08a-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08a-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08a-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (142 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
// Phase 1: matrix 495 rows 60 cols
[2024-05-22 01:09:45] [INFO ] Computed 13 invariants in 7 ms
[2024-05-22 01:09:45] [INFO ] State equation strengthened by 203 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/60 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 495/555 variables, 60/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 203/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/555 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 276 constraints, problems are : Problem set: 0 solved, 1 unsolved in 250 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 60/60 constraints, ReadFeed: 203/203 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/60 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 495/555 variables, 60/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 203/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/555 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 277 constraints, problems are : Problem set: 0 solved, 1 unsolved in 458 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 60/60 constraints, ReadFeed: 203/203 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 750ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 185 ms.
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 495/495 transitions.
Graph (complete) has 748 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 494
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 56 transition count 467
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 56 transition count 467
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 55 transition count 466
Free-agglomeration rule applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 55 transition count 463
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 40 place count 52 transition count 439
Applied a total of 40 rules in 85 ms. Remains 52 /60 variables (removed 8) and now considering 439/495 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 52/60 places, 439/495 transitions.
RANDOM walk for 40000 steps (37 resets) in 525 ms. (76 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (68 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 483881 steps, run visited all 1 properties in 1107 ms. (steps per millisecond=437 )
Probabilistic random walk after 483881 steps, saw 64160 distinct states, run finished after 1113 ms. (steps per millisecond=434 ) properties seen :1
FORMULA AutonomousCar-PT-08a-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 12020 ms.

BK_STOP 1716340188274

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-08a"
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-5568"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-08a, 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 r026-smll-171620167500335"
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 [ "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 ;