About the Execution of ITS-Tools for LeafsetExtension-PT-S64C3
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2567.512 | 74697.00 | 188844.00 | 318.10 | FTFTFFFFFFFFFFTF | 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.r162-smll-177961108000534.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 LeafsetExtension-PT-S64C3, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-177961108000534
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 14K Mar 7 16:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Mar 7 16:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 7 16:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 7 16:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K Mar 15 11:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 15 11:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Mar 15 11:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 11:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 31K Mar 7 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 189K Mar 7 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Mar 7 16:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Mar 7 16:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 11:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Mar 15 11:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 14M 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 LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-00
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-01
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-02
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-03
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-04
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-05
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-06
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-07
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-08
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-09
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-10
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-11
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-12
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-13
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-14
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1779952043089
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S64C3
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-28 07:07:25] [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-28 07:07:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-28 07:07:26] [INFO ] Load time of PNML (sax parser for PT used): 1126 ms
[2026-05-28 07:07:26] [INFO ] Transformed 21462 places.
[2026-05-28 07:07:27] [INFO ] Transformed 21129 transitions.
[2026-05-28 07:07:27] [INFO ] Parsed PT model containing 21462 places and 21129 transitions and 67740 arcs in 1443 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 45 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1541 resets) in 5579 ms. (7 steps per ms) remains 12/16 properties
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (54 resets) in 895 ms. (44 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (56 resets) in 602 ms. (66 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (56 resets) in 416 ms. (95 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (54 resets) in 233 ms. (170 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (54 resets) in 666 ms. (59 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (56 resets) in 370 ms. (107 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (56 resets) in 2392 ms. (16 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (54 resets) in 358 ms. (111 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (56 resets) in 621 ms. (64 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (56 resets) in 364 ms. (109 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (56 resets) in 313 ms. (127 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (56 resets) in 458 ms. (87 steps per ms) remains 12/12 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2190660331420397243.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9275976532534343282.kers'
[2026-05-28 07:07:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2190660331420397243.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9275976532534343282.kers]
[2026-05-28 07:07:31] [INFO ] Flatten gal took : 2678 ms
Culling duplicate invariants (modulo rational): removing 68 columns.
Culled 68 columns in 43 ms.
// Phase 1: matrix 21129 rows 21394 cols 59092 entries
[2026-05-28 07:07:32] [INFO ] Flatten gal took : 950 ms
Finished phase 1 with 12711 SingleSign rule and 8418 generalized
[2026-05-28 07:07:32] [INFO ] Computed 333 invariants in 1105 ms
Computed 333 P flows in 1109 ms.
Exported basis to /tmp/petrispot-output-9275976532534343282.kers
Total runtime 1136 ms.
[2026-05-28 07:07:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7578568100305253093.gal : 427 ms
[2026-05-28 07:07:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2479737347907716414.prop : 7 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/ReachabilityCardinality7578568100305253093.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2479737347907716414.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 ...328
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20627/42591 variables, and 66 constraints, problems are : Problem set: 0 solved, 12 unsolved in 5061 ms.
Refiners :[Positive P Invariants (semi-flows): 66/132 constraints, Generalized P Invariants (flows): 0/201 constraints, State Equation: 0/21462 constraints, PredecessorRefiner: 12/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Loading property file /tmp/ReachabilityCardinality2479737347907716414.prop.
SMT process timed out in 11990ms, After SMT, problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 455 out of 21462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21462/21462 places, 21129/21129 transitions.
Graph (complete) has 42457 edges and 21462 vertex of which 8550 are kept as prefixes of interest. Removing 12912 places using SCC suffix rule.56 ms
Discarding 12912 places :
Also discarding 4996 output transitions
Drop transitions (Output transitions of discarded places.) removed 4996 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3766 transitions
Reduce isomorphic transitions removed 3766 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3177 transitions
Trivial Post-agglo rules discarded 3177 transitions
Performed 3177 trivial Post agglomeration. Transition count delta: 3177
Iterating post reduction 0 with 6943 rules applied. Total rules applied 6944 place count 8550 transition count 9190
Reduce places removed 3179 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 106 transitions
Trivial Post-agglo rules discarded 106 transitions
Performed 106 trivial Post agglomeration. Transition count delta: 106
Iterating post reduction 1 with 3285 rules applied. Total rules applied 10229 place count 5371 transition count 9084
Reduce places removed 106 places and 0 transitions.
Performed 234 Post agglomeration using F-continuation condition.Transition count delta: 234
Iterating post reduction 2 with 340 rules applied. Total rules applied 10569 place count 5265 transition count 8850
Reduce places removed 234 places and 0 transitions.
Iterating post reduction 3 with 234 rules applied. Total rules applied 10803 place count 5031 transition count 8850
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 123 Pre rules applied. Total rules applied 10803 place count 5031 transition count 8727
Deduced a syphon composed of 123 places in 10 ms
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 4 with 246 rules applied. Total rules applied 11049 place count 4908 transition count 8727
Discarding 190 places :
Symmetric choice reduction at 4 with 190 rule applications. Total rules 11239 place count 4718 transition count 8537
Iterating global reduction 4 with 190 rules applied. Total rules applied 11429 place count 4718 transition count 8537
Free-agglomeration rule (complex) applied 165 times.
Iterating global reduction 4 with 165 rules applied. Total rules applied 11594 place count 4718 transition count 8372
Reduce places removed 165 places and 0 transitions.
Iterating post reduction 4 with 165 rules applied. Total rules applied 11759 place count 4553 transition count 8372
Partial Free-agglomeration rule applied 1238 times.
Drop transitions (Partial Free agglomeration) removed 1238 transitions
Iterating global reduction 5 with 1238 rules applied. Total rules applied 12997 place count 4553 transition count 8372
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 12998 place count 4552 transition count 8372
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 12999 place count 4552 transition count 8371
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 13000 place count 4551 transition count 8371
Applied a total of 13000 rules in 6325 ms. Remains 4551 /21462 variables (removed 16911) and now considering 8371/21129 (removed 12758) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6339 ms. Remains : 4551/21462 places, 8371/21129 transitions.
RANDOM walk for 40000 steps (4077 resets) in 2808 ms. (14 steps per ms) remains 11/12 properties
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (62 resets) in 286 ms. (139 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (64 resets) in 422 ms. (94 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (63 resets) in 144 ms. (275 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (63 resets) in 455 ms. (87 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (64 resets) in 206 ms. (193 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (64 resets) in 437 ms. (91 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (63 resets) in 150 ms. (264 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (63 resets) in 436 ms. (91 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (65 resets) in 168 ms. (236 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (62 resets) in 164 ms. (242 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (64 resets) in 225 ms. (177 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 12502 steps, run timeout after 3001 ms. (steps per millisecond=4 ) properties seen :0 out of 11
Probabilistic random walk after 12502 steps, saw 6756 distinct states, run finished after 3010 ms. (steps per millisecond=4 ) properties seen :0
[2026-05-28 07:07:54] [INFO ] Flow matrix only has 7972 transitions (discarded 399 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10777867783678050418.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10748589246365083172.kers'
[2026-05-28 07:07:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10777867783678050418.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10748589246365083172.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 5 ms.
// Phase 1: matrix 7972 rows 4550 cols 20922 entries
Finished phase 1 with 4316 SingleSign rule and 227 generalized
[2026-05-28 07:07:54] [INFO ] Computed 8 invariants in 77 ms
Computed 8 P flows in 77 ms.
Exported basis to /tmp/petrispot-output-10748589246365083172.kers
Total runtime 84 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 250/670 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 1/671 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/671 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 2353/3024 variables, 671/678 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3024 variables, 0/678 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-00 is UNSAT
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-02 is UNSAT
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-04 is UNSAT
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-05 is UNSAT
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-07 is UNSAT
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-10 is UNSAT
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-12 is UNSAT
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 7346/10370 variables, 1741/2419 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/10370 variables, 0/2419 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 3/10373 variables, 1/2420 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/10373 variables, 1/2421 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/10373 variables, 0/2421 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2150/12523 variables, 2138/4559 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/12523 variables, 0/4559 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/12523 variables, 0/4559 constraints. Problems are: Problem set: 7 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12523/12523 variables, and 4559 constraints, problems are : Problem set: 7 solved, 4 unsolved in 13224 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 4551/4551 constraints, PredecessorRefiner: 11/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 243/403 variables, 4/4 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 0/4 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/404 variables, 1/5 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 0/5 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1114/1518 variables, 404/409 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1518 variables, 0/409 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 7588/9106 variables, 795/1204 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/9106 variables, 1/1205 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/9106 variables, 0/1205 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 11/9117 variables, 3/1208 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/9117 variables, 2/1210 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/9117 variables, 0/1210 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 3391/12508 variables, 3340/4550 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/12508 variables, 0/4550 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 14/12522 variables, 9/4559 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/12522 variables, 0/4559 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 1/12523 variables, 1/4560 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/12523 variables, 0/4560 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/12523 variables, 0/4560 constraints. Problems are: Problem set: 7 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12523/12523 variables, and 4560 constraints, problems are : Problem set: 7 solved, 4 unsolved in 29666 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 4551/4551 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43102ms problems are : Problem set: 7 solved, 4 unsolved
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-08 FALSE TECHNIQUES PARIKH_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-13 FALSE TECHNIQUES PARIKH_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-14 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-15 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 4 properties in 119 ms.
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 72170 ms.
BK_STOP 1779952117786
--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="LeafsetExtension-PT-S64C3"
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 LeafsetExtension-PT-S64C3, 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 r162-smll-177961108000534"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LeafsetExtension-PT-S64C3.tgz
mv LeafsetExtension-PT-S64C3 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 ;
