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.r157-smll-171636265100167.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is EisenbergMcGuire-PT-05, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r157-smll-171636265100167
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 916K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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 29K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 16:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 12 16:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 16:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 12 16:00 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 460K 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-05-ReachabilityFireability-2024-00
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-2024-01
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-2024-02
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-2024-03
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-2024-04
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-2024-05
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-2024-06
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-2024-07
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-2024-08
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-2024-09
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-2024-10
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-2024-11
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-2024-12
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-2024-13
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-2024-14
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716484408827

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 17:13:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 17:13:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 17:13:31] [INFO ] Load time of PNML (sax parser for PT used): 274 ms
[2024-05-23 17:13:31] [INFO ] Transformed 295 places.
[2024-05-23 17:13:31] [INFO ] Transformed 800 transitions.
[2024-05-23 17:13:31] [INFO ] Found NUPN structural information;
[2024-05-23 17:13:31] [INFO ] Parsed PT model containing 295 places and 800 transitions and 3600 arcs in 532 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 2721 ms. (14 steps per ms) remains 15/16 properties
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 191 ms. (20 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 170634 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :6 out of 15
Probabilistic random walk after 170634 steps, saw 103515 distinct states, run finished after 3022 ms. (steps per millisecond=56 ) properties seen :6
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-05-23 17:13:36] [INFO ] Flow matrix only has 465 transitions (discarded 335 similar events)
// Phase 1: matrix 465 rows 295 cols
[2024-05-23 17:13:36] [INFO ] Computed 16 invariants in 29 ms
[2024-05-23 17:13:36] [INFO ] State equation strengthened by 196 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 119/119 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem EisenbergMcGuire-PT-05-ReachabilityFireability-2024-00 is UNSAT
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem EisenbergMcGuire-PT-05-ReachabilityFireability-2024-02 is UNSAT
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 1/120 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/120 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Problem EisenbergMcGuire-PT-05-ReachabilityFireability-2024-06 is UNSAT
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 176/295 variables, 10/130 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 176/306 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 5/311 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 0/311 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 465/760 variables, 295/606 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 196/802 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/760 variables, 0/802 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/760 variables, 0/802 constraints. Problems are: Problem set: 3 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 760/760 variables, and 802 constraints, problems are : Problem set: 3 solved, 6 unsolved in 1708 ms.
Refiners :[Domain max(s): 295/295 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 295/295 constraints, ReadFeed: 196/196 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 3 solved, 6 unsolved
Problem EisenbergMcGuire-PT-05-ReachabilityFireability-2024-05 is UNSAT
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 1/81 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/81 constraints. Problems are: Problem set: 4 solved, 5 unsolved
Problem EisenbergMcGuire-PT-05-ReachabilityFireability-2024-09 is UNSAT
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 215/295 variables, 10/91 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 215/306 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 5/311 constraints. Problems are: Problem set: 5 solved, 4 unsolved
[2024-05-23 17:13:39] [INFO ] Deduced a trap composed of 3 places in 428 ms of which 64 ms to minimize.
[2024-05-23 17:13:39] [INFO ] Deduced a trap composed of 68 places in 390 ms of which 6 ms to minimize.
[2024-05-23 17:13:40] [INFO ] Deduced a trap composed of 63 places in 143 ms of which 3 ms to minimize.
Problem EisenbergMcGuire-PT-05-ReachabilityFireability-2024-10 is UNSAT
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-23 17:13:40] [INFO ] Deduced a trap composed of 3 places in 227 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 4/315 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 0/315 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 465/760 variables, 295/610 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/760 variables, 196/806 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/760 variables, 3/809 constraints. Problems are: Problem set: 6 solved, 3 unsolved
[2024-05-23 17:13:41] [INFO ] Deduced a trap composed of 3 places in 133 ms of which 3 ms to minimize.
[2024-05-23 17:13:41] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/760 variables, 2/811 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/760 variables, 0/811 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/760 variables, 0/811 constraints. Problems are: Problem set: 6 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 760/760 variables, and 811 constraints, problems are : Problem set: 6 solved, 3 unsolved in 3041 ms.
Refiners :[Domain max(s): 295/295 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 295/295 constraints, ReadFeed: 196/196 constraints, PredecessorRefiner: 3/9 constraints, Known Traps: 6/6 constraints]
After SMT, in 5242ms problems are : Problem set: 6 solved, 3 unsolved
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-14 TRUE TECHNIQUES PARIKH_WALK
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-11 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 708 ms.
Support contains 3 out of 295 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 800/800 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 295 transition count 795
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 290 transition count 795
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 10 place count 290 transition count 715
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 170 place count 210 transition count 715
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 190 place count 190 transition count 615
Iterating global reduction 2 with 20 rules applied. Total rules applied 210 place count 190 transition count 615
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 250 place count 170 transition count 595
Applied a total of 250 rules in 164 ms. Remains 170 /295 variables (removed 125) and now considering 595/800 (removed 205) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 170/295 places, 595/800 transitions.
RANDOM walk for 40000 steps (8 resets) in 332 ms. (120 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 775542 steps, run timeout after 3001 ms. (steps per millisecond=258 ) properties seen :0 out of 1
Probabilistic random walk after 775542 steps, saw 149668 distinct states, run finished after 3001 ms. (steps per millisecond=258 ) properties seen :0
[2024-05-23 17:13:45] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
// Phase 1: matrix 260 rows 170 cols
[2024-05-23 17:13:45] [INFO ] Computed 16 invariants in 2 ms
[2024-05-23 17:13:45] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/64 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:13:45] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/71 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 128/199 variables, 71/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 24/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 48/247 variables, 21/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 12/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 72/319 variables, 6/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/319 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/325 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/325 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 105/430 variables, 78/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/430 variables, 80/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/430 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/430 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 368 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/64 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/71 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:13:46] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 128/199 variables, 71/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 24/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 48/247 variables, 21/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 12/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/247 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 72/319 variables, 6/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/319 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/325 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/325 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 17:13:46] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 3 ms to minimize.
[2024-05-23 17:13:46] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
[2024-05-23 17:13:46] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 2 ms to minimize.
[2024-05-23 17:13:46] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 3 ms to minimize.
[2024-05-23 17:13:46] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-23 17:13:47] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 3 ms to minimize.
[2024-05-23 17:13:47] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/325 variables, 7/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/325 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 105/430 variables, 78/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/430 variables, 80/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/430 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/430 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 312 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1274 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 1661ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 54 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 170/170 places, 595/595 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 33 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
[2024-05-23 17:13:47] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-23 17:13:47] [INFO ] Invariant cache hit.
[2024-05-23 17:13:47] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-05-23 17:13:47] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-23 17:13:47] [INFO ] Invariant cache hit.
[2024-05-23 17:13:48] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-23 17:13:48] [INFO ] Implicit Places using invariants and state equation in 607 ms returned []
Implicit Place search using SMT with State Equation took 945 ms to find 0 implicit places.
[2024-05-23 17:13:48] [INFO ] Redundant transitions in 47 ms returned []
Running 590 sub problems to find dead transitions.
[2024-05-23 17:13:48] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-05-23 17:13:48] [INFO ] Invariant cache hit.
[2024-05-23 17:13:48] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:13:53] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 4 ms to minimize.
[2024-05-23 17:13:53] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
[2024-05-23 17:13:53] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 2 ms to minimize.
[2024-05-23 17:13:53] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-23 17:13:54] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 2 ms to minimize.
[2024-05-23 17:13:54] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 3 ms to minimize.
[2024-05-23 17:13:54] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 2 ms to minimize.
[2024-05-23 17:13:54] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 1 ms to minimize.
[2024-05-23 17:13:54] [INFO ] Deduced a trap composed of 48 places in 92 ms of which 1 ms to minimize.
[2024-05-23 17:13:54] [INFO ] Deduced a trap composed of 47 places in 94 ms of which 5 ms to minimize.
[2024-05-23 17:13:54] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 2 ms to minimize.
[2024-05-23 17:13:55] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 3 ms to minimize.
[2024-05-23 17:13:55] [INFO ] Deduced a trap composed of 35 places in 185 ms of which 3 ms to minimize.
[2024-05-23 17:13:55] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 2 ms to minimize.
[2024-05-23 17:13:55] [INFO ] Deduced a trap composed of 34 places in 166 ms of which 3 ms to minimize.
[2024-05-23 17:13:55] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 3 ms to minimize.
[2024-05-23 17:13:55] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-05-23 17:13:56] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 2 ms to minimize.
[2024-05-23 17:13:56] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 3 ms to minimize.
[2024-05-23 17:13:56] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:13:57] [INFO ] Deduced a trap composed of 51 places in 142 ms of which 3 ms to minimize.
[2024-05-23 17:13:57] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 2 ms to minimize.
[2024-05-23 17:13:57] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 2 ms to minimize.
[2024-05-23 17:13:57] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 2 ms to minimize.
[2024-05-23 17:13:57] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 3 ms to minimize.
[2024-05-23 17:13:58] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 3 ms to minimize.
[2024-05-23 17:13:58] [INFO ] Deduced a trap composed of 49 places in 162 ms of which 2 ms to minimize.
[2024-05-23 17:13:58] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 3 ms to minimize.
[2024-05-23 17:13:59] [INFO ] Deduced a trap composed of 40 places in 168 ms of which 3 ms to minimize.
[2024-05-23 17:13:59] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 2 ms to minimize.
[2024-05-23 17:13:59] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 3 ms to minimize.
[2024-05-23 17:13:59] [INFO ] Deduced a trap composed of 30 places in 162 ms of which 3 ms to minimize.
[2024-05-23 17:14:00] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 3 ms to minimize.
[2024-05-23 17:14:00] [INFO ] Deduced a trap composed of 39 places in 172 ms of which 3 ms to minimize.
[2024-05-23 17:14:00] [INFO ] Deduced a trap composed of 49 places in 127 ms of which 3 ms to minimize.
[2024-05-23 17:14:00] [INFO ] Deduced a trap composed of 37 places in 159 ms of which 4 ms to minimize.
[2024-05-23 17:14:00] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 2 ms to minimize.
[2024-05-23 17:14:01] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 2 ms to minimize.
[2024-05-23 17:14:01] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 1 ms to minimize.
[2024-05-23 17:14:01] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:14:06] [INFO ] Deduced a trap composed of 30 places in 155 ms of which 3 ms to minimize.
[2024-05-23 17:14:06] [INFO ] Deduced a trap composed of 47 places in 152 ms of which 3 ms to minimize.
[2024-05-23 17:14:08] [INFO ] Deduced a trap composed of 51 places in 202 ms of which 3 ms to minimize.
[2024-05-23 17:14:08] [INFO ] Deduced a trap composed of 56 places in 187 ms of which 3 ms to minimize.
[2024-05-23 17:14:08] [INFO ] Deduced a trap composed of 41 places in 176 ms of which 2 ms to minimize.
[2024-05-23 17:14:08] [INFO ] Deduced a trap composed of 39 places in 161 ms of which 3 ms to minimize.
[2024-05-23 17:14:09] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 3 ms to minimize.
[2024-05-23 17:14:09] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 3 ms to minimize.
[2024-05-23 17:14:09] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 2 ms to minimize.
[2024-05-23 17:14:09] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 2 ms to minimize.
[2024-05-23 17:14:09] [INFO ] Deduced a trap composed of 48 places in 154 ms of which 3 ms to minimize.
[2024-05-23 17:14:09] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 3 ms to minimize.
[2024-05-23 17:14:10] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 3 ms to minimize.
[2024-05-23 17:14:10] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 3 ms to minimize.
[2024-05-23 17:14:10] [INFO ] Deduced a trap composed of 37 places in 175 ms of which 3 ms to minimize.
[2024-05-23 17:14:11] [INFO ] Deduced a trap composed of 38 places in 198 ms of which 3 ms to minimize.
[2024-05-23 17:14:11] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 2 ms to minimize.
[2024-05-23 17:14:11] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-05-23 17:14:11] [INFO ] Deduced a trap composed of 21 places in 199 ms of which 3 ms to minimize.
[2024-05-23 17:14:11] [INFO ] Deduced a trap composed of 50 places in 174 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:14:15] [INFO ] Deduced a trap composed of 42 places in 219 ms of which 11 ms to minimize.
[2024-05-23 17:14:15] [INFO ] Deduced a trap composed of 45 places in 199 ms of which 3 ms to minimize.
[2024-05-23 17:14:16] [INFO ] Deduced a trap composed of 37 places in 205 ms of which 3 ms to minimize.
[2024-05-23 17:14:16] [INFO ] Deduced a trap composed of 19 places in 183 ms of which 3 ms to minimize.
[2024-05-23 17:14:16] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 2 ms to minimize.
[2024-05-23 17:14:16] [INFO ] Deduced a trap composed of 43 places in 185 ms of which 3 ms to minimize.
[2024-05-23 17:14:17] [INFO ] Deduced a trap composed of 37 places in 178 ms of which 2 ms to minimize.
[2024-05-23 17:14:17] [INFO ] Deduced a trap composed of 46 places in 171 ms of which 3 ms to minimize.
[2024-05-23 17:14:17] [INFO ] Deduced a trap composed of 44 places in 185 ms of which 3 ms to minimize.
[2024-05-23 17:14:17] [INFO ] Deduced a trap composed of 39 places in 193 ms of which 3 ms to minimize.
[2024-05-23 17:14:17] [INFO ] Deduced a trap composed of 39 places in 176 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/430 variables, and 87 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/170 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 590/590 constraints, Known Traps: 71/71 constraints]
Escalating to Integer solving :Problem set: 0 solved, 590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 71/87 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:14:24] [INFO ] Deduced a trap composed of 37 places in 172 ms of which 3 ms to minimize.
[2024-05-23 17:14:24] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 3 ms to minimize.
[2024-05-23 17:14:24] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 3 ms to minimize.
[2024-05-23 17:14:24] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 2 ms to minimize.
[2024-05-23 17:14:25] [INFO ] Deduced a trap composed of 62 places in 194 ms of which 2 ms to minimize.
[2024-05-23 17:14:25] [INFO ] Deduced a trap composed of 45 places in 168 ms of which 3 ms to minimize.
[2024-05-23 17:14:25] [INFO ] Deduced a trap composed of 46 places in 158 ms of which 2 ms to minimize.
[2024-05-23 17:14:25] [INFO ] Deduced a trap composed of 46 places in 137 ms of which 2 ms to minimize.
[2024-05-23 17:14:26] [INFO ] Deduced a trap composed of 57 places in 175 ms of which 3 ms to minimize.
[2024-05-23 17:14:26] [INFO ] Deduced a trap composed of 44 places in 164 ms of which 3 ms to minimize.
[2024-05-23 17:14:26] [INFO ] Deduced a trap composed of 51 places in 206 ms of which 3 ms to minimize.
[2024-05-23 17:14:26] [INFO ] Deduced a trap composed of 28 places in 217 ms of which 4 ms to minimize.
[2024-05-23 17:14:28] [INFO ] Deduced a trap composed of 30 places in 177 ms of which 2 ms to minimize.
[2024-05-23 17:14:28] [INFO ] Deduced a trap composed of 28 places in 161 ms of which 2 ms to minimize.
[2024-05-23 17:14:28] [INFO ] Deduced a trap composed of 37 places in 166 ms of which 3 ms to minimize.
[2024-05-23 17:14:28] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 3 ms to minimize.
[2024-05-23 17:14:29] [INFO ] Deduced a trap composed of 45 places in 165 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 17/104 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:14:33] [INFO ] Deduced a trap composed of 51 places in 195 ms of which 3 ms to minimize.
[2024-05-23 17:14:34] [INFO ] Deduced a trap composed of 45 places in 185 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:14:40] [INFO ] Deduced a trap composed of 40 places in 187 ms of which 3 ms to minimize.
[2024-05-23 17:14:41] [INFO ] Deduced a trap composed of 47 places in 138 ms of which 3 ms to minimize.
[2024-05-23 17:14:41] [INFO ] Deduced a trap composed of 49 places in 187 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-23 17:14:47] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 3 ms to minimize.
[2024-05-23 17:14:47] [INFO ] Deduced a trap composed of 40 places in 172 ms of which 3 ms to minimize.
[2024-05-23 17:14:48] [INFO ] Deduced a trap composed of 56 places in 194 ms of which 3 ms to minimize.
[2024-05-23 17:14:48] [INFO ] Deduced a trap composed of 47 places in 161 ms of which 3 ms to minimize.
[2024-05-23 17:14:48] [INFO ] Deduced a trap composed of 45 places in 172 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 170/430 variables, and 114 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/170 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/590 constraints, Known Traps: 98/98 constraints]
After SMT, in 60604ms problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 60627ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61665 ms. Remains : 170/170 places, 595/595 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 522 edges and 170 vertex of which 25 / 170 are part of one of the 5 SCC in 12 ms
Free SCC test removed 20 places
Drop transitions (Empty/Sink Transition effects.) removed 75 transitions
Ensure Unique test removed 320 transitions
Reduce isomorphic transitions removed 395 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 150 transition count 167
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 117 transition count 167
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 67 place count 117 transition count 156
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 94 place count 101 transition count 156
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 174 place count 61 transition count 116
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 193 place count 61 transition count 97
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -75
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 211 place count 52 transition count 172
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 215 place count 52 transition count 168
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 220 place count 52 transition count 163
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 221 place count 52 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 222 place count 51 transition count 162
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 5 with 25 rules applied. Total rules applied 247 place count 51 transition count 162
Applied a total of 247 rules in 101 ms. Remains 51 /170 variables (removed 119) and now considering 162/595 (removed 433) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 162 rows 51 cols
[2024-05-23 17:14:49] [INFO ] Computed 11 invariants in 2 ms
[2024-05-23 17:14:49] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2024-05-23 17:14:49] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 17:14:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-23 17:14:49] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 17:14:49] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-23 17:14:49] [INFO ] After 20ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 17:14:49] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2024-05-23 17:14:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
TRAPS : Iteration 1
[2024-05-23 17:14:49] [INFO ] After 142ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 17:14:49] [INFO ] After 307ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 610 ms.
[2024-05-23 17:14:49] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2024-05-23 17:14:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 170 places, 595 transitions and 2990 arcs took 18 ms.
[2024-05-23 17:14:50] [INFO ] Flatten gal took : 195 ms
Total runtime 78910 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running EisenbergMcGuire-PT-05

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 170
TRANSITIONS: 595
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.037s, Sys 0.000s]


SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.005s]


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

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

Process ID: 925
MODEL NAME: /home/mcc/execution/415/model
170 places, 595 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-08 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716484877798

--------------------
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
MEDDLY ERROR: Insufficient memory

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-05"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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