Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r016-smll-174853764300023.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-03, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-smll-174853764300023
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K 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.7K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 28K 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 330K 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-03-ReachabilityFireability-2024-06
FORMULA_NAME BlocksWorld-PT-03-ReachabilityFireability-2024-07
FORMULA_NAME BlocksWorld-PT-03-ReachabilityFireability-2025-00
FORMULA_NAME BlocksWorld-PT-03-ReachabilityFireability-2025-01
FORMULA_NAME BlocksWorld-PT-03-ReachabilityFireability-2025-02
FORMULA_NAME BlocksWorld-PT-03-ReachabilityFireability-2025-03
FORMULA_NAME BlocksWorld-PT-03-ReachabilityFireability-2025-04
FORMULA_NAME BlocksWorld-PT-03-ReachabilityFireability-2025-05
FORMULA_NAME BlocksWorld-PT-03-ReachabilityFireability-2025-08
FORMULA_NAME BlocksWorld-PT-03-ReachabilityFireability-2025-09
FORMULA_NAME BlocksWorld-PT-03-ReachabilityFireability-2025-10
FORMULA_NAME BlocksWorld-PT-03-ReachabilityFireability-2025-11
FORMULA_NAME BlocksWorld-PT-03-ReachabilityFireability-2025-12
FORMULA_NAME BlocksWorld-PT-03-ReachabilityFireability-2025-13
FORMULA_NAME BlocksWorld-PT-03-ReachabilityFireability-2025-14
FORMULA_NAME BlocksWorld-PT-03-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1748559780995

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-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-05-29 23:03:02] [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]
[2025-05-29 23:03:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 23:03:03] [INFO ] Load time of PNML (sax parser for PT used): 181 ms
[2025-05-29 23:03:03] [INFO ] Transformed 379 places.
[2025-05-29 23:03:03] [INFO ] Transformed 685 transitions.
[2025-05-29 23:03:03] [INFO ] Found NUPN structural information;
[2025-05-29 23:03:03] [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]
[2025-05-29 23:03:03] [INFO ] Parsed PT model containing 379 places and 685 transitions and 3412 arcs in 357 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 19 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Working with output stream class java.io.PrintStream
[2025-05-29 23:03:04] [INFO ] Flatten gal took : 253 ms
[2025-05-29 23:03:04] [INFO ] Flatten gal took : 218 ms
[2025-05-29 23:03:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1371610470132302462.gal : 100 ms
[2025-05-29 23:03:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2723130702079627665.prop : 7 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/ReachabilityCardinality1371610470132302462.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2723130702079627665.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (8 resets) in 4255 ms. (9 steps per ms) remains 8/15 properties
FORMULA BlocksWorld-PT-03-ReachabilityFireability-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-03-ReachabilityFireability-2025-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-03-ReachabilityFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-03-ReachabilityFireability-2025-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-03-ReachabilityFireability-2025-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-03-ReachabilityFireability-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-03-ReachabilityFireability-2025-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK

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/ReachabilityCardinality2723130702079627665.prop.
BEST_FIRST walk for 40003 steps (8 resets) in 920 ms. (43 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 341 ms. (116 steps per ms) remains 8/8 properties
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :4 after 28
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :28 after 410
BEST_FIRST walk for 40004 steps (8 resets) in 925 ms. (43 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 440 ms. (90 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 7/8 properties
FORMULA BlocksWorld-PT-03-ReachabilityFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 465 ms. (85 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 445 ms. (89 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 275 ms. (144 steps per ms) remains 7/7 properties
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :410 after 2001
// Phase 1: matrix 685 rows 379 cols
[2025-05-29 23:03:06] [INFO ] Computed 37 invariants in 202 ms
[2025-05-29 23:03:06] [INFO ] State equation strengthened by 27 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.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :2001 after 2549
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem BlocksWorld-PT-03-ReachabilityFireability-2025-00 is UNSAT
FORMULA BlocksWorld-PT-03-ReachabilityFireability-2025-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-03-ReachabilityFireability-2025-08 is UNSAT
FORMULA BlocksWorld-PT-03-ReachabilityFireability-2025-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-03-ReachabilityFireability-2025-11 is UNSAT
FORMULA BlocksWorld-PT-03-ReachabilityFireability-2025-11 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-03-ReachabilityFireability-2025-13 is UNSAT
FORMULA BlocksWorld-PT-03-ReachabilityFireability-2025-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-03-ReachabilityFireability-2025-14 is UNSAT
FORMULA BlocksWorld-PT-03-ReachabilityFireability-2025-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 298/379 variables, 37/37 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/379 variables, 0/37 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 684/1063 variables, 379/416 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1063 variables, 26/442 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1063 variables, 0/442 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/1064 variables, 1/443 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1064 variables, 0/443 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1064 variables, 0/443 constraints. Problems are: Problem set: 5 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1064/1064 variables, and 443 constraints, problems are : Problem set: 5 solved, 2 unsolved in 1402 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 379/379 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 7/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 2 unsolved
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :2549 after 4536
At refinement iteration 1 (OVERLAPS) 334/376 variables, 34/34 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 0/34 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/379 variables, 3/37 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 0/37 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 684/1063 variables, 379/416 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1063 variables, 26/442 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1063 variables, 1/443 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1063 variables, 0/443 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/1064 variables, 1/444 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1064 variables, 0/444 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1064 variables, 0/444 constraints. Problems are: Problem set: 5 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1064/1064 variables, and 444 constraints, problems are : Problem set: 5 solved, 2 unsolved in 1191 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 379/379 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3027ms problems are : Problem set: 5 solved, 2 unsolved
Parikh walk visited 0 properties in 234 ms.
Support contains 42 out of 379 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 379/379 places, 685/685 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 379 transition count 684
Applied a total of 1 rules in 643 ms. Remains 379 /379 variables (removed 0) and now considering 684/685 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 656 ms. Remains : 379/379 places, 684/685 transitions.
RANDOM walk for 40000 steps (8 resets) in 1009 ms. (39 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 437 ms. (91 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 2/2 properties
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :4536 after 15366
Interrupted probabilistic random walk after 331024 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :0 out of 2
Probabilistic random walk after 331024 steps, saw 259599 distinct states, run finished after 3017 ms. (steps per millisecond=109 ) properties seen :0
// Phase 1: matrix 684 rows 379 cols
[2025-05-29 23:03:13] [INFO ] Computed 37 invariants in 14 ms
[2025-05-29 23:03:13] [INFO ] State equation strengthened by 26 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 334/376 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:03:13] [INFO ] Deduced a trap composed of 19 places in 351 ms of which 38 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 3/379 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 684/1063 variables, 379/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1063 variables, 26/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:03:14] [INFO ] Deduced a trap composed of 51 places in 108 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1063 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1063 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1063 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1063/1063 variables, and 444 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1389 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 379/379 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 334/376 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 3/379 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 684/1063 variables, 379/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1063 variables, 26/444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1063 variables, 1/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1063 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1063 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1063/1063 variables, and 445 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1130 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 379/379 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2572ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 189 ms.
Support contains 42 out of 379 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 379/379 places, 684/684 transitions.
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :15366 after 25423
Applied a total of 0 rules in 310 ms. Remains 379 /379 variables (removed 0) and now considering 684/684 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 310 ms. Remains : 379/379 places, 684/684 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 379/379 places, 684/684 transitions.
Applied a total of 0 rules in 334 ms. Remains 379 /379 variables (removed 0) and now considering 684/684 (removed 0) transitions.
[2025-05-29 23:03:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:03:17] [INFO ] Implicit Places using invariants in 540 ms returned []
[2025-05-29 23:03:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:03:17] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-29 23:03:18] [INFO ] Implicit Places using invariants and state equation in 894 ms returned []
Implicit Place search using SMT with State Equation took 1456 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 23:03:18] [INFO ] Redundant transitions in 49 ms returned []
Running 679 sub problems to find dead transitions.
[2025-05-29 23:03:18] [INFO ] Invariant cache hit.
[2025-05-29 23:03:18] [INFO ] State equation strengthened by 26 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Problem TDEAD1 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD682 is UNSAT
SDD proceeding with computation,15 properties remain. new max is 1024
SDD size :25423 after 37805
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 27/27 constraints. Problems are: Problem set: 26 solved, 653 unsolved
SDD proceeding with computation,15 properties remain. new max is 2048
SDD size :37805 after 84749
At refinement iteration 1 (INCLUDED_ONLY) 0/374 variables, 0/27 constraints. Problems are: Problem set: 26 solved, 653 unsolved
Problem TDEAD93 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD678 is UNSAT
At refinement iteration 2 (OVERLAPS) 5/379 variables, 10/37 constraints. Problems are: Problem set: 36 solved, 643 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/379 variables, 0/37 constraints. Problems are: Problem set: 36 solved, 643 unsolved
SMT process timed out in 32191ms, After SMT, problems are : Problem set: 36 solved, 643 unsolved
Search for dead transitions found 36 dead transitions in 32212ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 379/379 places, 648/684 transitions.
Graph (complete) has 1674 edges and 379 vertex of which 361 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 ms
Discarding 18 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 264 ms. Remains 361 /379 variables (removed 18) and now considering 648/648 (removed 0) transitions.
// Phase 1: matrix 648 rows 361 cols
[2025-05-29 23:03:50] [INFO ] Computed 37 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:03:51] [INFO ] Implicit Places using invariants in 326 ms returned []
[2025-05-29 23:03:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:03:51] [INFO ] Implicit Places using invariants and state equation in 716 ms returned []
Implicit Place search using SMT with State Equation took 1045 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 361/379 places, 648/684 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 35380 ms. Remains : 361/379 places, 648/684 transitions.
RANDOM walk for 40000 steps (8 resets) in 705 ms. (56 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 255 ms. (156 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 403244 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :0 out of 2
Probabilistic random walk after 403244 steps, saw 316867 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
[2025-05-29 23:03:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 316/358 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/361 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1009/1009 variables, and 398 constraints, problems are : Problem set: 0 solved, 2 unsolved in 550 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 316/358 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/361 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:03:56] [INFO ] Deduced a trap composed of 51 places in 93 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 648/1009 variables, 361/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1009 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1009 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1009 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1009/1009 variables, and 400 constraints, problems are : Problem set: 0 solved, 2 unsolved in 735 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1298ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 203 ms.
Support contains 42 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 648/648 transitions.
Applied a total of 0 rules in 263 ms. Remains 361 /361 variables (removed 0) and now considering 648/648 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 263 ms. Remains : 361/361 places, 648/648 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 648/648 transitions.
Applied a total of 0 rules in 255 ms. Remains 361 /361 variables (removed 0) and now considering 648/648 (removed 0) transitions.
[2025-05-29 23:03:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:03:57] [INFO ] Implicit Places using invariants in 304 ms returned []
[2025-05-29 23:03:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:03:58] [INFO ] Implicit Places using invariants and state equation in 583 ms returned []
Implicit Place search using SMT with State Equation took 892 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 23:03:58] [INFO ] Redundant transitions in 108 ms returned []
Running 643 sub problems to find dead transitions.
[2025-05-29 23:03:58] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
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
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 643 unsolved
SDD proceeding with computation,15 properties remain. new max is 4096
SDD size :84749 after 396957
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 643 unsolved
SMT process timed out in 31129ms, After SMT, problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 31132ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32398 ms. Remains : 361/361 places, 648/648 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-29 23:04:29] [INFO ] Flatten gal took : 77 ms
[2025-05-29 23:04:29] [INFO ] Applying decomposition
[2025-05-29 23:04:29] [INFO ] Flatten gal took : 58 ms
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/graph17363468951211966899.txt' '-o' '/tmp/graph17363468951211966899.bin' '-w' '/tmp/graph17363468951211966899.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17363468951211966899.bin' '-l' '-1' '-v' '-w' '/tmp/graph17363468951211966899.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:04:30] [INFO ] Decomposing Gal with order
[2025-05-29 23:04:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:04:30] [INFO ] Removed a total of 1150 redundant transitions.
[2025-05-29 23:04:30] [INFO ] Flatten gal took : 263 ms
[2025-05-29 23:04:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 32 ms.
[2025-05-29 23:04:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15041688518959796174.gal : 25 ms
[2025-05-29 23:04:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8175054689694055702.prop : 0 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/ReachabilityCardinality15041688518959796174.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8175054689694055702.prop' '--nowitness'

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 ...308
Loading property file /tmp/ReachabilityCardinality8175054689694055702.prop.
Detected timeout of ITS tools.
[2025-05-29 23:34:34] [INFO ] Flatten gal took : 967 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2272794472991311851
[2025-05-29 23:34:35] [INFO ] Applying decomposition
[2025-05-29 23:34:36] [INFO ] Computing symmetric may disable matrix : 648 transitions.
[2025-05-29 23:34:36] [INFO ] Flatten gal took : 535 ms
[2025-05-29 23:34:36] [INFO ] Computation of Complete disable matrix. took 236 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 23:34:36] [INFO ] Computing symmetric may enable matrix : 648 transitions.
[2025-05-29 23:34:36] [INFO ] Computation of Complete enable matrix. took 230 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 23:34:38] [INFO ] Computing Do-Not-Accords matrix : 648 transitions.
[2025-05-29 23:34:38] [INFO ] Computation of Completed DNA matrix. took 205 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 23:34:39] [INFO ] Built C files in 3717ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2272794472991311851
Running compilation step : cd /tmp/ltsmin2272794472991311851;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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.202505121319/bin/convert-linux64' '-i' '/tmp/graph4339426947267358172.txt' '-o' '/tmp/graph4339426947267358172.bin' '-w' '/tmp/graph4339426947267358172.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4339426947267358172.bin' '-l' '-1' '-v' '-w' '/tmp/graph4339426947267358172.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:34:41] [INFO ] Decomposing Gal with order
[2025-05-29 23:34:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:34:42] [INFO ] Removed a total of 1116 redundant transitions.
[2025-05-29 23:34:42] [INFO ] Flatten gal took : 1399 ms
[2025-05-29 23:34:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 39 ms.
[2025-05-29 23:34:42] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability18317436310634095098.gal : 25 ms
[2025-05-29 23:34:42] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability2052262222646692160.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/ReachabilityFireability18317436310634095098.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability2052262222646692160.prop' '--nowitness'

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 ...308
Loading property file /tmp/ReachabilityFireability2052262222646692160.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 121
Compilation finished in 4562 ms.
Running link step : cd /tmp/ltsmin2272794472991311851;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 78 ms.
Running LTSmin : cd /tmp/ltsmin2272794472991311851;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'BlocksWorldPT03ReachabilityFireability202501==true'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin2272794472991311851;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'BlocksWorldPT03ReachabilityFireability202501==true'
Running LTSmin : cd /tmp/ltsmin2272794472991311851;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'BlocksWorldPT03ReachabilityFireability202406==true'

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
++ 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 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-03"
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-5832"
echo " Executing tool itstools"
echo " Input is BlocksWorld-PT-03, 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 r016-smll-174853764300023"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BlocksWorld-PT-03.tgz
mv BlocksWorld-PT-03 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.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;