Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r421-smll-171690572800175.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 greatspnxred
Input is TokenRing-PT-015, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r421-smll-171690572800175
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 39M
-rw-r--r-- 1 mcc users 219K Apr 11 19:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Apr 11 19:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7M Apr 11 19:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 6.2M Apr 11 19:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 117K Apr 23 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 412K Apr 23 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.2M Apr 23 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 3.2M Apr 23 08:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 595K Apr 11 20:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 3.0M Apr 11 20:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.2M Apr 11 19:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16M Apr 11 19:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 28K Apr 23 08:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 71K Apr 23 08:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.7M 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 TokenRing-PT-015-ReachabilityFireability-2024-00
FORMULA_NAME TokenRing-PT-015-ReachabilityFireability-2024-01
FORMULA_NAME TokenRing-PT-015-ReachabilityFireability-2024-02
FORMULA_NAME TokenRing-PT-015-ReachabilityFireability-2024-03
FORMULA_NAME TokenRing-PT-015-ReachabilityFireability-2024-04
FORMULA_NAME TokenRing-PT-015-ReachabilityFireability-2024-05
FORMULA_NAME TokenRing-PT-015-ReachabilityFireability-2024-06
FORMULA_NAME TokenRing-PT-015-ReachabilityFireability-2024-07
FORMULA_NAME TokenRing-PT-015-ReachabilityFireability-2024-08
FORMULA_NAME TokenRing-PT-015-ReachabilityFireability-2024-09
FORMULA_NAME TokenRing-PT-015-ReachabilityFireability-2024-10
FORMULA_NAME TokenRing-PT-015-ReachabilityFireability-2024-11
FORMULA_NAME TokenRing-PT-015-ReachabilityFireability-2024-12
FORMULA_NAME TokenRing-PT-015-ReachabilityFireability-2024-13
FORMULA_NAME TokenRing-PT-015-ReachabilityFireability-2024-14
FORMULA_NAME TokenRing-PT-015-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717007583266

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TokenRing-PT-015
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 18:33:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 18:33:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 18:33:07] [INFO ] Load time of PNML (sax parser for PT used): 527 ms
[2024-05-29 18:33:07] [INFO ] Transformed 256 places.
[2024-05-29 18:33:07] [INFO ] Transformed 3616 transitions.
[2024-05-29 18:33:07] [INFO ] Found NUPN structural information;
[2024-05-29 18:33:07] [INFO ] Parsed PT model containing 256 places and 3616 transitions and 14464 arcs in 805 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 676 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Working with output stream class java.io.PrintStream
FORMULA TokenRing-PT-015-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-015-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-015-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 3294 ms. (12 steps per ms) remains 6/12 properties
FORMULA TokenRing-PT-015-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TokenRing-PT-015-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TokenRing-PT-015-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TokenRing-PT-015-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TokenRing-PT-015-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TokenRing-PT-015-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TokenRing-PT-015-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40000 steps (8 resets) in 1186 ms. (33 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 634 ms. (62 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 507 ms. (78 steps per ms) remains 5/6 properties
FORMULA TokenRing-PT-015-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40000 steps (8 resets) in 490 ms. (81 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 625 ms. (63 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 529 ms. (75 steps per ms) remains 5/5 properties
// Phase 1: matrix 3616 rows 256 cols
[2024-05-29 18:33:12] [INFO ] Computed 16 invariants in 38 ms
[2024-05-29 18:33:12] [INFO ] State equation strengthened by 3390 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 169/256 variables, 16/103 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 169/272 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 3616/3872 variables, 256/528 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3872 variables, 3390/3918 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3872/3872 variables, and 3918 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3829 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 169/256 variables, 16/103 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 169/272 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 18:33:17] [INFO ] Deduced a trap composed of 141 places in 748 ms of which 52 ms to minimize.
[2024-05-29 18:33:18] [INFO ] Deduced a trap composed of 142 places in 681 ms of which 5 ms to minimize.
[2024-05-29 18:33:18] [INFO ] Deduced a trap composed of 139 places in 645 ms of which 5 ms to minimize.
[2024-05-29 18:33:19] [INFO ] Deduced a trap composed of 141 places in 686 ms of which 4 ms to minimize.
[2024-05-29 18:33:20] [INFO ] Deduced a trap composed of 142 places in 769 ms of which 6 ms to minimize.
[2024-05-29 18:33:21] [INFO ] Deduced a trap composed of 140 places in 682 ms of which 6 ms to minimize.
[2024-05-29 18:33:21] [INFO ] Deduced a trap composed of 137 places in 653 ms of which 4 ms to minimize.
SMT process timed out in 9664ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 87 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 300 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 323 ms. Remains : 256/256 places, 3616/3616 transitions.
RANDOM walk for 40000 steps (8 resets) in 891 ms. (44 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 501 ms. (79 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 425 ms. (93 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 473 ms. (84 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 478 ms. (83 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 364 ms. (109 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 72602 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :0 out of 5
Probabilistic random walk after 72602 steps, saw 14861 distinct states, run finished after 3015 ms. (steps per millisecond=24 ) properties seen :0
[2024-05-29 18:33:26] [INFO ] Invariant cache hit.
[2024-05-29 18:33:26] [INFO ] State equation strengthened by 3390 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 169/256 variables, 16/103 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 169/272 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 3616/3872 variables, 256/528 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3872 variables, 3390/3918 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/3872 variables, 0/3918 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3872/3872 variables, and 3918 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3371 ms.
Refiners :[Domain max(s): 256/256 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 256/256 constraints, ReadFeed: 3390/3390 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 169/256 variables, 16/103 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 169/272 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 18:33:30] [INFO ] Deduced a trap composed of 146 places in 680 ms of which 5 ms to minimize.
[2024-05-29 18:33:31] [INFO ] Deduced a trap composed of 140 places in 782 ms of which 5 ms to minimize.
[2024-05-29 18:33:32] [INFO ] Deduced a trap composed of 142 places in 501 ms of which 3 ms to minimize.
[2024-05-29 18:33:32] [INFO ] Deduced a trap composed of 144 places in 555 ms of which 5 ms to minimize.
[2024-05-29 18:33:33] [INFO ] Deduced a trap composed of 144 places in 433 ms of which 3 ms to minimize.
[2024-05-29 18:33:33] [INFO ] Deduced a trap composed of 146 places in 481 ms of which 3 ms to minimize.
[2024-05-29 18:33:34] [INFO ] Deduced a trap composed of 146 places in 428 ms of which 4 ms to minimize.
[2024-05-29 18:33:34] [INFO ] Deduced a trap composed of 142 places in 645 ms of which 3 ms to minimize.
[2024-05-29 18:33:35] [INFO ] Deduced a trap composed of 144 places in 655 ms of which 4 ms to minimize.
[2024-05-29 18:33:36] [INFO ] Deduced a trap composed of 152 places in 618 ms of which 5 ms to minimize.
[2024-05-29 18:33:36] [INFO ] Deduced a trap composed of 144 places in 680 ms of which 5 ms to minimize.
[2024-05-29 18:33:37] [INFO ] Deduced a trap composed of 139 places in 586 ms of which 4 ms to minimize.
[2024-05-29 18:33:38] [INFO ] Deduced a trap composed of 150 places in 562 ms of which 4 ms to minimize.
[2024-05-29 18:33:38] [INFO ] Deduced a trap composed of 149 places in 618 ms of which 4 ms to minimize.
[2024-05-29 18:33:39] [INFO ] Deduced a trap composed of 149 places in 747 ms of which 4 ms to minimize.
[2024-05-29 18:33:40] [INFO ] Deduced a trap composed of 143 places in 664 ms of which 4 ms to minimize.
[2024-05-29 18:33:41] [INFO ] Deduced a trap composed of 139 places in 766 ms of which 5 ms to minimize.
[2024-05-29 18:33:41] [INFO ] Deduced a trap composed of 142 places in 690 ms of which 4 ms to minimize.
[2024-05-29 18:33:42] [INFO ] Deduced a trap composed of 139 places in 750 ms of which 5 ms to minimize.
[2024-05-29 18:33:43] [INFO ] Deduced a trap composed of 140 places in 822 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 20/292 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 18:33:44] [INFO ] Deduced a trap composed of 141 places in 661 ms of which 5 ms to minimize.
[2024-05-29 18:33:44] [INFO ] Deduced a trap composed of 137 places in 665 ms of which 5 ms to minimize.
[2024-05-29 18:33:45] [INFO ] Deduced a trap composed of 142 places in 711 ms of which 5 ms to minimize.
[2024-05-29 18:33:46] [INFO ] Deduced a trap composed of 140 places in 804 ms of which 5 ms to minimize.
[2024-05-29 18:33:47] [INFO ] Deduced a trap composed of 141 places in 683 ms of which 4 ms to minimize.
[2024-05-29 18:33:48] [INFO ] Deduced a trap composed of 141 places in 856 ms of which 4 ms to minimize.
[2024-05-29 18:33:48] [INFO ] Deduced a trap composed of 141 places in 744 ms of which 6 ms to minimize.
[2024-05-29 18:33:49] [INFO ] Deduced a trap composed of 141 places in 674 ms of which 21 ms to minimize.
[2024-05-29 18:33:50] [INFO ] Deduced a trap composed of 139 places in 668 ms of which 4 ms to minimize.
[2024-05-29 18:33:51] [INFO ] Deduced a trap composed of 142 places in 614 ms of which 4 ms to minimize.
[2024-05-29 18:33:51] [INFO ] Deduced a trap composed of 140 places in 605 ms of which 4 ms to minimize.
[2024-05-29 18:33:52] [INFO ] Deduced a trap composed of 140 places in 574 ms of which 4 ms to minimize.
[2024-05-29 18:33:52] [INFO ] Deduced a trap composed of 141 places in 557 ms of which 4 ms to minimize.
[2024-05-29 18:33:53] [INFO ] Deduced a trap composed of 141 places in 558 ms of which 4 ms to minimize.
[2024-05-29 18:33:53] [INFO ] Deduced a trap composed of 139 places in 506 ms of which 4 ms to minimize.
[2024-05-29 18:33:54] [INFO ] Deduced a trap composed of 137 places in 540 ms of which 3 ms to minimize.
[2024-05-29 18:33:55] [INFO ] Deduced a trap composed of 140 places in 477 ms of which 3 ms to minimize.
[2024-05-29 18:33:55] [INFO ] Deduced a trap composed of 140 places in 464 ms of which 3 ms to minimize.
[2024-05-29 18:33:55] [INFO ] Deduced a trap composed of 140 places in 431 ms of which 2 ms to minimize.
[2024-05-29 18:33:56] [INFO ] Deduced a trap composed of 142 places in 752 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 20/312 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 18:33:57] [INFO ] Deduced a trap composed of 141 places in 648 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 18:33:58] [INFO ] Deduced a trap composed of 146 places in 655 ms of which 5 ms to minimize.
[2024-05-29 18:33:59] [INFO ] Deduced a trap composed of 145 places in 622 ms of which 2 ms to minimize.
[2024-05-29 18:34:00] [INFO ] Deduced a trap composed of 141 places in 649 ms of which 4 ms to minimize.
[2024-05-29 18:34:00] [INFO ] Deduced a trap composed of 142 places in 705 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 4/317 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 18:34:02] [INFO ] Deduced a trap composed of 138 places in 768 ms of which 5 ms to minimize.
[2024-05-29 18:34:03] [INFO ] Deduced a trap composed of 138 places in 732 ms of which 4 ms to minimize.
[2024-05-29 18:34:03] [INFO ] Deduced a trap composed of 141 places in 777 ms of which 4 ms to minimize.
[2024-05-29 18:34:04] [INFO ] Deduced a trap composed of 137 places in 781 ms of which 5 ms to minimize.
[2024-05-29 18:34:05] [INFO ] Deduced a trap composed of 141 places in 615 ms of which 4 ms to minimize.
[2024-05-29 18:34:06] [INFO ] Deduced a trap composed of 143 places in 784 ms of which 5 ms to minimize.
[2024-05-29 18:34:07] [INFO ] Deduced a trap composed of 145 places in 731 ms of which 4 ms to minimize.
[2024-05-29 18:34:07] [INFO ] Deduced a trap composed of 143 places in 805 ms of which 7 ms to minimize.
[2024-05-29 18:34:08] [INFO ] Deduced a trap composed of 142 places in 814 ms of which 4 ms to minimize.
[2024-05-29 18:34:09] [INFO ] Deduced a trap composed of 136 places in 768 ms of which 4 ms to minimize.
[2024-05-29 18:34:10] [INFO ] Deduced a trap composed of 148 places in 696 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 11/328 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 18:34:11] [INFO ] Deduced a trap composed of 146 places in 566 ms of which 3 ms to minimize.
[2024-05-29 18:34:11] [INFO ] Deduced a trap composed of 145 places in 761 ms of which 3 ms to minimize.
[2024-05-29 18:34:12] [INFO ] Deduced a trap composed of 148 places in 462 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 3/331 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 18:34:13] [INFO ] Deduced a trap composed of 144 places in 674 ms of which 5 ms to minimize.
[2024-05-29 18:34:14] [INFO ] Deduced a trap composed of 142 places in 810 ms of which 4 ms to minimize.
[2024-05-29 18:34:15] [INFO ] Deduced a trap composed of 139 places in 826 ms of which 5 ms to minimize.
SMT process timed out in 49376ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 87 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 179 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 256/256 places, 3616/3616 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 161 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2024-05-29 18:34:16] [INFO ] Invariant cache hit.
[2024-05-29 18:34:16] [INFO ] Implicit Places using invariants in 658 ms returned []
[2024-05-29 18:34:16] [INFO ] Invariant cache hit.
[2024-05-29 18:34:18] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2024-05-29 18:34:24] [INFO ] Implicit Places using invariants and state equation in 7406 ms returned []
Implicit Place search using SMT with State Equation took 8081 ms to find 0 implicit places.
[2024-05-29 18:34:24] [INFO ] Redundant transitions in 386 ms returned []
Running 3601 sub problems to find dead transitions.
[2024-05-29 18:34:24] [INFO ] Invariant cache hit.
[2024-05-29 18:34:24] [INFO ] State equation strengthened by 3390 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 3601 unsolved
SMT process timed out in 35450ms, After SMT, problems are : Problem set: 0 solved, 3601 unsolved
Search for dead transitions found 0 dead transitions in 35545ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44248 ms. Remains : 256/256 places, 3616/3616 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1593 edges and 256 vertex of which 160 / 256 are part of one of the 15 SCC in 11 ms
Free SCC test removed 145 places
Drop transitions (Empty/Sink Transition effects.) removed 1588 transitions
Ensure Unique test removed 1464 transitions
Reduce isomorphic transitions removed 3052 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 111 transition count 563
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 5 rules applied. Total rules applied 7 place count 110 transition count 559
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 11 place count 106 transition count 559
Drop transitions (Redundant composition of simpler transitions.) removed 413 transitions
Redundant transition composition rules discarded 413 transitions
Iterating global reduction 3 with 413 rules applied. Total rules applied 424 place count 106 transition count 146
Applied a total of 424 rules in 92 ms. Remains 106 /256 variables (removed 150) and now considering 146/3616 (removed 3470) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 146 rows 106 cols
[2024-05-29 18:35:00] [INFO ] Computed 16 invariants in 4 ms
[2024-05-29 18:35:00] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 18:35:00] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2024-05-29 18:35:00] [INFO ] After 228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-05-29 18:35:01] [INFO ] After 410ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-05-29 18:35:01] [INFO ] After 656ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 930 ms.
[2024-05-29 18:35:01] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 10 ms.
[2024-05-29 18:35:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 256 places, 3616 transitions and 14464 arcs took 36 ms.
[2024-05-29 18:35:02] [INFO ] Flatten gal took : 508 ms
Total runtime 115628 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running TokenRing-PT-015

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 256
TRANSITIONS: 3616
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.103s, Sys 0.006s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.023s, Sys 0.003s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 791
MODEL NAME: /home/mcc/execution/413/model
256 places, 3616 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717008667681

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML

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="TokenRing-PT-015"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is TokenRing-PT-015, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r421-smll-171690572800175"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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