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.r500-smll-171649587500127.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 ltsminxred
Input is HirschbergSinclair-PT-45, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r500-smll-171649587500127
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Apr 13 02:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K Apr 13 02:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 13 02:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 13 02:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 616K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityFireability-2024-00
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityFireability-2024-01
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityFireability-2024-02
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityFireability-2024-03
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityFireability-2024-04
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityFireability-2024-05
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityFireability-2024-06
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityFireability-2024-07
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityFireability-2024-08
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityFireability-2024-09
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityFireability-2024-10
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityFireability-2024-11
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityFireability-2024-12
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityFireability-2024-13
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityFireability-2024-14
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717254859430

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-45
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:14:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 15:14:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:14:22] [INFO ] Load time of PNML (sax parser for PT used): 298 ms
[2024-06-01 15:14:22] [INFO ] Transformed 1138 places.
[2024-06-01 15:14:22] [INFO ] Transformed 1042 transitions.
[2024-06-01 15:14:22] [INFO ] Parsed PT model containing 1138 places and 1042 transitions and 3176 arcs in 720 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 51 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (36 resets) in 2836 ms. (14 steps per ms) remains 5/16 properties
FORMULA HirschbergSinclair-PT-45-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-45-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-45-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-45-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-45-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-45-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-45-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-45-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-45-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-45-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-45-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 673 ms. (59 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1864 ms. (21 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 341 ms. (116 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 5/5 properties
// Phase 1: matrix 1042 rows 1138 cols
[2024-06-01 15:14:25] [INFO ] Computed 96 invariants in 80 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem HirschbergSinclair-PT-45-ReachabilityFireability-2024-11 is UNSAT
FORMULA HirschbergSinclair-PT-45-ReachabilityFireability-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 800/938 variables, 61/61 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/938 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 94/1032 variables, 28/89 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1032 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/1035 variables, 1/90 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1035 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 60/1095 variables, 6/96 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1095 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1042/2137 variables, 1095/1191 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2137 variables, 0/1191 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 43/2180 variables, 43/1234 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2180 variables, 0/1234 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/2180 variables, 0/1234 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2180/2180 variables, and 1234 constraints, problems are : Problem set: 1 solved, 4 unsolved in 4858 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 1138/1138 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 796/903 variables, 51/51 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-06-01 15:14:31] [INFO ] Deduced a trap composed of 34 places in 569 ms of which 53 ms to minimize.
[2024-06-01 15:14:32] [INFO ] Deduced a trap composed of 49 places in 602 ms of which 13 ms to minimize.
[2024-06-01 15:14:33] [INFO ] Deduced a trap composed of 194 places in 487 ms of which 11 ms to minimize.
[2024-06-01 15:14:33] [INFO ] Deduced a trap composed of 203 places in 429 ms of which 10 ms to minimize.
[2024-06-01 15:14:34] [INFO ] Deduced a trap composed of 206 places in 357 ms of which 7 ms to minimize.
[2024-06-01 15:14:34] [INFO ] Deduced a trap composed of 197 places in 466 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/903 variables, 6/57 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-06-01 15:14:35] [INFO ] Deduced a trap composed of 40 places in 460 ms of which 10 ms to minimize.
[2024-06-01 15:14:35] [INFO ] Deduced a trap composed of 192 places in 397 ms of which 9 ms to minimize.
[2024-06-01 15:14:36] [INFO ] Deduced a trap composed of 194 places in 530 ms of which 9 ms to minimize.
SMT process timed out in 10938ms, After SMT, problems are : Problem set: 1 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 107 out of 1138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1138/1138 places, 1042/1042 transitions.
Graph (complete) has 2184 edges and 1138 vertex of which 1091 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.9 ms
Discarding 47 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 165 transitions
Trivial Post-agglo rules discarded 165 transitions
Performed 165 trivial Post agglomeration. Transition count delta: 165
Iterating post reduction 0 with 167 rules applied. Total rules applied 168 place count 1091 transition count 875
Reduce places removed 165 places and 0 transitions.
Graph (complete) has 1683 edges and 926 vertex of which 887 are kept as prefixes of interest. Removing 39 places using SCC suffix rule.4 ms
Discarding 39 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 166 rules applied. Total rules applied 334 place count 887 transition count 875
Drop transitions (Empty/Sink Transition effects.) removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 373 place count 887 transition count 836
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 402 place count 858 transition count 807
Iterating global reduction 3 with 29 rules applied. Total rules applied 431 place count 858 transition count 807
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 455 place count 834 transition count 783
Iterating global reduction 3 with 24 rules applied. Total rules applied 479 place count 834 transition count 783
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 3 with 25 rules applied. Total rules applied 504 place count 834 transition count 758
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 3 with 25 rules applied. Total rules applied 529 place count 809 transition count 758
Reduce places removed 16 places and 16 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 545 place count 793 transition count 742
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 546 place count 792 transition count 742
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 13 Pre rules applied. Total rules applied 546 place count 792 transition count 729
Deduced a syphon composed of 13 places in 14 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 572 place count 779 transition count 729
Applied a total of 572 rules in 983 ms. Remains 779 /1138 variables (removed 359) and now considering 729/1042 (removed 313) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1001 ms. Remains : 779/1138 places, 729/1042 transitions.
RANDOM walk for 40000 steps (48 resets) in 971 ms. (41 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 390 ms. (102 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 419 ms. (95 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 187 ms. (212 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 200434 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 4
Probabilistic random walk after 200434 steps, saw 59537 distinct states, run finished after 3007 ms. (steps per millisecond=66 ) properties seen :0
// Phase 1: matrix 729 rows 779 cols
[2024-06-01 15:14:40] [INFO ] Computed 50 invariants in 13 ms
[2024-06-01 15:14:41] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 609/717 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/717 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/719 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/719 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 720/1439 variables, 719/769 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1439 variables, 13/782 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1439 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 69/1508 variables, 60/842 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1508 variables, 1/843 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1508 variables, 0/843 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1508 variables, 0/843 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1508/1508 variables, and 843 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4926 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 779/779 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 609/717 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/717 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/719 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/719 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 720/1439 variables, 719/769 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1439 variables, 13/782 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1439 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 69/1508 variables, 60/842 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1508 variables, 1/843 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1508 variables, 4/847 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1508 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/1508 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1508/1508 variables, and 847 constraints, problems are : Problem set: 0 solved, 4 unsolved in 12767 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 779/779 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 17832ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 3354 ms.
Support contains 107 out of 779 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 779/779 places, 729/729 transitions.
Applied a total of 0 rules in 50 ms. Remains 779 /779 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 779/779 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 779/779 places, 729/729 transitions.
Applied a total of 0 rules in 46 ms. Remains 779 /779 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-06-01 15:15:02] [INFO ] Invariant cache hit.
[2024-06-01 15:15:03] [INFO ] Implicit Places using invariants in 942 ms returned []
[2024-06-01 15:15:03] [INFO ] Invariant cache hit.
[2024-06-01 15:15:04] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-01 15:15:08] [INFO ] Implicit Places using invariants and state equation in 5039 ms returned []
Implicit Place search using SMT with State Equation took 6001 ms to find 0 implicit places.
[2024-06-01 15:15:08] [INFO ] Redundant transitions in 75 ms returned []
Running 699 sub problems to find dead transitions.
[2024-06-01 15:15:08] [INFO ] Invariant cache hit.
[2024-06-01 15:15:08] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/749 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/749 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/749 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 699 unsolved
SMT process timed out in 30515ms, After SMT, problems are : Problem set: 0 solved, 699 unsolved
Search for dead transitions found 0 dead transitions in 30533ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36677 ms. Remains : 779/779 places, 729/729 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 776 transition count 696
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 69 place count 743 transition count 696
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 71 Pre rules applied. Total rules applied 69 place count 743 transition count 625
Deduced a syphon composed of 71 places in 11 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 211 place count 672 transition count 625
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 16 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 227 place count 664 transition count 617
Applied a total of 227 rules in 199 ms. Remains 664 /779 variables (removed 115) and now considering 617/729 (removed 112) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 617 rows 664 cols
[2024-06-01 15:15:39] [INFO ] Computed 47 invariants in 13 ms
[2024-06-01 15:15:39] [INFO ] [Real]Absence check using 1 positive place invariants in 14 ms returned sat
[2024-06-01 15:15:39] [INFO ] [Real]Absence check using 1 positive and 46 generalized place invariants in 231 ms returned sat
[2024-06-01 15:15:39] [INFO ] After 631ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-01 15:15:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-06-01 15:15:40] [INFO ] [Nat]Absence check using 1 positive and 46 generalized place invariants in 234 ms returned sat
[2024-06-01 15:15:42] [INFO ] After 2201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-06-01 15:15:44] [INFO ] After 3880ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-06-01 15:15:45] [INFO ] After 5649ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 6580 ms.
[2024-06-01 15:15:45] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2024-06-01 15:15:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 779 places, 729 transitions and 2310 arcs took 10 ms.
[2024-06-01 15:15:45] [INFO ] Flatten gal took : 199 ms
Total runtime 83775 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : HirschbergSinclair-PT-45-ReachabilityFireability-2024-03
Could not compute solution for formula : HirschbergSinclair-PT-45-ReachabilityFireability-2024-09
Could not compute solution for formula : HirschbergSinclair-PT-45-ReachabilityFireability-2024-14
Could not compute solution for formula : HirschbergSinclair-PT-45-ReachabilityFireability-2024-15

BK_STOP 1717254946424

--------------------
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
mcc2024
rfs formula name HirschbergSinclair-PT-45-ReachabilityFireability-2024-03
rfs formula type AG
rfs formula formula --invariant=/tmp/577/inv_0_
rfs formula name HirschbergSinclair-PT-45-ReachabilityFireability-2024-09
rfs formula type EF
rfs formula formula --invariant=/tmp/577/inv_1_
rfs formula name HirschbergSinclair-PT-45-ReachabilityFireability-2024-14
rfs formula type EF
rfs formula formula --invariant=/tmp/577/inv_2_
rfs formula name HirschbergSinclair-PT-45-ReachabilityFireability-2024-15
rfs formula type EF
rfs formula formula --invariant=/tmp/577/inv_3_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="HirschbergSinclair-PT-45"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is HirschbergSinclair-PT-45, 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 r500-smll-171649587500127"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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