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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 15:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 11 15:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Apr 11 15:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K Apr 11 15:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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-b10-ReachabilityFireability-2024-00
FORMULA_NAME Szymanski-PT-b10-ReachabilityFireability-2024-01
FORMULA_NAME Szymanski-PT-b10-ReachabilityFireability-2024-02
FORMULA_NAME Szymanski-PT-b10-ReachabilityFireability-2024-03
FORMULA_NAME Szymanski-PT-b10-ReachabilityFireability-2024-04
FORMULA_NAME Szymanski-PT-b10-ReachabilityFireability-2024-05
FORMULA_NAME Szymanski-PT-b10-ReachabilityFireability-2024-06
FORMULA_NAME Szymanski-PT-b10-ReachabilityFireability-2024-07
FORMULA_NAME Szymanski-PT-b10-ReachabilityFireability-2024-08
FORMULA_NAME Szymanski-PT-b10-ReachabilityFireability-2024-09
FORMULA_NAME Szymanski-PT-b10-ReachabilityFireability-2024-10
FORMULA_NAME Szymanski-PT-b10-ReachabilityFireability-2024-11
FORMULA_NAME Szymanski-PT-b10-ReachabilityFireability-2024-12
FORMULA_NAME Szymanski-PT-b10-ReachabilityFireability-2024-13
FORMULA_NAME Szymanski-PT-b10-ReachabilityFireability-2024-14
FORMULA_NAME Szymanski-PT-b10-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717107461180

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-b10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 22:17:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-30 22:17:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 22:17:42] [INFO ] Load time of PNML (sax parser for PT used): 330 ms
[2024-05-30 22:17:42] [INFO ] Transformed 568 places.
[2024-05-30 22:17:42] [INFO ] Transformed 8320 transitions.
[2024-05-30 22:17:42] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 468 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 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-b10-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40016 steps (8 resets) in 1778 ms. (22 steps per ms) remains 9/12 properties
FORMULA Szymanski-PT-b10-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-b10-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-b10-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 418 ms. (95 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (11 resets) in 137 ms. (289 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 8/9 properties
FORMULA Szymanski-PT-b10-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (12 resets) in 209 ms. (190 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (10 resets) in 80 ms. (493 steps per ms) remains 6/8 properties
FORMULA Szymanski-PT-b10-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b10-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (12 resets) in 961 ms. (41 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 5/6 properties
FORMULA Szymanski-PT-b10-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-30 22:17:44] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 308 cols
[2024-05-30 22:17:44] [INFO ] Computed 3 invariants in 51 ms
[2024-05-30 22:17:44] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem Szymanski-PT-b10-ReachabilityFireability-2024-01 is UNSAT
FORMULA Szymanski-PT-b10-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 234/307 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/308 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2733/3041 variables, 308/311 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3041 variables, 147/458 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3041 variables, 0/458 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/3041 variables, 0/458 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3041/3041 variables, and 458 constraints, problems are : Problem set: 1 solved, 4 unsolved in 2539 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: 5/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 260/307 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-30 22:17:47] [INFO ] Deduced a trap composed of 90 places in 595 ms of which 31 ms to minimize.
[2024-05-30 22:17:48] [INFO ] Deduced a trap composed of 102 places in 478 ms of which 3 ms to minimize.
[2024-05-30 22:17:48] [INFO ] Deduced a trap composed of 138 places in 479 ms of which 3 ms to minimize.
[2024-05-30 22:17:49] [INFO ] Deduced a trap composed of 46 places in 449 ms of which 6 ms to minimize.
[2024-05-30 22:17:49] [INFO ] Deduced a trap composed of 139 places in 399 ms of which 2 ms to minimize.
[2024-05-30 22:17:50] [INFO ] Deduced a trap composed of 73 places in 390 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 6/8 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1/308 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-30 22:17:50] [INFO ] Deduced a trap composed of 49 places in 480 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2733/3041 variables, 308/318 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3041/3041 variables, and 465 constraints, problems are : Problem set: 1 solved, 4 unsolved in 5020 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/3 constraints, Known Traps: 7/7 constraints]
After SMT, in 7895ms problems are : Problem set: 1 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 47 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.25 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 306 transition count 8013
Applied a total of 52 rules in 419 ms. Remains 306 /308 variables (removed 2) and now considering 8013/8064 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 440 ms. Remains : 306/308 places, 8013/8064 transitions.
RANDOM walk for 40006 steps (9 resets) in 221 ms. (180 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 3/4 properties
FORMULA Szymanski-PT-b10-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (11 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (13 resets) in 96 ms. (412 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (13 resets) in 152 ms. (261 steps per ms) remains 2/3 properties
FORMULA Szymanski-PT-b10-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-30 22:17:52] [INFO ] Flow matrix only has 2682 transitions (discarded 5331 similar events)
// Phase 1: matrix 2682 rows 306 cols
[2024-05-30 22:17:52] [INFO ] Computed 1 invariants in 28 ms
[2024-05-30 22:17:52] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 296/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) 2682/2988 variables, 306/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2988 variables, 147/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2988 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/2988 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2988/2988 variables, and 454 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1545 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 296/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) 2682/2988 variables, 306/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2988 variables, 147/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2988 variables, 2/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2988 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/2988 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2988/2988 variables, and 456 constraints, problems are : Problem set: 0 solved, 2 unsolved in 28828 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]
After SMT, in 30527ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 487 ms.
Support contains 10 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 8013/8013 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 306 transition count 7942
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 305 transition count 7814
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 305 transition count 7814
Applied a total of 73 rules in 270 ms. Remains 305 /306 variables (removed 1) and now considering 7814/8013 (removed 199) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 270 ms. Remains : 305/306 places, 7814/8013 transitions.
RANDOM walk for 40006 steps (8 resets) in 166 ms. (239 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 153512 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 2
Probabilistic random walk after 153512 steps, saw 119906 distinct states, run finished after 3004 ms. (steps per millisecond=51 ) properties seen :0
[2024-05-30 22:18:27] [INFO ] Flow matrix only has 2610 transitions (discarded 5204 similar events)
// Phase 1: matrix 2610 rows 305 cols
[2024-05-30 22:18:27] [INFO ] Computed 1 invariants in 27 ms
[2024-05-30 22:18:27] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 295/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 22:18:27] [INFO ] Deduced a trap composed of 44 places in 350 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2610/2915 variables, 305/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2915 variables, 147/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2915 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/2915 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2915/2915 variables, and 454 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1686 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 295/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 22:18:29] [INFO ] Deduced a trap composed of 74 places in 394 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/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) 2610/2915 variables, 305/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2915 variables, 147/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2915 variables, 2/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2915 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/2915 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2915/2915 variables, and 457 constraints, problems are : Problem set: 0 solved, 2 unsolved in 28881 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 30651ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 10 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7814/7814 transitions.
Applied a total of 0 rules in 316 ms. Remains 305 /305 variables (removed 0) and now considering 7814/7814 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 316 ms. Remains : 305/305 places, 7814/7814 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7814/7814 transitions.
Applied a total of 0 rules in 225 ms. Remains 305 /305 variables (removed 0) and now considering 7814/7814 (removed 0) transitions.
[2024-05-30 22:18:58] [INFO ] Flow matrix only has 2610 transitions (discarded 5204 similar events)
[2024-05-30 22:18:58] [INFO ] Invariant cache hit.
[2024-05-30 22:18:58] [INFO ] Implicit Places using invariants in 483 ms returned []
[2024-05-30 22:18:58] [INFO ] Flow matrix only has 2610 transitions (discarded 5204 similar events)
[2024-05-30 22:18:58] [INFO ] Invariant cache hit.
[2024-05-30 22:18:59] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 22:19:21] [INFO ] Implicit Places using invariants and state equation in 22505 ms returned []
Implicit Place search using SMT with State Equation took 23008 ms to find 0 implicit places.
[2024-05-30 22:19:22] [INFO ] Redundant transitions in 895 ms returned []
Running 7812 sub problems to find dead transitions.
[2024-05-30 22:19:22] [INFO ] Flow matrix only has 2610 transitions (discarded 5204 similar events)
[2024-05-30 22:19:22] [INFO ] Invariant cache hit.
[2024-05-30 22:19:22] [INFO ] State equation strengthened by 147 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)timeout

