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.r480-tall-171624189900718.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 DES-PT-40a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189900718
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 08:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 12 08:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 08:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 12 08:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 83K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-00
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-01
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-02
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-03
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-04
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-05
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-06
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-07
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-08
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-09
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-10
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-11
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-12
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-13
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-14
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717195979886

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-40a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:53:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 22:53:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:53:01] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2024-05-31 22:53:01] [INFO ] Transformed 274 places.
[2024-05-31 22:53:01] [INFO ] Transformed 231 transitions.
[2024-05-31 22:53:01] [INFO ] Found NUPN structural information;
[2024-05-31 22:53:01] [INFO ] Parsed PT model containing 274 places and 231 transitions and 1116 arcs in 228 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-40a-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (892 resets) in 2334 ms. (17 steps per ms) remains 11/13 properties
FORMULA DES-PT-40a-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (192 resets) in 431 ms. (92 steps per ms) remains 10/11 properties
FORMULA DES-PT-40a-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (181 resets) in 161 ms. (246 steps per ms) remains 9/10 properties
FORMULA DES-PT-40a-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (230 resets) in 343 ms. (116 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (177 resets) in 229 ms. (173 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (166 resets) in 384 ms. (103 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (170 resets) in 145 ms. (273 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (184 resets) in 129 ms. (307 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (207 resets) in 204 ms. (195 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (172 resets) in 117 ms. (338 steps per ms) remains 9/9 properties
// Phase 1: matrix 217 rows 274 cols
[2024-05-31 22:53:03] [INFO ] Computed 59 invariants in 25 ms
[2024-05-31 22:53:03] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 118/118 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 23/141 variables, 21/139 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 23/162 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 25/166 variables, 13/176 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 25/201 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 88/254 variables, 22/225 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/254 variables, 88/313 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/254 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem DES-PT-40a-ReachabilityCardinality-2024-00 is UNSAT
FORMULA DES-PT-40a-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 13 (OVERLAPS) 216/470 variables, 254/567 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/470 variables, 1/568 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/470 variables, 0/568 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 21/491 variables, 20/588 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/491 variables, 20/608 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/491 variables, 0/608 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 0/491 variables, 0/608 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 491/491 variables, and 608 constraints, problems are : Problem set: 1 solved, 8 unsolved in 4129 ms.
Refiners :[Domain max(s): 274/274 constraints, Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 274/274 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/80 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 23/103 variables, 16/96 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 23/119 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/119 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 35/138 variables, 18/137 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 35/172 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 1/173 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 109/247 variables, 23/196 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 109/305 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 0/305 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 3/250 variables, 1/306 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/250 variables, 3/309 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-31 22:53:08] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 54 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/250 variables, 1/310 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/250 variables, 0/310 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 216/466 variables, 250/560 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/466 variables, 1/561 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/466 variables, 5/566 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/466 variables, 0/566 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 25/491 variables, 24/590 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/491 variables, 24/614 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/491 variables, 3/617 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 491/491 variables, and 617 constraints, problems are : Problem set: 1 solved, 8 unsolved in 5015 ms.
Refiners :[Domain max(s): 274/274 constraints, Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 274/274 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/9 constraints, Known Traps: 1/1 constraints]
After SMT, in 9261ms problems are : Problem set: 1 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 80 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 217/217 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 274 transition count 215
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 5 place count 274 transition count 215
Applied a total of 5 rules in 54 ms. Remains 274 /274 variables (removed 0) and now considering 215/217 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 274/274 places, 215/217 transitions.
RANDOM walk for 40000 steps (517 resets) in 599 ms. (66 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (87 resets) in 159 ms. (250 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (203 resets) in 119 ms. (333 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (97 resets) in 145 ms. (273 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (69 resets) in 149 ms. (266 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (90 resets) in 77 ms. (512 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (90 resets) in 88 ms. (449 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (82 resets) in 107 ms. (370 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (90 resets) in 60 ms. (655 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 732894 steps, run timeout after 3001 ms. (steps per millisecond=244 ) properties seen :0 out of 8
Probabilistic random walk after 732894 steps, saw 105363 distinct states, run finished after 3005 ms. (steps per millisecond=243 ) properties seen :0
// Phase 1: matrix 215 rows 274 cols
[2024-05-31 22:53:16] [INFO ] Computed 61 invariants in 4 ms
[2024-05-31 22:53:16] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 29/109 variables, 19/99 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 29/128 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 35/144 variables, 18/146 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 35/181 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 107/251 variables, 23/205 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 107/312 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 215/466 variables, 251/563 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/466 variables, 4/567 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/466 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 23/489 variables, 23/590 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/489 variables, 23/613 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/489 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 0/489 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 489/489 variables, and 613 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3935 ms.
Refiners :[Domain max(s): 274/274 constraints, Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 274/274 constraints, ReadFeed: 4/4 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/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 29/109 variables, 19/99 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 29/128 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 35/144 variables, 18/146 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 35/181 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 107/251 variables, 23/205 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 107/312 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 215/466 variables, 251/563 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/466 variables, 4/567 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/466 variables, 5/572 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 22:53:22] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/466 variables, 1/573 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/466 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 23/489 variables, 23/596 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/489 variables, 23/619 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/489 variables, 3/622 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 22:53:26] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:53:26] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:53:26] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/489 variables, 3/625 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/489 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 22:53:29] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 2 ms to minimize.
At refinement iteration 22 (OVERLAPS) 0/489 variables, 1/626 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 22:53:32] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/489 variables, 1/627 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/489 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (OVERLAPS) 0/489 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 489/489 variables, and 627 constraints, problems are : Problem set: 0 solved, 8 unsolved in 18812 ms.
Refiners :[Domain max(s): 274/274 constraints, Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 274/274 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 6/6 constraints]
After SMT, in 22825ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 10310 ms.
Support contains 80 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 215/215 transitions.
Applied a total of 0 rules in 19 ms. Remains 274 /274 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 274/274 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 215/215 transitions.
Applied a total of 0 rules in 12 ms. Remains 274 /274 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-05-31 22:53:49] [INFO ] Invariant cache hit.
[2024-05-31 22:53:49] [INFO ] Implicit Places using invariants in 292 ms returned [171]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 301 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 273/274 places, 215/215 transitions.
Applied a total of 0 rules in 11 ms. Remains 273 /273 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 325 ms. Remains : 273/274 places, 215/215 transitions.
RANDOM walk for 40000 steps (532 resets) in 444 ms. (89 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (88 resets) in 98 ms. (404 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (213 resets) in 96 ms. (412 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (87 resets) in 95 ms. (416 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (68 resets) in 135 ms. (294 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (77 resets) in 95 ms. (416 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (88 resets) in 132 ms. (300 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (80 resets) in 121 ms. (327 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (92 resets) in 89 ms. (444 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 827909 steps, run timeout after 3001 ms. (steps per millisecond=275 ) properties seen :0 out of 8
Probabilistic random walk after 827909 steps, saw 117957 distinct states, run finished after 3001 ms. (steps per millisecond=275 ) properties seen :0
// Phase 1: matrix 215 rows 273 cols
[2024-05-31 22:53:53] [INFO ] Computed 60 invariants in 4 ms
[2024-05-31 22:53:53] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 30/110 variables, 19/99 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 30/129 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 34/144 variables, 17/147 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 34/181 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 106/250 variables, 22/204 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 106/310 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 215/465 variables, 250/560 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/465 variables, 3/563 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/465 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 23/488 variables, 23/586 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/488 variables, 23/609 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/488 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 0/488 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 609 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3157 ms.
Refiners :[Domain max(s): 273/273 constraints, Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 273/273 constraints, ReadFeed: 3/3 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/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 30/110 variables, 19/99 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 30/129 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 34/144 variables, 17/147 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 34/181 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 106/250 variables, 22/204 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 106/310 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 215/465 variables, 250/560 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/465 variables, 3/563 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/465 variables, 5/568 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/465 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 23/488 variables, 23/591 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/488 variables, 23/614 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/488 variables, 3/617 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/488 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 0/488 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 488/488 variables, and 617 constraints, problems are : Problem set: 0 solved, 8 unsolved in 13829 ms.
Refiners :[Domain max(s): 273/273 constraints, Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 273/273 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 17016ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 14007 ms.
Support contains 80 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 215/215 transitions.
Applied a total of 0 rules in 32 ms. Remains 273 /273 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 273/273 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 215/215 transitions.
Applied a total of 0 rules in 8 ms. Remains 273 /273 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-05-31 22:54:24] [INFO ] Invariant cache hit.
[2024-05-31 22:54:24] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-05-31 22:54:24] [INFO ] Invariant cache hit.
[2024-05-31 22:54:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-31 22:54:24] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 716 ms to find 0 implicit places.
[2024-05-31 22:54:24] [INFO ] Redundant transitions in 7 ms returned []
Running 214 sub problems to find dead transitions.
[2024-05-31 22:54:24] [INFO ] Invariant cache hit.
[2024-05-31 22:54:24] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 272/272 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 11/283 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 214 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/273 variables, 36/319 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 13/333 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (OVERLAPS) 215/488 variables, 273/606 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 3/609 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-31 22:54:32] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 1/610 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-31 22:54:40] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/488 variables, 1/611 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-31 22:54:52] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 1 ms to minimize.
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 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 (/ 1.0 160.0))
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 (/ 1.0 160.0))
(s79 (/ 79.0 80.0))
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 (/ 39.0 40.0))
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 1.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 1.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 1.0)
(s188 1.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 1.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 1.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 1.0)
(s219 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 488/488 variables, and 612 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30016 ms.
Refiners :[Domain max(s): 273/273 constraints, Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 273/273 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 272/272 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 11/283 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 1/273 variables, 36/319 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 13/333 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 3/336 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-31 22:54:56] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-31 22:54:57] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:54:57] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 3/339 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (OVERLAPS) 215/488 variables, 273/612 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/488 variables, 3/615 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/488 variables, 214/829 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-31 22:55:16] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:55:18] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:55:23] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:55:24] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/488 variables, and 833 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30017 ms.
Refiners :[Domain max(s): 273/273 constraints, Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 273/273 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 10/10 constraints]
After SMT, in 60190ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 60196ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60944 ms. Remains : 273/273 places, 215/215 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 7 ms. Remains 273 /273 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Running SMT prover for 8 properties.
[2024-05-31 22:55:25] [INFO ] Invariant cache hit.
[2024-05-31 22:55:25] [INFO ] [Real]Absence check using 36 positive place invariants in 8 ms returned sat
[2024-05-31 22:55:25] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2024-05-31 22:55:25] [INFO ] After 208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-31 22:55:25] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-31 22:55:25] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 20 ms returned sat
[2024-05-31 22:55:26] [INFO ] After 910ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
TRAPS : Iteration 0
[2024-05-31 22:55:26] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 2 ms to minimize.
[2024-05-31 22:55:26] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 1 ms to minimize.
[2024-05-31 22:55:26] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:55:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 434 ms
[2024-05-31 22:55:27] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:55:27] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-31 22:55:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 118 ms
[2024-05-31 22:55:27] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:55:27] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-05-31 22:55:27] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:55:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 235 ms
TRAPS : Iteration 1
[2024-05-31 22:55:28] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:55:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
TRAPS : Iteration 2
[2024-05-31 22:55:29] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:55:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
TRAPS : Iteration 3
[2024-05-31 22:55:30] [INFO ] After 4939ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
[2024-05-31 22:55:30] [INFO ] After 5708ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Over-approximation ignoring read arcs solved 0 properties in 5969 ms.
[2024-05-31 22:55:31] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-31 22:55:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 273 places, 215 transitions and 1064 arcs took 4 ms.
[2024-05-31 22:55:31] [INFO ] Flatten gal took : 56 ms
Total runtime 149954 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 : DES-PT-40a-ReachabilityCardinality-2024-02
Could not compute solution for formula : DES-PT-40a-ReachabilityCardinality-2024-04
Could not compute solution for formula : DES-PT-40a-ReachabilityCardinality-2024-08
Could not compute solution for formula : DES-PT-40a-ReachabilityCardinality-2024-10
Could not compute solution for formula : DES-PT-40a-ReachabilityCardinality-2024-11
Could not compute solution for formula : DES-PT-40a-ReachabilityCardinality-2024-12
Could not compute solution for formula : DES-PT-40a-ReachabilityCardinality-2024-14
Could not compute solution for formula : DES-PT-40a-ReachabilityCardinality-2024-15

