Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r312-tall-171662337900126.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 itstools
Input is RERS17pb113-PT-2, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-171662337900126
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K 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 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 18:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 15M 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 RERS17pb113-PT-2-ReachabilityCardinality-2023-00
FORMULA_NAME RERS17pb113-PT-2-ReachabilityCardinality-2024-01
FORMULA_NAME RERS17pb113-PT-2-ReachabilityCardinality-2024-02
FORMULA_NAME RERS17pb113-PT-2-ReachabilityCardinality-2023-03
FORMULA_NAME RERS17pb113-PT-2-ReachabilityCardinality-2024-04
FORMULA_NAME RERS17pb113-PT-2-ReachabilityCardinality-2024-05
FORMULA_NAME RERS17pb113-PT-2-ReachabilityCardinality-2023-06
FORMULA_NAME RERS17pb113-PT-2-ReachabilityCardinality-2024-07
FORMULA_NAME RERS17pb113-PT-2-ReachabilityCardinality-2024-08
FORMULA_NAME RERS17pb113-PT-2-ReachabilityCardinality-2024-09
FORMULA_NAME RERS17pb113-PT-2-ReachabilityCardinality-2024-10
FORMULA_NAME RERS17pb113-PT-2-ReachabilityCardinality-2024-11
FORMULA_NAME RERS17pb113-PT-2-ReachabilityCardinality-2024-12
FORMULA_NAME RERS17pb113-PT-2-ReachabilityCardinality-2024-13
FORMULA_NAME RERS17pb113-PT-2-ReachabilityCardinality-2024-14
FORMULA_NAME RERS17pb113-PT-2-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716675662130

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS17pb113-PT-2
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-25 22:21:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 22:21:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 22:21:04] [INFO ] Load time of PNML (sax parser for PT used): 674 ms
[2024-05-25 22:21:04] [INFO ] Transformed 639 places.
[2024-05-25 22:21:04] [INFO ] Transformed 31353 transitions.
[2024-05-25 22:21:04] [INFO ] Parsed PT model containing 639 places and 31353 transitions and 125418 arcs in 902 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 6820 ms. (5 steps per ms) remains 12/16 properties
FORMULA RERS17pb113-PT-2-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-2-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-2-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-2-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 388 ms. (102 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 293 ms. (136 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 305 ms. (130 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 616 ms. (64 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 411 ms. (97 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 664 ms. (60 steps per ms) remains 12/12 properties
[2024-05-25 22:21:07] [INFO ] Flatten gal took : 1811 ms
BEST_FIRST walk for 40003 steps (8 resets) in 690 ms. (57 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 396 ms. (100 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 371 ms. (107 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 387 ms. (103 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 270 ms. (147 steps per ms) remains 12/12 properties
[2024-05-25 22:21:08] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 639 cols
[2024-05-25 22:21:08] [INFO ] Computed 25 invariants in 123 ms
[2024-05-25 22:21:08] [INFO ] Flatten gal took : 982 ms
[2024-05-25 22:21:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12310184809871928108.gal : 354 ms
[2024-05-25 22:21:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12851205067979327500.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12310184809871928108.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12851205067979327500.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
[2024-05-25 22:21:08] [INFO ] State equation strengthened by 829 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem RERS17pb113-PT-2-ReachabilityCardinality-2024-01 is UNSAT
FORMULA RERS17pb113-PT-2-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem RERS17pb113-PT-2-ReachabilityCardinality-2024-08 is UNSAT
FORMULA RERS17pb113-PT-2-ReachabilityCardinality-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 422/630 variables, 13/13 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/630 variables, 3/16 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/630 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 9/639 variables, 9/25 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/639 variables, 0/25 constraints. Problems are: Problem set: 2 solved, 10 unsolved
Loading property file /tmp/ReachabilityCardinality12851205067979327500.prop.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 18965/18965 variables, and 664 constraints, problems are : Problem set: 2 solved, 10 unsolved in 5062 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 639/639 constraints, ReadFeed: 0/829 constraints, PredecessorRefiner: 12/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 451/629 variables, 13/13 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/629 variables, 2/15 constraints. Problems are: Problem set: 2 solved, 10 unsolved
[2024-05-25 22:21:17] [INFO ] Deduced a trap composed of 65 places in 2064 ms of which 35 ms to minimize.
[2024-05-25 22:21:18] [INFO ] Deduced a trap composed of 41 places in 1481 ms of which 4 ms to minimize.
[2024-05-25 22:21:19] [INFO ] Deduced a trap composed of 49 places in 1205 ms of which 2 ms to minimize.
SMT process timed out in 11966ms, After SMT, problems are : Problem set: 2 solved, 10 unsolved
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 178 out of 639 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 639/639 places, 31353/31353 transitions.
Ensure Unique test removed 11 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 628 transition count 31353
Applied a total of 11 rules in 400 ms. Remains 628 /639 variables (removed 11) and now considering 31353/31353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 414 ms. Remains : 628/639 places, 31353/31353 transitions.
RANDOM walk for 40000 steps (8 resets) in 2207 ms. (18 steps per ms) remains 9/10 properties
FORMULA RERS17pb113-PT-2-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 242 ms. (164 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 381 ms. (104 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 8/9 properties
FORMULA RERS17pb113-PT-2-ReachabilityCardinality-2023-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 316 ms. (126 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 282 ms. (141 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 208 ms. (191 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 8/8 properties
[2024-05-25 22:21:21] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 628 cols
[2024-05-25 22:21:21] [INFO ] Computed 14 invariants in 57 ms
[2024-05-25 22:21:22] [INFO ] State equation strengthened by 829 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 467/628 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/628 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :3 after 10
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :10 after 12
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :12 after 17
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :17 after 18
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :18 after 21
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :21 after 26
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :26 after 54
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :54 after 106
SDD proceeding with computation,12 properties remain. new max is 2048
SDD size :106 after 254
SDD proceeding with computation,12 properties remain. new max is 4096
SDD size :254 after 822
SDD proceeding with computation,12 properties remain. new max is 8192
SDD size :822 after 3622
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 18954/18954 variables, and 642 constraints, problems are : Problem set: 0 solved, 8 unsolved in 45031 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 628/628 constraints, ReadFeed: 0/829 constraints, PredecessorRefiner: 8/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 467/628 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-25 22:22:09] [INFO ] Deduced a trap composed of 65 places in 1552 ms of which 7 ms to minimize.
[2024-05-25 22:22:10] [INFO ] Deduced a trap composed of 41 places in 1425 ms of which 4 ms to minimize.
[2024-05-25 22:22:12] [INFO ] Deduced a trap composed of 65 places in 1251 ms of which 2 ms to minimize.
[2024-05-25 22:22:13] [INFO ] Deduced a trap composed of 41 places in 1005 ms of which 1 ms to minimize.
[2024-05-25 22:22:14] [INFO ] Deduced a trap composed of 41 places in 1190 ms of which 2 ms to minimize.
[2024-05-25 22:22:15] [INFO ] Deduced a trap composed of 49 places in 1035 ms of which 2 ms to minimize.
[2024-05-25 22:22:16] [INFO ] Deduced a trap composed of 41 places in 948 ms of which 1 ms to minimize.
[2024-05-25 22:22:17] [INFO ] Deduced a trap composed of 65 places in 733 ms of which 1 ms to minimize.
SDD proceeding with computation,12 properties remain. new max is 16384
SDD size :3622 after 18214
[2024-05-25 22:22:18] [INFO ] Deduced a trap composed of 49 places in 660 ms of which 1 ms to minimize.
[2024-05-25 22:22:18] [INFO ] Deduced a trap composed of 49 places in 441 ms of which 0 ms to minimize.
[2024-05-25 22:22:19] [INFO ] Deduced a trap composed of 65 places in 668 ms of which 1 ms to minimize.
[2024-05-25 22:22:20] [INFO ] Deduced a trap composed of 65 places in 876 ms of which 2 ms to minimize.
[2024-05-25 22:22:20] [INFO ] Deduced a trap composed of 65 places in 454 ms of which 1 ms to minimize.
[2024-05-25 22:22:21] [INFO ] Deduced a trap composed of 41 places in 473 ms of which 1 ms to minimize.
[2024-05-25 22:22:23] [INFO ] Deduced a trap composed of 41 places in 1230 ms of which 2 ms to minimize.
[2024-05-25 22:22:24] [INFO ] Deduced a trap composed of 65 places in 947 ms of which 1 ms to minimize.
[2024-05-25 22:22:24] [INFO ] Deduced a trap composed of 41 places in 828 ms of which 1 ms to minimize.
[2024-05-25 22:22:25] [INFO ] Deduced a trap composed of 49 places in 717 ms of which 1 ms to minimize.
Problem RERS17pb113-PT-2-ReachabilityCardinality-2024-13 is UNSAT
FORMULA RERS17pb113-PT-2-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (INCLUDED_ONLY) 0/628 variables, 18/32 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-25 22:22:26] [INFO ] Deduced a trap composed of 49 places in 510 ms of which 6 ms to minimize.
[2024-05-25 22:22:26] [INFO ] Deduced a trap composed of 43 places in 332 ms of which 1 ms to minimize.
[2024-05-25 22:22:27] [INFO ] Deduced a trap composed of 65 places in 598 ms of which 1 ms to minimize.
[2024-05-25 22:22:28] [INFO ] Deduced a trap composed of 25 places in 347 ms of which 1 ms to minimize.
[2024-05-25 22:22:29] [INFO ] Deduced a trap composed of 65 places in 471 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/628 variables, 5/37 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-25 22:22:31] [INFO ] Deduced a trap composed of 65 places in 633 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/628 variables, 1/38 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/628 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 18954/18954 variables, and 666 constraints, problems are : Problem set: 1 solved, 7 unsolved in 45025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 628/628 constraints, ReadFeed: 0/829 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 24/24 constraints]
After SMT, in 90697ms problems are : Problem set: 1 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 135 out of 628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 31353/31353 transitions.
Applied a total of 0 rules in 244 ms. Remains 628 /628 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 244 ms. Remains : 628/628 places, 31353/31353 transitions.
RANDOM walk for 40000 steps (8 resets) in 2600 ms. (15 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 260 ms. (153 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 342 ms. (116 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 385 ms. (103 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 21631 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :0 out of 7
Probabilistic random walk after 21631 steps, saw 18879 distinct states, run finished after 3005 ms. (steps per millisecond=7 ) properties seen :0
[2024-05-25 22:22:57] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2024-05-25 22:22:57] [INFO ] Invariant cache hit.
[2024-05-25 22:22:57] [INFO ] State equation strengthened by 829 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 493/628 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/628 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,12 properties remain. new max is 32768
SDD size :18214 after 791366
At refinement iteration 4 (OVERLAPS) 18326/18954 variables, 628/642 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18954 variables, 829/1471 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 18954/18954 variables, and 1471 constraints, problems are : Problem set: 0 solved, 7 unsolved in 75062 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 628/628 constraints, ReadFeed: 829/829 constraints, PredecessorRefiner: 7/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 493/628 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-25 22:24:14] [INFO ] Deduced a trap composed of 49 places in 1223 ms of which 2 ms to minimize.
[2024-05-25 22:24:15] [INFO ] Deduced a trap composed of 65 places in 1181 ms of which 2 ms to minimize.
[2024-05-25 22:24:16] [INFO ] Deduced a trap composed of 65 places in 773 ms of which 1 ms to minimize.
[2024-05-25 22:24:17] [INFO ] Deduced a trap composed of 41 places in 766 ms of which 1 ms to minimize.
[2024-05-25 22:24:17] [INFO ] Deduced a trap composed of 49 places in 734 ms of which 1 ms to minimize.
[2024-05-25 22:24:18] [INFO ] Deduced a trap composed of 41 places in 742 ms of which 1 ms to minimize.
[2024-05-25 22:24:19] [INFO ] Deduced a trap composed of 41 places in 809 ms of which 1 ms to minimize.
[2024-05-25 22:24:20] [INFO ] Deduced a trap composed of 65 places in 571 ms of which 0 ms to minimize.
[2024-05-25 22:24:22] [INFO ] Deduced a trap composed of 41 places in 1658 ms of which 3 ms to minimize.
[2024-05-25 22:24:23] [INFO ] Deduced a trap composed of 49 places in 1166 ms of which 1 ms to minimize.
[2024-05-25 22:24:24] [INFO ] Deduced a trap composed of 65 places in 1187 ms of which 2 ms to minimize.
[2024-05-25 22:24:25] [INFO ] Deduced a trap composed of 65 places in 906 ms of which 1 ms to minimize.
[2024-05-25 22:24:26] [INFO ] Deduced a trap composed of 66 places in 426 ms of which 0 ms to minimize.
[2024-05-25 22:24:26] [INFO ] Deduced a trap composed of 65 places in 696 ms of which 1 ms to minimize.
[2024-05-25 22:24:28] [INFO ] Deduced a trap composed of 65 places in 1481 ms of which 2 ms to minimize.
[2024-05-25 22:24:29] [INFO ] Deduced a trap composed of 65 places in 1103 ms of which 1 ms to minimize.
[2024-05-25 22:24:30] [INFO ] Deduced a trap composed of 49 places in 902 ms of which 2 ms to minimize.
[2024-05-25 22:24:31] [INFO ] Deduced a trap composed of 49 places in 871 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/628 variables, 18/32 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-25 22:24:32] [INFO ] Deduced a trap composed of 41 places in 756 ms of which 1 ms to minimize.
[2024-05-25 22:24:33] [INFO ] Deduced a trap composed of 65 places in 646 ms of which 1 ms to minimize.
[2024-05-25 22:24:34] [INFO ] Deduced a trap composed of 49 places in 640 ms of which 1 ms to minimize.
[2024-05-25 22:24:35] [INFO ] Deduced a trap composed of 65 places in 598 ms of which 0 ms to minimize.
[2024-05-25 22:24:35] [INFO ] Deduced a trap composed of 49 places in 474 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/628 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-25 22:24:38] [INFO ] Deduced a trap composed of 65 places in 540 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/628 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/628 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 18326/18954 variables, 628/666 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/18954 variables, 829/1495 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 18954/18954 variables, and 1499 constraints, problems are : Problem set: 0 solved, 7 unsolved in 75055 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 628/628 constraints, ReadFeed: 829/829 constraints, PredecessorRefiner: 7/4 constraints, Known Traps: 24/24 constraints]
After SMT, in 150584ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 135 out of 628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 31353/31353 transitions.
Applied a total of 0 rules in 200 ms. Remains 628 /628 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 200 ms. Remains : 628/628 places, 31353/31353 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 31353/31353 transitions.
Applied a total of 0 rules in 193 ms. Remains 628 /628 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2024-05-25 22:25:28] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2024-05-25 22:25:28] [INFO ] Invariant cache hit.
SDD proceeding with computation,12 properties remain. new max is 65536
SDD size :791366 after 1.58961e+06
[2024-05-25 22:25:30] [INFO ] Implicit Places using invariants in 2383 ms returned []
Implicit Place search using SMT only with invariants took 2408 ms to find 0 implicit places.
Running 31352 sub problems to find dead transitions.
[2024-05-25 22:25:31] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2024-05-25 22:25:31] [INFO ] Invariant cache hit.
[2024-05-25 22:25:31] [INFO ] State equation strengthened by 829 read => feed constraints.

BK_STOP 1716675965140

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="RERS17pb113-PT-2"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is RERS17pb113-PT-2, 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 r312-tall-171662337900126"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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