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.r536-tall-171690533300862.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 Szymanski-PT-b02, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690533300862
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Apr 11 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 11 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 11 15:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 15:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:01 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-b02-ReachabilityCardinality-2024-00
FORMULA_NAME Szymanski-PT-b02-ReachabilityCardinality-2024-01
FORMULA_NAME Szymanski-PT-b02-ReachabilityCardinality-2024-02
FORMULA_NAME Szymanski-PT-b02-ReachabilityCardinality-2024-03
FORMULA_NAME Szymanski-PT-b02-ReachabilityCardinality-2024-04
FORMULA_NAME Szymanski-PT-b02-ReachabilityCardinality-2024-05
FORMULA_NAME Szymanski-PT-b02-ReachabilityCardinality-2024-06
FORMULA_NAME Szymanski-PT-b02-ReachabilityCardinality-2024-07
FORMULA_NAME Szymanski-PT-b02-ReachabilityCardinality-2024-08
FORMULA_NAME Szymanski-PT-b02-ReachabilityCardinality-2024-09
FORMULA_NAME Szymanski-PT-b02-ReachabilityCardinality-2024-10
FORMULA_NAME Szymanski-PT-b02-ReachabilityCardinality-2024-11
FORMULA_NAME Szymanski-PT-b02-ReachabilityCardinality-2024-12
FORMULA_NAME Szymanski-PT-b02-ReachabilityCardinality-2024-13
FORMULA_NAME Szymanski-PT-b02-ReachabilityCardinality-2024-14
FORMULA_NAME Szymanski-PT-b02-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717282029253

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-b02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 22:47:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 22:47:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 22:47:10] [INFO ] Load time of PNML (sax parser for PT used): 356 ms
[2024-06-01 22:47:10] [INFO ] Transformed 568 places.
[2024-06-01 22:47:10] [INFO ] Transformed 8320 transitions.
[2024-06-01 22:47:10] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 493 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 260 places in 19 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b02-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40003 steps (9 resets) in 2113 ms. (18 steps per ms) remains 6/7 properties
FORMULA Szymanski-PT-b02-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 310 ms. (128 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 186 ms. (213 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 202 ms. (197 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 334 ms. (119 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 122 ms. (325 steps per ms) remains 6/6 properties
[2024-06-01 22:47:12] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 308 cols
[2024-06-01 22:47:12] [INFO ] Computed 3 invariants in 58 ms
[2024-06-01 22:47:12] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem Szymanski-PT-b02-ReachabilityCardinality-2024-04 is UNSAT
FORMULA Szymanski-PT-b02-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b02-ReachabilityCardinality-2024-08 is UNSAT
FORMULA Szymanski-PT-b02-ReachabilityCardinality-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b02-ReachabilityCardinality-2024-14 is UNSAT
FORMULA Szymanski-PT-b02-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 280/307 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/308 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 3 unsolved
Problem Szymanski-PT-b02-ReachabilityCardinality-2024-09 is UNSAT
FORMULA Szymanski-PT-b02-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 2733/3041 variables, 308/311 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3041 variables, 147/458 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3041 variables, 0/458 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/3041 variables, 0/458 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3041/3041 variables, and 458 constraints, problems are : Problem set: 4 solved, 2 unsolved in 1179 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: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 294/307 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 2 unsolved
[2024-06-01 22:47:14] [INFO ] Deduced a trap composed of 130 places in 601 ms of which 21 ms to minimize.
[2024-06-01 22:47:14] [INFO ] Deduced a trap composed of 130 places in 613 ms of which 15 ms to minimize.
[2024-06-01 22:47:15] [INFO ] Deduced a trap composed of 145 places in 505 ms of which 2 ms to minimize.
[2024-06-01 22:47:15] [INFO ] Deduced a trap composed of 51 places in 503 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 4/6 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/308 variables, 1/7 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3041/3041 variables, and 315 constraints, problems are : Problem set: 4 solved, 2 unsolved in 4763 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 308/308 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/6 constraints, Known Traps: 4/4 constraints]
After SMT, in 6240ms problems are : Problem set: 4 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 13 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.17 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 0 with 124 rules applied. Total rules applied 125 place count 306 transition count 7940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 126 place count 305 transition count 7812
Iterating global reduction 1 with 1 rules applied. Total rules applied 127 place count 305 transition count 7812
Applied a total of 127 rules in 463 ms. Remains 305 /308 variables (removed 3) and now considering 7812/8064 (removed 252) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 478 ms. Remains : 305/308 places, 7812/8064 transitions.
RANDOM walk for 40001 steps (8 resets) in 337 ms. (118 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 121 ms. (327 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 152469 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 2
Probabilistic random walk after 152469 steps, saw 51755 distinct states, run finished after 3004 ms. (steps per millisecond=50 ) properties seen :0
[2024-06-01 22:47:21] [INFO ] Flow matrix only has 2608 transitions (discarded 5204 similar events)
// Phase 1: matrix 2608 rows 305 cols
[2024-06-01 22:47:22] [INFO ] Computed 1 invariants in 21 ms
[2024-06-01 22:47:22] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 292/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2608/2913 variables, 305/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2913 variables, 147/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2913 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/2913 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2913/2913 variables, and 453 constraints, problems are : Problem set: 0 solved, 2 unsolved in 864 ms.
Refiners :[Generalized P Invariants (flows): 1/1 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/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 292/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2608/2913 variables, 305/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2913/2913 variables, and 453 constraints, problems are : Problem set: 0 solved, 2 unsolved in 19921 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 20884ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 13 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7812/7812 transitions.
Applied a total of 0 rules in 210 ms. Remains 305 /305 variables (removed 0) and now considering 7812/7812 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 210 ms. Remains : 305/305 places, 7812/7812 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7812/7812 transitions.
Applied a total of 0 rules in 278 ms. Remains 305 /305 variables (removed 0) and now considering 7812/7812 (removed 0) transitions.
[2024-06-01 22:47:43] [INFO ] Flow matrix only has 2608 transitions (discarded 5204 similar events)
[2024-06-01 22:47:43] [INFO ] Invariant cache hit.
[2024-06-01 22:47:43] [INFO ] Implicit Places using invariants in 422 ms returned []
[2024-06-01 22:47:43] [INFO ] Flow matrix only has 2608 transitions (discarded 5204 similar events)
[2024-06-01 22:47:43] [INFO ] Invariant cache hit.
[2024-06-01 22:47:44] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 22:48:26] [INFO ] Performed 28/305 implicitness test of which 0 returned IMPLICIT in 41 seconds.
[2024-06-01 22:48:56] [INFO ] Performed 79/305 implicitness test of which 0 returned IMPLICIT in 71 seconds.
[2024-06-01 22:49:07] [INFO ] Implicit Places using invariants and state equation in 83699 ms returned []
Implicit Place search using SMT with State Equation took 84130 ms to find 0 implicit places.
[2024-06-01 22:49:08] [INFO ] Redundant transitions in 882 ms returned []
Running 7810 sub problems to find dead transitions.
[2024-06-01 22:49:08] [INFO ] Flow matrix only has 2608 transitions (discarded 5204 similar events)
[2024-06-01 22:49:08] [INFO ] Invariant cache hit.
[2024-06-01 22:49:08] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/2913 variables, and 1 constraints, problems are : Problem set: 0 solved, 7810 unsolved in 30142 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7810/7810 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/2913 variables, and 1 constraints, problems are : Problem set: 0 solved, 7810 unsolved in 30091 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7810 constraints, Known Traps: 0/0 constraints]
After SMT, in 86233ms problems are : Problem set: 0 solved, 7810 unsolved
Search for dead transitions found 0 dead transitions in 86304ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171632 ms. Remains : 305/305 places, 7812/7812 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 4280 edges and 305 vertex of which 18 / 305 are part of one of the 8 SCC in 4 ms
Free SCC test removed 10 places
Drop transitions (Empty/Sink Transition effects.) removed 1920 transitions
Ensure Unique test removed 3304 transitions
Reduce isomorphic transitions removed 5224 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 295 transition count 2586
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 293 transition count 2586
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 5 place count 293 transition count 2580
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 17 place count 287 transition count 2580
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 285 transition count 2578
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 285 transition count 2576
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 23 place count 285 transition count 2575
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 284 transition count 2575
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 284 transition count 2573
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 29 place count 282 transition count 2573
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 282 transition count 2573
Applied a total of 30 rules in 293 ms. Remains 282 /305 variables (removed 23) and now considering 2573/7812 (removed 5239) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2573 rows 282 cols
[2024-06-01 22:50:35] [INFO ] Computed 1 invariants in 33 ms
[2024-06-01 22:50:35] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 22:50:35] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 22:50:36] [INFO ] After 1324ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 22:50:41] [INFO ] After 6670ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 22:50:48] [INFO ] After 13264ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 13671 ms.
[2024-06-01 22:50:48] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-06-01 22:50:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 305 places, 7812 transitions and 31368 arcs took 28 ms.
[2024-06-01 22:50:49] [INFO ] Flatten gal took : 442 ms
Total runtime 218719 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 : Szymanski-PT-b02-ReachabilityCardinality-2024-03
Could not compute solution for formula : Szymanski-PT-b02-ReachabilityCardinality-2024-13

BK_STOP 1717282249313

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name Szymanski-PT-b02-ReachabilityCardinality-2024-03
rfs formula type AG
rfs formula formula --invariant=/tmp/565/inv_0_
rfs formula name Szymanski-PT-b02-ReachabilityCardinality-2024-13
rfs formula type AG
rfs formula formula --invariant=/tmp/565/inv_1_
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="Szymanski-PT-b02"
export BK_EXAMINATION="ReachabilityCardinality"
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 Szymanski-PT-b02, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r536-tall-171690533300862"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Szymanski-PT-b02.tgz
mv Szymanski-PT-b02 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;