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.r492-smll-171636266300190.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 EisenbergMcGuire-PT-08, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636266300190
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.7M 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 EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-00
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-01
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-02
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-03
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-04
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-05
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityCardinality-2023-06
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-07
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-08
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-09
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-10
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-11
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-12
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-13
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityCardinality-2023-14
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717230988243

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:36:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 08:36:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:36:31] [INFO ] Load time of PNML (sax parser for PT used): 573 ms
[2024-06-01 08:36:31] [INFO ] Transformed 712 places.
[2024-06-01 08:36:31] [INFO ] Transformed 2816 transitions.
[2024-06-01 08:36:31] [INFO ] Found NUPN structural information;
[2024-06-01 08:36:31] [INFO ] Parsed PT model containing 712 places and 2816 transitions and 13440 arcs in 852 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 34 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 2606 ms. (15 steps per ms) remains 9/16 properties
FORMULA EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 612 ms. (65 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 302 ms. (132 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 484 ms. (82 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 392 ms. (101 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 603 ms. (66 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 9/9 properties
[2024-06-01 08:36:33] [INFO ] Flow matrix only has 1368 transitions (discarded 1448 similar events)
// Phase 1: matrix 1368 rows 712 cols
[2024-06-01 08:36:33] [INFO ] Computed 25 invariants in 63 ms
[2024-06-01 08:36:33] [INFO ] State equation strengthened by 676 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 615/696 variables, 17/98 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/696 variables, 615/713 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/696 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 16/712 variables, 8/721 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/712 variables, 16/737 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/712 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 1368/2080 variables, 712/1449 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2080 variables, 676/2125 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2080 variables, 0/2125 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/2080 variables, 0/2125 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2080/2080 variables, and 2125 constraints, problems are : Problem set: 0 solved, 9 unsolved in 3993 ms.
Refiners :[Domain max(s): 712/712 constraints, Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 712/712 constraints, ReadFeed: 676/676 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 615/696 variables, 17/98 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/696 variables, 615/713 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/696 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 16/712 variables, 8/721 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/712 variables, 16/737 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 08:36:39] [INFO ] Deduced a trap composed of 66 places in 772 ms of which 70 ms to minimize.
[2024-06-01 08:36:40] [INFO ] Deduced a trap composed of 3 places in 531 ms of which 8 ms to minimize.
[2024-06-01 08:36:40] [INFO ] Deduced a trap composed of 33 places in 328 ms of which 4 ms to minimize.
[2024-06-01 08:36:41] [INFO ] Deduced a trap composed of 3 places in 239 ms of which 4 ms to minimize.
[2024-06-01 08:36:41] [INFO ] Deduced a trap composed of 83 places in 485 ms of which 7 ms to minimize.
[2024-06-01 08:36:41] [INFO ] Deduced a trap composed of 96 places in 257 ms of which 3 ms to minimize.
[2024-06-01 08:36:42] [INFO ] Deduced a trap composed of 3 places in 604 ms of which 10 ms to minimize.
[2024-06-01 08:36:43] [INFO ] Deduced a trap composed of 17 places in 796 ms of which 9 ms to minimize.
SMT process timed out in 9699ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 81 out of 712 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 712/712 places, 2816/2816 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 712 transition count 2808
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 704 transition count 2808
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 16 place count 704 transition count 2654
Deduced a syphon composed of 154 places in 11 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 324 place count 550 transition count 2654
Discarding 52 places :
Symmetric choice reduction at 2 with 52 rule applications. Total rules 376 place count 498 transition count 2238
Iterating global reduction 2 with 52 rules applied. Total rules applied 428 place count 498 transition count 2238
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 5 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 510 place count 457 transition count 2197
Applied a total of 510 rules in 634 ms. Remains 457 /712 variables (removed 255) and now considering 2197/2816 (removed 619) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 656 ms. Remains : 457/712 places, 2197/2816 transitions.
RANDOM walk for 40000 steps (8 resets) in 684 ms. (58 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 910 ms. (43 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 139032 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :6 out of 9
Probabilistic random walk after 139032 steps, saw 91345 distinct states, run finished after 3012 ms. (steps per millisecond=46 ) properties seen :6
FORMULA EisenbergMcGuire-PT-08-ReachabilityCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-08-ReachabilityCardinality-2023-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-01 08:36:47] [INFO ] Flow matrix only has 749 transitions (discarded 1448 similar events)
// Phase 1: matrix 749 rows 457 cols
[2024-06-01 08:36:47] [INFO ] Computed 25 invariants in 5 ms
[2024-06-01 08:36:47] [INFO ] State equation strengthened by 312 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 386/441 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/441 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 16/457 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 749/1206 variables, 457/482 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1206 variables, 312/794 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1206 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1206 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1206/1206 variables, and 794 constraints, problems are : Problem set: 0 solved, 3 unsolved in 846 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 457/457 constraints, ReadFeed: 312/312 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 386/441 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/441 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 16/457 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:36:49] [INFO ] Deduced a trap composed of 3 places in 624 ms of which 7 ms to minimize.
[2024-06-01 08:36:50] [INFO ] Deduced a trap composed of 3 places in 669 ms of which 7 ms to minimize.
[2024-06-01 08:36:50] [INFO ] Deduced a trap composed of 20 places in 640 ms of which 7 ms to minimize.
[2024-06-01 08:36:51] [INFO ] Deduced a trap composed of 76 places in 687 ms of which 7 ms to minimize.
[2024-06-01 08:36:52] [INFO ] Deduced a trap composed of 24 places in 681 ms of which 7 ms to minimize.
[2024-06-01 08:36:52] [INFO ] Deduced a trap composed of 26 places in 623 ms of which 7 ms to minimize.
[2024-06-01 08:36:53] [INFO ] Deduced a trap composed of 66 places in 647 ms of which 6 ms to minimize.
[2024-06-01 08:36:53] [INFO ] Deduced a trap composed of 40 places in 326 ms of which 4 ms to minimize.
[2024-06-01 08:36:54] [INFO ] Deduced a trap composed of 3 places in 151 ms of which 2 ms to minimize.
[2024-06-01 08:36:54] [INFO ] Deduced a trap composed of 43 places in 618 ms of which 7 ms to minimize.
[2024-06-01 08:36:55] [INFO ] Deduced a trap composed of 3 places in 643 ms of which 6 ms to minimize.
[2024-06-01 08:36:56] [INFO ] Deduced a trap composed of 15 places in 663 ms of which 7 ms to minimize.
[2024-06-01 08:36:56] [INFO ] Deduced a trap composed of 34 places in 340 ms of which 4 ms to minimize.
[2024-06-01 08:36:56] [INFO ] Deduced a trap composed of 3 places in 325 ms of which 4 ms to minimize.
[2024-06-01 08:36:57] [INFO ] Deduced a trap composed of 50 places in 313 ms of which 4 ms to minimize.
[2024-06-01 08:36:57] [INFO ] Deduced a trap composed of 34 places in 363 ms of which 5 ms to minimize.
[2024-06-01 08:36:57] [INFO ] Deduced a trap composed of 55 places in 337 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 749/1206 variables, 457/499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1206 variables, 312/811 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1206 variables, 3/814 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:36:59] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1206 variables, 1/815 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1206 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1206 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1206/1206 variables, and 815 constraints, problems are : Problem set: 0 solved, 3 unsolved in 11702 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 457/457 constraints, ReadFeed: 312/312 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 18/18 constraints]
After SMT, in 12612ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1662 ms.
Support contains 55 out of 457 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 457/457 places, 2197/2197 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 457 transition count 2181
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 441 transition count 2181
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 439 transition count 2179
Applied a total of 36 rules in 175 ms. Remains 439 /457 variables (removed 18) and now considering 2179/2197 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 439/457 places, 2179/2197 transitions.
RANDOM walk for 40000 steps (8 resets) in 235 ms. (169 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 166005 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :0 out of 3
Probabilistic random walk after 166005 steps, saw 106823 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
[2024-06-01 08:37:05] [INFO ] Flow matrix only has 731 transitions (discarded 1448 similar events)
// Phase 1: matrix 731 rows 439 cols
[2024-06-01 08:37:05] [INFO ] Computed 25 invariants in 4 ms
[2024-06-01 08:37:05] [INFO ] State equation strengthened by 312 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 368/423 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 16/439 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 731/1170 variables, 439/464 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1170 variables, 312/776 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1170 variables, 0/776 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1170 variables, 0/776 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1170/1170 variables, and 776 constraints, problems are : Problem set: 0 solved, 3 unsolved in 890 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 312/312 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 368/423 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 16/439 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:37:07] [INFO ] Deduced a trap composed of 15 places in 549 ms of which 6 ms to minimize.
[2024-06-01 08:37:07] [INFO ] Deduced a trap composed of 3 places in 538 ms of which 5 ms to minimize.
[2024-06-01 08:37:08] [INFO ] Deduced a trap composed of 25 places in 548 ms of which 5 ms to minimize.
[2024-06-01 08:37:08] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 2 ms to minimize.
[2024-06-01 08:37:08] [INFO ] Deduced a trap composed of 3 places in 469 ms of which 4 ms to minimize.
[2024-06-01 08:37:09] [INFO ] Deduced a trap composed of 49 places in 315 ms of which 4 ms to minimize.
[2024-06-01 08:37:09] [INFO ] Deduced a trap composed of 3 places in 400 ms of which 4 ms to minimize.
[2024-06-01 08:37:10] [INFO ] Deduced a trap composed of 117 places in 410 ms of which 5 ms to minimize.
[2024-06-01 08:37:10] [INFO ] Deduced a trap composed of 86 places in 572 ms of which 12 ms to minimize.
[2024-06-01 08:37:11] [INFO ] Deduced a trap composed of 3 places in 632 ms of which 7 ms to minimize.
[2024-06-01 08:37:11] [INFO ] Deduced a trap composed of 82 places in 427 ms of which 5 ms to minimize.
[2024-06-01 08:37:12] [INFO ] Deduced a trap composed of 41 places in 665 ms of which 7 ms to minimize.
[2024-06-01 08:37:12] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 1 ms to minimize.
[2024-06-01 08:37:13] [INFO ] Deduced a trap composed of 54 places in 679 ms of which 7 ms to minimize.
[2024-06-01 08:37:13] [INFO ] Deduced a trap composed of 119 places in 691 ms of which 7 ms to minimize.
[2024-06-01 08:37:14] [INFO ] Deduced a trap composed of 49 places in 377 ms of which 4 ms to minimize.
[2024-06-01 08:37:15] [INFO ] Deduced a trap composed of 94 places in 669 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:37:15] [INFO ] Deduced a trap composed of 30 places in 680 ms of which 17 ms to minimize.
[2024-06-01 08:37:16] [INFO ] Deduced a trap composed of 100 places in 650 ms of which 7 ms to minimize.
[2024-06-01 08:37:17] [INFO ] Deduced a trap composed of 100 places in 673 ms of which 7 ms to minimize.
[2024-06-01 08:37:17] [INFO ] Deduced a trap composed of 88 places in 659 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:37:18] [INFO ] Deduced a trap composed of 34 places in 646 ms of which 7 ms to minimize.
[2024-06-01 08:37:19] [INFO ] Deduced a trap composed of 92 places in 631 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 731/1170 variables, 439/487 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1170 variables, 312/799 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1170 variables, 3/802 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1170 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1170 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1170/1170 variables, and 802 constraints, problems are : Problem set: 0 solved, 3 unsolved in 14357 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 312/312 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 23/23 constraints]
After SMT, in 15298ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 936 ms.
Support contains 55 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2179/2179 transitions.
Applied a total of 0 rules in 110 ms. Remains 439 /439 variables (removed 0) and now considering 2179/2179 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 439/439 places, 2179/2179 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2179/2179 transitions.
Applied a total of 0 rules in 105 ms. Remains 439 /439 variables (removed 0) and now considering 2179/2179 (removed 0) transitions.
[2024-06-01 08:37:21] [INFO ] Flow matrix only has 731 transitions (discarded 1448 similar events)
[2024-06-01 08:37:21] [INFO ] Invariant cache hit.
[2024-06-01 08:37:22] [INFO ] Implicit Places using invariants in 847 ms returned []
[2024-06-01 08:37:22] [INFO ] Flow matrix only has 731 transitions (discarded 1448 similar events)
[2024-06-01 08:37:22] [INFO ] Invariant cache hit.
[2024-06-01 08:37:23] [INFO ] State equation strengthened by 312 read => feed constraints.
[2024-06-01 08:37:26] [INFO ] Implicit Places using invariants and state equation in 3691 ms returned []
Implicit Place search using SMT with State Equation took 4552 ms to find 0 implicit places.
[2024-06-01 08:37:26] [INFO ] Redundant transitions in 221 ms returned []
Running 2171 sub problems to find dead transitions.
[2024-06-01 08:37:26] [INFO ] Flow matrix only has 731 transitions (discarded 1448 similar events)
[2024-06-01 08:37:26] [INFO ] Invariant cache hit.
[2024-06-01 08:37:26] [INFO ] State equation strengthened by 312 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2171 unsolved
SMT process timed out in 32201ms, After SMT, problems are : Problem set: 0 solved, 2171 unsolved
Search for dead transitions found 0 dead transitions in 32250ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37164 ms. Remains : 439/439 places, 2179/2179 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1624 edges and 439 vertex of which 53 / 439 are part of one of the 8 SCC in 8 ms
Free SCC test removed 45 places
Drop transitions (Empty/Sink Transition effects.) removed 160 transitions
Ensure Unique test removed 1433 transitions
Reduce isomorphic transitions removed 1593 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 394 transition count 528
Reduce places removed 58 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 71 rules applied. Total rules applied 130 place count 336 transition count 515
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 143 place count 323 transition count 515
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 143 place count 323 transition count 505
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 165 place count 311 transition count 505
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 170 place count 306 transition count 500
Iterating global reduction 3 with 5 rules applied. Total rules applied 175 place count 306 transition count 500
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 353 place count 217 transition count 411
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 3 with 37 rules applied. Total rules applied 390 place count 217 transition count 374
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 396 place count 214 transition count 380
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 398 place count 214 transition count 378
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 5 with 29 rules applied. Total rules applied 427 place count 214 transition count 349
Free-agglomeration rule applied 54 times.
Iterating global reduction 5 with 54 rules applied. Total rules applied 481 place count 214 transition count 295
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 5 with 54 rules applied. Total rules applied 535 place count 160 transition count 295
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 538 place count 160 transition count 292
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 543 place count 160 transition count 292
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 544 place count 160 transition count 292
Applied a total of 544 rules in 235 ms. Remains 160 /439 variables (removed 279) and now considering 292/2179 (removed 1887) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 292 rows 160 cols
[2024-06-01 08:37:59] [INFO ] Computed 23 invariants in 3 ms
[2024-06-01 08:37:59] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-01 08:37:59] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2024-06-01 08:37:59] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2024-06-01 08:37:59] [INFO ] After 241ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-01 08:37:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 08:37:59] [INFO ] After 67ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-06-01 08:37:59] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:37:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2024-06-01 08:37:59] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-06-01 08:37:59] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:37:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 80 ms
TRAPS : Iteration 1
[2024-06-01 08:37:59] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:38:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
TRAPS : Iteration 2
[2024-06-01 08:38:00] [INFO ] After 495ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-06-01 08:38:00] [INFO ] After 977ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 1351 ms.
[2024-06-01 08:38:00] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2024-06-01 08:38:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 439 places, 2179 transitions and 11334 arcs took 35 ms.
[2024-06-01 08:38:01] [INFO ] Flatten gal took : 471 ms
Total runtime 90513 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 : EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-07
Could not compute solution for formula : EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-10
Could not compute solution for formula : EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-13

BK_STOP 1717231081497

--------------------
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
mcc2024
rfs formula name EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-07
rfs formula type EF
rfs formula formula --invariant=/tmp/768/inv_0_
rfs formula name EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-10
rfs formula type AG
rfs formula formula --invariant=/tmp/768/inv_1_
rfs formula name EisenbergMcGuire-PT-08-ReachabilityCardinality-2024-13
rfs formula type AG
rfs formula formula --invariant=/tmp/768/inv_2_
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="EisenbergMcGuire-PT-08"
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 EisenbergMcGuire-PT-08, 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 r492-smll-171636266300190"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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