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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 7.5K 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 6.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:52 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 20K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 210K 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 53K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.2M 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-07-ReachabilityFireability-2024-00
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-2024-01
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-2024-02
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-2024-03
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-2023-04
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-2024-05
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-2024-06
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-2024-07
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-2024-08
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-2024-09
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-2024-10
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-2024-11
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-2024-12
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-2024-13
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-2024-14
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717228777758

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-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:59:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:59:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:59:41] [INFO ] Load time of PNML (sax parser for PT used): 485 ms
[2024-06-01 07:59:41] [INFO ] Transformed 553 places.
[2024-06-01 07:59:41] [INFO ] Transformed 1960 transitions.
[2024-06-01 07:59:41] [INFO ] Found NUPN structural information;
[2024-06-01 07:59:41] [INFO ] Parsed PT model containing 553 places and 1960 transitions and 9212 arcs in 862 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 34 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 3133 ms. (12 steps per ms) remains 13/16 properties
FORMULA EisenbergMcGuire-PT-07-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 434 ms. (91 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 269 ms. (148 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 708 ms. (56 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 367 ms. (108 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 619 ms. (64 steps per ms) remains 12/13 properties
FORMULA EisenbergMcGuire-PT-07-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 12/12 properties
[2024-06-01 07:59:43] [INFO ] Flow matrix only has 1001 transitions (discarded 959 similar events)
// Phase 1: matrix 1001 rows 553 cols
[2024-06-01 07:59:43] [INFO ] Computed 22 invariants in 35 ms
[2024-06-01 07:59:43] [INFO ] State equation strengthened by 472 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 130/130 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem EisenbergMcGuire-PT-07-ReachabilityFireability-2024-01 is UNSAT
FORMULA EisenbergMcGuire-PT-07-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 1/131 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/131 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Problem EisenbergMcGuire-PT-07-ReachabilityFireability-2024-12 is UNSAT
FORMULA EisenbergMcGuire-PT-07-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 423/553 variables, 14/145 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 423/568 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 7/575 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 0/575 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 1001/1554 variables, 553/1128 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1554 variables, 472/1600 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1554 variables, 0/1600 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 0/1554 variables, 0/1600 constraints. Problems are: Problem set: 2 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1554/1554 variables, and 1600 constraints, problems are : Problem set: 2 solved, 10 unsolved in 3573 ms.
Refiners :[Domain max(s): 553/553 constraints, Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 553/553 constraints, ReadFeed: 472/472 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 82/82 constraints. Problems are: Problem set: 2 solved, 10 unsolved
Problem EisenbergMcGuire-PT-07-ReachabilityFireability-2024-13 is UNSAT
FORMULA EisenbergMcGuire-PT-07-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
Problem EisenbergMcGuire-PT-07-ReachabilityFireability-2024-14 is UNSAT
FORMULA EisenbergMcGuire-PT-07-ReachabilityFireability-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/83 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/83 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 468/550 variables, 14/97 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/550 variables, 468/565 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 4/569 constraints. Problems are: Problem set: 4 solved, 8 unsolved
[2024-06-01 07:59:48] [INFO ] Deduced a trap composed of 3 places in 479 ms of which 48 ms to minimize.
[2024-06-01 07:59:49] [INFO ] Deduced a trap composed of 3 places in 223 ms of which 3 ms to minimize.
[2024-06-01 07:59:49] [INFO ] Deduced a trap composed of 38 places in 240 ms of which 4 ms to minimize.
[2024-06-01 07:59:49] [INFO ] Deduced a trap composed of 38 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:59:50] [INFO ] Deduced a trap composed of 29 places in 296 ms of which 3 ms to minimize.
[2024-06-01 07:59:50] [INFO ] Deduced a trap composed of 3 places in 175 ms of which 2 ms to minimize.
[2024-06-01 07:59:50] [INFO ] Deduced a trap composed of 115 places in 619 ms of which 5 ms to minimize.
[2024-06-01 07:59:51] [INFO ] Deduced a trap composed of 204 places in 340 ms of which 4 ms to minimize.
[2024-06-01 07:59:51] [INFO ] Deduced a trap composed of 157 places in 448 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 9/578 constraints. Problems are: Problem set: 4 solved, 8 unsolved
[2024-06-01 07:59:52] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 1/579 constraints. Problems are: Problem set: 4 solved, 8 unsolved
[2024-06-01 07:59:53] [INFO ] Deduced a trap composed of 139 places in 596 ms of which 7 ms to minimize.
SMT process timed out in 9490ms, After SMT, problems are : Problem set: 4 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 64 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 1960/1960 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 553 transition count 1955
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 548 transition count 1955
Performed 141 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 141 Pre rules applied. Total rules applied 10 place count 548 transition count 1814
Deduced a syphon composed of 141 places in 3 ms
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 2 with 282 rules applied. Total rules applied 292 place count 407 transition count 1814
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 324 place count 375 transition count 1590
Iterating global reduction 2 with 32 rules applied. Total rules applied 356 place count 375 transition count 1590
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 7 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 432 place count 337 transition count 1552
Applied a total of 432 rules in 475 ms. Remains 337 /553 variables (removed 216) and now considering 1552/1960 (removed 408) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 507 ms. Remains : 337/553 places, 1552/1960 transitions.
RANDOM walk for 40000 steps (8 resets) in 460 ms. (86 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 255 ms. (156 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 198104 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :4 out of 8
Probabilistic random walk after 198104 steps, saw 112874 distinct states, run finished after 3011 ms. (steps per millisecond=65 ) properties seen :4
FORMULA EisenbergMcGuire-PT-07-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-01 07:59:57] [INFO ] Flow matrix only has 593 transitions (discarded 959 similar events)
// Phase 1: matrix 593 rows 337 cols
[2024-06-01 07:59:57] [INFO ] Computed 22 invariants in 4 ms
[2024-06-01 07:59:57] [INFO ] State equation strengthened by 280 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 222/234 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/235 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 43/278 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 11/289 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 510/799 variables, 289/308 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/799 variables, 196/504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/799 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 20/819 variables, 9/513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/819 variables, 9/522 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/819 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 37/856 variables, 2/524 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/856 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/858 variables, 1/525 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/858 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 72/930 variables, 39/564 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/930 variables, 75/639 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/930 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/930 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 930/930 variables, and 639 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1205 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 337/337 constraints, ReadFeed: 280/280 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 222/234 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/235 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 43/278 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:59:59] [INFO ] Deduced a trap composed of 5 places in 341 ms of which 4 ms to minimize.
[2024-06-01 07:59:59] [INFO ] Deduced a trap composed of 3 places in 342 ms of which 4 ms to minimize.
[2024-06-01 07:59:59] [INFO ] Deduced a trap composed of 3 places in 260 ms of which 4 ms to minimize.
[2024-06-01 07:59:59] [INFO ] Deduced a trap composed of 29 places in 186 ms of which 3 ms to minimize.
[2024-06-01 08:00:00] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 3 ms to minimize.
[2024-06-01 08:00:00] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 11/289 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:00:00] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 510/799 variables, 289/315 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/799 variables, 196/511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:00:00] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/799 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/799 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 20/819 variables, 9/521 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/819 variables, 9/530 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/819 variables, 1/531 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/819 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 37/856 variables, 2/533 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:00:01] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/856 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/856 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 2/858 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/858 variables, 3/538 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:00:02] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/858 variables, 1/539 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/858 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 72/930 variables, 39/578 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/930 variables, 75/653 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/930 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 0/930 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 930/930 variables, and 653 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4870 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 337/337 constraints, ReadFeed: 280/280 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 10/10 constraints]
After SMT, in 6118ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 2789 ms.
Support contains 12 out of 337 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 337/337 places, 1552/1552 transitions.
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 13 Pre rules applied. Total rules applied 0 place count 337 transition count 1539
Deduced a syphon composed of 13 places in 7 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 26 place count 324 transition count 1539
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 315 transition count 1476
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 315 transition count 1476
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 311 transition count 1472
Applied a total of 52 rules in 149 ms. Remains 311 /337 variables (removed 26) and now considering 1472/1552 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 311/337 places, 1472/1552 transitions.
RANDOM walk for 40000 steps (8 resets) in 204 ms. (195 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 243656 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 4
Probabilistic random walk after 243656 steps, saw 115299 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
[2024-06-01 08:00:09] [INFO ] Flow matrix only has 513 transitions (discarded 959 similar events)
// Phase 1: matrix 513 rows 311 cols
[2024-06-01 08:00:09] [INFO ] Computed 22 invariants in 6 ms
[2024-06-01 08:00:09] [INFO ] State equation strengthened by 226 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 205/217 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/218 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 41/259 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 9/268 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 453/721 variables, 268/287 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/721 variables, 160/447 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/721 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 20/741 variables, 9/456 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/741 variables, 9/465 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/741 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 32/773 variables, 2/467 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/773 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/775 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/775 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 49/824 variables, 34/502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/824 variables, 57/559 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/824 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/824 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 824/824 variables, and 559 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1265 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 311/311 constraints, ReadFeed: 226/226 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 205/217 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/218 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 41/259 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:00:11] [INFO ] Deduced a trap composed of 27 places in 165 ms of which 4 ms to minimize.
[2024-06-01 08:00:11] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:00:11] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 2 ms to minimize.
[2024-06-01 08:00:11] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 9/268 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:00:11] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/268 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 453/721 variables, 268/292 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/721 variables, 160/452 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:00:12] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2024-06-01 08:00:12] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/721 variables, 2/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/721 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 20/741 variables, 9/463 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/741 variables, 9/472 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/741 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:00:13] [INFO ] Deduced a trap composed of 27 places in 200 ms of which 3 ms to minimize.
[2024-06-01 08:00:13] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 2 ms to minimize.
[2024-06-01 08:00:13] [INFO ] Deduced a trap composed of 22 places in 182 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/741 variables, 3/476 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/741 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 32/773 variables, 2/478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/773 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 2/775 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/775 variables, 3/482 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:00:13] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/775 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/775 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 49/824 variables, 34/517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/824 variables, 57/574 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/824 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 0/824 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 824/824 variables, and 574 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4172 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 311/311 constraints, ReadFeed: 226/226 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 11/11 constraints]
After SMT, in 5486ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 2055 ms.
Support contains 12 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 1472/1472 transitions.
Applied a total of 0 rules in 56 ms. Remains 311 /311 variables (removed 0) and now considering 1472/1472 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 311/311 places, 1472/1472 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 1472/1472 transitions.
Applied a total of 0 rules in 54 ms. Remains 311 /311 variables (removed 0) and now considering 1472/1472 (removed 0) transitions.
[2024-06-01 08:00:17] [INFO ] Flow matrix only has 513 transitions (discarded 959 similar events)
[2024-06-01 08:00:17] [INFO ] Invariant cache hit.
[2024-06-01 08:00:17] [INFO ] Implicit Places using invariants in 438 ms returned []
[2024-06-01 08:00:17] [INFO ] Flow matrix only has 513 transitions (discarded 959 similar events)
[2024-06-01 08:00:17] [INFO ] Invariant cache hit.
[2024-06-01 08:00:17] [INFO ] State equation strengthened by 226 read => feed constraints.
[2024-06-01 08:00:18] [INFO ] Implicit Places using invariants and state equation in 1395 ms returned []
Implicit Place search using SMT with State Equation took 1846 ms to find 0 implicit places.
[2024-06-01 08:00:19] [INFO ] Redundant transitions in 105 ms returned []
Running 1465 sub problems to find dead transitions.
[2024-06-01 08:00:19] [INFO ] Flow matrix only has 513 transitions (discarded 959 similar events)
[2024-06-01 08:00:19] [INFO ] Invariant cache hit.
[2024-06-01 08:00:19] [INFO ] State equation strengthened by 226 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
[2024-06-01 08:00:37] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 3 ms to minimize.
[2024-06-01 08:00:37] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 2 ms to minimize.
[2024-06-01 08:00:37] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 2 ms to minimize.
[2024-06-01 08:00:37] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2024-06-01 08:00:37] [INFO ] Deduced a trap composed of 50 places in 118 ms of which 2 ms to minimize.
[2024-06-01 08:00:38] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 3 ms to minimize.
[2024-06-01 08:00:39] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 2 ms to minimize.
[2024-06-01 08:00:39] [INFO ] Deduced a trap composed of 40 places in 332 ms of which 6 ms to minimize.
[2024-06-01 08:00:40] [INFO ] Deduced a trap composed of 70 places in 282 ms of which 3 ms to minimize.
[2024-06-01 08:00:40] [INFO ] Deduced a trap composed of 71 places in 317 ms of which 5 ms to minimize.
[2024-06-01 08:00:41] [INFO ] Deduced a trap composed of 66 places in 365 ms of which 4 ms to minimize.
[2024-06-01 08:00:41] [INFO ] Deduced a trap composed of 77 places in 390 ms of which 5 ms to minimize.
[2024-06-01 08:00:41] [INFO ] Deduced a trap composed of 25 places in 412 ms of which 4 ms to minimize.
[2024-06-01 08:00:42] [INFO ] Deduced a trap composed of 71 places in 380 ms of which 4 ms to minimize.
[2024-06-01 08:00:42] [INFO ] Deduced a trap composed of 51 places in 323 ms of which 4 ms to minimize.
[2024-06-01 08:00:43] [INFO ] Deduced a trap composed of 25 places in 379 ms of which 5 ms to minimize.
[2024-06-01 08:00:43] [INFO ] Deduced a trap composed of 11 places in 375 ms of which 5 ms to minimize.
[2024-06-01 08:00:43] [INFO ] Deduced a trap composed of 44 places in 120 ms of which 2 ms to minimize.
[2024-06-01 08:00:44] [INFO ] Deduced a trap composed of 56 places in 376 ms of which 4 ms to minimize.
[2024-06-01 08:00:44] [INFO ] Deduced a trap composed of 37 places in 435 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
[2024-06-01 08:00:47] [INFO ] Deduced a trap composed of 37 places in 327 ms of which 4 ms to minimize.
[2024-06-01 08:00:47] [INFO ] Deduced a trap composed of 39 places in 229 ms of which 3 ms to minimize.
[2024-06-01 08:00:47] [INFO ] Deduced a trap composed of 70 places in 278 ms of which 4 ms to minimize.
[2024-06-01 08:00:48] [INFO ] Deduced a trap composed of 63 places in 288 ms of which 4 ms to minimize.
[2024-06-01 08:00:48] [INFO ] Deduced a trap composed of 52 places in 263 ms of which 4 ms to minimize.
[2024-06-01 08:00:48] [INFO ] Deduced a trap composed of 26 places in 274 ms of which 5 ms to minimize.
[2024-06-01 08:00:49] [INFO ] Deduced a trap composed of 43 places in 318 ms of which 4 ms to minimize.
[2024-06-01 08:00:49] [INFO ] Deduced a trap composed of 57 places in 261 ms of which 3 ms to minimize.
[2024-06-01 08:00:49] [INFO ] Deduced a trap composed of 13 places in 194 ms of which 3 ms to minimize.
[2024-06-01 08:00:50] [INFO ] Deduced a trap composed of 61 places in 161 ms of which 2 ms to minimize.
[2024-06-01 08:00:50] [INFO ] Deduced a trap composed of 43 places in 226 ms of which 5 ms to minimize.
[2024-06-01 08:00:50] [INFO ] Deduced a trap composed of 39 places in 321 ms of which 6 ms to minimize.
SMT process timed out in 31605ms, After SMT, problems are : Problem set: 0 solved, 1465 unsolved
Search for dead transitions found 0 dead transitions in 31627ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33657 ms. Remains : 311/311 places, 1472/1472 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1289 edges and 311 vertex of which 48 / 311 are part of one of the 7 SCC in 7 ms
Free SCC test removed 41 places
Drop transitions (Empty/Sink Transition effects.) removed 157 transitions
Ensure Unique test removed 929 transitions
Reduce isomorphic transitions removed 1086 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 60 place count 270 transition count 327
Reduce places removed 59 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 60 rules applied. Total rules applied 120 place count 211 transition count 326
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 121 place count 210 transition count 326
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 121 place count 210 transition count 312
Deduced a syphon composed of 14 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 155 place count 190 transition count 312
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 315 place count 110 transition count 232
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 3 with 36 rules applied. Total rules applied 351 place count 110 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 363 place count 104 transition count 197
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 370 place count 104 transition count 190
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 381 place count 104 transition count 179
Free-agglomeration rule applied 44 times.
Iterating global reduction 5 with 44 rules applied. Total rules applied 425 place count 104 transition count 135
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 5 with 44 rules applied. Total rules applied 469 place count 60 transition count 135
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 477 place count 60 transition count 135
Applied a total of 477 rules in 94 ms. Remains 60 /311 variables (removed 251) and now considering 135/1472 (removed 1337) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 135 rows 60 cols
[2024-06-01 08:00:50] [INFO ] Computed 16 invariants in 8 ms
[2024-06-01 08:00:50] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-06-01 08:00:50] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 7 ms returned sat
[2024-06-01 08:00:50] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-01 08:00:50] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-06-01 08:00:50] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 08:00:51] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-01 08:00:51] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 08:00:51] [INFO ] After 56ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-06-01 08:00:51] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2024-06-01 08:00:51] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2024-06-01 08:00:51] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-06-01 08:00:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 120 ms
TRAPS : Iteration 1
[2024-06-01 08:00:51] [INFO ] After 324ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-06-01 08:00:51] [INFO ] After 560ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 786 ms.
[2024-06-01 08:00:51] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2024-06-01 08:00:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 311 places, 1472 transitions and 7662 arcs took 34 ms.
[2024-06-01 08:00:52] [INFO ] Flatten gal took : 313 ms
Total runtime 71878 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-07-ReachabilityFireability-2024-03
Could not compute solution for formula : EisenbergMcGuire-PT-07-ReachabilityFireability-2023-04
Could not compute solution for formula : EisenbergMcGuire-PT-07-ReachabilityFireability-2024-05
Could not compute solution for formula : EisenbergMcGuire-PT-07-ReachabilityFireability-2024-08

BK_STOP 1717228852604

--------------------
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-07-ReachabilityFireability-2024-03
rfs formula type EF
rfs formula formula --invariant=/tmp/758/inv_0_
rfs formula name EisenbergMcGuire-PT-07-ReachabilityFireability-2023-04
rfs formula type AG
rfs formula formula --invariant=/tmp/758/inv_1_
rfs formula name EisenbergMcGuire-PT-07-ReachabilityFireability-2024-05
rfs formula type EF
rfs formula formula --invariant=/tmp/758/inv_2_
rfs formula name EisenbergMcGuire-PT-07-ReachabilityFireability-2024-08
rfs formula type EF
rfs formula formula --invariant=/tmp/758/inv_3_
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-07"
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-07, 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-171636266300183"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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