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-171636266400207.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-10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636266400207
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K 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 3.1M 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-10-ReachabilityFireability-2023-00
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityFireability-2024-01
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityFireability-2024-02
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityFireability-2024-03
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityFireability-2023-04
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityFireability-2024-05
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityFireability-2024-06
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityFireability-2024-07
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityFireability-2024-08
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityFireability-2024-09
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityFireability-2024-10
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityFireability-2023-11
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityFireability-2024-12
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityFireability-2024-13
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityFireability-2023-14
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717237791869

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 10:29:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 10:29:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 10:29:55] [INFO ] Load time of PNML (sax parser for PT used): 717 ms
[2024-06-01 10:29:55] [INFO ] Transformed 1090 places.
[2024-06-01 10:29:55] [INFO ] Transformed 5200 transitions.
[2024-06-01 10:29:55] [INFO ] Found NUPN structural information;
[2024-06-01 10:29:55] [INFO ] Parsed PT model containing 1090 places and 5200 transitions and 25400 arcs in 1057 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 39 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 2624 ms. (15 steps per ms) remains 13/16 properties
FORMULA EisenbergMcGuire-PT-10-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 264 ms. (150 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 928 ms. (43 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1400 ms. (28 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 13/13 properties
[2024-06-01 10:29:57] [INFO ] Flow matrix only has 2330 transitions (discarded 2870 similar events)
// Phase 1: matrix 2330 rows 1090 cols
[2024-06-01 10:29:57] [INFO ] Computed 31 invariants in 39 ms
[2024-06-01 10:29:58] [INFO ] State equation strengthened by 1246 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 143/143 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem EisenbergMcGuire-PT-10-ReachabilityFireability-2024-09 is UNSAT
FORMULA EisenbergMcGuire-PT-10-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/144 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/144 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 946/1089 variables, 20/164 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1089 variables, 946/1110 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1089 variables, 9/1119 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1089 variables, 0/1119 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 1/1090 variables, 1/1120 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1090 variables, 1/1121 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1090 variables, 0/1121 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 2330/3420 variables, 1090/2211 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3420 variables, 1246/3457 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3420/3420 variables, and 3457 constraints, problems are : Problem set: 1 solved, 12 unsolved in 5089 ms.
Refiners :[Domain max(s): 1090/1090 constraints, Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 1090/1090 constraints, ReadFeed: 1246/1246 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 135/135 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/136 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-06-01 10:30:03] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 19 ms to minimize.
[2024-06-01 10:30:03] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 2/138 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-06-01 10:30:04] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-06-01 10:30:04] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 2/140 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/140 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 954/1089 variables, 20/160 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1089 variables, 954/1114 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1089 variables, 9/1123 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-06-01 10:30:06] [INFO ] Deduced a trap composed of 3 places in 1491 ms of which 16 ms to minimize.
[2024-06-01 10:30:08] [INFO ] Deduced a trap composed of 3 places in 1730 ms of which 17 ms to minimize.
SMT process timed out in 10878ms, After SMT, problems are : Problem set: 1 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 135 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 5200/5200 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1090 transition count 5196
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 1086 transition count 5196
Performed 283 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 283 Pre rules applied. Total rules applied 8 place count 1086 transition count 4913
Deduced a syphon composed of 283 places in 9 ms
Reduce places removed 283 places and 0 transitions.
Iterating global reduction 2 with 566 rules applied. Total rules applied 574 place count 803 transition count 4913
Discarding 75 places :
Symmetric choice reduction at 2 with 75 rule applications. Total rules 649 place count 728 transition count 4163
Iterating global reduction 2 with 75 rules applied. Total rules applied 724 place count 728 transition count 4163
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 21 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 898 place count 641 transition count 4076
Applied a total of 898 rules in 1306 ms. Remains 641 /1090 variables (removed 449) and now considering 4076/5200 (removed 1124) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1335 ms. Remains : 641/1090 places, 4076/5200 transitions.
RANDOM walk for 40000 steps (8 resets) in 769 ms. (51 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 390 ms. (102 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 318 ms. (125 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 221 ms. (180 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 101365 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :0 out of 12
Probabilistic random walk after 101365 steps, saw 75996 distinct states, run finished after 3006 ms. (steps per millisecond=33 ) properties seen :0
[2024-06-01 10:30:13] [INFO ] Flow matrix only has 1206 transitions (discarded 2870 similar events)
// Phase 1: matrix 1206 rows 641 cols
[2024-06-01 10:30:13] [INFO ] Computed 31 invariants in 13 ms
[2024-06-01 10:30:14] [INFO ] State equation strengthened by 571 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 505/640 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/640 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 1/641 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/641 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 1206/1847 variables, 641/672 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1847 variables, 571/1243 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1847 variables, 0/1243 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/1847 variables, 0/1243 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1847/1847 variables, and 1243 constraints, problems are : Problem set: 0 solved, 12 unsolved in 3219 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 641/641 constraints, ReadFeed: 571/571 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 10:30:17] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 505/640 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 9/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 10:30:18] [INFO ] Deduced a trap composed of 11 places in 1148 ms of which 13 ms to minimize.
[2024-06-01 10:30:19] [INFO ] Deduced a trap composed of 13 places in 894 ms of which 5 ms to minimize.
[2024-06-01 10:30:20] [INFO ] Deduced a trap composed of 45 places in 962 ms of which 8 ms to minimize.
[2024-06-01 10:30:21] [INFO ] Deduced a trap composed of 38 places in 1036 ms of which 9 ms to minimize.
[2024-06-01 10:30:22] [INFO ] Deduced a trap composed of 3 places in 988 ms of which 8 ms to minimize.
[2024-06-01 10:30:23] [INFO ] Deduced a trap composed of 3 places in 413 ms of which 5 ms to minimize.
[2024-06-01 10:30:23] [INFO ] Deduced a trap composed of 15 places in 275 ms of which 3 ms to minimize.
[2024-06-01 10:30:23] [INFO ] Deduced a trap composed of 40 places in 200 ms of which 3 ms to minimize.
[2024-06-01 10:30:24] [INFO ] Deduced a trap composed of 44 places in 204 ms of which 2 ms to minimize.
[2024-06-01 10:30:24] [INFO ] Deduced a trap composed of 3 places in 290 ms of which 3 ms to minimize.
[2024-06-01 10:30:25] [INFO ] Deduced a trap composed of 3 places in 454 ms of which 5 ms to minimize.
[2024-06-01 10:30:25] [INFO ] Deduced a trap composed of 3 places in 404 ms of which 4 ms to minimize.
[2024-06-01 10:30:25] [INFO ] Deduced a trap composed of 35 places in 308 ms of which 3 ms to minimize.
[2024-06-01 10:30:27] [INFO ] Deduced a trap composed of 29 places in 1102 ms of which 9 ms to minimize.
[2024-06-01 10:30:28] [INFO ] Deduced a trap composed of 90 places in 1168 ms of which 10 ms to minimize.
[2024-06-01 10:30:29] [INFO ] Deduced a trap composed of 86 places in 1125 ms of which 9 ms to minimize.
[2024-06-01 10:30:30] [INFO ] Deduced a trap composed of 80 places in 1166 ms of which 10 ms to minimize.
[2024-06-01 10:30:31] [INFO ] Deduced a trap composed of 20 places in 639 ms of which 5 ms to minimize.
[2024-06-01 10:30:32] [INFO ] Deduced a trap composed of 28 places in 734 ms of which 6 ms to minimize.
[2024-06-01 10:30:33] [INFO ] Deduced a trap composed of 39 places in 841 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/640 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 10:30:34] [INFO ] Deduced a trap composed of 129 places in 934 ms of which 8 ms to minimize.
[2024-06-01 10:30:35] [INFO ] Deduced a trap composed of 133 places in 961 ms of which 8 ms to minimize.
[2024-06-01 10:30:36] [INFO ] Deduced a trap composed of 140 places in 950 ms of which 8 ms to minimize.
[2024-06-01 10:30:37] [INFO ] Deduced a trap composed of 162 places in 946 ms of which 8 ms to minimize.
[2024-06-01 10:30:37] [INFO ] Deduced a trap composed of 135 places in 943 ms of which 10 ms to minimize.
[2024-06-01 10:30:38] [INFO ] Deduced a trap composed of 3 places in 144 ms of which 2 ms to minimize.
[2024-06-01 10:30:38] [INFO ] Deduced a trap composed of 17 places in 639 ms of which 6 ms to minimize.
[2024-06-01 10:30:39] [INFO ] Deduced a trap composed of 34 places in 508 ms of which 7 ms to minimize.
[2024-06-01 10:30:39] [INFO ] Deduced a trap composed of 21 places in 408 ms of which 5 ms to minimize.
[2024-06-01 10:30:40] [INFO ] Deduced a trap composed of 27 places in 302 ms of which 3 ms to minimize.
[2024-06-01 10:30:41] [INFO ] Deduced a trap composed of 115 places in 1082 ms of which 8 ms to minimize.
[2024-06-01 10:30:42] [INFO ] Deduced a trap composed of 99 places in 1047 ms of which 9 ms to minimize.
[2024-06-01 10:30:43] [INFO ] Deduced a trap composed of 101 places in 1149 ms of which 11 ms to minimize.
[2024-06-01 10:30:44] [INFO ] Deduced a trap composed of 99 places in 1013 ms of which 7 ms to minimize.
[2024-06-01 10:30:45] [INFO ] Deduced a trap composed of 80 places in 759 ms of which 9 ms to minimize.
[2024-06-01 10:30:46] [INFO ] Deduced a trap composed of 116 places in 1076 ms of which 10 ms to minimize.
[2024-06-01 10:30:47] [INFO ] Deduced a trap composed of 114 places in 1068 ms of which 10 ms to minimize.
[2024-06-01 10:30:48] [INFO ] Deduced a trap composed of 142 places in 1042 ms of which 8 ms to minimize.
[2024-06-01 10:30:49] [INFO ] Deduced a trap composed of 136 places in 1014 ms of which 9 ms to minimize.
[2024-06-01 10:30:50] [INFO ] Deduced a trap composed of 103 places in 982 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/640 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 10:30:52] [INFO ] Deduced a trap composed of 131 places in 1211 ms of which 9 ms to minimize.
[2024-06-01 10:30:53] [INFO ] Deduced a trap composed of 3 places in 1232 ms of which 10 ms to minimize.
[2024-06-01 10:30:54] [INFO ] Deduced a trap composed of 139 places in 1156 ms of which 9 ms to minimize.
[2024-06-01 10:30:55] [INFO ] Deduced a trap composed of 136 places in 887 ms of which 8 ms to minimize.
[2024-06-01 10:30:56] [INFO ] Deduced a trap composed of 174 places in 1129 ms of which 9 ms to minimize.
[2024-06-01 10:30:57] [INFO ] Deduced a trap composed of 114 places in 1201 ms of which 10 ms to minimize.
[2024-06-01 10:30:58] [INFO ] Deduced a trap composed of 21 places in 313 ms of which 3 ms to minimize.
[2024-06-01 10:30:59] [INFO ] Deduced a trap composed of 225 places in 1174 ms of which 10 ms to minimize.
[2024-06-01 10:31:00] [INFO ] Deduced a trap composed of 165 places in 1138 ms of which 9 ms to minimize.
[2024-06-01 10:31:01] [INFO ] Deduced a trap composed of 128 places in 1051 ms of which 13 ms to minimize.
[2024-06-01 10:31:02] [INFO ] Deduced a trap composed of 121 places in 1183 ms of which 10 ms to minimize.
SMT process timed out in 48950ms, After SMT, problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 135 out of 641 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 641/641 places, 4076/4076 transitions.
Applied a total of 0 rules in 310 ms. Remains 641 /641 variables (removed 0) and now considering 4076/4076 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 310 ms. Remains : 641/641 places, 4076/4076 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 641/641 places, 4076/4076 transitions.
Applied a total of 0 rules in 441 ms. Remains 641 /641 variables (removed 0) and now considering 4076/4076 (removed 0) transitions.
[2024-06-01 10:31:03] [INFO ] Flow matrix only has 1206 transitions (discarded 2870 similar events)
[2024-06-01 10:31:03] [INFO ] Invariant cache hit.
[2024-06-01 10:31:04] [INFO ] Implicit Places using invariants in 895 ms returned []
[2024-06-01 10:31:04] [INFO ] Flow matrix only has 1206 transitions (discarded 2870 similar events)
[2024-06-01 10:31:04] [INFO ] Invariant cache hit.
[2024-06-01 10:31:05] [INFO ] State equation strengthened by 571 read => feed constraints.
[2024-06-01 10:31:10] [INFO ] Implicit Places using invariants and state equation in 6141 ms returned []
Implicit Place search using SMT with State Equation took 7050 ms to find 0 implicit places.
[2024-06-01 10:31:11] [INFO ] Redundant transitions in 594 ms returned []
Running 4066 sub problems to find dead transitions.
[2024-06-01 10:31:11] [INFO ] Flow matrix only has 1206 transitions (discarded 2870 similar events)
[2024-06-01 10:31:11] [INFO ] Invariant cache hit.
[2024-06-01 10:31:11] [INFO ] State equation strengthened by 571 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/641 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4066 unsolved
SMT process timed out in 34846ms, After SMT, problems are : Problem set: 0 solved, 4066 unsolved
Search for dead transitions found 0 dead transitions in 34926ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43070 ms. Remains : 641/641 places, 4076/4076 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2095 edges and 641 vertex of which 94 / 641 are part of one of the 10 SCC in 9 ms
Free SCC test removed 84 places
Drop transitions (Empty/Sink Transition effects.) removed 299 transitions
Ensure Unique test removed 2916 transitions
Reduce isomorphic transitions removed 3215 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 557 transition count 798
Reduce places removed 63 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 69 rules applied. Total rules applied 133 place count 494 transition count 792
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 139 place count 488 transition count 792
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 139 place count 488 transition count 780
Deduced a syphon composed of 12 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 165 place count 474 transition count 780
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 170 place count 469 transition count 775
Iterating global reduction 3 with 5 rules applied. Total rules applied 175 place count 469 transition count 775
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 1 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 415 place count 349 transition count 655
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 3 with 25 rules applied. Total rules applied 440 place count 349 transition count 630
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 446 place count 346 transition count 647
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 448 place count 346 transition count 645
Drop transitions (Redundant composition of simpler transitions.) removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 5 with 55 rules applied. Total rules applied 503 place count 346 transition count 590
Free-agglomeration rule applied 107 times.
Iterating global reduction 5 with 107 rules applied. Total rules applied 610 place count 346 transition count 483
Reduce places removed 107 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 108 rules applied. Total rules applied 718 place count 239 transition count 482
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 720 place count 239 transition count 480
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 727 place count 239 transition count 480
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 728 place count 239 transition count 479
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 729 place count 239 transition count 479
Applied a total of 729 rules in 243 ms. Remains 239 /641 variables (removed 402) and now considering 479/4076 (removed 3597) transitions.
Running SMT prover for 12 properties.
// Phase 1: matrix 479 rows 239 cols
[2024-06-01 10:31:46] [INFO ] Computed 29 invariants in 4 ms
[2024-06-01 10:31:46] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2024-06-01 10:31:47] [INFO ] [Nat]Absence check using 21 positive place invariants in 8 ms returned sat
[2024-06-01 10:31:47] [INFO ] [Nat]Absence check using 21 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-01 10:31:48] [INFO ] After 1120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
TRAPS : Iteration 0
[2024-06-01 10:31:48] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 2 ms to minimize.
[2024-06-01 10:31:48] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 2 ms to minimize.
[2024-06-01 10:31:48] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 2 ms to minimize.
[2024-06-01 10:31:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 251 ms
[2024-06-01 10:31:48] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 2 ms to minimize.
[2024-06-01 10:31:49] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 2 ms to minimize.
[2024-06-01 10:31:49] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 2 ms to minimize.
[2024-06-01 10:31:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 299 ms
[2024-06-01 10:31:49] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 2 ms to minimize.
[2024-06-01 10:31:49] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-06-01 10:31:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 172 ms
[2024-06-01 10:31:49] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-06-01 10:31:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
TRAPS : Iteration 1
[2024-06-01 10:31:51] [INFO ] After 4316ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
[2024-06-01 10:31:52] [INFO ] After 5531ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Over-approximation ignoring read arcs solved 0 properties in 6211 ms.
[2024-06-01 10:31:52] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 11 ms.
[2024-06-01 10:31:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 641 places, 4076 transitions and 21652 arcs took 60 ms.
[2024-06-01 10:31:53] [INFO ] Flatten gal took : 478 ms
Total runtime 119322 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-10-ReachabilityFireability-2023-00
Could not compute solution for formula : EisenbergMcGuire-PT-10-ReachabilityFireability-2024-01
Could not compute solution for formula : EisenbergMcGuire-PT-10-ReachabilityFireability-2024-02
Could not compute solution for formula : EisenbergMcGuire-PT-10-ReachabilityFireability-2024-03
Could not compute solution for formula : EisenbergMcGuire-PT-10-ReachabilityFireability-2023-04
Could not compute solution for formula : EisenbergMcGuire-PT-10-ReachabilityFireability-2024-05
Could not compute solution for formula : EisenbergMcGuire-PT-10-ReachabilityFireability-2024-06
Could not compute solution for formula : EisenbergMcGuire-PT-10-ReachabilityFireability-2024-07
Could not compute solution for formula : EisenbergMcGuire-PT-10-ReachabilityFireability-2024-10
Could not compute solution for formula : EisenbergMcGuire-PT-10-ReachabilityFireability-2023-11
Could not compute solution for formula : EisenbergMcGuire-PT-10-ReachabilityFireability-2023-14
Could not compute solution for formula : EisenbergMcGuire-PT-10-ReachabilityFireability-2024-15

BK_STOP 1717237913962

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name EisenbergMcGuire-PT-10-ReachabilityFireability-2023-00
rfs formula type AG
rfs formula formula --invariant=/tmp/786/inv_0_
rfs formula name EisenbergMcGuire-PT-10-ReachabilityFireability-2024-01
rfs formula type AG
rfs formula formula --invariant=/tmp/786/inv_1_
rfs formula name EisenbergMcGuire-PT-10-ReachabilityFireability-2024-02
rfs formula type EF
rfs formula formula --invariant=/tmp/786/inv_2_
rfs formula name EisenbergMcGuire-PT-10-ReachabilityFireability-2024-03
rfs formula type AG
rfs formula formula --invariant=/tmp/786/inv_3_
rfs formula name EisenbergMcGuire-PT-10-ReachabilityFireability-2023-04
rfs formula type AG
rfs formula formula --invariant=/tmp/786/inv_4_
rfs formula name EisenbergMcGuire-PT-10-ReachabilityFireability-2024-05
rfs formula type EF
rfs formula formula --invariant=/tmp/786/inv_5_
rfs formula name EisenbergMcGuire-PT-10-ReachabilityFireability-2024-06
rfs formula type AG
rfs formula formula --invariant=/tmp/786/inv_6_
rfs formula name EisenbergMcGuire-PT-10-ReachabilityFireability-2024-07
rfs formula type EF
rfs formula formula --invariant=/tmp/786/inv_7_
rfs formula name EisenbergMcGuire-PT-10-ReachabilityFireability-2024-10
rfs formula type EF
rfs formula formula --invariant=/tmp/786/inv_8_
rfs formula name EisenbergMcGuire-PT-10-ReachabilityFireability-2023-11
rfs formula type EF
rfs formula formula --invariant=/tmp/786/inv_9_
rfs formula name EisenbergMcGuire-PT-10-ReachabilityFireability-2023-14
rfs formula type EF
rfs formula formula --invariant=/tmp/786/inv_10_
rfs formula name EisenbergMcGuire-PT-10-ReachabilityFireability-2024-15
rfs formula type AG
rfs formula formula --invariant=/tmp/786/inv_11_
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-10"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is EisenbergMcGuire-PT-10, 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 r492-smll-171636266400207"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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