Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r602-tall-171774424600191.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-04, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r602-tall-171774424600191
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.1M
-rw-r--r-- 1 mcc users 120K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 557K Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 164K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 943K Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 20K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 99K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 405K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 258K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 750K Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.0M Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 11K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 26K 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 532K 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-04-ReachabilityFireability-2024-00
FORMULA_NAME BlocksWorld-PT-04-ReachabilityFireability-2024-01
FORMULA_NAME BlocksWorld-PT-04-ReachabilityFireability-2024-02
FORMULA_NAME BlocksWorld-PT-04-ReachabilityFireability-2024-03
FORMULA_NAME BlocksWorld-PT-04-ReachabilityFireability-2024-04
FORMULA_NAME BlocksWorld-PT-04-ReachabilityFireability-2024-05
FORMULA_NAME BlocksWorld-PT-04-ReachabilityFireability-2024-06
FORMULA_NAME BlocksWorld-PT-04-ReachabilityFireability-2024-07
FORMULA_NAME BlocksWorld-PT-04-ReachabilityFireability-2024-08
FORMULA_NAME BlocksWorld-PT-04-ReachabilityFireability-2024-09
FORMULA_NAME BlocksWorld-PT-04-ReachabilityFireability-2024-10
FORMULA_NAME BlocksWorld-PT-04-ReachabilityFireability-2024-11
FORMULA_NAME BlocksWorld-PT-04-ReachabilityFireability-2024-12
FORMULA_NAME BlocksWorld-PT-04-ReachabilityFireability-2024-13
FORMULA_NAME BlocksWorld-PT-04-ReachabilityFireability-2024-14
FORMULA_NAME BlocksWorld-PT-04-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717752041223

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-06-07 09:20:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-07 09:20:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 09:20:42] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2024-06-07 09:20:42] [INFO ] Transformed 599 places.
[2024-06-07 09:20:42] [INFO ] Transformed 1105 transitions.
[2024-06-07 09:20:42] [INFO ] Found NUPN structural information;
[2024-06-07 09:20:42] [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]
[2024-06-07 09:20:42] [INFO ] Parsed PT model containing 599 places and 1105 transitions and 5512 arcs in 235 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 108 ms.
Working with output stream class java.io.PrintStream
FORMULA BlocksWorld-PT-04-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-04-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-04-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Reduction of identical properties reduced properties to check from 13 to 12
[2024-06-07 09:20:44] [INFO ] Flatten gal took : 394 ms
[2024-06-07 09:20:44] [INFO ] Flatten gal took : 287 ms
[2024-06-07 09:20:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5421873600734312568.gal : 103 ms
[2024-06-07 09:20:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6552079982346589164.prop : 101 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/ReachabilityCardinality5421873600734312568.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6552079982346589164.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 ...328
Loading property file /tmp/ReachabilityCardinality6552079982346589164.prop.
RANDOM walk for 40000 steps (8 resets) in 9001 ms. (4 steps per ms) remains 8/12 properties
FORMULA BlocksWorld-PT-04-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-04-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-04-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-04-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 12862 ms. (3 steps per ms) remains 8/8 properties
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 3
BEST_FIRST walk for 40003 steps (8 resets) in 10649 ms. (3 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1253 ms. (31 steps per ms) remains 8/8 properties
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :3 after 11
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :11 after 13
BEST_FIRST walk for 40003 steps (8 resets) in 16755 ms. (2 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 948 ms. (42 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 933 ms. (42 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 768 ms. (52 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1097 ms. (36 steps per ms) remains 8/8 properties
// Phase 1: matrix 1105 rows 599 cols
[2024-06-07 09:20:57] [INFO ] Computed 47 invariants in 22 ms
[2024-06-07 09:20:57] [INFO ] State equation strengthened by 41 read => feed constraints.
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :13 after 18
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :18 after 39
Problem BlocksWorld-PT-04-ReachabilityFireability-2024-08 is UNSAT
FORMULA BlocksWorld-PT-04-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-04-ReachabilityFireability-2024-12 is UNSAT
FORMULA BlocksWorld-PT-04-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-04-ReachabilityFireability-2024-14 is UNSAT
FORMULA BlocksWorld-PT-04-ReachabilityFireability-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-04-ReachabilityFireability-2024-15 is UNSAT
FORMULA BlocksWorld-PT-04-ReachabilityFireability-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 47/47 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/47 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1104/1703 variables, 599/646 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1703 variables, 40/686 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1703 variables, 0/686 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/1704 variables, 1/687 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1704 variables, 0/687 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/1704 variables, 0/687 constraints. Problems are: Problem set: 4 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1704/1704 variables, and 687 constraints, problems are : Problem set: 4 solved, 4 unsolved in 3093 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, State Equation: 599/599 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 5/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 47/47 constraints. Problems are: Problem set: 4 solved, 4 unsolved
[2024-06-07 09:21:22] [INFO ] Deduced a trap composed of 100 places in 169 ms of which 19 ms to minimize.
[2024-06-07 09:21:23] [INFO ] Deduced a trap composed of 24 places in 344 ms of which 4 ms to minimize.
[2024-06-07 09:21:23] [INFO ] Deduced a trap composed of 24 places in 292 ms of which 5 ms to minimize.
[2024-06-07 09:21:23] [INFO ] Deduced a trap composed of 25 places in 272 ms of which 11 ms to minimize.
[2024-06-07 09:21:24] [INFO ] Deduced a trap composed of 24 places in 272 ms of which 4 ms to minimize.
[2024-06-07 09:21:24] [INFO ] Deduced a trap composed of 24 places in 283 ms of which 4 ms to minimize.
[2024-06-07 09:21:24] [INFO ] Deduced a trap composed of 114 places in 288 ms of which 3 ms to minimize.
[2024-06-07 09:21:25] [INFO ] Deduced a trap composed of 24 places in 273 ms of which 5 ms to minimize.
[2024-06-07 09:21:25] [INFO ] Deduced a trap composed of 46 places in 280 ms of which 4 ms to minimize.
[2024-06-07 09:21:25] [INFO ] Deduced a trap composed of 100 places in 266 ms of which 3 ms to minimize.
[2024-06-07 09:21:25] [INFO ] Deduced a trap composed of 66 places in 271 ms of which 4 ms to minimize.
[2024-06-07 09:21:26] [INFO ] Deduced a trap composed of 100 places in 265 ms of which 3 ms to minimize.
[2024-06-07 09:21:26] [INFO ] Deduced a trap composed of 66 places in 277 ms of which 3 ms to minimize.
[2024-06-07 09:21:26] [INFO ] Deduced a trap composed of 46 places in 287 ms of which 4 ms to minimize.
SMT process timed out in 29719ms, After SMT, problems are : Problem set: 4 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 599 out of 599 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 599/599 places, 1105/1105 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 599 transition count 1104
Applied a total of 1 rules in 138 ms. Remains 599 /599 variables (removed 0) and now considering 1104/1105 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 599/599 places, 1104/1105 transitions.
RANDOM walk for 40000 steps (8 resets) in 8258 ms. (4 steps per ms) remains 4/4 properties
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :39 after 272
BEST_FIRST walk for 40002 steps (8 resets) in 13829 ms. (2 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 10099 ms. (3 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1063 ms. (37 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 17018 ms. (2 steps per ms) remains 4/4 properties
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :272 after 495
Interrupted probabilistic random walk after 626234 steps, run timeout after 39001 ms. (steps per millisecond=16 ) properties seen :0 out of 4
Probabilistic random walk after 626234 steps, saw 501380 distinct states, run finished after 39004 ms. (steps per millisecond=16 ) properties seen :0
// Phase 1: matrix 1104 rows 599 cols
[2024-06-07 09:22:19] [INFO ] Computed 47 invariants in 9 ms
[2024-06-07 09:22:19] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1104/1703 variables, 599/646 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1703 variables, 40/686 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1703 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/1703 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1703/1703 variables, and 686 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2014 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, State Equation: 599/599 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-07 09:22:42] [INFO ] Deduced a trap composed of 100 places in 84 ms of which 2 ms to minimize.
[2024-06-07 09:22:42] [INFO ] Deduced a trap composed of 24 places in 253 ms of which 3 ms to minimize.
[2024-06-07 09:22:42] [INFO ] Deduced a trap composed of 24 places in 255 ms of which 3 ms to minimize.
[2024-06-07 09:22:43] [INFO ] Deduced a trap composed of 25 places in 261 ms of which 3 ms to minimize.
[2024-06-07 09:22:43] [INFO ] Deduced a trap composed of 24 places in 260 ms of which 4 ms to minimize.
[2024-06-07 09:22:43] [INFO ] Deduced a trap composed of 24 places in 254 ms of which 3 ms to minimize.
[2024-06-07 09:22:44] [INFO ] Deduced a trap composed of 114 places in 259 ms of which 3 ms to minimize.
[2024-06-07 09:22:44] [INFO ] Deduced a trap composed of 24 places in 258 ms of which 4 ms to minimize.
[2024-06-07 09:22:44] [INFO ] Deduced a trap composed of 46 places in 256 ms of which 4 ms to minimize.
[2024-06-07 09:22:45] [INFO ] Deduced a trap composed of 100 places in 255 ms of which 3 ms to minimize.
[2024-06-07 09:22:45] [INFO ] Deduced a trap composed of 66 places in 263 ms of which 4 ms to minimize.
[2024-06-07 09:22:45] [INFO ] Deduced a trap composed of 100 places in 257 ms of which 3 ms to minimize.
[2024-06-07 09:22:45] [INFO ] Deduced a trap composed of 66 places in 260 ms of which 4 ms to minimize.
[2024-06-07 09:22:46] [INFO ] Deduced a trap composed of 46 places in 262 ms of which 4 ms to minimize.
[2024-06-07 09:22:46] [INFO ] Deduced a trap composed of 66 places in 260 ms of which 3 ms to minimize.
[2024-06-07 09:22:46] [INFO ] Deduced a trap composed of 24 places in 258 ms of which 4 ms to minimize.
[2024-06-07 09:22:47] [INFO ] Deduced a trap composed of 66 places in 258 ms of which 3 ms to minimize.
[2024-06-07 09:22:47] [INFO ] Deduced a trap composed of 24 places in 253 ms of which 4 ms to minimize.
[2024-06-07 09:22:47] [INFO ] Deduced a trap composed of 114 places in 262 ms of which 3 ms to minimize.
[2024-06-07 09:22:48] [INFO ] Deduced a trap composed of 24 places in 266 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-07 09:22:48] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-07 09:22:48] [INFO ] Deduced a trap composed of 46 places in 260 ms of which 3 ms to minimize.
[2024-06-07 09:22:49] [INFO ] Deduced a trap composed of 84 places in 260 ms of which 4 ms to minimize.
[2024-06-07 09:22:49] [INFO ] Deduced a trap composed of 66 places in 255 ms of which 4 ms to minimize.
[2024-06-07 09:22:49] [INFO ] Deduced a trap composed of 156 places in 365 ms of which 4 ms to minimize.
[2024-06-07 09:22:50] [INFO ] Deduced a trap composed of 84 places in 260 ms of which 4 ms to minimize.
[2024-06-07 09:22:50] [INFO ] Deduced a trap composed of 66 places in 256 ms of which 4 ms to minimize.
[2024-06-07 09:22:50] [INFO ] Deduced a trap composed of 66 places in 254 ms of which 4 ms to minimize.
[2024-06-07 09:22:51] [INFO ] Deduced a trap composed of 144 places in 256 ms of which 4 ms to minimize.
[2024-06-07 09:22:51] [INFO ] Deduced a trap composed of 66 places in 255 ms of which 3 ms to minimize.
[2024-06-07 09:22:51] [INFO ] Deduced a trap composed of 66 places in 258 ms of which 3 ms to minimize.
[2024-06-07 09:22:52] [INFO ] Deduced a trap composed of 126 places in 258 ms of which 3 ms to minimize.
[2024-06-07 09:22:52] [INFO ] Deduced a trap composed of 66 places in 260 ms of which 4 ms to minimize.
[2024-06-07 09:22:52] [INFO ] Deduced a trap composed of 24 places in 254 ms of which 3 ms to minimize.
[2024-06-07 09:22:52] [INFO ] Deduced a trap composed of 66 places in 253 ms of which 3 ms to minimize.
[2024-06-07 09:22:53] [INFO ] Deduced a trap composed of 24 places in 261 ms of which 4 ms to minimize.
[2024-06-07 09:22:53] [INFO ] Deduced a trap composed of 24 places in 258 ms of which 4 ms to minimize.
[2024-06-07 09:22:53] [INFO ] Deduced a trap composed of 66 places in 254 ms of which 3 ms to minimize.
[2024-06-07 09:22:54] [INFO ] Deduced a trap composed of 100 places in 259 ms of which 4 ms to minimize.
[2024-06-07 09:22:54] [INFO ] Deduced a trap composed of 66 places in 257 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/599 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-07 09:22:55] [INFO ] Deduced a trap composed of 100 places in 258 ms of which 4 ms to minimize.
[2024-06-07 09:22:55] [INFO ] Deduced a trap composed of 47 places in 265 ms of which 11 ms to minimize.
[2024-06-07 09:22:55] [INFO ] Deduced a trap composed of 66 places in 260 ms of which 4 ms to minimize.
[2024-06-07 09:22:56] [INFO ] Deduced a trap composed of 66 places in 256 ms of which 3 ms to minimize.
[2024-06-07 09:22:56] [INFO ] Deduced a trap composed of 66 places in 255 ms of which 4 ms to minimize.
[2024-06-07 09:22:56] [INFO ] Deduced a trap composed of 24 places in 255 ms of which 3 ms to minimize.
[2024-06-07 09:22:57] [INFO ] Deduced a trap composed of 154 places in 267 ms of which 4 ms to minimize.
[2024-06-07 09:22:57] [INFO ] Deduced a trap composed of 24 places in 265 ms of which 3 ms to minimize.
[2024-06-07 09:22:57] [INFO ] Deduced a trap composed of 24 places in 260 ms of which 4 ms to minimize.
[2024-06-07 09:22:58] [INFO ] Deduced a trap composed of 66 places in 260 ms of which 4 ms to minimize.
[2024-06-07 09:22:58] [INFO ] Deduced a trap composed of 100 places in 269 ms of which 3 ms to minimize.
[2024-06-07 09:22:58] [INFO ] Deduced a trap composed of 66 places in 258 ms of which 4 ms to minimize.
[2024-06-07 09:22:58] [INFO ] Deduced a trap composed of 126 places in 254 ms of which 3 ms to minimize.
[2024-06-07 09:22:59] [INFO ] Deduced a trap composed of 66 places in 257 ms of which 3 ms to minimize.
[2024-06-07 09:22:59] [INFO ] Deduced a trap composed of 66 places in 257 ms of which 4 ms to minimize.
[2024-06-07 09:22:59] [INFO ] Deduced a trap composed of 114 places in 272 ms of which 4 ms to minimize.
[2024-06-07 09:23:00] [INFO ] Deduced a trap composed of 100 places in 257 ms of which 3 ms to minimize.
[2024-06-07 09:23:00] [INFO ] Deduced a trap composed of 114 places in 260 ms of which 4 ms to minimize.
[2024-06-07 09:23:00] [INFO ] Deduced a trap composed of 66 places in 261 ms of which 4 ms to minimize.
[2024-06-07 09:23:01] [INFO ] Deduced a trap composed of 154 places in 263 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/599 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-07 09:23:01] [INFO ] Deduced a trap composed of 66 places in 261 ms of which 3 ms to minimize.
[2024-06-07 09:23:02] [INFO ] Deduced a trap composed of 66 places in 265 ms of which 4 ms to minimize.
[2024-06-07 09:23:02] [INFO ] Deduced a trap composed of 66 places in 273 ms of which 3 ms to minimize.
Problem BlocksWorld-PT-04-ReachabilityFireability-2024-02 is UNSAT
FORMULA BlocksWorld-PT-04-ReachabilityFireability-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
[2024-06-07 09:23:02] [INFO ] Deduced a trap composed of 84 places in 136 ms of which 2 ms to minimize.
[2024-06-07 09:23:03] [INFO ] Deduced a trap composed of 144 places in 136 ms of which 2 ms to minimize.
[2024-06-07 09:23:03] [INFO ] Deduced a trap composed of 46 places in 120 ms of which 2 ms to minimize.
[2024-06-07 09:23:03] [INFO ] Deduced a trap composed of 84 places in 123 ms of which 2 ms to minimize.
[2024-06-07 09:23:03] [INFO ] Deduced a trap composed of 136 places in 121 ms of which 2 ms to minimize.
[2024-06-07 09:23:03] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 2 ms to minimize.
[2024-06-07 09:23:03] [INFO ] Deduced a trap composed of 84 places in 144 ms of which 2 ms to minimize.
[2024-06-07 09:23:04] [INFO ] Deduced a trap composed of 150 places in 154 ms of which 2 ms to minimize.
[2024-06-07 09:23:04] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 3 ms to minimize.
[2024-06-07 09:23:04] [INFO ] Deduced a trap composed of 154 places in 160 ms of which 2 ms to minimize.
[2024-06-07 09:23:04] [INFO ] Deduced a trap composed of 156 places in 174 ms of which 3 ms to minimize.
[2024-06-07 09:23:05] [INFO ] Deduced a trap composed of 156 places in 182 ms of which 3 ms to minimize.
[2024-06-07 09:23:05] [INFO ] Deduced a trap composed of 154 places in 194 ms of which 3 ms to minimize.
[2024-06-07 09:23:05] [INFO ] Deduced a trap composed of 150 places in 206 ms of which 3 ms to minimize.
[2024-06-07 09:23:05] [INFO ] Deduced a trap composed of 144 places in 214 ms of which 3 ms to minimize.
[2024-06-07 09:23:06] [INFO ] Deduced a trap composed of 136 places in 221 ms of which 3 ms to minimize.
[2024-06-07 09:23:06] [INFO ] Deduced a trap composed of 126 places in 233 ms of which 4 ms to minimize.
Problem BlocksWorld-PT-04-ReachabilityFireability-2024-02 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/599 variables, 20/127 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-07 09:23:07] [INFO ] Deduced a trap composed of 114 places in 241 ms of which 3 ms to minimize.
[2024-06-07 09:23:07] [INFO ] Deduced a trap composed of 46 places in 255 ms of which 4 ms to minimize.
[2024-06-07 09:23:07] [INFO ] Deduced a trap composed of 156 places in 255 ms of which 3 ms to minimize.
[2024-06-07 09:23:08] [INFO ] Deduced a trap composed of 84 places in 253 ms of which 4 ms to minimize.
[2024-06-07 09:23:08] [INFO ] Deduced a trap composed of 46 places in 241 ms of which 4 ms to minimize.
[2024-06-07 09:23:08] [INFO ] Deduced a trap composed of 126 places in 223 ms of which 3 ms to minimize.
[2024-06-07 09:23:09] [INFO ] Deduced a trap composed of 66 places in 214 ms of which 3 ms to minimize.
[2024-06-07 09:23:09] [INFO ] Deduced a trap composed of 144 places in 217 ms of which 4 ms to minimize.
[2024-06-07 09:23:09] [INFO ] Deduced a trap composed of 136 places in 222 ms of which 4 ms to minimize.
[2024-06-07 09:23:09] [INFO ] Deduced a trap composed of 126 places in 229 ms of which 4 ms to minimize.
[2024-06-07 09:23:10] [INFO ] Deduced a trap composed of 114 places in 252 ms of which 3 ms to minimize.
[2024-06-07 09:23:10] [INFO ] Deduced a trap composed of 100 places in 247 ms of which 3 ms to minimize.
[2024-06-07 09:23:10] [INFO ] Deduced a trap composed of 84 places in 255 ms of which 4 ms to minimize.
[2024-06-07 09:23:11] [INFO ] Deduced a trap composed of 100 places in 241 ms of which 4 ms to minimize.
[2024-06-07 09:23:11] [INFO ] Deduced a trap composed of 84 places in 256 ms of which 3 ms to minimize.
[2024-06-07 09:23:11] [INFO ] Deduced a trap composed of 46 places in 254 ms of which 4 ms to minimize.
[2024-06-07 09:23:12] [INFO ] Deduced a trap composed of 46 places in 254 ms of which 3 ms to minimize.
[2024-06-07 09:23:12] [INFO ] Deduced a trap composed of 114 places in 253 ms of which 3 ms to minimize.
[2024-06-07 09:23:12] [INFO ] Deduced a trap composed of 84 places in 253 ms of which 3 ms to minimize.
[2024-06-07 09:23:13] [INFO ] Deduced a trap composed of 84 places in 259 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/599 variables, 20/147 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-07 09:23:13] [INFO ] Deduced a trap composed of 136 places in 252 ms of which 4 ms to minimize.
[2024-06-07 09:23:14] [INFO ] Deduced a trap composed of 114 places in 254 ms of which 4 ms to minimize.
[2024-06-07 09:23:14] [INFO ] Deduced a trap composed of 150 places in 248 ms of which 4 ms to minimize.
[2024-06-07 09:23:14] [INFO ] Deduced a trap composed of 150 places in 250 ms of which 4 ms to minimize.
[2024-06-07 09:23:15] [INFO ] Deduced a trap composed of 114 places in 253 ms of which 4 ms to minimize.
[2024-06-07 09:23:15] [INFO ] Deduced a trap composed of 84 places in 258 ms of which 4 ms to minimize.
[2024-06-07 09:23:15] [INFO ] Deduced a trap composed of 136 places in 248 ms of which 3 ms to minimize.
[2024-06-07 09:23:16] [INFO ] Deduced a trap composed of 150 places in 253 ms of which 4 ms to minimize.
[2024-06-07 09:23:16] [INFO ] Deduced a trap composed of 84 places in 248 ms of which 4 ms to minimize.
[2024-06-07 09:23:16] [INFO ] Deduced a trap composed of 66 places in 253 ms of which 3 ms to minimize.
[2024-06-07 09:23:17] [INFO ] Deduced a trap composed of 84 places in 260 ms of which 3 ms to minimize.
[2024-06-07 09:23:17] [INFO ] Deduced a trap composed of 156 places in 260 ms of which 3 ms to minimize.
[2024-06-07 09:23:17] [INFO ] Deduced a trap composed of 84 places in 263 ms of which 3 ms to minimize.
[2024-06-07 09:23:18] [INFO ] Deduced a trap composed of 114 places in 263 ms of which 3 ms to minimize.
[2024-06-07 09:23:18] [INFO ] Deduced a trap composed of 84 places in 260 ms of which 3 ms to minimize.
[2024-06-07 09:23:18] [INFO ] Deduced a trap composed of 136 places in 265 ms of which 3 ms to minimize.
[2024-06-07 09:23:19] [INFO ] Deduced a trap composed of 126 places in 267 ms of which 4 ms to minimize.
[2024-06-07 09:23:19] [INFO ] Deduced a trap composed of 84 places in 258 ms of which 4 ms to minimize.
[2024-06-07 09:23:19] [INFO ] Deduced a trap composed of 114 places in 266 ms of which 4 ms to minimize.
[2024-06-07 09:23:20] [INFO ] Deduced a trap composed of 114 places in 265 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/599 variables, 20/167 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-07 09:23:20] [INFO ] Deduced a trap composed of 24 places in 250 ms of which 4 ms to minimize.
[2024-06-07 09:23:21] [INFO ] Deduced a trap composed of 126 places in 258 ms of which 3 ms to minimize.
[2024-06-07 09:23:21] [INFO ] Deduced a trap composed of 46 places in 254 ms of which 3 ms to minimize.
[2024-06-07 09:23:21] [INFO ] Deduced a trap composed of 100 places in 251 ms of which 3 ms to minimize.
[2024-06-07 09:23:22] [INFO ] Deduced a trap composed of 84 places in 268 ms of which 3 ms to minimize.
[2024-06-07 09:23:22] [INFO ] Deduced a trap composed of 46 places in 259 ms of which 4 ms to minimize.
[2024-06-07 09:23:22] [INFO ] Deduced a trap composed of 114 places in 255 ms of which 4 ms to minimize.
[2024-06-07 09:23:23] [INFO ] Deduced a trap composed of 84 places in 258 ms of which 4 ms to minimize.
[2024-06-07 09:23:23] [INFO ] Deduced a trap composed of 84 places in 254 ms of which 4 ms to minimize.
[2024-06-07 09:23:23] [INFO ] Deduced a trap composed of 66 places in 258 ms of which 3 ms to minimize.
[2024-06-07 09:23:24] [INFO ] Deduced a trap composed of 84 places in 254 ms of which 4 ms to minimize.
[2024-06-07 09:23:24] [INFO ] Deduced a trap composed of 24 places in 255 ms of which 3 ms to minimize.
[2024-06-07 09:23:24] [INFO ] Deduced a trap composed of 100 places in 251 ms of which 4 ms to minimize.
[2024-06-07 09:23:25] [INFO ] Deduced a trap composed of 156 places in 259 ms of which 3 ms to minimize.
[2024-06-07 09:23:25] [INFO ] Deduced a trap composed of 84 places in 260 ms of which 4 ms to minimize.
[2024-06-07 09:23:25] [INFO ] Deduced a trap composed of 100 places in 247 ms of which 3 ms to minimize.
[2024-06-07 09:23:26] [INFO ] Deduced a trap composed of 66 places in 259 ms of which 4 ms to minimize.
[2024-06-07 09:23:26] [INFO ] Deduced a trap composed of 150 places in 253 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 599/1703 variables, and 185 constraints, problems are : Problem set: 1 solved, 3 unsolved in 45009 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, State Equation: 0/599 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 138/138 constraints]
After SMT, in 67391ms problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 599 out of 599 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 599/599 places, 1104/1104 transitions.
Applied a total of 0 rules in 63 ms. Remains 599 /599 variables (removed 0) and now considering 1104/1104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 599/599 places, 1104/1104 transitions.
RANDOM walk for 40000 steps (8 resets) in 5459 ms. (7 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 15010 ms. (2 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1060 ms. (37 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 19536 ms. (2 steps per ms) remains 3/3 properties
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :495 after 1482
Interrupted probabilistic random walk after 540259 steps, run timeout after 30001 ms. (steps per millisecond=18 ) properties seen :0 out of 3
Probabilistic random walk after 540259 steps, saw 432996 distinct states, run finished after 30002 ms. (steps per millisecond=18 ) properties seen :0
[2024-06-07 09:24:07] [INFO ] Invariant cache hit.
[2024-06-07 09:24:07] [INFO ] State equation strengthened by 40 read => feed constraints.

BK_STOP 1717752252004

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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-04"
export BK_EXAMINATION="ReachabilityFireability"
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-04, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r602-tall-171774424600191"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BlocksWorld-PT-04.tgz
mv BlocksWorld-PT-04 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;