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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K 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 3.0K 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 13K Apr 12 16:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 12 16:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 16:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 16:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 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 753K 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-06-ReachabilityFireability-2024-00
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityFireability-2024-01
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityFireability-2024-02
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityFireability-2024-03
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityFireability-2024-04
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityFireability-2024-05
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityFireability-2024-06
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityFireability-2024-07
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityFireability-2024-08
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityFireability-2024-09
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityFireability-2024-10
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityFireability-2024-11
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityFireability-2024-12
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityFireability-2024-13
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityFireability-2024-14
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717225531712

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-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:05:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:05:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:05:34] [INFO ] Load time of PNML (sax parser for PT used): 478 ms
[2024-06-01 07:05:34] [INFO ] Transformed 414 places.
[2024-06-01 07:05:34] [INFO ] Transformed 1296 transitions.
[2024-06-01 07:05:34] [INFO ] Found NUPN structural information;
[2024-06-01 07:05:34] [INFO ] Parsed PT model containing 414 places and 1296 transitions and 5976 arcs in 730 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 36 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 3639 ms. (10 steps per ms) remains 11/16 properties
FORMULA EisenbergMcGuire-PT-06-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 531 ms. (75 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 266 ms. (149 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1563 ms. (25 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 357 ms. (111 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 11/11 properties
[2024-06-01 07:05:37] [INFO ] Flow matrix only has 702 transitions (discarded 594 similar events)
// Phase 1: matrix 702 rows 414 cols
[2024-06-01 07:05:37] [INFO ] Computed 19 invariants in 32 ms
[2024-06-01 07:05:37] [INFO ] State equation strengthened by 314 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 113/113 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem EisenbergMcGuire-PT-06-ReachabilityFireability-2024-00 is UNSAT
FORMULA EisenbergMcGuire-PT-06-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem EisenbergMcGuire-PT-06-ReachabilityFireability-2024-06 is UNSAT
FORMULA EisenbergMcGuire-PT-06-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 1/114 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/114 constraints. Problems are: Problem set: 2 solved, 9 unsolved
Problem EisenbergMcGuire-PT-06-ReachabilityFireability-2024-10 is UNSAT
FORMULA EisenbergMcGuire-PT-06-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 301/414 variables, 12/126 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 301/427 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/414 variables, 6/433 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 0/433 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 702/1116 variables, 414/847 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1116 variables, 314/1161 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1116 variables, 0/1161 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/1116 variables, 0/1161 constraints. Problems are: Problem set: 3 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1116/1116 variables, and 1161 constraints, problems are : Problem set: 3 solved, 8 unsolved in 2629 ms.
Refiners :[Domain max(s): 414/414 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 414/414 constraints, ReadFeed: 314/314 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 92/92 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 1/93 constraints. Problems are: Problem set: 3 solved, 8 unsolved
[2024-06-01 07:05:40] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 39 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/94 constraints. Problems are: Problem set: 3 solved, 8 unsolved
[2024-06-01 07:05:40] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 1/95 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/95 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 322/414 variables, 12/107 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 322/429 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 6/435 constraints. Problems are: Problem set: 3 solved, 8 unsolved
[2024-06-01 07:05:41] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 5 ms to minimize.
[2024-06-01 07:05:42] [INFO ] Deduced a trap composed of 3 places in 634 ms of which 5 ms to minimize.
[2024-06-01 07:05:42] [INFO ] Deduced a trap composed of 27 places in 354 ms of which 6 ms to minimize.
[2024-06-01 07:05:42] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:05:43] [INFO ] Deduced a trap composed of 3 places in 399 ms of which 7 ms to minimize.
[2024-06-01 07:05:43] [INFO ] Deduced a trap composed of 23 places in 386 ms of which 6 ms to minimize.
[2024-06-01 07:05:43] [INFO ] Deduced a trap composed of 3 places in 303 ms of which 5 ms to minimize.
[2024-06-01 07:05:43] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:05:44] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:05:44] [INFO ] Deduced a trap composed of 32 places in 390 ms of which 5 ms to minimize.
Problem EisenbergMcGuire-PT-06-ReachabilityFireability-2024-12 is UNSAT
FORMULA EisenbergMcGuire-PT-06-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
[2024-06-01 07:05:44] [INFO ] Deduced a trap composed of 3 places in 205 ms of which 3 ms to minimize.
[2024-06-01 07:05:44] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:05:45] [INFO ] Deduced a trap composed of 3 places in 290 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 414/1116 variables, and 448 constraints, problems are : Problem set: 4 solved, 7 unsolved in 5013 ms.
Refiners :[Domain max(s): 414/414 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/414 constraints, ReadFeed: 0/314 constraints, PredecessorRefiner: 0/11 constraints, Known Traps: 15/15 constraints]
After SMT, in 8089ms problems are : Problem set: 4 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 91 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1296/1296 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 414 transition count 1293
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 411 transition count 1293
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 93 Pre rules applied. Total rules applied 6 place count 411 transition count 1200
Deduced a syphon composed of 93 places in 6 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 2 with 186 rules applied. Total rules applied 192 place count 318 transition count 1200
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 211 place count 299 transition count 1086
Iterating global reduction 2 with 19 rules applied. Total rules applied 230 place count 299 transition count 1086
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 4 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 284 place count 272 transition count 1059
Applied a total of 284 rules in 398 ms. Remains 272 /414 variables (removed 142) and now considering 1059/1296 (removed 237) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 431 ms. Remains : 272/414 places, 1059/1296 transitions.
RANDOM walk for 40000 steps (8 resets) in 661 ms. (60 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 396 ms. (100 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 465 ms. (85 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 6/7 properties
FORMULA EisenbergMcGuire-PT-06-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 384 ms. (103 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 6/6 properties
[2024-06-01 07:05:46] [INFO ] Flow matrix only has 465 transitions (discarded 594 similar events)
// Phase 1: matrix 465 rows 272 cols
[2024-06-01 07:05:46] [INFO ] Computed 19 invariants in 4 ms
[2024-06-01 07:05:46] [INFO ] State equation strengthened by 219 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 182/272 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 465/737 variables, 272/291 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/737 variables, 219/510 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/737 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/737 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 737/737 variables, and 510 constraints, problems are : Problem set: 0 solved, 6 unsolved in 997 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 272/272 constraints, ReadFeed: 219/219 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 182/272 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 07:05:48] [INFO ] Deduced a trap composed of 25 places in 410 ms of which 5 ms to minimize.
[2024-06-01 07:05:48] [INFO ] Deduced a trap composed of 18 places in 285 ms of which 3 ms to minimize.
[2024-06-01 07:05:48] [INFO ] Deduced a trap composed of 3 places in 305 ms of which 4 ms to minimize.
[2024-06-01 07:05:49] [INFO ] Deduced a trap composed of 79 places in 276 ms of which 4 ms to minimize.
[2024-06-01 07:05:49] [INFO ] Deduced a trap composed of 74 places in 366 ms of which 5 ms to minimize.
[2024-06-01 07:05:49] [INFO ] Deduced a trap composed of 3 places in 373 ms of which 4 ms to minimize.
[2024-06-01 07:05:50] [INFO ] Deduced a trap composed of 15 places in 281 ms of which 4 ms to minimize.
[2024-06-01 07:05:50] [INFO ] Deduced a trap composed of 15 places in 348 ms of which 4 ms to minimize.
[2024-06-01 07:05:50] [INFO ] Deduced a trap composed of 55 places in 302 ms of which 4 ms to minimize.
[2024-06-01 07:05:51] [INFO ] Deduced a trap composed of 14 places in 293 ms of which 4 ms to minimize.
[2024-06-01 07:05:51] [INFO ] Deduced a trap composed of 3 places in 354 ms of which 5 ms to minimize.
[2024-06-01 07:05:51] [INFO ] Deduced a trap composed of 20 places in 228 ms of which 4 ms to minimize.
[2024-06-01 07:05:52] [INFO ] Deduced a trap composed of 14 places in 366 ms of which 4 ms to minimize.
[2024-06-01 07:05:52] [INFO ] Deduced a trap composed of 15 places in 304 ms of which 4 ms to minimize.
[2024-06-01 07:05:52] [INFO ] Deduced a trap composed of 14 places in 291 ms of which 4 ms to minimize.
[2024-06-01 07:05:53] [INFO ] Deduced a trap composed of 51 places in 349 ms of which 5 ms to minimize.
[2024-06-01 07:05:53] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 07:05:53] [INFO ] Deduced a trap composed of 52 places in 265 ms of which 4 ms to minimize.
[2024-06-01 07:05:54] [INFO ] Deduced a trap composed of 56 places in 330 ms of which 4 ms to minimize.
[2024-06-01 07:05:54] [INFO ] Deduced a trap composed of 54 places in 309 ms of which 4 ms to minimize.
[2024-06-01 07:05:54] [INFO ] Deduced a trap composed of 54 places in 268 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 07:05:55] [INFO ] Deduced a trap composed of 44 places in 303 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 465/737 variables, 272/313 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/737 variables, 219/532 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/737 variables, 6/538 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 07:05:56] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:05:56] [INFO ] Deduced a trap composed of 19 places in 163 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/737 variables, 2/540 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 07:05:57] [INFO ] Deduced a trap composed of 56 places in 327 ms of which 5 ms to minimize.
[2024-06-01 07:05:57] [INFO ] Deduced a trap composed of 56 places in 312 ms of which 4 ms to minimize.
[2024-06-01 07:05:57] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:05:58] [INFO ] Deduced a trap composed of 15 places in 228 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/737 variables, 4/544 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/737 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/737 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 737/737 variables, and 544 constraints, problems are : Problem set: 0 solved, 6 unsolved in 12170 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 272/272 constraints, ReadFeed: 219/219 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 28/28 constraints]
After SMT, in 13265ms problems are : Problem set: 0 solved, 6 unsolved
FORMULA EisenbergMcGuire-PT-06-ReachabilityFireability-2024-03 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 4283 ms.
Support contains 89 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 1059/1059 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 271 transition count 1053
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 271 transition count 1053
Applied a total of 2 rules in 80 ms. Remains 271 /272 variables (removed 1) and now considering 1053/1059 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 271/272 places, 1053/1059 transitions.
RANDOM walk for 40000 steps (8 resets) in 185 ms. (215 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 256 ms. (155 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 438 ms. (91 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 237965 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 5
Probabilistic random walk after 237965 steps, saw 116018 distinct states, run finished after 3009 ms. (steps per millisecond=79 ) properties seen :0
[2024-06-01 07:06:07] [INFO ] Flow matrix only has 459 transitions (discarded 594 similar events)
// Phase 1: matrix 459 rows 271 cols
[2024-06-01 07:06:07] [INFO ] Computed 19 invariants in 4 ms
[2024-06-01 07:06:07] [INFO ] State equation strengthened by 214 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 182/271 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 459/730 variables, 271/290 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/730 variables, 214/504 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/730 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/730 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 730/730 variables, and 504 constraints, problems are : Problem set: 0 solved, 5 unsolved in 661 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 271/271 constraints, ReadFeed: 214/214 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 07:06:08] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 182/271 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 07:06:08] [INFO ] Deduced a trap composed of 3 places in 309 ms of which 4 ms to minimize.
[2024-06-01 07:06:09] [INFO ] Deduced a trap composed of 3 places in 325 ms of which 4 ms to minimize.
[2024-06-01 07:06:09] [INFO ] Deduced a trap composed of 46 places in 304 ms of which 4 ms to minimize.
[2024-06-01 07:06:09] [INFO ] Deduced a trap composed of 29 places in 320 ms of which 4 ms to minimize.
[2024-06-01 07:06:10] [INFO ] Deduced a trap composed of 15 places in 323 ms of which 4 ms to minimize.
[2024-06-01 07:06:10] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 1 ms to minimize.
[2024-06-01 07:06:10] [INFO ] Deduced a trap composed of 18 places in 334 ms of which 5 ms to minimize.
[2024-06-01 07:06:11] [INFO ] Deduced a trap composed of 37 places in 343 ms of which 4 ms to minimize.
[2024-06-01 07:06:11] [INFO ] Deduced a trap composed of 54 places in 316 ms of which 4 ms to minimize.
[2024-06-01 07:06:11] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 07:06:11] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 459/730 variables, 271/302 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/730 variables, 214/516 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/730 variables, 5/521 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 07:06:12] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:06:12] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 14 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/730 variables, 2/523 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 07:06:13] [INFO ] Deduced a trap composed of 3 places in 189 ms of which 4 ms to minimize.
[2024-06-01 07:06:13] [INFO ] Deduced a trap composed of 19 places in 188 ms of which 3 ms to minimize.
[2024-06-01 07:06:14] [INFO ] Deduced a trap composed of 59 places in 130 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/730 variables, 3/526 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 07:06:14] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/730 variables, 1/527 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/730 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/730 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 730/730 variables, and 527 constraints, problems are : Problem set: 0 solved, 5 unsolved in 7515 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 271/271 constraints, ReadFeed: 214/214 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 18/18 constraints]
After SMT, in 8241ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 2337 ms.
Support contains 89 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 1053/1053 transitions.
Applied a total of 0 rules in 40 ms. Remains 271 /271 variables (removed 0) and now considering 1053/1053 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 271/271 places, 1053/1053 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 1053/1053 transitions.
Applied a total of 0 rules in 31 ms. Remains 271 /271 variables (removed 0) and now considering 1053/1053 (removed 0) transitions.
[2024-06-01 07:06:18] [INFO ] Flow matrix only has 459 transitions (discarded 594 similar events)
[2024-06-01 07:06:18] [INFO ] Invariant cache hit.
[2024-06-01 07:06:18] [INFO ] Implicit Places using invariants in 329 ms returned []
[2024-06-01 07:06:18] [INFO ] Flow matrix only has 459 transitions (discarded 594 similar events)
[2024-06-01 07:06:18] [INFO ] Invariant cache hit.
[2024-06-01 07:06:18] [INFO ] State equation strengthened by 214 read => feed constraints.
[2024-06-01 07:06:19] [INFO ] Implicit Places using invariants and state equation in 1008 ms returned []
Implicit Place search using SMT with State Equation took 1350 ms to find 0 implicit places.
[2024-06-01 07:06:19] [INFO ] Redundant transitions in 119 ms returned []
Running 1047 sub problems to find dead transitions.
[2024-06-01 07:06:19] [INFO ] Flow matrix only has 459 transitions (discarded 594 similar events)
[2024-06-01 07:06:19] [INFO ] Invariant cache hit.
[2024-06-01 07:06:19] [INFO ] State equation strengthened by 214 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1047 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1047 unsolved
[2024-06-01 07:06:31] [INFO ] Deduced a trap composed of 3 places in 345 ms of which 3 ms to minimize.
[2024-06-01 07:06:31] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:06:31] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:06:32] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:06:32] [INFO ] Deduced a trap composed of 38 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:06:32] [INFO ] Deduced a trap composed of 62 places in 229 ms of which 4 ms to minimize.
[2024-06-01 07:06:34] [INFO ] Deduced a trap composed of 40 places in 288 ms of which 4 ms to minimize.
[2024-06-01 07:06:34] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:06:34] [INFO ] Deduced a trap composed of 45 places in 221 ms of which 3 ms to minimize.
[2024-06-01 07:06:35] [INFO ] Deduced a trap composed of 22 places in 216 ms of which 4 ms to minimize.
[2024-06-01 07:06:35] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:06:35] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:06:35] [INFO ] Deduced a trap composed of 20 places in 267 ms of which 4 ms to minimize.
[2024-06-01 07:06:35] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:06:36] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:06:36] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:06:36] [INFO ] Deduced a trap composed of 11 places in 332 ms of which 4 ms to minimize.
[2024-06-01 07:06:37] [INFO ] Deduced a trap composed of 22 places in 183 ms of which 3 ms to minimize.
[2024-06-01 07:06:37] [INFO ] Deduced a trap composed of 56 places in 316 ms of which 5 ms to minimize.
[2024-06-01 07:06:37] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1047 unsolved
[2024-06-01 07:06:41] [INFO ] Deduced a trap composed of 56 places in 298 ms of which 4 ms to minimize.
[2024-06-01 07:06:41] [INFO ] Deduced a trap composed of 53 places in 344 ms of which 5 ms to minimize.
[2024-06-01 07:06:41] [INFO ] Deduced a trap composed of 79 places in 310 ms of which 4 ms to minimize.
[2024-06-01 07:06:42] [INFO ] Deduced a trap composed of 66 places in 355 ms of which 4 ms to minimize.
[2024-06-01 07:06:42] [INFO ] Deduced a trap composed of 70 places in 360 ms of which 4 ms to minimize.
[2024-06-01 07:06:43] [INFO ] Deduced a trap composed of 16 places in 350 ms of which 5 ms to minimize.
[2024-06-01 07:06:43] [INFO ] Deduced a trap composed of 31 places in 369 ms of which 5 ms to minimize.
[2024-06-01 07:06:43] [INFO ] Deduced a trap composed of 19 places in 364 ms of which 5 ms to minimize.
[2024-06-01 07:06:44] [INFO ] Deduced a trap composed of 13 places in 383 ms of which 5 ms to minimize.
[2024-06-01 07:06:44] [INFO ] Deduced a trap composed of 51 places in 334 ms of which 4 ms to minimize.
[2024-06-01 07:06:45] [INFO ] Deduced a trap composed of 15 places in 400 ms of which 5 ms to minimize.
[2024-06-01 07:06:45] [INFO ] Deduced a trap composed of 17 places in 305 ms of which 5 ms to minimize.
[2024-06-01 07:06:46] [INFO ] Deduced a trap composed of 44 places in 351 ms of which 4 ms to minimize.
[2024-06-01 07:06:48] [INFO ] Deduced a trap composed of 36 places in 367 ms of which 4 ms to minimize.
[2024-06-01 07:06:50] [INFO ] Deduced a trap composed of 45 places in 285 ms of which 5 ms to minimize.
[2024-06-01 07:06:50] [INFO ] Deduced a trap composed of 63 places in 279 ms of which 4 ms to minimize.
SMT process timed out in 30866ms, After SMT, problems are : Problem set: 0 solved, 1047 unsolved
Search for dead transitions found 0 dead transitions in 30899ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32428 ms. Remains : 271/271 places, 1053/1053 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 398 edges and 271 vertex of which 24 / 271 are part of one of the 6 SCC in 5 ms
Free SCC test removed 18 places
Drop transitions (Empty/Sink Transition effects.) removed 63 transitions
Ensure Unique test removed 600 transitions
Reduce isomorphic transitions removed 663 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 253 transition count 371
Reduce places removed 19 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 25 rules applied. Total rules applied 45 place count 234 transition count 365
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 51 place count 228 transition count 365
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 51 place count 228 transition count 359
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 13 rules applied. Total rules applied 64 place count 221 transition count 359
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 114 place count 196 transition count 334
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 117 place count 196 transition count 331
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -51
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 127 place count 191 transition count 382
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 147 place count 191 transition count 362
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 5 with 28 rules applied. Total rules applied 175 place count 191 transition count 334
Free-agglomeration rule applied 32 times.
Iterating global reduction 5 with 32 rules applied. Total rules applied 207 place count 191 transition count 302
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 33 rules applied. Total rules applied 240 place count 159 transition count 301
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 242 place count 159 transition count 299
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 250 place count 159 transition count 299
Applied a total of 250 rules in 112 ms. Remains 159 /271 variables (removed 112) and now considering 299/1053 (removed 754) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 299 rows 159 cols
[2024-06-01 07:06:50] [INFO ] Computed 18 invariants in 4 ms
[2024-06-01 07:06:50] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-06-01 07:06:51] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-06-01 07:06:51] [INFO ] [Nat]Absence check using 13 positive and 5 generalized place invariants in 7 ms returned sat
[2024-06-01 07:06:51] [INFO ] After 562ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-06-01 07:06:51] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:06:51] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:06:52] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:06:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 243 ms
[2024-06-01 07:06:52] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 2 ms to minimize.
[2024-06-01 07:06:52] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:06:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 137 ms
[2024-06-01 07:06:52] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:06:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
TRAPS : Iteration 1
[2024-06-01 07:06:53] [INFO ] After 1851ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-06-01 07:06:53] [INFO ] After 2402ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 2726 ms.
[2024-06-01 07:06:53] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 12 ms.
[2024-06-01 07:06:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 271 places, 1053 transitions and 5250 arcs took 23 ms.
[2024-06-01 07:06:54] [INFO ] Flatten gal took : 268 ms
Total runtime 80255 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-06-ReachabilityFireability-2024-02
Could not compute solution for formula : EisenbergMcGuire-PT-06-ReachabilityFireability-2024-04
Could not compute solution for formula : EisenbergMcGuire-PT-06-ReachabilityFireability-2024-13
Could not compute solution for formula : EisenbergMcGuire-PT-06-ReachabilityFireability-2024-14
Could not compute solution for formula : EisenbergMcGuire-PT-06-ReachabilityFireability-2024-15

BK_STOP 1717225614655

--------------------
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-06-ReachabilityFireability-2024-02
rfs formula type AG
rfs formula formula --invariant=/tmp/865/inv_0_
rfs formula name EisenbergMcGuire-PT-06-ReachabilityFireability-2024-04
rfs formula type AG
rfs formula formula --invariant=/tmp/865/inv_1_
rfs formula name EisenbergMcGuire-PT-06-ReachabilityFireability-2024-13
rfs formula type AG
rfs formula formula --invariant=/tmp/865/inv_2_
rfs formula name EisenbergMcGuire-PT-06-ReachabilityFireability-2024-14
rfs formula type EF
rfs formula formula --invariant=/tmp/865/inv_3_
rfs formula name EisenbergMcGuire-PT-06-ReachabilityFireability-2024-15
rfs formula type EF
rfs formula formula --invariant=/tmp/865/inv_4_
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-06"
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-06, 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-171636266300175"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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