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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.0M
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 19 15:24 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 5.6M 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 CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-00
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-01
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-02
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-03
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-04
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-2023-05
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-06
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-2023-07
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-2023-08
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-09
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-10
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-11
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-12
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-13
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-14
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716393308184

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-030
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 15:55:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 15:55:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 15:55:09] [INFO ] Load time of PNML (sax parser for PT used): 271 ms
[2024-05-22 15:55:09] [INFO ] Transformed 2164 places.
[2024-05-22 15:55:09] [INFO ] Transformed 5580 transitions.
[2024-05-22 15:55:09] [INFO ] Parsed PT model containing 2164 places and 5580 transitions and 15000 arcs in 396 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (52 resets) in 2500 ms. (15 steps per ms) remains 6/15 properties
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 456 ms. (87 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 583 ms. (68 steps per ms) remains 6/6 properties
// Phase 1: matrix 5580 rows 2164 cols
[2024-05-22 15:55:11] [INFO ] Computed 33 invariants in 240 ms
[2024-05-22 15:55:11] [INFO ] State equation strengthened by 1770 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-11 is UNSAT
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 2055/2111 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2111 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 48/2159 variables, 24/30 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2159 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 2/2161 variables, 2/32 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2161 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 5580/7741 variables, 2161/2193 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/7741 variables, 1770/3963 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/7741 variables, 0/3963 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 3/7744 variables, 3/3966 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/7744 variables, 1/3967 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/7744 variables, 0/3967 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/7744 variables, 0/3967 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7744/7744 variables, and 3967 constraints, problems are : Problem set: 1 solved, 5 unsolved in 4367 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 2164/2164 constraints, ReadFeed: 1770/1770 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 2055/2109 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-22 15:55:16] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2109 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2109 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 50/2159 variables, 25/31 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2159 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2/2161 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-22 15:55:18] [INFO ] Deduced a trap composed of 53 places in 1248 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2161 variables, 1/34 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2161 variables, 0/34 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 5580/7741 variables, 2161/2195 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 7741/7744 variables, and 3965 constraints, problems are : Problem set: 1 solved, 5 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 30/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 2161/2164 constraints, ReadFeed: 1770/1770 constraints, PredecessorRefiner: 0/6 constraints, Known Traps: 2/2 constraints]
After SMT, in 9816ms problems are : Problem set: 1 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 54 out of 2164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2164/2164 places, 5580/5580 transitions.
Graph (complete) has 7651 edges and 2164 vertex of which 2163 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 201 place count 2163 transition count 5380
Reduce places removed 200 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 204 rules applied. Total rules applied 405 place count 1963 transition count 5376
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 409 place count 1959 transition count 5376
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 409 place count 1959 transition count 5375
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 411 place count 1958 transition count 5375
Performed 710 Post agglomeration using F-continuation condition.Transition count delta: 710
Deduced a syphon composed of 710 places in 6 ms
Reduce places removed 710 places and 0 transitions.
Iterating global reduction 3 with 1420 rules applied. Total rules applied 1831 place count 1248 transition count 4665
Drop transitions (Redundant composition of simpler transitions.) removed 658 transitions
Redundant transition composition rules discarded 658 transitions
Iterating global reduction 3 with 658 rules applied. Total rules applied 2489 place count 1248 transition count 4007
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 2492 place count 1248 transition count 4004
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 2495 place count 1245 transition count 4004
Partial Free-agglomeration rule applied 1151 times.
Drop transitions (Partial Free agglomeration) removed 1151 transitions
Iterating global reduction 4 with 1151 rules applied. Total rules applied 3646 place count 1245 transition count 4004
Partial Free-agglomeration rule applied 35 times.
Drop transitions (Partial Free agglomeration) removed 35 transitions
Iterating global reduction 4 with 35 rules applied. Total rules applied 3681 place count 1245 transition count 4004
Applied a total of 3681 rules in 1310 ms. Remains 1245 /2164 variables (removed 919) and now considering 4004/5580 (removed 1576) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1323 ms. Remains : 1245/2164 places, 4004/5580 transitions.
RANDOM walk for 40000 steps (221 resets) in 873 ms. (45 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 137151 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :0 out of 5
Probabilistic random walk after 137151 steps, saw 33971 distinct states, run finished after 3004 ms. (steps per millisecond=45 ) properties seen :0
// Phase 1: matrix 4004 rows 1245 cols
[2024-05-22 15:55:25] [INFO ] Computed 32 invariants in 108 ms
[2024-05-22 15:55:25] [INFO ] State equation strengthened by 3534 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1137/1191 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1191 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 50/1241 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1241 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 2/1243 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1243 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 4004/5247 variables, 1243/1275 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5247 variables, 3534/4809 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5247 variables, 0/4809 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 2/5249 variables, 2/4811 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5249 variables, 0/4811 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/5249 variables, 0/4811 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5249/5249 variables, and 4811 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3169 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1245/1245 constraints, ReadFeed: 3534/3534 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1137/1191 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 15:55:29] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 0 ms to minimize.
[2024-05-22 15:55:29] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1191 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1191 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 50/1241 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1241 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2/1243 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 15:55:30] [INFO ] Deduced a trap composed of 52 places in 630 ms of which 7 ms to minimize.
[2024-05-22 15:55:31] [INFO ] Deduced a trap composed of 40 places in 609 ms of which 7 ms to minimize.
[2024-05-22 15:55:31] [INFO ] Deduced a trap composed of 39 places in 635 ms of which 6 ms to minimize.
[2024-05-22 15:55:32] [INFO ] Deduced a trap composed of 37 places in 582 ms of which 7 ms to minimize.
[2024-05-22 15:55:32] [INFO ] Deduced a trap composed of 38 places in 534 ms of which 6 ms to minimize.
[2024-05-22 15:55:33] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 1 ms to minimize.
[2024-05-22 15:55:33] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 1 ms to minimize.
[2024-05-22 15:55:33] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1243 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 15:55:33] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1243 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1243 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 4004/5247 variables, 1243/1286 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5247 variables, 3534/4820 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5247 variables, 5/4825 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5247 variables, 0/4825 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 2/5249 variables, 2/4827 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5249 variables, 0/4827 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/5249 variables, 0/4827 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5249/5249 variables, and 4827 constraints, problems are : Problem set: 0 solved, 5 unsolved in 37636 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1245/1245 constraints, ReadFeed: 3534/3534 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 11/11 constraints]
After SMT, in 41029ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-13 TRUE TECHNIQUES PARIKH_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-2024-06 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 1291 ms.
Support contains 3 out of 1245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1245/1245 places, 4004/4004 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1245 transition count 4002
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1243 transition count 4002
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 46 place count 1222 transition count 3981
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 1222 transition count 3979
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 51 place count 1222 transition count 3976
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 54 place count 1219 transition count 3976
Partial Free-agglomeration rule applied 109 times.
Drop transitions (Partial Free agglomeration) removed 109 transitions
Iterating global reduction 3 with 109 rules applied. Total rules applied 163 place count 1219 transition count 3976
Applied a total of 163 rules in 382 ms. Remains 1219 /1245 variables (removed 26) and now considering 3976/4004 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 382 ms. Remains : 1219/1245 places, 3976/4004 transitions.
RANDOM walk for 40000 steps (241 resets) in 610 ms. (65 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 189814 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 3
Probabilistic random walk after 189814 steps, saw 36236 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
// Phase 1: matrix 3976 rows 1219 cols
[2024-05-22 15:56:11] [INFO ] Computed 32 invariants in 75 ms
[2024-05-22 15:56:11] [INFO ] State equation strengthened by 3746 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1154/1157 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 15:56:12] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-22 15:56:12] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 3 ms to minimize.
[2024-05-22 15:56:12] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 0 ms to minimize.
[2024-05-22 15:56:12] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-22 15:56:12] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 0 ms to minimize.
[2024-05-22 15:56:12] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-22 15:56:12] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-22 15:56:12] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 0 ms to minimize.
[2024-05-22 15:56:12] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-22 15:56:12] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-22 15:56:12] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-22 15:56:12] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-22 15:56:12] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-22 15:56:12] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 0 ms to minimize.
[2024-05-22 15:56:12] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2024-05-22 15:56:12] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 0 ms to minimize.
[2024-05-22 15:56:12] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 0 ms to minimize.
[2024-05-22 15:56:13] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-22 15:56:13] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-22 15:56:13] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1157 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 15:56:13] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 2 ms to minimize.
[2024-05-22 15:56:13] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 0 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1157 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1157 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 58/1215 variables, 29/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1215 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/1217 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1217 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 3976/5193 variables, 1217/1271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5193 variables, 3746/5017 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5193 variables, 0/5017 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/5195 variables, 2/5019 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5195 variables, 0/5019 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/5195 variables, 0/5019 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5195/5195 variables, and 5019 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3430 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1219/1219 constraints, ReadFeed: 3746/3746 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1154/1157 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1157 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 15:56:15] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 0 ms to minimize.
[2024-05-22 15:56:15] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2024-05-22 15:56:15] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2024-05-22 15:56:15] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 0 ms to minimize.
[2024-05-22 15:56:15] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 2 ms to minimize.
[2024-05-22 15:56:15] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 0 ms to minimize.
[2024-05-22 15:56:15] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1157 variables, 7/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1157 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 58/1215 variables, 29/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1215 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/1217 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 15:56:16] [INFO ] Deduced a trap composed of 60 places in 790 ms of which 7 ms to minimize.
[2024-05-22 15:56:17] [INFO ] Deduced a trap composed of 40 places in 740 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1217 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1217 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 3976/5193 variables, 1217/1280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5193 variables, 3746/5026 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5193 variables, 3/5029 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5193 variables, 0/5029 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/5195 variables, 2/5031 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5195 variables, 0/5031 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/5195 variables, 0/5031 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5195/5195 variables, and 5031 constraints, problems are : Problem set: 0 solved, 3 unsolved in 11046 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1219/1219 constraints, ReadFeed: 3746/3746 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 31/31 constraints]
After SMT, in 14619ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 364 ms.
Support contains 3 out of 1219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1219/1219 places, 3976/3976 transitions.
Applied a total of 0 rules in 89 ms. Remains 1219 /1219 variables (removed 0) and now considering 3976/3976 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 1219/1219 places, 3976/3976 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1219/1219 places, 3976/3976 transitions.
Applied a total of 0 rules in 83 ms. Remains 1219 /1219 variables (removed 0) and now considering 3976/3976 (removed 0) transitions.
[2024-05-22 15:56:26] [INFO ] Invariant cache hit.
[2024-05-22 15:56:28] [INFO ] Implicit Places using invariants in 1137 ms returned []
[2024-05-22 15:56:28] [INFO ] Invariant cache hit.
[2024-05-22 15:56:28] [INFO ] State equation strengthened by 3746 read => feed constraints.
[2024-05-22 15:56:50] [INFO ] Implicit Places using invariants and state equation in 22357 ms returned []
Implicit Place search using SMT with State Equation took 23509 ms to find 0 implicit places.
[2024-05-22 15:56:50] [INFO ] Redundant transitions in 267 ms returned []
Running 3946 sub problems to find dead transitions.
[2024-05-22 15:56:50] [INFO ] Invariant cache hit.
[2024-05-22 15:56:50] [INFO ] State equation strengthened by 3746 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1218 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3946 unsolved
SMT process timed out in 33592ms, After SMT, problems are : Problem set: 0 solved, 3946 unsolved
Search for dead transitions found 0 dead transitions in 33633ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57535 ms. Remains : 1219/1219 places, 3976/3976 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3650 edges and 1219 vertex of which 1095 / 1219 are part of one of the 2 SCC in 4 ms
Free SCC test removed 1093 places
Drop transitions (Empty/Sink Transition effects.) removed 2920 transitions
Ensure Unique test removed 897 transitions
Reduce isomorphic transitions removed 3817 transitions.
Graph (complete) has 338 edges and 126 vertex of which 38 are kept as prefixes of interest. Removing 88 places using SCC suffix rule.0 ms
Discarding 88 places :
Also discarding 26 output transitions
Drop transitions (Output transitions of discarded places.) removed 26 transitions
Drop transitions (Empty/Sink Transition effects.) removed 86 transitions
Reduce isomorphic transitions removed 86 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 87 rules applied. Total rules applied 89 place count 38 transition count 46
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 92 place count 37 transition count 44
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 94 place count 36 transition count 43
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 122 place count 8 transition count 15
Iterating global reduction 3 with 28 rules applied. Total rules applied 150 place count 8 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 152 place count 8 transition count 13
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 153 place count 8 transition count 12
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 155 place count 7 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 156 place count 6 transition count 10
Applied a total of 156 rules in 49 ms. Remains 6 /1219 variables (removed 1213) and now considering 10/3976 (removed 3966) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 10 rows 6 cols
[2024-05-22 15:57:24] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 15:57:24] [INFO ] After 240ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 15:57:24] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-22 15:57:24] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-22 15:57:24] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 340 ms.
[2024-05-22 15:57:24] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2024-05-22 15:57:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1219 places, 3976 transitions and 15984 arcs took 22 ms.
[2024-05-22 15:57:25] [INFO ] Flatten gal took : 330 ms
Total runtime 135986 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CANInsertWithFailure-PT-030

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: 1219
TRANSITIONS: 3976
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.079s, Sys 0.010s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.013s, 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: 719
MODEL NAME: /home/mcc/execution/412/model
1219 places, 3976 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:
++ 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

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="CANInsertWithFailure-PT-030"
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 CANInsertWithFailure-PT-030, 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-171620503800118"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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