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.r602-tall-171774424600198.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 BlocksWorld-PT-05, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r602-tall-171774424600198
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 190K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 859K Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 174K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 959K Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 18K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 153K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 637K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 502K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.4M Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 5.6M Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 25K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 62K Jun 7 06:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jun 7 06:26 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 7 06:26 instance
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 iscolored
-rw-r--r-- 1 mcc users 783K Jun 7 06:26 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 BlocksWorld-PT-05-ReachabilityCardinality-2024-00
FORMULA_NAME BlocksWorld-PT-05-ReachabilityCardinality-2024-01
FORMULA_NAME BlocksWorld-PT-05-ReachabilityCardinality-2024-02
FORMULA_NAME BlocksWorld-PT-05-ReachabilityCardinality-2024-03
FORMULA_NAME BlocksWorld-PT-05-ReachabilityCardinality-2024-04
FORMULA_NAME BlocksWorld-PT-05-ReachabilityCardinality-2024-05
FORMULA_NAME BlocksWorld-PT-05-ReachabilityCardinality-2024-06
FORMULA_NAME BlocksWorld-PT-05-ReachabilityCardinality-2024-07
FORMULA_NAME BlocksWorld-PT-05-ReachabilityCardinality-2024-08
FORMULA_NAME BlocksWorld-PT-05-ReachabilityCardinality-2024-09
FORMULA_NAME BlocksWorld-PT-05-ReachabilityCardinality-2024-10
FORMULA_NAME BlocksWorld-PT-05-ReachabilityCardinality-2024-11
FORMULA_NAME BlocksWorld-PT-05-ReachabilityCardinality-2024-12
FORMULA_NAME BlocksWorld-PT-05-ReachabilityCardinality-2024-13
FORMULA_NAME BlocksWorld-PT-05-ReachabilityCardinality-2024-14
FORMULA_NAME BlocksWorld-PT-05-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717753967158

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-06-07 09:52:48] [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-06-07 09:52:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 09:52:48] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2024-06-07 09:52:48] [INFO ] Transformed 869 places.
[2024-06-07 09:52:48] [INFO ] Transformed 1625 transitions.
[2024-06-07 09:52:48] [INFO ] Found NUPN structural information;
[2024-06-07 09:52:48] [INFO ] Completing missing partition info from NUPN : creating a component with [pred_on_table_0, pred_arm_empty_0, pred_on_table_1, pred_on_table_2, pred_on_table_3, pred_on_table_4, pred_on_table_5, pred_on_table_6, pred_on_table_7, pred_on_table_8, pred_on_table_9, pred_on_table_10, pred_on_table_11, pred_on_table_12, pred_on_table_13, pred_on_table_14, pred_on_table_15, pred_on_table_16, pred_on_table_17, pred_on_table_18, pred_on_table_19, pred_on_table_20, pred_on_table_21, pred_on_table_22, pred_on_table_23, pred_on_table_24, pred_on_table_25, pred_on_table_26, pred_on_table_27]
[2024-06-07 09:52:48] [INFO ] Parsed PT model containing 869 places and 1625 transitions and 8110 arcs in 281 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 80 ms.
Working with output stream class java.io.PrintStream
[2024-06-07 09:52:49] [INFO ] Flatten gal took : 326 ms
[2024-06-07 09:52:49] [INFO ] Flatten gal took : 171 ms
[2024-06-07 09:52:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14612189280951585610.gal : 167 ms
[2024-06-07 09:52:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5399239876484278076.prop : 66 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/ReachabilityCardinality14612189280951585610.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5399239876484278076.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 ...329
RANDOM walk for 40000 steps (8 resets) in 6138 ms. (6 steps per ms) remains 12/16 properties
FORMULA BlocksWorld-PT-05-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-05-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-05-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-05-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Loading property file /tmp/ReachabilityCardinality5399239876484278076.prop.
BEST_FIRST walk for 40003 steps (8 resets) in 5517 ms. (7 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 2722 ms. (14 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3055 ms. (13 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2761 ms. (14 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1087 ms. (36 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1478 ms. (27 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 865 ms. (46 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 380 ms. (104 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 409 ms. (97 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 416 ms. (95 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 420 ms. (95 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 394 ms. (101 steps per ms) remains 12/12 properties
// Phase 1: matrix 1625 rows 869 cols
[2024-06-07 09:52:56] [INFO ] Computed 57 invariants in 28 ms
[2024-06-07 09:52:56] [INFO ] State equation strengthened by 45 read => feed constraints.
Problem BlocksWorld-PT-05-ReachabilityCardinality-2024-04 is UNSAT
FORMULA BlocksWorld-PT-05-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-05-ReachabilityCardinality-2024-05 is UNSAT
FORMULA BlocksWorld-PT-05-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-05-ReachabilityCardinality-2024-06 is UNSAT
FORMULA BlocksWorld-PT-05-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-05-ReachabilityCardinality-2024-00 is UNSAT
FORMULA BlocksWorld-PT-05-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-05-ReachabilityCardinality-2024-01 is UNSAT
FORMULA BlocksWorld-PT-05-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-05-ReachabilityCardinality-2024-02 is UNSAT
FORMULA BlocksWorld-PT-05-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-05-ReachabilityCardinality-2024-07 is UNSAT
FORMULA BlocksWorld-PT-05-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-05-ReachabilityCardinality-2024-08 is UNSAT
FORMULA BlocksWorld-PT-05-ReachabilityCardinality-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-05-ReachabilityCardinality-2024-15 is UNSAT
FORMULA BlocksWorld-PT-05-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/869 variables, 57/57 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/869 variables, 0/57 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1624/2493 variables, 869/926 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2493 variables, 44/970 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2493 variables, 0/970 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/2494 variables, 1/971 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2494 variables, 0/971 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/2494 variables, 0/971 constraints. Problems are: Problem set: 9 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2494/2494 variables, and 971 constraints, problems are : Problem set: 9 solved, 3 unsolved in 1668 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 869/869 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 3 unsolved
Problem BlocksWorld-PT-05-ReachabilityCardinality-2024-13 is UNSAT
FORMULA BlocksWorld-PT-05-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 759/866 variables, 55/55 constraints. Problems are: Problem set: 10 solved, 2 unsolved
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 92
[2024-06-07 09:53:01] [INFO ] Deduced a trap composed of 104 places in 379 ms of which 37 ms to minimize.
[2024-06-07 09:53:01] [INFO ] Deduced a trap composed of 125 places in 140 ms of which 2 ms to minimize.
[2024-06-07 09:53:02] [INFO ] Deduced a trap composed of 81 places in 161 ms of which 3 ms to minimize.
[2024-06-07 09:53:02] [INFO ] Deduced a trap composed of 30 places in 151 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/866 variables, 4/59 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/866 variables, 0/59 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 3/869 variables, 2/61 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/869 variables, 0/61 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1624/2493 variables, 869/930 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2493 variables, 44/974 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2493 variables, 2/976 constraints. Problems are: Problem set: 10 solved, 2 unsolved
[2024-06-07 09:53:03] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 2 ms to minimize.
[2024-06-07 09:53:03] [INFO ] Deduced a trap composed of 29 places in 332 ms of which 4 ms to minimize.
[2024-06-07 09:53:04] [INFO ] Deduced a trap composed of 224 places in 359 ms of which 5 ms to minimize.
[2024-06-07 09:53:04] [INFO ] Deduced a trap composed of 221 places in 338 ms of which 5 ms to minimize.
[2024-06-07 09:53:04] [INFO ] Deduced a trap composed of 81 places in 230 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2493 variables, 5/981 constraints. Problems are: Problem set: 10 solved, 2 unsolved
[2024-06-07 09:53:05] [INFO ] Deduced a trap composed of 200 places in 214 ms of which 3 ms to minimize.
[2024-06-07 09:53:05] [INFO ] Deduced a trap composed of 125 places in 119 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2493 variables, 2/983 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2493 variables, 0/983 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/2494 variables, 1/984 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2494 variables, 0/984 constraints. Problems are: Problem set: 10 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2494/2494 variables, and 984 constraints, problems are : Problem set: 10 solved, 2 unsolved in 5024 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 869/869 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 11/11 constraints]
After SMT, in 10094ms problems are : Problem set: 10 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 73 out of 869 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 869/869 places, 1625/1625 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 869 transition count 1624
Applied a total of 1 rules in 2390 ms. Remains 869 /869 variables (removed 0) and now considering 1624/1625 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2409 ms. Remains : 869/869 places, 1624/1625 transitions.
RANDOM walk for 40000 steps (8 resets) in 1335 ms. (29 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 296 ms. (134 steps per ms) remains 1/2 properties
FORMULA BlocksWorld-PT-05-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 391 ms. (102 steps per ms) remains 1/1 properties
// Phase 1: matrix 1624 rows 869 cols
[2024-06-07 09:53:09] [INFO ] Computed 57 invariants in 12 ms
[2024-06-07 09:53:09] [INFO ] State equation strengthened by 44 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 765/806 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/806 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 63/869 variables, 14/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/869 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1624/2493 variables, 869/926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2493 variables, 44/970 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2493 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2493 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2493/2493 variables, and 970 constraints, problems are : Problem set: 0 solved, 1 unsolved in 695 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 869/869 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 765/806 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/806 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 63/869 variables, 14/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/869 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1624/2493 variables, 869/926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2493 variables, 44/970 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2493 variables, 1/971 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2493 variables, 0/971 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-07 09:53:11] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
[2024-06-07 09:53:11] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/2493 variables, 2/973 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2493 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/2493 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2493/2493 variables, and 973 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1428 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 869/869 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 2174ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 182 ms.
Support contains 41 out of 869 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 869/869 places, 1624/1624 transitions.
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :92 after 1020
Applied a total of 0 rules in 1754 ms. Remains 869 /869 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1754 ms. Remains : 869/869 places, 1624/1624 transitions.
RANDOM walk for 40000 steps (8 resets) in 1252 ms. (31 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 570858 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :0 out of 1
Probabilistic random walk after 570858 steps, saw 485573 distinct states, run finished after 3005 ms. (steps per millisecond=189 ) properties seen :0
[2024-06-07 09:53:16] [INFO ] Invariant cache hit.
[2024-06-07 09:53:16] [INFO ] State equation strengthened by 44 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 765/806 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/806 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 63/869 variables, 14/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/869 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1624/2493 variables, 869/926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2493 variables, 44/970 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2493 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2493 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2493/2493 variables, and 970 constraints, problems are : Problem set: 0 solved, 1 unsolved in 702 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 869/869 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 765/806 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-07 09:53:17] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/806 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-07 09:53:17] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/806 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/806 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 63/869 variables, 14/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-07 09:53:17] [INFO ] Deduced a trap composed of 81 places in 67 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/869 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/869 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1624/2493 variables, 869/929 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2493 variables, 44/973 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2493 variables, 1/974 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-07 09:53:18] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 2 ms to minimize.
[2024-06-07 09:53:19] [INFO ] Deduced a trap composed of 56 places in 282 ms of which 4 ms to minimize.
[2024-06-07 09:53:19] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2024-06-07 09:53:19] [INFO ] Deduced a trap composed of 161 places in 146 ms of which 3 ms to minimize.
[2024-06-07 09:53:19] [INFO ] Deduced a trap composed of 176 places in 170 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2493 variables, 5/979 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2493 variables, 0/979 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2493 variables, 0/979 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2493/2493 variables, and 979 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2358 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 869/869 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 3090ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 197 ms.
Support contains 41 out of 869 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 869/869 places, 1624/1624 transitions.
Applied a total of 0 rules in 1724 ms. Remains 869 /869 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1725 ms. Remains : 869/869 places, 1624/1624 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 869/869 places, 1624/1624 transitions.
Applied a total of 0 rules in 1649 ms. Remains 869 /869 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
[2024-06-07 09:53:23] [INFO ] Invariant cache hit.
[2024-06-07 09:53:24] [INFO ] Implicit Places using invariants in 546 ms returned []
[2024-06-07 09:53:24] [INFO ] Invariant cache hit.
[2024-06-07 09:53:24] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-07 09:53:25] [INFO ] Implicit Places using invariants and state equation in 1503 ms returned []
Implicit Place search using SMT with State Equation took 2060 ms to find 0 implicit places.
[2024-06-07 09:53:25] [INFO ] Redundant transitions in 113 ms returned []
Running 1618 sub problems to find dead transitions.
[2024-06-07 09:53:25] [INFO ] Invariant cache hit.
[2024-06-07 09:53:25] [INFO ] State equation strengthened by 44 read => feed constraints.
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :1020 after 3440
Problem TDEAD1 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1514 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1622 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/863 variables, 46/46 constraints. Problems are: Problem set: 46 solved, 1572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 863/2493 variables, and 46 constraints, problems are : Problem set: 46 solved, 1572 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/869 constraints, ReadFeed: 0/44 constraints, PredecessorRefiner: 1595/812 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 46 solved, 1572 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 6/6 constraints. Problems are: Problem set: 46 solved, 1572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/840 variables, 0/6 constraints. Problems are: Problem set: 46 solved, 1572 unsolved
Problem TDEAD172 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1568 is UNSAT
Problem TDEAD1604 is UNSAT
At refinement iteration 2 (OVERLAPS) 29/869 variables, 51/57 constraints. Problems are: Problem set: 56 solved, 1562 unsolved
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :3440 after 24226
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 869/2493 variables, and 57 constraints, problems are : Problem set: 56 solved, 1562 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/869 constraints, ReadFeed: 0/44 constraints, PredecessorRefiner: 783/812 constraints, Known Traps: 0/0 constraints]
After SMT, in 73546ms problems are : Problem set: 56 solved, 1562 unsolved
Search for dead transitions found 56 dead transitions in 73566ms
Found 56 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 56 transitions
Dead transitions reduction (with SMT) removed 56 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 869/869 places, 1568/1624 transitions.
Graph (complete) has 4004 edges and 869 vertex of which 843 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.2 ms
Discarding 26 places :
Also discarding 0 output transitions
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 1 rules in 1634 ms. Remains 843 /869 variables (removed 26) and now considering 1568/1568 (removed 0) transitions.
// Phase 1: matrix 1568 rows 843 cols
[2024-06-07 09:54:40] [INFO ] Computed 59 invariants in 14 ms
[2024-06-07 09:54:41] [INFO ] Implicit Places using invariants in 655 ms returned []
[2024-06-07 09:54:41] [INFO ] Invariant cache hit.
[2024-06-07 09:54:42] [INFO ] Implicit Places using invariants and state equation in 1083 ms returned []
Implicit Place search using SMT with State Equation took 1742 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 843/869 places, 1568/1624 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 80786 ms. Remains : 843/869 places, 1568/1624 transitions.
Deduced a syphon composed of 2 places in 12 ms
Reduce places removed 2 places and 0 transitions.
RANDOM walk for 30566 steps (6 resets) in 783 ms. (38 steps per ms) remains 0/1 properties
FORMULA BlocksWorld-PT-05-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 114739 ms.

BK_STOP 1717754083111

--------------------
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="BlocksWorld-PT-05"
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 BlocksWorld-PT-05, 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 r602-tall-171774424600198"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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