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-177955809100398.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-14b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955809100398
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.8K Mar 7 06:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Mar 7 06:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 7 06:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 7 06:45 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 4.0K Mar 15 10:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 10:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 10:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Mar 7 06:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 7 06:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 7 06:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Mar 7 06:45 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 726K 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-14b-ReachabilityCardinality-2024-00
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityCardinality-2024-01
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityCardinality-2024-02
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityCardinality-2024-03
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityCardinality-2024-04
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityCardinality-2024-05
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityCardinality-2024-06
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityCardinality-2024-07
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityCardinality-2024-08
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityCardinality-2024-09
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityCardinality-2024-10
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityCardinality-2024-11
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityCardinality-2024-12
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityCardinality-2024-13
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityCardinality-2024-14
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779904637196

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 202604301425
[2026-05-27 17:57:19] [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]
[2026-05-27 17:57:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 17:57:20] [INFO ] Load time of PNML (sax parser for PT used): 451 ms
[2026-05-27 17:57:20] [INFO ] Transformed 2678 places.
[2026-05-27 17:57:20] [INFO ] Transformed 3085 transitions.
[2026-05-27 17:57:20] [INFO ] Found NUPN structural information;
[2026-05-27 17:57:20] [INFO ] Parsed PT model containing 2678 places and 3085 transitions and 7733 arcs in 723 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 38 ms.
Working with output stream class java.io.PrintStream
FORMULA FlexibleBarrier-PT-14b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (403 resets) in 2365 ms. (16 steps per ms) remains 11/15 properties
FORMULA FlexibleBarrier-PT-14b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (38 resets) in 669 ms. (59 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (40 resets) in 353 ms. (113 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (35 resets) in 416 ms. (95 steps per ms) remains 11/11 properties
[2026-05-27 17:57:21] [INFO ] Flatten gal took : 615 ms
BEST_FIRST walk for 40002 steps (37 resets) in 891 ms. (44 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (37 resets) in 512 ms. (77 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (39 resets) in 141 ms. (281 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (38 resets) in 132 ms. (300 steps per ms) remains 11/11 properties
[2026-05-27 17:57:22] [INFO ] Flatten gal took : 398 ms
BEST_FIRST walk for 40004 steps (36 resets) in 182 ms. (218 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (37 resets) in 181 ms. (219 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (37 resets) in 128 ms. (310 steps per ms) remains 11/11 properties
[2026-05-27 17:57:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12847333997231218029.gal : 150 ms
[2026-05-27 17:57:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9763845404902480903.prop : 3 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/ReachabilityCardinality12847333997231218029.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9763845404902480903.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.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17568322343745829710.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7287302461899420313.kers'
[2026-05-27 17:57:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17568322343745829710.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7287302461899420313.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 3085 rows 2678 cols 7733 entries
Finished phase 1 with 2662 SingleSign rule and 0 generalized
[2026-05-27 17:57:22] [INFO ] Computed 16 invariants in 31 ms
Computed 16 P flows in 32 ms.
Exported basis to /tmp/petrispot-output-7287302461899420313.kers
Total runtime 37 ms.
Excessive predecessor constraint size, skipping predecessor.
Loading property file /tmp/ReachabilityCardinality9763845404902480903.prop.
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
Problem FlexibleBarrier-PT-14b-ReachabilityCardinality-2024-04 is UNSAT
FORMULA FlexibleBarrier-PT-14b-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 2554/2678 variables, 16/140 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2678 variables, 2554/2694 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2678 variables, 0/2694 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 3085/5763 variables, 2678/5372 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5763 variables, 0/5372 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5763/5763 variables, and 5372 constraints, problems are : Problem set: 1 solved, 10 unsolved in 5057 ms.
Refiners :[Domain max(s): 2678/2678 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 2678/2678 constraints, PredecessorRefiner: 11/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 88/88 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/88 constraints. Problems are: Problem set: 1 solved, 10 unsolved
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 5
At refinement iteration 2 (OVERLAPS) 2590/2678 variables, 16/104 constraints. Problems are: Problem set: 1 solved, 10 unsolved
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :5 after 10
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
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :50 after 1310
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :1310 after 46705
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :46705 after 6.05142e+07
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :6.05142e+07 after 1.01641e+14
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :1.01641e+14 after 6.65797e+21
At refinement iteration 3 (INCLUDED_ONLY) 0/2678 variables, 2590/2694 constraints. Problems are: Problem set: 1 solved, 10 unsolved
SMT process timed out in 11125ms, After SMT, problems are : Problem set: 1 solved, 10 unsolved
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 88 out of 2678 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2678/2678 places, 3085/3085 transitions.
Graph (trivial) has 2159 edges and 2678 vertex of which 74 / 2678 are part of one of the 12 SCC in 25 ms
Free SCC test removed 62 places
Drop transitions (Empty/Sink Transition effects.) removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 466 transitions
Trivial Post-agglo rules discarded 466 transitions
Performed 466 trivial Post agglomeration. Transition count delta: 466
Iterating post reduction 0 with 466 rules applied. Total rules applied 467 place count 2616 transition count 2544
Reduce places removed 466 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 479 rules applied. Total rules applied 946 place count 2150 transition count 2531
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 959 place count 2137 transition count 2531
Performed 320 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 320 Pre rules applied. Total rules applied 959 place count 2137 transition count 2211
Deduced a syphon composed of 320 places in 2 ms
Reduce places removed 320 places and 0 transitions.
Iterating global reduction 3 with 640 rules applied. Total rules applied 1599 place count 1817 transition count 2211
Discarding 988 places :
Symmetric choice reduction at 3 with 988 rule applications. Total rules 2587 place count 829 transition count 1223
Iterating global reduction 3 with 988 rules applied. Total rules applied 3575 place count 829 transition count 1223
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 3575 place count 829 transition count 1220
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 3581 place count 826 transition count 1220
Discarding 133 places :
Symmetric choice reduction at 3 with 133 rule applications. Total rules 3714 place count 693 transition count 1087
Iterating global reduction 3 with 133 rules applied. Total rules applied 3847 place count 693 transition count 1087
Ensure Unique test removed 118 transitions
Reduce isomorphic transitions removed 118 transitions.
Iterating post reduction 3 with 118 rules applied. Total rules applied 3965 place count 693 transition count 969
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 4135 place count 608 transition count 884
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 4146 place count 608 transition count 873
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 4157 place count 597 transition count 862
Iterating global reduction 5 with 11 rules applied. Total rules applied 4168 place count 597 transition count 862
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4170 place count 596 transition count 862
Free-agglomeration rule applied 233 times.
Iterating global reduction 5 with 233 rules applied. Total rules applied 4403 place count 596 transition count 629
Reduce places removed 233 places and 0 transitions.
Iterating post reduction 5 with 233 rules applied. Total rules applied 4636 place count 363 transition count 629
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 4652 place count 347 transition count 613
Iterating global reduction 6 with 16 rules applied. Total rules applied 4668 place count 347 transition count 613
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 4684 place count 347 transition count 597
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 7 with 26 rules applied. Total rules applied 4710 place count 347 transition count 571
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 4715 place count 347 transition count 571
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4716 place count 347 transition count 570
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 4717 place count 346 transition count 569
Applied a total of 4717 rules in 949 ms. Remains 346 /2678 variables (removed 2332) and now considering 569/3085 (removed 2516) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 959 ms. Remains : 346/2678 places, 569/3085 transitions.
RANDOM walk for 40000 steps (701 resets) in 1211 ms. (33 steps per ms) remains 7/10 properties
FORMULA FlexibleBarrier-PT-14b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (69 resets) in 178 ms. (223 steps per ms) remains 6/7 properties
FORMULA FlexibleBarrier-PT-14b-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (68 resets) in 114 ms. (347 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (63 resets) in 184 ms. (216 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (67 resets) in 100 ms. (396 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (68 resets) in 103 ms. (384 steps per ms) remains 6/6 properties
[2026-05-27 17:57:35] [INFO ] Flow matrix only has 558 transitions (discarded 11 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14252989118312619830.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11408090472498510073.kers'
[2026-05-27 17:57:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14252989118312619830.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11408090472498510073.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 558 rows 346 cols 1492 entries
Finished phase 1 with 330 SingleSign rule and 0 generalized
[2026-05-27 17:57:35] [INFO ] Computed 16 invariants in 3 ms
Computed 16 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-11408090472498510073.kers
Total runtime 6 ms.
[2026-05-27 17:57:35] [INFO ] State equation strengthened by 112 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 290/339 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 554/893 variables, 339/354 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/893 variables, 112/466 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/893 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 11/904 variables, 7/473 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/904 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/904 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/904 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 904/904 variables, and 474 constraints, problems are : Problem set: 0 solved, 6 unsolved in 867 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 346/346 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 6/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 290/339 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 554/893 variables, 339/362 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/893 variables, 112/474 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/893 variables, 4/478 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/893 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 11/904 variables, 7/485 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/904 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/904 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/904 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/904 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 904/904 variables, and 487 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3765 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 346/346 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 6/5 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4684ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
FORMULA FlexibleBarrier-PT-14b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityCardinality-2024-09 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 4 properties in 867 ms.
Support contains 9 out of 346 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 346/346 places, 569/569 transitions.
Graph (trivial) has 262 edges and 346 vertex of which 6 / 346 are part of one of the 2 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 342 transition count 537
Reduce places removed 26 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 316 transition count 536
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 315 transition count 536
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 55 place count 315 transition count 535
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 314 transition count 535
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 58 place count 314 transition count 534
Discarding 47 places :
Symmetric choice reduction at 4 with 47 rule applications. Total rules 105 place count 267 transition count 487
Iterating global reduction 4 with 47 rules applied. Total rules applied 152 place count 267 transition count 487
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 159 place count 267 transition count 480
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 162 place count 264 transition count 477
Iterating global reduction 5 with 3 rules applied. Total rules applied 165 place count 264 transition count 477
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 168 place count 264 transition count 474
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 200 place count 248 transition count 458
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 209 place count 248 transition count 449
Discarding 22 places :
Symmetric choice reduction at 7 with 22 rule applications. Total rules 231 place count 226 transition count 427
Iterating global reduction 7 with 22 rules applied. Total rules applied 253 place count 226 transition count 427
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 274 place count 226 transition count 406
Performed 2 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 278 place count 224 transition count 403
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 292 place count 224 transition count 389
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 293 place count 223 transition count 388
Iterating global reduction 9 with 1 rules applied. Total rules applied 294 place count 223 transition count 388
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 296 place count 223 transition count 386
Free-agglomeration rule applied 137 times with reduction of 9 identical transitions.
Iterating global reduction 9 with 137 rules applied. Total rules applied 433 place count 223 transition count 240
Reduce places removed 138 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 107 transitions
Reduce isomorphic transitions removed 107 transitions.
Graph (trivial) has 72 edges and 85 vertex of which 28 / 85 are part of one of the 14 SCC in 0 ms
Free SCC test removed 14 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 9 with 248 rules applied. Total rules applied 681 place count 71 transition count 131
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 10 with 30 rules applied. Total rules applied 711 place count 69 transition count 103
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 13 Pre rules applied. Total rules applied 711 place count 69 transition count 90
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 11 with 26 rules applied. Total rules applied 737 place count 56 transition count 90
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 11 with 13 rules applied. Total rules applied 750 place count 56 transition count 77
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 12 with 28 rules applied. Total rules applied 778 place count 42 transition count 63
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 779 place count 42 transition count 62
Free-agglomeration rule applied 14 times.
Iterating global reduction 13 with 14 rules applied. Total rules applied 793 place count 42 transition count 48
Reduce places removed 17 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 13 with 33 rules applied. Total rules applied 826 place count 25 transition count 32
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 827 place count 24 transition count 31
Iterating global reduction 14 with 1 rules applied. Total rules applied 828 place count 24 transition count 31
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 14 with 9 rules applied. Total rules applied 837 place count 24 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 838 place count 23 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 839 place count 22 transition count 21
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 842 place count 19 transition count 21
Free-agglomeration rule applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 843 place count 19 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 844 place count 18 transition count 20
Applied a total of 844 rules in 150 ms. Remains 18 /346 variables (removed 328) and now considering 20/569 (removed 549) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 18/346 places, 20/569 transitions.
RANDOM walk for 580 steps (0 resets) in 5 ms. (96 steps per ms) remains 0/2 properties
FORMULA FlexibleBarrier-PT-14b-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityCardinality-2024-13 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 21374 ms.

BK_STOP 1779904661063

--------------------
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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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-5973"
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 r130-smll-177955809100398"
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 ;