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.r135-tall-171631130400126.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 greatspnxred
Input is Dekker-PT-200, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631130400126
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 25M
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 12 04:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K Apr 12 04:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:39 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 25M 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 Dekker-PT-200-ReachabilityCardinality-2024-00
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2024-01
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2024-02
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2023-03
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2024-04
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2023-05
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2024-06
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2024-07
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2024-08
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2024-09
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2024-10
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2024-11
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2024-12
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2024-13
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2024-14
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716335307250

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-200
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 23:48:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 23:48:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:48:29] [INFO ] Load time of PNML (sax parser for PT used): 1168 ms
[2024-05-21 23:48:29] [INFO ] Transformed 1000 places.
[2024-05-21 23:48:29] [INFO ] Transformed 40400 transitions.
[2024-05-21 23:48:29] [INFO ] Found NUPN structural information;
[2024-05-21 23:48:30] [INFO ] Parsed PT model containing 1000 places and 40400 transitions and 320400 arcs in 1515 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 269 ms.
Working with output stream class java.io.PrintStream
FORMULA Dekker-PT-200-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 4585 ms. (8 steps per ms) remains 8/11 properties
FORMULA Dekker-PT-200-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-200-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-200-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 401 ms. (99 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 362 ms. (110 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 400 ms. (99 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 462 ms. (86 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 314 ms. (126 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 539 ms. (74 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 369 ms. (108 steps per ms) remains 7/8 properties
FORMULA Dekker-PT-200-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 406 ms. (98 steps per ms) remains 7/7 properties
[2024-05-21 23:48:32] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 1000 cols
[2024-05-21 23:48:32] [INFO ] Computed 600 invariants in 45 ms
[2024-05-21 23:48:33] [INFO ] State equation strengthened by 200 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 108/108 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 178/286 variables, 117/226 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 178/404 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 7/411 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 26/312 variables, 26/437 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 26/463 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 99/411 variables, 82/545 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/411 variables, 99/644 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/411 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 34/445 variables, 34/678 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/445 variables, 34/712 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/445 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 356/801 variables, 445/1157 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/801 variables, 0/1157 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 222/1023 variables, 200/1357 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1023 variables, 0/1357 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 666/1689 variables, 444/1801 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1689 variables, 444/2245 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1689 variables, 0/2245 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 111/1800 variables, 222/2467 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1800 variables, 111/2578 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1800 variables, 111/2689 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1800 variables, 111/2800 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1800 variables, 0/2800 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (OVERLAPS) 0/1800 variables, 0/2800 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1800/1800 variables, and 2800 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2254 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 400/400 constraints, Generalized P Invariants (flows): 200/200 constraints, State Equation: 1000/1000 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 108/108 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:48:36] [INFO ] Deduced a trap composed of 2 places in 283 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 178/286 variables, 117/227 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 178/405 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 7/412 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:48:37] [INFO ] Deduced a trap composed of 4 places in 505 ms of which 1 ms to minimize.
[2024-05-21 23:48:38] [INFO ] Deduced a trap composed of 4 places in 449 ms of which 1 ms to minimize.
[2024-05-21 23:48:38] [INFO ] Deduced a trap composed of 4 places in 460 ms of which 2 ms to minimize.
[2024-05-21 23:48:39] [INFO ] Deduced a trap composed of 4 places in 414 ms of which 1 ms to minimize.
[2024-05-21 23:48:39] [INFO ] Deduced a trap composed of 4 places in 445 ms of which 1 ms to minimize.
[2024-05-21 23:48:40] [INFO ] Deduced a trap composed of 4 places in 433 ms of which 1 ms to minimize.
[2024-05-21 23:48:40] [INFO ] Deduced a trap composed of 4 places in 381 ms of which 0 ms to minimize.
[2024-05-21 23:48:40] [INFO ] Deduced a trap composed of 4 places in 384 ms of which 1 ms to minimize.
SMT process timed out in 7944ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 108 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 1292 ms. Remains 1000 /1000 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1310 ms. Remains : 1000/1000 places, 40400/40400 transitions.
RANDOM walk for 40000 steps (8 resets) in 3053 ms. (13 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 352 ms. (113 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 373 ms. (106 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 374 ms. (106 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 294 ms. (135 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 291 ms. (137 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 323 ms. (123 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 335 ms. (119 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 100098 steps, run timeout after 3003 ms. (steps per millisecond=33 ) properties seen :0 out of 7
Probabilistic random walk after 100098 steps, saw 96759 distinct states, run finished after 3010 ms. (steps per millisecond=33 ) properties seen :0
[2024-05-21 23:48:46] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-21 23:48:46] [INFO ] Invariant cache hit.
[2024-05-21 23:48:47] [INFO ] State equation strengthened by 200 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 108/108 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 178/286 variables, 117/226 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 178/404 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 7/411 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 26/312 variables, 26/437 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 26/463 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 99/411 variables, 82/545 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/411 variables, 99/644 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/411 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 34/445 variables, 34/678 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/445 variables, 34/712 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/445 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 356/801 variables, 445/1157 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/801 variables, 0/1157 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 222/1023 variables, 200/1357 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1023 variables, 0/1357 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 666/1689 variables, 444/1801 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1689 variables, 444/2245 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1689 variables, 0/2245 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 111/1800 variables, 222/2467 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1800 variables, 111/2578 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1800 variables, 111/2689 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1800 variables, 111/2800 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1800 variables, 0/2800 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (OVERLAPS) 0/1800 variables, 0/2800 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1800/1800 variables, and 2800 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1766 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 400/400 constraints, Generalized P Invariants (flows): 200/200 constraints, State Equation: 1000/1000 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 108/108 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:48:49] [INFO ] Deduced a trap composed of 2 places in 131 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 178/286 variables, 117/227 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 178/405 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 7/412 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:48:50] [INFO ] Deduced a trap composed of 4 places in 460 ms of which 1 ms to minimize.
[2024-05-21 23:48:51] [INFO ] Deduced a trap composed of 4 places in 449 ms of which 1 ms to minimize.
[2024-05-21 23:48:51] [INFO ] Deduced a trap composed of 4 places in 447 ms of which 1 ms to minimize.
[2024-05-21 23:48:52] [INFO ] Deduced a trap composed of 4 places in 443 ms of which 1 ms to minimize.
[2024-05-21 23:48:52] [INFO ] Deduced a trap composed of 4 places in 419 ms of which 1 ms to minimize.
[2024-05-21 23:48:52] [INFO ] Deduced a trap composed of 4 places in 406 ms of which 1 ms to minimize.
[2024-05-21 23:48:53] [INFO ] Deduced a trap composed of 4 places in 411 ms of which 1 ms to minimize.
[2024-05-21 23:48:53] [INFO ] Deduced a trap composed of 4 places in 403 ms of which 1 ms to minimize.
[2024-05-21 23:48:54] [INFO ] Deduced a trap composed of 4 places in 393 ms of which 1 ms to minimize.
[2024-05-21 23:48:54] [INFO ] Deduced a trap composed of 4 places in 380 ms of which 1 ms to minimize.
[2024-05-21 23:48:54] [INFO ] Deduced a trap composed of 4 places in 357 ms of which 1 ms to minimize.
[2024-05-21 23:48:55] [INFO ] Deduced a trap composed of 4 places in 341 ms of which 1 ms to minimize.
[2024-05-21 23:48:55] [INFO ] Deduced a trap composed of 4 places in 351 ms of which 0 ms to minimize.
[2024-05-21 23:48:56] [INFO ] Deduced a trap composed of 4 places in 339 ms of which 1 ms to minimize.
[2024-05-21 23:48:56] [INFO ] Deduced a trap composed of 4 places in 325 ms of which 1 ms to minimize.
[2024-05-21 23:48:56] [INFO ] Deduced a trap composed of 4 places in 319 ms of which 1 ms to minimize.
[2024-05-21 23:48:56] [INFO ] Deduced a trap composed of 4 places in 313 ms of which 1 ms to minimize.
[2024-05-21 23:48:57] [INFO ] Deduced a trap composed of 4 places in 352 ms of which 1 ms to minimize.
[2024-05-21 23:48:57] [INFO ] Deduced a trap composed of 4 places in 366 ms of which 1 ms to minimize.
[2024-05-21 23:48:58] [INFO ] Deduced a trap composed of 4 places in 334 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 20/432 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:48:58] [INFO ] Deduced a trap composed of 4 places in 375 ms of which 1 ms to minimize.
[2024-05-21 23:48:58] [INFO ] Deduced a trap composed of 4 places in 380 ms of which 1 ms to minimize.
[2024-05-21 23:48:59] [INFO ] Deduced a trap composed of 4 places in 362 ms of which 1 ms to minimize.
[2024-05-21 23:48:59] [INFO ] Deduced a trap composed of 4 places in 348 ms of which 0 ms to minimize.
[2024-05-21 23:48:59] [INFO ] Deduced a trap composed of 4 places in 336 ms of which 1 ms to minimize.
[2024-05-21 23:49:00] [INFO ] Deduced a trap composed of 4 places in 300 ms of which 1 ms to minimize.
[2024-05-21 23:49:00] [INFO ] Deduced a trap composed of 4 places in 339 ms of which 1 ms to minimize.
[2024-05-21 23:49:00] [INFO ] Deduced a trap composed of 4 places in 326 ms of which 1 ms to minimize.
[2024-05-21 23:49:01] [INFO ] Deduced a trap composed of 4 places in 337 ms of which 0 ms to minimize.
[2024-05-21 23:49:01] [INFO ] Deduced a trap composed of 4 places in 316 ms of which 1 ms to minimize.
[2024-05-21 23:49:01] [INFO ] Deduced a trap composed of 4 places in 310 ms of which 0 ms to minimize.
[2024-05-21 23:49:02] [INFO ] Deduced a trap composed of 4 places in 323 ms of which 0 ms to minimize.
[2024-05-21 23:49:02] [INFO ] Deduced a trap composed of 4 places in 356 ms of which 2 ms to minimize.
[2024-05-21 23:49:02] [INFO ] Deduced a trap composed of 4 places in 334 ms of which 0 ms to minimize.
[2024-05-21 23:49:03] [INFO ] Deduced a trap composed of 4 places in 329 ms of which 1 ms to minimize.
[2024-05-21 23:49:03] [INFO ] Deduced a trap composed of 4 places in 287 ms of which 1 ms to minimize.
[2024-05-21 23:49:03] [INFO ] Deduced a trap composed of 4 places in 327 ms of which 0 ms to minimize.
[2024-05-21 23:49:04] [INFO ] Deduced a trap composed of 4 places in 326 ms of which 0 ms to minimize.
[2024-05-21 23:49:04] [INFO ] Deduced a trap composed of 4 places in 354 ms of which 1 ms to minimize.
[2024-05-21 23:49:04] [INFO ] Deduced a trap composed of 4 places in 291 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/286 variables, 20/452 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:49:05] [INFO ] Deduced a trap composed of 4 places in 315 ms of which 3 ms to minimize.
[2024-05-21 23:49:05] [INFO ] Deduced a trap composed of 4 places in 338 ms of which 1 ms to minimize.
[2024-05-21 23:49:05] [INFO ] Deduced a trap composed of 4 places in 300 ms of which 0 ms to minimize.
[2024-05-21 23:49:06] [INFO ] Deduced a trap composed of 4 places in 298 ms of which 0 ms to minimize.
[2024-05-21 23:49:06] [INFO ] Deduced a trap composed of 4 places in 276 ms of which 1 ms to minimize.
[2024-05-21 23:49:06] [INFO ] Deduced a trap composed of 4 places in 267 ms of which 3 ms to minimize.
[2024-05-21 23:49:07] [INFO ] Deduced a trap composed of 4 places in 268 ms of which 1 ms to minimize.
[2024-05-21 23:49:07] [INFO ] Deduced a trap composed of 4 places in 251 ms of which 1 ms to minimize.
[2024-05-21 23:49:07] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 1 ms to minimize.
[2024-05-21 23:49:07] [INFO ] Deduced a trap composed of 4 places in 267 ms of which 2 ms to minimize.
[2024-05-21 23:49:08] [INFO ] Deduced a trap composed of 4 places in 252 ms of which 1 ms to minimize.
[2024-05-21 23:49:08] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 0 ms to minimize.
[2024-05-21 23:49:08] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 1 ms to minimize.
[2024-05-21 23:49:08] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 1 ms to minimize.
[2024-05-21 23:49:09] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 1 ms to minimize.
[2024-05-21 23:49:09] [INFO ] Deduced a trap composed of 4 places in 234 ms of which 1 ms to minimize.
[2024-05-21 23:49:09] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 0 ms to minimize.
[2024-05-21 23:49:09] [INFO ] Deduced a trap composed of 4 places in 236 ms of which 1 ms to minimize.
[2024-05-21 23:49:10] [INFO ] Deduced a trap composed of 4 places in 277 ms of which 0 ms to minimize.
[2024-05-21 23:49:10] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/286 variables, 20/472 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:49:10] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 0 ms to minimize.
[2024-05-21 23:49:10] [INFO ] Deduced a trap composed of 4 places in 278 ms of which 1 ms to minimize.
[2024-05-21 23:49:11] [INFO ] Deduced a trap composed of 4 places in 235 ms of which 0 ms to minimize.
[2024-05-21 23:49:11] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 1 ms to minimize.
[2024-05-21 23:49:11] [INFO ] Deduced a trap composed of 4 places in 230 ms of which 1 ms to minimize.
[2024-05-21 23:49:11] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 1 ms to minimize.
[2024-05-21 23:49:12] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 1 ms to minimize.
[2024-05-21 23:49:12] [INFO ] Deduced a trap composed of 4 places in 215 ms of which 1 ms to minimize.
[2024-05-21 23:49:12] [INFO ] Deduced a trap composed of 4 places in 211 ms of which 0 ms to minimize.
[2024-05-21 23:49:12] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 0 ms to minimize.
[2024-05-21 23:49:12] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 1 ms to minimize.
[2024-05-21 23:49:13] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 0 ms to minimize.
[2024-05-21 23:49:13] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 1 ms to minimize.
[2024-05-21 23:49:13] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 1 ms to minimize.
[2024-05-21 23:49:13] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 0 ms to minimize.
[2024-05-21 23:49:13] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 0 ms to minimize.
[2024-05-21 23:49:14] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 0 ms to minimize.
[2024-05-21 23:49:14] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 0 ms to minimize.
[2024-05-21 23:49:14] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 1 ms to minimize.
[2024-05-21 23:49:14] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/286 variables, 20/492 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:49:14] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 0 ms to minimize.
[2024-05-21 23:49:15] [INFO ] Deduced a trap composed of 4 places in 232 ms of which 1 ms to minimize.
[2024-05-21 23:49:15] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 0 ms to minimize.
[2024-05-21 23:49:15] [INFO ] Deduced a trap composed of 4 places in 230 ms of which 0 ms to minimize.
[2024-05-21 23:49:15] [INFO ] Deduced a trap composed of 4 places in 224 ms of which 0 ms to minimize.
[2024-05-21 23:49:16] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 1 ms to minimize.
[2024-05-21 23:49:16] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 1 ms to minimize.
[2024-05-21 23:49:16] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 0 ms to minimize.
[2024-05-21 23:49:16] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 1 ms to minimize.
[2024-05-21 23:49:16] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 1 ms to minimize.
[2024-05-21 23:49:17] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 1 ms to minimize.
[2024-05-21 23:49:17] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 0 ms to minimize.
[2024-05-21 23:49:17] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 1 ms to minimize.
[2024-05-21 23:49:17] [INFO ] Deduced a trap composed of 4 places in 276 ms of which 1 ms to minimize.
[2024-05-21 23:49:18] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 1 ms to minimize.
[2024-05-21 23:49:18] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 0 ms to minimize.
[2024-05-21 23:49:18] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 0 ms to minimize.
[2024-05-21 23:49:18] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 1 ms to minimize.
[2024-05-21 23:49:19] [INFO ] Deduced a trap composed of 4 places in 235 ms of which 1 ms to minimize.
[2024-05-21 23:49:19] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/286 variables, 20/512 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:49:19] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 1 ms to minimize.
[2024-05-21 23:49:19] [INFO ] Deduced a trap composed of 4 places in 233 ms of which 0 ms to minimize.
[2024-05-21 23:49:20] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 0 ms to minimize.
[2024-05-21 23:49:20] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 0 ms to minimize.
[2024-05-21 23:49:20] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 0 ms to minimize.
[2024-05-21 23:49:20] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 0 ms to minimize.
[2024-05-21 23:49:21] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 1 ms to minimize.
[2024-05-21 23:49:21] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 0 ms to minimize.
[2024-05-21 23:49:21] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 2 ms to minimize.
[2024-05-21 23:49:21] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 1 ms to minimize.
[2024-05-21 23:49:21] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 0 ms to minimize.
[2024-05-21 23:49:22] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 0 ms to minimize.
[2024-05-21 23:49:22] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 1 ms to minimize.
[2024-05-21 23:49:22] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 1 ms to minimize.
[2024-05-21 23:49:22] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 1 ms to minimize.
[2024-05-21 23:49:22] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 0 ms to minimize.
[2024-05-21 23:49:22] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 0 ms to minimize.
[2024-05-21 23:49:23] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 1 ms to minimize.
[2024-05-21 23:49:23] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 1 ms to minimize.
[2024-05-21 23:49:23] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/286 variables, 20/532 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:49:23] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 1 ms to minimize.
[2024-05-21 23:49:24] [INFO ] Deduced a trap composed of 4 places in 228 ms of which 1 ms to minimize.
[2024-05-21 23:49:24] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 1 ms to minimize.
[2024-05-21 23:49:24] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 1 ms to minimize.
[2024-05-21 23:49:24] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 1 ms to minimize.
[2024-05-21 23:49:24] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 1 ms to minimize.
[2024-05-21 23:49:25] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 0 ms to minimize.
[2024-05-21 23:49:25] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 0 ms to minimize.
[2024-05-21 23:49:25] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 0 ms to minimize.
[2024-05-21 23:49:25] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 1 ms to minimize.
[2024-05-21 23:49:25] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 1 ms to minimize.
[2024-05-21 23:49:26] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 1 ms to minimize.
[2024-05-21 23:49:26] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 1 ms to minimize.
[2024-05-21 23:49:26] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 1 ms to minimize.
[2024-05-21 23:49:26] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 1 ms to minimize.
[2024-05-21 23:49:26] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 0 ms to minimize.
[2024-05-21 23:49:27] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 1 ms to minimize.
[2024-05-21 23:49:27] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 0 ms to minimize.
[2024-05-21 23:49:27] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 1 ms to minimize.
[2024-05-21 23:49:27] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/286 variables, 20/552 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:49:27] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 1 ms to minimize.
[2024-05-21 23:49:28] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 1 ms to minimize.
[2024-05-21 23:49:28] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 0 ms to minimize.
[2024-05-21 23:49:28] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 0 ms to minimize.
[2024-05-21 23:49:28] [INFO ] Deduced a trap composed of 4 places in 169 ms of which 1 ms to minimize.
[2024-05-21 23:49:29] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 0 ms to minimize.
[2024-05-21 23:49:29] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 1 ms to minimize.
[2024-05-21 23:49:29] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 1 ms to minimize.
[2024-05-21 23:49:29] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 0 ms to minimize.
[2024-05-21 23:49:29] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 0 ms to minimize.
[2024-05-21 23:49:30] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 0 ms to minimize.
[2024-05-21 23:49:30] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 0 ms to minimize.
[2024-05-21 23:49:30] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 1 ms to minimize.
[2024-05-21 23:49:30] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 1 ms to minimize.
[2024-05-21 23:49:30] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 1 ms to minimize.
[2024-05-21 23:49:31] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 1 ms to minimize.
[2024-05-21 23:49:31] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 1 ms to minimize.
[2024-05-21 23:49:31] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 1 ms to minimize.
[2024-05-21 23:49:31] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 1 ms to minimize.
[2024-05-21 23:49:31] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/286 variables, 20/572 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:49:32] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 1 ms to minimize.
[2024-05-21 23:49:32] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 0 ms to minimize.
[2024-05-21 23:49:32] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 0 ms to minimize.
[2024-05-21 23:49:32] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 0 ms to minimize.
[2024-05-21 23:49:33] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 1 ms to minimize.
[2024-05-21 23:49:33] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 1 ms to minimize.
[2024-05-21 23:49:33] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 1 ms to minimize.
[2024-05-21 23:49:33] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 0 ms to minimize.
Problem Dekker-PT-200-ReachabilityCardinality-2024-10 is UNSAT
FORMULA Dekker-PT-200-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-21 23:49:33] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 0 ms to minimize.
[2024-05-21 23:49:34] [INFO ] Deduced a trap composed of 4 places in 222 ms of which 1 ms to minimize.
SMT process timed out in 47412ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 99 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 1241 ms. Remains 1000 /1000 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1244 ms. Remains : 1000/1000 places, 40400/40400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 1052 ms. Remains 1000 /1000 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-21 23:49:36] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-21 23:49:36] [INFO ] Invariant cache hit.
[2024-05-21 23:50:05] [INFO ] Implicit Places using invariants in 29549 ms returned [400, 406, 409, 412, 415, 421, 424, 427, 430, 436, 439, 442, 445, 448, 451, 454, 457, 460, 463, 466, 469, 472, 475, 478, 481, 484, 487, 490, 493, 496, 502, 505, 508, 511, 514, 517, 520, 523, 526, 529, 532, 535, 541, 544, 553, 556, 559, 562, 565, 568, 571, 574, 577, 580, 583, 586, 589, 592, 595, 598, 604, 607, 610, 613, 616, 619, 622, 625, 628, 631, 634, 637, 640, 643, 646, 649, 652, 655, 658, 661, 664, 667, 670, 673, 676, 679, 682, 685, 688, 691, 694, 697, 700, 703, 706, 709, 712, 715, 718, 721, 724, 727, 730, 733, 736, 739, 742, 745, 748, 754, 757, 760, 763, 766, 772, 775, 778, 781, 784, 787, 790, 793, 796, 799, 802, 805, 808, 811, 814, 817, 820, 823, 826, 829, 832, 835, 838, 844, 847, 850, 853, 859, 862, 868, 874, 877, 880, 883, 886, 889, 892, 895, 898, 901, 907, 910, 913, 916, 919, 922, 925, 928, 931, 934, 937, 943, 946, 949, 952, 955, 958, 961, 967, 970, 973, 976, 979, 982, 988, 991, 994, 997]
Discarding 182 places :
Implicit Place search using SMT only with invariants took 29602 ms to find 182 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 818/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 747 ms. Remains 818 /818 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 31408 ms. Remains : 818/1000 places, 40400/40400 transitions.
RANDOM walk for 40000 steps (8 resets) in 3869 ms. (10 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 306 ms. (130 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 314 ms. (126 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 274 ms. (145 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 290 ms. (137 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 94269 steps, run timeout after 3006 ms. (steps per millisecond=31 ) properties seen :0 out of 6
Probabilistic random walk after 94269 steps, saw 91160 distinct states, run finished after 3008 ms. (steps per millisecond=31 ) properties seen :0
[2024-05-21 23:50:11] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 818 cols
[2024-05-21 23:50:11] [INFO ] Computed 418 invariants in 11 ms
[2024-05-21 23:50:11] [INFO ] State equation strengthened by 200 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 156/255 variables, 105/206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 156/362 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 77/332 variables, 59/421 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 77/498 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 18/350 variables, 18/516 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/350 variables, 18/534 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/350 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 332/682 variables, 350/884 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/682 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 234/916 variables, 200/1084 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/916 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 585/1501 variables, 351/1435 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1501 variables, 351/1786 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1501 variables, 117/1903 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1501 variables, 0/1903 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 117/1618 variables, 117/2020 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1618 variables, 117/2137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1618 variables, 117/2254 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1618 variables, 0/2254 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 0/1618 variables, 0/2254 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1618/1618 variables, and 2254 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1481 ms.
Refiners :[Domain max(s): 818/818 constraints, Positive P Invariants (semi-flows): 400/400 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 818/818 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 156/255 variables, 105/206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 156/362 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 23:50:14] [INFO ] Deduced a trap composed of 4 places in 423 ms of which 1 ms to minimize.
[2024-05-21 23:50:14] [INFO ] Deduced a trap composed of 4 places in 407 ms of which 1 ms to minimize.
[2024-05-21 23:50:15] [INFO ] Deduced a trap composed of 4 places in 418 ms of which 1 ms to minimize.
[2024-05-21 23:50:15] [INFO ] Deduced a trap composed of 4 places in 376 ms of which 0 ms to minimize.
[2024-05-21 23:50:15] [INFO ] Deduced a trap composed of 4 places in 365 ms of which 0 ms to minimize.
[2024-05-21 23:50:16] [INFO ] Deduced a trap composed of 4 places in 355 ms of which 0 ms to minimize.
[2024-05-21 23:50:16] [INFO ] Deduced a trap composed of 4 places in 340 ms of which 1 ms to minimize.
[2024-05-21 23:50:16] [INFO ] Deduced a trap composed of 4 places in 334 ms of which 1 ms to minimize.
[2024-05-21 23:50:17] [INFO ] Deduced a trap composed of 5 places in 313 ms of which 1 ms to minimize.
[2024-05-21 23:50:17] [INFO ] Deduced a trap composed of 4 places in 310 ms of which 1 ms to minimize.
[2024-05-21 23:50:17] [INFO ] Deduced a trap composed of 4 places in 297 ms of which 0 ms to minimize.
[2024-05-21 23:50:18] [INFO ] Deduced a trap composed of 4 places in 311 ms of which 1 ms to minimize.
[2024-05-21 23:50:18] [INFO ] Deduced a trap composed of 4 places in 352 ms of which 0 ms to minimize.
[2024-05-21 23:50:18] [INFO ] Deduced a trap composed of 6 places in 316 ms of which 1 ms to minimize.
[2024-05-21 23:50:19] [INFO ] Deduced a trap composed of 4 places in 284 ms of which 1 ms to minimize.
[2024-05-21 23:50:19] [INFO ] Deduced a trap composed of 4 places in 287 ms of which 1 ms to minimize.
[2024-05-21 23:50:19] [INFO ] Deduced a trap composed of 4 places in 273 ms of which 1 ms to minimize.
[2024-05-21 23:50:20] [INFO ] Deduced a trap composed of 4 places in 283 ms of which 1 ms to minimize.
[2024-05-21 23:50:20] [INFO ] Deduced a trap composed of 4 places in 286 ms of which 0 ms to minimize.
[2024-05-21 23:50:20] [INFO ] Deduced a trap composed of 4 places in 259 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 20/382 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 23:50:20] [INFO ] Deduced a trap composed of 4 places in 268 ms of which 1 ms to minimize.
[2024-05-21 23:50:21] [INFO ] Deduced a trap composed of 4 places in 291 ms of which 1 ms to minimize.
[2024-05-21 23:50:21] [INFO ] Deduced a trap composed of 4 places in 356 ms of which 1 ms to minimize.
[2024-05-21 23:50:21] [INFO ] Deduced a trap composed of 4 places in 337 ms of which 1 ms to minimize.
[2024-05-21 23:50:22] [INFO ] Deduced a trap composed of 4 places in 345 ms of which 1 ms to minimize.
[2024-05-21 23:50:22] [INFO ] Deduced a trap composed of 4 places in 313 ms of which 1 ms to minimize.
[2024-05-21 23:50:22] [INFO ] Deduced a trap composed of 6 places in 297 ms of which 0 ms to minimize.
[2024-05-21 23:50:23] [INFO ] Deduced a trap composed of 4 places in 290 ms of which 0 ms to minimize.
[2024-05-21 23:50:23] [INFO ] Deduced a trap composed of 4 places in 290 ms of which 1 ms to minimize.
[2024-05-21 23:50:23] [INFO ] Deduced a trap composed of 4 places in 268 ms of which 1 ms to minimize.
[2024-05-21 23:50:24] [INFO ] Deduced a trap composed of 4 places in 269 ms of which 0 ms to minimize.
[2024-05-21 23:50:24] [INFO ] Deduced a trap composed of 4 places in 258 ms of which 0 ms to minimize.
[2024-05-21 23:50:24] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 1 ms to minimize.
[2024-05-21 23:50:24] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 0 ms to minimize.
[2024-05-21 23:50:25] [INFO ] Deduced a trap composed of 4 places in 234 ms of which 1 ms to minimize.
[2024-05-21 23:50:25] [INFO ] Deduced a trap composed of 4 places in 216 ms of which 1 ms to minimize.
[2024-05-21 23:50:25] [INFO ] Deduced a trap composed of 4 places in 252 ms of which 1 ms to minimize.
[2024-05-21 23:50:25] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 1 ms to minimize.
[2024-05-21 23:50:26] [INFO ] Deduced a trap composed of 4 places in 255 ms of which 0 ms to minimize.
[2024-05-21 23:50:26] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 20/402 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 23:50:26] [INFO ] Deduced a trap composed of 4 places in 271 ms of which 0 ms to minimize.
[2024-05-21 23:50:26] [INFO ] Deduced a trap composed of 4 places in 259 ms of which 0 ms to minimize.
[2024-05-21 23:50:27] [INFO ] Deduced a trap composed of 4 places in 258 ms of which 1 ms to minimize.
[2024-05-21 23:50:27] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 1 ms to minimize.
[2024-05-21 23:50:27] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 1 ms to minimize.
[2024-05-21 23:50:27] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 0 ms to minimize.
[2024-05-21 23:50:28] [INFO ] Deduced a trap composed of 4 places in 222 ms of which 1 ms to minimize.
[2024-05-21 23:50:28] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 1 ms to minimize.
[2024-05-21 23:50:28] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 1 ms to minimize.
[2024-05-21 23:50:28] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 0 ms to minimize.
[2024-05-21 23:50:29] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 0 ms to minimize.
[2024-05-21 23:50:29] [INFO ] Deduced a trap composed of 4 places in 222 ms of which 2 ms to minimize.
[2024-05-21 23:50:29] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 0 ms to minimize.
[2024-05-21 23:50:29] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 1 ms to minimize.
[2024-05-21 23:50:29] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 0 ms to minimize.
[2024-05-21 23:50:30] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 0 ms to minimize.
[2024-05-21 23:50:30] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 0 ms to minimize.
[2024-05-21 23:50:30] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 1 ms to minimize.
[2024-05-21 23:50:30] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 0 ms to minimize.
[2024-05-21 23:50:30] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 20/422 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 23:50:31] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 1 ms to minimize.
[2024-05-21 23:50:31] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 1 ms to minimize.
[2024-05-21 23:50:31] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 1 ms to minimize.
[2024-05-21 23:50:31] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 0 ms to minimize.
[2024-05-21 23:50:32] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 0 ms to minimize.
[2024-05-21 23:50:32] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 0 ms to minimize.
[2024-05-21 23:50:32] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 1 ms to minimize.
[2024-05-21 23:50:32] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 1 ms to minimize.
[2024-05-21 23:50:32] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 1 ms to minimize.
[2024-05-21 23:50:33] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 1 ms to minimize.
[2024-05-21 23:50:33] [INFO ] Deduced a trap composed of 4 places in 228 ms of which 1 ms to minimize.
[2024-05-21 23:50:33] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 0 ms to minimize.
[2024-05-21 23:50:33] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 1 ms to minimize.
[2024-05-21 23:50:34] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 0 ms to minimize.
[2024-05-21 23:50:34] [INFO ] Deduced a trap composed of 4 places in 222 ms of which 0 ms to minimize.
[2024-05-21 23:50:34] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 0 ms to minimize.
[2024-05-21 23:50:34] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 0 ms to minimize.
[2024-05-21 23:50:34] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 1 ms to minimize.
[2024-05-21 23:50:35] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 1 ms to minimize.
[2024-05-21 23:50:35] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 20/442 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 23:50:35] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 1 ms to minimize.
[2024-05-21 23:50:35] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 0 ms to minimize.
[2024-05-21 23:50:35] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 1 ms to minimize.
[2024-05-21 23:50:36] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 1 ms to minimize.
[2024-05-21 23:50:36] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 0 ms to minimize.
[2024-05-21 23:50:36] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 0 ms to minimize.
[2024-05-21 23:50:36] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 0 ms to minimize.
[2024-05-21 23:50:37] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 0 ms to minimize.
[2024-05-21 23:50:37] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 0 ms to minimize.
[2024-05-21 23:50:37] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 0 ms to minimize.
[2024-05-21 23:50:37] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 0 ms to minimize.
[2024-05-21 23:50:37] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 0 ms to minimize.
[2024-05-21 23:50:38] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 0 ms to minimize.
[2024-05-21 23:50:38] [INFO ] Deduced a trap composed of 4 places in 250 ms of which 1 ms to minimize.
[2024-05-21 23:50:38] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 1 ms to minimize.
[2024-05-21 23:50:38] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 1 ms to minimize.
[2024-05-21 23:50:39] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 0 ms to minimize.
[2024-05-21 23:50:39] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 1 ms to minimize.
[2024-05-21 23:50:39] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 0 ms to minimize.
[2024-05-21 23:50:39] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 20/462 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 23:50:39] [INFO ] Deduced a trap composed of 4 places in 252 ms of which 0 ms to minimize.
[2024-05-21 23:50:40] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 0 ms to minimize.
[2024-05-21 23:50:40] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 0 ms to minimize.
[2024-05-21 23:50:41] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 0 ms to minimize.
[2024-05-21 23:50:41] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 0 ms to minimize.
[2024-05-21 23:50:41] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 0 ms to minimize.
[2024-05-21 23:50:41] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 1 ms to minimize.
[2024-05-21 23:50:41] [INFO ] Deduced a trap composed of 4 places in 219 ms of which 1 ms to minimize.
[2024-05-21 23:50:42] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 1 ms to minimize.
[2024-05-21 23:50:42] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 0 ms to minimize.
[2024-05-21 23:50:42] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 1 ms to minimize.
[2024-05-21 23:50:42] [INFO ] Deduced a trap composed of 4 places in 229 ms of which 0 ms to minimize.
[2024-05-21 23:50:43] [INFO ] Deduced a trap composed of 4 places in 215 ms of which 1 ms to minimize.
[2024-05-21 23:50:43] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 0 ms to minimize.
[2024-05-21 23:50:43] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 0 ms to minimize.
[2024-05-21 23:50:43] [INFO ] Deduced a trap composed of 4 places in 233 ms of which 0 ms to minimize.
[2024-05-21 23:50:44] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 0 ms to minimize.
[2024-05-21 23:50:44] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 1 ms to minimize.
[2024-05-21 23:50:44] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 1 ms to minimize.
[2024-05-21 23:50:44] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 20/482 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 23:50:45] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 1 ms to minimize.
[2024-05-21 23:50:45] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 1 ms to minimize.
[2024-05-21 23:50:45] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 1 ms to minimize.
[2024-05-21 23:50:45] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 1 ms to minimize.
[2024-05-21 23:50:45] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 1 ms to minimize.
[2024-05-21 23:50:46] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 0 ms to minimize.
[2024-05-21 23:50:46] [INFO ] Deduced a trap composed of 4 places in 234 ms of which 0 ms to minimize.
[2024-05-21 23:50:46] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 1 ms to minimize.
[2024-05-21 23:50:46] [INFO ] Deduced a trap composed of 4 places in 211 ms of which 0 ms to minimize.
[2024-05-21 23:50:46] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 0 ms to minimize.
[2024-05-21 23:50:47] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 0 ms to minimize.
[2024-05-21 23:50:47] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 0 ms to minimize.
[2024-05-21 23:50:47] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 0 ms to minimize.
[2024-05-21 23:50:47] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 1 ms to minimize.
[2024-05-21 23:50:48] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 0 ms to minimize.
[2024-05-21 23:50:48] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 0 ms to minimize.
[2024-05-21 23:50:48] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 1 ms to minimize.
[2024-05-21 23:50:48] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 0 ms to minimize.
[2024-05-21 23:50:49] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 1 ms to minimize.
[2024-05-21 23:50:49] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/255 variables, 20/502 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 23:50:49] [INFO ] Deduced a trap composed of 4 places in 169 ms of which 0 ms to minimize.
[2024-05-21 23:50:49] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 0 ms to minimize.
[2024-05-21 23:50:50] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 1 ms to minimize.
[2024-05-21 23:50:50] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 0 ms to minimize.
[2024-05-21 23:50:50] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 1 ms to minimize.
[2024-05-21 23:50:50] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 0 ms to minimize.
[2024-05-21 23:50:51] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 0 ms to minimize.
[2024-05-21 23:50:51] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 1 ms to minimize.
[2024-05-21 23:50:51] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/255 variables, 9/511 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/255 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 77/332 variables, 59/570 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/332 variables, 77/647 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 23:50:52] [INFO ] Deduced a trap composed of 4 places in 234 ms of which 1 ms to minimize.
[2024-05-21 23:50:52] [INFO ] Deduced a trap composed of 4 places in 216 ms of which 1 ms to minimize.
[2024-05-21 23:50:52] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 0 ms to minimize.
[2024-05-21 23:50:53] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 0 ms to minimize.
[2024-05-21 23:50:53] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 1 ms to minimize.
[2024-05-21 23:50:53] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 0 ms to minimize.
[2024-05-21 23:50:53] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 1 ms to minimize.
[2024-05-21 23:50:53] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 0 ms to minimize.
[2024-05-21 23:50:54] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 0 ms to minimize.
[2024-05-21 23:50:54] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 0 ms to minimize.
[2024-05-21 23:50:54] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 0 ms to minimize.
[2024-05-21 23:50:54] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 0 ms to minimize.
[2024-05-21 23:50:55] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 1 ms to minimize.
[2024-05-21 23:50:55] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 1 ms to minimize.
[2024-05-21 23:50:55] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 1 ms to minimize.
[2024-05-21 23:50:55] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 1 ms to minimize.
[2024-05-21 23:50:55] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 0 ms to minimize.
[2024-05-21 23:50:56] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 1 ms to minimize.
[2024-05-21 23:50:56] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 0 ms to minimize.
[2024-05-21 23:50:56] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/332 variables, 20/667 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 23:50:57] [INFO ] Deduced a trap composed of 5 places in 208 ms of which 0 ms to minimize.
[2024-05-21 23:50:57] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 1 ms to minimize.
[2024-05-21 23:50:57] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 0 ms to minimize.
[2024-05-21 23:50:57] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 0 ms to minimize.
[2024-05-21 23:50:57] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 1 ms to minimize.
[2024-05-21 23:50:58] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 0 ms to minimize.
[2024-05-21 23:50:58] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 1 ms to minimize.
[2024-05-21 23:50:58] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 0 ms to minimize.
[2024-05-21 23:50:58] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 0 ms to minimize.
[2024-05-21 23:50:58] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 0 ms to minimize.
[2024-05-21 23:50:59] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 0 ms to minimize.
[2024-05-21 23:50:59] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 0 ms to minimize.
[2024-05-21 23:50:59] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 0 ms to minimize.
[2024-05-21 23:50:59] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 1 ms to minimize.
[2024-05-21 23:50:59] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 0 ms to minimize.
[2024-05-21 23:51:00] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 0 ms to minimize.
[2024-05-21 23:51:00] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 1 ms to minimize.
[2024-05-21 23:51:00] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 0 ms to minimize.
[2024-05-21 23:51:00] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 0 ms to minimize.
[2024-05-21 23:51:00] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/332 variables, 20/687 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 23:51:01] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 0 ms to minimize.
[2024-05-21 23:51:01] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 0 ms to minimize.
[2024-05-21 23:51:01] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 0 ms to minimize.
[2024-05-21 23:51:01] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 1 ms to minimize.
[2024-05-21 23:51:02] [INFO ] Deduced a trap composed of 4 places in 169 ms of which 0 ms to minimize.
[2024-05-21 23:51:02] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 0 ms to minimize.
[2024-05-21 23:51:02] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 0 ms to minimize.
[2024-05-21 23:51:02] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 1 ms to minimize.
[2024-05-21 23:51:02] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 1 ms to minimize.
[2024-05-21 23:51:03] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 0 ms to minimize.
[2024-05-21 23:51:03] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 1 ms to minimize.
[2024-05-21 23:51:03] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 0 ms to minimize.
[2024-05-21 23:51:03] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 0 ms to minimize.
[2024-05-21 23:51:03] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 1 ms to minimize.
[2024-05-21 23:51:04] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 1 ms to minimize.
[2024-05-21 23:51:04] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/332 variables, 16/703 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 23:51:04] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 1 ms to minimize.
[2024-05-21 23:51:05] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 0 ms to minimize.
[2024-05-21 23:51:05] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 1 ms to minimize.
[2024-05-21 23:51:05] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/332 variables, 4/707 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 0 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 0 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 1 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 0 ms to minimize.
[2024-05-21 23:51:07] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 0 ms to minimize.
[2024-05-21 23:51:07] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/332 variables, 6/713 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/332 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 18/350 variables, 18/731 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/350 variables, 18/749 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/350 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 332/682 variables, 350/1099 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/682 variables, 0/1099 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 234/916 variables, 200/1299 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 23:51:10] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 0 ms to minimize.
[2024-05-21 23:51:11] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 1 ms to minimize.
[2024-05-21 23:51:11] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 1 ms to minimize.
[2024-05-21 23:51:12] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 1 ms to minimize.
[2024-05-21 23:51:12] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 0 ms to minimize.
[2024-05-21 23:51:12] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 0 ms to minimize.
[2024-05-21 23:51:13] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 0 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/916 variables, 7/1306 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 23:51:13] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 0 ms to minimize.
[2024-05-21 23:51:13] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 1 ms to minimize.
[2024-05-21 23:51:13] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 0 ms to minimize.
[2024-05-21 23:51:14] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 1 ms to minimize.
[2024-05-21 23:51:14] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 0 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/916 variables, 5/1311 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 23:51:15] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 0 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/916 variables, 1/1312 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/916 variables, 0/1312 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (OVERLAPS) 585/1501 variables, 351/1663 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1501 variables, 351/2014 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1501 variables, 117/2131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1501 variables, 6/2137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 23:51:18] [INFO ] Deduced a trap composed of 4 places in 729 ms of which 1 ms to minimize.
[2024-05-21 23:51:19] [INFO ] Deduced a trap composed of 4 places in 691 ms of which 1 ms to minimize.
[2024-05-21 23:51:20] [INFO ] Deduced a trap composed of 4 places in 698 ms of which 1 ms to minimize.
[2024-05-21 23:51:21] [INFO ] Deduced a trap composed of 4 places in 677 ms of which 1 ms to minimize.
[2024-05-21 23:51:21] [INFO ] Deduced a trap composed of 4 places in 757 ms of which 1 ms to minimize.
[2024-05-21 23:51:22] [INFO ] Deduced a trap composed of 4 places in 680 ms of which 1 ms to minimize.
[2024-05-21 23:51:23] [INFO ] Deduced a trap composed of 4 places in 644 ms of which 1 ms to minimize.
[2024-05-21 23:51:24] [INFO ] Deduced a trap composed of 4 places in 631 ms of which 1 ms to minimize.
[2024-05-21 23:51:24] [INFO ] Deduced a trap composed of 4 places in 636 ms of which 1 ms to minimize.
[2024-05-21 23:51:25] [INFO ] Deduced a trap composed of 4 places in 638 ms of which 1 ms to minimize.
[2024-05-21 23:51:26] [INFO ] Deduced a trap composed of 4 places in 621 ms of which 1 ms to minimize.
[2024-05-21 23:51:26] [INFO ] Deduced a trap composed of 4 places in 689 ms of which 1 ms to minimize.
[2024-05-21 23:51:27] [INFO ] Deduced a trap composed of 4 places in 615 ms of which 1 ms to minimize.
[2024-05-21 23:51:28] [INFO ] Deduced a trap composed of 4 places in 594 ms of which 1 ms to minimize.
[2024-05-21 23:51:28] [INFO ] Deduced a trap composed of 4 places in 601 ms of which 1 ms to minimize.
SMT process timed out in 77352ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 99 out of 818 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 818/818 places, 40400/40400 transitions.
Applied a total of 0 rules in 759 ms. Remains 818 /818 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 759 ms. Remains : 818/818 places, 40400/40400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 818/818 places, 40400/40400 transitions.
Applied a total of 0 rules in 723 ms. Remains 818 /818 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-21 23:51:30] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-21 23:51:30] [INFO ] Invariant cache hit.
[2024-05-21 23:51:38] [INFO ] Implicit Places using invariants in 8125 ms returned []
Implicit Place search using SMT only with invariants took 8128 ms to find 0 implicit places.
Running 40200 sub problems to find dead transitions.
[2024-05-21 23:51:38] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-21 23:51:38] [INFO ] Invariant cache hit.
[2024-05-21 23:51:39] [INFO ] State equation strengthened by 200 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Dekker-PT-200

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 1000
TRANSITIONS: 40400
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 320400
NUPN UNITS: 402
LOADING TIME: 793.764

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.791
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 796.521
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1896
MODEL NAME: /home/mcc/execution/model
1000 places, 40400 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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

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="Dekker-PT-200"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is Dekker-PT-200, 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 r135-tall-171631130400126"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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