(s27 1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7812 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/2915 variables, and 1 constraints, problems are : Problem set: 0 solved, 7812 unsolved in 30144 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7812/7812 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7812 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7812 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/2915 variables, and 1 constraints, problems are : Problem set: 0 solved, 7812 unsolved in 30104 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7812 constraints, Known Traps: 0/0 constraints]
After SMT, in 88037ms problems are : Problem set: 0 solved, 7812 unsolved
Search for dead transitions found 0 dead transitions in 88108ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112280 ms. Remains : 305/305 places, 7814/7814 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 4160 edges and 305 vertex of which 13 / 305 are part of one of the 6 SCC in 3 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 1408 transitions
Ensure Unique test removed 3810 transitions
Reduce isomorphic transitions removed 5218 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 298 transition count 2594
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 296 transition count 2593
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 295 transition count 2593
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 7 place count 295 transition count 2588
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 17 place count 290 transition count 2588
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 23 place count 287 transition count 2585
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 26 place count 287 transition count 2582
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 26 place count 287 transition count 2581
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 286 transition count 2581
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 286 transition count 2580
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 30 place count 285 transition count 2580
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 32 place count 285 transition count 2580
Applied a total of 32 rules in 357 ms. Remains 285 /305 variables (removed 20) and now considering 2580/7814 (removed 5234) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2580 rows 285 cols
[2024-05-30 22:20:50] [INFO ] Computed 1 invariants in 25 ms
[2024-05-30 22:20:50] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-30 22:20:52] [INFO ] After 1788ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-30 22:20:52] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-30 22:20:56] [INFO ] After 4067ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-30 22:20:59] [INFO ] After 6514ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-30 22:21:00] [INFO ] After 8215ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 10431 ms.
[2024-05-30 22:21:00] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 2 ms.
[2024-05-30 22:21:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 305 places, 7814 transitions and 31372 arcs took 32 ms.
[2024-05-30 22:21:01] [INFO ] Flatten gal took : 466 ms
Total runtime 199345 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Szymanski-PT-b10

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: 7814
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.155s, Sys 0.016s]


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


----------------------------------------------------------------------
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: 620
MODEL NAME: /home/mcc/execution/411/model
305 places, 7814 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ 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

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-b10"
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-b10, 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-171690531300895"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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