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-177961074400790.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-40, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074400790
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1008K
-rw-r--r-- 1 mcc users 9.8K Mar 7 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Mar 7 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Mar 7 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 7 17:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Mar 15 10:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 10:50 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 14K Mar 7 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Mar 7 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 7 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K 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.1K 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 580K 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-40-ReachabilityCardinality-2024-00
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityCardinality-2024-01
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityCardinality-2024-02
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityCardinality-2024-03
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityCardinality-2024-04
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityCardinality-2024-05
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityCardinality-2024-06
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityCardinality-2024-07
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityCardinality-2024-08
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityCardinality-2024-09
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityCardinality-2024-10
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityCardinality-2024-11
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityCardinality-2024-12
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityCardinality-2024-13
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityCardinality-2024-14
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779759575714

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-40
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-26 01:39:36] [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-26 01:39:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 01:39:36] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2026-05-26 01:39:36] [INFO ] Transformed 1068 places.
[2026-05-26 01:39:37] [INFO ] Transformed 982 transitions.
[2026-05-26 01:39:37] [INFO ] Parsed PT model containing 1068 places and 982 transitions and 2991 arcs in 201 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (40 resets) in 1532 ms. (26 steps per ms) remains 5/16 properties
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-26 01:39:37] [INFO ] Flatten gal took : 246 ms
BEST_FIRST walk for 40004 steps (8 resets) in 505 ms. (79 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 273 ms. (146 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 5/5 properties
[2026-05-26 01:39:37] [INFO ] Flatten gal took : 151 ms
BEST_FIRST walk for 40003 steps (8 resets) in 164 ms. (242 steps per ms) remains 5/5 properties
[2026-05-26 01:39:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9416454683203702686.gal : 75 ms
BEST_FIRST walk for 40004 steps (8 resets) in 256 ms. (155 steps per ms) remains 5/5 properties
[2026-05-26 01:39:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10218549093614808959.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/ReachabilityCardinality9416454683203702686.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10218549093614808959.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-9706827894208011509.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3916154043174432149.kers'
[2026-05-26 01:39:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9706827894208011509.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3916154043174432149.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 982 rows 1068 cols 2991 entries
Finished phase 1 with 938 SingleSign rule and 44 generalized
[2026-05-26 01:39:38] [INFO ] Computed 86 invariants in 5 ms
Computed 86 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-3916154043174432149.kers
Total runtime 6 ms.
Loading property file /tmp/ReachabilityCardinality10218549093614808959.prop.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 529/606 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/606 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/606 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 72/678 variables, 24/43 constraints. Problems are: Problem set: 0 solved, 5 unsolved
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
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :6 after 68
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :68 after 75
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :75 after 179
At refinement iteration 5 (INCLUDED_ONLY) 0/678 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :179 after 2692
Problem HirschbergSinclair-PT-40-ReachabilityCardinality-2024-12 is UNSAT
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-40-ReachabilityCardinality-2024-13 is UNSAT
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-40-ReachabilityCardinality-2024-14 is UNSAT
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 355/1033 variables, 43/86 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1033 variables, 0/86 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 982/2015 variables, 1033/1119 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2015 variables, 0/1119 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 35/2050 variables, 35/1154 constraints. Problems are: Problem set: 3 solved, 2 unsolved
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :2692 after 2.4705e+08
At refinement iteration 11 (INCLUDED_ONLY) 0/2050 variables, 0/1154 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/2050 variables, 0/1154 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2050/2050 variables, and 1154 constraints, problems are : Problem set: 3 solved, 2 unsolved in 1488 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 1068/1068 constraints, PredecessorRefiner: 5/4 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/36 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 536/572 variables, 11/11 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/572 variables, 2/13 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/572 variables, 1/14 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/572 variables, 0/14 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 88/660 variables, 30/44 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/660 variables, 0/44 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 372/1032 variables, 43/87 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1032 variables, 1/88 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1032 variables, 0/88 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 982/2014 variables, 1032/1120 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2014 variables, 1/1121 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2014 variables, 0/1121 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 36/2050 variables, 36/1157 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2050 variables, 1/1158 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2050 variables, 5/1163 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2050 variables, 0/1163 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/2050 variables, 0/1163 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2050/2050 variables, and 1163 constraints, problems are : Problem set: 3 solved, 2 unsolved in 4978 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 1068/1068 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6601ms problems are : Problem set: 3 solved, 2 unsolved
Parikh walk visited 0 properties in 1548 ms.
Support contains 36 out of 1068 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1068/1068 places, 982/982 transitions.
Graph (complete) has 2054 edges and 1068 vertex of which 1027 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.3 ms
Discarding 41 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 386 transitions
Trivial Post-agglo rules discarded 386 transitions
Performed 386 trivial Post agglomeration. Transition count delta: 386
Iterating post reduction 0 with 388 rules applied. Total rules applied 389 place count 1027 transition count 594
Reduce places removed 386 places and 0 transitions.
Graph (complete) has 1095 edges and 641 vertex of which 548 are kept as prefixes of interest. Removing 93 places using SCC suffix rule.2 ms
Discarding 93 places :
Also discarding 0 output transitions
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 399 rules applied. Total rules applied 788 place count 548 transition count 582
Reduce places removed 12 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 93 transitions
Reduce isomorphic transitions removed 93 transitions.
Iterating post reduction 2 with 105 rules applied. Total rules applied 893 place count 536 transition count 489
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 900 place count 529 transition count 482
Iterating global reduction 3 with 7 rules applied. Total rules applied 907 place count 529 transition count 482
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 912 place count 524 transition count 477
Iterating global reduction 3 with 5 rules applied. Total rules applied 917 place count 524 transition count 477
Free-agglomeration rule (complex) applied 41 times.
Iterating global reduction 3 with 41 rules applied. Total rules applied 958 place count 524 transition count 436
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 3 with 41 rules applied. Total rules applied 999 place count 483 transition count 436
Reduce places removed 31 places and 31 transitions.
Iterating global reduction 4 with 31 rules applied. Total rules applied 1030 place count 452 transition count 405
Applied a total of 1030 rules in 235 ms. Remains 452 /1068 variables (removed 616) and now considering 405/982 (removed 577) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 245 ms. Remains : 452/1068 places, 405/982 transitions.
RANDOM walk for 40000 steps (96 resets) in 586 ms. (68 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (21 resets) in 166 ms. (239 steps per ms) remains 1/2 properties
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (24 resets) in 133 ms. (298 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-14492459969235391717.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6463537036202643176.kers'
[2026-05-26 01:39:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14492459969235391717.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6463537036202643176.kers]
Culling duplicate invariants (modulo rational): removing 22 columns.
Culled 22 columns in 0 ms.
// Phase 1: matrix 405 rows 430 cols 905 entries
Finished phase 1 with 397 SingleSign rule and 8 generalized
[2026-05-26 01:39:46] [INFO ] Computed 47 invariants in 1 ms
Computed 47 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6463537036202643176.kers
Total runtime 3 ms.
[2026-05-26 01:39:46] [INFO ] State equation strengthened by 54 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 337/342 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/345 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/345 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 88/433 variables, 25/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/434 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 394/828 variables, 434/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/828 variables, 40/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/828 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 19/847 variables, 12/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/847 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/848 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/848 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/850 variables, 14/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/850 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 7/857 variables, 5/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/857 variables, 1/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/857 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/857 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 857/857 variables, and 553 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1911 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 452/452 constraints, ReadFeed: 54/54 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 337/342 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/345 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/345 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 88/433 variables, 25/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/434 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 394/828 variables, 434/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/828 variables, 40/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/828 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/828 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 19/847 variables, 12/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/847 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/848 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/848 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/850 variables, 14/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/850 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 7/857 variables, 5/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/857 variables, 1/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/857 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/857 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 857/857 variables, and 554 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3322 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 452/452 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5247ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 83 ms.
Support contains 5 out of 452 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 452/452 places, 405/405 transitions.
Graph (complete) has 835 edges and 452 vertex of which 445 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 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 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 445 transition count 368
Reduce places removed 32 places and 0 transitions.
Graph (complete) has 750 edges and 413 vertex of which 407 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 71 place count 407 transition count 368
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 77 place count 407 transition count 362
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 77 place count 407 transition count 349
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 103 place count 394 transition count 349
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 104 place count 393 transition count 348
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 393 transition count 348
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 106 place count 393 transition count 347
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 724 edges and 392 vertex of which 390 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 108 place count 390 transition count 347
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 110 place count 390 transition count 345
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 112 place count 390 transition count 343
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 114 place count 388 transition count 343
Reduce places removed 9 places and 9 transitions.
Iterating global reduction 7 with 9 rules applied. Total rules applied 123 place count 379 transition count 334
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 124 place count 378 transition count 334
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 12 Pre rules applied. Total rules applied 124 place count 378 transition count 322
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 148 place count 366 transition count 322
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 150 place count 365 transition count 321
Applied a total of 150 rules in 139 ms. Remains 365 /452 variables (removed 87) and now considering 321/405 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 365/452 places, 321/405 transitions.
RANDOM walk for 40000 steps (124 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (40 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1271 steps, run visited all 1 properties in 18 ms. (steps per millisecond=70 )
Probabilistic random walk after 1271 steps, saw 987 distinct states, run finished after 23 ms. (steps per millisecond=55 ) properties seen :1
FORMULA HirschbergSinclair-PT-40-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_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 15594 ms.

BK_STOP 1779759592443

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

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