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.r553-tall-171734901400310.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 ltsminxred
Input is FireWire-PT-18, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901400310
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 8.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 10K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 168K Jun 2 16:33 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 FireWire-PT-18-ReachabilityCardinality-2024-00
FORMULA_NAME FireWire-PT-18-ReachabilityCardinality-2024-01
FORMULA_NAME FireWire-PT-18-ReachabilityCardinality-2024-02
FORMULA_NAME FireWire-PT-18-ReachabilityCardinality-2024-03
FORMULA_NAME FireWire-PT-18-ReachabilityCardinality-2024-04
FORMULA_NAME FireWire-PT-18-ReachabilityCardinality-2024-05
FORMULA_NAME FireWire-PT-18-ReachabilityCardinality-2024-06
FORMULA_NAME FireWire-PT-18-ReachabilityCardinality-2024-07
FORMULA_NAME FireWire-PT-18-ReachabilityCardinality-2024-08
FORMULA_NAME FireWire-PT-18-ReachabilityCardinality-2024-09
FORMULA_NAME FireWire-PT-18-ReachabilityCardinality-2024-10
FORMULA_NAME FireWire-PT-18-ReachabilityCardinality-2024-11
FORMULA_NAME FireWire-PT-18-ReachabilityCardinality-2024-12
FORMULA_NAME FireWire-PT-18-ReachabilityCardinality-2024-13
FORMULA_NAME FireWire-PT-18-ReachabilityCardinality-2024-14
FORMULA_NAME FireWire-PT-18-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717357543152

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:45:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 19:45:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:45:44] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2024-06-02 19:45:44] [INFO ] Transformed 437 places.
[2024-06-02 19:45:44] [INFO ] Transformed 707 transitions.
[2024-06-02 19:45:44] [INFO ] Found NUPN structural information;
[2024-06-02 19:45:44] [INFO ] Parsed PT model containing 437 places and 707 transitions and 2170 arcs in 221 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
FORMULA FireWire-PT-18-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-18-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (13 resets) in 1150 ms. (34 steps per ms) remains 12/14 properties
FORMULA FireWire-PT-18-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-18-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40000 steps (13 resets) in 463 ms. (86 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (14 resets) in 282 ms. (141 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (30 resets) in 301 ms. (132 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (15 resets) in 354 ms. (112 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (21 resets) in 138 ms. (287 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (18 resets) in 304 ms. (131 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (15 resets) in 174 ms. (228 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (16 resets) in 310 ms. (128 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (9 resets) in 289 ms. (137 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (16 resets) in 55 ms. (714 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (13 resets) in 361 ms. (110 steps per ms) remains 11/12 properties
FORMULA FireWire-PT-18-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40000 steps (8 resets) in 185 ms. (215 steps per ms) remains 11/11 properties
// Phase 1: matrix 707 rows 437 cols
[2024-06-02 19:45:46] [INFO ] Computed 9 invariants in 16 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem FireWire-PT-18-ReachabilityCardinality-2024-14 is UNSAT
FORMULA FireWire-PT-18-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 346/425 variables, 8/87 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/425 variables, 346/433 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 0/433 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 12/437 variables, 1/434 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 12/446 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 0/446 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 707/1144 variables, 437/883 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1144 variables, 0/883 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 0/1144 variables, 0/883 constraints. Problems are: Problem set: 1 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1144/1144 variables, and 883 constraints, problems are : Problem set: 1 solved, 10 unsolved in 1239 ms.
Refiners :[Domain max(s): 437/437 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 437/437 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 56/56 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 369/425 variables, 8/64 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/425 variables, 369/433 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-06-02 19:45:47] [INFO ] Deduced a trap composed of 75 places in 213 ms of which 30 ms to minimize.
[2024-06-02 19:45:48] [INFO ] Deduced a trap composed of 128 places in 110 ms of which 2 ms to minimize.
[2024-06-02 19:45:48] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 3 ms to minimize.
[2024-06-02 19:45:48] [INFO ] Deduced a trap composed of 90 places in 182 ms of which 4 ms to minimize.
[2024-06-02 19:45:48] [INFO ] Deduced a trap composed of 62 places in 172 ms of which 3 ms to minimize.
[2024-06-02 19:45:48] [INFO ] Deduced a trap composed of 137 places in 65 ms of which 1 ms to minimize.
[2024-06-02 19:45:48] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 13 ms to minimize.
[2024-06-02 19:45:48] [INFO ] Deduced a trap composed of 114 places in 81 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 8/441 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-06-02 19:45:49] [INFO ] Deduced a trap composed of 133 places in 92 ms of which 2 ms to minimize.
[2024-06-02 19:45:49] [INFO ] Deduced a trap composed of 128 places in 63 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 2/443 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 0/443 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 12/437 variables, 1/444 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 12/456 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-06-02 19:45:49] [INFO ] Deduced a trap composed of 114 places in 75 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/437 variables, 1/457 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/437 variables, 0/457 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 707/1144 variables, 437/894 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1144 variables, 10/904 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-06-02 19:45:50] [INFO ] Deduced a trap composed of 138 places in 170 ms of which 3 ms to minimize.
[2024-06-02 19:45:51] [INFO ] Deduced a trap composed of 138 places in 166 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1144 variables, 2/906 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-06-02 19:45:51] [INFO ] Deduced a trap composed of 121 places in 163 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1144 variables, 1/907 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-06-02 19:45:52] [INFO ] Deduced a trap composed of 128 places in 163 ms of which 2 ms to minimize.
[2024-06-02 19:45:52] [INFO ] Deduced a trap composed of 139 places in 160 ms of which 3 ms to minimize.
SMT process timed out in 6498ms, After SMT, problems are : Problem set: 1 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 56 out of 437 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 437/437 places, 707/707 transitions.
Graph (trivial) has 253 edges and 437 vertex of which 3 / 437 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 1279 edges and 435 vertex of which 426 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 426 transition count 645
Reduce places removed 58 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 67 rules applied. Total rules applied 128 place count 368 transition count 636
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 136 place count 360 transition count 636
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 136 place count 360 transition count 627
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 154 place count 351 transition count 627
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 211 place count 294 transition count 567
Iterating global reduction 3 with 57 rules applied. Total rules applied 268 place count 294 transition count 567
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 269 place count 294 transition count 566
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 269 place count 294 transition count 563
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 275 place count 291 transition count 563
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 289 place count 277 transition count 487
Iterating global reduction 4 with 14 rules applied. Total rules applied 303 place count 277 transition count 487
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 305 place count 277 transition count 485
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 307 place count 275 transition count 482
Iterating global reduction 5 with 2 rules applied. Total rules applied 309 place count 275 transition count 482
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 311 place count 275 transition count 480
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 312 place count 274 transition count 480
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 313 place count 273 transition count 477
Iterating global reduction 7 with 1 rules applied. Total rules applied 314 place count 273 transition count 477
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 315 place count 272 transition count 475
Iterating global reduction 7 with 1 rules applied. Total rules applied 316 place count 272 transition count 475
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 317 place count 271 transition count 472
Iterating global reduction 7 with 1 rules applied. Total rules applied 318 place count 271 transition count 472
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 7 with 64 rules applied. Total rules applied 382 place count 239 transition count 440
Performed 19 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 7 with 38 rules applied. Total rules applied 420 place count 220 transition count 483
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 424 place count 220 transition count 479
Free-agglomeration rule applied 17 times.
Iterating global reduction 7 with 17 rules applied. Total rules applied 441 place count 220 transition count 462
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 458 place count 203 transition count 462
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 460 place count 201 transition count 460
Iterating global reduction 8 with 2 rules applied. Total rules applied 462 place count 201 transition count 460
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 465 place count 201 transition count 457
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 472 place count 201 transition count 457
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 473 place count 200 transition count 456
Applied a total of 473 rules in 235 ms. Remains 200 /437 variables (removed 237) and now considering 456/707 (removed 251) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 244 ms. Remains : 200/437 places, 456/707 transitions.
RANDOM walk for 40000 steps (16 resets) in 371 ms. (107 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (35 resets) in 250 ms. (159 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (37 resets) in 495 ms. (80 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (24 resets) in 282 ms. (141 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (25 resets) in 130 ms. (305 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (14 resets) in 156 ms. (254 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (13 resets) in 177 ms. (224 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (27 resets) in 59 ms. (666 steps per ms) remains 9/10 properties
FORMULA FireWire-PT-18-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40000 steps (35 resets) in 125 ms. (317 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (22 resets) in 118 ms. (336 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (20 resets) in 129 ms. (307 steps per ms) remains 9/9 properties
[2024-06-02 19:45:53] [INFO ] Flow matrix only has 452 transitions (discarded 4 similar events)
// Phase 1: matrix 452 rows 200 cols
[2024-06-02 19:45:53] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 19:45:53] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 138/189 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 3/192 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 452/644 variables, 192/199 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/644 variables, 6/205 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/644 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 8/652 variables, 8/213 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/652 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/652 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 652/652 variables, and 213 constraints, problems are : Problem set: 0 solved, 9 unsolved in 579 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 200/200 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 138/189 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 19:45:54] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 2 ms to minimize.
[2024-06-02 19:45:54] [INFO ] Deduced a trap composed of 72 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:45:54] [INFO ] Deduced a trap composed of 60 places in 41 ms of which 1 ms to minimize.
[2024-06-02 19:45:54] [INFO ] Deduced a trap composed of 49 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 19:45:54] [INFO ] Deduced a trap composed of 62 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 3/192 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 19:45:55] [INFO ] Deduced a trap composed of 53 places in 42 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 452/644 variables, 192/205 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/644 variables, 6/211 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/644 variables, 6/217 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 19:45:55] [INFO ] Deduced a trap composed of 54 places in 108 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/644 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 19:45:55] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/644 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/644 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 8/652 variables, 8/227 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/652 variables, 3/230 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 19:45:56] [INFO ] Deduced a trap composed of 61 places in 87 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/652 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/652 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 0/652 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 652/652 variables, and 231 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2240 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 200/200 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 9/9 constraints]
After SMT, in 2850ms problems are : Problem set: 0 solved, 9 unsolved
FORMULA FireWire-PT-18-ReachabilityCardinality-2024-03 FALSE TECHNIQUES PARIKH_WALK
FORMULA FireWire-PT-18-ReachabilityCardinality-2024-01 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 6925 ms.
Support contains 32 out of 200 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 456/456 transitions.
Graph (trivial) has 43 edges and 200 vertex of which 2 / 200 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 199 transition count 450
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 195 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 194 transition count 449
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 11 place count 194 transition count 444
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 21 place count 189 transition count 444
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 22 place count 188 transition count 442
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 188 transition count 442
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 3 with 6 rules applied. Total rules applied 29 place count 185 transition count 439
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 30 place count 184 transition count 438
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 184 transition count 438
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 34 place count 184 transition count 435
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 42 place count 180 transition count 438
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 43 place count 180 transition count 437
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 47 place count 180 transition count 433
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 52 place count 176 transition count 432
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 53 place count 176 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 54 place count 175 transition count 437
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 55 place count 174 transition count 436
Applied a total of 55 rules in 80 ms. Remains 174 /200 variables (removed 26) and now considering 436/456 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 174/200 places, 436/456 transitions.
RANDOM walk for 40000 steps (1766 resets) in 177 ms. (224 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (383 resets) in 102 ms. (388 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (334 resets) in 66 ms. (597 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (398 resets) in 70 ms. (563 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (376 resets) in 62 ms. (634 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (396 resets) in 52 ms. (754 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (388 resets) in 49 ms. (800 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (389 resets) in 45 ms. (869 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 656676 steps, run timeout after 3001 ms. (steps per millisecond=218 ) properties seen :4 out of 7
Probabilistic random walk after 656676 steps, saw 179472 distinct states, run finished after 3006 ms. (steps per millisecond=218 ) properties seen :4
FORMULA FireWire-PT-18-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-18-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-18-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-18-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-02 19:46:07] [INFO ] Flow matrix only has 430 transitions (discarded 6 similar events)
// Phase 1: matrix 430 rows 174 cols
[2024-06-02 19:46:07] [INFO ] Computed 7 invariants in 6 ms
[2024-06-02 19:46:07] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 127/154 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3/157 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 419/576 variables, 157/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 5/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 26/602 variables, 15/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/602 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/602 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/604 variables, 2/186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/604 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/604 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 604/604 variables, and 186 constraints, problems are : Problem set: 0 solved, 3 unsolved in 252 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 174/174 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 127/154 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3/157 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 19:46:07] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 419/576 variables, 157/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 5/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/576 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 26/602 variables, 15/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/602 variables, 2/186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/602 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/602 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/604 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/604 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/604 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 604/604 variables, and 190 constraints, problems are : Problem set: 0 solved, 3 unsolved in 558 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 174/174 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 829ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 428 ms.
Support contains 27 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 436/436 transitions.
Graph (complete) has 833 edges and 174 vertex of which 173 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 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 173 transition count 435
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 4 place count 172 transition count 434
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 171 transition count 433
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 171 transition count 433
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 171 transition count 431
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 10 place count 169 transition count 431
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 168 transition count 430
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 168 transition count 430
Applied a total of 12 rules in 27 ms. Remains 168 /174 variables (removed 6) and now considering 430/436 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 168/174 places, 430/436 transitions.
RANDOM walk for 40000 steps (1801 resets) in 94 ms. (421 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (336 resets) in 54 ms. (727 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (394 resets) in 51 ms. (769 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (403 resets) in 40 ms. (975 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 513155 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :1 out of 3
Probabilistic random walk after 513155 steps, saw 138032 distinct states, run finished after 3001 ms. (steps per millisecond=170 ) properties seen :1
FORMULA FireWire-PT-18-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-02 19:46:11] [INFO ] Flow matrix only has 424 transitions (discarded 6 similar events)
// Phase 1: matrix 424 rows 168 cols
[2024-06-02 19:46:11] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 19:46:11] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 119/144 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 406/550 variables, 144/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/550 variables, 5/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 37/587 variables, 19/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/587 variables, 3/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/587 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/589 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/589 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/589 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/592 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/592 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/592 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 592/592 variables, and 180 constraints, problems are : Problem set: 0 solved, 2 unsolved in 251 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 168/168 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 119/144 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 406/550 variables, 144/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/550 variables, 5/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 37/587 variables, 19/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/587 variables, 3/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/587 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/587 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/589 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/589 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/589 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/592 variables, 3/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/592 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/592 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 592/592 variables, and 182 constraints, problems are : Problem set: 0 solved, 2 unsolved in 462 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 168/168 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 728ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 274 ms.
Support contains 25 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 430/430 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 167 transition count 429
Applied a total of 2 rules in 24 ms. Remains 167 /168 variables (removed 1) and now considering 429/430 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 167/168 places, 429/430 transitions.
RANDOM walk for 40000 steps (1787 resets) in 152 ms. (261 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (339 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (399 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 750784 steps, run timeout after 3001 ms. (steps per millisecond=250 ) properties seen :0 out of 2
Probabilistic random walk after 750784 steps, saw 201180 distinct states, run finished after 3001 ms. (steps per millisecond=250 ) properties seen :0
[2024-06-02 19:46:15] [INFO ] Flow matrix only has 423 transitions (discarded 6 similar events)
// Phase 1: matrix 423 rows 167 cols
[2024-06-02 19:46:15] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 19:46:15] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 119/144 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 406/550 variables, 144/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/550 variables, 5/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 36/586 variables, 19/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/586 variables, 3/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/586 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/587 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/587 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/587 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/590 variables, 3/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/590 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/590 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 590/590 variables, and 179 constraints, problems are : Problem set: 0 solved, 2 unsolved in 224 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 167/167 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 119/144 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 406/550 variables, 144/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/550 variables, 5/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 36/586 variables, 19/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/586 variables, 3/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/586 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/587 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/587 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/587 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/590 variables, 3/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/590 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/590 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 590/590 variables, and 181 constraints, problems are : Problem set: 0 solved, 2 unsolved in 439 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 167/167 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 674ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 207 ms.
Support contains 25 out of 167 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 429/429 transitions.
Applied a total of 0 rules in 7 ms. Remains 167 /167 variables (removed 0) and now considering 429/429 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 167/167 places, 429/429 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 429/429 transitions.
Applied a total of 0 rules in 7 ms. Remains 167 /167 variables (removed 0) and now considering 429/429 (removed 0) transitions.
[2024-06-02 19:46:16] [INFO ] Flow matrix only has 423 transitions (discarded 6 similar events)
[2024-06-02 19:46:16] [INFO ] Invariant cache hit.
[2024-06-02 19:46:16] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-02 19:46:16] [INFO ] Flow matrix only has 423 transitions (discarded 6 similar events)
[2024-06-02 19:46:16] [INFO ] Invariant cache hit.
[2024-06-02 19:46:16] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 19:46:16] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
[2024-06-02 19:46:16] [INFO ] Redundant transitions in 30 ms returned []
Running 421 sub problems to find dead transitions.
[2024-06-02 19:46:16] [INFO ] Flow matrix only has 423 transitions (discarded 6 similar events)
[2024-06-02 19:46:16] [INFO ] Invariant cache hit.
[2024-06-02 19:46:16] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-06-02 19:46:18] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 0 ms to minimize.
[2024-06-02 19:46:18] [INFO ] Deduced a trap composed of 54 places in 43 ms of which 0 ms to minimize.
[2024-06-02 19:46:19] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2024-06-02 19:46:19] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2024-06-02 19:46:19] [INFO ] Deduced a trap composed of 93 places in 79 ms of which 1 ms to minimize.
[2024-06-02 19:46:19] [INFO ] Deduced a trap composed of 59 places in 47 ms of which 1 ms to minimize.
[2024-06-02 19:46:19] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
[2024-06-02 19:46:20] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 1 ms to minimize.
[2024-06-02 19:46:21] [INFO ] Deduced a trap composed of 49 places in 86 ms of which 4 ms to minimize.
[2024-06-02 19:46:21] [INFO ] Deduced a trap composed of 111 places in 74 ms of which 1 ms to minimize.
[2024-06-02 19:46:21] [INFO ] Deduced a trap composed of 95 places in 78 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-06-02 19:46:21] [INFO ] Deduced a trap composed of 125 places in 70 ms of which 2 ms to minimize.
[2024-06-02 19:46:21] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (OVERLAPS) 1/166 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-06-02 19:46:26] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 1 ms to minimize.
[2024-06-02 19:46:26] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 7 (OVERLAPS) 423/589 variables, 166/188 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/589 variables, 5/193 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/589 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 10 (OVERLAPS) 1/590 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/590 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 12 (OVERLAPS) 0/590 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 421 unsolved
No progress, stopping.
After SMT solving in domain Real declared 590/590 variables, and 194 constraints, problems are : Problem set: 0 solved, 421 unsolved in 29439 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 167/167 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 421 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (OVERLAPS) 1/166 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-06-02 19:46:49] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 6 (OVERLAPS) 423/589 variables, 166/189 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/589 variables, 5/194 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/589 variables, 421/615 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/589 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 10 (OVERLAPS) 1/590 variables, 1/616 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 590/590 variables, and 616 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 167/167 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 16/16 constraints]
After SMT, in 59871ms problems are : Problem set: 0 solved, 421 unsolved
Search for dead transitions found 0 dead transitions in 59882ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60287 ms. Remains : 167/167 places, 429/429 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 167 transition count 423
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 13 place count 167 transition count 416
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 167 transition count 416
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 167 transition count 415
Applied a total of 15 rules in 24 ms. Remains 167 /167 variables (removed 0) and now considering 415/429 (removed 14) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 415 rows 167 cols
[2024-06-02 19:47:16] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 19:47:16] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 19:47:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:47:17] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 19:47:17] [INFO ] After 199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-02 19:47:17] [INFO ] After 307ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 383 ms.
[2024-06-02 19:47:17] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2024-06-02 19:47:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 167 places, 429 transitions and 1604 arcs took 8 ms.
[2024-06-02 19:47:17] [INFO ] Flatten gal took : 63 ms
Total runtime 93180 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : FireWire-PT-18-ReachabilityCardinality-2024-07
Could not compute solution for formula : FireWire-PT-18-ReachabilityCardinality-2024-12

BK_STOP 1717357637721

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name FireWire-PT-18-ReachabilityCardinality-2024-07
rfs formula type AG
rfs formula formula --invariant=/tmp/692/inv_0_
rfs formula name FireWire-PT-18-ReachabilityCardinality-2024-12
rfs formula type AG
rfs formula formula --invariant=/tmp/692/inv_1_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="FireWire-PT-18"
export BK_EXAMINATION="ReachabilityCardinality"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is FireWire-PT-18, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r553-tall-171734901400310"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-18.tgz
mv FireWire-PT-18 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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