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

About the Execution of LTSMin+red for SemanticWebServices-PT-S256P15

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
14097.088 106641.00 198622.00 333.20 FFFTTFTFTTFTFTTF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r524-tall-171679080700598.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 SemanticWebServices-PT-S256P15, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r524-tall-171679080700598
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 32M
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 02:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 12 02:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 12 02:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 12 02:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 32M 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 SemanticWebServices-PT-S256P15-ReachabilityCardinality-2024-00
FORMULA_NAME SemanticWebServices-PT-S256P15-ReachabilityCardinality-2024-01
FORMULA_NAME SemanticWebServices-PT-S256P15-ReachabilityCardinality-2024-02
FORMULA_NAME SemanticWebServices-PT-S256P15-ReachabilityCardinality-2024-03
FORMULA_NAME SemanticWebServices-PT-S256P15-ReachabilityCardinality-2024-04
FORMULA_NAME SemanticWebServices-PT-S256P15-ReachabilityCardinality-2024-05
FORMULA_NAME SemanticWebServices-PT-S256P15-ReachabilityCardinality-2024-06
FORMULA_NAME SemanticWebServices-PT-S256P15-ReachabilityCardinality-2024-07
FORMULA_NAME SemanticWebServices-PT-S256P15-ReachabilityCardinality-2024-08
FORMULA_NAME SemanticWebServices-PT-S256P15-ReachabilityCardinality-2024-09
FORMULA_NAME SemanticWebServices-PT-S256P15-ReachabilityCardinality-2024-10
FORMULA_NAME SemanticWebServices-PT-S256P15-ReachabilityCardinality-2024-11
FORMULA_NAME SemanticWebServices-PT-S256P15-ReachabilityCardinality-2024-12
FORMULA_NAME SemanticWebServices-PT-S256P15-ReachabilityCardinality-2024-13
FORMULA_NAME SemanticWebServices-PT-S256P15-ReachabilityCardinality-2024-14
FORMULA_NAME SemanticWebServices-PT-S256P15-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717229432306

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SemanticWebServices-PT-S256P15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:10:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 08:10:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:10:34] [INFO ] Load time of PNML (sax parser for PT used): 1166 ms
[2024-06-01 08:10:34] [INFO ] Transformed 329 places.
[2024-06-01 08:10:34] [INFO ] Transformed 29492 transitions.
[2024-06-01 08:10:34] [INFO ] Parsed PT model containing 329 places and 29492 transitions and 267319 arcs in 1402 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 5 places in 57 ms
Reduce places removed 5 places and 2050 transitions.
Ensure Unique test removed 6828 transitions
Reduce redundant transitions removed 6828 transitions.
RANDOM walk for 40023 steps (8 resets) in 5297 ms. (7 steps per ms) remains 7/16 properties
FORMULA SemanticWebServices-PT-S256P15-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SemanticWebServices-PT-S256P15-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SemanticWebServices-PT-S256P15-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SemanticWebServices-PT-S256P15-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SemanticWebServices-PT-S256P15-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SemanticWebServices-PT-S256P15-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SemanticWebServices-PT-S256P15-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SemanticWebServices-PT-S256P15-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SemanticWebServices-PT-S256P15-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 452 ms. (88 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 618 ms. (64 steps per ms) remains 7/7 properties
[2024-06-01 08:10:37] [INFO ] Flow matrix only has 1901 transitions (discarded 18713 similar events)
// Phase 1: matrix 1901 rows 324 cols
[2024-06-01 08:10:37] [INFO ] Computed 36 invariants in 60 ms
[2024-06-01 08:10:37] [INFO ] State equation strengthened by 1044 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 9/96 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 9/105 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 918/1023 variables, 105/121 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1023 variables, 195/316 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1023 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 1130/2153 variables, 147/463 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2153 variables, 849/1312 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2153 variables, 0/1312 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 72/2225 variables, 72/1384 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2225 variables, 20/1404 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2225 variables, 0/1404 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/2225 variables, 0/1404 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2225/2225 variables, and 1404 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2842 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 324/324 constraints, ReadFeed: 1044/1044 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 9/96 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 9/105 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 918/1023 variables, 105/121 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1023 variables, 195/316 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1023 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1023 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 1130/2153 variables, 147/464 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2153 variables, 849/1313 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2153 variables, 1/1314 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2153 variables, 0/1314 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 72/2225 variables, 72/1386 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2225 variables, 20/1406 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2225 variables, 5/1411 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2225/2225 variables, and 1411 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5033 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 324/324 constraints, ReadFeed: 1044/1044 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 8802ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 87 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 20614/20614 transitions.
Graph (complete) has 3631 edges and 324 vertex of which 310 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.50 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 29 places
Drop transitions (Empty/Sink Transition effects.) removed 625 transitions
Ensure Unique test removed 431 transitions
Reduce isomorphic transitions removed 1056 transitions.
Iterating post reduction 0 with 1085 rules applied. Total rules applied 1086 place count 281 transition count 19558
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1086 place count 281 transition count 19557
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1088 place count 280 transition count 19557
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 1106 place count 262 transition count 16657
Iterating global reduction 1 with 18 rules applied. Total rules applied 1124 place count 262 transition count 16657
Ensure Unique test removed 950 transitions
Reduce isomorphic transitions removed 950 transitions.
Iterating post reduction 1 with 950 rules applied. Total rules applied 2074 place count 262 transition count 15707
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 2078 place count 258 transition count 15703
Iterating global reduction 2 with 4 rules applied. Total rules applied 2082 place count 258 transition count 15703
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 2083 place count 257 transition count 15702
Iterating global reduction 2 with 1 rules applied. Total rules applied 2084 place count 257 transition count 15702
Drop transitions (Redundant composition of simpler transitions.) removed 3951 transitions
Redundant transition composition rules discarded 3951 transitions
Iterating global reduction 2 with 3951 rules applied. Total rules applied 6035 place count 257 transition count 11751
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 268 transitions
Ensure Unique test removed 462 transitions
Reduce isomorphic transitions removed 730 transitions.
Iterating post reduction 2 with 736 rules applied. Total rules applied 6771 place count 251 transition count 11021
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 6779 place count 243 transition count 9549
Iterating global reduction 3 with 8 rules applied. Total rules applied 6787 place count 243 transition count 9549
Ensure Unique test removed 876 transitions
Reduce isomorphic transitions removed 876 transitions.
Iterating post reduction 3 with 876 rules applied. Total rules applied 7663 place count 243 transition count 8673
Drop transitions (Redundant composition of simpler transitions.) removed 412 transitions
Redundant transition composition rules discarded 412 transitions
Iterating global reduction 4 with 412 rules applied. Total rules applied 8075 place count 243 transition count 8261
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 8078 place count 243 transition count 8258
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 8081 place count 240 transition count 8258
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 8082 place count 239 transition count 8257
Applied a total of 8082 rules in 8309 ms. Remains 239 /324 variables (removed 85) and now considering 8257/20614 (removed 12357) transitions.
Running 7613 sub problems to find dead transitions.
[2024-06-01 08:10:54] [INFO ] Flow matrix only has 1324 transitions (discarded 6933 similar events)
Normalized transition count is 1323 out of 1324 initially.
// Phase 1: matrix 1323 rows 239 cols
[2024-06-01 08:10:54] [INFO ] Computed 7 invariants in 8 ms
[2024-06-01 08:10:54] [INFO ] State equation strengthened by 678 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7613 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/1563 variables, and 5 constraints, problems are : Problem set: 0 solved, 7613 unsolved in 20191 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/239 constraints, ReadFeed: 0/678 constraints, PredecessorRefiner: 7613/7613 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7613 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7613 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 236/1563 variables, and 5 constraints, problems are : Problem set: 0 solved, 7613 unsolved in 20125 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/239 constraints, ReadFeed: 0/678 constraints, PredecessorRefiner: 0/7613 constraints, Known Traps: 0/0 constraints]
After SMT, in 75233ms problems are : Problem set: 0 solved, 7613 unsolved
Search for dead transitions found 0 dead transitions in 75342ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83707 ms. Remains : 239/324 places, 8257/20614 transitions.
RANDOM walk for 40004 steps (8 resets) in 2250 ms. (17 steps per ms) remains 6/7 properties
FORMULA SemanticWebServices-PT-S256P15-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 5/6 properties
FORMULA SemanticWebServices-PT-S256P15-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 772 ms. (51 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 731 ms. (54 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 5/5 properties
[2024-06-01 08:12:10] [INFO ] Flow matrix only has 1324 transitions (discarded 6933 similar events)
[2024-06-01 08:12:10] [INFO ] Invariant cache hit.
[2024-06-01 08:12:10] [INFO ] State equation strengthened by 678 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 3/84 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 1/85 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 658/743 variables, 85/92 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/743 variables, 90/182 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/743 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 731/1474 variables, 109/291 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1474 variables, 286/577 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1474 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 18/1492 variables, 10/587 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1492 variables, 235/822 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1492 variables, 0/822 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 26/1518 variables, 51/873 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1518 variables, 2/875 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1518 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 25/1543 variables, 25/900 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1543 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 8/1551 variables, 11/911 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1551 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 8/1559 variables, 8/919 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1559 variables, 0/919 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 2/1561 variables, 3/922 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1561 variables, 0/922 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (OVERLAPS) 2/1563 variables, 2/924 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1563 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (OVERLAPS) 0/1563 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1563/1563 variables, and 924 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2027 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 239/239 constraints, ReadFeed: 678/678 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/81 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 3/84 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 1/85 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 658/743 variables, 85/92 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/743 variables, 90/182 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/743 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/743 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 731/1474 variables, 109/292 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1474 variables, 286/578 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1474 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 18/1492 variables, 10/588 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1492 variables, 235/823 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1492 variables, 0/823 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 26/1518 variables, 51/874 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1518 variables, 2/876 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1518 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 25/1543 variables, 25/901 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1543 variables, 4/905 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1543 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 8/1551 variables, 11/916 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1551 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 8/1559 variables, 8/924 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1559 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (OVERLAPS) 2/1561 variables, 3/927 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1561 variables, 0/927 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (OVERLAPS) 2/1563 variables, 2/929 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1563 variables, 0/929 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (OVERLAPS) 0/1563 variables, 0/929 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1563/1563 variables, and 929 constraints, problems are : Problem set: 0 solved, 5 unsolved in 4688 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 239/239 constraints, ReadFeed: 678/678 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 6909ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
FORMULA SemanticWebServices-PT-S256P15-ReachabilityCardinality-2024-12 FALSE TECHNIQUES PARIKH_WALK
FORMULA SemanticWebServices-PT-S256P15-ReachabilityCardinality-2024-04 TRUE TECHNIQUES PARIKH_WALK
FORMULA SemanticWebServices-PT-S256P15-ReachabilityCardinality-2024-03 TRUE TECHNIQUES PARIKH_WALK
FORMULA SemanticWebServices-PT-S256P15-ReachabilityCardinality-2024-00 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 231 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=38 )
FORMULA SemanticWebServices-PT-S256P15-ReachabilityCardinality-2024-05 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 1124 ms.
All properties solved without resorting to model-checking.
Total runtime 105399 ms.
ITS solved all properties within timeout

BK_STOP 1717229538947

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML

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="SemanticWebServices-PT-S256P15"
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 SemanticWebServices-PT-S256P15, 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 r524-tall-171679080700598"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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