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-177961074400791.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 ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074400791
=====================================================================

--------------------
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-ReachabilityFireability-2024-00
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityFireability-2024-01
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityFireability-2024-02
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityFireability-2024-03
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityFireability-2024-04
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityFireability-2024-05
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityFireability-2024-06
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityFireability-2024-07
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityFireability-2024-08
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityFireability-2024-09
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityFireability-2024-10
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityFireability-2024-11
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityFireability-2024-12
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityFireability-2024-13
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityFireability-2024-14
FORMULA_NAME HirschbergSinclair-PT-40-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779759607038

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-40
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-26 01:40:08] [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 01:40:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 01:40:08] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2026-05-26 01:40:08] [INFO ] Transformed 1068 places.
[2026-05-26 01:40:08] [INFO ] Transformed 982 transitions.
[2026-05-26 01:40:08] [INFO ] Parsed PT model containing 1068 places and 982 transitions and 2991 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (40 resets) in 1811 ms. (22 steps per ms) remains 5/16 properties
FORMULA HirschbergSinclair-PT-40-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-40-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-40-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-40-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-40-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-40-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-40-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-40-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-40-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-40-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-40-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 402 ms. (99 steps per ms) remains 5/5 properties
[2026-05-26 01:40:09] [INFO ] Flatten gal took : 206 ms
BEST_FIRST walk for 40004 steps (8 resets) in 253 ms. (157 steps per ms) remains 5/5 properties
[2026-05-26 01:40:09] [INFO ] Flatten gal took : 93 ms
[2026-05-26 01:40:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1702581640111021865.gal : 56 ms
BEST_FIRST walk for 40004 steps (8 resets) in 442 ms. (90 steps per ms) remains 5/5 properties
[2026-05-26 01:40:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3233162135961950325.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/ReachabilityCardinality1702581640111021865.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3233162135961950325.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 269 ms. (148 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 ...328
Loading property file /tmp/ReachabilityCardinality3233162135961950325.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 988 ms. (40 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-18243231351689157706.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7841249247816643466.kers'
[2026-05-26 01:40:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18243231351689157706.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7841249247816643466.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:40:09] [INFO ] Computed 86 invariants in 8 ms
Computed 86 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-7841249247816643466.kers
Total runtime 12 ms.
Excessive predecessor constraint size, skipping predecessor.
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
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 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
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :2692 after 2.4705e+08
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :2.4705e+08 after 6.05022e+17
At refinement iteration 1 (OVERLAPS) 515/566 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/566 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/566 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 93/659 variables, 31/43 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/659 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem HirschbergSinclair-PT-40-ReachabilityFireability-2024-06 is UNSAT
FORMULA HirschbergSinclair-PT-40-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-40-ReachabilityFireability-2024-15 is UNSAT
FORMULA HirschbergSinclair-PT-40-ReachabilityFireability-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 370/1029 variables, 43/86 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1029 variables, 0/86 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 982/2011 variables, 1029/1115 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2011 variables, 0/1115 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 39/2050 variables, 39/1154 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2050 variables, 0/1154 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/2050 variables, 0/1154 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2050/2050 variables, and 1154 constraints, problems are : Problem set: 2 solved, 3 unsolved in 1784 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 1068/1068 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 508/532 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 2/9 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 117/649 variables, 34/43 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/649 variables, 0/43 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 380/1029 variables, 45/88 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1029 variables, 1/89 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1029 variables, 0/89 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 982/2011 variables, 1029/1118 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2011 variables, 2/1120 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2011 variables, 5/1125 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2011/2050 variables, and 1125 constraints, problems are : Problem set: 2 solved, 3 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 1029/1068 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6927ms problems are : Problem set: 2 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 24 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 1020 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.3 ms
Discarding 48 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 371 transitions
Trivial Post-agglo rules discarded 371 transitions
Performed 371 trivial Post agglomeration. Transition count delta: 371
Iterating post reduction 0 with 379 rules applied. Total rules applied 380 place count 1020 transition count 603
Reduce places removed 371 places and 0 transitions.
Graph (complete) has 1111 edges and 649 vertex of which 557 are kept as prefixes of interest. Removing 92 places using SCC suffix rule.2 ms
Discarding 92 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 372 rules applied. Total rules applied 752 place count 557 transition count 603
Drop transitions (Empty/Sink Transition effects.) removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 2 with 92 rules applied. Total rules applied 844 place count 557 transition count 511
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 855 place count 546 transition count 500
Iterating global reduction 3 with 11 rules applied. Total rules applied 866 place count 546 transition count 500
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 873 place count 539 transition count 493
Iterating global reduction 3 with 7 rules applied. Total rules applied 880 place count 539 transition count 493
Free-agglomeration rule (complex) applied 30 times.
Iterating global reduction 3 with 30 rules applied. Total rules applied 910 place count 539 transition count 463
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 940 place count 509 transition count 463
Reduce places removed 34 places and 34 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 974 place count 475 transition count 429
Reduce places removed 6 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 4 with 39 rules applied. Total rules applied 1013 place count 469 transition count 396
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 5 with 33 rules applied. Total rules applied 1046 place count 436 transition count 396
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 22 Pre rules applied. Total rules applied 1046 place count 436 transition count 374
Deduced a syphon composed of 22 places in 24 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 44 rules applied. Total rules applied 1090 place count 414 transition count 374
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 23 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1092 place count 413 transition count 373
Applied a total of 1092 rules in 453 ms. Remains 413 /1068 variables (removed 655) and now considering 373/982 (removed 609) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 462 ms. Remains : 413/1068 places, 373/982 transitions.
RANDOM walk for 40000 steps (100 resets) in 764 ms. (52 steps per ms) remains 2/3 properties
FORMULA HirschbergSinclair-PT-40-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (24 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (24 resets) in 105 ms. (377 steps per ms) remains 1/2 properties
FORMULA HirschbergSinclair-PT-40-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9995949677653480920.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8941197522906454200.kers'
[2026-05-26 01:40:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9995949677653480920.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8941197522906454200.kers]
Culling duplicate invariants (modulo rational): removing 16 columns.
Culled 16 columns in 0 ms.
// Phase 1: matrix 373 rows 397 cols 899 entries
Finished phase 1 with 363 SingleSign rule and 10 generalized
[2026-05-26 01:40:17] [INFO ] Computed 40 invariants in 1 ms
Computed 40 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8941197522906454200.kers
Total runtime 2 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 243/245 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 136/381 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/383 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/397 variables, 14/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 370/767 variables, 397/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/767 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 19/786 variables, 16/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/786 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/786 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 786/786 variables, and 453 constraints, problems are : Problem set: 0 solved, 1 unsolved in 402 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 413/413 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 243/245 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 136/381 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/383 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/397 variables, 14/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 370/767 variables, 397/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/767 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/767 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 19/786 variables, 16/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/786 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/786 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 786/786 variables, and 454 constraints, problems are : Problem set: 0 solved, 1 unsolved in 536 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 413/413 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 955ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 53 ms.
Support contains 2 out of 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 373/373 transitions.
Graph (complete) has 770 edges and 413 vertex of which 398 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 73 rules applied. Total rules applied 74 place count 398 transition count 300
Reduce places removed 84 places and 0 transitions.
Graph (complete) has 385 edges and 314 vertex of which 183 are kept as prefixes of interest. Removing 131 places using SCC suffix rule.1 ms
Discarding 131 places :
Also discarding 93 output transitions
Drop transitions (Output transitions of discarded places.) removed 93 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 1 with 169 rules applied. Total rules applied 243 place count 183 transition count 123
Reduce places removed 84 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 2 with 121 rules applied. Total rules applied 364 place count 99 transition count 86
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 364 place count 99 transition count 52
Renaming transitions due to excessive name length > 1024 char.
Deduced a syphon composed of 34 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 71 rules applied. Total rules applied 435 place count 62 transition count 52
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 3 with 2 rules applied. Total rules applied 437 place count 62 transition count 50
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 439 place count 60 transition count 50
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 442 place count 57 transition count 47
Iterating global reduction 5 with 3 rules applied. Total rules applied 445 place count 57 transition count 47
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 3 rules applied. Total rules applied 448 place count 57 transition count 44
Reduce places removed 3 places and 0 transitions.
Graph (complete) has 81 edges and 54 vertex of which 50 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 4 rules applied. Total rules applied 452 place count 50 transition count 44
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 456 place count 50 transition count 40
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 8 with 7 rules applied. Total rules applied 463 place count 43 transition count 33
Reduce places removed 6 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 8 with 19 rules applied. Total rules applied 482 place count 37 transition count 20
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 9 with 13 rules applied. Total rules applied 495 place count 24 transition count 20
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 8 Pre rules applied. Total rules applied 495 place count 24 transition count 12
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 10 with 17 rules applied. Total rules applied 512 place count 15 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 513 place count 14 transition count 11
Applied a total of 513 rules in 28 ms. Remains 14 /413 variables (removed 399) and now considering 11/373 (removed 362) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 14/413 places, 11/373 transitions.
RANDOM walk for 7860 steps (652 resets) in 22 ms. (341 steps per ms) remains 0/1 properties
FORMULA HirschbergSinclair-PT-40-ReachabilityFireability-2024-05 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 10372 ms.

BK_STOP 1779759618507

--------------------
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-40"
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-40, 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-177961074400791"
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 [ "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 ;