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-171620503800078.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-090, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620503800078
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 9.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K 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 49K 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:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K May 14 13:22 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 12M 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-090-ReachabilityCardinality-2024-00
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2024-01
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2024-02
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2024-03
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2024-04
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2024-05
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2024-06
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2024-07
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2024-08
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2024-09
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2024-10
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2023-11
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2024-12
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2024-13
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2024-14
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716381775330

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-090
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 12:42:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 12:42:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 12:42:57] [INFO ] Load time of PNML (sax parser for PT used): 657 ms
[2024-05-22 12:42:57] [INFO ] Transformed 17282 places.
[2024-05-22 12:42:57] [INFO ] Transformed 33120 transitions.
[2024-05-22 12:42:57] [INFO ] Parsed PT model containing 17282 places and 33120 transitions and 99000 arcs in 884 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (24 resets) in 3544 ms. (11 steps per ms) remains 12/16 properties
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 255 ms. (156 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 738 ms. (54 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 260 ms. (153 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 12/12 properties
// Phase 1: matrix 33120 rows 17282 cols
[2024-05-22 12:43:00] [INFO ] Computed 181 invariants in 416 ms
[2024-05-22 12:43:00] [INFO ] State equation strengthened by 16110 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem CANConstruction-PT-090-ReachabilityCardinality-2024-00 is UNSAT
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-090-ReachabilityCardinality-2024-15 is UNSAT
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 16986/17185 variables, 84/84 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17185 variables, 1/85 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17185 variables, 0/85 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 7/17192 variables, 7/92 constraints. Problems are: Problem set: 2 solved, 10 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 17192/50402 variables, and 92 constraints, problems are : Problem set: 2 solved, 10 unsolved in 5036 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 1/90 constraints, State Equation: 0/17282 constraints, ReadFeed: 0/16110 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 17022/17180 variables, 79/79 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17180 variables, 1/80 constraints. Problems are: Problem set: 2 solved, 10 unsolved
[2024-05-22 12:44:00] [INFO ] Deduced a trap composed of 5 places in 52110 ms of which 667 ms to minimize.
SMT process timed out in 60806ms, After SMT, problems are : Problem set: 2 solved, 10 unsolved
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 158 out of 17282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17282/17282 places, 33120/33120 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 610 transitions
Trivial Post-agglo rules discarded 610 transitions
Performed 610 trivial Post agglomeration. Transition count delta: 610
Iterating post reduction 0 with 610 rules applied. Total rules applied 610 place count 17282 transition count 32510
Reduce places removed 610 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 618 rules applied. Total rules applied 1228 place count 16672 transition count 32502
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1236 place count 16664 transition count 32502
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1236 place count 16664 transition count 32499
Deduced a syphon composed of 3 places in 17 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1242 place count 16661 transition count 32499
Discarding 7835 places :
Symmetric choice reduction at 3 with 7835 rule applications. Total rules 9077 place count 8826 transition count 16829
Iterating global reduction 3 with 7835 rules applied. Total rules applied 16912 place count 8826 transition count 16829
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 8 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 17080 place count 8742 transition count 16745
Free-agglomeration rule applied 62 times.
Iterating global reduction 3 with 62 rules applied. Total rules applied 17142 place count 8742 transition count 16683
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 3 with 62 rules applied. Total rules applied 17204 place count 8680 transition count 16683
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 17207 place count 8680 transition count 16680
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 17210 place count 8677 transition count 16680
Partial Free-agglomeration rule applied 121 times.
Drop transitions (Partial Free agglomeration) removed 121 transitions
Iterating global reduction 5 with 121 rules applied. Total rules applied 17331 place count 8677 transition count 16680
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 17334 place count 8677 transition count 16680
Applied a total of 17334 rules in 19180 ms. Remains 8677 /17282 variables (removed 8605) and now considering 16680/33120 (removed 16440) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19193 ms. Remains : 8677/17282 places, 16680/33120 transitions.
RANDOM walk for 40000 steps (61 resets) in 1283 ms. (31 steps per ms) remains 7/10 properties
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 7/7 properties
// Phase 1: matrix 16680 rows 8677 cols
[2024-05-22 12:44:20] [INFO ] Computed 181 invariants in 122 ms
[2024-05-22 12:44:20] [INFO ] State equation strengthened by 16249 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 8444/8566 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8566 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8566 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 21/8587 variables, 21/92 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8587 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 89/8676 variables, 89/181 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8676 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 16680/25356 variables, 8676/8857 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/25356 variables, 16249/25106 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/25356 variables, 0/25106 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 1/25357 variables, 1/25107 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/25357 variables, 0/25107 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/25357 variables, 0/25107 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25357/25357 variables, and 25107 constraints, problems are : Problem set: 0 solved, 7 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 90/90 constraints, State Equation: 8677/8677 constraints, ReadFeed: 16249/16249 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 8444/8566 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8566 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 12:45:08] [INFO ] Deduced a trap composed of 2 places in 17145 ms of which 46 ms to minimize.
[2024-05-22 12:45:26] [INFO ] Deduced a trap composed of 2 places in 17206 ms of which 51 ms to minimize.
[2024-05-22 12:45:32] [INFO ] Deduced a trap composed of 97 places in 6193 ms of which 36 ms to minimize.
[2024-05-22 12:45:38] [INFO ] Deduced a trap composed of 96 places in 6108 ms of which 34 ms to minimize.
SMT process timed out in 78440ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 122 out of 8677 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8677/8677 places, 16680/16680 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 8676 transition count 16678
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8676 transition count 16678
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 4 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 44 place count 8655 transition count 16657
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 8654 transition count 16657
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 47 place count 8654 transition count 16656
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 48 place count 8653 transition count 16656
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 8652 transition count 16654
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 8652 transition count 16654
Applied a total of 50 rules in 14877 ms. Remains 8652 /8677 variables (removed 25) and now considering 16654/16680 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14877 ms. Remains : 8652/8677 places, 16654/16680 transitions.
RANDOM walk for 40000 steps (60 resets) in 1297 ms. (30 steps per ms) remains 3/7 properties
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 3/3 properties
// Phase 1: matrix 16654 rows 8652 cols
[2024-05-22 12:45:54] [INFO ] Computed 181 invariants in 122 ms
[2024-05-22 12:45:54] [INFO ] State equation strengthened by 16272 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8457/8518 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8518 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8518 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 44/8562 variables, 44/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8562 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 89/8651 variables, 89/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8651 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 16654/25305 variables, 8651/8832 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/25305 variables, 16272/25104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/25305 variables, 0/25104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/25306 variables, 1/25105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/25306 variables, 0/25105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/25306 variables, 0/25105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25306/25306 variables, and 25105 constraints, problems are : Problem set: 0 solved, 3 unsolved in 17993 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 90/90 constraints, State Equation: 8652/8652 constraints, ReadFeed: 16272/16272 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/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8457/8518 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8518 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 12:46:28] [INFO ] Deduced a trap composed of 2 places in 15277 ms of which 50 ms to minimize.
[2024-05-22 12:46:30] [INFO ] Deduced a trap composed of 93 places in 1943 ms of which 18 ms to minimize.
[2024-05-22 12:46:33] [INFO ] Deduced a trap composed of 96 places in 1996 ms of which 19 ms to minimize.
[2024-05-22 12:46:34] [INFO ] Deduced a trap composed of 93 places in 1658 ms of which 16 ms to minimize.
[2024-05-22 12:46:36] [INFO ] Deduced a trap composed of 96 places in 1508 ms of which 16 ms to minimize.
[2024-05-22 12:46:38] [INFO ] Deduced a trap composed of 93 places in 1508 ms of which 16 ms to minimize.
[2024-05-22 12:46:39] [INFO ] Deduced a trap composed of 96 places in 1272 ms of which 13 ms to minimize.
[2024-05-22 12:46:40] [INFO ] Deduced a trap composed of 93 places in 1350 ms of which 17 ms to minimize.
[2024-05-22 12:46:43] [INFO ] Deduced a trap composed of 93 places in 1796 ms of which 17 ms to minimize.
[2024-05-22 12:46:44] [INFO ] Deduced a trap composed of 95 places in 1642 ms of which 17 ms to minimize.
[2024-05-22 12:46:46] [INFO ] Deduced a trap composed of 93 places in 1523 ms of which 16 ms to minimize.
[2024-05-22 12:46:48] [INFO ] Deduced a trap composed of 93 places in 1620 ms of which 16 ms to minimize.
[2024-05-22 12:46:49] [INFO ] Deduced a trap composed of 93 places in 1276 ms of which 15 ms to minimize.
[2024-05-22 12:46:51] [INFO ] Deduced a trap composed of 93 places in 1342 ms of which 16 ms to minimize.
[2024-05-22 12:46:52] [INFO ] Deduced a trap composed of 93 places in 1377 ms of which 15 ms to minimize.
[2024-05-22 12:46:53] [INFO ] Deduced a trap composed of 96 places in 1098 ms of which 13 ms to minimize.
[2024-05-22 12:46:55] [INFO ] Deduced a trap composed of 96 places in 1262 ms of which 15 ms to minimize.
[2024-05-22 12:46:56] [INFO ] Deduced a trap composed of 96 places in 1272 ms of which 15 ms to minimize.
[2024-05-22 12:46:57] [INFO ] Deduced a trap composed of 96 places in 1107 ms of which 13 ms to minimize.
[2024-05-22 12:46:58] [INFO ] Deduced a trap composed of 96 places in 998 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/8518 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 12:47:00] [INFO ] Deduced a trap composed of 96 places in 1800 ms of which 19 ms to minimize.
[2024-05-22 12:47:02] [INFO ] Deduced a trap composed of 93 places in 1457 ms of which 15 ms to minimize.
[2024-05-22 12:47:03] [INFO ] Deduced a trap composed of 96 places in 1266 ms of which 14 ms to minimize.
[2024-05-22 12:47:05] [INFO ] Deduced a trap composed of 93 places in 1545 ms of which 17 ms to minimize.
[2024-05-22 12:47:07] [INFO ] Deduced a trap composed of 96 places in 1744 ms of which 18 ms to minimize.
[2024-05-22 12:47:08] [INFO ] Deduced a trap composed of 93 places in 1511 ms of which 18 ms to minimize.
[2024-05-22 12:47:10] [INFO ] Deduced a trap composed of 96 places in 1420 ms of which 16 ms to minimize.
[2024-05-22 12:47:12] [INFO ] Deduced a trap composed of 96 places in 1612 ms of which 18 ms to minimize.
[2024-05-22 12:47:13] [INFO ] Deduced a trap composed of 96 places in 1385 ms of which 16 ms to minimize.
[2024-05-22 12:47:14] [INFO ] Deduced a trap composed of 93 places in 1179 ms of which 18 ms to minimize.
[2024-05-22 12:47:16] [INFO ] Deduced a trap composed of 93 places in 1478 ms of which 17 ms to minimize.
[2024-05-22 12:47:18] [INFO ] Deduced a trap composed of 93 places in 1564 ms of which 16 ms to minimize.
[2024-05-22 12:47:19] [INFO ] Deduced a trap composed of 96 places in 1602 ms of which 16 ms to minimize.
[2024-05-22 12:47:21] [INFO ] Deduced a trap composed of 96 places in 1632 ms of which 16 ms to minimize.
[2024-05-22 12:47:23] [INFO ] Deduced a trap composed of 96 places in 1622 ms of which 16 ms to minimize.
[2024-05-22 12:47:25] [INFO ] Deduced a trap composed of 95 places in 1454 ms of which 15 ms to minimize.
[2024-05-22 12:47:26] [INFO ] Deduced a trap composed of 96 places in 1658 ms of which 16 ms to minimize.
[2024-05-22 12:47:28] [INFO ] Deduced a trap composed of 95 places in 1447 ms of which 15 ms to minimize.
SMT process timed out in 94182ms, 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 61 out of 8652 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8652/8652 places, 16654/16654 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8652 transition count 16653
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8651 transition count 16653
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 6 place count 8647 transition count 16645
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 8647 transition count 16645
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 3 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 52 place count 8626 transition count 16624
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 60 place count 8622 transition count 16624
Applied a total of 60 rules in 9795 ms. Remains 8622 /8652 variables (removed 30) and now considering 16624/16654 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9795 ms. Remains : 8622/8652 places, 16624/16654 transitions.
RANDOM walk for 40000 steps (60 resets) in 1386 ms. (28 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 186813 steps, run timeout after 3009 ms. (steps per millisecond=62 ) properties seen :0 out of 3
Probabilistic random walk after 186813 steps, saw 184003 distinct states, run finished after 3013 ms. (steps per millisecond=62 ) properties seen :0
// Phase 1: matrix 16624 rows 8622 cols
[2024-05-22 12:47:42] [INFO ] Computed 181 invariants in 105 ms
[2024-05-22 12:47:42] [INFO ] State equation strengthened by 16301 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8427/8488 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8488 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8488 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 44/8532 variables, 44/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8532 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 89/8621 variables, 89/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8621 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 16624/25245 variables, 8621/8802 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/25245 variables, 16301/25103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/25245 variables, 0/25103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/25246 variables, 1/25104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/25246 variables, 0/25104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/25246 variables, 0/25104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25246/25246 variables, and 25104 constraints, problems are : Problem set: 0 solved, 3 unsolved in 17506 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 90/90 constraints, State Equation: 8622/8622 constraints, ReadFeed: 16301/16301 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/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8427/8488 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8488 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 12:48:16] [INFO ] Deduced a trap composed of 2 places in 16019 ms of which 44 ms to minimize.
[2024-05-22 12:48:19] [INFO ] Deduced a trap composed of 96 places in 2712 ms of which 21 ms to minimize.
[2024-05-22 12:48:22] [INFO ] Deduced a trap composed of 93 places in 2550 ms of which 20 ms to minimize.
[2024-05-22 12:48:24] [INFO ] Deduced a trap composed of 93 places in 2612 ms of which 19 ms to minimize.
[2024-05-22 12:48:27] [INFO ] Deduced a trap composed of 93 places in 2645 ms of which 22 ms to minimize.
[2024-05-22 12:48:30] [INFO ] Deduced a trap composed of 93 places in 2615 ms of which 22 ms to minimize.
[2024-05-22 12:48:32] [INFO ] Deduced a trap composed of 93 places in 2188 ms of which 20 ms to minimize.
[2024-05-22 12:48:35] [INFO ] Deduced a trap composed of 96 places in 2396 ms of which 21 ms to minimize.
[2024-05-22 12:48:37] [INFO ] Deduced a trap composed of 93 places in 2258 ms of which 20 ms to minimize.
[2024-05-22 12:48:39] [INFO ] Deduced a trap composed of 93 places in 2061 ms of which 21 ms to minimize.
[2024-05-22 12:48:41] [INFO ] Deduced a trap composed of 96 places in 2014 ms of which 18 ms to minimize.
[2024-05-22 12:48:43] [INFO ] Deduced a trap composed of 93 places in 1867 ms of which 19 ms to minimize.
[2024-05-22 12:48:45] [INFO ] Deduced a trap composed of 93 places in 1992 ms of which 19 ms to minimize.
[2024-05-22 12:48:47] [INFO ] Deduced a trap composed of 96 places in 1939 ms of which 20 ms to minimize.
[2024-05-22 12:48:49] [INFO ] Deduced a trap composed of 97 places in 1987 ms of which 18 ms to minimize.
[2024-05-22 12:48:52] [INFO ] Deduced a trap composed of 96 places in 1968 ms of which 19 ms to minimize.
[2024-05-22 12:48:54] [INFO ] Deduced a trap composed of 96 places in 2024 ms of which 19 ms to minimize.
[2024-05-22 12:48:56] [INFO ] Deduced a trap composed of 96 places in 1935 ms of which 18 ms to minimize.
[2024-05-22 12:48:58] [INFO ] Deduced a trap composed of 93 places in 1821 ms of which 18 ms to minimize.
[2024-05-22 12:49:00] [INFO ] Deduced a trap composed of 93 places in 2040 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/8488 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 12:49:02] [INFO ] Deduced a trap composed of 93 places in 2354 ms of which 22 ms to minimize.
[2024-05-22 12:49:05] [INFO ] Deduced a trap composed of 96 places in 2338 ms of which 22 ms to minimize.
[2024-05-22 12:49:07] [INFO ] Deduced a trap composed of 93 places in 2239 ms of which 20 ms to minimize.
[2024-05-22 12:49:09] [INFO ] Deduced a trap composed of 93 places in 2193 ms of which 19 ms to minimize.
[2024-05-22 12:49:11] [INFO ] Deduced a trap composed of 93 places in 2047 ms of which 17 ms to minimize.
[2024-05-22 12:49:14] [INFO ] Deduced a trap composed of 93 places in 2158 ms of which 18 ms to minimize.
[2024-05-22 12:49:16] [INFO ] Deduced a trap composed of 93 places in 1938 ms of which 18 ms to minimize.
[2024-05-22 12:49:18] [INFO ] Deduced a trap composed of 96 places in 1922 ms of which 20 ms to minimize.
[2024-05-22 12:49:20] [INFO ] Deduced a trap composed of 96 places in 1899 ms of which 19 ms to minimize.
[2024-05-22 12:49:22] [INFO ] Deduced a trap composed of 93 places in 2067 ms of which 19 ms to minimize.
[2024-05-22 12:49:24] [INFO ] Deduced a trap composed of 93 places in 1969 ms of which 20 ms to minimize.
[2024-05-22 12:49:26] [INFO ] Deduced a trap composed of 96 places in 1687 ms of which 17 ms to minimize.
[2024-05-22 12:49:27] [INFO ] Deduced a trap composed of 96 places in 1548 ms of which 17 ms to minimize.
[2024-05-22 12:49:29] [INFO ] Deduced a trap composed of 96 places in 1678 ms of which 17 ms to minimize.
SMT process timed out in 107868ms, 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 61 out of 8622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8622/8622 places, 16624/16624 transitions.
Applied a total of 0 rules in 2609 ms. Remains 8622 /8622 variables (removed 0) and now considering 16624/16624 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2609 ms. Remains : 8622/8622 places, 16624/16624 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8622/8622 places, 16624/16624 transitions.
Applied a total of 0 rules in 2605 ms. Remains 8622 /8622 variables (removed 0) and now considering 16624/16624 (removed 0) transitions.
[2024-05-22 12:49:34] [INFO ] Invariant cache hit.
[2024-05-22 12:49:43] [INFO ] Implicit Places using invariants in 8517 ms returned [10, 14, 20, 26, 32, 38, 44, 52, 58, 62, 68, 74, 80, 84, 90, 94, 98, 102, 106, 110, 116, 124, 130, 134, 139, 145, 151, 157, 163, 169, 175, 181, 185, 189, 193, 197, 203, 209, 215, 223, 227, 233, 237, 245, 251, 257, 263, 269, 275, 279, 283, 289, 295, 300, 304, 310, 316, 320, 326, 332, 336, 342, 346, 350, 356, 362, 368, 374, 380, 384, 390, 394, 400, 406, 412, 416, 420, 426, 432, 438, 444, 450, 456, 462, 468, 472, 476, 482, 488]
Discarding 89 places :
Implicit Place search using SMT only with invariants took 8534 ms to find 89 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 8533/8622 places, 16624/16624 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 8533 transition count 16594
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 8503 transition count 16594
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 63 place count 8500 transition count 16591
Iterating global reduction 2 with 3 rules applied. Total rules applied 66 place count 8500 transition count 16591
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 3 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 232 place count 8417 transition count 16508
Applied a total of 232 rules in 8296 ms. Remains 8417 /8533 variables (removed 116) and now considering 16508/16624 (removed 116) transitions.
// Phase 1: matrix 16508 rows 8417 cols
[2024-05-22 12:49:52] [INFO ] Computed 92 invariants in 441 ms
[2024-05-22 12:49:59] [INFO ] Implicit Places using invariants in 7711 ms returned []
Implicit Place search using SMT only with invariants took 7712 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 8417/8622 places, 16508/16624 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 27147 ms. Remains : 8417/8622 places, 16508/16624 transitions.
[2024-05-22 12:49:59] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-22 12:49:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 8417 places, 16508 transitions and 65695 arcs took 68 ms.
[2024-05-22 12:50:00] [INFO ] Flatten gal took : 704 ms
Total runtime 424176 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CANConstruction-PT-090

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 8417
TRANSITIONS: 16508
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.346s, Sys 0.024s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.057s, 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: 829
MODEL NAME: /home/mcc/execution/412/model
8417 places, 16508 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.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716382467962

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

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-090"
export BK_EXAMINATION="ReachabilityCardinality"
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-090, examination is ReachabilityCardinality"
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-171620503800078"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-090.tgz
mv CANConstruction-PT-090 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;