fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r016-smll-174853764500142
Last Updated
June 24, 2025

About the Execution of ITS-Tools for BlocksWorld-PT-18

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 2239091.00 0.00 0.00 ????FFFT?FTFFFTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r016-smll-174853764500142.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is BlocksWorld-PT-18, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-smll-174853764500142
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.3M May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 7.2M May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 130K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 312K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 8.3M May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME BlocksWorld-PT-18-ReachabilityCardinality-2024-07
FORMULA_NAME BlocksWorld-PT-18-ReachabilityCardinality-2024-10
FORMULA_NAME BlocksWorld-PT-18-ReachabilityCardinality-2025-00
FORMULA_NAME BlocksWorld-PT-18-ReachabilityCardinality-2025-01
FORMULA_NAME BlocksWorld-PT-18-ReachabilityCardinality-2025-02
FORMULA_NAME BlocksWorld-PT-18-ReachabilityCardinality-2025-03
FORMULA_NAME BlocksWorld-PT-18-ReachabilityCardinality-2025-04
FORMULA_NAME BlocksWorld-PT-18-ReachabilityCardinality-2025-05
FORMULA_NAME BlocksWorld-PT-18-ReachabilityCardinality-2025-06
FORMULA_NAME BlocksWorld-PT-18-ReachabilityCardinality-2025-08
FORMULA_NAME BlocksWorld-PT-18-ReachabilityCardinality-2025-09
FORMULA_NAME BlocksWorld-PT-18-ReachabilityCardinality-2025-11
FORMULA_NAME BlocksWorld-PT-18-ReachabilityCardinality-2025-12
FORMULA_NAME BlocksWorld-PT-18-ReachabilityCardinality-2025-13
FORMULA_NAME BlocksWorld-PT-18-ReachabilityCardinality-2025-14
FORMULA_NAME BlocksWorld-PT-18-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748707657454

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-05-31 16:07:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 16:07:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 16:07:41] [INFO ] Load time of PNML (sax parser for PT used): 1155 ms
[2025-05-31 16:07:41] [INFO ] Transformed 8741 places.
[2025-05-31 16:07:41] [INFO ] Transformed 17113 transitions.
[2025-05-31 16:07:41] [INFO ] Found NUPN structural information;
[2025-05-31 16:07:41] [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, pred_on_table_28, pred_on_table_29, pred_on_table_30, pred_on_table_31, pred_on_table_32, pred_on_table_33, pred_on_table_34, pred_on_table_35, pred_on_table_36, pred_on_table_37, pred_on_table_38, pred_on_table_39, pred_on_table_40, pred_on_table_41, pred_on_table_42, pred_on_table_43, pred_on_table_44, pred_on_table_45, pred_on_table_46, pred_on_table_47, pred_on_table_48, pred_on_table_49, pred_on_table_50, pred_on_table_51, pred_on_table_52, pred_on_table_53, pred_on_table_54, pred_on_table_55, pred_on_table_56, pred_on_table_57, pred_on_table_58, pred_on_table_59, pred_on_table_60, pred_on_table_61, pred_on_table_62, pred_on_table_63, pred_on_table_64, pred_on_table_65, pred_on_table_66, pred_on_table_67, pred_on_table_68, pred_on_table_69, pred_on_table_70, pred_on_table_71, pred_on_table_72, pred_on_table_73, pred_on_table_74, pred_on_table_75, pred_on_table_76, pred_on_table_77, pred_on_table_78, pred_on_table_79, pred_on_table_80, pred_on_table_81, pred_on_table_82, pred_on_table_83, pred_on_table_84, pred_on_table_85, pred_on_table_86, pred_on_table_87, pred_on_table_88, pred_on_table_89, pred_on_table_90, pred_on_table_91]
[2025-05-31 16:07:41] [INFO ] Parsed PT model containing 8741 places and 17113 transitions and 85538 arcs in 1483 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 31 ms.
Working with output stream class java.io.PrintStream
[2025-05-31 16:07:45] [INFO ] Flatten gal took : 2289 ms
[2025-05-31 16:07:47] [INFO ] Flatten gal took : 1530 ms
[2025-05-31 16:07:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11200140900077004491.gal : 460 ms
[2025-05-31 16:07:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1194617342176233203.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11200140900077004491.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1194617342176233203.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40000 steps (8 resets) in 24981 ms. (1 steps per ms) remains 8/16 properties
FORMULA BlocksWorld-PT-18-ReachabilityCardinality-2025-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-18-ReachabilityCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-18-ReachabilityCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-18-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-18-ReachabilityCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-18-ReachabilityCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-18-ReachabilityCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-18-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1459 ms. (27 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1477 ms. (27 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2239 ms. (17 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1293 ms. (30 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1373 ms. (29 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1206 ms. (33 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1330 ms. (30 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1111 ms. (35 steps per ms) remains 8/8 properties
// Phase 1: matrix 17113 rows 8741 cols
[2025-05-31 16:07:52] [INFO ] Computed 185 invariants in 369 ms
Loading property file /tmp/ReachabilityCardinality1194617342176233203.prop.
[2025-05-31 16:07:53] [INFO ] State equation strengthened by 163 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem BlocksWorld-PT-18-ReachabilityCardinality-2025-05 is UNSAT
FORMULA BlocksWorld-PT-18-ReachabilityCardinality-2025-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-18-ReachabilityCardinality-2025-15 is UNSAT
FORMULA BlocksWorld-PT-18-ReachabilityCardinality-2025-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 8487/8723 variables, 167/167 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8723 variables, 0/167 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/8741 variables, 18/185 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 (/ 15.0 16.0))
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 (/ 15.0 16.0))
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 (/ 1.0 8.0))
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8741/25854 variables, and 185 constraints, problems are : Problem set: 2 solved, 6 unsolved in 5058 ms.
Refiners :[Positive P Invariants (semi-flows): 185/185 constraints, State Equation: 0/8741 constraints, ReadFeed: 0/163 constraints, PredecessorRefiner: 8/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 8517/8702 variables, 146/146 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8702 variables, 0/146 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 39/8741 variables, 39/185 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8741/25854 variables, and 185 constraints, problems are : Problem set: 2 solved, 6 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 185/185 constraints, State Equation: 0/8741 constraints, ReadFeed: 0/163 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11134ms problems are : Problem set: 2 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 185 out of 8741 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8741/8741 places, 17113/17113 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 8741 transition count 17112
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :8 after 61
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :61 after 63
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :63 after 71
Applied a total of 1 rules in 244702 ms. Remains 8741 /8741 variables (removed 0) and now considering 17112/17113 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 244717 ms. Remains : 8741/8741 places, 17112/17113 transitions.
RANDOM walk for 40000 steps (8 resets) in 13054 ms. (3 steps per ms) remains 5/6 properties
FORMULA BlocksWorld-PT-18-ReachabilityCardinality-2025-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 1510 ms. (26 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1328 ms. (30 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1277 ms. (31 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1476 ms. (27 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1180 ms. (33 steps per ms) remains 5/5 properties
// Phase 1: matrix 17112 rows 8741 cols
[2025-05-31 16:12:14] [INFO ] Computed 185 invariants in 161 ms
[2025-05-31 16:12:14] [INFO ] State equation strengthened by 162 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8528/8695 variables, 139/139 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8695 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 46/8741 variables, 46/185 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8741 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 17112/25853 variables, 8741/8926 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25853 variables, 162/9088 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 25853/25853 variables, and 9088 constraints, problems are : Problem set: 0 solved, 5 unsolved in 45093 ms.
Refiners :[Positive P Invariants (semi-flows): 185/185 constraints, State Equation: 8741/8741 constraints, ReadFeed: 162/162 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8528/8695 variables, 139/139 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8695 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 46/8741 variables, 46/185 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 16:13:05] [INFO ] Deduced a trap composed of 93 places in 802 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 16:13:06] [INFO ] Deduced a trap composed of 93 places in 634 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 16:13:38] [INFO ] Deduced a trap composed of 360 places in 32102 ms of which 6441 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 16:14:12] [INFO ] Deduced a trap composed of 528 places in 33695 ms of which 8854 ms to minimize.
SMT process timed out in 118865ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 167 out of 8741 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8741/8741 places, 17112/17112 transitions.
Applied a total of 0 rules in 185263 ms. Remains 8741 /8741 variables (removed 0) and now considering 17112/17112 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185263 ms. Remains : 8741/8741 places, 17112/17112 transitions.
RANDOM walk for 40000 steps (8 resets) in 12691 ms. (3 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1146 ms. (34 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1103 ms. (36 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1502 ms. (26 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1469 ms. (27 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1113 ms. (35 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 373008 steps, run timeout after 15001 ms. (steps per millisecond=24 ) properties seen :0 out of 5
Probabilistic random walk after 373008 steps, saw 317679 distinct states, run finished after 15012 ms. (steps per millisecond=24 ) properties seen :0
[2025-05-31 16:17:38] [INFO ] Invariant cache hit.
[2025-05-31 16:17:38] [INFO ] State equation strengthened by 162 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8528/8695 variables, 139/139 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8695 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 46/8741 variables, 46/185 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8741 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 17112/25853 variables, 8741/8926 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25853 variables, 162/9088 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25853 variables, 0/9088 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/25853 variables, 0/9088 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25853/25853 variables, and 9088 constraints, problems are : Problem set: 0 solved, 5 unsolved in 58384 ms.
Refiners :[Positive P Invariants (semi-flows): 185/185 constraints, State Equation: 8741/8741 constraints, ReadFeed: 162/162 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8528/8695 variables, 139/139 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8695 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 46/8741 variables, 46/185 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 16:19:32] [INFO ] Deduced a trap composed of 273 places in 51055 ms of which 6302 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 16:19:44] [INFO ] Deduced a trap composed of 360 places in 11892 ms of which 2933 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 16:19:54] [INFO ] Deduced a trap composed of 360 places in 9675 ms of which 2282 ms to minimize.
SMT process timed out in 136608ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 167 out of 8741 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8741/8741 places, 17112/17112 transitions.
Applied a total of 0 rules in 196603 ms. Remains 8741 /8741 variables (removed 0) and now considering 17112/17112 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196825 ms. Remains : 8741/8741 places, 17112/17112 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8741/8741 places, 17112/17112 transitions.
Applied a total of 0 rules in 232958 ms. Remains 8741 /8741 variables (removed 0) and now considering 17112/17112 (removed 0) transitions.
[2025-05-31 16:27:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 16:27:49] [INFO ] Performed 5572/8741 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-05-31 16:28:00] [INFO ] Implicit Places using invariants in 53553 ms returned []
Implicit Place search using SMT only with invariants took 56235 ms to find 0 implicit places.
Running 17101 sub problems to find dead transitions.
[2025-05-31 16:28:01] [INFO ] Invariant cache hit.
[2025-05-31 16:28:01] [INFO ] State equation strengthened by 162 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
ITS-tools command line returned an error code 137
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
[2025-05-31 16:31:31] [INFO ] Flatten gal took : 1460 ms
[2025-05-31 16:31:31] [INFO ] Applying decomposition
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
[2025-05-31 16:31:31] [INFO ] Flatten gal took : 865 ms
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1169949563608722654.txt' '-o' '/tmp/graph1169949563608722654.bin' '-w' '/tmp/graph1169949563608722654.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1169949563608722654.bin' '-l' '-1' '-v' '-w' '/tmp/graph1169949563608722654.weights' '-q' '0' '-e' '0.001'
Excessive predecessor constraint size, skipping predecessor.
[2025-05-31 16:31:37] [INFO ] Decomposing Gal with order
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
[2025-05-31 16:31:39] [INFO ] Rewriting arrays to variables to allow decomposition.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
[2025-05-31 16:31:44] [INFO ] Removed a total of 33566 redundant transitions.
[2025-05-31 16:31:45] [INFO ] Flatten gal took : 5020 ms
[2025-05-31 16:32:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 16820 labels/synchronizations in 9324 ms.
[2025-05-31 16:32:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1446499754421304470.gal : 247 ms
[2025-05-31 16:32:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1618586157563629591.prop : 1 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1446499754421304470.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1618586157563629591.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality1618586157563629591.prop.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Problem TDEAD1 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1672 is UNSAT
Problem TDEAD1765 is UNSAT
Problem TDEAD1858 is UNSAT
Problem TDEAD1951 is UNSAT
Problem TDEAD2044 is UNSAT
Problem TDEAD2137 is UNSAT
Problem TDEAD2230 is UNSAT
Problem TDEAD2416 is UNSAT
Problem TDEAD2509 is UNSAT
Problem TDEAD2602 is UNSAT
Problem TDEAD2695 is UNSAT
Problem TDEAD2788 is UNSAT
Problem TDEAD2881 is UNSAT
Problem TDEAD2974 is UNSAT
Problem TDEAD3067 is UNSAT
Problem TDEAD3160 is UNSAT
Problem TDEAD3253 is UNSAT
Problem TDEAD3439 is UNSAT
Problem TDEAD3532 is UNSAT
Problem TDEAD3625 is UNSAT
Problem TDEAD3718 is UNSAT
Problem TDEAD3811 is UNSAT
Problem TDEAD3904 is UNSAT
Problem TDEAD3997 is UNSAT
Problem TDEAD4090 is UNSAT
Problem TDEAD4183 is UNSAT
Problem TDEAD4276 is UNSAT
Problem TDEAD4369 is UNSAT
Problem TDEAD4462 is UNSAT
Problem TDEAD4555 is UNSAT
Problem TDEAD4741 is UNSAT
Problem TDEAD4834 is UNSAT
Problem TDEAD4927 is UNSAT
Problem TDEAD5020 is UNSAT
Problem TDEAD5113 is UNSAT
Problem TDEAD5206 is UNSAT
Problem TDEAD5299 is UNSAT
Problem TDEAD5485 is UNSAT
Problem TDEAD5578 is UNSAT
Problem TDEAD5671 is UNSAT
Problem TDEAD5764 is UNSAT
Problem TDEAD5857 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/8730 variables, 163/163 constraints. Problems are: Problem set: 57 solved, 17044 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8730/25853 variables, and 163 constraints, problems are : Problem set: 57 solved, 17044 unsolved in 30752 ms.
Refiners :[Positive P Invariants (semi-flows): 163/185 constraints, State Equation: 0/8741 constraints, ReadFeed: 0/162 constraints, PredecessorRefiner: 17045/184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 57 solved, 17044 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Problem TDEAD5950 is UNSAT
Problem TDEAD6136 is UNSAT
Problem TDEAD6229 is UNSAT
Problem TDEAD6322 is UNSAT
Problem TDEAD6415 is UNSAT
Problem TDEAD6508 is UNSAT
Problem TDEAD6601 is UNSAT
Problem TDEAD6694 is UNSAT
Problem TDEAD6787 is UNSAT
Problem TDEAD6880 is UNSAT
Problem TDEAD6973 is UNSAT
Problem TDEAD7066 is UNSAT
Problem TDEAD7159 is UNSAT
Problem TDEAD7252 is UNSAT
Problem TDEAD7345 is UNSAT
Problem TDEAD7438 is UNSAT
Problem TDEAD7531 is UNSAT
Problem TDEAD7624 is UNSAT
Problem TDEAD7717 is UNSAT
Problem TDEAD7810 is UNSAT
Problem TDEAD8182 is UNSAT
Problem TDEAD8275 is UNSAT
Problem TDEAD8461 is UNSAT
Problem TDEAD8554 is UNSAT
Problem TDEAD8647 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/8674 variables, 59/59 constraints. Problems are: Problem set: 82 solved, 17019 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8674/25853 variables, and 59 constraints, problems are : Problem set: 82 solved, 17019 unsolved in 30621 ms.
Refiners :[Positive P Invariants (semi-flows): 59/185 constraints, State Equation: 0/8741 constraints, ReadFeed: 0/162 constraints, PredecessorRefiner: 16836/184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 336756ms problems are : Problem set: 82 solved, 17019 unsolved
Search for dead transitions found 82 dead transitions in 337258ms
Found 82 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 82 transitions
Dead transitions reduction (with SMT) removed 82 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 8741/8741 places, 17030/17112 transitions.
Graph (complete) has 42789 edges and 8741 vertex of which 8660 are kept as prefixes of interest. Removing 81 places using SCC suffix rule.31 ms
Discarding 81 places :
Also discarding 0 output transitions
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 17
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :17 after 18
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :18 after 23
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :23 after 101
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :101 after 146
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :146 after 664
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :664 after 1503
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :1503 after 6188
Applied a total of 1 rules in 191385 ms. Remains 8660 /8741 variables (removed 81) and now considering 17030/17030 (removed 0) transitions.
// Phase 1: matrix 17030 rows 8660 cols
[2025-05-31 16:37:09] [INFO ] Computed 105 invariants in 19476 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 16:37:24] [INFO ] Implicit Places using invariants in 35010 ms returned []
Implicit Place search using SMT only with invariants took 35017 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 8660/8741 places, 17030/17112 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 853284 ms. Remains : 8660/8741 places, 17030/17112 transitions.
RANDOM walk for 40000 steps (8 resets) in 12579 ms. (3 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1068 ms. (37 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1098 ms. (36 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1272 ms. (31 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1406 ms. (28 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1012 ms. (39 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 396902 steps, run timeout after 15001 ms. (steps per millisecond=26 ) properties seen :0 out of 5
Probabilistic random walk after 396902 steps, saw 339459 distinct states, run finished after 15001 ms. (steps per millisecond=26 ) properties seen :0
[2025-05-31 16:37:45] [INFO ] Invariant cache hit.
[2025-05-31 16:37:45] [INFO ] State equation strengthened by 91 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1746/1913 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1913 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 405/2318 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2318 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 6342/8660 variables, 80/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8660 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 17030/25690 variables, 8660/8765 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25690 variables, 91/8856 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/25690 variables, 0/8856 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 25690/25690 variables, and 8856 constraints, problems are : Problem set: 0 solved, 5 unsolved in 90209 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 80/80 constraints, State Equation: 8660/8660 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1746/1913 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1913 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 405/2318 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2318 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 6342/8660 variables, 80/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 16:39:29] [INFO ] Deduced a trap composed of 93 places in 10731 ms of which 1120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 16:39:40] [INFO ] Deduced a trap composed of 93 places in 10321 ms of which 1224 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 16:39:50] [INFO ] Deduced a trap composed of 93 places in 10181 ms of which 1001 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,5 properties remain. new max is 2048
[2025-05-31 16:39:59] [INFO ] Deduced a trap composed of 93 places in 8423 ms of which 847 ms to minimize.
SDD size :6188 after 11895
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 16:40:07] [INFO ] Deduced a trap composed of 93 places in 8397 ms of which 949 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 16:40:16] [INFO ] Deduced a trap composed of 93 places in 8130 ms of which 851 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 16:40:24] [INFO ] Deduced a trap composed of 93 places in 7808 ms of which 847 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 16:40:31] [INFO ] Deduced a trap composed of 93 places in 7164 ms of which 761 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 16:40:38] [INFO ] Deduced a trap composed of 93 places in 6699 ms of which 751 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 16:40:44] [INFO ] Deduced a trap composed of 93 places in 6114 ms of which 631 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 16:40:50] [INFO ] Deduced a trap composed of 93 places in 5264 ms of which 589 ms to minimize.
SMT process timed out in 185137ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 167 out of 8660 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8660/8660 places, 17030/17030 transitions.
Applied a total of 0 rules in 207958 ms. Remains 8660 /8660 variables (removed 0) and now considering 17030/17030 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 207958 ms. Remains : 8660/8660 places, 17030/17030 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8660/8660 places, 17030/17030 transitions.

BK_STOP 1748709896545

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BlocksWorld-PT-18"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is BlocksWorld-PT-18, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r016-smll-174853764500142"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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