About the Execution of ITS-Tools for MedleyB-PT-B13
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 3600000.00 | 0.00 | 0.00 | ?TF?FT??T?F??FT? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r254-tall-174931340100527.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 MedleyB-PT-B13, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931340100527
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 121M
-rw-r--r-- 1 mcc users 5.8K Jun 6 09:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 6 09:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 6 09:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Jun 6 09:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 6 12:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 12:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 12:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 12:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 13K Jun 6 09:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Jun 6 09:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Jun 6 09:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Jun 6 09:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 12:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 120M Jun 5 20:08 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 MedleyB-PT-B13-ReachabilityFireability-2025-00
FORMULA_NAME MedleyB-PT-B13-ReachabilityFireability-2025-01
FORMULA_NAME MedleyB-PT-B13-ReachabilityFireability-2025-02
FORMULA_NAME MedleyB-PT-B13-ReachabilityFireability-2025-03
FORMULA_NAME MedleyB-PT-B13-ReachabilityFireability-2025-04
FORMULA_NAME MedleyB-PT-B13-ReachabilityFireability-2025-05
FORMULA_NAME MedleyB-PT-B13-ReachabilityFireability-2025-06
FORMULA_NAME MedleyB-PT-B13-ReachabilityFireability-2025-07
FORMULA_NAME MedleyB-PT-B13-ReachabilityFireability-2025-08
FORMULA_NAME MedleyB-PT-B13-ReachabilityFireability-2025-09
FORMULA_NAME MedleyB-PT-B13-ReachabilityFireability-2025-10
FORMULA_NAME MedleyB-PT-B13-ReachabilityFireability-2025-11
FORMULA_NAME MedleyB-PT-B13-ReachabilityFireability-2025-12
FORMULA_NAME MedleyB-PT-B13-ReachabilityFireability-2025-13
FORMULA_NAME MedleyB-PT-B13-ReachabilityFireability-2025-14
FORMULA_NAME MedleyB-PT-B13-ReachabilityFireability-2025-15
=== Now, execution of the tool begins
BK_START 1749411490107
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyB-PT-B13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-08 19:38:11] [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-06-08 19:38:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 19:38:15] [INFO ] Load time of PNML (sax parser for PT used): 4020 ms
[2025-06-08 19:38:15] [INFO ] Transformed 3039 places.
[2025-06-08 19:38:15] [INFO ] Transformed 122330 transitions.
[2025-06-08 19:38:15] [INFO ] Found NUPN structural information;
[2025-06-08 19:38:16] [INFO ] Parsed PT model containing 3039 places and 122330 transitions and 2389226 arcs in 4710 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 40 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (217 resets) in 8094 ms. (4 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 78 ms. (50 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 696 ms. (5 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 101 ms. (39 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 127 ms. (31 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 58 ms. (67 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 67 ms. (58 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 7654 steps, run timeout after 6002 ms. (steps per millisecond=1 ) properties seen :0 out of 16
Probabilistic random walk after 7654 steps, saw 5228 distinct states, run finished after 6007 ms. (steps per millisecond=1 ) properties seen :0
// Phase 1: matrix 122330 rows 3039 cols
[2025-06-08 19:38:32] [INFO ] Computed 11 invariants in 5842 ms
[2025-06-08 19:38:32] [INFO ] Flatten gal took : 13182 ms
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
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem MedleyB-PT-B13-ReachabilityFireability-2025-10 is UNSAT
FORMULA MedleyB-PT-B13-ReachabilityFireability-2025-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 2954/3039 variables, 11/96 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3039 variables, 2954/3050 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3039/125369 variables, and 3050 constraints, problems are : Problem set: 1 solved, 15 unsolved in 8538 ms.
Refiners :[Domain max(s): 3039/3039 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/3039 constraints, PredecessorRefiner: 16/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 15 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Problem MedleyB-PT-B13-ReachabilityFireability-2025-08 is UNSAT
FORMULA MedleyB-PT-B13-ReachabilityFireability-2025-08 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 2962/3039 variables, 11/88 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3039 variables, 2962/3050 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2025-06-08 19:38:45] [INFO ] Flatten gal took : 12473 ms
[2025-06-08 19:38:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6648624748757996588.gal : 2094 ms
[2025-06-08 19:38:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14680667296199010049.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/ReachabilityCardinality6648624748757996588.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14680667296199010049.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
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3039/125369 variables, and 3050 constraints, problems are : Problem set: 2 solved, 14 unsolved in 6629 ms.
Refiners :[Domain max(s): 3039/3039 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/3039 constraints, PredecessorRefiner: 15/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22355ms problems are : Problem set: 2 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 76 out of 3039 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3039/3039 places, 122330/122330 transitions.
Graph (trivial) has 2841 edges and 3039 vertex of which 195 / 3039 are part of one of the 30 SCC in 23 ms
Free SCC test removed 165 places
Drop transitions (Empty/Sink Transition effects.) removed 213 transitions
Reduce isomorphic transitions removed 213 transitions.
Graph (complete) has 5408 edges and 2874 vertex of which 2854 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.394 ms
Discarding 20 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2153 transitions
Trivial Post-agglo rules discarded 2153 transitions
Performed 2153 trivial Post agglomeration. Transition count delta: 2153
Iterating post reduction 0 with 2163 rules applied. Total rules applied 2165 place count 2854 transition count 119944
Reduce places removed 2153 places and 0 transitions.
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 2207 rules applied. Total rules applied 4372 place count 701 transition count 119890
Reduce places removed 21 places and 0 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Iterating post reduction 2 with 50 rules applied. Total rules applied 4422 place count 680 transition count 119861
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 4451 place count 651 transition count 119861
Performed 135 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 135 Pre rules applied. Total rules applied 4451 place count 651 transition count 119726
Deduced a syphon composed of 135 places in 105 ms
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 4 with 270 rules applied. Total rules applied 4721 place count 516 transition count 119726
Discarding 142 places :
Symmetric choice reduction at 4 with 142 rule applications. Total rules 4863 place count 374 transition count 119584
Iterating global reduction 4 with 142 rules applied. Total rules applied 5005 place count 374 transition count 119584
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 5019 place count 374 transition count 119570
Discarding 52 places :
Symmetric choice reduction at 5 with 52 rule applications. Total rules 5071 place count 322 transition count 119499
Iterating global reduction 5 with 52 rules applied. Total rules applied 5123 place count 322 transition count 119499
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 5133 place count 322 transition count 119489
Discarding 23 places :
Symmetric choice reduction at 6 with 23 rule applications. Total rules 5156 place count 299 transition count 119466
Iterating global reduction 6 with 23 rules applied. Total rules applied 5179 place count 299 transition count 119466
Discarding 19 places :
Symmetric choice reduction at 6 with 19 rule applications. Total rules 5198 place count 280 transition count 119447
Iterating global reduction 6 with 19 rules applied. Total rules applied 5217 place count 280 transition count 119447
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 5236 place count 280 transition count 119428
Performed 23 Post agglomeration using F-continuation condition.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 64 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 7 with 56 rules applied. Total rules applied 5292 place count 252 transition count 119400
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 5302 place count 242 transition count 119390
Iterating global reduction 7 with 10 rules applied. Total rules applied 5312 place count 242 transition count 119390
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 5322 place count 232 transition count 119380
Iterating global reduction 7 with 10 rules applied. Total rules applied 5332 place count 232 transition count 119380
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 5342 place count 222 transition count 119370
Iterating global reduction 7 with 10 rules applied. Total rules applied 5352 place count 222 transition count 119370
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 5 places in 206 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 5362 place count 217 transition count 119378
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 5364 place count 217 transition count 119376
Free-agglomeration rule applied 39 times.
Iterating global reduction 8 with 39 rules applied. Total rules applied 5403 place count 217 transition count 119337
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 8 with 39 rules applied. Total rules applied 5442 place count 178 transition count 119337
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 9 with 6 rules applied. Total rules applied 5448 place count 178 transition count 119331
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 5454 place count 172 transition count 119331
Partial Free-agglomeration rule applied 20 times.
Drop transitions (Partial Free agglomeration) removed 20 transitions
Iterating global reduction 10 with 20 rules applied. Total rules applied 5474 place count 172 transition count 119331
Applied a total of 5474 rules in 70361 ms. Remains 172 /3039 variables (removed 2867) and now considering 119331/122330 (removed 2999) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70474 ms. Remains : 172/3039 places, 119331/122330 transitions.
RANDOM walk for 40000 steps (1477 resets) in 51146 ms. (0 steps per ms) remains 13/14 properties
FORMULA MedleyB-PT-B13-ReachabilityFireability-2025-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (163 resets) in 3131 ms. (12 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (168 resets) in 2386 ms. (16 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (164 resets) in 2965 ms. (13 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (166 resets) in 2407 ms. (16 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (163 resets) in 2834 ms. (14 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (164 resets) in 2216 ms. (18 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (161 resets) in 2668 ms. (14 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (166 resets) in 2345 ms. (17 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (163 resets) in 2401 ms. (16 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (163 resets) in 2898 ms. (13 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (163 resets) in 2496 ms. (16 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (159 resets) in 2671 ms. (14 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (169 resets) in 2468 ms. (16 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 64773 steps, run timeout after 69001 ms. (steps per millisecond=0 ) properties seen :0 out of 13
Probabilistic random walk after 64773 steps, saw 20771 distinct states, run finished after 69002 ms. (steps per millisecond=0 ) properties seen :0
// Phase 1: matrix 119331 rows 172 cols
[2025-06-08 19:41:33] [INFO ] Computed 11 invariants in 1916 ms
ITS-tools command line returned an error code 137
[2025-06-08 19:42:30] [INFO ] Flatten gal took : 30997 ms
[2025-06-08 19:42:30] [INFO ] Applying decomposition
[2025-06-08 19:42:44] [INFO ] Flatten gal took : 14558 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/graph14334903193238616220.txt' '-o' '/tmp/graph14334903193238616220.bin' '-w' '/tmp/graph14334903193238616220.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14334903193238616220.bin' '-l' '-1' '-v' '-w' '/tmp/graph14334903193238616220.weights' '-q' '0' '-e' '0.001'
[2025-06-08 19:43:25] [INFO ] Decomposing Gal with order
[2025-06-08 19:43:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 19:44:05] [INFO ] Removed a total of 1191667 redundant transitions.
[2025-06-08 19:44:08] [INFO ] Flatten gal took : 24191 ms
[2025-06-08 19:44:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 59 labels/synchronizations in 9033 ms.
[2025-06-08 19:44:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18318135214578033115.gal : 753 ms
[2025-06-08 19:44:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10070146233471460274.prop : 4 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/ReachabilityCardinality18318135214578033115.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10070146233471460274.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 ...309
Loading property file /tmp/ReachabilityCardinality10070146233471460274.prop.
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :1 after 15
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :15 after 5.53554e+15
[2025-06-08 19:48:20] [INFO ] State equation strengthened by 1008 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
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/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 96/169 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 3/172 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 119503/119503 variables, and 183 constraints, problems are : Problem set: 0 solved, 13 unsolved in 45040 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 172/172 constraints, ReadFeed: 0/1008 constraints, PredecessorRefiner: 13/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 96/169 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 3/172 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
SMT process timed out in 499373ms, After SMT, problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 73 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 119331/119331 transitions.
Graph (trivial) has 16 edges and 172 vertex of which 2 / 172 are part of one of the 1 SCC in 19 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 171 transition count 119328
Deduced a syphon composed of 1 places in 28 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 170 transition count 119328
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 28 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 169 transition count 119327
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 169 transition count 119326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 168 transition count 119325
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 168 transition count 119325
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 168 transition count 119323
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 13 place count 166 transition count 119322
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 23 place count 156 transition count 119312
Iterating global reduction 2 with 10 rules applied. Total rules applied 33 place count 156 transition count 119312
Applied a total of 33 rules in 7538 ms. Remains 156 /172 variables (removed 16) and now considering 119312/119331 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7539 ms. Remains : 156/172 places, 119312/119331 transitions.
RANDOM walk for 40000 steps (1098 resets) in 87480 ms. (0 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (104 resets) in 3093 ms. (12 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (102 resets) in 2754 ms. (14 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (103 resets) in 3933 ms. (10 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (101 resets) in 3481 ms. (11 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (102 resets) in 2766 ms. (14 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (103 resets) in 2910 ms. (13 steps per ms) remains 12/13 properties
FORMULA MedleyB-PT-B13-ReachabilityFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (100 resets) in 4086 ms. (9 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (102 resets) in 2589 ms. (15 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (102 resets) in 3215 ms. (12 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (102 resets) in 3732 ms. (10 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (104 resets) in 2258 ms. (17 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (103 resets) in 1985 ms. (20 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (101 resets) in 2122 ms. (18 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 158122 steps, run timeout after 99003 ms. (steps per millisecond=1 ) properties seen :0 out of 12
Probabilistic random walk after 158122 steps, saw 41265 distinct states, run finished after 99005 ms. (steps per millisecond=1 ) properties seen :0
[2025-06-08 19:52:11] [INFO ] Flow matrix only has 119306 transitions (discarded 6 similar events)
// Phase 1: matrix 119306 rows 156 cols
[2025-06-08 19:52:13] [INFO ] Computed 11 invariants in 1588 ms
ITS-tools command line returned an error code 137
[2025-06-08 19:59:20] [INFO ] State equation strengthened by 1055 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
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/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 83/155 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 1/156 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 119462/119462 variables, and 167 constraints, problems are : Problem set: 0 solved, 12 unsolved in 75071 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 156/156 constraints, ReadFeed: 0/1055 constraints, PredecessorRefiner: 12/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 83/155 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 1/156 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 119462/119462 variables, and 167 constraints, problems are : Problem set: 0 solved, 12 unsolved in 75025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 156/156 constraints, ReadFeed: 0/1055 constraints, PredecessorRefiner: 12/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 579803ms problems are : Problem set: 0 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 72 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 119312/119312 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 156 transition count 119311
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 155 transition count 119311
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 29 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 154 transition count 119310
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 154 transition count 119309
Applied a total of 5 rules in 3424 ms. Remains 154 /156 variables (removed 2) and now considering 119309/119312 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3426 ms. Remains : 154/156 places, 119309/119312 transitions.
RANDOM walk for 40000 steps (1097 resets) in 31502 ms. (1 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (105 resets) in 6971 ms. (5 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (102 resets) in 3911 ms. (10 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (97 resets) in 2096 ms. (19 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (99 resets) in 1561 ms. (25 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (101 resets) in 1645 ms. (24 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (102 resets) in 1919 ms. (20 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (103 resets) in 1485 ms. (26 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (99 resets) in 1581 ms. (25 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (104 resets) in 2495 ms. (16 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (102 resets) in 1972 ms. (20 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (103 resets) in 2146 ms. (18 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (99 resets) in 2308 ms. (17 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 51931 steps, run timeout after 51004 ms. (steps per millisecond=1 ) properties seen :0 out of 12
Probabilistic random walk after 51931 steps, saw 15156 distinct states, run finished after 51005 ms. (steps per millisecond=1 ) properties seen :0
[2025-06-08 20:03:05] [INFO ] Flow matrix only has 119303 transitions (discarded 6 similar events)
// Phase 1: matrix 119303 rows 154 cols
[2025-06-08 20:03:07] [INFO ] Computed 11 invariants in 1840 ms
[2025-06-08 20:09:21] [INFO ] State equation strengthened by 1054 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
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/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 81/153 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 1/154 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 119457/119457 variables, and 165 constraints, problems are : Problem set: 0 solved, 12 unsolved in 90029 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 154/154 constraints, ReadFeed: 0/1054 constraints, PredecessorRefiner: 12/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 81/153 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 1/154 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 119457/119457 variables, and 165 constraints, problems are : Problem set: 0 solved, 12 unsolved in 90033 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 154/154 constraints, ReadFeed: 0/1054 constraints, PredecessorRefiner: 12/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 556152ms problems are : Problem set: 0 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 72 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 119309/119309 transitions.
Applied a total of 0 rules in 1416 ms. Remains 154 /154 variables (removed 0) and now considering 119309/119309 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1416 ms. Remains : 154/154 places, 119309/119309 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 119309/119309 transitions.
Applied a total of 0 rules in 1419 ms. Remains 154 /154 variables (removed 0) and now considering 119309/119309 (removed 0) transitions.
[2025-06-08 20:12:24] [INFO ] Flow matrix only has 119303 transitions (discarded 6 similar events)
[2025-06-08 20:12:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 20:12:24] [INFO ] Implicit Places using invariants in 374 ms returned [153]
Discarding 1 places :
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Implicit Place search using SMT only with invariants took 559 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 153/154 places, 119303/119309 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 149 transition count 119295
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 149 transition count 119295
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 12 place count 149 transition count 119291
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 16 place count 145 transition count 119291
Performed 13 Post agglomeration using F-continuation condition.
Performed 20 Post agglomeration using F-continuation condition.
Performed 20 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 20 places in 50 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 56 place count 125 transition count 119260
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 70 place count 125 transition count 119246
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 124 transition count 119244
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 124 transition count 119244
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 23 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 84 place count 118 transition count 119238
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 90 place count 118 transition count 119238
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 95 place count 118 transition count 119233
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 99 place count 114 transition count 119229
Iterating global reduction 4 with 4 rules applied. Total rules applied 103 place count 114 transition count 119229
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 104 place count 113 transition count 119228
Applied a total of 104 rules in 77366 ms. Remains 113 /153 variables (removed 40) and now considering 119228/119303 (removed 75) transitions.
// Phase 1: matrix 119228 rows 113 cols
[2025-06-08 20:13:43] [INFO ] Computed 10 invariants in 1495 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 20:13:43] [INFO ] Implicit Places using invariants in 1756 ms returned []
Implicit Place search using SMT only with invariants took 1757 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 113/154 places, 119228/119309 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 81104 ms. Remains : 113/154 places, 119228/119309 transitions.
RANDOM walk for 40000 steps (2170 resets) in 32455 ms. (1 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (149 resets) in 2079 ms. (19 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (149 resets) in 1890 ms. (21 steps per ms) remains 11/12 properties
FORMULA MedleyB-PT-B13-ReachabilityFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (149 resets) in 2511 ms. (15 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (150 resets) in 1898 ms. (21 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (146 resets) in 2402 ms. (16 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (151 resets) in 2699 ms. (14 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (151 resets) in 2498 ms. (16 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (149 resets) in 2363 ms. (16 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (150 resets) in 2745 ms. (14 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (150 resets) in 2188 ms. (18 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (147 resets) in 2257 ms. (17 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (151 resets) in 2042 ms. (19 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 96815 steps, run timeout after 54003 ms. (steps per millisecond=1 ) properties seen :0 out of 11
Probabilistic random walk after 96815 steps, saw 23593 distinct states, run finished after 54003 ms. (steps per millisecond=1 ) properties seen :0
[2025-06-08 20:14:56] [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.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 41/113 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 119228/119341 variables, 113/123 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 119341/119341 variables, and 123 constraints, problems are : Problem set: 0 solved, 11 unsolved in 105086 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 11/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 41/113 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 119228/119341 variables, 113/123 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 119341/119341 variables, and 123 constraints, problems are : Problem set: 0 solved, 11 unsolved in 105062 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 11/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 211085ms problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 72 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 119228/119228 transitions.
Applied a total of 0 rules in 1824 ms. Remains 113 /113 variables (removed 0) and now considering 119228/119228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1824 ms. Remains : 113/113 places, 119228/119228 transitions.
RANDOM walk for 40000 steps (2166 resets) in 35113 ms. (1 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (150 resets) in 2199 ms. (18 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (151 resets) in 3194 ms. (12 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (152 resets) in 1857 ms. (21 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (150 resets) in 1954 ms. (20 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (148 resets) in 2191 ms. (18 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (149 resets) in 1885 ms. (21 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (150 resets) in 2018 ms. (19 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (146 resets) in 2245 ms. (17 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (152 resets) in 2049 ms. (19 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (148 resets) in 2681 ms. (14 steps per ms) remains 10/11 properties
FORMULA MedleyB-PT-B13-ReachabilityFireability-2025-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (149 resets) in 2498 ms. (16 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 52863 steps, run timeout after 51004 ms. (steps per millisecond=1 ) properties seen :0 out of 10
Probabilistic random walk after 52863 steps, saw 13608 distinct states, run finished after 51007 ms. (steps per millisecond=1 ) properties seen :0
[2025-06-08 20:19:37] [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.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 41/113 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 119228/119341 variables, 113/123 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119341 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 119341/119341 variables, and 123 constraints, problems are : Problem set: 0 solved, 10 unsolved in 120073 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 10/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 41/113 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 119228/119341 variables, 113/123 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 119341/119341 variables, and 123 constraints, problems are : Problem set: 0 solved, 10 unsolved in 120084 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 10/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 241219ms problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 72 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 119228/119228 transitions.
Applied a total of 0 rules in 1771 ms. Remains 113 /113 variables (removed 0) and now considering 119228/119228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1771 ms. Remains : 113/113 places, 119228/119228 transitions.
RANDOM walk for 40000 steps (2166 resets) in 32235 ms. (1 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (147 resets) in 2211 ms. (18 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (149 resets) in 2983 ms. (13 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (150 resets) in 2359 ms. (16 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (151 resets) in 2103 ms. (19 steps per ms) remains 9/10 properties
FORMULA MedleyB-PT-B13-ReachabilityFireability-2025-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (148 resets) in 2168 ms. (18 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (151 resets) in 1891 ms. (21 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (147 resets) in 1759 ms. (22 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (149 resets) in 2250 ms. (17 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (147 resets) in 1847 ms. (21 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (152 resets) in 1869 ms. (21 steps per ms) remains 9/9 properties
[2025-06-08 20:23:57] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 135.0 s and query timeout 13500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 41/113 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 119341/119341 variables, and 123 constraints, problems are : Problem set: 0 solved, 9 unsolved in 135036 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 9/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 135.0 s and query timeout 13500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 41/113 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 119228/119341 variables, 113/123 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119341 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 119341/119341 variables, and 123 constraints, problems are : Problem set: 0 solved, 9 unsolved in 135067 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 9/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 270941ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 72 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 119228/119228 transitions.
Applied a total of 0 rules in 1902 ms. Remains 113 /113 variables (removed 0) and now considering 119228/119228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1902 ms. Remains : 113/113 places, 119228/119228 transitions.
RANDOM walk for 40000 steps (2170 resets) in 27980 ms. (1 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (151 resets) in 1714 ms. (23 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (148 resets) in 2244 ms. (17 steps per ms) remains 8/9 properties
FORMULA MedleyB-PT-B13-ReachabilityFireability-2025-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (151 resets) in 1737 ms. (23 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (152 resets) in 2166 ms. (18 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (150 resets) in 1761 ms. (22 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (150 resets) in 1771 ms. (22 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (147 resets) in 2556 ms. (15 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (148 resets) in 2091 ms. (19 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (146 resets) in 2411 ms. (16 steps per ms) remains 8/8 properties
[2025-06-08 20:28:43] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 150.0 s and query timeout 15000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 41/113 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 119228/119341 variables, 113/123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119341 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/119341 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119341/119341 variables, and 123 constraints, problems are : Problem set: 0 solved, 8 unsolved in 150072 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 8/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 150.0 s and query timeout 15000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 41/113 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 119228/119341 variables, 113/123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119341 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 119341/119341 variables, and 123 constraints, problems are : Problem set: 0 solved, 8 unsolved in 150057 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 8/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 300870ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 72 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 119228/119228 transitions.
Applied a total of 0 rules in 1789 ms. Remains 113 /113 variables (removed 0) and now considering 119228/119228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1789 ms. Remains : 113/113 places, 119228/119228 transitions.
RANDOM walk for 40000 steps (2173 resets) in 30187 ms. (1 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (152 resets) in 1967 ms. (20 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (147 resets) in 2095 ms. (19 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (151 resets) in 2679 ms. (14 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (148 resets) in 2179 ms. (18 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (152 resets) in 1853 ms. (21 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (147 resets) in 2173 ms. (18 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (148 resets) in 1821 ms. (21 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (148 resets) in 1994 ms. (20 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 77687 steps, run timeout after 39001 ms. (steps per millisecond=1 ) properties seen :0 out of 8
Probabilistic random walk after 77687 steps, saw 19337 distinct states, run finished after 39001 ms. (steps per millisecond=1 ) properties seen :0
[2025-06-08 20:34:38] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 165.0 s and query timeout 16500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 41/113 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 119228/119341 variables, 113/123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119341 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/119341 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119341/119341 variables, and 123 constraints, problems are : Problem set: 0 solved, 8 unsolved in 165071 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 8/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 165.0 s and query timeout 16500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 41/113 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
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="MedleyB-PT-B13"
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 MedleyB-PT-B13, 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 r254-tall-174931340100527"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyB-PT-B13.tgz
mv MedleyB-PT-B13 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 '
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 ;