About the Execution of ITS-Tools for BlocksWorld-PT-05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16205.479 | 3600000.00 | 11067793.00 | 4606.40 | TFF?FFFTTTTTTTFF | normal |
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-171774424600199.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 ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r602-tall-171774424600199
=====================================================================
--------------------
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-ReachabilityFireability-2024-00
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-01
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-02
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-03
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-04
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-05
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-06
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-07
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-08
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-09
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-10
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-11
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-12
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-13
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-14
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717754095176
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-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-06-07 09:54:56] [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:54:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 09:54:56] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2024-06-07 09:54:56] [INFO ] Transformed 869 places.
[2024-06-07 09:54:56] [INFO ] Transformed 1625 transitions.
[2024-06-07 09:54:56] [INFO ] Found NUPN structural information;
[2024-06-07 09:54:56] [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:54:56] [INFO ] Parsed PT model containing 869 places and 1625 transitions and 8110 arcs in 300 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 161 ms.
Working with output stream class java.io.PrintStream
FORMULA BlocksWorld-PT-05-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-07 09:54:58] [INFO ] Flatten gal took : 557 ms
[2024-06-07 09:54:59] [INFO ] Flatten gal took : 343 ms
[2024-06-07 09:54:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16777839054015441742.gal : 108 ms
[2024-06-07 09:54:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8237824757626149434.prop : 86 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/ReachabilityCardinality16777839054015441742.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8237824757626149434.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
Loading property file /tmp/ReachabilityCardinality8237824757626149434.prop.
RANDOM walk for 40000 steps (8 resets) in 11799 ms. (3 steps per ms) remains 11/15 properties
FORMULA BlocksWorld-PT-05-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-05-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-05-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-05-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 4297 ms. (9 steps per ms) remains 11/11 properties
BEST_FIRST walk for 34196 steps (8 resets) in 20005 ms. (1 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 5701 ms. (7 steps per ms) remains 11/11 properties
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 92
BEST_FIRST walk for 40003 steps (8 resets) in 7320 ms. (5 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4414 ms. (9 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1249 ms. (32 steps per ms) remains 11/11 properties
BEST_FIRST walk for 36394 steps (8 resets) in 20009 ms. (1 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1054 ms. (37 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1228 ms. (32 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1103 ms. (36 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1009 ms. (39 steps per ms) remains 11/11 properties
// Phase 1: matrix 1625 rows 869 cols
[2024-06-07 09:55:17] [INFO ] Computed 57 invariants in 36 ms
[2024-06-07 09:55:18] [INFO ] State equation strengthened by 45 read => feed constraints.
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :92 after 1020
Problem BlocksWorld-PT-05-ReachabilityFireability-2024-07 is UNSAT
FORMULA BlocksWorld-PT-05-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-05-ReachabilityFireability-2024-01 is UNSAT
FORMULA BlocksWorld-PT-05-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-05-ReachabilityFireability-2024-04 is UNSAT
FORMULA BlocksWorld-PT-05-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-05-ReachabilityFireability-2024-05 is UNSAT
FORMULA BlocksWorld-PT-05-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-05-ReachabilityFireability-2024-06 is UNSAT
FORMULA BlocksWorld-PT-05-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-05-ReachabilityFireability-2024-09 is UNSAT
FORMULA BlocksWorld-PT-05-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-05-ReachabilityFireability-2024-12 is UNSAT
FORMULA BlocksWorld-PT-05-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-05-ReachabilityFireability-2024-13 is UNSAT
FORMULA BlocksWorld-PT-05-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-05-ReachabilityFireability-2024-14 is UNSAT
FORMULA BlocksWorld-PT-05-ReachabilityFireability-2024-14 FALSE 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, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/869 variables, 0/57 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 1624/2493 variables, 869/926 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2493 variables, 44/970 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2493 variables, 0/970 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/2494 variables, 1/971 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2494 variables, 0/971 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/2494 variables, 0/971 constraints. Problems are: Problem set: 9 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2494/2494 variables, and 971 constraints, problems are : Problem set: 9 solved, 2 unsolved in 2435 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 869/869 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/869 variables, 57/57 constraints. Problems are: Problem set: 9 solved, 2 unsolved
[2024-06-07 09:55:46] [INFO ] Deduced a trap composed of 81 places in 589 ms of which 78 ms to minimize.
[2024-06-07 09:55:47] [INFO ] Deduced a trap composed of 81 places in 549 ms of which 7 ms to minimize.
[2024-06-07 09:55:48] [INFO ] Deduced a trap composed of 81 places in 585 ms of which 7 ms to minimize.
[2024-06-07 09:55:48] [INFO ] Deduced a trap composed of 81 places in 509 ms of which 6 ms to minimize.
[2024-06-07 09:55:49] [INFO ] Deduced a trap composed of 81 places in 492 ms of which 5 ms to minimize.
[2024-06-07 09:55:49] [INFO ] Deduced a trap composed of 56 places in 453 ms of which 6 ms to minimize.
[2024-06-07 09:55:50] [INFO ] Deduced a trap composed of 81 places in 466 ms of which 6 ms to minimize.
[2024-06-07 09:55:50] [INFO ] Deduced a trap composed of 216 places in 424 ms of which 5 ms to minimize.
SMT process timed out in 32863ms, After SMT, problems are : Problem set: 9 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 869 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 216 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 237 ms. Remains : 869/869 places, 1624/1625 transitions.
RANDOM walk for 40000 steps (8 resets) in 5508 ms. (7 steps per ms) remains 2/2 properties
BEST_FIRST walk for 30045 steps (8 resets) in 20012 ms. (1 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 3889 ms. (10 steps per ms) remains 2/2 properties
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :1020 after 3440
Interrupted probabilistic random walk after 332844 steps, run timeout after 21001 ms. (steps per millisecond=15 ) properties seen :0 out of 2
Probabilistic random walk after 332844 steps, saw 284128 distinct states, run finished after 21005 ms. (steps per millisecond=15 ) properties seen :0
// Phase 1: matrix 1624 rows 869 cols
[2024-06-07 09:56:19] [INFO ] Computed 57 invariants in 11 ms
[2024-06-07 09:56:19] [INFO ] State equation strengthened by 44 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/869 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/869 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 1624/2493 variables, 869/926 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2493 variables, 44/970 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2493 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/2493 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2493/2493 variables, and 970 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1570 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 869/869 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/869 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 09:56:30] [INFO ] Deduced a trap composed of 81 places in 435 ms of which 6 ms to minimize.
[2024-06-07 09:56:31] [INFO ] Deduced a trap composed of 81 places in 433 ms of which 5 ms to minimize.
[2024-06-07 09:56:31] [INFO ] Deduced a trap composed of 81 places in 466 ms of which 6 ms to minimize.
[2024-06-07 09:56:32] [INFO ] Deduced a trap composed of 81 places in 426 ms of which 5 ms to minimize.
[2024-06-07 09:56:32] [INFO ] Deduced a trap composed of 81 places in 425 ms of which 5 ms to minimize.
[2024-06-07 09:56:33] [INFO ] Deduced a trap composed of 56 places in 427 ms of which 6 ms to minimize.
[2024-06-07 09:56:33] [INFO ] Deduced a trap composed of 81 places in 437 ms of which 5 ms to minimize.
[2024-06-07 09:56:34] [INFO ] Deduced a trap composed of 216 places in 431 ms of which 6 ms to minimize.
[2024-06-07 09:56:34] [INFO ] Deduced a trap composed of 81 places in 424 ms of which 5 ms to minimize.
[2024-06-07 09:56:35] [INFO ] Deduced a trap composed of 81 places in 431 ms of which 5 ms to minimize.
[2024-06-07 09:56:35] [INFO ] Deduced a trap composed of 56 places in 427 ms of which 6 ms to minimize.
[2024-06-07 09:56:36] [INFO ] Deduced a trap composed of 225 places in 433 ms of which 6 ms to minimize.
[2024-06-07 09:56:36] [INFO ] Deduced a trap composed of 144 places in 442 ms of which 5 ms to minimize.
[2024-06-07 09:56:37] [INFO ] Deduced a trap composed of 81 places in 441 ms of which 6 ms to minimize.
[2024-06-07 09:56:37] [INFO ] Deduced a trap composed of 81 places in 448 ms of which 6 ms to minimize.
[2024-06-07 09:56:38] [INFO ] Deduced a trap composed of 200 places in 444 ms of which 6 ms to minimize.
[2024-06-07 09:56:39] [INFO ] Deduced a trap composed of 29 places in 446 ms of which 6 ms to minimize.
[2024-06-07 09:56:39] [INFO ] Deduced a trap composed of 200 places in 449 ms of which 6 ms to minimize.
[2024-06-07 09:56:40] [INFO ] Deduced a trap composed of 81 places in 441 ms of which 6 ms to minimize.
[2024-06-07 09:56:40] [INFO ] Deduced a trap composed of 125 places in 448 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/869 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 09:56:41] [INFO ] Deduced a trap composed of 56 places in 447 ms of which 6 ms to minimize.
[2024-06-07 09:56:41] [INFO ] Deduced a trap composed of 189 places in 450 ms of which 5 ms to minimize.
[2024-06-07 09:56:42] [INFO ] Deduced a trap composed of 104 places in 450 ms of which 6 ms to minimize.
[2024-06-07 09:56:42] [INFO ] Deduced a trap composed of 81 places in 462 ms of which 6 ms to minimize.
[2024-06-07 09:56:43] [INFO ] Deduced a trap composed of 81 places in 475 ms of which 6 ms to minimize.
[2024-06-07 09:56:43] [INFO ] Deduced a trap composed of 81 places in 477 ms of which 10 ms to minimize.
[2024-06-07 09:56:44] [INFO ] Deduced a trap composed of 81 places in 477 ms of which 5 ms to minimize.
[2024-06-07 09:56:45] [INFO ] Deduced a trap composed of 125 places in 465 ms of which 6 ms to minimize.
[2024-06-07 09:56:45] [INFO ] Deduced a trap composed of 161 places in 472 ms of which 6 ms to minimize.
[2024-06-07 09:56:46] [INFO ] Deduced a trap composed of 161 places in 459 ms of which 5 ms to minimize.
[2024-06-07 09:56:46] [INFO ] Deduced a trap composed of 81 places in 443 ms of which 5 ms to minimize.
[2024-06-07 09:56:47] [INFO ] Deduced a trap composed of 81 places in 445 ms of which 6 ms to minimize.
[2024-06-07 09:56:47] [INFO ] Deduced a trap composed of 29 places in 456 ms of which 5 ms to minimize.
[2024-06-07 09:56:48] [INFO ] Deduced a trap composed of 29 places in 461 ms of which 6 ms to minimize.
[2024-06-07 09:56:48] [INFO ] Deduced a trap composed of 81 places in 478 ms of which 6 ms to minimize.
[2024-06-07 09:56:49] [INFO ] Deduced a trap composed of 81 places in 481 ms of which 5 ms to minimize.
[2024-06-07 09:56:49] [INFO ] Deduced a trap composed of 176 places in 475 ms of which 6 ms to minimize.
[2024-06-07 09:56:50] [INFO ] Deduced a trap composed of 104 places in 483 ms of which 5 ms to minimize.
[2024-06-07 09:56:51] [INFO ] Deduced a trap composed of 81 places in 487 ms of which 6 ms to minimize.
[2024-06-07 09:56:51] [INFO ] Deduced a trap composed of 200 places in 481 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/869 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 09:56:52] [INFO ] Deduced a trap composed of 29 places in 486 ms of which 6 ms to minimize.
[2024-06-07 09:56:52] [INFO ] Deduced a trap composed of 176 places in 464 ms of which 6 ms to minimize.
[2024-06-07 09:56:53] [INFO ] Deduced a trap composed of 125 places in 482 ms of which 5 ms to minimize.
[2024-06-07 09:56:54] [INFO ] Deduced a trap composed of 161 places in 509 ms of which 5 ms to minimize.
[2024-06-07 09:56:54] [INFO ] Deduced a trap composed of 81 places in 484 ms of which 6 ms to minimize.
[2024-06-07 09:56:55] [INFO ] Deduced a trap composed of 81 places in 452 ms of which 5 ms to minimize.
[2024-06-07 09:56:55] [INFO ] Deduced a trap composed of 81 places in 459 ms of which 6 ms to minimize.
[2024-06-07 09:56:56] [INFO ] Deduced a trap composed of 56 places in 471 ms of which 13 ms to minimize.
[2024-06-07 09:56:56] [INFO ] Deduced a trap composed of 81 places in 461 ms of which 5 ms to minimize.
[2024-06-07 09:56:57] [INFO ] Deduced a trap composed of 81 places in 463 ms of which 6 ms to minimize.
[2024-06-07 09:56:57] [INFO ] Deduced a trap composed of 56 places in 456 ms of which 5 ms to minimize.
[2024-06-07 09:56:58] [INFO ] Deduced a trap composed of 161 places in 464 ms of which 5 ms to minimize.
[2024-06-07 09:56:58] [INFO ] Deduced a trap composed of 221 places in 459 ms of which 6 ms to minimize.
[2024-06-07 09:56:59] [INFO ] Deduced a trap composed of 29 places in 464 ms of which 5 ms to minimize.
[2024-06-07 09:57:00] [INFO ] Deduced a trap composed of 81 places in 438 ms of which 6 ms to minimize.
[2024-06-07 09:57:00] [INFO ] Deduced a trap composed of 29 places in 441 ms of which 5 ms to minimize.
[2024-06-07 09:57:01] [INFO ] Deduced a trap composed of 81 places in 443 ms of which 5 ms to minimize.
[2024-06-07 09:57:01] [INFO ] Deduced a trap composed of 81 places in 459 ms of which 5 ms to minimize.
[2024-06-07 09:57:02] [INFO ] Deduced a trap composed of 29 places in 449 ms of which 5 ms to minimize.
[2024-06-07 09:57:02] [INFO ] Deduced a trap composed of 29 places in 438 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/869 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 09:57:03] [INFO ] Deduced a trap composed of 104 places in 444 ms of which 5 ms to minimize.
[2024-06-07 09:57:03] [INFO ] Deduced a trap composed of 81 places in 439 ms of which 5 ms to minimize.
[2024-06-07 09:57:04] [INFO ] Deduced a trap composed of 209 places in 443 ms of which 5 ms to minimize.
[2024-06-07 09:57:04] [INFO ] Deduced a trap composed of 81 places in 449 ms of which 5 ms to minimize.
Problem BlocksWorld-PT-05-ReachabilityFireability-2024-02 is UNSAT
FORMULA BlocksWorld-PT-05-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
[2024-06-07 09:57:05] [INFO ] Deduced a trap composed of 209 places in 331 ms of which 5 ms to minimize.
[2024-06-07 09:57:05] [INFO ] Deduced a trap composed of 216 places in 325 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/869 variables, 6/123 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/869 variables, 0/123 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1624/2493 variables, 869/992 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2493 variables, 44/1036 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2493 variables, 0/1036 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/2493 variables, 0/1036 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2493/2493 variables, and 1036 constraints, problems are : Problem set: 1 solved, 1 unsolved in 36539 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 869/869 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 66/66 constraints]
After SMT, in 46878ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 104 ms.
Support contains 108 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 1154 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 1154 ms. Remains : 869/869 places, 1624/1624 transitions.
RANDOM walk for 40000 steps (8 resets) in 1228 ms. (32 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3850 ms. (10 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 595281 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :0 out of 1
Probabilistic random walk after 595281 steps, saw 506282 distinct states, run finished after 3001 ms. (steps per millisecond=198 ) properties seen :0
[2024-06-07 09:57:12] [INFO ] Invariant cache hit.
[2024-06-07 09:57:12] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 761/869 variables, 56/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/869 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1624/2493 variables, 869/926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2493 variables, 44/970 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2493 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (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 777 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 869/869 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 761/869 variables, 56/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-07 09:57:14] [INFO ] Deduced a trap composed of 56 places in 461 ms of which 6 ms to minimize.
[2024-06-07 09:57:15] [INFO ] Deduced a trap composed of 161 places in 460 ms of which 6 ms to minimize.
[2024-06-07 09:57:15] [INFO ] Deduced a trap composed of 56 places in 459 ms of which 5 ms to minimize.
[2024-06-07 09:57:16] [INFO ] Deduced a trap composed of 225 places in 291 ms of which 4 ms to minimize.
[2024-06-07 09:57:16] [INFO ] Deduced a trap composed of 189 places in 390 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/869 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/869 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1624/2493 variables, 869/931 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2493 variables, 44/975 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2493 variables, 0/975 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2493 variables, 0/975 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2493/2493 variables, and 975 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3007 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 869/869 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 5/5 constraints]
After SMT, in 4895ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 96 ms.
Support contains 108 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 1229 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 1231 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 1126 ms. Remains 869 /869 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
[2024-06-07 09:57:19] [INFO ] Invariant cache hit.
[2024-06-07 09:57:20] [INFO ] Implicit Places using invariants in 421 ms returned []
[2024-06-07 09:57:20] [INFO ] Invariant cache hit.
[2024-06-07 09:57:20] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-07 09:57:21] [INFO ] Implicit Places using invariants and state equation in 1379 ms returned []
Implicit Place search using SMT with State Equation took 1809 ms to find 0 implicit places.
[2024-06-07 09:57:21] [INFO ] Redundant transitions in 112 ms returned []
Running 1618 sub problems to find dead transitions.
[2024-06-07 09:57:21] [INFO ] Invariant cache hit.
[2024-06-07 09:57:21] [INFO ] State equation strengthened by 44 read => feed constraints.
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 30041 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
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 30035 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 71788ms problems are : Problem set: 56 solved, 1562 unsolved
Search for dead transitions found 56 dead transitions in 71809ms
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 841 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.2 ms
Discarding 28 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1015 ms. Remains 841 /869 variables (removed 28) and now considering 1568/1568 (removed 0) transitions.
// Phase 1: matrix 1568 rows 841 cols
[2024-06-07 09:58:34] [INFO ] Computed 57 invariants in 23 ms
[2024-06-07 09:58:34] [INFO ] Implicit Places using invariants in 401 ms returned []
[2024-06-07 09:58:34] [INFO ] Invariant cache hit.
[2024-06-07 09:58:35] [INFO ] Implicit Places using invariants and state equation in 896 ms returned []
Implicit Place search using SMT with State Equation took 1300 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 841/869 places, 1568/1624 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 77198 ms. Remains : 841/869 places, 1568/1624 transitions.
RANDOM walk for 40000 steps (8 resets) in 1124 ms. (35 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3436 ms. (11 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 563222 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :0 out of 1
Probabilistic random walk after 563222 steps, saw 481932 distinct states, run finished after 3003 ms. (steps per millisecond=187 ) properties seen :0
[2024-06-07 09:58:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 733/841 variables, 56/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/841 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1568/2409 variables, 841/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2409 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/2409 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2409/2409 variables, and 898 constraints, problems are : Problem set: 0 solved, 1 unsolved in 700 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 841/841 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 733/841 variables, 56/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-07 09:58:42] [INFO ] Deduced a trap composed of 56 places in 432 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/841 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-07 09:58:42] [INFO ] Deduced a trap composed of 224 places in 316 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/841 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/841 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1568/2409 variables, 841/900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2409 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2409 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2409/2409 variables, and 900 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1563 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 841/841 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 2/2 constraints]
After SMT, in 3376ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 99 ms.
Support contains 108 out of 841 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 841/841 places, 1568/1568 transitions.
Applied a total of 0 rules in 1125 ms. Remains 841 /841 variables (removed 0) and now considering 1568/1568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1125 ms. Remains : 841/841 places, 1568/1568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 841/841 places, 1568/1568 transitions.
Applied a total of 0 rules in 1297 ms. Remains 841 /841 variables (removed 0) and now considering 1568/1568 (removed 0) transitions.
[2024-06-07 09:58:45] [INFO ] Invariant cache hit.
[2024-06-07 09:58:46] [INFO ] Implicit Places using invariants in 399 ms returned []
[2024-06-07 09:58:46] [INFO ] Invariant cache hit.
[2024-06-07 09:58:47] [INFO ] Implicit Places using invariants and state equation in 857 ms returned []
Implicit Place search using SMT with State Equation took 1259 ms to find 0 implicit places.
[2024-06-07 09:58:47] [INFO ] Redundant transitions in 74 ms returned []
Running 1562 sub problems to find dead transitions.
[2024-06-07 09:58:47] [INFO ] Invariant cache hit.
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :3440 after 24226
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1562 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 835/2409 variables, and 46 constraints, problems are : Problem set: 0 solved, 1562 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, PredecessorRefiner: 1562/784 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1562 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1562 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/835 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1562 unsolved
At refinement iteration 2 (OVERLAPS) 6/841 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 1562 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 0)
(s4 1)
(s5 1)
(s6 0)
(s7 1)
(s8 1)
(s9 0)
(s10 1)
(s11 1)
(s12 0)
(s13 1)
(s14 1)
(s15 0)
(s16 1)
(s17 1)
(s18 0)
(s19 1)
(s20 1)
(s21 0)
(s22 1)
(s23 1)
(s24 0)
(s25 1)
(s26 1)
(s27 0)
(s28 1)
(s29 1)
(s30 0)
(s31 1)
(s32 1)
(s33 0)
(s34 1)
(s35 1)
(s36 0)
(s37 1)
(s38 1)
(s39 0)
(s40 1)
(s41 1)
(s42 0)
(s43 1)
(s44 1)
(s45 0)
(s46 1)
(s47 1)
(s48 0)
(s49 1)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 1)
(s56 0)
(s57 0)
(s58 1)
(s59 1)
(s60 0)
(s61 1)
(s62 1)
(s63 0)
(s64 1)
(s65 1)
(s66 0)
(s67 1)
(s68 1)
(s69 0)
(s70 1)
(s71 1)
(s72 0)
(s73 1)
(s74 1)
(s75 0)
(s76 1)
(s77 1)
(s78 0)
(s79 0)
(s80 1)
(s81 0)
(s82 0)
(s83 1)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 841/2409 variables, and 57 constraints, problems are : Problem set: 0 solved, 1562 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/841 constraints, PredecessorRefiner: 778/784 constraints, Known Traps: 0/0 constraints]
After SMT, in 72999ms problems are : Problem set: 0 solved, 1562 unsolved
Search for dead transitions found 0 dead transitions in 73016ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75661 ms. Remains : 841/841 places, 1568/1568 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-06-07 10:00:00] [INFO ] Flatten gal took : 79 ms
[2024-06-07 10:00:00] [INFO ] Applying decomposition
[2024-06-07 10:00:00] [INFO ] Flatten gal took : 75 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11201902576901916839.txt' '-o' '/tmp/graph11201902576901916839.bin' '-w' '/tmp/graph11201902576901916839.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11201902576901916839.bin' '-l' '-1' '-v' '-w' '/tmp/graph11201902576901916839.weights' '-q' '0' '-e' '0.001'
[2024-06-07 10:00:00] [INFO ] Decomposing Gal with order
[2024-06-07 10:00:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 10:00:01] [INFO ] Removed a total of 2910 redundant transitions.
[2024-06-07 10:00:01] [INFO ] Flatten gal took : 393 ms
[2024-06-07 10:00:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 164 labels/synchronizations in 51 ms.
[2024-06-07 10:00:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4788901167060040556.gal : 23 ms
[2024-06-07 10:00:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9213307204251118913.prop : 3 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/ReachabilityCardinality4788901167060040556.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9213307204251118913.prop' '--nowitness'
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 ...307
Loading property file /tmp/ReachabilityCardinality9213307204251118913.prop.
ITS-tools command line returned an error code 137
[2024-06-07 10:16:07] [INFO ] Flatten gal took : 62 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7968193892430517200
[2024-06-07 10:16:07] [INFO ] Applying decomposition
[2024-06-07 10:16:07] [INFO ] Too many transitions (1568) to apply POR reductions. Disabling POR matrices.
[2024-06-07 10:16:07] [INFO ] Flatten gal took : 102 ms
[2024-06-07 10:16:07] [INFO ] Built C files in 103ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7968193892430517200
Running compilation step : cd /tmp/ltsmin7968193892430517200;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6031057289760838596.txt' '-o' '/tmp/graph6031057289760838596.bin' '-w' '/tmp/graph6031057289760838596.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6031057289760838596.bin' '-l' '-1' '-v' '-w' '/tmp/graph6031057289760838596.weights' '-q' '0' '-e' '0.001'
[2024-06-07 10:16:07] [INFO ] Decomposing Gal with order
[2024-06-07 10:16:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 10:16:07] [INFO ] Removed a total of 2856 redundant transitions.
[2024-06-07 10:16:07] [INFO ] Flatten gal took : 208 ms
[2024-06-07 10:16:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 43 ms.
[2024-06-07 10:16:07] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability12070836554163554381.gal : 26 ms
[2024-06-07 10:16:07] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability11443547027498200659.prop : 5 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/ReachabilityFireability12070836554163554381.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability11443547027498200659.prop' '--nowitness'
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 ...309
Loading property file /tmp/ReachabilityFireability11443547027498200659.prop.
Compilation finished in 5029 ms.
Running link step : cd /tmp/ltsmin7968193892430517200;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin7968193892430517200;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'BlocksWorldPT05ReachabilityFireability202403==true'
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 65802
ITS-tools command line returned an error code 137
[2024-06-07 10:35:53] [INFO ] Applying decomposition
[2024-06-07 10:35:53] [INFO ] Flatten gal took : 175 ms
[2024-06-07 10:35:53] [INFO ] Decomposing Gal with order
[2024-06-07 10:35:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 10:35:54] [INFO ] Removed a total of 4534 redundant transitions.
[2024-06-07 10:35:54] [INFO ] Flatten gal took : 506 ms
[2024-06-07 10:35:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 48 ms.
[2024-06-07 10:35:54] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability12415217582165558023.gal : 35 ms
[2024-06-07 10:35:54] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability7702608281472012844.prop : 3 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/ReachabilityFireability12415217582165558023.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability7702608281472012844.prop' '--nowitness'
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 ...308
Loading property file /tmp/ReachabilityFireability7702608281472012844.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
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-05"
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-05, 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-171774424600199"
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 [ "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 '
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 ;