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-177944366300439.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-10b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366300439
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 5.1K Mar 5 14:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 48K Mar 5 14:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 5 14:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 5 14:01 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:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 5 14:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Mar 5 14:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Mar 5 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Mar 5 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:11 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 1.4M 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-10b-ReachabilityFireability-2024-00
FORMULA_NAME ASLink-PT-10b-ReachabilityFireability-2024-01
FORMULA_NAME ASLink-PT-10b-ReachabilityFireability-2024-02
FORMULA_NAME ASLink-PT-10b-ReachabilityFireability-2024-03
FORMULA_NAME ASLink-PT-10b-ReachabilityFireability-2024-04
FORMULA_NAME ASLink-PT-10b-ReachabilityFireability-2024-05
FORMULA_NAME ASLink-PT-10b-ReachabilityFireability-2024-06
FORMULA_NAME ASLink-PT-10b-ReachabilityFireability-2024-07
FORMULA_NAME ASLink-PT-10b-ReachabilityFireability-2024-08
FORMULA_NAME ASLink-PT-10b-ReachabilityFireability-2024-09
FORMULA_NAME ASLink-PT-10b-ReachabilityFireability-2024-10
FORMULA_NAME ASLink-PT-10b-ReachabilityFireability-2024-11
FORMULA_NAME ASLink-PT-10b-ReachabilityFireability-2024-12
FORMULA_NAME ASLink-PT-10b-ReachabilityFireability-2024-13
FORMULA_NAME ASLink-PT-10b-ReachabilityFireability-2024-14
FORMULA_NAME ASLink-PT-10b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779489818537

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-10b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-22 22:43:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 22:43:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 22:43:40] [INFO ] Load time of PNML (sax parser for PT used): 244 ms
[2026-05-22 22:43:40] [INFO ] Transformed 4410 places.
[2026-05-22 22:43:40] [INFO ] Transformed 5405 transitions.
[2026-05-22 22:43:40] [INFO ] Found NUPN structural information;
[2026-05-22 22:43:40] [INFO ] Parsed PT model containing 4410 places and 5405 transitions and 16377 arcs in 422 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (51 resets) in 2012 ms. (19 steps per ms) remains 11/16 properties
FORMULA ASLink-PT-10b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 596 ms. (67 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 272 ms. (146 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 297 ms. (134 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 329 ms. (121 steps per ms) remains 11/11 properties
[2026-05-22 22:43:41] [INFO ] Flatten gal took : 602 ms
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 330 ms. (120 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 11/11 properties
[2026-05-22 22:43:42] [INFO ] Flatten gal took : 266 ms
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 11/11 properties
[2026-05-22 22:43:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4707475704501843781.gal : 104 ms
BEST_FIRST walk for 40003 steps (8 resets) in 235 ms. (169 steps per ms) remains 11/11 properties
[2026-05-22 22:43:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3608104004809014846.prop : 6 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/ReachabilityCardinality4707475704501843781.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3608104004809014846.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 11/11 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-13333910349445069010.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10680016861501680749.kers'
[2026-05-22 22:43:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13333910349445069010.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10680016861501680749.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 5405 rows 4410 cols 16377 entries
Finished phase 1 with 3000 SingleSign rule and 977 generalized
[2026-05-22 22:43:42] [INFO ] Computed 433 invariants in 46 ms
Computed 433 P flows in 47 ms.
Exported basis to /tmp/petrispot-output-10680016861501680749.kers
Total runtime 52 ms.
Excessive predecessor constraint size, skipping predecessor.
Loading property file /tmp/ReachabilityCardinality3608104004809014846.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/292 variables, 292/292 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/292 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 1552/1844 variables, 67/359 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1844 variables, 1552/1911 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1844 variables, 0/1911 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 343/2187 variables, 32/1943 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2187 variables, 343/2286 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2187 variables, 0/2286 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 2151/4338 variables, 308/2594 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4338 variables, 2151/4745 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4338/9815 variables, and 4745 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5047 ms.
Refiners :[Domain max(s): 4338/4410 constraints, Positive P Invariants (semi-flows): 99/99 constraints, Generalized P Invariants (flows): 308/334 constraints, State Equation: 0/4410 constraints, PredecessorRefiner: 11/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/292 variables, 292/292 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/292 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 1552/1844 variables, 67/359 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1844 variables, 1552/1911 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1844/9815 variables, and 1916 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5016 ms.
Refiners :[Domain max(s): 1844/4410 constraints, Positive P Invariants (semi-flows): 67/99 constraints, Generalized P Invariants (flows): 0/334 constraints, State Equation: 0/4410 constraints, PredecessorRefiner: 8/3 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10333ms problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 292 out of 4410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4410/4410 places, 5405/5405 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 879 transitions
Trivial Post-agglo rules discarded 879 transitions
Performed 879 trivial Post agglomeration. Transition count delta: 879
Iterating post reduction 0 with 879 rules applied. Total rules applied 879 place count 4410 transition count 4526
Reduce places removed 879 places and 0 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 919 rules applied. Total rules applied 1798 place count 3531 transition count 4486
Reduce places removed 9 places and 0 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Iterating post reduction 2 with 48 rules applied. Total rules applied 1846 place count 3522 transition count 4447
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 3 with 39 rules applied. Total rules applied 1885 place count 3483 transition count 4447
Performed 933 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 933 Pre rules applied. Total rules applied 1885 place count 3483 transition count 3514
Deduced a syphon composed of 933 places in 21 ms
Ensure Unique test removed 84 places
Reduce places removed 1017 places and 0 transitions.
Iterating global reduction 4 with 1950 rules applied. Total rules applied 3835 place count 2466 transition count 3514
Discarding 13 places :
Implicit places reduction removed 13 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 4 with 62 rules applied. Total rules applied 3897 place count 2453 transition count 3465
Reduce places removed 49 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 5 with 51 rules applied. Total rules applied 3948 place count 2403 transition count 3464
Reduce places removed 1 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 6 with 12 rules applied. Total rules applied 3960 place count 2402 transition count 3453
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 3971 place count 2391 transition count 3453
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 28 Pre rules applied. Total rules applied 3971 place count 2391 transition count 3425
Deduced a syphon composed of 28 places in 9 ms
Ensure Unique test removed 25 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 8 with 81 rules applied. Total rules applied 4052 place count 2338 transition count 3425
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 24 Pre rules applied. Total rules applied 4052 place count 2338 transition count 3401
Deduced a syphon composed of 24 places in 27 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 8 with 48 rules applied. Total rules applied 4100 place count 2314 transition count 3401
Discarding 133 places :
Symmetric choice reduction at 8 with 133 rule applications. Total rules 4233 place count 2181 transition count 3268
Iterating global reduction 8 with 133 rules applied. Total rules applied 4366 place count 2181 transition count 3268
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 34 Pre rules applied. Total rules applied 4366 place count 2181 transition count 3234
Deduced a syphon composed of 34 places in 11 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 8 with 68 rules applied. Total rules applied 4434 place count 2147 transition count 3234
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 4441 place count 2140 transition count 3189
Iterating global reduction 8 with 7 rules applied. Total rules applied 4448 place count 2140 transition count 3189
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 6 Pre rules applied. Total rules applied 4448 place count 2140 transition count 3183
Deduced a syphon composed of 6 places in 9 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 4460 place count 2134 transition count 3183
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4461 place count 2133 transition count 3175
Iterating global reduction 8 with 1 rules applied. Total rules applied 4462 place count 2133 transition count 3175
Performed 243 Post agglomeration using F-continuation condition.Transition count delta: 243
Deduced a syphon composed of 243 places in 9 ms
Ensure Unique test removed 5 places
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 8 with 491 rules applied. Total rules applied 4953 place count 1885 transition count 2932
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4954 place count 1884 transition count 2931
Iterating global reduction 8 with 1 rules applied. Total rules applied 4955 place count 1884 transition count 2931
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 4959 place count 1882 transition count 2940
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 4962 place count 1882 transition count 2937
Discarding 3 places :
Implicit places reduction removed 3 places
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 8 with 6 rules applied. Total rules applied 4968 place count 1879 transition count 2934
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 4971 place count 1876 transition count 2934
Free-agglomeration rule applied 13 times.
Iterating global reduction 10 with 13 rules applied. Total rules applied 4984 place count 1876 transition count 2921
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 10 with 13 rules applied. Total rules applied 4997 place count 1863 transition count 2921
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 11 with 9 rules applied. Total rules applied 5006 place count 1863 transition count 2912
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 11 with 9 rules applied. Total rules applied 5015 place count 1854 transition count 2912
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 5016 place count 1854 transition count 2912
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 5017 place count 1853 transition count 2911
Reduce places removed 8 places and 0 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 12 with 9 rules applied. Total rules applied 5026 place count 1845 transition count 2910
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 13 with 2 rules applied. Total rules applied 5028 place count 1844 transition count 2909
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 5029 place count 1843 transition count 2909
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 13 Pre rules applied. Total rules applied 5029 place count 1843 transition count 2896
Deduced a syphon composed of 13 places in 8 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 15 with 26 rules applied. Total rules applied 5055 place count 1830 transition count 2896
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 15 with 5 rules applied. Total rules applied 5060 place count 1825 transition count 2896
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 5060 place count 1825 transition count 2895
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 5062 place count 1824 transition count 2895
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 6 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 16 with 20 rules applied. Total rules applied 5082 place count 1814 transition count 2885
Discarding 4 places :
Symmetric choice reduction at 16 with 4 rule applications. Total rules 5086 place count 1810 transition count 2881
Iterating global reduction 16 with 4 rules applied. Total rules applied 5090 place count 1810 transition count 2881
Discarding 2 places :
Symmetric choice reduction at 16 with 2 rule applications. Total rules 5092 place count 1808 transition count 2879
Iterating global reduction 16 with 2 rules applied. Total rules applied 5094 place count 1808 transition count 2879
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 5096 place count 1808 transition count 2877
Free-agglomeration rule applied 2 times.
Iterating global reduction 17 with 2 rules applied. Total rules applied 5098 place count 1808 transition count 2875
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 5100 place count 1806 transition count 2875
Applied a total of 5100 rules in 2590 ms. Remains 1806 /4410 variables (removed 2604) and now considering 2875/5405 (removed 2530) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2599 ms. Remains : 1806/4410 places, 2875/5405 transitions.
RANDOM walk for 40000 steps (188 resets) in 927 ms. (43 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (16 resets) in 342 ms. (116 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (18 resets) in 348 ms. (114 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (17 resets) in 319 ms. (125 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (17 resets) in 340 ms. (117 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (16 resets) in 207 ms. (192 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (17 resets) in 174 ms. (228 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (15 resets) in 248 ms. (160 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (20 resets) in 120 ms. (330 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (18 resets) in 177 ms. (224 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (18 resets) in 203 ms. (196 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (18 resets) in 177 ms. (224 steps per ms) remains 11/11 properties
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :10 after 16
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :16 after 22
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :22 after 294
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :294 after 394
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :394 after 807
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :807 after 26888
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :26888 after 110044
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :110044 after 906895
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :906895 after 1.46003e+11
SDD proceeding with computation,11 properties remain. new max is 8192
SDD size :1.46003e+11 after 5.88427e+11
Interrupted probabilistic random walk after 83478 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :1 out of 11
Probabilistic random walk after 83478 steps, saw 39675 distinct states, run finished after 3013 ms. (steps per millisecond=27 ) properties seen :1
FORMULA ASLink-PT-10b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12680012158192328029.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3601285667902990175.kers'
[2026-05-22 22:43:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12680012158192328029.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3601285667902990175.kers]
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 6 ms.
// Phase 1: matrix 2875 rows 1794 cols 10877 entries
Finished phase 1 with 493 SingleSign rule and 1024 generalized
[2026-05-22 22:43:59] [INFO ] Computed 289 invariants in 43 ms
Computed 289 P flows in 46 ms.
Exported basis to /tmp/petrispot-output-3601285667902990175.kers
Total runtime 49 ms.
[2026-05-22 22:43:59] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/291 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 682/973 variables, 68/68 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/973 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 42/1015 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1015 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1/1016 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,11 properties remain. new max is 16384
SDD size :5.88427e+11 after 1.78867e+21
At refinement iteration 6 (INCLUDED_ONLY) 0/1016 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 742/1758 variables, 177/257 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1758 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 19/1777 variables, 11/268 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1777 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 1/1778 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1778 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,11 properties remain. new max is 32768
SDD size :1.78867e+21 after 5.42075e+34
At refinement iteration 13 (OVERLAPS) 28/1806 variables, 20/289 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1806 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 2875/4681 variables, 1806/2095 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4681 variables, 14/2109 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4681 variables, 0/2109 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 0/4681 variables, 0/2109 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4681/4681 variables, and 2109 constraints, problems are : Problem set: 0 solved, 10 unsolved in 9989 ms.
Refiners :[Positive P Invariants (semi-flows): 92/92 constraints, Generalized P Invariants (flows): 197/197 constraints, State Equation: 1806/1806 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 10/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/291 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 682/973 variables, 68/68 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/973 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/973 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/973 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 42/1015 variables, 11/81 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1015 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 1/1016 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1016 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem ASLink-PT-10b-ReachabilityFireability-2024-04 is UNSAT
FORMULA ASLink-PT-10b-ReachabilityFireability-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 742/1758 variables, 177/259 constraints. Problems are: Problem set: 1 solved, 9 unsolved
SDD proceeding with computation,11 properties remain. new max is 65536
SDD size :5.42075e+34 after 3.40741e+59
At refinement iteration 10 (INCLUDED_ONLY) 0/1758 variables, 6/265 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1758 variables, 4/269 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1758 variables, 1/270 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1758 variables, 0/270 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 19/1777 variables, 11/281 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1777 variables, 0/281 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 1/1778 variables, 1/282 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1778 variables, 0/282 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 28/1806 variables, 20/302 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1806 variables, 0/302 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Problem ASLink-PT-10b-ReachabilityFireability-2024-03 is UNSAT
FORMULA ASLink-PT-10b-ReachabilityFireability-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-10b-ReachabilityFireability-2024-08 is UNSAT
FORMULA ASLink-PT-10b-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-10b-ReachabilityFireability-2024-13 is UNSAT
FORMULA ASLink-PT-10b-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 20 (OVERLAPS) 2875/4681 variables, 1806/2108 constraints. Problems are: Problem set: 4 solved, 6 unsolved
Problem ASLink-PT-10b-ReachabilityFireability-2024-02 is UNSAT
FORMULA ASLink-PT-10b-ReachabilityFireability-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-10b-ReachabilityFireability-2024-02 is UNSAT
At refinement iteration 21 (INCLUDED_ONLY) 0/4681 variables, 14/2122 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/4681 variables, 1/2123 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/4681 variables, 0/2123 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 0/4681 variables, 0/2123 constraints. Problems are: Problem set: 5 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4681/4681 variables, and 2123 constraints, problems are : Problem set: 5 solved, 5 unsolved in 42731 ms.
Refiners :[Positive P Invariants (semi-flows): 92/92 constraints, Generalized P Invariants (flows): 197/197 constraints, State Equation: 1806/1806 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 9/2 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52854ms problems are : Problem set: 5 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
FORMULA ASLink-PT-10b-ReachabilityFireability-2024-14 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 36924 ms.
Support contains 124 out of 1806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1806/1806 places, 2875/2875 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 1806 transition count 2855
Reduce places removed 23 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 44 place count 1783 transition count 2854
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 45 place count 1782 transition count 2854
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 97 Pre rules applied. Total rules applied 45 place count 1782 transition count 2757
Deduced a syphon composed of 97 places in 7 ms
Ensure Unique test removed 11 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 205 rules applied. Total rules applied 250 place count 1674 transition count 2757
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 254 place count 1671 transition count 2756
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 255 place count 1670 transition count 2756
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 255 place count 1670 transition count 2752
Deduced a syphon composed of 4 places in 7 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 265 place count 1664 transition count 2752
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 270 place count 1659 transition count 2725
Iterating global reduction 5 with 5 rules applied. Total rules applied 275 place count 1659 transition count 2725
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 276 place count 1658 transition count 2725
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 277 place count 1657 transition count 2717
Iterating global reduction 6 with 1 rules applied. Total rules applied 278 place count 1657 transition count 2717
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 279 place count 1656 transition count 2709
Iterating global reduction 6 with 1 rules applied. Total rules applied 280 place count 1656 transition count 2709
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 281 place count 1655 transition count 2701
Iterating global reduction 6 with 1 rules applied. Total rules applied 282 place count 1655 transition count 2701
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 6 with 51 rules applied. Total rules applied 333 place count 1629 transition count 2676
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 337 place count 1625 transition count 2672
Iterating global reduction 6 with 4 rules applied. Total rules applied 341 place count 1625 transition count 2672
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 6 with 2 rules applied. Total rules applied 343 place count 1625 transition count 2670
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 344 place count 1624 transition count 2670
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 345 place count 1623 transition count 2669
Iterating global reduction 8 with 1 rules applied. Total rules applied 346 place count 1623 transition count 2669
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 347 place count 1623 transition count 2668
Free-agglomeration rule applied 6 times.
Iterating global reduction 9 with 6 rules applied. Total rules applied 353 place count 1623 transition count 2662
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 362 place count 1616 transition count 2660
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 364 place count 1615 transition count 2659
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 365 place count 1615 transition count 2658
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 366 place count 1614 transition count 2658
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 11 with 3 rules applied. Total rules applied 369 place count 1614 transition count 2655
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 372 place count 1611 transition count 2655
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 374 place count 1611 transition count 2655
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 12 with 7 rules applied. Total rules applied 381 place count 1604 transition count 2648
Reduce places removed 5 places and 0 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 12 with 7 rules applied. Total rules applied 388 place count 1599 transition count 2646
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 390 place count 1597 transition count 2646
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 7 Pre rules applied. Total rules applied 390 place count 1597 transition count 2639
Deduced a syphon composed of 7 places in 5 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 14 with 14 rules applied. Total rules applied 404 place count 1590 transition count 2639
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 14 with 3 rules applied. Total rules applied 407 place count 1587 transition count 2639
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 5 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 15 with 12 rules applied. Total rules applied 419 place count 1581 transition count 2633
Discarding 3 places :
Symmetric choice reduction at 15 with 3 rule applications. Total rules 422 place count 1578 transition count 2630
Iterating global reduction 15 with 3 rules applied. Total rules applied 425 place count 1578 transition count 2630
Free-agglomeration rule applied 3 times.
Iterating global reduction 15 with 3 rules applied. Total rules applied 428 place count 1578 transition count 2627
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 431 place count 1575 transition count 2627
Applied a total of 431 rules in 1395 ms. Remains 1575 /1806 variables (removed 231) and now considering 2627/2875 (removed 248) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1396 ms. Remains : 1575/1806 places, 2627/2875 transitions.
RANDOM walk for 40000 steps (264 resets) in 353 ms. (112 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (24 resets) in 154 ms. (258 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (25 resets) in 187 ms. (212 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (25 resets) in 109 ms. (363 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (24 resets) in 156 ms. (254 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 146558 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 4
Probabilistic random walk after 146558 steps, saw 38612 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) 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-2460577035397982688.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12046076705417603876.kers'
[2026-05-22 22:45:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2460577035397982688.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12046076705417603876.kers]
Culling duplicate invariants (modulo rational): removing 22 columns.
Culled 22 columns in 1 ms.
// Phase 1: matrix 2627 rows 1553 cols 10099 entries
Finished phase 1 with 367 SingleSign rule and 949 generalized
[2026-05-22 22:45:34] [INFO ] Computed 259 invariants in 30 ms
Computed 259 P flows in 31 ms.
Exported basis to /tmp/petrispot-output-12046076705417603876.kers
Total runtime 34 ms.
[2026-05-22 22:45:34] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 592/716 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/716 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 86/802 variables, 17/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/802 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 61/863 variables, 8/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/863 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 19/882 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/882 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 624/1506 variables, 130/212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1506 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 27/1533 variables, 16/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1533 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 3/1536 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1536 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 36/1572 variables, 25/256 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1572 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 3/1575 variables, 3/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1575 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2627/4202 variables, 1575/1834 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4202 variables, 1/1835 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/4202 variables, 0/1835 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/4202 variables, 0/1835 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4202/4202 variables, and 1835 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4856 ms.
Refiners :[Positive P Invariants (semi-flows): 104/104 constraints, Generalized P Invariants (flows): 155/155 constraints, State Equation: 1575/1575 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 592/716 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/716 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 86/802 variables, 17/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/802 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 61/863 variables, 8/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/863 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 19/882 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/882 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 624/1506 variables, 130/212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1506 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1506 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 27/1533 variables, 16/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1533 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 3/1536 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1536 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1536 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1536 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 36/1572 variables, 25/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1572 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 3/1575 variables, 3/263 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1575 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 2627/4202 variables, 1575/1838 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/4202 variables, 1/1839 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/4202 variables, 1/1840 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/4202 variables, 0/1840 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 0/4202 variables, 1/1841 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/4202 variables, 0/1841 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 0/4202 variables, 0/1841 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4202/4202 variables, and 1841 constraints, problems are : Problem set: 0 solved, 4 unsolved in 37150 ms.
Refiners :[Positive P Invariants (semi-flows): 104/104 constraints, Generalized P Invariants (flows): 155/155 constraints, State Equation: 1575/1575 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 42111ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6062 ms.
Support contains 124 out of 1575 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1575/1575 places, 2627/2627 transitions.
Applied a total of 0 rules in 68 ms. Remains 1575 /1575 variables (removed 0) and now considering 2627/2627 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 1575/1575 places, 2627/2627 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1575/1575 places, 2627/2627 transitions.
Applied a total of 0 rules in 67 ms. Remains 1575 /1575 variables (removed 0) and now considering 2627/2627 (removed 0) transitions.
[2026-05-22 22:46:22] [INFO ] Invariant cache hit.
[2026-05-22 22:46:23] [INFO ] Implicit Places using invariants in 1364 ms returned [3, 21, 33, 53, 71, 92, 142, 154, 155, 157, 175, 193, 268, 272, 274, 285, 286, 287, 306, 325, 348, 400, 407, 408, 419, 422, 423, 425, 445, 463, 539, 543, 544, 555, 556, 559, 597, 669, 673, 674, 685, 686, 710, 728, 800, 805, 823, 827, 845, 864, 945, 949, 950, 962, 963, 965, 984, 1084, 1102, 1103, 1125, 1143, 1166, 1187, 1188, 1212, 1231, 1232, 1247, 1248, 1249, 1251, 1273, 1292, 1333, 1372, 1377, 1378, 1381, 1395, 1396, 1397, 1428, 1435, 1454, 1456, 1457, 1473, 1481, 1488, 1494, 1500, 1506, 1513, 1519, 1525, 1532, 1538]
[2026-05-22 22:46:23] [INFO ] Actually due to overlaps returned [1428, 1397, 53, 175, 306, 445, 710, 845, 984, 1125, 1251, 1273, 1435, 157, 287, 425, 559, 827, 33, 154, 285, 422, 555, 685, 823, 962, 965, 1102, 1248, 1395, 155, 286, 423, 556, 686, 963, 1103, 1249, 1396, 1454, 3, 272, 407, 408, 543, 544, 673, 674, 805, 949, 950, 1084, 1231, 1232, 1377, 1378, 21, 193, 419, 463, 597, 728, 864, 1247, 1292, 1456, 1506, 1525, 71, 92, 274, 325, 348, 800, 1143, 1166, 1381, 1457, 1473, 1481, 1488, 1494, 1500, 1513, 1519, 1532, 1538]
Discarding 87 places :
Implicit Place search using SMT only with invariants took 1392 ms to find 87 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1488/1575 places, 2627/2627 transitions.
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 1480 transition count 2497
Reduce places removed 130 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 1 with 155 rules applied. Total rules applied 293 place count 1350 transition count 2472
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 315 place count 1328 transition count 2472
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 315 place count 1328 transition count 2433
Deduced a syphon composed of 39 places in 5 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 393 place count 1289 transition count 2433
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 394 place count 1288 transition count 2433
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 407 place count 1275 transition count 2420
Iterating global reduction 4 with 13 rules applied. Total rules applied 420 place count 1275 transition count 2420
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 420 place count 1275 transition count 2419
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 422 place count 1274 transition count 2419
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 426 place count 1270 transition count 2413
Iterating global reduction 4 with 4 rules applied. Total rules applied 430 place count 1270 transition count 2413
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 431 place count 1269 transition count 2412
Iterating global reduction 4 with 1 rules applied. Total rules applied 432 place count 1269 transition count 2412
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 433 place count 1269 transition count 2411
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 6 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 5 with 150 rules applied. Total rules applied 583 place count 1194 transition count 2336
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 588 place count 1189 transition count 2331
Iterating global reduction 5 with 5 rules applied. Total rules applied 593 place count 1189 transition count 2331
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 595 place count 1189 transition count 2329
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 597 place count 1187 transition count 2327
Iterating global reduction 6 with 2 rules applied. Total rules applied 599 place count 1187 transition count 2327
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 600 place count 1187 transition count 2326
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 602 place count 1186 transition count 2327
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 603 place count 1186 transition count 2326
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 604 place count 1186 transition count 2325
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 605 place count 1185 transition count 2325
Free-agglomeration rule (complex) applied 38 times.
Iterating global reduction 8 with 38 rules applied. Total rules applied 643 place count 1185 transition count 2287
Ensure Unique test removed 1 places
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 8 with 39 rules applied. Total rules applied 682 place count 1146 transition count 2287
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 685 place count 1146 transition count 2284
Partial Free-agglomeration rule applied 21 times.
Drop transitions (Partial Free agglomeration) removed 21 transitions
Iterating global reduction 9 with 21 rules applied. Total rules applied 706 place count 1146 transition count 2284
Applied a total of 706 rules in 776 ms. Remains 1146 /1488 variables (removed 342) and now considering 2284/2627 (removed 343) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6290491597972877458.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7281223694407594675.kers'
[2026-05-22 22:46:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6290491597972877458.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7281223694407594675.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 2284 rows 1144 cols 9064 entries
Finished phase 1 with 352 SingleSign rule and 632 generalized
[2026-05-22 22:46:24] [INFO ] Computed 162 invariants in 35 ms
Computed 162 P flows in 36 ms.
Exported basis to /tmp/petrispot-output-7281223694407594675.kers
Total runtime 38 ms.
[2026-05-22 22:46:25] [INFO ] Implicit Places using invariants in 990 ms returned [94, 100, 103, 105, 106, 173, 191, 197, 200, 202, 208, 209, 280, 287, 299, 300, 357, 379, 386, 389, 391, 396, 397, 456, 478, 486, 492, 562, 597, 611, 612, 670, 703, 706, 708, 716, 802, 808, 823, 824, 902, 903, 911, 922, 924, 936, 937, 938, 996, 1016, 1022, 1025, 1027, 1132, 1135, 1138, 1141, 1145]
[2026-05-22 22:46:25] [INFO ] Actually due to overlaps returned [208, 299, 396, 611, 823, 937, 209, 300, 397, 612, 824, 938, 716, 94, 100, 105, 191, 197, 202, 379, 391, 703, 708, 802, 911, 924, 1016, 1022, 1027, 106, 173, 280, 287, 357, 386, 456, 478, 486, 492, 562, 597, 670, 808, 902, 936, 996, 1132, 1135, 1138, 1141, 1145]
Discarding 51 places :
Implicit Place search using SMT only with invariants took 993 ms to find 51 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1095/1575 places, 2284/2627 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1095 transition count 2283
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1094 transition count 2283
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 26 place count 1070 transition count 2259
Iterating global reduction 2 with 24 rules applied. Total rules applied 50 place count 1070 transition count 2259
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 56 place count 1064 transition count 2253
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 1064 transition count 2253
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 1064 transition count 2252
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 64 place count 1063 transition count 2251
Iterating global reduction 3 with 1 rules applied. Total rules applied 65 place count 1063 transition count 2251
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 5 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 97 place count 1047 transition count 2235
Free-agglomeration rule applied 22 times.
Iterating global reduction 3 with 22 rules applied. Total rules applied 119 place count 1047 transition count 2213
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 141 place count 1025 transition count 2213
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 142 place count 1025 transition count 2212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 143 place count 1024 transition count 2212
Applied a total of 143 rules in 275 ms. Remains 1024 /1095 variables (removed 71) and now considering 2212/2284 (removed 72) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12623520698994369306.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14894102852551587107.kers'
[2026-05-22 22:46:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12623520698994369306.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14894102852551587107.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 4 ms.
// Phase 1: matrix 2212 rows 1022 cols 8670 entries
Finished phase 1 with 302 SingleSign rule and 611 generalized
[2026-05-22 22:46:25] [INFO ] Computed 111 invariants in 55 ms
Computed 111 P flows in 56 ms.
Exported basis to /tmp/petrispot-output-14894102852551587107.kers
Total runtime 57 ms.
[2026-05-22 22:46:26] [INFO ] Implicit Places using invariants in 851 ms returned [814]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 853 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 1023/1575 places, 2212/2627 transitions.
Applied a total of 0 rules in 39 ms. Remains 1023 /1023 variables (removed 0) and now considering 2212/2212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 4396 ms. Remains : 1023/1575 places, 2212/2627 transitions.
RANDOM walk for 40000 steps (359 resets) in 259 ms. (153 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (47 resets) in 110 ms. (360 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (46 resets) in 178 ms. (223 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (45 resets) in 70 ms. (563 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (43 resets) in 131 ms. (303 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 212095 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 4
Probabilistic random walk after 212095 steps, saw 55834 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) 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-1941786560802477889.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1208925253724829203.kers'
[2026-05-22 22:46:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1941786560802477889.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1208925253724829203.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 2212 rows 1021 cols 8667 entries
Finished phase 1 with 304 SingleSign rule and 609 generalized
[2026-05-22 22:46:29] [INFO ] Computed 110 invariants in 36 ms
Computed 110 P flows in 36 ms.
Exported basis to /tmp/petrispot-output-1208925253724829203.kers
Total runtime 38 ms.
[2026-05-22 22:46:29] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 365/489 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/489 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 9/498 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/498 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 489/987 variables, 68/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/987 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 5/992 variables, 4/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/992 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 31/1023 variables, 10/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1023 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2212/3235 variables, 1023/1133 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3235 variables, 3/1136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3235 variables, 0/1136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/3235 variables, 0/1136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3235/3235 variables, and 1136 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2815 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 78/78 constraints, State Equation: 1023/1023 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 365/489 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/489 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 9/498 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/498 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/498 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 489/987 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/987 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/987 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 5/992 variables, 4/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/992 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 31/1023 variables, 10/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1023 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 2212/3235 variables, 1023/1137 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3235 variables, 3/1140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3235 variables, 1/1141 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3235 variables, 1/1142 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3235 variables, 0/1142 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/3235 variables, 0/1142 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3235/3235 variables, and 1142 constraints, problems are : Problem set: 0 solved, 4 unsolved in 13790 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 78/78 constraints, State Equation: 1023/1023 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16667ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
FORMULA ASLink-PT-10b-ReachabilityFireability-2024-12 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 7276 ms.
Support contains 123 out of 1023 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1023/1023 places, 2212/2212 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1021 transition count 2211
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 3 place count 1021 transition count 2209
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 1019 transition count 2209
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 9 place count 1017 transition count 2209
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 1016 transition count 2208
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 1016 transition count 2208
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 1015 transition count 2207
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 1015 transition count 2207
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 1014 transition count 2206
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 1014 transition count 2206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 1014 transition count 2205
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 1014 transition count 2204
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 1013 transition count 2204
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 1013 transition count 2204
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 1013 transition count 2203
Applied a total of 20 rules in 287 ms. Remains 1013 /1023 variables (removed 10) and now considering 2203/2212 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 288 ms. Remains : 1013/1023 places, 2203/2212 transitions.
RANDOM walk for 40000 steps (403 resets) in 268 ms. (148 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (45 resets) in 118 ms. (336 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (46 resets) in 183 ms. (217 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (42 resets) in 134 ms. (296 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 242354 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :0 out of 3
Probabilistic random walk after 242354 steps, saw 61433 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) 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-85878898855602695.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4974017661833477450.kers'
[2026-05-22 22:46:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-85878898855602695.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4974017661833477450.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 4 ms.
// Phase 1: matrix 2203 rows 1012 cols 8642 entries
Finished phase 1 with 300 SingleSign rule and 606 generalized
[2026-05-22 22:46:57] [INFO ] Computed 107 invariants in 56 ms
Computed 107 P flows in 57 ms.
Exported basis to /tmp/petrispot-output-4974017661833477450.kers
Total runtime 60 ms.
[2026-05-22 22:46:57] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 363/486 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/495 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/495 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 483/978 variables, 67/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/978 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 4/982 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/982 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 31/1013 variables, 10/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1013 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2203/3216 variables, 1013/1120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3216 variables, 3/1123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3216 variables, 0/1123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/3216 variables, 0/1123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3216/3216 variables, and 1123 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2191 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 77/77 constraints, State Equation: 1013/1013 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 363/486 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/495 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/495 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/495 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 483/978 variables, 67/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/978 variables, 4/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/978 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 4/982 variables, 3/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/982 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 31/1013 variables, 10/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1013 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2203/3216 variables, 1013/1125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3216 variables, 3/1128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3216 variables, 2/1130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3216 variables, 0/1130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/3216 variables, 0/1130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3216/3216 variables, and 1130 constraints, problems are : Problem set: 0 solved, 3 unsolved in 11423 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 77/77 constraints, State Equation: 1013/1013 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13711ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4794 ms.
Support contains 123 out of 1013 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1013/1013 places, 2203/2203 transitions.
Applied a total of 0 rules in 39 ms. Remains 1013 /1013 variables (removed 0) and now considering 2203/2203 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 1013/1013 places, 2203/2203 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1013/1013 places, 2203/2203 transitions.
Applied a total of 0 rules in 38 ms. Remains 1013 /1013 variables (removed 0) and now considering 2203/2203 (removed 0) transitions.
[2026-05-22 22:47:15] [INFO ] Invariant cache hit.
[2026-05-22 22:47:16] [INFO ] Implicit Places using invariants in 598 ms returned [696]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 613 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1012/1013 places, 2203/2203 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1012 transition count 2202
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1011 transition count 2202
Applied a total of 2 rules in 79 ms. Remains 1011 /1012 variables (removed 1) and now considering 2202/2203 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11823336550516657489.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11421099805119044912.kers'
[2026-05-22 22:47:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11823336550516657489.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11421099805119044912.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 2202 rows 1010 cols 8652 entries
Finished phase 1 with 301 SingleSign rule and 604 generalized
[2026-05-22 22:47:16] [INFO ] Computed 106 invariants in 22 ms
Computed 106 P flows in 22 ms.
Exported basis to /tmp/petrispot-output-11421099805119044912.kers
Total runtime 24 ms.
[2026-05-22 22:47:17] [INFO ] Implicit Places using invariants in 622 ms returned []
[2026-05-22 22:47:17] [INFO ] Invariant cache hit.
[2026-05-22 22:47:18] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-22 22:47:19] [INFO ] Implicit Places using invariants and state equation in 2487 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3114 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1010/1013 places, 2202/2203 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1010 transition count 2202
Applied a total of 1 rules in 112 ms. Remains 1010 /1010 variables (removed 0) and now considering 2202/2202 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5169548752692293367.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-733151647146933169.kers'
[2026-05-22 22:47:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5169548752692293367.kers, --Pflows, --basisKERS=/tmp/petrispot-output-733151647146933169.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 4 ms.
// Phase 1: matrix 2202 rows 1009 cols 8653 entries
Finished phase 1 with 289 SingleSign rule and 616 generalized
[2026-05-22 22:47:19] [INFO ] Computed 105 invariants in 61 ms
Computed 105 P flows in 61 ms.
Exported basis to /tmp/petrispot-output-733151647146933169.kers
Total runtime 66 ms.
[2026-05-22 22:47:20] [INFO ] Implicit Places using invariants in 805 ms returned []
[2026-05-22 22:47:20] [INFO ] Invariant cache hit.
[2026-05-22 22:47:23] [INFO ] Implicit Places using invariants and state equation in 2591 ms returned []
Implicit Place search using SMT with State Equation took 3416 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 1010/1013 places, 2202/2203 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 7373 ms. Remains : 1010/1013 places, 2202/2203 transitions.
RANDOM walk for 40000 steps (381 resets) in 304 ms. (131 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (45 resets) in 125 ms. (317 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (43 resets) in 186 ms. (213 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (40 resets) in 107 ms. (370 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 226349 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 3
Probabilistic random walk after 226349 steps, saw 58449 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
[2026-05-22 22:47:26] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 377/500 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/509 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/509 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 471/980 variables, 68/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/980 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 4/984 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/984 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 26/1010 variables, 9/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1010 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2202/3212 variables, 1010/1115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3212 variables, 0/1115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/3212 variables, 0/1115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3212/3212 variables, and 1115 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2842 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 77/77 constraints, State Equation: 1010/1010 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 377/500 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 9/509 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/509 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 471/980 variables, 68/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/980 variables, 5/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/980 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/980 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 4/984 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/984 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 26/1010 variables, 9/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1010 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2202/3212 variables, 1010/1122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3212 variables, 0/1122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/3212 variables, 1/1123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3212 variables, 0/1123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/3212 variables, 0/1123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3212/3212 variables, and 1123 constraints, problems are : Problem set: 0 solved, 3 unsolved in 15149 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 77/77 constraints, State Equation: 1010/1010 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 18010ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 5387 ms.
Support contains 123 out of 1010 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 2202/2202 transitions.
Applied a total of 0 rules in 46 ms. Remains 1010 /1010 variables (removed 0) and now considering 2202/2202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 1010/1010 places, 2202/2202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 2202/2202 transitions.
Applied a total of 0 rules in 45 ms. Remains 1010 /1010 variables (removed 0) and now considering 2202/2202 (removed 0) transitions.
[2026-05-22 22:47:50] [INFO ] Invariant cache hit.
[2026-05-22 22:47:50] [INFO ] Implicit Places using invariants in 634 ms returned []
[2026-05-22 22:47:50] [INFO ] Invariant cache hit.
[2026-05-22 22:47:53] [INFO ] Implicit Places using invariants and state equation in 2514 ms returned []
Implicit Place search using SMT with State Equation took 3174 ms to find 0 implicit places.
[2026-05-22 22:47:53] [INFO ] Redundant transitions in 92 ms returned []
Running 2147 sub problems to find dead transitions.
[2026-05-22 22:47:53] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1003 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2147 unsolved
SMT process timed out in 30907ms, After SMT, problems are : Problem set: 0 solved, 2147 unsolved
Search for dead transitions found 0 dead transitions in 30916ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34265 ms. Remains : 1010/1010 places, 2202/2202 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 40 ms. Remains 1010 /1010 variables (removed 0) and now considering 2202/2202 (removed 0) transitions.
Running SMT prover for 3 properties.
[2026-05-22 22:48:24] [INFO ] Invariant cache hit.
[2026-05-22 22:48:24] [INFO ] After 384ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2026-05-22 22:48:24] [INFO ] [Nat]Absence check using 28 positive place invariants in 10 ms returned sat
[2026-05-22 22:48:25] [INFO ] [Nat]Absence check using 28 positive and 77 generalized place invariants in 70 ms returned sat
[2026-05-22 22:48:34] [INFO ] After 9452ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2026-05-22 22:48:41] [INFO ] After 15939ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2026-05-22 22:48:49] [INFO ] After 24379ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 24853 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-22 22:48:49] [INFO ] Flatten gal took : 161 ms
[2026-05-22 22:48:49] [INFO ] Applying decomposition
[2026-05-22 22:48:49] [INFO ] Flatten gal took : 120 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph4514887293822030222.txt' '-o' '/tmp/graph4514887293822030222.bin' '-w' '/tmp/graph4514887293822030222.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4514887293822030222.bin' '-l' '-1' '-v' '-w' '/tmp/graph4514887293822030222.weights' '-q' '0' '-e' '0.001'
[2026-05-22 22:48:50] [INFO ] Decomposing Gal with order
[2026-05-22 22:48:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 22:48:51] [INFO ] Removed a total of 3811 redundant transitions.
[2026-05-22 22:48:51] [INFO ] Flatten gal took : 342 ms
[2026-05-22 22:48:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 48 ms.
[2026-05-22 22:48:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12212754292891295153.gal : 57 ms
[2026-05-22 22:48:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2200524528885419304.prop : 0 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/ReachabilityCardinality12212754292891295153.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2200524528885419304.prop' '--nowitness'

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 ...308
Loading property file /tmp/ReachabilityCardinality2200524528885419304.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :2 after 1.02222e+08
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :1.02222e+08 after 2.0123e+08
Detected timeout of ITS tools.
[2026-05-22 23:18:56] [INFO ] Flatten gal took : 1343 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12549240512938866007
[2026-05-22 23:18:56] [INFO ] Too many transitions (2202) to apply POR reductions. Disabling POR matrices.
[2026-05-22 23:18:57] [INFO ] Applying decomposition
[2026-05-22 23:18:58] [INFO ] Built C files in 1220ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12549240512938866007
Running compilation step : cd /tmp/ltsmin12549240512938866007;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-22 23:18:58] [INFO ] Flatten gal took : 1249 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3273200066372806802.txt' '-o' '/tmp/graph3273200066372806802.bin' '-w' '/tmp/graph3273200066372806802.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3273200066372806802.bin' '-l' '-1' '-v' '-w' '/tmp/graph3273200066372806802.weights' '-q' '0' '-e' '0.001'
[2026-05-22 23:19:02] [INFO ] Decomposing Gal with order
[2026-05-22 23:19:02] [INFO ] Rewriting arrays to variables to allow decomposition.
Compilation finished in 8170 ms.
Running link step : cd /tmp/ltsmin12549240512938866007;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 89 ms.
Running LTSmin : cd /tmp/ltsmin12549240512938866007;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT10bReachabilityFireability202400==true'
[2026-05-22 23:19:07] [INFO ] Removed a total of 3993 redundant transitions.
[2026-05-22 23:19:07] [INFO ] Flatten gal took : 288 ms
[2026-05-22 23:19:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 174 labels/synchronizations in 56 ms.
[2026-05-22 23:19:07] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability6730236803357422569.gal : 20 ms
[2026-05-22 23:19:07] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability2319677654069431995.prop : 3 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/ReachabilityFireability6730236803357422569.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability2319677654069431995.prop' '--nowitness'

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 ...307
Loading property file /tmp/ReachabilityFireability2319677654069431995.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :12 after 18
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :18 after 132
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :132 after 1932
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1932 after 485520
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :485520 after 1.15662e+09
Invariant property ASLink-PT-10b-ReachabilityFireability-2024-11 does not hold.
FORMULA ASLink-PT-10b-ReachabilityFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ASLink-PT-10b-ReachabilityFireability-2024-00 does not hold.
FORMULA ASLink-PT-10b-ReachabilityFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.29934e+15 after 5.37126e+15
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :5.37126e+15 after 1.25438e+16
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.25438e+16 after 2.85187e+16
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.85187e+16 after 8.21351e+16
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :8.21351e+16 after 6.58371e+19
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.16862e+20 after 3.82395e+20
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin12549240512938866007;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT10bReachabilityFireability202400==true'
Running LTSmin : cd /tmp/ltsmin12549240512938866007;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT10bReachabilityFireability202415==true'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin12549240512938866007;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT10bReachabilityFireability202415==true'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin12549240512938866007;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT10bReachabilityFireability202415==true'

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-10b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is ASLink-PT-10b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r002-oct2-177944366300439"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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