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.r069-tall-171620503700047.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 CANConstruction-PT-050, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620503700047
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.2M
-rw-r--r-- 1 mcc users 8.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 19:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 12 19:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 12 19:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.8M 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 CANConstruction-PT-050-ReachabilityFireability-2024-00
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-2024-01
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-2024-02
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-2024-03
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-2024-04
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-2024-05
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-2024-06
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-2024-07
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-2024-08
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-2024-09
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-2024-10
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-2024-11
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-2024-12
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-2024-13
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-2024-14
FORMULA_NAME CANConstruction-PT-050-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716369937240

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-050
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 09:25:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 09:25:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 09:25:38] [INFO ] Load time of PNML (sax parser for PT used): 292 ms
[2024-05-22 09:25:38] [INFO ] Transformed 5602 places.
[2024-05-22 09:25:38] [INFO ] Transformed 10400 transitions.
[2024-05-22 09:25:38] [INFO ] Parsed PT model containing 5602 places and 10400 transitions and 31000 arcs in 428 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (44 resets) in 2300 ms. (17 steps per ms) remains 3/16 properties
FORMULA CANConstruction-PT-050-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 858 ms. (46 steps per ms) remains 3/3 properties
// Phase 1: matrix 10400 rows 5602 cols
[2024-05-22 09:25:40] [INFO ] Computed 101 invariants in 130 ms
[2024-05-22 09:25:40] [INFO ] State equation strengthened by 4950 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5471/5542 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5542 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5542 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 10/5552 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5552 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 49/5601 variables, 49/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5601 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 10400/16001 variables, 5601/5702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/16001 variables, 4950/10652 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 16001/16002 variables, and 10652 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5043 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 5601/5602 constraints, ReadFeed: 4950/4950 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5471/5542 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5542 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 09:25:51] [INFO ] Deduced a trap composed of 5 places in 4881 ms of which 210 ms to minimize.
SMT process timed out in 11043ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 71 out of 5602 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5602/5602 places, 10400/10400 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 315 transitions
Trivial Post-agglo rules discarded 315 transitions
Performed 315 trivial Post agglomeration. Transition count delta: 315
Iterating post reduction 0 with 315 rules applied. Total rules applied 315 place count 5602 transition count 10085
Reduce places removed 315 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 316 rules applied. Total rules applied 631 place count 5287 transition count 10084
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 632 place count 5286 transition count 10084
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 632 place count 5286 transition count 10073
Deduced a syphon composed of 11 places in 7 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 654 place count 5275 transition count 10073
Discarding 2378 places :
Symmetric choice reduction at 3 with 2378 rule applications. Total rules 3032 place count 2897 transition count 5317
Iterating global reduction 3 with 2378 rules applied. Total rules applied 5410 place count 2897 transition count 5317
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 3 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 5488 place count 2858 transition count 5278
Free-agglomeration rule applied 61 times.
Iterating global reduction 3 with 61 rules applied. Total rules applied 5549 place count 2858 transition count 5217
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 3 with 61 rules applied. Total rules applied 5610 place count 2797 transition count 5217
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 4 with 23 rules applied. Total rules applied 5633 place count 2797 transition count 5194
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 4 with 23 rules applied. Total rules applied 5656 place count 2774 transition count 5194
Partial Free-agglomeration rule applied 48 times.
Drop transitions (Partial Free agglomeration) removed 48 transitions
Iterating global reduction 5 with 48 rules applied. Total rules applied 5704 place count 2774 transition count 5194
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 5708 place count 2774 transition count 5194
Applied a total of 5708 rules in 2937 ms. Remains 2774 /5602 variables (removed 2828) and now considering 5194/10400 (removed 5206) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2947 ms. Remains : 2774/5602 places, 5194/10400 transitions.
RANDOM walk for 40000 steps (110 resets) in 1029 ms. (38 steps per ms) remains 1/3 properties
FORMULA CANConstruction-PT-050-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-050-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 209 ms. (190 steps per ms) remains 1/1 properties
// Phase 1: matrix 5194 rows 2774 cols
[2024-05-22 09:25:54] [INFO ] Computed 101 invariants in 54 ms
[2024-05-22 09:25:54] [INFO ] State equation strengthened by 5018 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2664/2701 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/2723 variables, 22/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2723 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 50/2773 variables, 50/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2773 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5194/7967 variables, 2773/2874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/7967 variables, 5018/7892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/7967 variables, 0/7892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/7968 variables, 1/7893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/7968 variables, 0/7893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/7968 variables, 0/7893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7968/7968 variables, and 7893 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2586 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 2774/2774 constraints, ReadFeed: 5018/5018 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2664/2701 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 09:25:59] [INFO ] Deduced a trap composed of 2 places in 1792 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 22/2723 variables, 22/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 09:26:01] [INFO ] Deduced a trap composed of 56 places in 2384 ms of which 23 ms to minimize.
[2024-05-22 09:26:04] [INFO ] Deduced a trap composed of 56 places in 2344 ms of which 18 ms to minimize.
[2024-05-22 09:26:06] [INFO ] Deduced a trap composed of 63 places in 2337 ms of which 17 ms to minimize.
[2024-05-22 09:26:08] [INFO ] Deduced a trap composed of 63 places in 2299 ms of which 17 ms to minimize.
[2024-05-22 09:26:11] [INFO ] Deduced a trap composed of 57 places in 2381 ms of which 17 ms to minimize.
[2024-05-22 09:26:13] [INFO ] Deduced a trap composed of 57 places in 2332 ms of which 17 ms to minimize.
[2024-05-22 09:26:16] [INFO ] Deduced a trap composed of 55 places in 2388 ms of which 18 ms to minimize.
[2024-05-22 09:26:18] [INFO ] Deduced a trap composed of 57 places in 2390 ms of which 18 ms to minimize.
[2024-05-22 09:26:21] [INFO ] Deduced a trap composed of 57 places in 2369 ms of which 16 ms to minimize.
[2024-05-22 09:26:23] [INFO ] Deduced a trap composed of 57 places in 2409 ms of which 18 ms to minimize.
[2024-05-22 09:26:25] [INFO ] Deduced a trap composed of 57 places in 2374 ms of which 18 ms to minimize.
[2024-05-22 09:26:28] [INFO ] Deduced a trap composed of 67 places in 2384 ms of which 17 ms to minimize.
[2024-05-22 09:26:30] [INFO ] Deduced a trap composed of 57 places in 2342 ms of which 17 ms to minimize.
[2024-05-22 09:26:33] [INFO ] Deduced a trap composed of 57 places in 2323 ms of which 19 ms to minimize.
[2024-05-22 09:26:35] [INFO ] Deduced a trap composed of 57 places in 2339 ms of which 18 ms to minimize.
[2024-05-22 09:26:37] [INFO ] Deduced a trap composed of 57 places in 2354 ms of which 17 ms to minimize.
[2024-05-22 09:26:40] [INFO ] Deduced a trap composed of 57 places in 2357 ms of which 17 ms to minimize.
[2024-05-22 09:26:42] [INFO ] Deduced a trap composed of 53 places in 2349 ms of which 17 ms to minimize.
SMT process timed out in 48240ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 37 out of 2774 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2774/2774 places, 5194/5194 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 2773 transition count 5192
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 2773 transition count 5192
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 32 place count 2758 transition count 5177
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 2757 transition count 5177
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 35 place count 2757 transition count 5176
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 36 place count 2756 transition count 5176
Applied a total of 36 rules in 1180 ms. Remains 2756 /2774 variables (removed 18) and now considering 5176/5194 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1180 ms. Remains : 2756/2774 places, 5176/5194 transitions.
RANDOM walk for 40000 steps (112 resets) in 818 ms. (48 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 91968 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :0 out of 1
Probabilistic random walk after 91968 steps, saw 51404 distinct states, run finished after 3005 ms. (steps per millisecond=30 ) properties seen :0
// Phase 1: matrix 5176 rows 2756 cols
[2024-05-22 09:26:47] [INFO ] Computed 101 invariants in 22 ms
[2024-05-22 09:26:47] [INFO ] State equation strengthened by 5029 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2646/2683 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2683 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/2705 variables, 22/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2705 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 50/2755 variables, 50/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2755 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5176/7931 variables, 2755/2856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/7931 variables, 5029/7885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/7931 variables, 0/7885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/7932 variables, 1/7886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/7932 variables, 0/7886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/7932 variables, 0/7886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7932/7932 variables, and 7886 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2410 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 2756/2756 constraints, ReadFeed: 5029/5029 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2646/2683 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 09:26:51] [INFO ] Deduced a trap composed of 2 places in 1904 ms of which 14 ms to minimize.
[2024-05-22 09:26:52] [INFO ] Deduced a trap composed of 55 places in 263 ms of which 5 ms to minimize.
[2024-05-22 09:26:52] [INFO ] Deduced a trap composed of 53 places in 228 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2683 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2683 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 22/2705 variables, 22/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 09:26:54] [INFO ] Deduced a trap composed of 53 places in 2250 ms of which 16 ms to minimize.
[2024-05-22 09:26:57] [INFO ] Deduced a trap composed of 53 places in 2269 ms of which 17 ms to minimize.
[2024-05-22 09:26:59] [INFO ] Deduced a trap composed of 53 places in 2252 ms of which 17 ms to minimize.
[2024-05-22 09:27:01] [INFO ] Deduced a trap composed of 53 places in 2194 ms of which 17 ms to minimize.
[2024-05-22 09:27:03] [INFO ] Deduced a trap composed of 57 places in 2041 ms of which 14 ms to minimize.
[2024-05-22 09:27:05] [INFO ] Deduced a trap composed of 53 places in 2065 ms of which 16 ms to minimize.
[2024-05-22 09:27:07] [INFO ] Deduced a trap composed of 53 places in 2103 ms of which 20 ms to minimize.
[2024-05-22 09:27:10] [INFO ] Deduced a trap composed of 60 places in 2014 ms of which 17 ms to minimize.
[2024-05-22 09:27:12] [INFO ] Deduced a trap composed of 64 places in 1993 ms of which 17 ms to minimize.
[2024-05-22 09:27:14] [INFO ] Deduced a trap composed of 64 places in 1996 ms of which 17 ms to minimize.
[2024-05-22 09:27:16] [INFO ] Deduced a trap composed of 63 places in 1938 ms of which 16 ms to minimize.
[2024-05-22 09:27:18] [INFO ] Deduced a trap composed of 53 places in 2024 ms of which 16 ms to minimize.
[2024-05-22 09:27:20] [INFO ] Deduced a trap composed of 53 places in 1965 ms of which 17 ms to minimize.
[2024-05-22 09:27:22] [INFO ] Deduced a trap composed of 53 places in 1938 ms of which 16 ms to minimize.
[2024-05-22 09:27:24] [INFO ] Deduced a trap composed of 53 places in 1964 ms of which 16 ms to minimize.
[2024-05-22 09:27:26] [INFO ] Deduced a trap composed of 53 places in 1993 ms of which 16 ms to minimize.
[2024-05-22 09:27:28] [INFO ] Deduced a trap composed of 53 places in 1980 ms of which 16 ms to minimize.
[2024-05-22 09:27:30] [INFO ] Deduced a trap composed of 53 places in 1977 ms of which 16 ms to minimize.
[2024-05-22 09:27:32] [INFO ] Deduced a trap composed of 53 places in 2011 ms of which 16 ms to minimize.
[2024-05-22 09:27:34] [INFO ] Deduced a trap composed of 53 places in 1976 ms of which 16 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2705 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 09:27:36] [INFO ] Deduced a trap composed of 53 places in 1956 ms of which 16 ms to minimize.
[2024-05-22 09:27:38] [INFO ] Deduced a trap composed of 53 places in 1974 ms of which 16 ms to minimize.
[2024-05-22 09:27:40] [INFO ] Deduced a trap composed of 84 places in 1979 ms of which 16 ms to minimize.
[2024-05-22 09:27:42] [INFO ] Deduced a trap composed of 62 places in 1882 ms of which 16 ms to minimize.
[2024-05-22 09:27:44] [INFO ] Deduced a trap composed of 53 places in 1854 ms of which 15 ms to minimize.
[2024-05-22 09:27:46] [INFO ] Deduced a trap composed of 61 places in 1941 ms of which 17 ms to minimize.
[2024-05-22 09:27:48] [INFO ] Deduced a trap composed of 53 places in 1936 ms of which 16 ms to minimize.
[2024-05-22 09:27:50] [INFO ] Deduced a trap composed of 53 places in 1886 ms of which 15 ms to minimize.
[2024-05-22 09:27:51] [INFO ] Deduced a trap composed of 53 places in 1822 ms of which 17 ms to minimize.
[2024-05-22 09:27:53] [INFO ] Deduced a trap composed of 53 places in 1806 ms of which 16 ms to minimize.
[2024-05-22 09:27:55] [INFO ] Deduced a trap composed of 53 places in 1779 ms of which 16 ms to minimize.
[2024-05-22 09:27:57] [INFO ] Deduced a trap composed of 53 places in 1971 ms of which 16 ms to minimize.
[2024-05-22 09:27:59] [INFO ] Deduced a trap composed of 53 places in 1907 ms of which 16 ms to minimize.
[2024-05-22 09:28:01] [INFO ] Deduced a trap composed of 53 places in 1842 ms of which 19 ms to minimize.
[2024-05-22 09:28:03] [INFO ] Deduced a trap composed of 58 places in 1858 ms of which 16 ms to minimize.
[2024-05-22 09:28:05] [INFO ] Deduced a trap composed of 59 places in 1906 ms of which 16 ms to minimize.
SMT process timed out in 78024ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 37 out of 2756 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2756/2756 places, 5176/5176 transitions.
Applied a total of 0 rules in 221 ms. Remains 2756 /2756 variables (removed 0) and now considering 5176/5176 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 221 ms. Remains : 2756/2756 places, 5176/5176 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2756/2756 places, 5176/5176 transitions.
Applied a total of 0 rules in 249 ms. Remains 2756 /2756 variables (removed 0) and now considering 5176/5176 (removed 0) transitions.
[2024-05-22 09:28:05] [INFO ] Invariant cache hit.
[2024-05-22 09:28:07] [INFO ] Implicit Places using invariants in 1694 ms returned [5, 9, 13, 18, 24, 28, 32, 36, 40, 46, 52, 56, 61, 68, 72, 76, 80, 86, 92, 96, 102, 106, 110, 116, 122, 128, 132, 136, 140, 144, 150, 154, 160, 164, 170, 174, 178, 184, 190, 194, 198, 202, 206, 210, 216, 221, 225, 231, 237, 243]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 1705 ms to find 50 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2706/2756 places, 5176/5176 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 2706 transition count 5162
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 2692 transition count 5162
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 2690 transition count 5160
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 2690 transition count 5160
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 66 place count 2673 transition count 5143
Applied a total of 66 rules in 627 ms. Remains 2673 /2706 variables (removed 33) and now considering 5143/5176 (removed 33) transitions.
// Phase 1: matrix 5143 rows 2673 cols
[2024-05-22 09:28:08] [INFO ] Computed 51 invariants in 58 ms
[2024-05-22 09:28:09] [INFO ] Implicit Places using invariants in 1565 ms returned []
[2024-05-22 09:28:09] [INFO ] Invariant cache hit.
[2024-05-22 09:28:11] [INFO ] State equation strengthened by 4960 read => feed constraints.
[2024-05-22 09:28:41] [INFO ] Performed 1411/2673 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 09:29:07] [INFO ] Implicit Places using invariants and state equation in 58294 ms returned []
Implicit Place search using SMT with State Equation took 59861 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2673/2756 places, 5143/5176 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 62443 ms. Remains : 2673/2756 places, 5143/5176 transitions.
RANDOM walk for 40000 steps (110 resets) in 499 ms. (80 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 169906 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 1
Probabilistic random walk after 169906 steps, saw 128622 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
[2024-05-22 09:29:11] [INFO ] Invariant cache hit.
[2024-05-22 09:29:11] [INFO ] State equation strengthened by 4960 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2613/2650 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2650 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/2672 variables, 22/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2672 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5143/7815 variables, 2672/2723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7815 variables, 4960/7683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/7815 variables, 0/7683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/7816 variables, 1/7684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/7816 variables, 0/7684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/7816 variables, 0/7684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7816/7816 variables, and 7684 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2059 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 2673/2673 constraints, ReadFeed: 4960/4960 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2613/2650 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 09:29:15] [INFO ] Deduced a trap composed of 2 places in 1707 ms of which 13 ms to minimize.
[2024-05-22 09:29:15] [INFO ] Deduced a trap composed of 53 places in 191 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2650 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2650 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 22/2672 variables, 22/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 09:29:17] [INFO ] Deduced a trap composed of 59 places in 2315 ms of which 16 ms to minimize.
[2024-05-22 09:29:20] [INFO ] Deduced a trap composed of 63 places in 2269 ms of which 17 ms to minimize.
[2024-05-22 09:29:22] [INFO ] Deduced a trap composed of 61 places in 2250 ms of which 16 ms to minimize.
[2024-05-22 09:29:24] [INFO ] Deduced a trap composed of 54 places in 2221 ms of which 17 ms to minimize.
[2024-05-22 09:29:27] [INFO ] Deduced a trap composed of 54 places in 2252 ms of which 17 ms to minimize.
[2024-05-22 09:29:29] [INFO ] Deduced a trap composed of 58 places in 2187 ms of which 18 ms to minimize.
[2024-05-22 09:29:31] [INFO ] Deduced a trap composed of 53 places in 2156 ms of which 16 ms to minimize.
[2024-05-22 09:29:33] [INFO ] Deduced a trap composed of 53 places in 2167 ms of which 17 ms to minimize.
[2024-05-22 09:29:35] [INFO ] Deduced a trap composed of 53 places in 2085 ms of which 16 ms to minimize.
[2024-05-22 09:29:38] [INFO ] Deduced a trap composed of 60 places in 2237 ms of which 17 ms to minimize.
[2024-05-22 09:29:40] [INFO ] Deduced a trap composed of 57 places in 2225 ms of which 17 ms to minimize.
[2024-05-22 09:29:42] [INFO ] Deduced a trap composed of 60 places in 2243 ms of which 16 ms to minimize.
[2024-05-22 09:29:44] [INFO ] Deduced a trap composed of 53 places in 2144 ms of which 16 ms to minimize.
[2024-05-22 09:29:46] [INFO ] Deduced a trap composed of 57 places in 2124 ms of which 15 ms to minimize.
[2024-05-22 09:29:49] [INFO ] Deduced a trap composed of 62 places in 2115 ms of which 17 ms to minimize.
[2024-05-22 09:29:51] [INFO ] Deduced a trap composed of 63 places in 2100 ms of which 18 ms to minimize.
[2024-05-22 09:29:53] [INFO ] Deduced a trap composed of 63 places in 2093 ms of which 16 ms to minimize.
[2024-05-22 09:29:55] [INFO ] Deduced a trap composed of 65 places in 2128 ms of which 16 ms to minimize.
[2024-05-22 09:29:57] [INFO ] Deduced a trap composed of 64 places in 2161 ms of which 16 ms to minimize.
[2024-05-22 09:29:59] [INFO ] Deduced a trap composed of 63 places in 2160 ms of which 17 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2672 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 09:30:01] [INFO ] Deduced a trap composed of 60 places in 1969 ms of which 15 ms to minimize.
[2024-05-22 09:30:04] [INFO ] Deduced a trap composed of 62 places in 2091 ms of which 16 ms to minimize.
[2024-05-22 09:30:06] [INFO ] Deduced a trap composed of 53 places in 2069 ms of which 17 ms to minimize.
[2024-05-22 09:30:08] [INFO ] Deduced a trap composed of 64 places in 2087 ms of which 16 ms to minimize.
[2024-05-22 09:30:10] [INFO ] Deduced a trap composed of 64 places in 2114 ms of which 16 ms to minimize.
[2024-05-22 09:30:12] [INFO ] Deduced a trap composed of 64 places in 2060 ms of which 16 ms to minimize.
[2024-05-22 09:30:14] [INFO ] Deduced a trap composed of 53 places in 2071 ms of which 16 ms to minimize.
[2024-05-22 09:30:16] [INFO ] Deduced a trap composed of 63 places in 2027 ms of which 14 ms to minimize.
[2024-05-22 09:30:18] [INFO ] Deduced a trap composed of 61 places in 2090 ms of which 16 ms to minimize.
[2024-05-22 09:30:20] [INFO ] Deduced a trap composed of 53 places in 1986 ms of which 17 ms to minimize.
[2024-05-22 09:30:22] [INFO ] Deduced a trap composed of 53 places in 1928 ms of which 17 ms to minimize.
[2024-05-22 09:30:24] [INFO ] Deduced a trap composed of 53 places in 1921 ms of which 17 ms to minimize.
[2024-05-22 09:30:26] [INFO ] Deduced a trap composed of 53 places in 1960 ms of which 16 ms to minimize.
[2024-05-22 09:30:28] [INFO ] Deduced a trap composed of 53 places in 1934 ms of which 16 ms to minimize.
[2024-05-22 09:30:30] [INFO ] Deduced a trap composed of 57 places in 1907 ms of which 17 ms to minimize.
[2024-05-22 09:30:32] [INFO ] Deduced a trap composed of 53 places in 1816 ms of which 16 ms to minimize.
[2024-05-22 09:30:34] [INFO ] Deduced a trap composed of 56 places in 1817 ms of which 16 ms to minimize.
[2024-05-22 09:30:36] [INFO ] Deduced a trap composed of 61 places in 1716 ms of which 16 ms to minimize.
[2024-05-22 09:30:37] [INFO ] Deduced a trap composed of 62 places in 1826 ms of which 17 ms to minimize.
[2024-05-22 09:30:39] [INFO ] Deduced a trap composed of 53 places in 1756 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2672 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 09:30:41] [INFO ] Deduced a trap composed of 53 places in 1731 ms of which 15 ms to minimize.
[2024-05-22 09:30:43] [INFO ] Deduced a trap composed of 53 places in 1779 ms of which 16 ms to minimize.
SMT process timed out in 92281ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 37 out of 2673 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2673/2673 places, 5143/5143 transitions.
Applied a total of 0 rules in 255 ms. Remains 2673 /2673 variables (removed 0) and now considering 5143/5143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 255 ms. Remains : 2673/2673 places, 5143/5143 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2673/2673 places, 5143/5143 transitions.
Applied a total of 0 rules in 248 ms. Remains 2673 /2673 variables (removed 0) and now considering 5143/5143 (removed 0) transitions.
[2024-05-22 09:30:43] [INFO ] Invariant cache hit.
[2024-05-22 09:30:45] [INFO ] Implicit Places using invariants in 1431 ms returned []
[2024-05-22 09:30:45] [INFO ] Invariant cache hit.
[2024-05-22 09:30:46] [INFO ] State equation strengthened by 4960 read => feed constraints.
[2024-05-22 09:31:17] [INFO ] Performed 1507/2673 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 09:31:41] [INFO ] Implicit Places using invariants and state equation in 55948 ms returned []
Implicit Place search using SMT with State Equation took 57381 ms to find 0 implicit places.
[2024-05-22 09:31:41] [INFO ] Redundant transitions in 382 ms returned []
Running 5093 sub problems to find dead transitions.
[2024-05-22 09:31:41] [INFO ] Invariant cache hit.
[2024-05-22 09:31:41] [INFO ] State equation strengthened by 4960 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2672 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5093 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2672/7816 variables, and 51 constraints, problems are : Problem set: 0 solved, 5093 unsolved in 30099 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/2673 constraints, ReadFeed: 0/4960 constraints, PredecessorRefiner: 5093/5093 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5093 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2672 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 5093 unsolved
[2024-05-22 09:32:20] [INFO ] Deduced a trap composed of 53 places in 1337 ms of which 14 ms to minimize.
[2024-05-22 09:32:22] [INFO ] Deduced a trap composed of 53 places in 1319 ms of which 14 ms to minimize.
[2024-05-22 09:32:23] [INFO ] Deduced a trap composed of 53 places in 1200 ms of which 14 ms to minimize.
[2024-05-22 09:32:24] [INFO ] Deduced a trap composed of 53 places in 1210 ms of which 14 ms to minimize.
[2024-05-22 09:32:25] [INFO ] Deduced a trap composed of 53 places in 1095 ms of which 14 ms to minimize.
[2024-05-22 09:32:26] [INFO ] Deduced a trap composed of 53 places in 1078 ms of which 13 ms to minimize.
[2024-05-22 09:32:27] [INFO ] Deduced a trap composed of 53 places in 1075 ms of which 15 ms to minimize.
[2024-05-22 09:32:29] [INFO ] Deduced a trap composed of 58 places in 1121 ms of which 14 ms to minimize.
[2024-05-22 09:32:30] [INFO ] Deduced a trap composed of 53 places in 1089 ms of which 13 ms to minimize.
[2024-05-22 09:32:31] [INFO ] Deduced a trap composed of 53 places in 1130 ms of which 14 ms to minimize.
[2024-05-22 09:32:32] [INFO ] Deduced a trap composed of 58 places in 1159 ms of which 14 ms to minimize.
[2024-05-22 09:32:33] [INFO ] Deduced a trap composed of 53 places in 1164 ms of which 13 ms to minimize.
[2024-05-22 09:32:35] [INFO ] Deduced a trap composed of 53 places in 1121 ms of which 14 ms to minimize.
[2024-05-22 09:32:36] [INFO ] Deduced a trap composed of 53 places in 1231 ms of which 12 ms to minimize.
[2024-05-22 09:32:37] [INFO ] Deduced a trap composed of 53 places in 1335 ms of which 14 ms to minimize.
[2024-05-22 09:32:39] [INFO ] Deduced a trap composed of 53 places in 1283 ms of which 14 ms to minimize.
[2024-05-22 09:32:40] [INFO ] Deduced a trap composed of 61 places in 1416 ms of which 14 ms to minimize.
[2024-05-22 09:32:41] [INFO ] Deduced a trap composed of 53 places in 1299 ms of which 14 ms to minimize.
[2024-05-22 09:32:43] [INFO ] Deduced a trap composed of 53 places in 1352 ms of which 14 ms to minimize.
[2024-05-22 09:32:44] [INFO ] Deduced a trap composed of 53 places in 1285 ms of which 15 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/2672 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 5093 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2672/7816 variables, and 71 constraints, problems are : Problem set: 0 solved, 5093 unsolved in 30082 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 0/2673 constraints, ReadFeed: 0/4960 constraints, PredecessorRefiner: 0/5093 constraints, Known Traps: 20/20 constraints]
After SMT, in 64821ms problems are : Problem set: 0 solved, 5093 unsolved
Search for dead transitions found 0 dead transitions in 64877ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122918 ms. Remains : 2673/2673 places, 5143/5143 transitions.
[2024-05-22 09:32:46] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-05-22 09:32:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2673 places, 5143 transitions and 20378 arcs took 26 ms.
[2024-05-22 09:32:47] [INFO ] Flatten gal took : 285 ms
Total runtime 428700 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CANConstruction-PT-050

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 2673
TRANSITIONS: 5143
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.097s, Sys 0.015s]


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


----------------------------------------------------------------------
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: 985
MODEL NAME: /home/mcc/execution/411/model
2673 places, 5143 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.

BK_TIME_CONFINEMENT_REACHED

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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

MEDDLY ERROR: Insufficient memory

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="CANConstruction-PT-050"
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 CANConstruction-PT-050, 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 r069-tall-171620503700047"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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