fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r086-smll-174860102600462
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 17140.00 0.00 0.00 TFFTTFTTTTTTFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102600462.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102600462
=====================================================================

--------------------
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-ReachabilityCardinality-2025-00
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-2025-01
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-2025-02
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-2025-03
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-2025-04
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-2025-05
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-2025-06
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-2025-07
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-2025-08
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-2025-09
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-2025-10
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-2025-11
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-2025-12
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-2025-13
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-2025-14
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748937248338

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
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
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-03 07:54:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 07:54:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 07:54:10] [INFO ] Load time of PNML (sax parser for PT used): 218 ms
[2025-06-03 07:54:10] [INFO ] Transformed 1402 places.
[2025-06-03 07:54:10] [INFO ] Transformed 1613 transitions.
[2025-06-03 07:54:10] [INFO ] Found NUPN structural information;
[2025-06-03 07:54:10] [INFO ] Parsed PT model containing 1402 places and 1613 transitions and 4025 arcs in 451 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (537 resets) in 2736 ms. (14 steps per ms) remains 10/14 properties
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-2025-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (60 resets) in 304 ms. (131 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (57 resets) in 247 ms. (161 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (59 resets) in 195 ms. (204 steps per ms) remains 9/10 properties
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (58 resets) in 159 ms. (250 steps per ms) remains 9/9 properties
[2025-06-03 07:54:12] [INFO ] Flatten gal took : 439 ms
BEST_FIRST walk for 40004 steps (59 resets) in 680 ms. (58 steps per ms) remains 8/9 properties
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (58 resets) in 129 ms. (307 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (58 resets) in 150 ms. (264 steps per ms) remains 8/8 properties
[2025-06-03 07:54:12] [INFO ] Flatten gal took : 201 ms
[2025-06-03 07:54:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11730574366081890904.gal : 186 ms
[2025-06-03 07:54:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14070777216545840867.prop : 11 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/ReachabilityCardinality11730574366081890904.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14070777216545840867.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (60 resets) in 1703 ms. (23 steps per ms) remains 8/8 properties

its-reach command run as :

BEST_FIRST walk for 40003 steps (55 resets) in 119 ms. (333 steps per ms) remains 8/8 properties
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
// Phase 1: matrix 1613 rows 1402 cols
[2025-06-03 07:54:12] [INFO ] Computed 12 invariants in 55 ms
Loading property file /tmp/ReachabilityCardinality14070777216545840867.prop.
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/90 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 1312/1402 variables, 12/102 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 5
At refinement iteration 3 (INCLUDED_ONLY) 0/1402 variables, 1312/1414 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :10 after 37
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :37 after 38
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :38 after 794
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :794 after 153875
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :153875 after 4.82528e+08
SDD proceeding with computation,8 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: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1613/3015 variables, 1402/2816 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3015 variables, 0/2816 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/3015 variables, 0/2816 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3015/3015 variables, and 2816 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3971 ms.
Refiners :[Domain max(s): 1402/1402 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 1402/1402 constraints, PredecessorRefiner: 8/7 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 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 1312/1402 variables, 12/102 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1402 variables, 1312/1414 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:54:18] [INFO ] Deduced a trap composed of 196 places in 656 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:54:19] [INFO ] Deduced a trap composed of 278 places in 346 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:54:20] [INFO ] Deduced a trap composed of 276 places in 1749 ms of which 601 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:54:22] [INFO ] Deduced a trap composed of 437 places in 1436 ms of which 541 ms to minimize.
SMT process timed out in 9622ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 90 out of 1402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1402/1402 places, 1613/1613 transitions.
Graph (trivial) has 1176 edges and 1402 vertex of which 24 / 1402 are part of one of the 4 SCC in 8 ms
Free SCC test removed 20 places
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 295 transitions
Trivial Post-agglo rules discarded 295 transitions
Performed 295 trivial Post agglomeration. Transition count delta: 295
Iterating post reduction 0 with 295 rules applied. Total rules applied 296 place count 1382 transition count 1294
Reduce places removed 295 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 1 with 314 rules applied. Total rules applied 610 place count 1087 transition count 1275
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 629 place count 1068 transition count 1275
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 93 Pre rules applied. Total rules applied 629 place count 1068 transition count 1182
Deduced a syphon composed of 93 places in 4 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 3 with 186 rules applied. Total rules applied 815 place count 975 transition count 1182
Discarding 450 places :
Symmetric choice reduction at 3 with 450 rule applications. Total rules 1265 place count 525 transition count 732
Iterating global reduction 3 with 450 rules applied. Total rules applied 1715 place count 525 transition count 732
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1716 place count 525 transition count 731
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1716 place count 525 transition count 730
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1718 place count 524 transition count 730
Discarding 54 places :
Symmetric choice reduction at 4 with 54 rule applications. Total rules 1772 place count 470 transition count 676
Iterating global reduction 4 with 54 rules applied. Total rules applied 1826 place count 470 transition count 676
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 4 with 43 rules applied. Total rules applied 1869 place count 470 transition count 633
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 5 with 132 rules applied. Total rules applied 2001 place count 404 transition count 567
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 2004 place count 404 transition count 564
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 2018 place count 397 transition count 587
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 2028 place count 397 transition count 577
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2030 place count 396 transition count 587
Free-agglomeration rule applied 180 times.
Iterating global reduction 6 with 180 rules applied. Total rules applied 2210 place count 396 transition count 407
Reduce places removed 180 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 194 rules applied. Total rules applied 2404 place count 216 transition count 393
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 7 with 25 rules applied. Total rules applied 2429 place count 216 transition count 368
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 2435 place count 216 transition count 368
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 2439 place count 216 transition count 364
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 2440 place count 216 transition count 364
Applied a total of 2440 rules in 603 ms. Remains 216 /1402 variables (removed 1186) and now considering 364/1613 (removed 1249) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 612 ms. Remains : 216/1402 places, 364/1613 transitions.
RANDOM walk for 40000 steps (603 resets) in 595 ms. (67 steps per ms) remains 4/8 properties
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (91 resets) in 79 ms. (500 steps per ms) remains 3/4 properties
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (107 resets) in 97 ms. (408 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (94 resets) in 175 ms. (227 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (93 resets) in 259 ms. (153 steps per ms) remains 3/3 properties
[2025-06-03 07:54:23] [INFO ] Flow matrix only has 350 transitions (discarded 14 similar events)
// Phase 1: matrix 350 rows 216 cols
[2025-06-03 07:54:23] [INFO ] Computed 12 invariants in 2 ms
[2025-06-03 07:54:23] [INFO ] State equation strengthened by 98 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/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 134/213 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3/216 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 350/566 variables, 216/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 98/326 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/566 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 326 constraints, problems are : Problem set: 0 solved, 3 unsolved in 395 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 216/216 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 134/213 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:54:24] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:54:24] [INFO ] Deduced a trap composed of 41 places in 194 ms of which 9 ms to minimize.
Problem FlexibleBarrier-PT-10b-ReachabilityCardinality-2025-12 is UNSAT
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-2025-12 FALSE TECHNIQUES SMT_REFINEMENT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:54:24] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 3/14 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:54:24] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:54:24] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 2/16 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/216 variables, 1/17 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 350/566 variables, 216/233 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 98/331 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 1/332 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/566 variables, 0/332 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/566 variables, 0/332 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 566/566 variables, and 332 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1289 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 216/216 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1719ms problems are : Problem set: 1 solved, 2 unsolved
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-2025-13 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 114 ms.
Support contains 4 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 364/364 transitions.
Graph (trivial) has 168 edges and 216 vertex of which 13 / 216 are part of one of the 6 SCC in 0 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 209 transition count 323
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 181 transition count 323
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 57 place count 181 transition count 321
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 61 place count 179 transition count 321
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 68 place count 179 transition count 314
Discarding 50 places :
Symmetric choice reduction at 3 with 50 rule applications. Total rules 118 place count 129 transition count 263
Iterating global reduction 3 with 50 rules applied. Total rules applied 168 place count 129 transition count 263
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 170 place count 129 transition count 261
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 170 place count 129 transition count 260
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 172 place count 128 transition count 260
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 174 place count 126 transition count 258
Iterating global reduction 4 with 2 rules applied. Total rules applied 176 place count 126 transition count 258
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 177 place count 126 transition count 257
Performed 21 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 219 place count 105 transition count 234
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 5 with 27 rules applied. Total rules applied 246 place count 105 transition count 207
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 253 place count 98 transition count 200
Iterating global reduction 6 with 7 rules applied. Total rules applied 260 place count 98 transition count 200
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 266 place count 98 transition count 194
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 268 place count 97 transition count 194
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 7 with 22 rules applied. Total rules applied 290 place count 97 transition count 172
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 292 place count 96 transition count 171
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 299 place count 96 transition count 164
Free-agglomeration rule applied 34 times with reduction of 1 identical transitions.
Iterating global reduction 8 with 34 rules applied. Total rules applied 333 place count 96 transition count 129
Reduce places removed 34 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 8 with 59 rules applied. Total rules applied 392 place count 62 transition count 104
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 395 place count 62 transition count 101
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 396 place count 62 transition count 100
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 405 place count 61 transition count 92
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 406 place count 61 transition count 92
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 407 place count 60 transition count 91
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 53 edges and 59 vertex of which 20 / 59 are part of one of the 10 SCC in 1 ms
Free SCC test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 10 with 4 rules applied. Total rules applied 411 place count 49 transition count 89
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 11 with 22 rules applied. Total rules applied 433 place count 47 transition count 69
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 8 Pre rules applied. Total rules applied 433 place count 47 transition count 61
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 12 with 16 rules applied. Total rules applied 449 place count 39 transition count 61
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 457 place count 39 transition count 53
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 13 with 22 rules applied. Total rules applied 479 place count 28 transition count 42
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 481 place count 28 transition count 40
Free-agglomeration rule applied 10 times.
Iterating global reduction 14 with 10 rules applied. Total rules applied 491 place count 28 transition count 30
Reduce places removed 17 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 14 with 33 rules applied. Total rules applied 524 place count 11 transition count 14
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 526 place count 11 transition count 12
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 527 place count 11 transition count 12
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 528 place count 11 transition count 11
Applied a total of 528 rules in 77 ms. Remains 11 /216 variables (removed 205) and now considering 11/364 (removed 353) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 11/216 places, 11/364 transitions.
RANDOM walk for 62 steps (2 resets) in 4 ms. (12 steps per ms) remains 0/1 properties
FORMULA FlexibleBarrier-PT-10b-ReachabilityCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 15207 ms.

BK_STOP 1748937265478

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is FlexibleBarrier-PT-10b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r086-smll-174860102600462"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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