Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r130-smll-177955809100383.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is FlexibleBarrier-PT-12b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955809100383
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1016K
-rw-r--r-- 1 mcc users 7.3K Mar 7 05:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Mar 7 05:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 7 05:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 7 05:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 10:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 10:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 10:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 7 05:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Mar 7 05:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Mar 7 05:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Mar 7 05:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 536K Mar 3 18:30 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-12b-ReachabilityFireability-2024-00
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-01
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-02
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-03
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-04
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-05
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-06
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-07
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-08
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-09
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-10
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-11
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-12
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-13
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-14
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779895577109

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-12b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-27 15:26:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-27 15:26:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 15:26:19] [INFO ] Load time of PNML (sax parser for PT used): 287 ms
[2026-05-27 15:26:19] [INFO ] Transformed 1988 places.
[2026-05-27 15:26:19] [INFO ] Transformed 2289 transitions.
[2026-05-27 15:26:19] [INFO ] Found NUPN structural information;
[2026-05-27 15:26:19] [INFO ] Parsed PT model containing 1988 places and 2289 transitions and 5727 arcs in 522 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (463 resets) in 2674 ms. (14 steps per ms) remains 14/16 properties
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (49 resets) in 463 ms. (86 steps per ms) remains 14/14 properties
[2026-05-27 15:26:21] [INFO ] Flatten gal took : 570 ms
BEST_FIRST walk for 40004 steps (48 resets) in 1253 ms. (31 steps per ms) remains 13/14 properties
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (45 resets) in 270 ms. (147 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (42 resets) in 257 ms. (155 steps per ms) remains 13/13 properties
[2026-05-27 15:26:21] [INFO ] Flatten gal took : 279 ms
BEST_FIRST walk for 40003 steps (47 resets) in 265 ms. (150 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (43 resets) in 196 ms. (203 steps per ms) remains 13/13 properties
[2026-05-27 15:26:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17576177958938980517.gal : 136 ms
BEST_FIRST walk for 40004 steps (23 resets) in 432 ms. (92 steps per ms) remains 13/13 properties
[2026-05-27 15:26:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11134315756366535051.prop : 12 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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17576177958938980517.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11134315756366535051.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (44 resets) in 167 ms. (238 steps per ms) remains 13/13 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 40004 steps (42 resets) in 249 ms. (160 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (44 resets) in 123 ms. (322 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (23 resets) in 88 ms. (449 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (40 resets) in 177 ms. (224 steps per ms) remains 12/13 properties
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (44 resets) in 116 ms. (341 steps per ms) remains 12/12 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15972176823021642820.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7730999236482066695.kers'
Loading property file /tmp/ReachabilityCardinality11134315756366535051.prop.
[2026-05-27 15:26:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15972176823021642820.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7730999236482066695.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 2289 rows 1988 cols 5727 entries
Finished phase 1 with 1974 SingleSign rule and 0 generalized
[2026-05-27 15:26:22] [INFO ] Computed 14 invariants in 14 ms
Computed 14 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-7730999236482066695.kers
Total runtime 19 ms.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 147/147 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem FlexibleBarrier-PT-12b-ReachabilityFireability-2024-03 is UNSAT
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem FlexibleBarrier-PT-12b-ReachabilityFireability-2024-12 is UNSAT
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1841/1988 variables, 14/161 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1988 variables, 1841/2002 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1988 variables, 0/2002 constraints. Problems are: Problem set: 2 solved, 10 unsolved
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :10 after 40
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :40 after 44
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :44 after 1036
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :1036 after 65612
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :65612 after 1.00765e+08
SDD proceeding with computation,13 properties remain. new max is 512
SDD size :1.00765e+08 after 1.40879e+14
At refinement iteration 5 (OVERLAPS) 2289/4277 variables, 1988/3990 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4277 variables, 0/3990 constraints. Problems are: Problem set: 2 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4277/4277 variables, and 3990 constraints, problems are : Problem set: 2 solved, 10 unsolved in 5050 ms.
Refiners :[Domain max(s): 1988/1988 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 1988/1988 constraints, PredecessorRefiner: 12/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 129/129 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/129 constraints. Problems are: Problem set: 2 solved, 10 unsolved
Problem FlexibleBarrier-PT-12b-ReachabilityFireability-2024-09 is UNSAT
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1859/1988 variables, 14/143 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1988 variables, 1859/2002 constraints. Problems are: Problem set: 3 solved, 9 unsolved
SMT process timed out in 12028ms, After SMT, problems are : Problem set: 3 solved, 9 unsolved
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 128 out of 1988 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1988/1988 places, 2289/2289 transitions.
Graph (trivial) has 1374 edges and 1988 vertex of which 20 / 1988 are part of one of the 3 SCC in 24 ms
Free SCC test removed 17 places
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 332 transitions
Trivial Post-agglo rules discarded 332 transitions
Performed 332 trivial Post agglomeration. Transition count delta: 332
Iterating post reduction 0 with 332 rules applied. Total rules applied 333 place count 1971 transition count 1936
Reduce places removed 332 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 1 with 356 rules applied. Total rules applied 689 place count 1639 transition count 1912
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 713 place count 1615 transition count 1912
Performed 216 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 216 Pre rules applied. Total rules applied 713 place count 1615 transition count 1696
Deduced a syphon composed of 216 places in 4 ms
Reduce places removed 216 places and 0 transitions.
Iterating global reduction 3 with 432 rules applied. Total rules applied 1145 place count 1399 transition count 1696
Discarding 692 places :
Symmetric choice reduction at 3 with 692 rule applications. Total rules 1837 place count 707 transition count 1004
Iterating global reduction 3 with 692 rules applied. Total rules applied 2529 place count 707 transition count 1004
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 2529 place count 707 transition count 1000
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 2537 place count 703 transition count 1000
Discarding 83 places :
Symmetric choice reduction at 3 with 83 rule applications. Total rules 2620 place count 620 transition count 917
Iterating global reduction 3 with 83 rules applied. Total rules applied 2703 place count 620 transition count 917
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 3 with 68 rules applied. Total rules applied 2771 place count 620 transition count 849
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 1 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 4 with 172 rules applied. Total rules applied 2943 place count 534 transition count 763
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 2957 place count 527 transition count 763
Free-agglomeration rule applied 75 times.
Iterating global reduction 4 with 75 rules applied. Total rules applied 3032 place count 527 transition count 688
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 4 with 75 rules applied. Total rules applied 3107 place count 452 transition count 688
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 3118 place count 452 transition count 677
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 3124 place count 452 transition count 677
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 3125 place count 452 transition count 677
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3126 place count 451 transition count 676
Applied a total of 3126 rules in 744 ms. Remains 451 /1988 variables (removed 1537) and now considering 676/2289 (removed 1613) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 760 ms. Remains : 451/1988 places, 676/2289 transitions.
RANDOM walk for 40000 steps (726 resets) in 1435 ms. (27 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (57 resets) in 116 ms. (341 steps per ms) remains 8/9 properties
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (60 resets) in 350 ms. (113 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (61 resets) in 78 ms. (506 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (55 resets) in 239 ms. (166 steps per ms) remains 7/8 properties
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (60 resets) in 145 ms. (274 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (16 resets) in 134 ms. (296 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (46 resets) in 175 ms. (227 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (58 resets) in 101 ms. (392 steps per ms) remains 7/7 properties
[2026-05-27 15:26:35] [INFO ] Flow matrix only has 666 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1220329024971853062.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2266234281636918085.kers'
[2026-05-27 15:26:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1220329024971853062.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2266234281636918085.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 666 rows 451 cols 2110 entries
Finished phase 1 with 437 SingleSign rule and 0 generalized
[2026-05-27 15:26:35] [INFO ] Computed 14 invariants in 4 ms
Computed 14 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-2266234281636918085.kers
Total runtime 8 ms.
[2026-05-27 15:26:35] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 354/451 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/451 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 666/1117 variables, 451/465 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1117 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1117 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/1117 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1117/1117 variables, and 466 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1492 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 451/451 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 354/451 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/451 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/451 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 666/1117 variables, 451/466 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1117 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1117 variables, 4/471 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1117 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1117 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/1117 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1117 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1117 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/1117 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1117/1117 variables, and 474 constraints, problems are : Problem set: 0 solved, 7 unsolved in 6624 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 451/451 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/4 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8173ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-11 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-00 FALSE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-01 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-02 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-06 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-10 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 6 properties in 990 ms.
Support contains 16 out of 451 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 451/451 places, 676/676 transitions.
Graph (trivial) has 221 edges and 451 vertex of which 20 / 451 are part of one of the 7 SCC in 2 ms
Free SCC test removed 13 places
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 438 transition count 632
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 49 place count 414 transition count 632
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 49 place count 414 transition count 625
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 63 place count 407 transition count 625
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 72 place count 407 transition count 616
Discarding 59 places :
Symmetric choice reduction at 3 with 59 rule applications. Total rules 131 place count 348 transition count 557
Iterating global reduction 3 with 59 rules applied. Total rules applied 190 place count 348 transition count 557
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 197 place count 348 transition count 550
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 198 place count 347 transition count 549
Iterating global reduction 4 with 1 rules applied. Total rules applied 199 place count 347 transition count 549
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 200 place count 347 transition count 548
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 252 place count 321 transition count 522
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 258 place count 321 transition count 516
Discarding 27 places :
Symmetric choice reduction at 6 with 27 rule applications. Total rules 285 place count 294 transition count 489
Iterating global reduction 6 with 27 rules applied. Total rules applied 312 place count 294 transition count 489
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 6 with 22 rules applied. Total rules applied 334 place count 294 transition count 467
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 339 place count 294 transition count 462
Free-agglomeration rule applied 74 times with reduction of 3 identical transitions.
Iterating global reduction 7 with 74 rules applied. Total rules applied 413 place count 294 transition count 385
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 60 edges and 219 vertex of which 20 / 219 are part of one of the 10 SCC in 1 ms
Free SCC test removed 10 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 79 rules applied. Total rules applied 492 place count 209 transition count 382
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 513 place count 208 transition count 362
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 12 Pre rules applied. Total rules applied 513 place count 208 transition count 350
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 24 rules applied. Total rules applied 537 place count 196 transition count 350
Discarding 22 places :
Symmetric choice reduction at 9 with 22 rule applications. Total rules 559 place count 174 transition count 328
Iterating global reduction 9 with 22 rules applied. Total rules applied 581 place count 174 transition count 328
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 9 with 22 rules applied. Total rules applied 603 place count 174 transition count 306
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 10 with 26 rules applied. Total rules applied 629 place count 161 transition count 293
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 633 place count 159 transition count 293
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 637 place count 159 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 11 with 14 rules applied. Total rules applied 651 place count 159 transition count 275
Free-agglomeration rule applied 10 times.
Iterating global reduction 11 with 10 rules applied. Total rules applied 661 place count 159 transition count 265
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 11 with 32 rules applied. Total rules applied 693 place count 145 transition count 247
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 12 rules applied. Total rules applied 705 place count 139 transition count 241
Discarding 26 places :
Symmetric choice reduction at 13 with 26 rule applications. Total rules 731 place count 113 transition count 215
Iterating global reduction 13 with 26 rules applied. Total rules applied 757 place count 113 transition count 215
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 13 with 26 rules applied. Total rules applied 783 place count 113 transition count 189
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 14 with 8 rules applied. Total rules applied 791 place count 113 transition count 181
Applied a total of 791 rules in 203 ms. Remains 113 /451 variables (removed 338) and now considering 181/676 (removed 495) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 113/451 places, 181/676 transitions.
RANDOM walk for 32675 steps (2878 resets) in 210 ms. (154 steps per ms) remains 0/1 properties
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-08 FALSE 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 26085 ms.

BK_STOP 1779895605372

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is FlexibleBarrier-PT-12b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r130-smll-177955809100383"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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