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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 5.5K Mar 5 14:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Mar 5 14:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 5 14:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 5 14:03 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.7K Mar 15 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 15 07:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Mar 5 14:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Mar 5 14:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 5 14:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Mar 5 14:03 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 839K 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-09a-ReachabilityFireability-2024-00
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2024-01
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2024-02
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2024-03
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2024-04
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2024-05
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2024-06
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2024-07
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2024-08
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2024-09
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2024-10
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2024-11
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2024-12
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2024-13
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2024-14
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779485876303

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-09a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-22 21:37:57] [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 21:37:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 21:37:58] [INFO ] Load time of PNML (sax parser for PT used): 218 ms
[2026-05-22 21:37:58] [INFO ] Transformed 1991 places.
[2026-05-22 21:37:58] [INFO ] Transformed 2919 transitions.
[2026-05-22 21:37:58] [INFO ] Found NUPN structural information;
[2026-05-22 21:37:58] [INFO ] Parsed PT model containing 1991 places and 2919 transitions and 10953 arcs in 349 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 31 transitions
Reduce redundant transitions removed 31 transitions.
RANDOM walk for 40000 steps (191 resets) in 2509 ms. (15 steps per ms) remains 15/16 properties
FORMULA ASLink-PT-09a-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 117 ms. (33 steps per ms) remains 15/15 properties
[2026-05-22 21:37:59] [INFO ] Flatten gal took : 407 ms
BEST_FIRST walk for 4003 steps (8 resets) in 524 ms. (7 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 15/15 properties
[2026-05-22 21:37:59] [INFO ] Flatten gal took : 174 ms
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
[2026-05-22 21:37:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7596843509664183799.gal : 97 ms
[2026-05-22 21:37:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16699491962487006228.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/ReachabilityCardinality7596843509664183799.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16699491962487006228.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality16699491962487006228.prop.
Interrupted probabilistic random walk after 137738 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :0 out of 15
Probabilistic random walk after 137738 steps, saw 41301 distinct states, run finished after 3009 ms. (steps per millisecond=45 ) 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-515612351908292223.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-228946789801839280.kers'
[2026-05-22 21:38:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-515612351908292223.kers, --Pflows, --basisKERS=/tmp/petrispot-output-228946789801839280.kers]
Culling duplicate invariants (modulo rational): removing 36 columns.
Culled 36 columns in 2 ms.
// Phase 1: matrix 2888 rows 1955 cols 10819 entries
Finished phase 1 with 762 SingleSign rule and 845 generalized
[2026-05-22 21:38:02] [INFO ] Computed 384 invariants in 29 ms
Computed 384 P flows in 30 ms.
Exported basis to /tmp/petrispot-output-228946789801839280.kers
Total runtime 33 ms.
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :7 after 9
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :9 after 25
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :25 after 44
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :44 after 68
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :68 after 267
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :267 after 19669
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :19669 after 94341
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 426/426 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 2/428 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/426 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 528/954 variables, 67/495 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/954 variables, 528/1023 constraints. Problems are: Problem set: 0 solved, 15 unsolved
SDD proceeding with computation,15 properties remain. new max is 1024
SDD size :94341 after 1.77733e+08
At refinement iteration 5 (INCLUDED_ONLY) 0/954 variables, 2/1025 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/954 variables, 0/1025 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 76/1030 variables, 23/1048 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1030 variables, 76/1124 constraints. Problems are: Problem set: 0 solved, 15 unsolved
SDD proceeding with computation,15 properties remain. new max is 2048
SDD size :1.77733e+08 after 1.78309e+23
At refinement iteration 9 (INCLUDED_ONLY) 0/1030 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 922/1952 variables, 272/1396 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1952 variables, 922/2318 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1952/4879 variables, and 2318 constraints, problems are : Problem set: 0 solved, 15 unsolved in 5037 ms.
Refiners :[Domain max(s): 1952/1991 constraints, Positive P Invariants (semi-flows): 90/90 constraints, Generalized P Invariants (flows): 276/294 constraints, State Equation: 0/1991 constraints, PredecessorRefiner: 15/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 426/426 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 2/428 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/426 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 528/954 variables, 67/495 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/954 variables, 528/1023 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/954 variables, 2/1025 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/954 variables, 0/1025 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 76/1030 variables, 23/1048 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1030 variables, 76/1124 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1030 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem ASLink-PT-09a-ReachabilityFireability-2024-03 is UNSAT
FORMULA ASLink-PT-09a-ReachabilityFireability-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-09a-ReachabilityFireability-2024-05 is UNSAT
FORMULA ASLink-PT-09a-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 10 (OVERLAPS) 922/1952 variables, 272/1396 constraints. Problems are: Problem set: 2 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1952/4879 variables, and 2318 constraints, problems are : Problem set: 2 solved, 13 unsolved in 5024 ms.
Refiners :[Domain max(s): 1952/1991 constraints, Positive P Invariants (semi-flows): 90/90 constraints, Generalized P Invariants (flows): 276/294 constraints, State Equation: 0/1991 constraints, PredecessorRefiner: 9/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10283ms problems are : Problem set: 2 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 312 out of 1991 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1991/1991 places, 2888/2888 transitions.
Ensure Unique test removed 34 places
Discarding 17 places :
Implicit places reduction removed 17 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 188 rules applied. Total rules applied 188 place count 1940 transition count 2751
Reduce places removed 137 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 147 rules applied. Total rules applied 335 place count 1803 transition count 2741
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 345 place count 1793 transition count 2741
Performed 166 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 166 Pre rules applied. Total rules applied 345 place count 1793 transition count 2575
Deduced a syphon composed of 166 places in 12 ms
Ensure Unique test removed 57 places
Reduce places removed 223 places and 0 transitions.
Iterating global reduction 3 with 389 rules applied. Total rules applied 734 place count 1570 transition count 2575
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 736 place count 1569 transition count 2574
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 737 place count 1568 transition count 2574
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 744 place count 1561 transition count 2542
Ensure Unique test removed 1 places
Iterating global reduction 5 with 8 rules applied. Total rules applied 752 place count 1560 transition count 2542
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 6 rules applied. Total rules applied 758 place count 1559 transition count 2537
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 761 place count 1556 transition count 2537
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 5 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 7 with 94 rules applied. Total rules applied 855 place count 1509 transition count 2490
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 857 place count 1509 transition count 2488
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 859 place count 1507 transition count 2488
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 8 with 5 rules applied. Total rules applied 864 place count 1507 transition count 2483
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 869 place count 1502 transition count 2483
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 876 place count 1502 transition count 2483
Applied a total of 876 rules in 884 ms. Remains 1502 /1991 variables (removed 489) and now considering 2483/2888 (removed 405) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 895 ms. Remains : 1502/1991 places, 2483/2888 transitions.
RANDOM walk for 40000 steps (293 resets) in 891 ms. (44 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (32 resets) in 376 ms. (106 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (30 resets) in 435 ms. (91 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (29 resets) in 376 ms. (106 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (30 resets) in 484 ms. (82 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (30 resets) in 196 ms. (203 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (32 resets) in 166 ms. (239 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (16 resets) in 239 ms. (166 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (31 resets) in 160 ms. (248 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (31 resets) in 149 ms. (266 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (31 resets) in 211 ms. (188 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (26 resets) in 294 ms. (135 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (32 resets) in 146 ms. (272 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (31 resets) in 168 ms. (236 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 113702 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :0 out of 13
Probabilistic random walk after 113702 steps, saw 31995 distinct states, run finished after 3002 ms. (steps per millisecond=37 ) 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-8100507579737141586.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6213616510864925395.kers'
[2026-05-22 21:38:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8100507579737141586.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6213616510864925395.kers]
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 1 ms.
// Phase 1: matrix 2483 rows 1490 cols 9756 entries
Finished phase 1 with 388 SingleSign rule and 841 generalized
[2026-05-22 21:38:18] [INFO ] Computed 273 invariants in 25 ms
Computed 273 P flows in 39 ms.
Exported basis to /tmp/petrispot-output-6213616510864925395.kers
Total runtime 41 ms.
[2026-05-22 21:38:18] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 430/742 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/742 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/742 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 66/808 variables, 24/82 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/808 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 676/1484 variables, 178/260 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1484 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 18/1502 variables, 13/273 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1502 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 2483/3985 variables, 1502/1775 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3985 variables, 41/1816 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3985 variables, 0/1816 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 0/3985 variables, 0/1816 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3985/3985 variables, and 1816 constraints, problems are : Problem set: 0 solved, 13 unsolved in 12694 ms.
Refiners :[Positive P Invariants (semi-flows): 77/77 constraints, Generalized P Invariants (flows): 196/196 constraints, State Equation: 1502/1502 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 13/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 430/742 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/742 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/742 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 66/808 variables, 24/82 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/808 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 676/1484 variables, 178/260 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1484 variables, 4/264 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1484 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 18/1502 variables, 13/277 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1502 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1502 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1502 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem ASLink-PT-09a-ReachabilityFireability-2024-04 is UNSAT
FORMULA ASLink-PT-09a-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-09a-ReachabilityFireability-2024-07 is UNSAT
FORMULA ASLink-PT-09a-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-09a-ReachabilityFireability-2024-09 is UNSAT
FORMULA ASLink-PT-09a-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-09a-ReachabilityFireability-2024-11 is UNSAT
FORMULA ASLink-PT-09a-ReachabilityFireability-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3985/3985 variables, and 1782 constraints, problems are : Problem set: 4 solved, 9 unsolved in 45024 ms.
Refiners :[Positive P Invariants (semi-flows): 77/77 constraints, Generalized P Invariants (flows): 196/196 constraints, State Equation: 1502/1502 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 7/6 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57822ms problems are : Problem set: 4 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 191 out of 1502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1502/1502 places, 2483/2483 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 1500 transition count 2470
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 28 place count 1487 transition count 2470
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 28 place count 1487 transition count 2460
Deduced a syphon composed of 10 places in 13 ms
Ensure Unique test removed 4 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 52 place count 1473 transition count 2460
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 1472 transition count 2454
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 1472 transition count 2454
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 68 place count 1465 transition count 2447
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 1465 transition count 2446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 1464 transition count 2446
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 73 place count 1464 transition count 2443
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 76 place count 1461 transition count 2443
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 78 place count 1461 transition count 2443
Applied a total of 78 rules in 521 ms. Remains 1461 /1502 variables (removed 41) and now considering 2443/2483 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 525 ms. Remains : 1461/1502 places, 2443/2483 transitions.
RANDOM walk for 40000 steps (304 resets) in 646 ms. (61 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (32 resets) in 281 ms. (141 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (33 resets) in 316 ms. (126 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (32 resets) in 256 ms. (155 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (32 resets) in 195 ms. (204 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (28 resets) in 217 ms. (183 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (33 resets) in 264 ms. (150 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (21 resets) in 275 ms. (144 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (32 resets) in 154 ms. (258 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (33 resets) in 146 ms. (272 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 124169 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :0 out of 9
Probabilistic random walk after 124169 steps, saw 36413 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) 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-1456034728438987311.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-901565878408263431.kers'
[2026-05-22 21:39:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1456034728438987311.kers, --Pflows, --basisKERS=/tmp/petrispot-output-901565878408263431.kers]
Culling duplicate invariants (modulo rational): removing 16 columns.
Culled 16 columns in 1 ms.
// Phase 1: matrix 2443 rows 1445 cols 9636 entries
Finished phase 1 with 351 SingleSign rule and 843 generalized
[2026-05-22 21:39:20] [INFO ] Computed 267 invariants in 24 ms
Computed 267 P flows in 24 ms.
Exported basis to /tmp/petrispot-output-901565878408263431.kers
Total runtime 26 ms.
[2026-05-22 21:39:20] [INFO ] State equation strengthened by 50 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 438/629 variables, 44/45 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/629 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/629 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 83/712 variables, 31/77 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/712 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 713/1425 variables, 170/247 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1425 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 36/1461 variables, 20/267 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1461 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 2443/3904 variables, 1461/1728 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3904 variables, 50/1778 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3904 variables, 0/1778 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 0/3904 variables, 0/1778 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3904/3904 variables, and 1778 constraints, problems are : Problem set: 0 solved, 9 unsolved in 6857 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 192/192 constraints, State Equation: 1461/1461 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 9/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 438/629 variables, 44/45 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/629 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/629 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 83/712 variables, 31/77 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/712 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 713/1425 variables, 170/247 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1425 variables, 4/251 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1425 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 36/1461 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1461 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1461 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem ASLink-PT-09a-ReachabilityFireability-2024-08 is UNSAT
FORMULA ASLink-PT-09a-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-09a-ReachabilityFireability-2024-14 is UNSAT
FORMULA ASLink-PT-09a-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 13 (OVERLAPS) 2443/3904 variables, 1461/1734 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Problem ASLink-PT-09a-ReachabilityFireability-2024-02 is UNSAT
FORMULA ASLink-PT-09a-ReachabilityFireability-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-09a-ReachabilityFireability-2024-02 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/3904 variables, 50/1784 constraints. Problems are: Problem set: 3 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3904/3904 variables, and 1787 constraints, problems are : Problem set: 3 solved, 6 unsolved in 75036 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 192/192 constraints, State Equation: 1461/1461 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 7/5 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 81967ms problems are : Problem set: 3 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 167 out of 1461 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1461/1461 places, 2443/2443 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 0 with 1 rules applied. Total rules applied 1 place count 1461 transition count 2442
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 1460 transition count 2441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 1459 transition count 2441
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 4 place count 1459 transition count 2439
Deduced a syphon composed of 2 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 9 place count 1456 transition count 2439
Applied a total of 9 rules in 158 ms. Remains 1456 /1461 variables (removed 5) and now considering 2439/2443 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 1456/1461 places, 2439/2443 transitions.
RANDOM walk for 40000 steps (311 resets) in 948 ms. (42 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (33 resets) in 150 ms. (264 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (31 resets) in 222 ms. (179 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (32 resets) in 142 ms. (279 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (32 resets) in 254 ms. (156 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (24 resets) in 290 ms. (137 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (32 resets) in 130 ms. (305 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 131391 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 6
Probabilistic random walk after 131391 steps, saw 39564 distinct states, run finished after 3013 ms. (steps per millisecond=43 ) 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-11568249570549543749.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6050025335435561528.kers'
[2026-05-22 21:40:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11568249570549543749.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6050025335435561528.kers]
Culling duplicate invariants (modulo rational): removing 17 columns.
Culled 17 columns in 1 ms.
// Phase 1: matrix 2439 rows 1439 cols 9623 entries
Finished phase 1 with 348 SingleSign rule and 842 generalized
[2026-05-22 21:40:46] [INFO ] Computed 266 invariants in 25 ms
Computed 266 P flows in 25 ms.
Exported basis to /tmp/petrispot-output-6050025335435561528.kers
Total runtime 27 ms.
[2026-05-22 21:40:46] [INFO ] State equation strengthened by 51 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 450/617 variables, 43/44 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/617 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 84/701 variables, 32/77 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/701 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 721/1422 variables, 170/247 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1422 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 34/1456 variables, 19/266 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1456 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 2439/3895 variables, 1456/1722 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3895 variables, 51/1773 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3895 variables, 0/1773 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/3895 variables, 0/1773 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3895/3895 variables, and 1773 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5901 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 191/191 constraints, State Equation: 1456/1456 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 6/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 450/617 variables, 43/44 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/617 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 84/701 variables, 32/77 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/701 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 721/1422 variables, 170/247 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1422 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1422 variables, 3/251 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1422 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 34/1456 variables, 19/270 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1456 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1456 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 2439/3895 variables, 1456/1728 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3895 variables, 51/1779 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3895 variables, 3/1782 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3895/3895 variables, and 1782 constraints, problems are : Problem set: 0 solved, 6 unsolved in 90044 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 191/191 constraints, State Equation: 1456/1456 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 6/3 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 96017ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 167 out of 1456 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1456/1456 places, 2439/2439 transitions.
Applied a total of 0 rules in 100 ms. Remains 1456 /1456 variables (removed 0) and now considering 2439/2439 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 1456/1456 places, 2439/2439 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1456/1456 places, 2439/2439 transitions.
Applied a total of 0 rules in 93 ms. Remains 1456 /1456 variables (removed 0) and now considering 2439/2439 (removed 0) transitions.
[2026-05-22 21:42:22] [INFO ] Invariant cache hit.
[2026-05-22 21:42:23] [INFO ] Implicit Places using invariants in 1418 ms returned [1, 19, 20, 22, 32, 50, 148, 163, 164, 165, 166, 167, 185, 203, 291, 304, 305, 307, 308, 326, 344, 406, 426, 439, 440, 441, 442, 443, 461, 479, 517, 567, 580, 581, 603, 621, 686, 709, 728, 749, 767, 852, 867, 868, 870, 871, 907, 947, 991, 1004, 1005, 1006, 1007, 1027, 1045, 1108, 1128, 1141, 1142, 1143, 1144, 1145, 1163, 1181, 1250, 1265, 1270, 1281, 1282, 1283, 1284, 1285, 1320, 1325, 1343, 1345, 1346, 1358, 1364, 1370, 1376, 1382, 1388, 1394, 1401, 1407, 1413, 1419]
[2026-05-22 21:42:23] [INFO ] Actually due to overlaps returned [1320, 1285, 32, 50, 167, 185, 308, 326, 443, 461, 603, 749, 871, 1027, 1145, 1163, 1325, 166, 307, 442, 870, 1007, 1144, 1284, 165, 441, 728, 1006, 1143, 1283, 1343, 1, 164, 291, 305, 426, 440, 567, 581, 709, 852, 868, 991, 1005, 1128, 1142, 1265, 1282, 19, 20, 163, 203, 304, 344, 439, 479, 580, 621, 767, 867, 907, 1004, 1045, 1141, 1181, 1281, 1346, 1388, 1407, 1419, 22, 148, 517, 1270, 1345, 1358, 1364, 1370, 1376, 1382, 1394, 1401, 1413]
Discarding 83 places :
Implicit Place search using SMT only with invariants took 1433 ms to find 83 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1373/1456 places, 2439/2439 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 1368 transition count 2359
Reduce places removed 80 places and 0 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Iterating post reduction 1 with 107 rules applied. Total rules applied 192 place count 1288 transition count 2332
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 219 place count 1261 transition count 2332
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 219 place count 1261 transition count 2284
Deduced a syphon composed of 48 places in 4 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 315 place count 1213 transition count 2284
Discarding 14 places :
Implicit places reduction removed 14 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 3 with 24 rules applied. Total rules applied 339 place count 1199 transition count 2274
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 349 place count 1189 transition count 2274
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 363 place count 1175 transition count 2260
Iterating global reduction 5 with 14 rules applied. Total rules applied 377 place count 1175 transition count 2260
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 378 place count 1175 transition count 2259
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 386 place count 1167 transition count 2251
Iterating global reduction 6 with 8 rules applied. Total rules applied 394 place count 1167 transition count 2251
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 396 place count 1167 transition count 2249
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 4 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 7 with 132 rules applied. Total rules applied 528 place count 1101 transition count 2183
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 532 place count 1097 transition count 2179
Iterating global reduction 7 with 4 rules applied. Total rules applied 536 place count 1097 transition count 2179
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 539 place count 1097 transition count 2176
Free-agglomeration rule applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 543 place count 1097 transition count 2172
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 550 place count 1093 transition count 2169
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 9 with 22 rules applied. Total rules applied 572 place count 1093 transition count 2147
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 9 with 22 rules applied. Total rules applied 594 place count 1071 transition count 2147
Partial Free-agglomeration rule applied 21 times.
Drop transitions (Partial Free agglomeration) removed 21 transitions
Iterating global reduction 10 with 21 rules applied. Total rules applied 615 place count 1071 transition count 2147
Applied a total of 615 rules in 595 ms. Remains 1071 /1373 variables (removed 302) and now considering 2147/2439 (removed 292) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9686230372303373178.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17609613230061938711.kers'
[2026-05-22 21:42:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9686230372303373178.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17609613230061938711.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 2147 rows 1070 cols 8754 entries
Finished phase 1 with 446 SingleSign rule and 461 generalized
[2026-05-22 21:42:24] [INFO ] Computed 164 invariants in 16 ms
Computed 164 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-17609613230061938711.kers
Total runtime 18 ms.
[2026-05-22 21:42:25] [INFO ] Implicit Places using invariants in 818 ms returned [75, 94, 100, 103, 105, 114, 166, 212, 219, 273, 290, 304, 307, 314, 367, 413, 418, 419, 535, 542, 543, 644, 649, 657, 662, 663, 717, 742, 750, 756, 757, 764, 819, 840, 851, 853, 854, 858, 863, 865, 918, 936, 942, 945, 950, 1040]
[2026-05-22 21:42:25] [INFO ] Actually due to overlaps returned [657, 757, 950, 413, 858, 212, 307, 418, 419, 94, 100, 105, 840, 853, 936, 942, 1040, 75, 166, 273, 290, 304, 367, 535, 644, 649, 717, 742, 750, 756, 819, 854, 918, 945]
Discarding 34 places :
Implicit Place search using SMT only with invariants took 823 ms to find 34 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1037/1456 places, 2147/2439 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1021 transition count 2131
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1021 transition count 2131
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 1016 transition count 2126
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 1016 transition count 2126
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 1014 transition count 2124
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 1014 transition count 2124
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 62 place count 1006 transition count 2116
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 1004 transition count 2112
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 1004 transition count 2112
Free-agglomeration rule applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 75 place count 1004 transition count 2103
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 84 place count 995 transition count 2103
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 88 place count 995 transition count 2099
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 92 place count 991 transition count 2099
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 991 transition count 2099
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 94 place count 990 transition count 2098
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 990 transition count 2098
Applied a total of 95 rules in 295 ms. Remains 990 /1037 variables (removed 47) and now considering 2098/2147 (removed 49) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-44330040325191910.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8655728334839806131.kers'
[2026-05-22 21:42:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-44330040325191910.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8655728334839806131.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 2098 rows 989 cols 8432 entries
Finished phase 1 with 443 SingleSign rule and 417 generalized
[2026-05-22 21:42:25] [INFO ] Computed 130 invariants in 23 ms
Computed 130 P flows in 27 ms.
Exported basis to /tmp/petrispot-output-8655728334839806131.kers
Total runtime 29 ms.
[2026-05-22 21:42:26] [INFO ] Implicit Places using invariants in 846 ms returned [104, 205, 292, 512, 513, 626, 627, 711, 796, 798]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 863 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 980/1456 places, 2098/2439 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 979 transition count 2097
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 979 transition count 2097
Applied a total of 2 rules in 61 ms. Remains 979 /980 variables (removed 1) and now considering 2097/2098 (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-6178185186661256317.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16577656933462536612.kers'
[2026-05-22 21:42:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6178185186661256317.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16577656933462536612.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 6 ms.
// Phase 1: matrix 2097 rows 978 cols 8316 entries
Finished phase 1 with 426 SingleSign rule and 433 generalized
[2026-05-22 21:42:26] [INFO ] Computed 120 invariants in 40 ms
Computed 120 P flows in 40 ms.
Exported basis to /tmp/petrispot-output-16577656933462536612.kers
Total runtime 42 ms.
[2026-05-22 21:42:27] [INFO ] Implicit Places using invariants in 720 ms returned []
[2026-05-22 21:42:27] [INFO ] Invariant cache hit.
[2026-05-22 21:42:27] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-22 21:42:29] [INFO ] Implicit Places using invariants and state equation in 2832 ms returned []
Implicit Place search using SMT with State Equation took 3567 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 979/1456 places, 2097/2439 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 7734 ms. Remains : 979/1456 places, 2097/2439 transitions.
RANDOM walk for 40000 steps (464 resets) in 316 ms. (126 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (57 resets) in 106 ms. (373 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (55 resets) in 181 ms. (219 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (56 resets) in 71 ms. (555 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (55 resets) in 126 ms. (314 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (38 resets) in 222 ms. (179 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (54 resets) in 99 ms. (400 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 182810 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 6
Probabilistic random walk after 182810 steps, saw 41481 distinct states, run finished after 3002 ms. (steps per millisecond=60 ) properties seen :0
[2026-05-22 21:42:33] [INFO ] Invariant cache hit.
[2026-05-22 21:42:33] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 424/591 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/591 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/591 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 3/594 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/594 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 377/971 variables, 76/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/971 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 8/979 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/979 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 2097/3076 variables, 979/1099 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3076 variables, 6/1105 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3076 variables, 0/1105 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/3076 variables, 0/1105 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3076/3076 variables, and 1105 constraints, problems are : Problem set: 0 solved, 6 unsolved in 6790 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 80/80 constraints, State Equation: 979/979 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 424/591 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/591 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/591 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 3/594 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/594 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 377/971 variables, 76/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/971 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/971 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/971 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 8/979 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/979 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 2097/3076 variables, 979/1102 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3076 variables, 6/1108 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3076 variables, 3/1111 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3076 variables, 3/1114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3076/3076 variables, and 1114 constraints, problems are : Problem set: 0 solved, 6 unsolved in 105026 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 80/80 constraints, State Equation: 979/979 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/3 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 111839ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 167 out of 979 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 2097/2097 transitions.
Applied a total of 0 rules in 51 ms. Remains 979 /979 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 979/979 places, 2097/2097 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 2097/2097 transitions.
Applied a total of 0 rules in 32 ms. Remains 979 /979 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
[2026-05-22 21:44:25] [INFO ] Invariant cache hit.
[2026-05-22 21:44:26] [INFO ] Implicit Places using invariants in 839 ms returned []
[2026-05-22 21:44:26] [INFO ] Invariant cache hit.
[2026-05-22 21:44:27] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-22 21:44:30] [INFO ] Implicit Places using invariants and state equation in 4008 ms returned []
Implicit Place search using SMT with State Equation took 4867 ms to find 0 implicit places.
[2026-05-22 21:44:30] [INFO ] Redundant transitions in 196 ms returned []
Running 2096 sub problems to find dead transitions.
[2026-05-22 21:44:30] [INFO ] Invariant cache hit.
[2026-05-22 21:44:30] [INFO ] State equation strengthened by 6 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/978 variables, 68/68 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 978/3076 variables, and 68 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 0/40 constraints, Generalized P Invariants (flows): 68/80 constraints, State Equation: 0/979 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 2096/2096 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/978 variables, 68/68 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 978/3076 variables, and 68 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 0/40 constraints, Generalized P Invariants (flows): 68/80 constraints, State Equation: 0/979 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 0/2096 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61255ms problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 61266ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66471 ms. Remains : 979/979 places, 2097/2097 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 979 transition count 2096
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 978 transition count 2096
Applied a total of 2 rules in 40 ms. Remains 978 /979 variables (removed 1) and now considering 2096/2097 (removed 1) transitions.
Running SMT prover for 6 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1628560856737640356.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7875858645949321157.kers'
[2026-05-22 21:45:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1628560856737640356.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7875858645949321157.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 3 ms.
// Phase 1: matrix 2096 rows 977 cols 8314 entries
Finished phase 1 with 425 SingleSign rule and 433 generalized
[2026-05-22 21:45:31] [INFO ] Computed 120 invariants in 33 ms
Computed 120 P flows in 34 ms.
Exported basis to /tmp/petrispot-output-7875858645949321157.kers
Total runtime 35 ms.
[2026-05-22 21:45:32] [INFO ] After 298ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2026-05-22 21:45:32] [INFO ] [Nat]Absence check using 40 positive place invariants in 75 ms returned sat
[2026-05-22 21:45:32] [INFO ] [Nat]Absence check using 40 positive and 80 generalized place invariants in 24 ms returned sat
[2026-05-22 21:45:49] [INFO ] After 17137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2026-05-22 21:46:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 728 ms
TRAPS : Iteration 1
[2026-05-22 21:46:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 435 ms
[2026-05-22 21:46:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
TRAPS : Iteration 2
[2026-05-22 21:46:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 798 ms
TRAPS : Iteration 3
[2026-05-22 21:47:05] [INFO ] After 92421ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2026-05-22 21:47:27] [INFO ] After 115396ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 115828 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-22 21:47:27] [INFO ] Flatten gal took : 111 ms
[2026-05-22 21:47:27] [INFO ] Applying decomposition
[2026-05-22 21:47:27] [INFO ] Flatten gal took : 75 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/graph8349072210017909055.txt' '-o' '/tmp/graph8349072210017909055.bin' '-w' '/tmp/graph8349072210017909055.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8349072210017909055.bin' '-l' '-1' '-v' '-w' '/tmp/graph8349072210017909055.weights' '-q' '0' '-e' '0.001'
[2026-05-22 21:47:28] [INFO ] Decomposing Gal with order
[2026-05-22 21:47:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:47:28] [INFO ] Removed a total of 3885 redundant transitions.
[2026-05-22 21:47:28] [INFO ] Flatten gal took : 272 ms
[2026-05-22 21:47:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 59 ms.
[2026-05-22 21:47:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6199198830312198089.gal : 30 ms
[2026-05-22 21:47:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4839435006717034295.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6199198830312198089.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4839435006717034295.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/ReachabilityCardinality4839435006717034295.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :1 after 10
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :10 after 2.57264e+06
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :2.57264e+06 after 1.68345e+27
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :1.68345e+27 after 8.71003e+27
Detected timeout of ITS tools.
[2026-05-22 22:17:29] [INFO ] Flatten gal took : 73 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14578375287892808176
[2026-05-22 22:17:29] [INFO ] Too many transitions (2097) to apply POR reductions. Disabling POR matrices.
[2026-05-22 22:17:29] [INFO ] Applying decomposition
[2026-05-22 22:17:29] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14578375287892808176
Running compilation step : cd /tmp/ltsmin14578375287892808176;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '120' '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 22:17:29] [INFO ] Flatten gal took : 57 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/graph8430748657946885395.txt' '-o' '/tmp/graph8430748657946885395.bin' '-w' '/tmp/graph8430748657946885395.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8430748657946885395.bin' '-l' '-1' '-v' '-w' '/tmp/graph8430748657946885395.weights' '-q' '0' '-e' '0.001'
[2026-05-22 22:17:29] [INFO ] Decomposing Gal with order
[2026-05-22 22:17:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 22:17:29] [INFO ] Removed a total of 3901 redundant transitions.
[2026-05-22 22:17:29] [INFO ] Flatten gal took : 112 ms
[2026-05-22 22:17:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 111 labels/synchronizations in 55 ms.
[2026-05-22 22:17:29] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability15041940634647056548.gal : 21 ms
[2026-05-22 22:17:29] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability3645225468767563638.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/ReachabilityFireability15041940634647056548.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability3645225468767563638.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/ReachabilityFireability3645225468767563638.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :1 after 3
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :3 after 6753
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :6753 after 1.03017e+08
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :1.03017e+08 after 1.14774e+13
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :1.14774e+13 after 5.25698e+14
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :5.25698e+14 after 3.46842e+15
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :3.46842e+15 after 6.98235e+15
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :6.98235e+15 after 2.54828e+16
Compilation finished in 5235 ms.
Running link step : cd /tmp/ltsmin14578375287892808176;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin14578375287892808176;'/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' 'ASLinkPT09aReachabilityFireability202400==true'
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :2.54828e+16 after 3.15295e+17
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin14578375287892808176;'/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' 'ASLinkPT09aReachabilityFireability202400==true'
Running LTSmin : cd /tmp/ltsmin14578375287892808176;'/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' 'ASLinkPT09aReachabilityFireability202401==true'
Invariant property ASLink-PT-09a-ReachabilityFireability-2024-12 does not hold.
FORMULA ASLink-PT-09a-ReachabilityFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin14578375287892808176;'/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' 'ASLinkPT09aReachabilityFireability202401==true'
Running LTSmin : cd /tmp/ltsmin14578375287892808176;'/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' 'ASLinkPT09aReachabilityFireability202410==true'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin14578375287892808176;'/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' 'ASLinkPT09aReachabilityFireability202410==true'
Running LTSmin : cd /tmp/ltsmin14578375287892808176;'/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' 'ASLinkPT09aReachabilityFireability202413==true'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin14578375287892808176;'/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' 'ASLinkPT09aReachabilityFireability202413==true'
Running LTSmin : cd /tmp/ltsmin14578375287892808176;'/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' 'ASLinkPT09aReachabilityFireability202415==true'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin14578375287892808176;'/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' 'ASLinkPT09aReachabilityFireability202415==true'
Retrying LTSmin with larger timeout 4800 s
Running LTSmin : cd /tmp/ltsmin14578375287892808176;'/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' 'ASLinkPT09aReachabilityFireability202400==true'
Invariant property ASLink-PT-09a-ReachabilityFireability-2024-01 does not hold.
FORMULA ASLink-PT-09a-ReachabilityFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ASLink-PT-09a-ReachabilityFireability-2024-00 does not hold.
FORMULA ASLink-PT-09a-ReachabilityFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :3.15295e+17 after 3.20068e+18

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-09a"
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-09a, 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-177944366300415"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-09a.tgz
mv ASLink-PT-09a 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 ;