BK_STOP 1717196131559

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name DES-PT-40a-ReachabilityCardinality-2024-02
rfs formula type EF
rfs formula formula --invariant=/tmp/641/inv_0_
rfs formula name DES-PT-40a-ReachabilityCardinality-2024-04
rfs formula type AG
rfs formula formula --invariant=/tmp/641/inv_1_
rfs formula name DES-PT-40a-ReachabilityCardinality-2024-08
rfs formula type AG
rfs formula formula --invariant=/tmp/641/inv_2_
rfs formula name DES-PT-40a-ReachabilityCardinality-2024-10
rfs formula type EF
rfs formula formula --invariant=/tmp/641/inv_3_
rfs formula name DES-PT-40a-ReachabilityCardinality-2024-11
rfs formula type AG
rfs formula formula --invariant=/tmp/641/inv_4_
rfs formula name DES-PT-40a-ReachabilityCardinality-2024-12
rfs formula type EF
rfs formula formula --invariant=/tmp/641/inv_5_
rfs formula name DES-PT-40a-ReachabilityCardinality-2024-14
rfs formula type AG
rfs formula formula --invariant=/tmp/641/inv_6_
rfs formula name DES-PT-40a-ReachabilityCardinality-2024-15
rfs formula type AG
rfs formula formula --invariant=/tmp/641/inv_7_
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="DES-PT-40a"
export BK_EXAMINATION="ReachabilityCardinality"
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 DES-PT-40a, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r480-tall-171624189900718"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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