Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K 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 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K 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 726K 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-14b-ReachabilityCardinality-2025-00
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityCardinality-2025-01
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityCardinality-2025-02
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityCardinality-2025-03
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityCardinality-2025-04
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityCardinality-2025-05
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityCardinality-2025-06
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityCardinality-2025-07
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityCardinality-2025-08
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityCardinality-2025-09
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityCardinality-2025-10
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityCardinality-2025-11
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityCardinality-2025-12
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityCardinality-2025-13
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityCardinality-2025-14
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748955983454

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-14b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-03 13:06:25] [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 13:06:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 13:06:26] [INFO ] Load time of PNML (sax parser for PT used): 381 ms
[2025-06-03 13:06:26] [INFO ] Transformed 2678 places.
[2025-06-03 13:06:26] [INFO ] Transformed 3085 transitions.
[2025-06-03 13:06:26] [INFO ] Found NUPN structural information;
[2025-06-03 13:06:26] [INFO ] Parsed PT model containing 2678 places and 3085 transitions and 7733 arcs in 590 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 45 ms.
Working with output stream class java.io.PrintStream
FORMULA FlexibleBarrier-PT-14b-ReachabilityCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14b-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14b-ReachabilityCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (403 resets) in 2886 ms. (13 steps per ms) remains 11/13 properties
FORMULA FlexibleBarrier-PT-14b-ReachabilityCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (36 resets) in 521 ms. (76 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (37 resets) in 490 ms. (81 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (38 resets) in 508 ms. (78 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (36 resets) in 120 ms. (330 steps per ms) remains 11/11 properties
[2025-06-03 13:06:28] [INFO ] Flatten gal took : 743 ms
BEST_FIRST walk for 40003 steps (35 resets) in 192 ms. (207 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (36 resets) in 113 ms. (350 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (36 resets) in 198 ms. (201 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (36 resets) in 83 ms. (476 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (36 resets) in 202 ms. (197 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (37 resets) in 209 ms. (190 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (36 resets) in 88 ms. (449 steps per ms) remains 11/11 properties
[2025-06-03 13:06:28] [INFO ] Flatten gal took : 340 ms
// Phase 1: matrix 3085 rows 2678 cols
[2025-06-03 13:06:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8797252244101041791.gal : 139 ms
[2025-06-03 13:06:28] [INFO ] Computed 16 invariants in 134 ms
Excessive predecessor constraint size, skipping predecessor.
[2025-06-03 13:06:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17358396863551417624.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8797252244101041791.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17358396863551417624.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
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/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Loading property file /tmp/ReachabilityCardinality17358396863551417624.prop.
At refinement iteration 2 (OVERLAPS) 2542/2666 variables, 15/139 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2666 variables, 2542/2681 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2666 variables, 0/2681 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 12/2678 variables, 1/2682 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2678 variables, 12/2694 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2678 variables, 0/2694 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SMT process timed out in 5481ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 124 out of 2678 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2678/2678 places, 3085/3085 transitions.
Graph (trivial) has 2432 edges and 2678 vertex of which 86 / 2678 are part of one of the 14 SCC in 14 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 577 transitions
Trivial Post-agglo rules discarded 577 transitions
Performed 577 trivial Post agglomeration. Transition count delta: 577
Iterating post reduction 0 with 577 rules applied. Total rules applied 578 place count 2606 transition count 2421
Reduce places removed 577 places and 0 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Iterating post reduction 1 with 606 rules applied. Total rules applied 1184 place count 2029 transition count 2392
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 1213 place count 2000 transition count 2392
Performed 165 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 165 Pre rules applied. Total rules applied 1213 place count 2000 transition count 2227
Deduced a syphon composed of 165 places in 2 ms
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 3 with 330 rules applied. Total rules applied 1543 place count 1835 transition count 2227
Discarding 966 places :
Symmetric choice reduction at 3 with 966 rule applications. Total rules 2509 place count 869 transition count 1261
Iterating global reduction 3 with 966 rules applied. Total rules applied 3475 place count 869 transition count 1261
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 3475 place count 869 transition count 1256
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 3485 place count 864 transition count 1256
Discarding 122 places :
Symmetric choice reduction at 3 with 122 rule applications. Total rules 3607 place count 742 transition count 1134
Iterating global reduction 3 with 122 rules applied. Total rules applied 3729 place count 742 transition count 1134
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 3 with 102 rules applied. Total rules applied 3831 place count 742 transition count 1032
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 3985 place count 665 transition count 955
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 4009 place count 665 transition count 931
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 4020 place count 654 transition count 920
Iterating global reduction 5 with 11 rules applied. Total rules applied 4031 place count 654 transition count 920
Free-agglomeration rule applied 411 times.
Iterating global reduction 5 with 411 rules applied. Total rules applied 4442 place count 654 transition count 509
Reduce places removed 411 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Iterating post reduction 5 with 515 rules applied. Total rules applied 4957 place count 243 transition count 405
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 6 with 13 rules applied. Total rules applied 4970 place count 243 transition count 392
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 4973 place count 243 transition count 392
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4974 place count 243 transition count 391
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 4975 place count 242 transition count 390
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t2.t3.t4.t2667.t1870.t1871 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 65 edges and 240 vertex of which 10 / 240 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 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 7 with 5 rules applied. Total rules applied 4980 place count 235 transition count 386
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 8 with 15 rules applied. Total rules applied 4995 place count 233 transition count 373
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 4998 place count 230 transition count 373
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 15 Pre rules applied. Total rules applied 4998 place count 230 transition count 358
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 10 with 30 rules applied. Total rules applied 5028 place count 215 transition count 358
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 10 with 10 rules applied. Total rules applied 5038 place count 215 transition count 348
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 11 with 30 rules applied. Total rules applied 5068 place count 200 transition count 333
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 5069 place count 200 transition count 332
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 5070 place count 200 transition count 331
Free-agglomeration rule applied 14 times.
Iterating global reduction 12 with 14 rules applied. Total rules applied 5084 place count 200 transition count 317
Reduce places removed 14 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 19 rules applied. Total rules applied 5103 place count 186 transition count 312
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 13 with 3 rules applied. Total rules applied 5106 place count 186 transition count 309
Free-agglomeration rule applied 3 times.
Iterating global reduction 13 with 3 rules applied. Total rules applied 5109 place count 186 transition count 306
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 5112 place count 183 transition count 306
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 5113 place count 183 transition count 306
Applied a total of 5113 rules in 1238 ms. Remains 183 /2678 variables (removed 2495) and now considering 306/3085 (removed 2779) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1255 ms. Remains : 183/2678 places, 306/3085 transitions.
RANDOM walk for 40000 steps (8 resets) in 430 ms. (92 steps per ms) remains 7/11 properties
FORMULA FlexibleBarrier-PT-14b-ReachabilityCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40001 steps (8 resets) in 180 ms. (221 steps per ms) remains 4/7 properties
FORMULA FlexibleBarrier-PT-14b-ReachabilityCardinality-2025-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 5
BEST_FIRST walk for 40002 steps (8 resets) in 169 ms. (235 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 251 ms. (158 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 4/4 properties
[2025-06-03 13:06:35] [INFO ] Flow matrix only has 281 transitions (discarded 25 similar events)
// Phase 1: matrix 281 rows 183 cols
[2025-06-03 13:06:35] [INFO ] Computed 15 invariants in 2 ms
[2025-06-03 13:06:35] [INFO ] State equation strengthened by 70 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/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 113/183 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :5 after 10
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :10 after 20
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :20 after 50
At refinement iteration 3 (OVERLAPS) 281/464 variables, 183/198 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :50 after 1310
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 70/268 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :1310 after 46705
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :46705 after 6.05142e+07
At refinement iteration 6 (OVERLAPS) 0/464 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/464 variables, and 268 constraints, problems are : Problem set: 0 solved, 4 unsolved in 593 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 183/183 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :6.05142e+07 after 1.01641e+14
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem FlexibleBarrier-PT-14b-ReachabilityCardinality-2025-13 is UNSAT
FORMULA FlexibleBarrier-PT-14b-ReachabilityCardinality-2025-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 113/183 variables, 15/15 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:06:36] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :1.01641e+14 after 6.65797e+21
[2025-06-03 13:06:36] [INFO ] Deduced a trap composed of 20 places in 165 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:06:36] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:06:36] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:06:37] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:06:37] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:06:37] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:06:37] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:06:37] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:06:37] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:06:37] [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 13:06:37] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:06:38] [INFO ] Deduced a trap composed of 34 places in 166 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:06:38] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:06:38] [INFO ] Deduced a trap composed of 34 places in 172 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 15/30 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:06:38] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:06:38] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:06:38] [INFO ] Deduced a trap composed of 36 places in 149 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:06:39] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:06:39] [INFO ] Deduced a trap composed of 39 places in 165 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:06:39] [INFO ] Deduced a trap composed of 34 places in 165 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:06:39] [INFO ] Deduced a trap composed of 37 places in 157 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:06:39] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:06:39] [INFO ] Deduced a trap composed of 38 places in 141 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:06:40] [INFO ] Deduced a trap composed of 38 places in 156 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:06:40] [INFO ] Deduced a trap composed of 43 places in 120 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 11/41 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 281/464 variables, 183/224 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 70/294 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 3/297 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:06:40] [INFO ] Deduced a trap composed of 30 places in 156 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:06:40] [INFO ] Deduced a trap composed of 31 places in 191 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:06:41] [INFO ] Deduced a trap composed of 30 places in 185 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:06:41] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:06:41] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 14 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 5/302 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:06:41] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 23 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/464 variables, 1/303 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:06:42] [INFO ] Deduced a trap composed of 29 places in 168 ms of which 13 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/464 variables, 1/304 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/464 variables, 0/304 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/464 variables, 0/304 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 464/464 variables, and 304 constraints, problems are : Problem set: 1 solved, 3 unsolved in 6495 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 183/183 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7133ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
FORMULA FlexibleBarrier-PT-14b-ReachabilityCardinality-2025-01 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityCardinality-2025-00 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 35 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=17 )
FORMULA FlexibleBarrier-PT-14b-ReachabilityCardinality-2025-12 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 47 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 17106 ms.

BK_STOP 1748956002875

--------------------
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-14b"
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-14b, 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-174860102600494"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-14b.tgz
mv FlexibleBarrier-PT-14b 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 ;