Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r002-oct2-177944366100294.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 ASLink-PT-01b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366100294
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 6.9K Mar 5 14:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 5 14:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Mar 5 14:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Mar 5 14:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Mar 5 14:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 57K Mar 5 14:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 5 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Mar 5 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 293K 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 ASLink-PT-01b-ReachabilityCardinality-2024-00
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-2024-01
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-2024-02
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-2024-03
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-2024-04
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-2024-05
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-2024-06
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-2024-07
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-2024-08
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-2024-09
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-2024-10
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-2024-11
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-2024-12
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-2024-13
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-2024-14
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779470726077

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-01b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-22 17:25:27] [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-22 17:25:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 17:25:27] [INFO ] Load time of PNML (sax parser for PT used): 180 ms
[2026-05-22 17:25:27] [INFO ] Transformed 846 places.
[2026-05-22 17:25:27] [INFO ] Transformed 1148 transitions.
[2026-05-22 17:25:27] [INFO ] Found NUPN structural information;
[2026-05-22 17:25:27] [INFO ] Parsed PT model containing 846 places and 1148 transitions and 3624 arcs in 315 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
FORMULA ASLink-PT-01b-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (239 resets) in 1392 ms. (28 steps per ms) remains 3/13 properties
FORMULA ASLink-PT-01b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (62 resets) in 438 ms. (91 steps per ms) remains 3/3 properties
[2026-05-22 17:25:28] [INFO ] Flatten gal took : 240 ms
BEST_FIRST walk for 40004 steps (60 resets) in 422 ms. (94 steps per ms) remains 3/3 properties
[2026-05-22 17:25:28] [INFO ] Flatten gal took : 108 ms
[2026-05-22 17:25:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality779861326393495228.gal : 100 ms
[2026-05-22 17:25:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17669943951631161987.prop : 1 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/ReachabilityCardinality779861326393495228.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17669943951631161987.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40002 steps (70 resets) in 567 ms. (70 steps per ms) remains 3/3 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
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8463052365038612859.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6571710750220560648.kers'
[2026-05-22 17:25:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8463052365038612859.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6571710750220560648.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1148 rows 846 cols 3624 entries
Finished phase 1 with 548 SingleSign rule and 216 generalized
[2026-05-22 17:25:28] [INFO ] Computed 82 invariants in 6 ms
Computed 82 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-6571710750220560648.kers
Total runtime 8 ms.
Loading property file /tmp/ReachabilityCardinality17669943951631161987.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 222/266 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 222/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem ASLink-PT-01b-ReachabilityCardinality-2024-08 is UNSAT
FORMULA ASLink-PT-01b-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 541/807 variables, 57/336 constraints. Problems are: Problem set: 1 solved, 2 unsolved
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :7 after 13
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :13 after 46
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :46 after 178
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :178 after 571
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :571 after 689
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :689 after 10045
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :10045 after 28954
SDD proceeding with computation,3 properties remain. new max is 2048
At refinement iteration 6 (INCLUDED_ONLY) 0/807 variables, 541/877 constraints. Problems are: Problem set: 1 solved, 2 unsolved
SDD size :28954 after 435646
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :435646 after 9.83056e+07
At refinement iteration 7 (INCLUDED_ONLY) 0/807 variables, 0/877 constraints. Problems are: Problem set: 1 solved, 2 unsolved
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :9.83056e+07 after 1.00295e+08
At refinement iteration 8 (OVERLAPS) 39/846 variables, 12/889 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/846 variables, 39/928 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/846 variables, 0/928 constraints. Problems are: Problem set: 1 solved, 2 unsolved
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :1.00295e+08 after 1.16726e+08
At refinement iteration 11 (OVERLAPS) 1148/1994 variables, 846/1774 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1994 variables, 0/1774 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1994 variables, 0/1774 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1994/1994 variables, and 1774 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1897 ms.
Refiners :[Domain max(s): 846/846 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 69/69 constraints, State Equation: 846/846 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 31/31 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 224/255 variables, 13/44 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 224/268 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/268 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem ASLink-PT-01b-ReachabilityCardinality-2024-12 is UNSAT
FORMULA ASLink-PT-01b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 547/802 variables, 55/323 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 547/870 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/802 variables, 2/872 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/802 variables, 0/872 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 44/846 variables, 14/886 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/846 variables, 44/930 constraints. Problems are: Problem set: 2 solved, 1 unsolved
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :1.16726e+08 after 1.59208e+08
At refinement iteration 11 (INCLUDED_ONLY) 0/846 variables, 0/930 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1148/1994 variables, 846/1776 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1994/1994 variables, and 1777 constraints, problems are : Problem set: 2 solved, 1 unsolved in 3247 ms.
Refiners :[Domain max(s): 846/846 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 69/69 constraints, State Equation: 846/846 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5250ms problems are : Problem set: 2 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 13 out of 846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 846/846 places, 1148/1148 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 176 transitions
Trivial Post-agglo rules discarded 176 transitions
Performed 176 trivial Post agglomeration. Transition count delta: 176
Iterating post reduction 0 with 176 rules applied. Total rules applied 176 place count 846 transition count 972
Reduce places removed 176 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
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 1 with 182 rules applied. Total rules applied 358 place count 670 transition count 966
Reduce places removed 2 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 9 rules applied. Total rules applied 367 place count 668 transition count 959
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 11 rules applied. Total rules applied 378 place count 661 transition count 955
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 379 place count 660 transition count 955
Performed 187 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 187 Pre rules applied. Total rules applied 379 place count 660 transition count 768
Deduced a syphon composed of 187 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 197 places and 0 transitions.
Iterating global reduction 5 with 384 rules applied. Total rules applied 763 place count 463 transition count 768
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 5 with 9 rules applied. Total rules applied 772 place count 460 transition count 762
Reduce places removed 6 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 6 with 9 rules applied. Total rules applied 781 place count 454 transition count 759
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 784 place count 451 transition count 759
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 4 Pre rules applied. Total rules applied 784 place count 451 transition count 755
Deduced a syphon composed of 4 places in 2 ms
Ensure Unique test removed 3 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 11 rules applied. Total rules applied 795 place count 444 transition count 755
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 3 Pre rules applied. Total rules applied 795 place count 444 transition count 752
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 801 place count 441 transition count 752
Discarding 25 places :
Symmetric choice reduction at 8 with 25 rule applications. Total rules 826 place count 416 transition count 727
Iterating global reduction 8 with 25 rules applied. Total rules applied 851 place count 416 transition count 727
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 852 place count 416 transition count 726
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 9 Pre rules applied. Total rules applied 852 place count 416 transition count 717
Deduced a syphon composed of 9 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 9 with 19 rules applied. Total rules applied 871 place count 406 transition count 717
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 871 place count 406 transition count 716
Deduced a syphon composed of 1 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 874 place count 404 transition count 716
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 876 place count 402 transition count 701
Iterating global reduction 9 with 2 rules applied. Total rules applied 878 place count 402 transition count 701
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 878 place count 402 transition count 700
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 880 place count 401 transition count 700
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 881 place count 400 transition count 692
Iterating global reduction 9 with 1 rules applied. Total rules applied 882 place count 400 transition count 692
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 883 place count 399 transition count 684
Iterating global reduction 9 with 1 rules applied. Total rules applied 884 place count 399 transition count 684
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 885 place count 398 transition count 676
Iterating global reduction 9 with 1 rules applied. Total rules applied 886 place count 398 transition count 676
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 887 place count 397 transition count 668
Iterating global reduction 9 with 1 rules applied. Total rules applied 888 place count 397 transition count 668
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 889 place count 396 transition count 660
Iterating global reduction 9 with 1 rules applied. Total rules applied 890 place count 396 transition count 660
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 891 place count 395 transition count 652
Iterating global reduction 9 with 1 rules applied. Total rules applied 892 place count 395 transition count 652
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 893 place count 394 transition count 644
Iterating global reduction 9 with 1 rules applied. Total rules applied 894 place count 394 transition count 644
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 895 place count 393 transition count 636
Iterating global reduction 9 with 1 rules applied. Total rules applied 896 place count 393 transition count 636
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 897 place count 392 transition count 628
Iterating global reduction 9 with 1 rules applied. Total rules applied 898 place count 392 transition count 628
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 899 place count 391 transition count 620
Iterating global reduction 9 with 1 rules applied. Total rules applied 900 place count 391 transition count 620
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 901 place count 390 transition count 612
Iterating global reduction 9 with 1 rules applied. Total rules applied 902 place count 390 transition count 612
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 903 place count 389 transition count 604
Iterating global reduction 9 with 1 rules applied. Total rules applied 904 place count 389 transition count 604
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 905 place count 388 transition count 596
Iterating global reduction 9 with 1 rules applied. Total rules applied 906 place count 388 transition count 596
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 907 place count 387 transition count 588
Iterating global reduction 9 with 1 rules applied. Total rules applied 908 place count 387 transition count 588
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 909 place count 386 transition count 580
Iterating global reduction 9 with 1 rules applied. Total rules applied 910 place count 386 transition count 580
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 911 place count 385 transition count 572
Iterating global reduction 9 with 1 rules applied. Total rules applied 912 place count 385 transition count 572
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 9 with 84 rules applied. Total rules applied 996 place count 343 transition count 530
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 997 place count 342 transition count 529
Ensure Unique test removed 1 places
Iterating global reduction 9 with 2 rules applied. Total rules applied 999 place count 341 transition count 529
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1000 place count 340 transition count 528
Iterating global reduction 9 with 1 rules applied. Total rules applied 1001 place count 340 transition count 528
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 9 with 2 rules applied. Total rules applied 1003 place count 340 transition count 526
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1004 place count 339 transition count 526
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1006 place count 338 transition count 535
Free-agglomeration rule applied 2 times.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1008 place count 338 transition count 533
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1010 place count 336 transition count 533
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1012 place count 336 transition count 531
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1014 place count 334 transition count 531
Applied a total of 1014 rules in 587 ms. Remains 334 /846 variables (removed 512) and now considering 531/1148 (removed 617) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 600 ms. Remains : 334/846 places, 531/1148 transitions.
RANDOM walk for 40000 steps (776 resets) in 392 ms. (101 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (314 resets) in 184 ms. (216 steps per ms) remains 1/1 properties
SDD proceeding with computation,3 properties remain. new max is 65536
SDD size :1.59208e+08 after 1.88343e+09
Interrupted probabilistic random walk after 838877 steps, run timeout after 3001 ms. (steps per millisecond=279 ) properties seen :0 out of 1
Probabilistic random walk after 838877 steps, saw 261040 distinct states, run finished after 3010 ms. (steps per millisecond=278 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14724034062800357174.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7443032492160562667.kers'
[2026-05-22 17:25:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14724034062800357174.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7443032492160562667.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 531 rows 334 cols 2089 entries
Finished phase 1 with 71 SingleSign rule and 200 generalized
[2026-05-22 17:25:37] [INFO ] Computed 63 invariants in 3 ms
Computed 63 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7443032492160562667.kers
Total runtime 4 ms.
[2026-05-22 17:25:37] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 100/113 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 191/304 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/334 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 531/865 variables, 334/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/865 variables, 6/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/865 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/865 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 865/865 variables, and 403 constraints, problems are : Problem set: 0 solved, 1 unsolved in 258 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 334/334 constraints, ReadFeed: 6/6 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/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 100/113 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 191/304 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/334 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 531/865 variables, 334/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/865 variables, 6/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/865 variables, 1/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/865 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/865 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 865/865 variables, and 404 constraints, problems are : Problem set: 0 solved, 1 unsolved in 894 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 334/334 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1170ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 501 ms.
Support contains 13 out of 334 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 334/334 places, 531/531 transitions.
Applied a total of 0 rules in 12 ms. Remains 334 /334 variables (removed 0) and now considering 531/531 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 334/334 places, 531/531 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 334/334 places, 531/531 transitions.
Applied a total of 0 rules in 11 ms. Remains 334 /334 variables (removed 0) and now considering 531/531 (removed 0) transitions.
[2026-05-22 17:25:39] [INFO ] Invariant cache hit.
[2026-05-22 17:25:39] [INFO ] Implicit Places using invariants in 284 ms returned [2, 21, 22, 25, 35, 52, 70, 110, 111, 156, 173, 177, 179, 197, 199, 203, 221, 222, 223, 224, 238, 244, 250, 256, 262, 268, 274, 280, 286, 292, 298]
[2026-05-22 17:25:39] [INFO ] Actually due to overlaps returned [197, 179, 35, 52, 203, 221, 177, 199, 222, 2, 21, 70, 173, 223, 268, 286, 298, 22, 25, 156, 224, 238, 244, 250, 256, 262, 274, 280, 292]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 295 ms to find 29 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 305/334 places, 531/531 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 305 transition count 491
Reduce places removed 40 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 43 rules applied. Total rules applied 83 place count 265 transition count 488
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 86 place count 262 transition count 488
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 86 place count 262 transition count 482
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 13 rules applied. Total rules applied 99 place count 255 transition count 482
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 8 rules applied. Total rules applied 107 place count 251 transition count 478
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 111 place count 247 transition count 478
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 125 place count 233 transition count 464
Iterating global reduction 5 with 14 rules applied. Total rules applied 139 place count 233 transition count 464
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 139 place count 233 transition count 463
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 141 place count 232 transition count 463
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 146 place count 227 transition count 456
Iterating global reduction 5 with 5 rules applied. Total rules applied 151 place count 227 transition count 456
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 154 place count 227 transition count 453
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 155 place count 226 transition count 452
Iterating global reduction 6 with 1 rules applied. Total rules applied 156 place count 226 transition count 452
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 157 place count 225 transition count 450
Iterating global reduction 6 with 1 rules applied. Total rules applied 158 place count 225 transition count 450
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 194 place count 207 transition count 432
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 198 place count 205 transition count 432
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 204 place count 205 transition count 426
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 210 place count 199 transition count 426
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 214 place count 199 transition count 426
Applied a total of 214 rules in 59 ms. Remains 199 /305 variables (removed 106) and now considering 426/531 (removed 105) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1152167064237877318.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17194860679583443887.kers'
[2026-05-22 17:25:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1152167064237877318.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17194860679583443887.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 426 rows 199 cols 1692 entries
Finished phase 1 with 80 SingleSign rule and 90 generalized
[2026-05-22 17:25:39] [INFO ] Computed 29 invariants in 2 ms
Computed 29 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-17194860679583443887.kers
Total runtime 12 ms.
[2026-05-22 17:25:40] [INFO ] Implicit Places using invariants in 148 ms returned [88, 89, 108, 119, 196, 198]
[2026-05-22 17:25:40] [INFO ] Actually due to overlaps returned [88, 108, 119, 196]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 151 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 195/334 places, 426/531 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 194 transition count 425
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 193 transition count 425
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 192 transition count 424
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 192 transition count 424
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 192 transition count 423
Applied a total of 6 rules in 18 ms. Remains 192 /195 variables (removed 3) and now considering 423/426 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8221505073659570717.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1557149222211188272.kers'
[2026-05-22 17:25:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8221505073659570717.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1557149222211188272.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 423 rows 192 cols 1671 entries
Finished phase 1 with 84 SingleSign rule and 84 generalized
[2026-05-22 17:25:40] [INFO ] Computed 24 invariants in 1 ms
Computed 24 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1557149222211188272.kers
Total runtime 2 ms.
[2026-05-22 17:25:40] [INFO ] Implicit Places using invariants in 141 ms returned []
[2026-05-22 17:25:40] [INFO ] Invariant cache hit.
[2026-05-22 17:25:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 17:25:40] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 192/334 places, 423/531 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1071 ms. Remains : 192/334 places, 423/531 transitions.
RANDOM walk for 40000 steps (1138 resets) in 157 ms. (253 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (439 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1034606 steps, run timeout after 3001 ms. (steps per millisecond=344 ) properties seen :0 out of 1
Probabilistic random walk after 1034606 steps, saw 346650 distinct states, run finished after 3001 ms. (steps per millisecond=344 ) properties seen :0
[2026-05-22 17:25:43] [INFO ] Invariant cache hit.
[2026-05-22 17:25:43] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 122/135 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/192 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 423/615 variables, 192/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/615 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/615 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/615 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 615/615 variables, and 218 constraints, problems are : Problem set: 0 solved, 1 unsolved in 244 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 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/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 122/135 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/192 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 423/615 variables, 192/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/615 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/615 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/615 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/615 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 615/615 variables, and 219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 456 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 710ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 38 ms.
Support contains 13 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 423/423 transitions.
Applied a total of 0 rules in 6 ms. Remains 192 /192 variables (removed 0) and now considering 423/423 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 192/192 places, 423/423 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 423/423 transitions.
Applied a total of 0 rules in 7 ms. Remains 192 /192 variables (removed 0) and now considering 423/423 (removed 0) transitions.
[2026-05-22 17:25:44] [INFO ] Invariant cache hit.
[2026-05-22 17:25:44] [INFO ] Implicit Places using invariants in 122 ms returned []
[2026-05-22 17:25:44] [INFO ] Invariant cache hit.
[2026-05-22 17:25:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 17:25:44] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
[2026-05-22 17:25:44] [INFO ] Redundant transitions in 17 ms returned []
Running 422 sub problems to find dead transitions.
[2026-05-22 17:25:45] [INFO ] Invariant cache hit.
[2026-05-22 17:25:45] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 422 unsolved
SDD proceeding with computation,3 properties remain. new max is 131072
SDD size :1.88343e+09 after 2.30125e+09
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (OVERLAPS) 1/192 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 7/31 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 422 unsolved
SDD proceeding with computation,3 properties remain. new max is 262144
SDD size :2.30125e+09 after 8.70938e+09
At refinement iteration 6 (OVERLAPS) 423/615 variables, 192/223 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/615 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/615 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/615 variables, and 227 constraints, problems are : Problem set: 0 solved, 422 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 422 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (OVERLAPS) 1/192 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 9/33 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD342 is UNSAT
At refinement iteration 6 (OVERLAPS) 423/615 variables, 192/225 constraints. Problems are: Problem set: 224 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/615 variables, 2/227 constraints. Problems are: Problem set: 224 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/615 variables, 198/425 constraints. Problems are: Problem set: 224 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 615/615 variables, and 425 constraints, problems are : Problem set: 224 solved, 198 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 198/422 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60189ms problems are : Problem set: 224 solved, 198 unsolved
Search for dead transitions found 224 dead transitions in 60192ms
Found 224 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 224 transitions
Dead transitions reduction (with SMT) removed 224 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 192/192 places, 199/423 transitions.
Ensure Unique test removed 29 places
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 162 transition count 176
Reduce places removed 23 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 26 rules applied. Total rules applied 79 place count 139 transition count 173
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 82 place count 136 transition count 173
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 82 place count 136 transition count 171
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 86 place count 134 transition count 171
Applied a total of 86 rules in 18 ms. Remains 134 /192 variables (removed 58) and now considering 171/199 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17018152678363396480.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8291035861753284519.kers'
[2026-05-22 17:26:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17018152678363396480.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8291035861753284519.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 171 rows 134 cols 659 entries
Finished phase 1 with 58 SingleSign rule and 54 generalized
[2026-05-22 17:26:45] [INFO ] Computed 22 invariants in 2 ms
Computed 22 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8291035861753284519.kers
Total runtime 3 ms.
[2026-05-22 17:26:45] [INFO ] Implicit Places using invariants in 121 ms returned []
[2026-05-22 17:26:45] [INFO ] Invariant cache hit.
[2026-05-22 17:26:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 17:26:45] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 134/192 places, 171/423 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61048 ms. Remains : 134/192 places, 171/423 transitions.
RANDOM walk for 40000 steps (1540 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (547 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1043546 steps, run visited all 1 properties in 1689 ms. (steps per millisecond=617 )
Probabilistic random walk after 1043546 steps, saw 355040 distinct states, run finished after 1696 ms. (steps per millisecond=615 ) properties seen :1
FORMULA ASLink-PT-01b-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 79903 ms.

BK_STOP 1779470807476

--------------------
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="ASLink-PT-01b"
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 ASLink-PT-01b, 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 r002-oct2-177944366100294"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-01b.tgz
mv ASLink-PT-01b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;