Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r047-tajo-171620397900287.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is BridgeAndVehicles-PT-V80P20N20, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620397900287
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 27K Apr 13 02:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 150K Apr 13 02:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 698K Apr 13 02:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.6M Apr 13 02:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 15K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 206K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 604K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 30K Apr 13 04:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 192K Apr 13 04:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.5M Apr 13 04:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 5.7M Apr 13 04:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.5K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.1M 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 BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-00
FORMULA_NAME BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-01
FORMULA_NAME BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-02
FORMULA_NAME BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-03
FORMULA_NAME BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-04
FORMULA_NAME BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-05
FORMULA_NAME BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-06
FORMULA_NAME BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-07
FORMULA_NAME BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-08
FORMULA_NAME BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-09
FORMULA_NAME BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-10
FORMULA_NAME BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-11
FORMULA_NAME BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-12
FORMULA_NAME BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-13
FORMULA_NAME BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-14
FORMULA_NAME BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716290557215

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V80P20N20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 11:22:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 11:22:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 11:22:38] [INFO ] Load time of PNML (sax parser for PT used): 245 ms
[2024-05-21 11:22:38] [INFO ] Transformed 198 places.
[2024-05-21 11:22:38] [INFO ] Transformed 3728 transitions.
[2024-05-21 11:22:38] [INFO ] Parsed PT model containing 198 places and 3728 transitions and 28830 arcs in 388 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 169 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40001 steps (56 resets) in 7168 ms. (5 steps per ms) remains 11/15 properties
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40001 steps (24 resets) in 9449 ms. (4 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (24 resets) in 9627 ms. (4 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (20 resets) in 11459 ms. (3 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (20 resets) in 11595 ms. (3 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (20 resets) in 1618 ms. (24 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (20 resets) in 1673 ms. (23 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (20 resets) in 1664 ms. (24 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (20 resets) in 1609 ms. (24 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (20 resets) in 1424 ms. (28 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (20 resets) in 1526 ms. (26 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (20 resets) in 1408 ms. (28 steps per ms) remains 11/11 properties
[2024-05-21 11:22:55] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 198 cols
[2024-05-21 11:22:55] [INFO ] Computed 7 invariants in 36 ms
[2024-05-21 11:22:55] [INFO ] State equation strengthened by 42 read => feed constraints.
Problem BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-00 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-05 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-06 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-07 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-09 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-10 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-11 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-13 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-14 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-15 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 5/5 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/5 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/198 variables, 2/7 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/7 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 410/608 variables, 198/205 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/608 variables, 42/247 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/608 variables, 0/247 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/608 variables, 0/247 constraints. Problems are: Problem set: 10 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 608/608 variables, and 247 constraints, problems are : Problem set: 10 solved, 1 unsolved in 1094 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 198/198 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 185/189 variables, 4/4 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/4 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 408/597 variables, 189/193 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/597 variables, 42/235 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/597 variables, 0/235 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/606 variables, 7/242 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/606 variables, 1/243 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/606 variables, 1/244 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/606 variables, 0/244 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/608 variables, 2/246 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/608 variables, 2/248 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/608 variables, 0/248 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/608 variables, 0/248 constraints. Problems are: Problem set: 10 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 608/608 variables, and 248 constraints, problems are : Problem set: 10 solved, 1 unsolved in 1826 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 198/198 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 21250ms problems are : Problem set: 10 solved, 1 unsolved
Parikh walk visited 0 properties in 175 ms.
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 3728/3728 transitions.
Graph (complete) has 1962 edges and 198 vertex of which 196 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.19 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 195 transition count 3727
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 195 transition count 3727
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 193 transition count 3726
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 31 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 191 transition count 3724
Applied a total of 10 rules in 1059 ms. Remains 191 /198 variables (removed 7) and now considering 3724/3728 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1072 ms. Remains : 191/198 places, 3724/3728 transitions.
RANDOM walk for 40000 steps (80 resets) in 940 ms. (42 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (40 resets) in 438 ms. (91 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 148975 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 1
Probabilistic random walk after 148975 steps, saw 51120 distinct states, run finished after 3005 ms. (steps per millisecond=49 ) properties seen :0
[2024-05-21 11:23:21] [INFO ] Flow matrix only has 406 transitions (discarded 3318 similar events)
// Phase 1: matrix 406 rows 191 cols
[2024-05-21 11:23:21] [INFO ] Computed 4 invariants in 15 ms
[2024-05-21 11:23:21] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 183/187 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 406/593 variables, 187/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/593 variables, 42/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/597 variables, 4/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/597 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/597 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 597/597 variables, and 237 constraints, problems are : Problem set: 0 solved, 1 unsolved in 253 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 191/191 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 183/187 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 406/593 variables, 187/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/593 variables, 42/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/597 variables, 4/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/597 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/597 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/597 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 597/597 variables, and 238 constraints, problems are : Problem set: 0 solved, 1 unsolved in 649 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 191/191 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 981ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 54 ms.
Support contains 4 out of 191 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 191/191 places, 3724/3724 transitions.
Applied a total of 0 rules in 521 ms. Remains 191 /191 variables (removed 0) and now considering 3724/3724 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 522 ms. Remains : 191/191 places, 3724/3724 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 191/191 places, 3724/3724 transitions.
Applied a total of 0 rules in 597 ms. Remains 191 /191 variables (removed 0) and now considering 3724/3724 (removed 0) transitions.
[2024-05-21 11:23:23] [INFO ] Flow matrix only has 406 transitions (discarded 3318 similar events)
[2024-05-21 11:23:23] [INFO ] Invariant cache hit.
[2024-05-21 11:23:24] [INFO ] Implicit Places using invariants in 520 ms returned []
[2024-05-21 11:23:24] [INFO ] Flow matrix only has 406 transitions (discarded 3318 similar events)
[2024-05-21 11:23:24] [INFO ] Invariant cache hit.
[2024-05-21 11:23:24] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 11:23:25] [INFO ] Implicit Places using invariants and state equation in 1616 ms returned [82, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2157 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 189/191 places, 3724/3724 transitions.
Applied a total of 0 rules in 476 ms. Remains 189 /189 variables (removed 0) and now considering 3724/3724 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3232 ms. Remains : 189/191 places, 3724/3724 transitions.
RANDOM walk for 40000 steps (80 resets) in 799 ms. (50 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (40 resets) in 333 ms. (119 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 153293 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 1
Probabilistic random walk after 153293 steps, saw 52684 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
[2024-05-21 11:23:29] [INFO ] Flow matrix only has 406 transitions (discarded 3318 similar events)
// Phase 1: matrix 406 rows 189 cols
[2024-05-21 11:23:29] [INFO ] Computed 4 invariants in 5 ms
[2024-05-21 11:23:29] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 183/187 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 406/593 variables, 187/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/593 variables, 42/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/595 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/595 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/595 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 595/595 variables, and 235 constraints, problems are : Problem set: 0 solved, 1 unsolved in 353 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 189/189 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 183/187 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 406/593 variables, 187/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/593 variables, 42/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/593 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/595 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/595 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/595 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 595/595 variables, and 236 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1688 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 189/189 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2087ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 4 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 3724/3724 transitions.
Applied a total of 0 rules in 600 ms. Remains 189 /189 variables (removed 0) and now considering 3724/3724 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 600 ms. Remains : 189/189 places, 3724/3724 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 3724/3724 transitions.
Applied a total of 0 rules in 473 ms. Remains 189 /189 variables (removed 0) and now considering 3724/3724 (removed 0) transitions.
[2024-05-21 11:23:32] [INFO ] Flow matrix only has 406 transitions (discarded 3318 similar events)
[2024-05-21 11:23:32] [INFO ] Invariant cache hit.
[2024-05-21 11:23:33] [INFO ] Implicit Places using invariants in 518 ms returned []
[2024-05-21 11:23:33] [INFO ] Flow matrix only has 406 transitions (discarded 3318 similar events)
[2024-05-21 11:23:33] [INFO ] Invariant cache hit.
[2024-05-21 11:23:33] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 11:23:35] [INFO ] Implicit Places using invariants and state equation in 1944 ms returned []
Implicit Place search using SMT with State Equation took 2466 ms to find 0 implicit places.
[2024-05-21 11:23:35] [INFO ] Redundant transitions in 249 ms returned []
Running 3721 sub problems to find dead transitions.
[2024-05-21 11:23:35] [INFO ] Flow matrix only has 406 transitions (discarded 3318 similar events)
[2024-05-21 11:23:35] [INFO ] Invariant cache hit.
[2024-05-21 11:23:35] [INFO ] State equation strengthened by 42 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BridgeAndVehicles-PT-V80P20N20

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.040s, 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: 603
MODEL NAME: /home/mcc/execution/model
198 places, 3728 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.
Building monolithic NSF...
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL

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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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

Error in allocating array of size 4194304 at unique_table.cc, line 313
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="BridgeAndVehicles-PT-V80P20N20"
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 BridgeAndVehicles-PT-V80P20N20, 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 r047-tajo-171620397900287"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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