fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r086-smll-174860102600463
Last Updated
June 24, 2025

About the Execution of ITS-Tools for FlexibleBarrier-PT-10b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 18870.00 0.00 0.00 TFFTTFFFTTTFTFTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102600463.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 FlexibleBarrier-PT-10b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102600463
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 374K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748937275763

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-10b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-03 07:54:37] [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-03 07:54:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 07:54:37] [INFO ] Load time of PNML (sax parser for PT used): 219 ms
[2025-06-03 07:54:37] [INFO ] Transformed 1402 places.
[2025-06-03 07:54:37] [INFO ] Transformed 1613 transitions.
[2025-06-03 07:54:37] [INFO ] Found NUPN structural information;
[2025-06-03 07:54:37] [INFO ] Parsed PT model containing 1402 places and 1613 transitions and 4025 arcs in 388 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (531 resets) in 2051 ms. (19 steps per ms) remains 12/16 properties
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2025-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2025-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2025-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (44 resets) in 553 ms. (72 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (55 resets) in 739 ms. (54 steps per ms) remains 12/12 properties
[2025-06-03 07:54:39] [INFO ] Flatten gal took : 520 ms
BEST_FIRST walk for 40004 steps (8 resets) in 331 ms. (120 steps per ms) remains 11/12 properties
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2025-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (26 resets) in 582 ms. (68 steps per ms) remains 11/11 properties
[2025-06-03 07:54:39] [INFO ] Flatten gal took : 256 ms
BEST_FIRST walk for 40003 steps (59 resets) in 280 ms. (142 steps per ms) remains 11/11 properties
[2025-06-03 07:54:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1421309129866927151.gal : 119 ms
BEST_FIRST walk for 40003 steps (53 resets) in 258 ms. (154 steps per ms) remains 10/11 properties
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2025-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2025-06-03 07:54:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18271422628062744396.prop : 4 ms
BEST_FIRST walk for 40003 steps (61 resets) in 134 ms. (296 steps per ms) remains 10/10 properties
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/ReachabilityCardinality1421309129866927151.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18271422628062744396.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (58 resets) in 127 ms. (312 steps per ms) remains 9/10 properties
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2025-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (58 resets) in 107 ms. (370 steps per ms) remains 9/9 properties

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
BEST_FIRST walk for 40003 steps (56 resets) in 128 ms. (310 steps per ms) remains 8/9 properties
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2025-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (58 resets) in 191 ms. (208 steps per ms) remains 8/8 properties
// Phase 1: matrix 1613 rows 1402 cols
[2025-06-03 07:54:40] [INFO ] Computed 12 invariants in 64 ms
Loading property file /tmp/ReachabilityCardinality18271422628062744396.prop.
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/142 variables, 142/142 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem FlexibleBarrier-PT-10b-ReachabilityFireability-2025-05 is UNSAT
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2025-05 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1260/1402 variables, 12/154 constraints. Problems are: Problem set: 1 solved, 7 unsolved
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :10 after 37
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :37 after 38
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :38 after 794
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :794 after 153875
At refinement iteration 3 (INCLUDED_ONLY) 0/1402 variables, 1260/1414 constraints. Problems are: Problem set: 1 solved, 7 unsolved
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :153875 after 4.82528e+08
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :4.82528e+08 after 3.28366e+14
At refinement iteration 4 (INCLUDED_ONLY) 0/1402 variables, 0/1414 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1613/3015 variables, 1402/2816 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3015 variables, 0/2816 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/3015 variables, 0/2816 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3015/3015 variables, and 2816 constraints, problems are : Problem set: 1 solved, 7 unsolved in 3599 ms.
Refiners :[Domain max(s): 1402/1402 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 1402/1402 constraints, PredecessorRefiner: 8/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 108/108 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/108 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem FlexibleBarrier-PT-10b-ReachabilityFireability-2025-04 is UNSAT
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2025-04 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1294/1402 variables, 12/120 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1402 variables, 1294/1414 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:54:46] [INFO ] Deduced a trap composed of 437 places in 1513 ms of which 608 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:54:47] [INFO ] Deduced a trap composed of 439 places in 1186 ms of which 424 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:54:48] [INFO ] Deduced a trap composed of 437 places in 1235 ms of which 429 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:54:49] [INFO ] Deduced a trap composed of 437 places in 1089 ms of which 453 ms to minimize.
SMT process timed out in 9961ms, After SMT, problems are : Problem set: 2 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 84 out of 1402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1402/1402 places, 1613/1613 transitions.
Graph (trivial) has 952 edges and 1402 vertex of which 12 / 1402 are part of one of the 2 SCC in 11 ms
Free SCC test removed 10 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 250 transitions
Trivial Post-agglo rules discarded 250 transitions
Performed 250 trivial Post agglomeration. Transition count delta: 250
Iterating post reduction 0 with 250 rules applied. Total rules applied 251 place count 1392 transition count 1351
Reduce places removed 250 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 1 with 265 rules applied. Total rules applied 516 place count 1142 transition count 1336
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 531 place count 1127 transition count 1336
Performed 140 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 140 Pre rules applied. Total rules applied 531 place count 1127 transition count 1196
Deduced a syphon composed of 140 places in 3 ms
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 3 with 280 rules applied. Total rules applied 811 place count 987 transition count 1196
Discarding 458 places :
Symmetric choice reduction at 3 with 458 rule applications. Total rules 1269 place count 529 transition count 738
Iterating global reduction 3 with 458 rules applied. Total rules applied 1727 place count 529 transition count 738
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1727 place count 529 transition count 735
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1733 place count 526 transition count 735
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 1789 place count 470 transition count 679
Iterating global reduction 3 with 56 rules applied. Total rules applied 1845 place count 470 transition count 679
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 3 with 43 rules applied. Total rules applied 1888 place count 470 transition count 636
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 2036 place count 396 transition count 562
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 2052 place count 388 transition count 562
Free-agglomeration rule applied 54 times.
Iterating global reduction 4 with 54 rules applied. Total rules applied 2106 place count 388 transition count 508
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 4 with 54 rules applied. Total rules applied 2160 place count 334 transition count 508
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 2169 place count 334 transition count 499
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 2177 place count 334 transition count 499
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2178 place count 333 transition count 498
Applied a total of 2178 rules in 574 ms. Remains 333 /1402 variables (removed 1069) and now considering 498/1613 (removed 1115) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 587 ms. Remains : 333/1402 places, 498/1613 transitions.
RANDOM walk for 40000 steps (1151 resets) in 1519 ms. (26 steps per ms) remains 2/6 properties
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (43 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (84 resets) in 228 ms. (174 steps per ms) remains 2/2 properties
[2025-06-03 07:54:51] [INFO ] Flow matrix only has 491 transitions (discarded 7 similar events)
// Phase 1: matrix 491 rows 333 cols
[2025-06-03 07:54:51] [INFO ] Computed 12 invariants in 9 ms
[2025-06-03 07:54:51] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 273/317 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 478/795 variables, 317/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/795 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/795 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 25/820 variables, 12/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/820 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/824 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/824 variables, 4/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/824 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/824 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 824/824 variables, and 346 constraints, problems are : Problem set: 0 solved, 2 unsolved in 504 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 333/333 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 273/317 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:54:52] [INFO ] Deduced a trap composed of 133 places in 252 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:54:52] [INFO ] Deduced a trap composed of 135 places in 239 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:54:52] [INFO ] Deduced a trap composed of 115 places in 229 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:54:52] [INFO ] Deduced a trap composed of 37 places in 260 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:54:53] [INFO ] Deduced a trap composed of 118 places in 186 ms of which 26 ms to minimize.
Problem FlexibleBarrier-PT-10b-ReachabilityFireability-2025-06 is UNSAT
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2025-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 5/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:54:53] [INFO ] Deduced a trap composed of 133 places in 195 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:54:53] [INFO ] Deduced a trap composed of 136 places in 220 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:54:53] [INFO ] Deduced a trap composed of 135 places in 215 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:54:53] [INFO ] Deduced a trap composed of 138 places in 209 ms of which 24 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 4/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 478/795 variables, 317/337 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/795 variables, 1/338 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/795 variables, 0/338 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 25/820 variables, 12/350 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/820 variables, 1/351 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/820 variables, 0/351 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/824 variables, 1/352 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/824 variables, 4/356 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/824 variables, 0/356 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/824 variables, 0/356 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 824/824 variables, and 356 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2803 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 333/333 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3356ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 1560 steps, including 45 resets, run visited all 1 properties in 12 ms. (steps per millisecond=130 )
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-2025-00 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 22 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 17020 ms.

BK_STOP 1748937294633

--------------------
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="FlexibleBarrier-PT-10b"
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 FlexibleBarrier-PT-10b, 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 r086-smll-174860102600463"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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