About the Execution of ITS-Tools for HirschbergSinclair-PT-35
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 540.876 | 14419.00 | 37208.00 | 1018.30 | TTTFTFTFTFTFFTTT | normal |
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-177961074400782.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-35, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074400782
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 936K
-rw-r--r-- 1 mcc users 9.1K Mar 7 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Mar 7 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Mar 7 17:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 7 17:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Mar 15 10:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 10:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 10:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K 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 76K Mar 7 17:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 10:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 15 10:50 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 544K 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-35-ReachabilityCardinality-2024-00
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-2024-01
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-2024-02
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-2024-03
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-2024-04
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-2024-05
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-2024-06
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-2024-07
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-2024-08
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-2024-09
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-2024-10
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-2024-11
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-2024-12
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-2024-13
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-2024-14
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1779758199094
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-35
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-26 01:16:40] [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:16:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 01:16:40] [INFO ] Load time of PNML (sax parser for PT used): 176 ms
[2026-05-26 01:16:40] [INFO ] Transformed 998 places.
[2026-05-26 01:16:40] [INFO ] Transformed 922 transitions.
[2026-05-26 01:16:40] [INFO ] Parsed PT model containing 998 places and 922 transitions and 2806 arcs in 316 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (40 resets) in 2191 ms. (18 steps per ms) remains 8/16 properties
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 327 ms. (121 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 554 ms. (72 steps per ms) remains 8/8 properties
[2026-05-26 01:16:41] [INFO ] Flatten gal took : 268 ms
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 8/8 properties
[2026-05-26 01:16:41] [INFO ] Flatten gal took : 123 ms
BEST_FIRST walk for 40004 steps (8 resets) in 296 ms. (134 steps per ms) remains 8/8 properties
[2026-05-26 01:16:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15825467552936550002.gal : 86 ms
BEST_FIRST walk for 40004 steps (8 resets) in 430 ms. (92 steps per ms) remains 8/8 properties
[2026-05-26 01:16:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11959223017030969219.prop : 4 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/ReachabilityCardinality15825467552936550002.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11959223017030969219.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 8/8 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 193 ms. (206 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 267 ms. (149 steps per ms) remains 8/8 properties
Loading property file /tmp/ReachabilityCardinality11959223017030969219.prop.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4473462202964008613.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5868336725717369700.kers'
[2026-05-26 01:16:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4473462202964008613.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5868336725717369700.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 922 rows 998 cols 2806 entries
Finished phase 1 with 883 SingleSign rule and 39 generalized
[2026-05-26 01:16:42] [INFO ] Computed 76 invariants in 4 ms
Computed 76 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-5868336725717369700.kers
Total runtime 7 ms.
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :6 after 17
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :17 after 58
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :58 after 707
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :707 after 1558
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :1558 after 2692
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 475/601 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/601 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 51/652 variables, 17/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/652 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem HirschbergSinclair-PT-35-ReachabilityCardinality-2024-00 is UNSAT
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-35-ReachabilityCardinality-2024-08 is UNSAT
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-35-ReachabilityCardinality-2024-13 is UNSAT
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 314/966 variables, 35/76 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/966 variables, 0/76 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 922/1888 variables, 966/1042 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1888 variables, 0/1042 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 32/1920 variables, 32/1074 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1920 variables, 0/1074 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/1920 variables, 0/1074 constraints. Problems are: Problem set: 3 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1920/1920 variables, and 1074 constraints, problems are : Problem set: 3 solved, 5 unsolved in 2401 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 998/998 constraints, PredecessorRefiner: 8/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 484/579 variables, 17/17 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/579 variables, 5/22 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 19/41 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 0/41 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 57/636 variables, 19/60 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/636 variables, 0/60 constraints. Problems are: Problem set: 3 solved, 5 unsolved
Problem HirschbergSinclair-PT-35-ReachabilityCardinality-2024-06 is UNSAT
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-35-ReachabilityCardinality-2024-10 is UNSAT
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 328/964 variables, 35/95 constraints. Problems are: Problem set: 5 solved, 3 unsolved
SMT process timed out in 7538ms, After SMT, problems are : Problem set: 5 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 43 out of 998 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 998/998 places, 922/922 transitions.
Graph (complete) has 1924 edges and 998 vertex of which 964 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.4 ms
Discarding 34 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 342 transitions
Trivial Post-agglo rules discarded 342 transitions
Performed 342 trivial Post agglomeration. Transition count delta: 342
Iterating post reduction 0 with 342 rules applied. Total rules applied 343 place count 964 transition count 580
Reduce places removed 342 places and 0 transitions.
Graph (complete) has 1081 edges and 622 vertex of which 546 are kept as prefixes of interest. Removing 76 places using SCC suffix rule.1 ms
Discarding 76 places :
Also discarding 0 output transitions
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 356 rules applied. Total rules applied 699 place count 546 transition count 567
Reduce places removed 13 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 2 with 89 rules applied. Total rules applied 788 place count 533 transition count 491
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 794 place count 527 transition count 485
Iterating global reduction 3 with 6 rules applied. Total rules applied 800 place count 527 transition count 485
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 804 place count 523 transition count 481
Iterating global reduction 3 with 4 rules applied. Total rules applied 808 place count 523 transition count 481
Free-agglomeration rule (complex) applied 39 times.
Iterating global reduction 3 with 39 rules applied. Total rules applied 847 place count 523 transition count 442
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 3 with 39 rules applied. Total rules applied 886 place count 484 transition count 442
Reduce places removed 27 places and 27 transitions.
Iterating global reduction 4 with 27 rules applied. Total rules applied 913 place count 457 transition count 415
Applied a total of 913 rules in 273 ms. Remains 457 /998 variables (removed 541) and now considering 415/922 (removed 507) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 280 ms. Remains : 457/998 places, 415/922 transitions.
RANDOM walk for 40000 steps (92 resets) in 916 ms. (43 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (19 resets) in 274 ms. (145 steps per ms) remains 2/3 properties
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40001 steps (28 resets) in 285 ms. (139 steps per ms) remains 1/2 properties
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (24 resets) in 145 ms. (274 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-15122071331130738355.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6927052732441857146.kers'
[2026-05-26 01:16:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15122071331130738355.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6927052732441857146.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 415 rows 444 cols 962 entries
Finished phase 1 with 409 SingleSign rule and 6 generalized
[2026-05-26 01:16:50] [INFO ] Computed 42 invariants in 1 ms
Computed 42 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6927052732441857146.kers
Total runtime 2 ms.
[2026-05-26 01:16:50] [INFO ] State equation strengthened by 48 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 348/351 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/422 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/422 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/435 variables, 13/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/435 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 404/839 variables, 435/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/839 variables, 47/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/839 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 23/862 variables, 16/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/862 variables, 1/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/862 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/863 variables, 1/541 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/863 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/863 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 863/872 variables, and 541 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1501 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 452/457 constraints, ReadFeed: 48/48 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 348/351 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/422 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/422 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/435 variables, 13/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/435 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 404/839 variables, 435/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/839 variables, 47/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/839 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/839 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 23/862 variables, 16/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/862 variables, 1/541 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/862 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/863 variables, 1/542 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/863 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/863 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 863/872 variables, and 542 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1021 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 452/457 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2602ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 34 ms.
Support contains 3 out of 457 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 457/457 places, 415/415 transitions.
Graph (complete) has 850 edges and 457 vertex of which 419 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.2 ms
Discarding 38 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 86 rules applied. Total rules applied 87 place count 419 transition count 329
Reduce places removed 74 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 440 edges and 345 vertex of which 107 are kept as prefixes of interest. Removing 238 places using SCC suffix rule.1 ms
Discarding 238 places :
Also discarding 173 output transitions
Drop transitions (Output transitions of discarded places.) removed 173 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 90 rules applied. Total rules applied 177 place count 107 transition count 141
Reduce places removed 12 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 2 with 71 rules applied. Total rules applied 248 place count 95 transition count 82
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 248 place count 95 transition count 50
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 312 place count 63 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 315 place count 61 transition count 49
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 88 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
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 3 rules applied. Total rules applied 318 place count 60 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 319 place count 59 transition count 47
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 319 place count 59 transition count 40
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 15 rules applied. Total rules applied 334 place count 51 transition count 40
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 335 place count 50 transition count 40
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 335 place count 50 transition count 39
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 337 place count 49 transition count 39
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 6 with 2 rules applied. Total rules applied 339 place count 48 transition count 38
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 345 place count 42 transition count 32
Reduce places removed 5 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 6 with 15 rules applied. Total rules applied 360 place count 37 transition count 22
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 370 place count 27 transition count 22
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 4 Pre rules applied. Total rules applied 370 place count 27 transition count 18
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 378 place count 23 transition count 18
Applied a total of 378 rules in 32 ms. Remains 23 /457 variables (removed 434) and now considering 18/415 (removed 397) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 23/457 places, 18/415 transitions.
RANDOM walk for 30624 steps (1610 resets) in 115 ms. (264 steps per ms) remains 0/1 properties
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-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 13213 ms.
BK_STOP 1779758213513
--------------------
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-35"
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-35, 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-177961074400782"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-35.tgz
mv HirschbergSinclair-PT-35 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 '
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 ;
