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-171620503900151.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 ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620503900151
=====================================================================

--------------------
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-ReachabilityFireability-2024-00
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityFireability-2024-01
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityFireability-2024-02
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityFireability-2024-03
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityFireability-2024-04
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityFireability-2024-05
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityFireability-2024-06
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityFireability-2024-07
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityFireability-2023-08
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityFireability-2024-09
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityFireability-2024-10
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityFireability-2024-11
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityFireability-2024-12
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityFireability-2024-13
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityFireability-2024-14
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716403252279

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
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:40:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 18:40:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 18:40:54] [INFO ] Load time of PNML (sax parser for PT used): 731 ms
[2024-05-22 18:40:54] [INFO ] Transformed 10644 places.
[2024-05-22 18:40:54] [INFO ] Transformed 29820 transitions.
[2024-05-22 18:40:54] [INFO ] Parsed PT model containing 10644 places and 29820 transitions and 79800 arcs in 933 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (20 resets) in 3457 ms. (11 steps per ms) remains 8/16 properties
FORMULA CANInsertWithFailure-PT-070-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-070-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-070-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-070-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-070-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-070-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-070-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-070-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 393 ms. (101 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 302 ms. (132 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1007 ms. (39 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 8/8 properties
// Phase 1: matrix 29820 rows 10644 cols
[2024-05-22 18:41:02] [INFO ] Computed 73 invariants in 5710 ms
[2024-05-22 18:41:02] [INFO ] State equation strengthened by 9730 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 10391/10567 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10567 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 72/10639 variables, 36/70 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10639 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2/10641 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10641/40464 variables, and 72 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5058 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: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 10391/10567 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-22 18:41:10] [INFO ] Deduced a trap composed of 5 places in 984 ms of which 77 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/10567 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 10567/40464 variables, and 35 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5215 ms.
Refiners :[Positive P Invariants (semi-flows): 34/71 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10644 constraints, ReadFeed: 0/9730 constraints, PredecessorRefiner: 0/8 constraints, Known Traps: 1/1 constraints]
After SMT, in 16470ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 176 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.40 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 440 transitions
Trivial Post-agglo rules discarded 440 transitions
Performed 440 trivial Post agglomeration. Transition count delta: 440
Iterating post reduction 0 with 440 rules applied. Total rules applied 441 place count 10643 transition count 29380
Reduce places removed 440 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 441 rules applied. Total rules applied 882 place count 10203 transition count 29379
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 883 place count 10202 transition count 29379
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 883 place count 10202 transition count 29363
Deduced a syphon composed of 16 places in 12 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 915 place count 10186 transition count 29363
Performed 4674 Post agglomeration using F-continuation condition.Transition count delta: 4674
Deduced a syphon composed of 4674 places in 33 ms
Reduce places removed 4674 places and 0 transitions.
Iterating global reduction 3 with 9348 rules applied. Total rules applied 10263 place count 5512 transition count 24689
Free-agglomeration rule (complex) applied 33 times.
Iterating global reduction 3 with 33 rules applied. Total rules applied 10296 place count 5512 transition count 24656
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 3 with 33 rules applied. Total rules applied 10329 place count 5479 transition count 24656
Partial Free-agglomeration rule applied 5134 times.
Drop transitions (Partial Free agglomeration) removed 5134 transitions
Iterating global reduction 4 with 5134 rules applied. Total rules applied 15463 place count 5479 transition count 24656
Partial Free-agglomeration rule applied 1122 times.
Drop transitions (Partial Free agglomeration) removed 1122 transitions
Iterating global reduction 4 with 1122 rules applied. Total rules applied 16585 place count 5479 transition count 24656
Applied a total of 16585 rules in 10466 ms. Remains 5479 /10644 variables (removed 5165) and now considering 24656/29820 (removed 5164) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10482 ms. Remains : 5479/10644 places, 24656/29820 transitions.
RANDOM walk for 40000 steps (87 resets) in 3094 ms. (12 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 54220 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :0 out of 8
Probabilistic random walk after 54220 steps, saw 43217 distinct states, run finished after 3005 ms. (steps per millisecond=18 ) properties seen :0
[2024-05-22 18:41:27] [INFO ] Flow matrix only has 24607 transitions (discarded 49 similar events)
// Phase 1: matrix 24607 rows 5479 cols
[2024-05-22 18:41:29] [INFO ] Computed 72 invariants in 1571 ms
[2024-05-22 18:41:29] [INFO ] State equation strengthened by 23904 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 5226/5402 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5402 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 74/5476 variables, 37/70 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5476 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5476 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 1/5477 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5477 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 24607/30084 variables, 5477/5549 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/30084 variables, 23904/29453 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 30084/30086 variables, and 29453 constraints, problems are : Problem set: 0 solved, 8 unsolved in 45086 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 5477/5479 constraints, ReadFeed: 23904/23904 constraints, PredecessorRefiner: 8/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 5226/5402 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-22 18:42:16] [INFO ] Deduced a trap composed of 2 places in 504 ms of which 7 ms to minimize.
[2024-05-22 18:42:16] [INFO ] Deduced a trap composed of 2 places in 481 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5402 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5402 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 74/5476 variables, 37/72 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5476 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5476 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1/5477 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5477 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 24607/30084 variables, 5477/5551 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/30084 variables, 23904/29455 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 30084/30086 variables, and 29462 constraints, problems are : Problem set: 0 solved, 8 unsolved in 45138 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 5477/5479 constraints, ReadFeed: 23904/23904 constraints, PredecessorRefiner: 8/7 constraints, Known Traps: 2/2 constraints]
After SMT, in 92316ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 176 out of 5479 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5479/5479 places, 24656/24656 transitions.
Applied a total of 0 rules in 1467 ms. Remains 5479 /5479 variables (removed 0) and now considering 24656/24656 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1468 ms. Remains : 5479/5479 places, 24656/24656 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5479/5479 places, 24656/24656 transitions.
Applied a total of 0 rules in 1322 ms. Remains 5479 /5479 variables (removed 0) and now considering 24656/24656 (removed 0) transitions.
[2024-05-22 18:43:02] [INFO ] Flow matrix only has 24607 transitions (discarded 49 similar events)
[2024-05-22 18:43:02] [INFO ] Invariant cache hit.
[2024-05-22 18:43:11] [INFO ] Implicit Places using invariants in 8787 ms returned []
Implicit Place search using SMT only with invariants took 8798 ms to find 0 implicit places.
Running 24586 sub problems to find dead transitions.
[2024-05-22 18:43:12] [INFO ] Flow matrix only has 24607 transitions (discarded 49 similar events)
[2024-05-22 18:43:12] [INFO ] Invariant cache hit.
[2024-05-22 18:43:12] [INFO ] State equation strengthened by 23904 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5478 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24586 unsolved
SMT process timed out in 101171ms, After SMT, problems are : Problem set: 0 solved, 24586 unsolved
Search for dead transitions found 0 dead transitions in 101396ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111584 ms. Remains : 5479/5479 places, 24656/24656 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 21355 edges and 5479 vertex of which 3795 / 5479 are part of one of the 1 SCC in 7 ms
Free SCC test removed 3794 places
Drop transitions (Empty/Sink Transition effects.) removed 13789 transitions
Ensure Unique test removed 4580 transitions
Reduce isomorphic transitions removed 18369 transitions.
Graph (complete) has 6794 edges and 1685 vertex of which 1573 are kept as prefixes of interest. Removing 112 places using SCC suffix rule.2 ms
Discarding 112 places :
Also discarding 37 output transitions
Drop transitions (Output transitions of discarded places.) removed 37 transitions
Drop transitions (Empty/Sink Transition effects.) removed 405 transitions
Reduce isomorphic transitions removed 405 transitions.
Iterating post reduction 0 with 405 rules applied. Total rules applied 407 place count 1573 transition count 5845
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 407 place count 1573 transition count 5840
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 417 place count 1568 transition count 5840
Discarding 864 places :
Symmetric choice reduction at 1 with 864 rule applications. Total rules 1281 place count 704 transition count 2854
Iterating global reduction 1 with 864 rules applied. Total rules applied 2145 place count 704 transition count 2854
Ensure Unique test removed 725 transitions
Reduce isomorphic transitions removed 725 transitions.
Iterating post reduction 1 with 725 rules applied. Total rules applied 2870 place count 704 transition count 2129
Discarding 100 places :
Symmetric choice reduction at 2 with 100 rule applications. Total rules 2970 place count 604 transition count 1929
Iterating global reduction 2 with 100 rules applied. Total rules applied 3070 place count 604 transition count 1929
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 2 with 100 rules applied. Total rules applied 3170 place count 604 transition count 1829
Drop transitions (Redundant composition of simpler transitions.) removed 253 transitions
Redundant transition composition rules discarded 253 transitions
Iterating global reduction 3 with 253 rules applied. Total rules applied 3423 place count 604 transition count 1576
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 3 with 15 rules applied. Total rules applied 3438 place count 604 transition count 1561
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 3453 place count 589 transition count 1561
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 3463 place count 579 transition count 1541
Iterating global reduction 5 with 10 rules applied. Total rules applied 3473 place count 579 transition count 1541
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 1 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 5 with 358 rules applied. Total rules applied 3831 place count 400 transition count 1362
Ensure Unique test removed 284 transitions
Reduce isomorphic transitions removed 284 transitions.
Iterating post reduction 5 with 284 rules applied. Total rules applied 4115 place count 400 transition count 1078
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 4135 place count 390 transition count 1078
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 4155 place count 390 transition count 1058
Drop transitions (Redundant composition of simpler transitions.) removed 52 transitions
Redundant transition composition rules discarded 52 transitions
Iterating global reduction 7 with 52 rules applied. Total rules applied 4207 place count 390 transition count 1006
Free-agglomeration rule applied 46 times with reduction of 1 identical transitions.
Iterating global reduction 7 with 46 rules applied. Total rules applied 4253 place count 390 transition count 959
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 7 with 90 rules applied. Total rules applied 4343 place count 344 transition count 915
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 4345 place count 344 transition count 913
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 4346 place count 344 transition count 912
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 4347 place count 343 transition count 912
Partial Free-agglomeration rule applied 39 times.
Drop transitions (Partial Free agglomeration) removed 39 transitions
Iterating global reduction 9 with 39 rules applied. Total rules applied 4386 place count 343 transition count 912
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 4391 place count 343 transition count 907
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 4392 place count 343 transition count 907
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4393 place count 342 transition count 906
Iterating global reduction 9 with 1 rules applied. Total rules applied 4394 place count 342 transition count 906
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 4396 place count 342 transition count 904
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 4397 place count 341 transition count 903
Applied a total of 4397 rules in 6289 ms. Remains 341 /5479 variables (removed 5138) and now considering 903/24656 (removed 23753) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 903 rows 341 cols
[2024-05-22 18:44:59] [INFO ] Computed 33 invariants in 5 ms
[2024-05-22 18:44:59] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2024-05-22 18:44:59] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-22 18:44:59] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 18:45:00] [INFO ] After 529ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
TRAPS : Iteration 0
[2024-05-22 18:45:00] [INFO ] After 1029ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
[2024-05-22 18:45:01] [INFO ] After 1554ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Over-approximation ignoring read arcs solved 0 properties in 8074 ms.
[2024-05-22 18:45:01] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2024-05-22 18:45:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5479 places, 24656 transitions and 97983 arcs took 90 ms.
[2024-05-22 18:45:02] [INFO ] Flatten gal took : 813 ms
Total runtime 249036 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: 5479
TRANSITIONS: 24656
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.511s, Sys 0.036s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.088s, 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: 599
MODEL NAME: /home/mcc/execution/411/model
5479 places, 24656 transitions.

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

BK_STOP 1716405361628

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is CANInsertWithFailure-PT-070, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r069-tall-171620503900151"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;