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.r399-tall-171690531300871.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 Szymanski-PT-b04, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690531300871
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 15:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 11 15:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.7M May 18 16:43 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 Szymanski-PT-b04-ReachabilityFireability-2024-00
FORMULA_NAME Szymanski-PT-b04-ReachabilityFireability-2024-01
FORMULA_NAME Szymanski-PT-b04-ReachabilityFireability-2024-02
FORMULA_NAME Szymanski-PT-b04-ReachabilityFireability-2024-03
FORMULA_NAME Szymanski-PT-b04-ReachabilityFireability-2024-04
FORMULA_NAME Szymanski-PT-b04-ReachabilityFireability-2023-05
FORMULA_NAME Szymanski-PT-b04-ReachabilityFireability-2024-06
FORMULA_NAME Szymanski-PT-b04-ReachabilityFireability-2024-07
FORMULA_NAME Szymanski-PT-b04-ReachabilityFireability-2024-08
FORMULA_NAME Szymanski-PT-b04-ReachabilityFireability-2023-09
FORMULA_NAME Szymanski-PT-b04-ReachabilityFireability-2024-10
FORMULA_NAME Szymanski-PT-b04-ReachabilityFireability-2024-11
FORMULA_NAME Szymanski-PT-b04-ReachabilityFireability-2024-12
FORMULA_NAME Szymanski-PT-b04-ReachabilityFireability-2023-13
FORMULA_NAME Szymanski-PT-b04-ReachabilityFireability-2024-14
FORMULA_NAME Szymanski-PT-b04-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717098519178

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-b04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 19:48:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-30 19:48:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 19:48:40] [INFO ] Load time of PNML (sax parser for PT used): 314 ms
[2024-05-30 19:48:40] [INFO ] Transformed 568 places.
[2024-05-30 19:48:40] [INFO ] Transformed 8320 transitions.
[2024-05-30 19:48:40] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 458 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 260 places in 18 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b04-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40001 steps (9 resets) in 1959 ms. (20 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (9 resets) in 36 ms. (108 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 14/15 properties
FORMULA Szymanski-PT-b04-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 90 ms. (43 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 13/14 properties
FORMULA Szymanski-PT-b04-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 13/13 properties
[2024-05-30 19:48:41] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 308 cols
[2024-05-30 19:48:41] [INFO ] Computed 3 invariants in 44 ms
[2024-05-30 19:48:42] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem Szymanski-PT-b04-ReachabilityFireability-2024-00 is UNSAT
FORMULA Szymanski-PT-b04-ReachabilityFireability-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b04-ReachabilityFireability-2024-01 is UNSAT
FORMULA Szymanski-PT-b04-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b04-ReachabilityFireability-2024-04 is UNSAT
FORMULA Szymanski-PT-b04-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b04-ReachabilityFireability-2023-05 is UNSAT
FORMULA Szymanski-PT-b04-ReachabilityFireability-2023-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b04-ReachabilityFireability-2024-07 is UNSAT
FORMULA Szymanski-PT-b04-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b04-ReachabilityFireability-2024-08 is UNSAT
FORMULA Szymanski-PT-b04-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b04-ReachabilityFireability-2023-09 is UNSAT
FORMULA Szymanski-PT-b04-ReachabilityFireability-2023-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b04-ReachabilityFireability-2024-11 is UNSAT
FORMULA Szymanski-PT-b04-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b04-ReachabilityFireability-2023-13 is UNSAT
FORMULA Szymanski-PT-b04-ReachabilityFireability-2023-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b04-ReachabilityFireability-2024-15 is UNSAT
FORMULA Szymanski-PT-b04-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 147/307 variables, 2/2 constraints. Problems are: Problem set: 10 solved, 3 unsolved
[2024-05-30 19:48:43] [INFO ] Deduced a trap composed of 75 places in 563 ms of which 30 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 1/3 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 0/3 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/308 variables, 1/4 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 0/4 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2733/3041 variables, 308/312 constraints. Problems are: Problem set: 10 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3041/3041 variables, and 459 constraints, problems are : Problem set: 10 solved, 3 unsolved in 4284 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 308/308 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 13/5 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 10 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 282/307 variables, 2/2 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 1/3 constraints. Problems are: Problem set: 10 solved, 3 unsolved
[2024-05-30 19:48:47] [INFO ] Deduced a trap composed of 118 places in 488 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 1/4 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 0/4 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/308 variables, 1/5 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 0/5 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2733/3041 variables, 308/313 constraints. Problems are: Problem set: 10 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3041/3041 variables, and 460 constraints, problems are : Problem set: 10 solved, 3 unsolved in 4801 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 308/308 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 1/5 constraints, Known Traps: 2/2 constraints]
After SMT, in 9743ms problems are : Problem set: 10 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 25 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Graph (complete) has 9195 edges and 308 vertex of which 306 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.19 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Iterating post reduction 0 with 116 rules applied. Total rules applied 117 place count 306 transition count 7948
Applied a total of 117 rules in 467 ms. Remains 306 /308 variables (removed 2) and now considering 7948/8064 (removed 116) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 508 ms. Remains : 306/308 places, 7948/8064 transitions.
RANDOM walk for 40004 steps (9 resets) in 314 ms. (126 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (9 resets) in 238 ms. (167 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 174 ms. (228 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (9 resets) in 752 ms. (53 steps per ms) remains 2/3 properties
FORMULA Szymanski-PT-b04-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-30 19:48:52] [INFO ] Flow matrix only has 2617 transitions (discarded 5331 similar events)
// Phase 1: matrix 2617 rows 306 cols
[2024-05-30 19:48:52] [INFO ] Computed 1 invariants in 30 ms
[2024-05-30 19:48:52] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 303/306 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2617/2923 variables, 306/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2923 variables, 147/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2923 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/2923 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2923/2923 variables, and 454 constraints, problems are : Problem set: 0 solved, 2 unsolved in 754 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 306/306 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 303/306 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2617/2923 variables, 306/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2923 variables, 147/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2923 variables, 2/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 19:48:56] [INFO ] Deduced a trap composed of 31 places in 329 ms of which 2 ms to minimize.
[2024-05-30 19:48:57] [INFO ] Deduced a trap composed of 45 places in 302 ms of which 1 ms to minimize.
[2024-05-30 19:48:57] [INFO ] Deduced a trap composed of 36 places in 287 ms of which 2 ms to minimize.
[2024-05-30 19:48:57] [INFO ] Deduced a trap composed of 58 places in 293 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2923 variables, 4/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2923 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/2923 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2923/2923 variables, and 460 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4765 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 306/306 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 5607ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 7948/7948 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 306 transition count 7936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 305 transition count 7808
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 305 transition count 7808
Applied a total of 14 rules in 278 ms. Remains 305 /306 variables (removed 1) and now considering 7808/7948 (removed 140) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 281 ms. Remains : 305/306 places, 7808/7948 transitions.
RANDOM walk for 40008 steps (8 resets) in 756 ms. (52 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 124 ms. (320 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 157537 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :0 out of 2
Probabilistic random walk after 157537 steps, saw 57318 distinct states, run finished after 3012 ms. (steps per millisecond=52 ) properties seen :0
[2024-05-30 19:49:02] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-05-30 19:49:02] [INFO ] Computed 3 invariants in 15 ms
[2024-05-30 19:49:02] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 283/286 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/305 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2604/2909 variables, 305/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/2909 variables, 147/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2909 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/2909 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 455 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1376 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 283/286 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 19:49:03] [INFO ] Deduced a trap composed of 92 places in 424 ms of which 2 ms to minimize.
[2024-05-30 19:49:04] [INFO ] Deduced a trap composed of 47 places in 359 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 19/305 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2604/2909 variables, 305/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2909 variables, 147/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2909 variables, 2/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 19:49:07] [INFO ] Deduced a trap composed of 58 places in 360 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2909 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 460 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6205 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 7629ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 257 ms.
Support contains 3 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 287 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 287 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 187 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2024-05-30 19:49:10] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 19:49:10] [INFO ] Invariant cache hit.
[2024-05-30 19:49:10] [INFO ] Implicit Places using invariants in 579 ms returned []
[2024-05-30 19:49:10] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 19:49:10] [INFO ] Invariant cache hit.
[2024-05-30 19:49:11] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 19:49:35] [INFO ] Implicit Places using invariants and state equation in 24753 ms returned []
Implicit Place search using SMT with State Equation took 25342 ms to find 0 implicit places.
[2024-05-30 19:49:36] [INFO ] Redundant transitions in 904 ms returned []
Running 7806 sub problems to find dead transitions.
[2024-05-30 19:49:36] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 19:49:36] [INFO ] Invariant cache hit.
[2024-05-30 19:49:36] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/2909 variables, and 3 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30239 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7806/7806 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7806 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
[2024-05-30 19:50:38] [INFO ] Deduced a trap composed of 138 places in 495 ms of which 2 ms to minimize.
[2024-05-30 19:50:40] [INFO ] Deduced a trap composed of 31 places in 490 ms of which 2 ms to minimize.
[2024-05-30 19:50:40] [INFO ] Deduced a trap composed of 106 places in 435 ms of which 2 ms to minimize.
[2024-05-30 19:50:41] [INFO ] Deduced a trap composed of 104 places in 463 ms of which 2 ms to minimize.
[2024-05-30 19:50:41] [INFO ] Deduced a trap composed of 37 places in 386 ms of which 2 ms to minimize.
[2024-05-30 19:50:41] [INFO ] Deduced a trap composed of 59 places in 376 ms of which 2 ms to minimize.
[2024-05-30 19:50:42] [INFO ] Deduced a trap composed of 42 places in 364 ms of which 2 ms to minimize.
[2024-05-30 19:50:42] [INFO ] Deduced a trap composed of 50 places in 328 ms of which 1 ms to minimize.
[2024-05-30 19:50:42] [INFO ] Deduced a trap composed of 42 places in 348 ms of which 2 ms to minimize.
[2024-05-30 19:50:43] [INFO ] Deduced a trap composed of 47 places in 354 ms of which 2 ms to minimize.
[2024-05-30 19:50:43] [INFO ] Deduced a trap composed of 62 places in 519 ms of which 2 ms to minimize.
[2024-05-30 19:50:44] [INFO ] Deduced a trap composed of 78 places in 464 ms of which 2 ms to minimize.
[2024-05-30 19:50:44] [INFO ] Deduced a trap composed of 48 places in 390 ms of which 2 ms to minimize.
[2024-05-30 19:50:45] [INFO ] Deduced a trap composed of 75 places in 366 ms of which 2 ms to minimize.
[2024-05-30 19:50:45] [INFO ] Deduced a trap composed of 42 places in 319 ms of which 2 ms to minimize.
[2024-05-30 19:50:45] [INFO ] Deduced a trap composed of 47 places in 272 ms of which 2 ms to minimize.
[2024-05-30 19:50:46] [INFO ] Deduced a trap composed of 50 places in 419 ms of which 2 ms to minimize.
[2024-05-30 19:50:46] [INFO ] Deduced a trap composed of 97 places in 459 ms of which 2 ms to minimize.
[2024-05-30 19:50:47] [INFO ] Deduced a trap composed of 64 places in 359 ms of which 2 ms to minimize.
[2024-05-30 19:50:47] [INFO ] Deduced a trap composed of 72 places in 389 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
[2024-05-30 19:50:52] [INFO ] Deduced a trap composed of 44 places in 410 ms of which 2 ms to minimize.
[2024-05-30 19:50:52] [INFO ] Deduced a trap composed of 57 places in 437 ms of which 2 ms to minimize.
[2024-05-30 19:50:53] [INFO ] Deduced a trap composed of 57 places in 429 ms of which 2 ms to minimize.
[2024-05-30 19:50:53] [INFO ] Deduced a trap composed of 72 places in 427 ms of which 2 ms to minimize.
[2024-05-30 19:50:54] [INFO ] Deduced a trap composed of 115 places in 444 ms of which 2 ms to minimize.
[2024-05-30 19:50:54] [INFO ] Deduced a trap composed of 114 places in 405 ms of which 6 ms to minimize.
[2024-05-30 19:50:54] [INFO ] Deduced a trap composed of 101 places in 363 ms of which 2 ms to minimize.
[2024-05-30 19:50:55] [INFO ] Deduced a trap composed of 114 places in 392 ms of which 2 ms to minimize.
[2024-05-30 19:50:55] [INFO ] Deduced a trap composed of 113 places in 392 ms of which 2 ms to minimize.
[2024-05-30 19:50:56] [INFO ] Deduced a trap composed of 125 places in 465 ms of which 2 ms to minimize.
[2024-05-30 19:50:57] [INFO ] Deduced a trap composed of 58 places in 398 ms of which 3 ms to minimize.
[2024-05-30 19:51:03] [INFO ] Deduced a trap composed of 86 places in 413 ms of which 2 ms to minimize.
[2024-05-30 19:51:03] [INFO ] Deduced a trap composed of 78 places in 314 ms of which 2 ms to minimize.
[2024-05-30 19:51:04] [INFO ] Deduced a trap composed of 120 places in 426 ms of which 2 ms to minimize.
[2024-05-30 19:51:04] [INFO ] Deduced a trap composed of 134 places in 263 ms of which 1 ms to minimize.
SMT process timed out in 87806ms, After SMT, problems are : Problem set: 0 solved, 7806 unsolved
Search for dead transitions found 0 dead transitions in 87875ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114348 ms. Remains : 305/305 places, 7808/7808 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 4816 edges and 305 vertex of which 36 / 305 are part of one of the 2 SCC in 4 ms
Free SCC test removed 34 places
Drop transitions (Empty/Sink Transition effects.) removed 3816 transitions
Ensure Unique test removed 1626 transitions
Reduce isomorphic transitions removed 5442 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 0 with 416 rules applied. Total rules applied 417 place count 271 transition count 1950
Applied a total of 417 rules in 223 ms. Remains 271 /305 variables (removed 34) and now considering 1950/7808 (removed 5858) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1950 rows 271 cols
[2024-05-30 19:51:04] [INFO ] Computed 3 invariants in 18 ms
[2024-05-30 19:51:04] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-30 19:51:05] [INFO ] After 407ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-30 19:51:05] [INFO ] State equation strengthened by 504 read => feed constraints.
[2024-05-30 19:51:05] [INFO ] After 167ms SMT Verify possible using 504 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-30 19:51:05] [INFO ] After 662ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-30 19:51:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-30 19:51:05] [INFO ] After 409ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-30 19:51:07] [INFO ] After 1263ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-30 19:51:07] [INFO ] After 1588ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-30 19:51:08] [INFO ] After 2573ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 3501 ms.
[2024-05-30 19:51:08] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 2 ms.
[2024-05-30 19:51:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 305 places, 7808 transitions and 31360 arcs took 31 ms.
[2024-05-30 19:51:08] [INFO ] Flatten gal took : 480 ms
Total runtime 148499 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Szymanski-PT-b04

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: 305
TRANSITIONS: 7808
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.141s, Sys 0.020s]


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

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1717099171073

--------------------
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
Error in allocating array of size 16777216 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 16777216 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 16777216 at unique_table.cc, line 313
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="Szymanski-PT-b04"
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 Szymanski-PT-b04, 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 r399-tall-171690531300871"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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