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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 30M
-rw-r--r-- 1 mcc users 9.9K 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 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 17:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K 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.1K 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 30M 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-070-ReachabilityCardinality-2024-00
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-01
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-02
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-03
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-04
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-05
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-2023-06
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-07
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-08
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-09
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-10
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-2023-11
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-12
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-2023-13
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-14
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716403162252

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-070
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 18:39:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 18:39:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 18:39:24] [INFO ] Load time of PNML (sax parser for PT used): 738 ms
[2024-05-22 18:39:24] [INFO ] Transformed 10644 places.
[2024-05-22 18:39:24] [INFO ] Transformed 29820 transitions.
[2024-05-22 18:39:24] [INFO ] Parsed PT model containing 10644 places and 29820 transitions and 79800 arcs in 944 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (22 resets) in 3696 ms. (10 steps per ms) remains 11/16 properties
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 343 ms. (116 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 473 ms. (84 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 11/11 properties
// Phase 1: matrix 29820 rows 10644 cols
[2024-05-22 18:39:31] [INFO ] Computed 73 invariants in 4942 ms
[2024-05-22 18:39:31] [INFO ] State equation strengthened by 9730 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-14 is UNSAT
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 10382/10515 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10515 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 124/10639 variables, 62/70 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10639 variables, 0/70 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 2/10641 variables, 2/72 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10641/40464 variables, and 72 constraints, problems are : Problem set: 1 solved, 10 unsolved in 5038 ms.
Refiners :[Positive P Invariants (semi-flows): 70/71 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/10644 constraints, ReadFeed: 0/9730 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10383/10513 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-05-22 18:39:38] [INFO ] Deduced a trap composed of 5 places in 428 ms of which 26 ms to minimize.
[2024-05-22 18:39:38] [INFO ] Deduced a trap composed of 5 places in 346 ms of which 3 ms to minimize.
[2024-05-22 18:39:39] [INFO ] Deduced a trap composed of 5 places in 337 ms of which 3 ms to minimize.
[2024-05-22 18:39:39] [INFO ] Deduced a trap composed of 5 places in 320 ms of which 3 ms to minimize.
[2024-05-22 18:39:40] [INFO ] Deduced a trap composed of 5 places in 324 ms of which 3 ms to minimize.
[2024-05-22 18:39:40] [INFO ] Deduced a trap composed of 5 places in 312 ms of which 3 ms to minimize.
[2024-05-22 18:39:41] [INFO ] Deduced a trap composed of 5 places in 309 ms of which 3 ms to minimize.
[2024-05-22 18:39:41] [INFO ] Deduced a trap composed of 5 places in 314 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 1)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 1)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 10513/40464 variables, and 15 constraints, problems are : Problem set: 1 solved, 10 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/71 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10644 constraints, ReadFeed: 0/9730 constraints, PredecessorRefiner: 0/11 constraints, Known Traps: 8/8 constraints]
After SMT, in 15389ms problems are : Problem set: 1 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 130 out of 10644 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10644/10644 places, 29820/29820 transitions.
Graph (complete) has 40251 edges and 10644 vertex of which 10643 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.34 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 475 transitions
Trivial Post-agglo rules discarded 475 transitions
Performed 475 trivial Post agglomeration. Transition count delta: 475
Iterating post reduction 0 with 475 rules applied. Total rules applied 476 place count 10643 transition count 29345
Reduce places removed 475 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 478 rules applied. Total rules applied 954 place count 10168 transition count 29342
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 957 place count 10165 transition count 29342
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 957 place count 10165 transition count 29338
Deduced a syphon composed of 4 places in 16 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 965 place count 10161 transition count 29338
Performed 4435 Post agglomeration using F-continuation condition.Transition count delta: 4435
Deduced a syphon composed of 4435 places in 13 ms
Reduce places removed 4435 places and 0 transitions.
Iterating global reduction 3 with 8870 rules applied. Total rules applied 9835 place count 5726 transition count 24903
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 9839 place count 5726 transition count 24899
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 9843 place count 5722 transition count 24899
Partial Free-agglomeration rule applied 5444 times.
Drop transitions (Partial Free agglomeration) removed 5444 transitions
Iterating global reduction 4 with 5444 rules applied. Total rules applied 15287 place count 5722 transition count 24899
Partial Free-agglomeration rule applied 296 times.
Drop transitions (Partial Free agglomeration) removed 296 transitions
Iterating global reduction 4 with 296 rules applied. Total rules applied 15583 place count 5722 transition count 24899
Applied a total of 15583 rules in 9588 ms. Remains 5722 /10644 variables (removed 4922) and now considering 24899/29820 (removed 4921) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9606 ms. Remains : 5722/10644 places, 24899/29820 transitions.
RANDOM walk for 40000 steps (85 resets) in 1903 ms. (21 steps per ms) remains 7/10 properties
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 7/7 properties
[2024-05-22 18:39:52] [INFO ] Flow matrix only has 24843 transitions (discarded 56 similar events)
// Phase 1: matrix 24843 rows 5722 cols
[2024-05-22 18:39:53] [INFO ] Computed 72 invariants in 1392 ms
[2024-05-22 18:39:53] [INFO ] State equation strengthened by 23559 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 5465/5592 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5592 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 126/5718 variables, 63/70 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5718 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2/5720 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5720 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 24843/30563 variables, 5720/5792 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/30563 variables, 23559/29351 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/30563 variables, 0/29351 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 2/30565 variables, 2/29353 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/30565 variables, 0/29353 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/30565 variables, 0/29353 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30565/30565 variables, and 29353 constraints, problems are : Problem set: 0 solved, 7 unsolved in 43185 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 5722/5722 constraints, ReadFeed: 23559/23559 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/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 5465/5592 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 18:40:38] [INFO ] Deduced a trap composed of 2 places in 188 ms of which 1 ms to minimize.
[2024-05-22 18:40:38] [INFO ] Deduced a trap composed of 2 places in 173 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5592 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5592 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 126/5718 variables, 63/72 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5718 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 2/5720 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 18:40:50] [INFO ] Deduced a trap composed of 107 places in 8627 ms of which 36 ms to minimize.
[2024-05-22 18:40:59] [INFO ] Deduced a trap composed of 100 places in 8579 ms of which 31 ms to minimize.
[2024-05-22 18:41:07] [INFO ] Deduced a trap composed of 98 places in 8278 ms of which 35 ms to minimize.
[2024-05-22 18:41:15] [INFO ] Deduced a trap composed of 76 places in 7728 ms of which 31 ms to minimize.
[2024-05-22 18:41:23] [INFO ] Deduced a trap composed of 76 places in 8025 ms of which 33 ms to minimize.
SMT process timed out in 91108ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 127 out of 5722 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5722/5722 places, 24899/24899 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 5720 transition count 24897
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 5720 transition count 24897
Applied a total of 5 rules in 3103 ms. Remains 5720 /5722 variables (removed 2) and now considering 24897/24899 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3104 ms. Remains : 5720/5722 places, 24897/24899 transitions.
RANDOM walk for 40000 steps (85 resets) in 1600 ms. (24 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 109 ms. (363 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 107 ms. (370 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 121673 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 7
Probabilistic random walk after 121673 steps, saw 115658 distinct states, run finished after 3005 ms. (steps per millisecond=40 ) properties seen :0
[2024-05-22 18:41:30] [INFO ] Flow matrix only has 24842 transitions (discarded 55 similar events)
// Phase 1: matrix 24842 rows 5720 cols
[2024-05-22 18:41:31] [INFO ] Computed 72 invariants in 1269 ms
[2024-05-22 18:41:31] [INFO ] State equation strengthened by 23565 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 5463/5590 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5590 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 126/5716 variables, 63/70 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5716 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2/5718 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5718 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 24842/30560 variables, 5718/5790 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/30560 variables, 23565/29355 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/30560 variables, 0/29355 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 2/30562 variables, 2/29357 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/30562 variables, 0/29357 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/30562 variables, 0/29357 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30562/30562 variables, and 29357 constraints, problems are : Problem set: 0 solved, 7 unsolved in 43277 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 5720/5720 constraints, ReadFeed: 23565/23565 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/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 5463/5590 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 18:42:15] [INFO ] Deduced a trap composed of 2 places in 160 ms of which 1 ms to minimize.
[2024-05-22 18:42:16] [INFO ] Deduced a trap composed of 2 places in 156 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5590 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5590 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 126/5716 variables, 63/72 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5716 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 2/5718 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 18:42:28] [INFO ] Deduced a trap composed of 91 places in 8469 ms of which 31 ms to minimize.
[2024-05-22 18:42:36] [INFO ] Deduced a trap composed of 86 places in 8507 ms of which 33 ms to minimize.
[2024-05-22 18:42:45] [INFO ] Deduced a trap composed of 82 places in 8329 ms of which 34 ms to minimize.
[2024-05-22 18:42:53] [INFO ] Deduced a trap composed of 94 places in 8166 ms of which 33 ms to minimize.
[2024-05-22 18:43:01] [INFO ] Deduced a trap composed of 94 places in 8161 ms of which 33 ms to minimize.
[2024-05-22 18:43:09] [INFO ] Deduced a trap composed of 97 places in 7838 ms of which 32 ms to minimize.
[2024-05-22 18:43:17] [INFO ] Deduced a trap composed of 95 places in 7807 ms of which 30 ms to minimize.
[2024-05-22 18:43:25] [INFO ] Deduced a trap composed of 97 places in 7924 ms of which 32 ms to minimize.
[2024-05-22 18:43:33] [INFO ] Deduced a trap composed of 86 places in 8198 ms of which 32 ms to minimize.
SMT process timed out in 123325ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 127 out of 5720 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5720/5720 places, 24897/24897 transitions.
Applied a total of 0 rules in 1039 ms. Remains 5720 /5720 variables (removed 0) and now considering 24897/24897 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1040 ms. Remains : 5720/5720 places, 24897/24897 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5720/5720 places, 24897/24897 transitions.
Applied a total of 0 rules in 1063 ms. Remains 5720 /5720 variables (removed 0) and now considering 24897/24897 (removed 0) transitions.
[2024-05-22 18:43:35] [INFO ] Flow matrix only has 24842 transitions (discarded 55 similar events)
[2024-05-22 18:43:35] [INFO ] Invariant cache hit.
[2024-05-22 18:43:47] [INFO ] Implicit Places using invariants in 11837 ms returned []
Implicit Place search using SMT only with invariants took 11846 ms to find 0 implicit places.
Running 24827 sub problems to find dead transitions.
[2024-05-22 18:43:47] [INFO ] Flow matrix only has 24842 transitions (discarded 55 similar events)
[2024-05-22 18:43:47] [INFO ] Invariant cache hit.
[2024-05-22 18:43:48] [INFO ] State equation strengthened by 23565 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/5719 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24827 unsolved
SMT process timed out in 105439ms, After SMT, problems are : Problem set: 0 solved, 24827 unsolved
Search for dead transitions found 0 dead transitions in 105666ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118661 ms. Remains : 5720/5720 places, 24897/24897 transitions.
[2024-05-22 18:45:33] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2024-05-22 18:45:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5720 places, 24897 transitions and 98227 arcs took 90 ms.
[2024-05-22 18:45:34] [INFO ] Flatten gal took : 795 ms
Total runtime 371182 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CANInsertWithFailure-PT-070

IS_COLORED=
IS_NUPN=

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


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


----------------------------------------------------------------------
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: 665
MODEL NAME: /home/mcc/execution/411/model
5720 places, 24897 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716405424049

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

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