fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r528-tall-171683761900823
Last Updated
July 7, 2024

About the Execution of LTSMin+red for ShieldRVs-PT-030A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
649.972 71520.00 101202.00 182.90 TTTTTTFT?TFFTTFT normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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.7K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 12 18:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 17:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Apr 12 17:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 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 191K 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 ShieldRVs-PT-030A-ReachabilityFireability-2024-00
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-2024-01
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-2024-02
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-2024-03
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-2024-04
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-2024-05
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-2024-06
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-2024-07
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-2024-08
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-2024-09
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-2024-10
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-2024-11
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-2024-12
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-2024-13
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-2024-14
FORMULA_NAME ShieldRVs-PT-030A-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717268029039

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-030A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 18:53:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 18:53:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 18:53:50] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2024-06-01 18:53:50] [INFO ] Transformed 423 places.
[2024-06-01 18:53:50] [INFO ] Transformed 573 transitions.
[2024-06-01 18:53:50] [INFO ] Found NUPN structural information;
[2024-06-01 18:53:50] [INFO ] Parsed PT model containing 423 places and 573 transitions and 2760 arcs in 217 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (96 resets) in 1466 ms. (27 steps per ms) remains 3/16 properties
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 389 ms. (102 steps per ms) remains 1/3 properties
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVs-PT-030A-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (12 resets) in 228 ms. (174 steps per ms) remains 1/1 properties
// Phase 1: matrix 573 rows 423 cols
[2024-06-01 18:53:51] [INFO ] Computed 121 invariants in 23 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 70/99 variables, 27/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 70/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 324/423 variables, 94/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 324/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 573/996 variables, 423/967 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/996 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/996 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 996/996 variables, and 967 constraints, problems are : Problem set: 0 solved, 1 unsolved in 508 ms.
Refiners :[Domain max(s): 423/423 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 423/423 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 70/99 variables, 27/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 70/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 324/423 variables, 94/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 324/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 18:53:52] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 12 ms to minimize.
[2024-06-01 18:53:52] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 2/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 573/996 variables, 423/969 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/996 variables, 1/970 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 18:53:52] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 2 ms to minimize.
[2024-06-01 18:53:52] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-06-01 18:53:52] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/996 variables, 3/973 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 18:53:52] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/996 variables, 1/974 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 18:53:53] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/996 variables, 1/975 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 18:53:53] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/996 variables, 1/976 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/996 variables, 0/976 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/996 variables, 0/976 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 996/996 variables, and 976 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1475 ms.
Refiners :[Domain max(s): 423/423 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 423/423 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 2084ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 362 ms.
Support contains 29 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 573/573 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 422 transition count 572
Partial Free-agglomeration rule applied 60 times.
Drop transitions (Partial Free agglomeration) removed 60 transitions
Iterating global reduction 0 with 60 rules applied. Total rules applied 62 place count 422 transition count 572
Applied a total of 62 rules in 111 ms. Remains 422 /423 variables (removed 1) and now considering 572/573 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 422/423 places, 572/573 transitions.
RANDOM walk for 40000 steps (110 resets) in 453 ms. (88 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (12 resets) in 255 ms. (156 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 520027 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :0 out of 1
Probabilistic random walk after 520027 steps, saw 102770 distinct states, run finished after 3005 ms. (steps per millisecond=173 ) properties seen :0
// Phase 1: matrix 572 rows 422 cols
[2024-06-01 18:53:57] [INFO ] Computed 121 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 70/99 variables, 27/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 70/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 323/422 variables, 94/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 323/543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 572/994 variables, 422/965 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/994 variables, 0/965 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/994 variables, 0/965 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 994/994 variables, and 965 constraints, problems are : Problem set: 0 solved, 1 unsolved in 290 ms.
Refiners :[Domain max(s): 422/422 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 422/422 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 70/99 variables, 27/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 70/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 323/422 variables, 94/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 323/543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 18:53:57] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 1 ms to minimize.
[2024-06-01 18:53:57] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-06-01 18:53:57] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-06-01 18:53:57] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-06-01 18:53:57] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 5/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 572/994 variables, 422/970 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/994 variables, 1/971 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 18:53:58] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-06-01 18:53:58] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-06-01 18:53:58] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-06-01 18:53:58] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/994 variables, 4/975 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/994 variables, 0/975 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/994 variables, 0/975 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 994/994 variables, and 975 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1141 ms.
Refiners :[Domain max(s): 422/422 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 422/422 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 1463ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 240 ms.
Support contains 29 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 572/572 transitions.
Applied a total of 0 rules in 27 ms. Remains 422 /422 variables (removed 0) and now considering 572/572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 422/422 places, 572/572 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 572/572 transitions.
Applied a total of 0 rules in 26 ms. Remains 422 /422 variables (removed 0) and now considering 572/572 (removed 0) transitions.
[2024-06-01 18:53:58] [INFO ] Invariant cache hit.
[2024-06-01 18:53:59] [INFO ] Implicit Places using invariants in 246 ms returned []
[2024-06-01 18:53:59] [INFO ] Invariant cache hit.
[2024-06-01 18:53:59] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
[2024-06-01 18:53:59] [INFO ] Redundant transitions in 84 ms returned []
Running 571 sub problems to find dead transitions.
[2024-06-01 18:53:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 421/421 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 2 (OVERLAPS) 1/422 variables, 121/542 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/422 variables, 1/543 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-06-01 18:54:10] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 2 ms to minimize.
[2024-06-01 18:54:11] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 2 ms to minimize.
[2024-06-01 18:54:11] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 2 ms to minimize.
[2024-06-01 18:54:11] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 2 ms to minimize.
[2024-06-01 18:54:11] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 2 ms to minimize.
[2024-06-01 18:54:11] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 2 ms to minimize.
[2024-06-01 18:54:11] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 2 ms to minimize.
[2024-06-01 18:54:11] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 2 ms to minimize.
[2024-06-01 18:54:11] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 2 ms to minimize.
[2024-06-01 18:54:12] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 2 ms to minimize.
[2024-06-01 18:54:12] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 2 ms to minimize.
[2024-06-01 18:54:12] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 2 ms to minimize.
[2024-06-01 18:54:12] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 2 ms to minimize.
[2024-06-01 18:54:12] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 2 ms to minimize.
[2024-06-01 18:54:12] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 2 ms to minimize.
[2024-06-01 18:54:12] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 2 ms to minimize.
[2024-06-01 18:54:13] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 6 ms to minimize.
[2024-06-01 18:54:13] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 2 ms to minimize.
[2024-06-01 18:54:13] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 2 ms to minimize.
[2024-06-01 18:54:13] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/422 variables, 20/563 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-06-01 18:54:13] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2024-06-01 18:54:13] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 2 ms to minimize.
[2024-06-01 18:54:13] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 2 ms to minimize.
[2024-06-01 18:54:13] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 2 ms to minimize.
[2024-06-01 18:54:14] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 2 ms to minimize.
[2024-06-01 18:54:14] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 1 ms to minimize.
[2024-06-01 18:54:14] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 2 ms to minimize.
[2024-06-01 18:54:14] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2024-06-01 18:54:14] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2024-06-01 18:54:14] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-06-01 18:54:14] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 2 ms to minimize.
[2024-06-01 18:54:14] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:54:14] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-06-01 18:54:14] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-06-01 18:54:14] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-06-01 18:54:14] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-06-01 18:54:15] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-06-01 18:54:15] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-06-01 18:54:15] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 5 ms to minimize.
[2024-06-01 18:54:15] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/422 variables, 20/583 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-06-01 18:54:15] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-06-01 18:54:15] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 2 ms to minimize.
[2024-06-01 18:54:15] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-06-01 18:54:15] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-06-01 18:54:15] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 2 ms to minimize.
[2024-06-01 18:54:15] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 2 ms to minimize.
[2024-06-01 18:54:15] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 2 ms to minimize.
[2024-06-01 18:54:16] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 18:54:16] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 2 ms to minimize.
[2024-06-01 18:54:16] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 2 ms to minimize.
[2024-06-01 18:54:16] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 2 ms to minimize.
[2024-06-01 18:54:16] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-06-01 18:54:16] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-06-01 18:54:16] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 2 ms to minimize.
[2024-06-01 18:54:16] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 2 ms to minimize.
[2024-06-01 18:54:17] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 2 ms to minimize.
[2024-06-01 18:54:17] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 1 ms to minimize.
[2024-06-01 18:54:17] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-06-01 18:54:17] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-06-01 18:54:17] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 20/603 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-06-01 18:54:21] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 0 ms to minimize.
[2024-06-01 18:54:21] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-06-01 18:54:21] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-06-01 18:54:21] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-06-01 18:54:21] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-06-01 18:54:21] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2024-06-01 18:54:21] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2024-06-01 18:54:21] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-06-01 18:54:21] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-06-01 18:54:21] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 1 ms to minimize.
[2024-06-01 18:54:21] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 2 ms to minimize.
[2024-06-01 18:54:22] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 2 ms to minimize.
[2024-06-01 18:54:22] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 1 ms to minimize.
[2024-06-01 18:54:22] [INFO ] Deduced a trap composed of 76 places in 114 ms of which 2 ms to minimize.
[2024-06-01 18:54:22] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 2 ms to minimize.
[2024-06-01 18:54:22] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-06-01 18:54:22] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-06-01 18:54:22] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-06-01 18:54:22] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-06-01 18:54:22] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 20/623 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-06-01 18:54:23] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-06-01 18:54:23] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 0 ms to minimize.
[2024-06-01 18:54:23] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-06-01 18:54:23] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-06-01 18:54:23] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-06-01 18:54:23] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2024-06-01 18:54:23] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-06-01 18:54:23] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-06-01 18:54:23] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-06-01 18:54:23] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 2 ms to minimize.
[2024-06-01 18:54:23] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 2 ms to minimize.
[2024-06-01 18:54:24] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 2 ms to minimize.
[2024-06-01 18:54:24] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-06-01 18:54:24] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:54:24] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 2 ms to minimize.
[2024-06-01 18:54:24] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-01 18:54:24] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 2 ms to minimize.
[2024-06-01 18:54:24] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 2 ms to minimize.
[2024-06-01 18:54:24] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:54:25] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 20/643 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-06-01 18:54:25] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-06-01 18:54:25] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-06-01 18:54:25] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:54:25] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 0 ms to minimize.
[2024-06-01 18:54:25] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-06-01 18:54:25] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 2 ms to minimize.
[2024-06-01 18:54:25] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 2 ms to minimize.
[2024-06-01 18:54:26] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 2 ms to minimize.
[2024-06-01 18:54:26] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 2 ms to minimize.
[2024-06-01 18:54:26] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 1 ms to minimize.
[2024-06-01 18:54:26] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-06-01 18:54:26] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 2 ms to minimize.
[2024-06-01 18:54:26] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-06-01 18:54:26] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-06-01 18:54:26] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 2 ms to minimize.
[2024-06-01 18:54:26] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2024-06-01 18:54:27] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2024-06-01 18:54:27] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:54:27] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-06-01 18:54:27] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 20/663 constraints. Problems are: Problem set: 0 solved, 571 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 422/994 variables, and 663 constraints, problems are : Problem set: 0 solved, 571 unsolved in 30039 ms.
Refiners :[Domain max(s): 422/422 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 0/422 constraints, PredecessorRefiner: 571/571 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 0 solved, 571 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 421/421 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 2 (OVERLAPS) 1/422 variables, 121/542 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/422 variables, 1/543 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/422 variables, 120/663 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-06-01 18:54:34] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 2 ms to minimize.
[2024-06-01 18:54:34] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 2 ms to minimize.
[2024-06-01 18:54:34] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 2 ms to minimize.
[2024-06-01 18:54:34] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 18:54:34] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 2 ms to minimize.
[2024-06-01 18:54:35] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-06-01 18:54:35] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-06-01 18:54:35] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-06-01 18:54:35] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-06-01 18:54:35] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-06-01 18:54:35] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 0 ms to minimize.
[2024-06-01 18:54:35] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
[2024-06-01 18:54:35] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 2 ms to minimize.
[2024-06-01 18:54:35] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 2 ms to minimize.
[2024-06-01 18:54:35] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 2 ms to minimize.
[2024-06-01 18:54:35] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2024-06-01 18:54:36] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 1 ms to minimize.
[2024-06-01 18:54:36] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 0 ms to minimize.
[2024-06-01 18:54:36] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-06-01 18:54:36] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/422 variables, 20/683 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-06-01 18:54:36] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2024-06-01 18:54:36] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-06-01 18:54:37] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-06-01 18:54:37] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-01 18:54:37] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-06-01 18:54:37] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-06-01 18:54:37] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2024-06-01 18:54:37] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-06-01 18:54:37] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 0 ms to minimize.
[2024-06-01 18:54:37] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 2 ms to minimize.
[2024-06-01 18:54:37] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-06-01 18:54:37] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2024-06-01 18:54:37] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-06-01 18:54:37] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:54:38] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-06-01 18:54:38] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2024-06-01 18:54:38] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:54:38] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 2 ms to minimize.
[2024-06-01 18:54:38] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-06-01 18:54:38] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 20/703 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-06-01 18:54:38] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 2 ms to minimize.
[2024-06-01 18:54:39] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 2 ms to minimize.
[2024-06-01 18:54:39] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2024-06-01 18:54:39] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:54:39] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-06-01 18:54:39] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 1 ms to minimize.
[2024-06-01 18:54:39] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-06-01 18:54:39] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 1 ms to minimize.
[2024-06-01 18:54:40] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 1 ms to minimize.
[2024-06-01 18:54:40] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 1 ms to minimize.
[2024-06-01 18:54:40] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-06-01 18:54:40] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
[2024-06-01 18:54:40] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 1 ms to minimize.
[2024-06-01 18:54:40] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 2 ms to minimize.
[2024-06-01 18:54:40] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 2 ms to minimize.
[2024-06-01 18:54:40] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 1 ms to minimize.
[2024-06-01 18:54:41] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 1 ms to minimize.
[2024-06-01 18:54:41] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 2 ms to minimize.
[2024-06-01 18:54:41] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 1 ms to minimize.
[2024-06-01 18:54:41] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 20/723 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-06-01 18:54:42] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-06-01 18:54:42] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-06-01 18:54:42] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-06-01 18:54:42] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:54:42] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-06-01 18:54:42] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-06-01 18:54:42] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:54:42] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:54:43] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2024-06-01 18:54:43] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-06-01 18:54:43] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:54:43] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-06-01 18:54:43] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-06-01 18:54:43] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-06-01 18:54:43] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-06-01 18:54:43] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:54:43] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-06-01 18:54:43] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-06-01 18:54:43] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-01 18:54:43] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 20/743 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-06-01 18:54:44] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-06-01 18:54:44] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2024-06-01 18:54:44] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2024-06-01 18:54:44] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:54:44] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:54:44] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 0 ms to minimize.
[2024-06-01 18:54:44] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-01 18:54:45] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2024-06-01 18:54:45] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-06-01 18:54:45] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2024-06-01 18:54:45] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:54:45] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-06-01 18:54:45] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-06-01 18:54:45] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-06-01 18:54:45] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 2 ms to minimize.
[2024-06-01 18:54:45] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-06-01 18:54:45] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-06-01 18:54:45] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2024-06-01 18:54:45] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 0 ms to minimize.
[2024-06-01 18:54:46] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 20/763 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-06-01 18:54:46] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-06-01 18:54:46] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-06-01 18:54:46] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-06-01 18:54:47] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-06-01 18:54:47] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 1 ms to minimize.
[2024-06-01 18:54:47] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-06-01 18:54:47] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-06-01 18:54:47] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-06-01 18:54:47] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:54:47] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-06-01 18:54:47] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2024-06-01 18:54:47] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-06-01 18:54:47] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:54:48] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:54:48] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:54:48] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-06-01 18:54:48] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-06-01 18:54:48] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:54:48] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 4 ms to minimize.
[2024-06-01 18:54:48] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 20/783 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-06-01 18:54:49] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2024-06-01 18:54:49] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-06-01 18:54:49] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-06-01 18:54:49] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-06-01 18:54:49] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2024-06-01 18:54:49] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-06-01 18:54:49] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-06-01 18:54:49] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-06-01 18:54:50] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-06-01 18:54:50] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-06-01 18:54:50] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-06-01 18:54:50] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-06-01 18:54:50] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-06-01 18:54:50] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-06-01 18:54:50] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-06-01 18:54:50] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-06-01 18:54:50] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-06-01 18:54:50] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2024-06-01 18:54:50] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2024-06-01 18:54:50] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 20/803 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-06-01 18:54:51] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-06-01 18:54:51] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:54:51] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:54:51] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-06-01 18:54:51] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-06-01 18:54:51] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-06-01 18:54:52] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2024-06-01 18:54:52] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-06-01 18:54:52] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
[2024-06-01 18:54:52] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 2 ms to minimize.
[2024-06-01 18:54:52] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 1 ms to minimize.
[2024-06-01 18:54:52] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 1 ms to minimize.
[2024-06-01 18:54:52] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 1 ms to minimize.
[2024-06-01 18:54:52] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 1 ms to minimize.
[2024-06-01 18:54:53] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 1 ms to minimize.
[2024-06-01 18:54:53] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 2 ms to minimize.
[2024-06-01 18:54:53] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 1 ms to minimize.
[2024-06-01 18:54:53] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 2 ms to minimize.
[2024-06-01 18:54:53] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 2 ms to minimize.
[2024-06-01 18:54:53] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 20/823 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-06-01 18:54:54] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:54:54] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 0 ms to minimize.
[2024-06-01 18:54:54] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:54:54] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 1 ms to minimize.
[2024-06-01 18:54:54] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:54:54] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:54:54] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-06-01 18:54:55] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-06-01 18:54:55] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:54:55] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-06-01 18:54:55] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-06-01 18:54:55] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-06-01 18:54:55] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-06-01 18:54:55] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
[2024-06-01 18:54:55] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-06-01 18:54:55] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
[2024-06-01 18:54:55] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
[2024-06-01 18:54:56] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 1 ms to minimize.
[2024-06-01 18:54:56] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-06-01 18:54:56] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/422 variables, 20/843 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-06-01 18:54:56] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-06-01 18:54:56] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-01 18:54:56] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-06-01 18:54:56] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-06-01 18:54:57] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:54:57] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 1 ms to minimize.
[2024-06-01 18:54:57] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:54:57] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 0 ms to minimize.
[2024-06-01 18:54:57] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:54:57] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-06-01 18:54:57] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:54:57] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2024-06-01 18:54:57] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 0 ms to minimize.
[2024-06-01 18:54:57] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 1 ms to minimize.
[2024-06-01 18:54:58] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-06-01 18:54:58] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-06-01 18:54:58] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
[2024-06-01 18:54:58] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:54:58] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
[2024-06-01 18:54:58] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 20/863 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-06-01 18:54:59] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-06-01 18:54:59] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-06-01 18:54:59] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-06-01 18:54:59] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:54:59] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:54:59] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-06-01 18:54:59] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-06-01 18:54:59] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 0 ms to minimize.
[2024-06-01 18:54:59] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2024-06-01 18:54:59] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2024-06-01 18:54:59] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 1 ms to minimize.
[2024-06-01 18:54:59] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 0 ms to minimize.
SMT process timed out in 60322ms, After SMT, problems are : Problem set: 0 solved, 571 unsolved
Search for dead transitions found 0 dead transitions in 60331ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61157 ms. Remains : 422/422 places, 572/572 transitions.
[2024-06-01 18:55:00] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2024-06-01 18:55:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 422 places, 572 transitions and 2878 arcs took 10 ms.
[2024-06-01 18:55:00] [INFO ] Flatten gal took : 102 ms
Total runtime 70068 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 : ShieldRVs-PT-030A-ReachabilityFireability-2024-08

BK_STOP 1717268100559

--------------------
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 ShieldRVs-PT-030A-ReachabilityFireability-2024-08
rfs formula type EF
rfs formula formula --invariant=/tmp/1581/inv_0_
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="ShieldRVs-PT-030A"
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 ShieldRVs-PT-030A, 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-171683761900823"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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