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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 912K
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 19:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 21:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 11 21:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 21:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 11 21:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 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 489K 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 ShieldRVt-PT-040B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717277532175

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-040B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 21:32:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 21:32:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 21:32:13] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2024-06-01 21:32:13] [INFO ] Transformed 2003 places.
[2024-06-01 21:32:13] [INFO ] Transformed 2003 transitions.
[2024-06-01 21:32:13] [INFO ] Found NUPN structural information;
[2024-06-01 21:32:13] [INFO ] Parsed PT model containing 2003 places and 2003 transitions and 4726 arcs in 296 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (9 resets) in 2044 ms. (19 steps per ms) remains 11/16 properties
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 308 ms. (129 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 477 ms. (83 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 101 ms. (392 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 103 ms. (384 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 195 ms. (204 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 11/11 properties
// Phase 1: matrix 2003 rows 2003 cols
[2024-06-01 21:32:15] [INFO ] Computed 161 invariants in 35 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 178/178 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 1564/1742 variables, 138/316 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1742 variables, 1564/1880 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1742 variables, 0/1880 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 261/2003 variables, 23/1903 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2003 variables, 261/2164 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2003 variables, 0/2164 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 2003/4006 variables, 2003/4167 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4006 variables, 0/4167 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/4006 variables, 0/4167 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4006/4006 variables, and 4167 constraints, problems are : Problem set: 0 solved, 11 unsolved in 3286 ms.
Refiners :[Domain max(s): 2003/2003 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 2003/2003 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 178/178 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 1564/1742 variables, 138/316 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1742 variables, 1564/1880 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 21:32:19] [INFO ] Deduced a trap composed of 38 places in 413 ms of which 58 ms to minimize.
[2024-06-01 21:32:19] [INFO ] Deduced a trap composed of 21 places in 339 ms of which 7 ms to minimize.
[2024-06-01 21:32:20] [INFO ] Deduced a trap composed of 24 places in 269 ms of which 5 ms to minimize.
[2024-06-01 21:32:20] [INFO ] Deduced a trap composed of 48 places in 278 ms of which 6 ms to minimize.
[2024-06-01 21:32:20] [INFO ] Deduced a trap composed of 78 places in 260 ms of which 6 ms to minimize.
[2024-06-01 21:32:20] [INFO ] Deduced a trap composed of 37 places in 275 ms of which 6 ms to minimize.
[2024-06-01 21:32:21] [INFO ] Deduced a trap composed of 58 places in 261 ms of which 5 ms to minimize.
[2024-06-01 21:32:21] [INFO ] Deduced a trap composed of 56 places in 259 ms of which 4 ms to minimize.
[2024-06-01 21:32:21] [INFO ] Deduced a trap composed of 48 places in 256 ms of which 5 ms to minimize.
[2024-06-01 21:32:22] [INFO ] Deduced a trap composed of 85 places in 244 ms of which 5 ms to minimize.
[2024-06-01 21:32:22] [INFO ] Deduced a trap composed of 72 places in 233 ms of which 5 ms to minimize.
[2024-06-01 21:32:22] [INFO ] Deduced a trap composed of 52 places in 257 ms of which 5 ms to minimize.
[2024-06-01 21:32:22] [INFO ] Deduced a trap composed of 73 places in 245 ms of which 4 ms to minimize.
[2024-06-01 21:32:23] [INFO ] Deduced a trap composed of 61 places in 241 ms of which 5 ms to minimize.
[2024-06-01 21:32:23] [INFO ] Deduced a trap composed of 86 places in 237 ms of which 5 ms to minimize.
[2024-06-01 21:32:23] [INFO ] Deduced a trap composed of 35 places in 172 ms of which 4 ms to minimize.
SMT process timed out in 8594ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 178 out of 2003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2003/2003 places, 2003/2003 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 469 transitions
Trivial Post-agglo rules discarded 469 transitions
Performed 469 trivial Post agglomeration. Transition count delta: 469
Iterating post reduction 0 with 469 rules applied. Total rules applied 469 place count 2003 transition count 1534
Reduce places removed 469 places and 0 transitions.
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Iterating post reduction 1 with 539 rules applied. Total rules applied 1008 place count 1534 transition count 1464
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 1078 place count 1464 transition count 1464
Performed 159 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 159 Pre rules applied. Total rules applied 1078 place count 1464 transition count 1305
Deduced a syphon composed of 159 places in 3 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 3 with 318 rules applied. Total rules applied 1396 place count 1305 transition count 1305
Discarding 239 places :
Symmetric choice reduction at 3 with 239 rule applications. Total rules 1635 place count 1066 transition count 1066
Iterating global reduction 3 with 239 rules applied. Total rules applied 1874 place count 1066 transition count 1066
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 71 Pre rules applied. Total rules applied 1874 place count 1066 transition count 995
Deduced a syphon composed of 71 places in 6 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 2016 place count 995 transition count 995
Performed 324 Post agglomeration using F-continuation condition.Transition count delta: 324
Deduced a syphon composed of 324 places in 2 ms
Reduce places removed 324 places and 0 transitions.
Iterating global reduction 3 with 648 rules applied. Total rules applied 2664 place count 671 transition count 671
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 71 places in 2 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 2806 place count 600 transition count 703
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 2807 place count 600 transition count 702
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 2815 place count 600 transition count 694
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 2823 place count 592 transition count 694
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 2826 place count 592 transition count 691
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 2830 place count 592 transition count 691
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2831 place count 591 transition count 690
Applied a total of 2831 rules in 575 ms. Remains 591 /2003 variables (removed 1412) and now considering 690/2003 (removed 1313) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 586 ms. Remains : 591/2003 places, 690/2003 transitions.
RANDOM walk for 40000 steps (10 resets) in 550 ms. (72 steps per ms) remains 9/11 properties
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 264 ms. (150 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 293 ms. (136 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 179 ms. (222 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 9/9 properties
// Phase 1: matrix 690 rows 591 cols
[2024-06-01 21:32:25] [INFO ] Computed 161 invariants in 3 ms
[2024-06-01 21:32:25] [INFO ] State equation strengthened by 157 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 375/514 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 66/580 variables, 29/156 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/580 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 683/1263 variables, 580/736 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1263 variables, 156/892 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1263 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 17/1280 variables, 10/902 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1280 variables, 4/906 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1280 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1280 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 1/1281 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1281 variables, 1/909 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1281 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 0/1281 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1281/1281 variables, and 909 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1677 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 591/591 constraints, ReadFeed: 157/157 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 375/514 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 21:32:27] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 5 ms to minimize.
[2024-06-01 21:32:27] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 2 ms to minimize.
[2024-06-01 21:32:27] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-06-01 21:32:27] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-06-01 21:32:27] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
[2024-06-01 21:32:27] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2024-06-01 21:32:27] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-06-01 21:32:27] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-06-01 21:32:27] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-06-01 21:32:27] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-06-01 21:32:27] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-06-01 21:32:27] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 12/139 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 21:32:27] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-06-01 21:32:27] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-01 21:32:28] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 21:32:28] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-06-01 21:32:28] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-06-01 21:32:28] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 5 ms to minimize.
[2024-06-01 21:32:28] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-01 21:32:28] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/514 variables, 5/147 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 66/580 variables, 29/176 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 21:32:28] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-06-01 21:32:28] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 21:32:28] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 0 ms to minimize.
[2024-06-01 21:32:28] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 21:32:29] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/580 variables, 3/181 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 21:32:29] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-01 21:32:29] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 2 ms to minimize.
[2024-06-01 21:32:29] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/580 variables, 3/184 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/580 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 683/1263 variables, 580/764 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1263 variables, 156/920 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1263 variables, 8/928 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 21:32:30] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-06-01 21:32:30] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1263 variables, 2/930 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1263 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 17/1280 variables, 10/940 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1280 variables, 4/944 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1280 variables, 1/945 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1280 variables, 1/946 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1280 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 1/1281 variables, 1/947 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1281 variables, 1/948 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1281 variables, 0/948 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (OVERLAPS) 0/1281 variables, 0/948 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1281/1281 variables, and 948 constraints, problems are : Problem set: 0 solved, 9 unsolved in 7566 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 591/591 constraints, ReadFeed: 157/157 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 30/30 constraints]
After SMT, in 9298ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 3100 ms.
Support contains 139 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 591 transition count 684
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 585 transition count 683
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 584 transition count 683
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 14 place count 584 transition count 673
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 34 place count 574 transition count 673
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 37 place count 571 transition count 670
Iterating global reduction 3 with 3 rules applied. Total rules applied 40 place count 571 transition count 670
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 88 place count 547 transition count 646
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 104 place count 539 transition count 653
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 108 place count 539 transition count 649
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 112 place count 535 transition count 649
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 113 place count 534 transition count 648
Applied a total of 113 rules in 92 ms. Remains 534 /591 variables (removed 57) and now considering 648/690 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 534/591 places, 648/690 transitions.
RANDOM walk for 40000 steps (11 resets) in 344 ms. (115 steps per ms) remains 8/9 properties
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 134 ms. (296 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 172 ms. (231 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 248 ms. (160 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 114 ms. (347 steps per ms) remains 8/8 properties
// Phase 1: matrix 648 rows 534 cols
[2024-06-01 21:32:38] [INFO ] Computed 161 invariants in 2 ms
[2024-06-01 21:32:38] [INFO ] State equation strengthened by 161 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 325/463 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/463 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 37/500 variables, 18/144 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 634/1134 variables, 500/644 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1134 variables, 157/801 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1134 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 45/1179 variables, 32/833 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1179 variables, 16/849 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1179 variables, 4/853 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1179 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 3/1182 variables, 2/855 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1182 variables, 1/856 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1182 variables, 0/856 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 0/1182 variables, 0/856 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1182/1182 variables, and 856 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1437 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 534/534 constraints, ReadFeed: 161/161 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 325/463 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 21:32:39] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-06-01 21:32:39] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 2 ms to minimize.
[2024-06-01 21:32:39] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2024-06-01 21:32:39] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-06-01 21:32:40] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-06-01 21:32:40] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-06-01 21:32:40] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-06-01 21:32:40] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-06-01 21:32:40] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-06-01 21:32:40] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 3 ms to minimize.
[2024-06-01 21:32:40] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-06-01 21:32:40] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-06-01 21:32:40] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-06-01 21:32:40] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/463 variables, 14/140 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/463 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 37/500 variables, 18/158 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 21:32:40] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 21:32:40] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-06-01 21:32:40] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-01 21:32:41] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-06-01 21:32:41] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-06-01 21:32:41] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 5/164 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 21:32:41] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 634/1134 variables, 500/665 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1134 variables, 157/822 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1134 variables, 3/825 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 21:32:41] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1134 variables, 1/826 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1134 variables, 0/826 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 45/1179 variables, 32/858 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1179 variables, 16/874 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1179 variables, 4/878 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1179 variables, 5/883 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 21:32:43] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1179 variables, 1/884 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1179 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 3/1182 variables, 2/886 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1182 variables, 1/887 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1182 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 0/1182 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1182/1182 variables, and 887 constraints, problems are : Problem set: 0 solved, 8 unsolved in 6207 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 534/534 constraints, ReadFeed: 161/161 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 23/23 constraints]
After SMT, in 7672ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 5098 ms.
Support contains 138 out of 534 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 534/534 places, 648/648 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 533 transition count 647
Applied a total of 2 rules in 22 ms. Remains 533 /534 variables (removed 1) and now considering 647/648 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 533/534 places, 647/648 transitions.
RANDOM walk for 40000 steps (10 resets) in 288 ms. (138 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 153 ms. (259 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 128 ms. (310 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 103 ms. (384 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 92 ms. (430 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 120 ms. (330 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 109 ms. (363 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 158008 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :3 out of 8
Probabilistic random walk after 158008 steps, saw 110436 distinct states, run finished after 3006 ms. (steps per millisecond=52 ) properties seen :3
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 647 rows 533 cols
[2024-06-01 21:32:54] [INFO ] Computed 161 invariants in 2 ms
[2024-06-01 21:32:54] [INFO ] State equation strengthened by 162 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 329/451 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/451 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 42/493 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/493 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 629/1122 variables, 493/635 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1122 variables, 158/793 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1122 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 54/1176 variables, 37/830 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1176 variables, 17/847 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1176 variables, 4/851 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1176 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1/1177 variables, 1/852 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1177 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1177 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 3/1180 variables, 2/855 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1180 variables, 1/856 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1180 variables, 0/856 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/1180 variables, 0/856 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1180/1180 variables, and 856 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1212 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 533/533 constraints, ReadFeed: 162/162 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 329/451 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 21:32:55] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-06-01 21:32:55] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-06-01 21:32:55] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-06-01 21:32:55] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-06-01 21:32:55] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-06-01 21:32:55] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-06-01 21:32:56] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-06-01 21:32:56] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-06-01 21:32:56] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-06-01 21:32:56] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-06-01 21:32:56] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-06-01 21:32:56] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2024-06-01 21:32:56] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-06-01 21:32:56] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-06-01 21:32:56] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/451 variables, 15/137 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 21:32:56] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-06-01 21:32:56] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/451 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 21:32:56] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/451 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/451 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 42/493 variables, 20/160 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 21:32:56] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-06-01 21:32:56] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/493 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/493 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 629/1122 variables, 493/655 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1122 variables, 158/813 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1122 variables, 2/815 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 21:32:57] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-06-01 21:32:57] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1122 variables, 2/817 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1122 variables, 0/817 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 54/1176 variables, 37/854 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1176 variables, 17/871 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1176 variables, 4/875 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1176 variables, 3/878 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 21:32:58] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2024-06-01 21:32:58] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-06-01 21:32:58] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-06-01 21:32:58] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1176 variables, 4/882 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 21:32:59] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1176 variables, 1/883 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1176 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 1/1177 variables, 1/884 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1177 variables, 1/885 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1177 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 3/1180 variables, 2/887 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1180 variables, 1/888 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 21:33:00] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1180 variables, 1/889 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1180 variables, 0/889 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (OVERLAPS) 0/1180 variables, 0/889 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1180/1180 variables, and 889 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5697 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 533/533 constraints, ReadFeed: 162/162 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 28/28 constraints]
After SMT, in 6943ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2336 ms.
Support contains 122 out of 533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 647/647 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 533 transition count 645
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 531 transition count 645
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4 place count 531 transition count 640
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 526 transition count 640
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 524 transition count 638
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 524 transition count 638
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 31 place count 517 transition count 632
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 41 place count 512 transition count 636
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 512 transition count 635
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 512 transition count 635
Applied a total of 43 rules in 71 ms. Remains 512 /533 variables (removed 21) and now considering 635/647 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 512/533 places, 635/647 transitions.
RANDOM walk for 40000 steps (9 resets) in 415 ms. (96 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 166 ms. (239 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 169 ms. (235 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 375 ms. (106 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 131 ms. (303 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 191 ms. (208 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 208716 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 5
Probabilistic random walk after 208716 steps, saw 122761 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
// Phase 1: matrix 635 rows 512 cols
[2024-06-01 21:33:07] [INFO ] Computed 160 invariants in 2 ms
[2024-06-01 21:33:07] [INFO ] State equation strengthened by 174 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 314/436 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 40/476 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/476 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 619/1095 variables, 476/618 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1095 variables, 168/786 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1095 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 49/1144 variables, 34/820 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1144 variables, 17/837 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1144 variables, 6/843 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1144 variables, 0/843 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 3/1147 variables, 2/845 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1147 variables, 1/846 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1147 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/1147 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1147/1147 variables, and 846 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1068 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 512/512 constraints, ReadFeed: 174/174 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 314/436 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 21:33:08] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-06-01 21:33:08] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
[2024-06-01 21:33:08] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-06-01 21:33:08] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2024-06-01 21:33:08] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-01 21:33:08] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-06-01 21:33:08] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-06-01 21:33:08] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2024-06-01 21:33:08] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-06-01 21:33:08] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-06-01 21:33:09] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-06-01 21:33:09] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 21:33:09] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-06-01 21:33:09] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2024-06-01 21:33:09] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2024-06-01 21:33:09] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 16/138 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 21:33:09] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-06-01 21:33:09] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 40/476 variables, 20/160 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 21:33:09] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 21:33:09] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 619/1095 variables, 476/638 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1095 variables, 168/806 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1095 variables, 2/808 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 21:33:10] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1095 variables, 1/809 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1095 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 49/1144 variables, 34/843 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1144 variables, 17/860 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1144 variables, 6/866 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1144 variables, 3/869 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 21:33:11] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1144 variables, 1/870 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1144 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 3/1147 variables, 2/872 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1147 variables, 1/873 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1147 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 0/1147 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1147/1147 variables, and 873 constraints, problems are : Problem set: 0 solved, 5 unsolved in 4186 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 512/512 constraints, ReadFeed: 174/174 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 22/22 constraints]
After SMT, in 5290ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 4439 ms.
Support contains 122 out of 512 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 512/512 places, 635/635 transitions.
Applied a total of 0 rules in 23 ms. Remains 512 /512 variables (removed 0) and now considering 635/635 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 512/512 places, 635/635 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 512/512 places, 635/635 transitions.
Applied a total of 0 rules in 11 ms. Remains 512 /512 variables (removed 0) and now considering 635/635 (removed 0) transitions.
[2024-06-01 21:33:16] [INFO ] Invariant cache hit.
[2024-06-01 21:33:17] [INFO ] Implicit Places using invariants in 359 ms returned []
[2024-06-01 21:33:17] [INFO ] Invariant cache hit.
[2024-06-01 21:33:17] [INFO ] State equation strengthened by 174 read => feed constraints.
[2024-06-01 21:33:18] [INFO ] Implicit Places using invariants and state equation in 946 ms returned []
Implicit Place search using SMT with State Equation took 1314 ms to find 0 implicit places.
[2024-06-01 21:33:18] [INFO ] Redundant transitions in 34 ms returned []
Running 625 sub problems to find dead transitions.
[2024-06-01 21:33:18] [INFO ] Invariant cache hit.
[2024-06-01 21:33:18] [INFO ] State equation strengthened by 174 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/504 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/504 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 2 (OVERLAPS) 8/512 variables, 130/160 constraints. Problems are: Problem set: 0 solved, 625 unsolved
[2024-06-01 21:33:28] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-06-01 21:33:28] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 21:33:28] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-06-01 21:33:28] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-06-01 21:33:28] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-06-01 21:33:28] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-06-01 21:33:29] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-06-01 21:33:29] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-06-01 21:33:29] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 16 ms to minimize.
[2024-06-01 21:33:29] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-06-01 21:33:29] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2024-06-01 21:33:29] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-06-01 21:33:29] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-06-01 21:33:29] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-06-01 21:33:30] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 2 ms to minimize.
[2024-06-01 21:33:30] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-06-01 21:33:30] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 17/177 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/512 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 5 (OVERLAPS) 635/1147 variables, 512/689 constraints. Problems are: Problem set: 0 solved, 625 unsolved
(s326 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 (/ 11.0 12.0))
(s7 (/ 1.0 12.0))
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 (/ 11.0 12.0))
(s24 0.0)
(s25 0.0)
(s26 (/ 1.0 12.0))
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 (/ 11.0 12.0))
(s35 0.0)
(s36 0.0)
(s37 (/ 1.0 12.0))
(s38 0.0)
(s39 0.0)
(s40 (/ 1.0 12.0))
(s41 (/ 11.0 12.0))
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 (/ 5.0 6.0))
(s47 (/ 1.0 6.0))
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 (/ 11.0 12.0))
(s56 0.0)
(s57 (/ 1.0 12.0))
(s58 0.0)
(s59 1.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 (/ 11.0 12.0))
(s122 0.0)
(s123 (/ 1.0 12.0))
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 (/ 1.0 12.0))
(s136 0.0)
(s137 (/ 11.0 12.0))
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 (/ 1.0 12.0))
(s145 0.0)
(s146 (/ 11.0 12.0))
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 (/ 1.0 12.0))
(s159 (/ 11.0 12.0))
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 (/ 11.0 12.0))
(s172 0.0)
(s173 (/ 1.0 12.0))
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 (/ 1.0 12.0))
(s182 (/ 11.0 12.0))
(s183 (/ 11.0 12.0))
(s184 (/ 1.0 12.0))
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 (/ 1.0 12.0))
(s208 (/ 11.0 12.0))
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 (/ 1.0 12.0))
(s219 0.0)
(s220 (/ 11.0 12.0))
(s221 (/ 1.0 12.0))
(s222 (/ 11.0 12.0))
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 1.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 1.0)
(s231 (/ 1.0 12.0))
(s232 (/ 11.0 12.0))
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 (/ 11.0 12.0))
(s237 0.0)
(s238 (/ 1.0 12.0))
(s239 1.0)
(s240 0.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 (/ 1.0 12.0))
(s247 (/ 11.0 12.0))
(s248 0.0)
(s249 (/ 11.0 12.0))
(s250 0.0)
(s251 0.0)
(s252 (/ 1.0 12.0))
(s253 0.0)
(s254 (/ 1.0 12.0))
(s255 (/ 11.0 12.0))
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 0.0)
(s260 (/ 11.0 12.0))
(s261 (/ 1.0 12.0))
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 (/ 1.0 12.0))
(s267 0.0)
(s268 0.0)
(s269 (/ 11.0 12.0))
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 0.0)
(s274 0.0)
(s275 (/ 11.0 12.0))
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 (/ 1.0 12.0))
(s281 (/ 11.0 12.0))
(s282 0.0)
(s283 (/ 1.0 12.0))
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 (/ 1.0 12.0))
(s292 0.0)
(s293 0.0)
(s294 (/ 11.0 12.0))
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 1.0)
(s306 0.0)
(s307 1.0)
(s308 (/ 1.0 12.0))
(s309 0.0)
(s310 0.0)
(s311 (/ 11.0 12.0))
(s312 1.0)
(s313 0.0)
(s314 (/ 1.0 12.0))
(s315 0.0)
(s316 0.0)
(s317 (/ 11.0 12.0))
(s318 1.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 1.0)
(s324 0.0)
(s325 1.0)
(s326 0.0timeout
)
( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/1147 variables, 174/863 constraints. Problems are: Problem set: 0 solved, 625 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1147/1147 variables, and 863 constraints, problems are : Problem set: 0 solved, 625 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 512/512 constraints, ReadFeed: 174/174 constraints, PredecessorRefiner: 625/625 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 625 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/504 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/504 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/504 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 3 (OVERLAPS) 8/512 variables, 130/161 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/512 variables, 16/177 constraints. Problems are: Problem set: 0 solved, 625 unsolved
[2024-06-01 21:33:53] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-06-01 21:33:55] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 7 (OVERLAPS) 635/1147 variables, 512/691 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1147 variables, 174/865 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1147 variables, 625/1490 constraints. Problems are: Problem set: 0 solved, 625 unsolved
[2024-06-01 21:34:12] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-06-01 21:34:14] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 2 ms to minimize.
[2024-06-01 21:34:14] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 1 ms to minimize.
[2024-06-01 21:34:14] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
[2024-06-01 21:34:14] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 2 ms to minimize.
[2024-06-01 21:34:15] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-06-01 21:34:17] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1147/1147 variables, and 1497 constraints, problems are : Problem set: 0 solved, 625 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 512/512 constraints, ReadFeed: 174/174 constraints, PredecessorRefiner: 625/625 constraints, Known Traps: 26/26 constraints]
After SMT, in 60246ms problems are : Problem set: 0 solved, 625 unsolved
Search for dead transitions found 0 dead transitions in 60253ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61624 ms. Remains : 512/512 places, 635/635 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 512 transition count 615
Partial Free-agglomeration rule applied 18 times.
Drop transitions (Partial Free agglomeration) removed 18 transitions
Iterating global reduction 0 with 18 rules applied. Total rules applied 38 place count 512 transition count 615
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 0 with 13 rules applied. Total rules applied 51 place count 512 transition count 602
Applied a total of 51 rules in 35 ms. Remains 512 /512 variables (removed 0) and now considering 602/635 (removed 33) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 602 rows 512 cols
[2024-06-01 21:34:18] [INFO ] Computed 160 invariants in 2 ms
[2024-06-01 21:34:19] [INFO ] After 358ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-06-01 21:34:19] [INFO ] [Nat]Absence check using 160 positive place invariants in 21 ms returned sat
[2024-06-01 21:34:19] [INFO ] After 403ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-06-01 21:34:19] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-06-01 21:34:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2024-06-01 21:34:20] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-06-01 21:34:20] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-06-01 21:34:20] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-06-01 21:34:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 265 ms
[2024-06-01 21:34:20] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-06-01 21:34:20] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-06-01 21:34:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 170 ms
TRAPS : Iteration 1
[2024-06-01 21:34:20] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-06-01 21:34:20] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-06-01 21:34:20] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-06-01 21:34:20] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-01 21:34:21] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-06-01 21:34:21] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-06-01 21:34:21] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-06-01 21:34:21] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-06-01 21:34:21] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-06-01 21:34:21] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-06-01 21:34:21] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-06-01 21:34:21] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 860 ms
TRAPS : Iteration 2
[2024-06-01 21:34:21] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-06-01 21:34:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2024-06-01 21:34:21] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-06-01 21:34:22] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-06-01 21:34:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 175 ms
[2024-06-01 21:34:22] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-06-01 21:34:22] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-06-01 21:34:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 143 ms
TRAPS : Iteration 3
[2024-06-01 21:34:22] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-06-01 21:34:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2024-06-01 21:34:22] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-06-01 21:34:22] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-06-01 21:34:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 162 ms
TRAPS : Iteration 4
[2024-06-01 21:34:23] [INFO ] After 3892ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-06-01 21:34:23] [INFO ] After 4483ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 4902 ms.
[2024-06-01 21:34:23] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 9 ms.
[2024-06-01 21:34:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 512 places, 635 transitions and 2790 arcs took 6 ms.
[2024-06-01 21:34:23] [INFO ] Flatten gal took : 88 ms
Total runtime 130440 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 : ShieldRVt-PT-040B-ReachabilityFireability-2024-07
Could not compute solution for formula : ShieldRVt-PT-040B-ReachabilityFireability-2024-08
Could not compute solution for formula : ShieldRVt-PT-040B-ReachabilityFireability-2024-12
Could not compute solution for formula : ShieldRVt-PT-040B-ReachabilityFireability-2024-13
Could not compute solution for formula : ShieldRVt-PT-040B-ReachabilityFireability-2024-14

BK_STOP 1717277664007

--------------------
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 ShieldRVt-PT-040B-ReachabilityFireability-2024-07
rfs formula type AG
rfs formula formula --invariant=/tmp/1088/inv_0_
rfs formula name ShieldRVt-PT-040B-ReachabilityFireability-2024-08
rfs formula type AG
rfs formula formula --invariant=/tmp/1088/inv_1_
rfs formula name ShieldRVt-PT-040B-ReachabilityFireability-2024-12
rfs formula type AG
rfs formula formula --invariant=/tmp/1088/inv_2_
rfs formula name ShieldRVt-PT-040B-ReachabilityFireability-2024-13
rfs formula type EF
rfs formula formula --invariant=/tmp/1088/inv_3_
rfs formula name ShieldRVt-PT-040B-ReachabilityFireability-2024-14
rfs formula type EF
rfs formula formula --invariant=/tmp/1088/inv_4_
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="ShieldRVt-PT-040B"
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 ShieldRVt-PT-040B, 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-171683762401023"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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