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.r146-tall-177961074400807.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 HirschbergSinclair-PT-50, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074400807
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 13K Mar 7 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Mar 7 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Mar 7 17:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 7 17:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.5K Mar 15 10:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 10:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 10:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Mar 7 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Mar 7 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 7 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 7 17:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 10:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 15 10:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 652K 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 HirschbergSinclair-PT-50-ReachabilityFireability-2024-00
FORMULA_NAME HirschbergSinclair-PT-50-ReachabilityFireability-2024-01
FORMULA_NAME HirschbergSinclair-PT-50-ReachabilityFireability-2024-02
FORMULA_NAME HirschbergSinclair-PT-50-ReachabilityFireability-2024-03
FORMULA_NAME HirschbergSinclair-PT-50-ReachabilityFireability-2024-04
FORMULA_NAME HirschbergSinclair-PT-50-ReachabilityFireability-2024-05
FORMULA_NAME HirschbergSinclair-PT-50-ReachabilityFireability-2024-06
FORMULA_NAME HirschbergSinclair-PT-50-ReachabilityFireability-2024-07
FORMULA_NAME HirschbergSinclair-PT-50-ReachabilityFireability-2024-08
FORMULA_NAME HirschbergSinclair-PT-50-ReachabilityFireability-2024-09
FORMULA_NAME HirschbergSinclair-PT-50-ReachabilityFireability-2024-10
FORMULA_NAME HirschbergSinclair-PT-50-ReachabilityFireability-2024-11
FORMULA_NAME HirschbergSinclair-PT-50-ReachabilityFireability-2024-12
FORMULA_NAME HirschbergSinclair-PT-50-ReachabilityFireability-2024-13
FORMULA_NAME HirschbergSinclair-PT-50-ReachabilityFireability-2024-14
FORMULA_NAME HirschbergSinclair-PT-50-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779763965065

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-50
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-26 02:52:46] [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-26 02:52:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 02:52:46] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2026-05-26 02:52:46] [INFO ] Transformed 1208 places.
[2026-05-26 02:52:46] [INFO ] Transformed 1102 transitions.
[2026-05-26 02:52:46] [INFO ] Parsed PT model containing 1208 places and 1102 transitions and 3361 arcs in 213 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2026-05-26 02:52:47] [INFO ] Flatten gal took : 145 ms
RANDOM walk for 40000 steps (36 resets) in 1688 ms. (23 steps per ms) remains 5/16 properties
FORMULA HirschbergSinclair-PT-50-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-50-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-50-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-50-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-50-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-50-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-50-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-50-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-50-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-50-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-50-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-26 02:52:47] [INFO ] Flatten gal took : 103 ms
BEST_FIRST walk for 40004 steps (8 resets) in 460 ms. (86 steps per ms) remains 5/5 properties
[2026-05-26 02:52:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12567160353660357318.gal : 60 ms
[2026-05-26 02:52:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15661988825003726975.prop : 2 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/ReachabilityCardinality12567160353660357318.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15661988825003726975.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 5/5 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 (8 resets) in 370 ms. (107 steps per ms) remains 5/5 properties
Loading property file /tmp/ReachabilityCardinality15661988825003726975.prop.
BEST_FIRST walk for 40003 steps (8 resets) in 797 ms. (50 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 5/5 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-363535022621659013.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13003068819227440055.kers'
[2026-05-26 02:52:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-363535022621659013.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13003068819227440055.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1102 rows 1208 cols 3361 entries
Finished phase 1 with 1048 SingleSign rule and 54 generalized
[2026-05-26 02:52:47] [INFO ] Computed 106 invariants in 5 ms
Computed 106 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-13003068819227440055.kers
Total runtime 6 ms.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :2 after 6
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :6 after 17
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :17 after 112
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :112 after 2692
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :2692 after 69220
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :69220 after 115696
At refinement iteration 1 (OVERLAPS) 568/686 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/686 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :115696 after 232353
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :232353 after 2.86807e+19
At refinement iteration 3 (INCLUDED_ONLY) 0/686 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 87/773 variables, 29/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/773 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem HirschbergSinclair-PT-50-ReachabilityFireability-2024-02 is UNSAT
FORMULA HirschbergSinclair-PT-50-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-50-ReachabilityFireability-2024-08 is UNSAT
FORMULA HirschbergSinclair-PT-50-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-50-ReachabilityFireability-2024-10 is UNSAT
FORMULA HirschbergSinclair-PT-50-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 390/1163 variables, 50/106 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1163 variables, 0/106 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1102/2265 variables, 1163/1269 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2265 variables, 0/1269 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 45/2310 variables, 45/1314 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2310 variables, 0/1314 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/2310 variables, 0/1314 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2310/2310 variables, and 1314 constraints, problems are : Problem set: 3 solved, 2 unsolved in 2071 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 55/55 constraints, State Equation: 1208/1208 constraints, PredecessorRefiner: 5/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 576/611 variables, 9/9 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/611 variables, 20/29 constraints. Problems are: Problem set: 3 solved, 2 unsolved
SMT process timed out in 7238ms, After SMT, problems are : Problem set: 3 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 35 out of 1208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1208/1208 places, 1102/1102 transitions.
Graph (complete) has 2314 edges and 1208 vertex of which 1152 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.5 ms
Discarding 56 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 393 transitions
Trivial Post-agglo rules discarded 393 transitions
Performed 393 trivial Post agglomeration. Transition count delta: 393
Iterating post reduction 0 with 399 rules applied. Total rules applied 400 place count 1152 transition count 703
Reduce places removed 393 places and 0 transitions.
Graph (complete) has 1290 edges and 759 vertex of which 655 are kept as prefixes of interest. Removing 104 places using SCC suffix rule.2 ms
Discarding 104 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 394 rules applied. Total rules applied 794 place count 655 transition count 703
Drop transitions (Empty/Sink Transition effects.) removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Iterating post reduction 2 with 104 rules applied. Total rules applied 898 place count 655 transition count 599
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 916 place count 637 transition count 581
Iterating global reduction 3 with 18 rules applied. Total rules applied 934 place count 637 transition count 581
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 942 place count 629 transition count 573
Iterating global reduction 3 with 8 rules applied. Total rules applied 950 place count 629 transition count 573
Free-agglomeration rule (complex) applied 38 times.
Iterating global reduction 3 with 38 rules applied. Total rules applied 988 place count 629 transition count 535
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 3 with 38 rules applied. Total rules applied 1026 place count 591 transition count 535
Reduce places removed 35 places and 35 transitions.
Iterating global reduction 4 with 35 rules applied. Total rules applied 1061 place count 556 transition count 500
Reduce places removed 4 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 4 with 32 rules applied. Total rules applied 1093 place count 552 transition count 472
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 5 with 28 rules applied. Total rules applied 1121 place count 524 transition count 472
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 18 Pre rules applied. Total rules applied 1121 place count 524 transition count 454
Deduced a syphon composed of 18 places in 5 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 1157 place count 506 transition count 454
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 1158 place count 505 transition count 454
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1158 place count 505 transition count 453
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1160 place count 504 transition count 453
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1164 place count 502 transition count 451
Applied a total of 1164 rules in 367 ms. Remains 502 /1208 variables (removed 706) and now considering 451/1102 (removed 651) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 375 ms. Remains : 502/1208 places, 451/1102 transitions.
RANDOM walk for 40000 steps (84 resets) in 756 ms. (52 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (12 resets) in 168 ms. (236 steps per ms) remains 1/2 properties
FORMULA HirschbergSinclair-PT-50-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (12 resets) in 174 ms. (228 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6075356375919365016.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14233609644079556775.kers'
[2026-05-26 02:52:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6075356375919365016.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14233609644079556775.kers]
Culling duplicate invariants (modulo rational): removing 16 columns.
Culled 16 columns in 0 ms.
// Phase 1: matrix 451 rows 486 cols 1118 entries
Finished phase 1 with 446 SingleSign rule and 5 generalized
[2026-05-26 02:52:55] [INFO ] Computed 51 invariants in 2 ms
Computed 51 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14233609644079556775.kers
Total runtime 3 ms.
[2026-05-26 02:52:55] [INFO ] State equation strengthened by 36 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 361/370 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 82/452 variables, 26/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/452 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/466 variables, 14/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 442/908 variables, 466/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/908 variables, 25/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/908 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 38/946 variables, 31/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/946 variables, 11/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/946 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/950 variables, 3/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/950 variables, 1/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/950 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/953 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/953 variables, 1/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/953 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/953 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 953/953 variables, and 589 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1729 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 502/502 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 361/370 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 82/452 variables, 26/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/452 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/466 variables, 14/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 442/908 variables, 466/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/908 variables, 25/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/908 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 38/946 variables, 31/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/946 variables, 11/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/946 variables, 1/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/946 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 4/950 variables, 3/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/950 variables, 1/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/950 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/953 variables, 2/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/953 variables, 1/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/953 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/953 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 953/953 variables, and 590 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2179 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 502/502 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3932ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 79 ms.
Support contains 9 out of 502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 451/451 transitions.
Graph (complete) has 914 edges and 502 vertex of which 500 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 59 rules applied. Total rules applied 60 place count 500 transition count 392
Reduce places removed 70 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 701 edges and 430 vertex of which 424 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 1 with 129 rules applied. Total rules applied 189 place count 424 transition count 334
Reduce places removed 56 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 60 rules applied. Total rules applied 249 place count 368 transition count 330
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 249 place count 368 transition count 303
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 303 place count 341 transition count 303
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 310 place count 334 transition count 296
Iterating global reduction 3 with 7 rules applied. Total rules applied 317 place count 334 transition count 296
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 3 with 7 rules applied. Total rules applied 324 place count 334 transition count 289
Reduce places removed 7 places and 0 transitions.
Graph (complete) has 585 edges and 327 vertex of which 314 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 8 rules applied. Total rules applied 332 place count 314 transition count 289
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 345 place count 314 transition count 276
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 346 place count 313 transition count 275
Iterating global reduction 6 with 1 rules applied. Total rules applied 347 place count 313 transition count 275
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 348 place count 312 transition count 274
Iterating global reduction 6 with 1 rules applied. Total rules applied 349 place count 312 transition count 274
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 351 place count 311 transition count 273
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 357 place count 311 transition count 267
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 363 place count 305 transition count 267
Reduce places removed 13 places and 13 transitions.
Iterating global reduction 7 with 13 rules applied. Total rules applied 376 place count 292 transition count 254
Reduce places removed 4 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 7 with 17 rules applied. Total rules applied 393 place count 288 transition count 241
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 406 place count 275 transition count 241
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 11 Pre rules applied. Total rules applied 406 place count 275 transition count 230
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 9 with 22 rules applied. Total rules applied 428 place count 264 transition count 230
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 430 place count 263 transition count 229
Applied a total of 430 rules in 176 ms. Remains 263 /502 variables (removed 239) and now considering 229/451 (removed 222) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 263/502 places, 229/451 transitions.
RANDOM walk for 5395 steps (21 resets) in 22 ms. (234 steps per ms) remains 0/1 properties
FORMULA HirschbergSinclair-PT-50-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 13802 ms.

BK_STOP 1779763980092

--------------------
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="HirschbergSinclair-PT-50"
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 HirschbergSinclair-PT-50, 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 r146-tall-177961074400807"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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