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.r528-tall-171683760400135.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 ShieldIIPs-PT-040A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683760400135
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 740K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 15:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 11 15:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 15:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 11 15:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 338K May 18 16:43 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 ShieldIIPs-PT-040A-ReachabilityFireability-2024-00
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-2024-01
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-2024-02
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-2024-03
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-2024-04
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-2024-05
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-2024-06
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-2024-07
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-2024-08
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-2024-09
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-2024-10
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-2024-11
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-2024-12
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-2024-13
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-2024-14
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717228901244

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-040A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:01:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 08:01:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:01:42] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2024-06-01 08:01:42] [INFO ] Transformed 1003 places.
[2024-06-01 08:01:42] [INFO ] Transformed 963 transitions.
[2024-06-01 08:01:42] [INFO ] Found NUPN structural information;
[2024-06-01 08:01:42] [INFO ] Parsed PT model containing 1003 places and 963 transitions and 4326 arcs in 245 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (16 resets) in 2285 ms. (17 steps per ms) remains 6/16 properties
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 290 ms. (137 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 628 ms. (63 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1424 ms. (28 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 347 ms. (114 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 403 ms. (99 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 334 ms. (119 steps per ms) remains 6/6 properties
// Phase 1: matrix 963 rows 1003 cols
[2024-06-01 08:01:44] [INFO ] Computed 361 invariants in 16 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 286/286 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 361/647 variables, 211/497 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/647 variables, 361/858 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/647 variables, 0/858 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 356/1003 variables, 150/1008 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1003 variables, 356/1364 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1003 variables, 0/1364 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 963/1966 variables, 1003/2367 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1966 variables, 0/2367 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/1966 variables, 0/2367 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1966/1966 variables, and 2367 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1518 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 1003/1003 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/286 variables, 286/286 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 361/647 variables, 211/497 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/647 variables, 361/858 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/647 variables, 0/858 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 356/1003 variables, 150/1008 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1003 variables, 356/1364 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 08:01:46] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 11 ms to minimize.
[2024-06-01 08:01:46] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1003 variables, 2/1366 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1003 variables, 0/1366 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 963/1966 variables, 1003/2369 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1966 variables, 6/2375 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 08:01:50] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1966 variables, 1/2376 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1966/1966 variables, and 2376 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5009 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 1003/1003 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 6764ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 286 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1003 transition count 962
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1002 transition count 962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1001 transition count 961
Partial Free-agglomeration rule applied 156 times.
Drop transitions (Partial Free agglomeration) removed 156 transitions
Iterating global reduction 0 with 156 rules applied. Total rules applied 160 place count 1001 transition count 961
Applied a total of 160 rules in 220 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 233 ms. Remains : 1001/1003 places, 961/963 transitions.
RANDOM walk for 40000 steps (16 resets) in 1106 ms. (36 steps per ms) remains 5/6 properties
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 449 ms. (88 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 335 ms. (119 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 301 ms. (132 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 326 ms. (122 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 272 ms. (146 steps per ms) remains 5/5 properties
// Phase 1: matrix 961 rows 1001 cols
[2024-06-01 08:01:52] [INFO ] Computed 361 invariants in 9 ms
[2024-06-01 08:01:52] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 281/281 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 363/644 variables, 210/491 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/644 variables, 363/854 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/644 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 357/1001 variables, 151/1005 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1001 variables, 357/1362 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1001 variables, 0/1362 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 961/1962 variables, 1001/2363 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1962 variables, 4/2367 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1962 variables, 0/2367 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/1962 variables, 0/2367 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1962/1962 variables, and 2367 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1341 ms.
Refiners :[Domain max(s): 1001/1001 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 1001/1001 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 281/281 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 363/644 variables, 210/491 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/644 variables, 363/854 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 08:01:54] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/644 variables, 1/855 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 08:01:54] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/644 variables, 1/856 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/644 variables, 0/856 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 357/1001 variables, 151/1007 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1001 variables, 357/1364 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 08:01:54] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-06-01 08:01:54] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-06-01 08:01:54] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-06-01 08:01:54] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1001 variables, 4/1368 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1001 variables, 0/1368 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 961/1962 variables, 1001/2369 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1962 variables, 4/2373 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1962 variables, 5/2378 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 08:01:57] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 2 ms to minimize.
[2024-06-01 08:01:57] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-06-01 08:01:57] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2024-06-01 08:01:58] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-06-01 08:01:58] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
[2024-06-01 08:01:58] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 0 ms to minimize.
[2024-06-01 08:01:58] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-06-01 08:01:58] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:01:58] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-06-01 08:01:59] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:01:59] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1962 variables, 11/2389 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 08:02:01] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1962 variables, 1/2390 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1962 variables, 0/2390 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/1962 variables, 0/2390 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1962/1962 variables, and 2390 constraints, problems are : Problem set: 0 solved, 5 unsolved in 11512 ms.
Refiners :[Domain max(s): 1001/1001 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 1001/1001 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 18/18 constraints]
After SMT, in 12975ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 6143 ms.
Support contains 281 out of 1001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1001 transition count 961
Applied a total of 2 rules in 70 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 1001/1001 places, 961/961 transitions.
RANDOM walk for 40000 steps (16 resets) in 613 ms. (65 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 343 ms. (116 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 278 ms. (143 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 266 ms. (149 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 304 ms. (131 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 122233 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 5
Probabilistic random walk after 122233 steps, saw 113340 distinct states, run finished after 3004 ms. (steps per millisecond=40 ) properties seen :0
// Phase 1: matrix 961 rows 1001 cols
[2024-06-01 08:02:15] [INFO ] Computed 361 invariants in 6 ms
[2024-06-01 08:02:15] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 281/281 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 363/644 variables, 210/491 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/644 variables, 363/854 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/644 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 357/1001 variables, 151/1005 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1001 variables, 357/1362 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1001 variables, 0/1362 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 961/1962 variables, 1001/2363 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1962 variables, 4/2367 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1962 variables, 0/2367 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/1962 variables, 0/2367 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1962/1962 variables, and 2367 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1163 ms.
Refiners :[Domain max(s): 1001/1001 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 1001/1001 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 281/281 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 363/644 variables, 210/491 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/644 variables, 363/854 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 08:02:16] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/644 variables, 1/855 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 08:02:16] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/644 variables, 1/856 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/644 variables, 0/856 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 357/1001 variables, 151/1007 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1001 variables, 357/1364 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 08:02:17] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-06-01 08:02:17] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:02:17] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-06-01 08:02:17] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1001 variables, 4/1368 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1001 variables, 0/1368 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 961/1962 variables, 1001/2369 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1962 variables, 4/2373 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1962 variables, 5/2378 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 08:02:19] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2024-06-01 08:02:20] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-06-01 08:02:20] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-06-01 08:02:20] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2024-06-01 08:02:20] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 2 ms to minimize.
[2024-06-01 08:02:20] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2024-06-01 08:02:21] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 4 ms to minimize.
[2024-06-01 08:02:21] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:02:21] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:02:22] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1962 variables, 10/2388 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1962 variables, 0/2388 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/1962 variables, 0/2388 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1962/1962 variables, and 2388 constraints, problems are : Problem set: 0 solved, 5 unsolved in 12073 ms.
Refiners :[Domain max(s): 1001/1001 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 1001/1001 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 16/16 constraints]
After SMT, in 13352ms problems are : Problem set: 0 solved, 5 unsolved
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-2024-15 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 11504 ms.
Support contains 259 out of 1001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 1001 transition count 961
Applied a total of 8 rules in 69 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 1001/1001 places, 961/961 transitions.
RANDOM walk for 40000 steps (16 resets) in 570 ms. (70 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 413 ms. (96 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 289 ms. (137 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 255 ms. (156 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 299 ms. (133 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 150758 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 4
Probabilistic random walk after 150758 steps, saw 139085 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
// Phase 1: matrix 961 rows 1001 cols
[2024-06-01 08:02:43] [INFO ] Computed 361 invariants in 12 ms
[2024-06-01 08:02:43] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 259/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/259 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 361/620 variables, 200/459 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/620 variables, 361/820 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/620 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 381/1001 variables, 161/981 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1001 variables, 381/1362 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1001 variables, 0/1362 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 961/1962 variables, 1001/2363 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1962 variables, 4/2367 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1962 variables, 0/2367 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/1962 variables, 0/2367 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1962/1962 variables, and 2367 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1046 ms.
Refiners :[Domain max(s): 1001/1001 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 1001/1001 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 259/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/259 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 361/620 variables, 200/459 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/620 variables, 361/820 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/620 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 381/1001 variables, 161/981 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1001 variables, 381/1362 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:02:45] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:02:45] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 2 ms to minimize.
[2024-06-01 08:02:45] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1001 variables, 3/1365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:02:45] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-01 08:02:45] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1001 variables, 2/1367 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1001 variables, 0/1367 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 961/1962 variables, 1001/2368 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1962 variables, 4/2372 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1962 variables, 4/2376 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:02:48] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:02:48] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2024-06-01 08:02:48] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-06-01 08:02:48] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2024-06-01 08:02:49] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2024-06-01 08:02:49] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-06-01 08:02:49] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:02:49] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-06-01 08:02:49] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-06-01 08:02:50] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1962 variables, 10/2386 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1962 variables, 0/2386 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/1962 variables, 0/2386 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1962/1962 variables, and 2386 constraints, problems are : Problem set: 0 solved, 4 unsolved in 9205 ms.
Refiners :[Domain max(s): 1001/1001 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 1001/1001 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 15/15 constraints]
After SMT, in 10366ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 10082 ms.
Support contains 259 out of 1001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Applied a total of 0 rules in 34 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 1001/1001 places, 961/961 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Applied a total of 0 rules in 21 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2024-06-01 08:03:04] [INFO ] Invariant cache hit.
[2024-06-01 08:03:04] [INFO ] Implicit Places using invariants in 552 ms returned [987]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 561 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1000/1001 places, 961/961 transitions.
Applied a total of 0 rules in 19 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 602 ms. Remains : 1000/1001 places, 961/961 transitions.
RANDOM walk for 40000 steps (16 resets) in 599 ms. (66 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 434 ms. (91 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 343 ms. (116 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 261 ms. (152 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 306 ms. (130 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 143787 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :0 out of 4
Probabilistic random walk after 143787 steps, saw 132673 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
// Phase 1: matrix 961 rows 1000 cols
[2024-06-01 08:03:08] [INFO ] Computed 360 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 259/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/259 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 361/620 variables, 200/459 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/620 variables, 361/820 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/620 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 380/1000 variables, 160/980 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1000 variables, 380/1360 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 0/1360 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 961/1961 variables, 1000/2360 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1961 variables, 0/2360 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1961 variables, 0/2360 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1961/1961 variables, and 2360 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1033 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 1000/1000 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 259/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/259 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 361/620 variables, 200/459 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/620 variables, 361/820 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/620 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 380/1000 variables, 160/980 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1000 variables, 380/1360 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:03:09] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-06-01 08:03:09] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-06-01 08:03:09] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 3/1363 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:03:10] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1000 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:03:10] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-06-01 08:03:10] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1000 variables, 2/1366 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1000 variables, 0/1366 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 961/1961 variables, 1000/2366 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1961 variables, 4/2370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:03:12] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
[2024-06-01 08:03:13] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-06-01 08:03:13] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 0 ms to minimize.
[2024-06-01 08:03:13] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-06-01 08:03:13] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-06-01 08:03:13] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 08:03:13] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:03:13] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-06-01 08:03:14] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-06-01 08:03:14] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1961 variables, 10/2380 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1961 variables, 0/2380 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/1961 variables, 0/2380 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1961/1961 variables, and 2380 constraints, problems are : Problem set: 0 solved, 4 unsolved in 8452 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 1000/1000 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 16/16 constraints]
After SMT, in 9593ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 7171 ms.
Support contains 259 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 961/961 transitions.
Applied a total of 0 rules in 18 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 1000/1000 places, 961/961 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 961/961 transitions.
Applied a total of 0 rules in 18 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2024-06-01 08:03:25] [INFO ] Invariant cache hit.
[2024-06-01 08:03:25] [INFO ] Implicit Places using invariants in 528 ms returned []
[2024-06-01 08:03:25] [INFO ] Invariant cache hit.
[2024-06-01 08:03:26] [INFO ] Implicit Places using invariants and state equation in 1034 ms returned []
Implicit Place search using SMT with State Equation took 1564 ms to find 0 implicit places.
[2024-06-01 08:03:26] [INFO ] Redundant transitions in 93 ms returned []
Running 960 sub problems to find dead transitions.
[2024-06-01 08:03:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (OVERLAPS) 1/1000 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 1.0)
(s60 1.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 1.0)
(s85 1.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 1.0)
(s135 1.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 1.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 1.0)
(s185 1.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 1.0)
(s210 1.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 1.0)
(s235 1.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 1.0)
(s260 1.0)
(s261 0.0)
(s262 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 1/1360 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1961 variables, and 1360 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30041 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (OVERLAPS) 1/1000 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 1/1360 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 08:04:12] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-01 08:04:14] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-06-01 08:04:14] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-06-01 08:04:14] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:04:14] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-06-01 08:04:14] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:04:14] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:04:15] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-06-01 08:04:15] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-06-01 08:04:15] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:04:15] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:04:15] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:04:16] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:04:16] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:04:16] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-06-01 08:04:16] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:04:16] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:04:16] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:04:16] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-06-01 08:04:17] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1000 variables, 20/1380 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 08:04:17] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:04:23] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:04:23] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-06-01 08:04:24] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:04:24] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-06-01 08:04:24] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-06-01 08:04:24] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:04:24] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-06-01 08:04:24] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:04:25] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:04:25] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:04:25] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:04:25] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-06-01 08:04:25] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:04:26] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:04:26] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:04:26] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:04:26] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-06-01 08:04:26] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:04:26] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1000 variables, 20/1400 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 08:04:27] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1961 variables, and 1401 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30020 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 41/41 constraints]
After SMT, in 60459ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60469ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62158 ms. Remains : 1000/1000 places, 961/961 transitions.
[2024-06-01 08:04:27] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2024-06-01 08:04:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1000 places, 961 transitions and 4677 arcs took 11 ms.
[2024-06-01 08:04:27] [INFO ] Flatten gal took : 176 ms
Total runtime 165274 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 : ShieldIIPs-PT-040A-ReachabilityFireability-2024-04
Could not compute solution for formula : ShieldIIPs-PT-040A-ReachabilityFireability-2024-09
Could not compute solution for formula : ShieldIIPs-PT-040A-ReachabilityFireability-2024-11
Could not compute solution for formula : ShieldIIPs-PT-040A-ReachabilityFireability-2024-12

BK_STOP 1717229067942

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name ShieldIIPs-PT-040A-ReachabilityFireability-2024-04
rfs formula type AG
rfs formula formula --invariant=/tmp/901/inv_0_
rfs formula name ShieldIIPs-PT-040A-ReachabilityFireability-2024-09
rfs formula type EF
rfs formula formula --invariant=/tmp/901/inv_1_
rfs formula name ShieldIIPs-PT-040A-ReachabilityFireability-2024-11
rfs formula type EF
rfs formula formula --invariant=/tmp/901/inv_2_
rfs formula name ShieldIIPs-PT-040A-ReachabilityFireability-2024-12
rfs formula type AG
rfs formula formula --invariant=/tmp/901/inv_3_
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="ShieldIIPs-PT-040A"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldIIPs-PT-040A, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r528-tall-171683760400135"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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