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-171683760600207.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 ShieldIIPt-PT-002B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683760600207
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K 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.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 20:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 12 20:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 20:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 12 20:47 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 34K 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 ShieldIIPt-PT-002B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldIIPt-PT-002B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldIIPt-PT-002B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldIIPt-PT-002B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldIIPt-PT-002B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldIIPt-PT-002B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldIIPt-PT-002B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldIIPt-PT-002B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldIIPt-PT-002B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldIIPt-PT-002B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldIIPt-PT-002B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldIIPt-PT-002B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldIIPt-PT-002B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldIIPt-PT-002B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldIIPt-PT-002B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldIIPt-PT-002B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717235388156

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-002B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 09:49:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 09:49:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 09:49:49] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2024-06-01 09:49:49] [INFO ] Transformed 143 places.
[2024-06-01 09:49:49] [INFO ] Transformed 133 transitions.
[2024-06-01 09:49:49] [INFO ] Found NUPN structural information;
[2024-06-01 09:49:49] [INFO ] Parsed PT model containing 143 places and 133 transitions and 330 arcs in 153 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 1408 ms. (28 steps per ms) remains 5/16 properties
FORMULA ShieldIIPt-PT-002B-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-002B-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-002B-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-002B-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-002B-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-002B-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-002B-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-002B-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-002B-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-002B-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-002B-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 281 ms. (141 steps per ms) remains 4/5 properties
FORMULA ShieldIIPt-PT-002B-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 820 ms. (48 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 150 ms. (264 steps per ms) remains 4/4 properties
// Phase 1: matrix 133 rows 143 cols
[2024-06-01 09:49:50] [INFO ] Computed 19 invariants in 16 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem ShieldIIPt-PT-002B-ReachabilityFireability-2024-03 is UNSAT
FORMULA ShieldIIPt-PT-002B-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem ShieldIIPt-PT-002B-ReachabilityFireability-2024-10 is UNSAT
FORMULA ShieldIIPt-PT-002B-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 64/143 variables, 19/98 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 64/162 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/162 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 133/276 variables, 143/305 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/305 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/276 variables, 0/305 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 305 constraints, problems are : Problem set: 2 solved, 2 unsolved in 405 ms.
Refiners :[Domain max(s): 143/143 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 85/134 variables, 16/65 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 85/150 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 09:49:51] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 10 ms to minimize.
[2024-06-01 09:49:51] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-01 09:49:51] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-06-01 09:49:51] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-06-01 09:49:51] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 5/155 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 09:49:51] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 1/156 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/156 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 9/143 variables, 3/159 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 9/168 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 0/168 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 133/276 variables, 143/311 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/276 variables, 2/313 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 09:49:51] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 2 ms to minimize.
[2024-06-01 09:49:51] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 09:49:52] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/276 variables, 3/316 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 09:49:52] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/276 variables, 1/317 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/276 variables, 0/317 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/276 variables, 0/317 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/276 variables, and 317 constraints, problems are : Problem set: 2 solved, 2 unsolved in 1472 ms.
Refiners :[Domain max(s): 143/143 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 10/10 constraints]
After SMT, in 1958ms problems are : Problem set: 2 solved, 2 unsolved
Parikh walk visited 0 properties in 867 ms.
Support contains 49 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 133/133 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 143 transition count 126
Reduce places removed 7 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 15 rules applied. Total rules applied 22 place count 136 transition count 118
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 30 place count 128 transition count 118
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 30 place count 128 transition count 111
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 44 place count 121 transition count 111
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 50 place count 115 transition count 105
Iterating global reduction 3 with 6 rules applied. Total rules applied 56 place count 115 transition count 105
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 56 place count 115 transition count 104
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 114 transition count 104
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 96 place count 95 transition count 85
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 97 place count 95 transition count 85
Applied a total of 97 rules in 41 ms. Remains 95 /143 variables (removed 48) and now considering 85/133 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 95/143 places, 85/133 transitions.
RANDOM walk for 40000 steps (8 resets) in 277 ms. (143 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 124 ms. (320 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 779476 steps, run timeout after 3001 ms. (steps per millisecond=259 ) properties seen :0 out of 2
Probabilistic random walk after 779476 steps, saw 387937 distinct states, run finished after 3008 ms. (steps per millisecond=259 ) properties seen :0
// Phase 1: matrix 85 rows 95 cols
[2024-06-01 09:49:56] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 09:49:56] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/90 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5/95 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 85/180 variables, 95/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/180 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 115 constraints, problems are : Problem set: 0 solved, 2 unsolved in 150 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 95/95 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/90 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:49:56] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-06-01 09:49:56] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-06-01 09:49:56] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-06-01 09:49:56] [INFO ] Deduced a trap composed of 11 places in 16 ms of which 0 ms to minimize.
[2024-06-01 09:49:57] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-06-01 09:49:57] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 1 ms to minimize.
[2024-06-01 09:49:57] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 5/95 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 85/180 variables, 95/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/180 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 124 constraints, problems are : Problem set: 0 solved, 2 unsolved in 466 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 95/95 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 627ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA ShieldIIPt-PT-002B-ReachabilityFireability-2024-15 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 222 ms.
Support contains 31 out of 95 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 85/85 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 95 transition count 81
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 91 transition count 79
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 89 transition count 79
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 89 transition count 78
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 88 transition count 78
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 17 place count 85 transition count 75
Iterating global reduction 3 with 3 rules applied. Total rules applied 20 place count 85 transition count 75
Performed 10 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 40 place count 75 transition count 64
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 42 place count 74 transition count 64
Applied a total of 42 rules in 15 ms. Remains 74 /95 variables (removed 21) and now considering 64/85 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 74/95 places, 64/85 transitions.
RANDOM walk for 40000 steps (8 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2478820 steps, run timeout after 3001 ms. (steps per millisecond=825 ) properties seen :0 out of 1
Probabilistic random walk after 2478820 steps, saw 1062636 distinct states, run finished after 3001 ms. (steps per millisecond=825 ) properties seen :0
// Phase 1: matrix 64 rows 74 cols
[2024-06-01 09:50:00] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 09:50:00] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/69 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/74 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 64/138 variables, 74/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/138 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 96 constraints, problems are : Problem set: 0 solved, 1 unsolved in 92 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 74/74 constraints, ReadFeed: 3/3 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/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/69 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:50:00] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-06-01 09:50:00] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 2 ms to minimize.
[2024-06-01 09:50:00] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 3 ms to minimize.
[2024-06-01 09:50:00] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 5/74 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 64/138 variables, 74/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/138 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 101 constraints, problems are : Problem set: 0 solved, 1 unsolved in 234 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 74/74 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 352ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 31 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 74 /74 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 74/74 places, 64/64 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 74 /74 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-06-01 09:50:00] [INFO ] Invariant cache hit.
[2024-06-01 09:50:00] [INFO ] Implicit Places using invariants in 64 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 73 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 73/74 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 73 /73 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 80 ms. Remains : 73/74 places, 64/64 transitions.
RANDOM walk for 40000 steps (8 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2533210 steps, run timeout after 3001 ms. (steps per millisecond=844 ) properties seen :0 out of 1
Probabilistic random walk after 2533210 steps, saw 1083015 distinct states, run finished after 3001 ms. (steps per millisecond=844 ) properties seen :0
// Phase 1: matrix 64 rows 73 cols
[2024-06-01 09:50:04] [INFO ] Computed 18 invariants in 0 ms
[2024-06-01 09:50:04] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/69 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/73 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 64/137 variables, 73/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/137 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 93 constraints, problems are : Problem set: 0 solved, 1 unsolved in 67 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 73/73 constraints, ReadFeed: 2/2 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/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/69 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:50:04] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-06-01 09:50:04] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-06-01 09:50:04] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-06-01 09:50:04] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 4/73 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 64/137 variables, 73/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:50:04] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 6 ms to minimize.
[2024-06-01 09:50:04] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/137 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 100 constraints, problems are : Problem set: 0 solved, 1 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 73/73 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 390ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 31 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 73 /73 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 73/73 places, 64/64 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 73 /73 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-06-01 09:50:04] [INFO ] Invariant cache hit.
[2024-06-01 09:50:04] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 09:50:04] [INFO ] Invariant cache hit.
[2024-06-01 09:50:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 09:50:04] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-06-01 09:50:04] [INFO ] Redundant transitions in 0 ms returned []
Running 63 sub problems to find dead transitions.
[2024-06-01 09:50:04] [INFO ] Invariant cache hit.
[2024-06-01 09:50:04] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-06-01 09:50:04] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:50:04] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-06-01 09:50:04] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-06-01 09:50:04] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-06-01 09:50:04] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-06-01 09:50:04] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-06-01 09:50:05] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 2 ms to minimize.
[2024-06-01 09:50:05] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 4 ms to minimize.
[2024-06-01 09:50:05] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-06-01 09:50:05] [INFO ] Deduced a trap composed of 7 places in 13 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/137 variables, 73/101 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-06-01 09:50:05] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/137 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 104 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1543 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 73/73 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 11/29 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/137 variables, 73/102 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 63/167 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-06-01 09:50:06] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-06-01 09:50:06] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (OVERLAPS) 0/137 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 169 constraints, problems are : Problem set: 0 solved, 63 unsolved in 2809 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 73/73 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 13/13 constraints]
After SMT, in 4365ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 4366ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4471 ms. Remains : 73/73 places, 64/64 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 3 ms. Remains 73 /73 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-01 09:50:08] [INFO ] Invariant cache hit.
[2024-06-01 09:50:08] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 09:50:08] [INFO ] [Nat]Absence check using 18 positive place invariants in 3 ms returned sat
[2024-06-01 09:50:09] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 09:50:09] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-06-01 09:50:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
TRAPS : Iteration 1
[2024-06-01 09:50:09] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-06-01 09:50:09] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-06-01 09:50:09] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2024-06-01 09:50:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 98 ms
TRAPS : Iteration 2
[2024-06-01 09:50:09] [INFO ] After 229ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 09:50:09] [INFO ] After 277ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 335 ms.
[2024-06-01 09:50:09] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2024-06-01 09:50:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 73 places, 64 transitions and 193 arcs took 3 ms.
[2024-06-01 09:50:09] [INFO ] Flatten gal took : 26 ms
Total runtime 20120 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 : ShieldIIPt-PT-002B-ReachabilityFireability-2024-09

BK_STOP 1717235409622

--------------------
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 ShieldIIPt-PT-002B-ReachabilityFireability-2024-09
rfs formula type AG
rfs formula formula --invariant=/tmp/686/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="ShieldIIPt-PT-002B"
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 ShieldIIPt-PT-002B, 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-171683760600207"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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