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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 988K
-rw-r--r-- 1 mcc users 6.0K Mar 5 14:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Mar 5 14:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 5 14:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 5 14:23 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:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Mar 5 14:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Mar 5 14:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Mar 5 14:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 5 14:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:09 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 597K 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-06a-ReachabilityCardinality-2024-00
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-2024-01
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-2024-02
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-2024-03
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-2024-04
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-2024-05
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-2024-06
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-2024-07
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-2024-08
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-2024-09
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-2024-10
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-2024-11
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-2024-12
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-2024-13
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-2024-14
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779478481778

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-06a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-22 19:34:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 19:34:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 19:34:43] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2026-05-22 19:34:43] [INFO ] Transformed 1406 places.
[2026-05-22 19:34:43] [INFO ] Transformed 2100 transitions.
[2026-05-22 19:34:43] [INFO ] Found NUPN structural information;
[2026-05-22 19:34:43] [INFO ] Parsed PT model containing 1406 places and 2100 transitions and 7896 arcs in 287 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 22 transitions
Reduce redundant transitions removed 22 transitions.
FORMULA ASLink-PT-06a-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (225 resets) in 1488 ms. (26 steps per ms) remains 5/14 properties
FORMULA ASLink-PT-06a-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (30 resets) in 317 ms. (125 steps per ms) remains 5/5 properties
[2026-05-22 19:34:43] [INFO ] Flatten gal took : 267 ms
BEST_FIRST walk for 40004 steps (28 resets) in 248 ms. (160 steps per ms) remains 4/5 properties
FORMULA ASLink-PT-06a-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (30 resets) in 255 ms. (156 steps per ms) remains 4/4 properties
[2026-05-22 19:34:44] [INFO ] Flatten gal took : 140 ms
BEST_FIRST walk for 40003 steps (26 resets) in 438 ms. (91 steps per ms) remains 4/4 properties
[2026-05-22 19:34:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9926033755871956638.gal : 90 ms
BEST_FIRST walk for 40004 steps (29 resets) in 208 ms. (191 steps per ms) remains 4/4 properties
[2026-05-22 19:34:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8619949225577317359.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/ReachabilityCardinality9926033755871956638.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8619949225577317359.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17516292547027267976.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6537385146636828907.kers'
[2026-05-22 19:34:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17516292547027267976.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6537385146636828907.kers]
Culling duplicate invariants (modulo rational): removing 24 columns.
Culled 24 columns in 1 ms.
// Phase 1: matrix 2078 rows 1382 cols 7804 entries
Finished phase 1 with 529 SingleSign rule and 607 generalized
[2026-05-22 19:34:44] [INFO ] Computed 270 invariants in 16 ms
Computed 270 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-6537385146636828907.kers
Total runtime 19 ms.
Excessive predecessor constraint size, skipping predecessor.
Loading property file /tmp/ReachabilityCardinality8619949225577317359.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 317/376 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 317/396 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 261/637 variables, 42/438 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/637 variables, 261/699 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/637 variables, 1/700 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/637 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 744/1381 variables, 190/890 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1381 variables, 744/1634 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1381 variables, 0/1634 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 25/1406 variables, 17/1651 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1406 variables, 25/1676 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :6 after 14
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :14 after 20
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :20 after 38
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :38 after 64
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :64 after 267
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :267 after 5399
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :5399 after 40350
At refinement iteration 14 (INCLUDED_ONLY) 0/1406 variables, 0/1676 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :40350 after 4.47131e+11
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :4.47131e+11 after 6.89325e+17
At refinement iteration 15 (OVERLAPS) 2078/3484 variables, 1406/3082 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :6.89325e+17 after 1.308e+18
At refinement iteration 16 (INCLUDED_ONLY) 0/3484 variables, 0/3082 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/3484 variables, 0/3082 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3484/3484 variables, and 3082 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3101 ms.
Refiners :[Domain max(s): 1406/1406 constraints, Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 208/208 constraints, State Equation: 1406/1406 constraints, PredecessorRefiner: 4/3 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/59 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 317/376 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 317/396 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 261/637 variables, 42/438 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/637 variables, 261/699 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/637 variables, 1/700 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/637 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 744/1381 variables, 190/890 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1381 variables, 744/1634 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :1.308e+18 after 1.308e+18
At refinement iteration 11 (INCLUDED_ONLY) 0/1381 variables, 2/1636 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1381 variables, 1/1637 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1381 variables, 1/1638 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1381 variables, 0/1638 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 25/1406 variables, 17/1655 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1406 variables, 25/1680 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1406 variables, 0/1680 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SMT process timed out in 8271ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 59 out of 1406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1406/1406 places, 2078/2078 transitions.
Ensure Unique test removed 24 places
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 136 rules applied. Total rules applied 136 place count 1371 transition count 1977
Reduce places removed 101 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 105 rules applied. Total rules applied 241 place count 1270 transition count 1973
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 245 place count 1266 transition count 1973
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 114 Pre rules applied. Total rules applied 245 place count 1266 transition count 1859
Deduced a syphon composed of 114 places in 4 ms
Ensure Unique test removed 36 places
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 3 with 264 rules applied. Total rules applied 509 place count 1116 transition count 1859
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 1 rules applied. Total rules applied 510 place count 1116 transition count 1858
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 511 place count 1115 transition count 1858
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 519 place count 1107 transition count 1817
Ensure Unique test removed 1 places
Iterating global reduction 5 with 9 rules applied. Total rules applied 528 place count 1106 transition count 1817
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 534 place count 1105 transition count 1812
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 537 place count 1102 transition count 1812
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 538 place count 1101 transition count 1804
Iterating global reduction 7 with 1 rules applied. Total rules applied 539 place count 1101 transition count 1804
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 540 place count 1100 transition count 1796
Iterating global reduction 7 with 1 rules applied. Total rules applied 541 place count 1100 transition count 1796
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 542 place count 1099 transition count 1788
Iterating global reduction 7 with 1 rules applied. Total rules applied 543 place count 1099 transition count 1788
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 544 place count 1098 transition count 1780
Iterating global reduction 7 with 1 rules applied. Total rules applied 545 place count 1098 transition count 1780
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 546 place count 1097 transition count 1772
Iterating global reduction 7 with 1 rules applied. Total rules applied 547 place count 1097 transition count 1772
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 548 place count 1096 transition count 1764
Iterating global reduction 7 with 1 rules applied. Total rules applied 549 place count 1096 transition count 1764
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 550 place count 1095 transition count 1756
Iterating global reduction 7 with 1 rules applied. Total rules applied 551 place count 1095 transition count 1756
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 552 place count 1094 transition count 1748
Iterating global reduction 7 with 1 rules applied. Total rules applied 553 place count 1094 transition count 1748
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 554 place count 1093 transition count 1740
Iterating global reduction 7 with 1 rules applied. Total rules applied 555 place count 1093 transition count 1740
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 556 place count 1092 transition count 1732
Iterating global reduction 7 with 1 rules applied. Total rules applied 557 place count 1092 transition count 1732
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 558 place count 1091 transition count 1724
Iterating global reduction 7 with 1 rules applied. Total rules applied 559 place count 1091 transition count 1724
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 2 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 7 with 78 rules applied. Total rules applied 637 place count 1052 transition count 1685
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 638 place count 1052 transition count 1684
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 639 place count 1051 transition count 1684
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 645 place count 1051 transition count 1678
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 651 place count 1045 transition count 1678
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 657 place count 1045 transition count 1678
Applied a total of 657 rules in 1144 ms. Remains 1045 /1406 variables (removed 361) and now considering 1678/2078 (removed 400) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1154 ms. Remains : 1045/1406 places, 1678/2078 transitions.
RANDOM walk for 40000 steps (360 resets) in 398 ms. (100 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (54 resets) in 173 ms. (229 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (56 resets) in 230 ms. (173 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (55 resets) in 282 ms. (141 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (53 resets) in 157 ms. (253 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 179855 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 4
Probabilistic random walk after 179855 steps, saw 58394 distinct states, run finished after 3010 ms. (steps per millisecond=59 ) 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-10981592229883306174.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13684561842393835400.kers'
[2026-05-22 19:34:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10981592229883306174.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13684561842393835400.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 1 ms.
// Phase 1: matrix 1678 rows 1037 cols 6613 entries
Finished phase 1 with 238 SingleSign rule and 610 generalized
[2026-05-22 19:34:57] [INFO ] Computed 197 invariants in 15 ms
Computed 197 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-13684561842393835400.kers
Total runtime 19 ms.
[2026-05-22 19:34:57] [INFO ] State equation strengthened by 34 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 187/246 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 205/451 variables, 32/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/451 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 568/1019 variables, 127/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1019 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 26/1045 variables, 20/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1045 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1678/2723 variables, 1045/1242 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2723 variables, 34/1276 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2723 variables, 0/1276 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/2723 variables, 0/1276 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2723/2723 variables, and 1276 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2103 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 147/147 constraints, State Equation: 1045/1045 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 4/3 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/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 187/246 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 205/451 variables, 32/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/451 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 568/1019 variables, 127/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1019 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1019 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 26/1045 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1045 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1678/2723 variables, 1045/1245 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2723 variables, 34/1279 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2723 variables, 3/1282 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2723 variables, 1/1283 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2723 variables, 0/1283 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/2723 variables, 0/1283 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2723/2723 variables, and 1283 constraints, problems are : Problem set: 0 solved, 4 unsolved in 27472 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 147/147 constraints, State Equation: 1045/1045 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29629ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 7293 ms.
Support contains 59 out of 1045 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1045/1045 places, 1678/1678 transitions.
Applied a total of 0 rules in 49 ms. Remains 1045 /1045 variables (removed 0) and now considering 1678/1678 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 1045/1045 places, 1678/1678 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1045/1045 places, 1678/1678 transitions.
Applied a total of 0 rules in 50 ms. Remains 1045 /1045 variables (removed 0) and now considering 1678/1678 (removed 0) transitions.
[2026-05-22 19:35:34] [INFO ] Invariant cache hit.
[2026-05-22 19:35:35] [INFO ] Implicit Places using invariants in 1036 ms returned [1, 19, 20, 22, 51, 69, 107, 151, 165, 166, 167, 168, 169, 187, 205, 241, 285, 297, 311, 313, 314, 315, 333, 351, 403, 426, 438, 451, 452, 453, 454, 455, 473, 491, 530, 545, 567, 580, 594, 596, 597, 598, 616, 634, 684, 700, 723, 736, 737, 738, 739, 740, 758, 776, 817, 845, 866, 871, 882, 883, 884, 885, 886, 909, 911, 914, 932, 933, 934, 935, 947, 953, 959, 965, 971, 977, 983, 989, 995, 1001, 1007]
[2026-05-22 19:35:35] [INFO ] Actually due to overlaps returned [909, 886, 51, 187, 315, 333, 455, 473, 598, 616, 740, 758, 914, 169, 168, 314, 454, 597, 739, 885, 933, 167, 313, 453, 596, 738, 884, 911, 932, 1, 166, 297, 438, 452, 580, 723, 737, 866, 883, 19, 20, 69, 165, 205, 311, 351, 451, 491, 594, 634, 736, 776, 882, 935, 977, 995, 1007, 22, 151, 871, 934, 947, 953, 959, 965, 971, 983, 989, 1001]
Discarding 69 places :
Implicit Place search using SMT only with invariants took 1052 ms to find 69 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 976/1045 places, 1678/1678 transitions.
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 968 transition count 1592
Reduce places removed 86 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 94 rules applied. Total rules applied 188 place count 882 transition count 1584
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 196 place count 874 transition count 1584
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 196 place count 874 transition count 1545
Deduced a syphon composed of 39 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 79 rules applied. Total rules applied 275 place count 834 transition count 1545
Discarding 13 places :
Implicit places reduction removed 13 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 21 rules applied. Total rules applied 296 place count 821 transition count 1537
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 9 rules applied. Total rules applied 305 place count 813 transition count 1536
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 306 place count 812 transition count 1536
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 306 place count 812 transition count 1535
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 308 place count 811 transition count 1535
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 321 place count 798 transition count 1522
Iterating global reduction 6 with 13 rules applied. Total rules applied 334 place count 798 transition count 1522
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 339 place count 793 transition count 1517
Iterating global reduction 6 with 5 rules applied. Total rules applied 344 place count 793 transition count 1517
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 346 place count 793 transition count 1515
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 347 place count 792 transition count 1514
Iterating global reduction 7 with 1 rules applied. Total rules applied 348 place count 792 transition count 1514
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 349 place count 791 transition count 1513
Iterating global reduction 7 with 1 rules applied. Total rules applied 350 place count 791 transition count 1513
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 3 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 7 with 112 rules applied. Total rules applied 462 place count 735 transition count 1457
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 466 place count 731 transition count 1453
Iterating global reduction 7 with 4 rules applied. Total rules applied 470 place count 731 transition count 1453
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 472 place count 731 transition count 1451
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 473 place count 731 transition count 1450
Free-agglomeration rule applied 5 times.
Iterating global reduction 8 with 5 rules applied. Total rules applied 478 place count 731 transition count 1445
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 484 place count 726 transition count 1444
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 485 place count 726 transition count 1443
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 9 with 24 rules applied. Total rules applied 509 place count 726 transition count 1419
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 9 with 24 rules applied. Total rules applied 533 place count 702 transition count 1419
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 535 place count 702 transition count 1417
Partial Free-agglomeration rule applied 19 times.
Drop transitions (Partial Free agglomeration) removed 19 transitions
Iterating global reduction 10 with 19 rules applied. Total rules applied 554 place count 702 transition count 1417
Applied a total of 554 rules in 531 ms. Remains 702 /976 variables (removed 274) and now considering 1417/1678 (removed 261) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6447959952420442553.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9258245144566266511.kers'
[2026-05-22 19:35:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6447959952420442553.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9258245144566266511.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1417 rows 702 cols 5798 entries
Finished phase 1 with 286 SingleSign rule and 310 generalized
[2026-05-22 19:35:35] [INFO ] Computed 106 invariants in 9 ms
Computed 106 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-9258245144566266511.kers
Total runtime 13 ms.
[2026-05-22 19:35:36] [INFO ] Implicit Places using invariants in 487 ms returned [102, 108, 111, 113, 114, 123, 124, 187, 200, 208, 211, 219, 231, 232, 286, 312, 315, 320, 409, 412, 424, 431, 432, 486, 515, 521, 525, 530, 531, 583, 598, 606, 617, 621, 623, 701]
[2026-05-22 19:35:36] [INFO ] Actually due to overlaps returned [525, 623, 320, 123, 124, 102, 108, 113, 200, 208, 219, 312, 409, 515, 621, 114, 187, 286, 315, 412, 424, 486, 521, 583, 598, 606, 701]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 491 ms to find 27 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 675/1045 places, 1417/1678 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 675 transition count 1416
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 674 transition count 1416
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 9 place count 667 transition count 1409
Iterating global reduction 2 with 7 rules applied. Total rules applied 16 place count 667 transition count 1409
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 666 transition count 1408
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 666 transition count 1408
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 34 place count 658 transition count 1400
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 657 transition count 1398
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 657 transition count 1398
Free-agglomeration rule applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 46 place count 657 transition count 1388
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 56 place count 647 transition count 1388
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 647 transition count 1386
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 60 place count 645 transition count 1386
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 61 place count 645 transition count 1386
Applied a total of 61 rules in 164 ms. Remains 645 /675 variables (removed 30) and now considering 1386/1417 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2792111546550137243.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10975364906597671912.kers'
[2026-05-22 19:35:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2792111546550137243.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10975364906597671912.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1386 rows 645 cols 5593 entries
Finished phase 1 with 296 SingleSign rule and 270 generalized
[2026-05-22 19:35:36] [INFO ] Computed 79 invariants in 9 ms
Computed 79 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-10975364906597671912.kers
Total runtime 10 ms.
[2026-05-22 19:35:36] [INFO ] Implicit Places using invariants in 415 ms returned [185, 204, 205, 390, 391, 483, 484]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 417 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 638/1045 places, 1386/1678 transitions.
Applied a total of 0 rules in 20 ms. Remains 638 /638 variables (removed 0) and now considering 1386/1386 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 2728 ms. Remains : 638/1045 places, 1386/1678 transitions.
RANDOM walk for 40000 steps (554 resets) in 307 ms. (129 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (92 resets) in 148 ms. (268 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (89 resets) in 172 ms. (231 steps per ms) remains 3/4 properties
FORMULA ASLink-PT-06a-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (93 resets) in 124 ms. (320 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (87 resets) in 83 ms. (476 steps per ms) remains 3/3 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2502993930626238113.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2359185787483026606.kers'
[2026-05-22 19:35:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2502993930626238113.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2359185787483026606.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1386 rows 638 cols 5511 entries
Finished phase 1 with 273 SingleSign rule and 293 generalized
[2026-05-22 19:35:37] [INFO ] Computed 72 invariants in 8 ms
Computed 72 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-2359185787483026606.kers
Total runtime 9 ms.
[2026-05-22 19:35:37] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 349/389 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/389 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 16/405 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 233/638 variables, 48/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/638 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1386/2024 variables, 638/710 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2024 variables, 10/720 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2024 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/2024 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2024/2024 variables, and 720 constraints, problems are : Problem set: 0 solved, 3 unsolved in 854 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 638/638 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 3/2 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/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 349/389 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/389 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 16/405 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 233/638 variables, 48/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/638 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1386/2024 variables, 638/710 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2024 variables, 10/720 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2024 variables, 2/722 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2024 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/2024 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2024/2024 variables, and 722 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3128 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 638/638 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4031ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
FORMULA ASLink-PT-06a-ReachabilityCardinality-2024-00 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 718 ms.
Support contains 28 out of 638 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 638/638 places, 1386/1386 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 638 transition count 1370
Reduce places removed 16 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 18 rules applied. Total rules applied 34 place count 622 transition count 1368
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 36 place count 620 transition count 1368
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 36 place count 620 transition count 1356
Deduced a syphon composed of 12 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 61 place count 607 transition count 1356
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 62 place count 606 transition count 1356
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 66 place count 602 transition count 1348
Iterating global reduction 4 with 4 rules applied. Total rules applied 70 place count 602 transition count 1348
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 70 place count 602 transition count 1347
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 72 place count 601 transition count 1347
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 78 place count 598 transition count 1344
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 79 place count 598 transition count 1343
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 80 place count 598 transition count 1342
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 81 place count 597 transition count 1342
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 82 place count 597 transition count 1341
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 83 place count 597 transition count 1340
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 84 place count 596 transition count 1340
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 86 place count 596 transition count 1340
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 87 place count 595 transition count 1339
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 89 place count 593 transition count 1339
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 89 place count 593 transition count 1336
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 95 place count 590 transition count 1336
Applied a total of 95 rules in 254 ms. Remains 590 /638 variables (removed 48) and now considering 1336/1386 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 254 ms. Remains : 590/638 places, 1336/1386 transitions.
RANDOM walk for 40000 steps (625 resets) in 381 ms. (104 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (117 resets) in 146 ms. (272 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (119 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 401720 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :0 out of 2
Probabilistic random walk after 401720 steps, saw 128992 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) 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-2609337414609214436.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2679152661874189026.kers'
[2026-05-22 19:35:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2609337414609214436.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2679152661874189026.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1336 rows 590 cols 5374 entries
Finished phase 1 with 231 SingleSign rule and 291 generalized
[2026-05-22 19:35:45] [INFO ] Computed 68 invariants in 8 ms
Computed 68 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-2679152661874189026.kers
Total runtime 11 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 318/346 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 79/425 variables, 10/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 165/590 variables, 39/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/590 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1336/1926 variables, 590/658 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1926 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1926 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1926/1926 variables, and 658 constraints, problems are : Problem set: 0 solved, 2 unsolved in 656 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 590/590 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 318/346 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 79/425 variables, 10/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 165/590 variables, 39/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/590 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/590 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1336/1926 variables, 590/659 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1926 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1926 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1926 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1926/1926 variables, and 660 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1957 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 590/590 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2644ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 672 ms.
Support contains 28 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 1336/1336 transitions.
Applied a total of 0 rules in 19 ms. Remains 590 /590 variables (removed 0) and now considering 1336/1336 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 590/590 places, 1336/1336 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 1336/1336 transitions.
Applied a total of 0 rules in 19 ms. Remains 590 /590 variables (removed 0) and now considering 1336/1336 (removed 0) transitions.
[2026-05-22 19:35:48] [INFO ] Invariant cache hit.
[2026-05-22 19:35:49] [INFO ] Implicit Places using invariants in 338 ms returned [21, 167, 178, 181, 351, 423, 429, 514]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 342 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 582/590 places, 1336/1336 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 582 transition count 1332
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 578 transition count 1332
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 577 transition count 1331
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 577 transition count 1331
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 573 transition count 1327
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 573 transition count 1325
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 22 place count 571 transition count 1325
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 571 transition count 1323
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 26 place count 569 transition count 1323
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 27 place count 569 transition count 1322
Applied a total of 27 rules in 109 ms. Remains 569 /582 variables (removed 13) and now considering 1322/1336 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13625319447459061244.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7999904389801935424.kers'
[2026-05-22 19:35:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13625319447459061244.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7999904389801935424.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1322 rows 569 cols 5303 entries
Finished phase 1 with 233 SingleSign rule and 276 generalized
[2026-05-22 19:35:49] [INFO ] Computed 60 invariants in 8 ms
Computed 60 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-7999904389801935424.kers
Total runtime 10 ms.
[2026-05-22 19:35:49] [INFO ] Implicit Places using invariants in 352 ms returned []
[2026-05-22 19:35:49] [INFO ] Invariant cache hit.
[2026-05-22 19:35:50] [INFO ] Implicit Places using invariants and state equation in 1241 ms returned []
Implicit Place search using SMT with State Equation took 1595 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 569/590 places, 1322/1336 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2066 ms. Remains : 569/590 places, 1322/1336 transitions.
RANDOM walk for 40000 steps (638 resets) in 229 ms. (173 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (111 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (122 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 459288 steps, run timeout after 3001 ms. (steps per millisecond=153 ) properties seen :0 out of 2
Probabilistic random walk after 459288 steps, saw 112444 distinct states, run finished after 3003 ms. (steps per millisecond=152 ) properties seen :0
[2026-05-22 19:35:53] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 337/365 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 58/423 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 146/569 variables, 32/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1322/1891 variables, 569/629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1891 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1891 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1891/1891 variables, and 629 constraints, problems are : Problem set: 0 solved, 2 unsolved in 569 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 569/569 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 337/365 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 58/423 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 146/569 variables, 32/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/569 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1322/1891 variables, 569/630 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1891 variables, 1/631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1891 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1891 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1891/1891 variables, and 631 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3251 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 569/569 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3830ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 880 ms.
Support contains 28 out of 569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 1322/1322 transitions.
Applied a total of 0 rules in 18 ms. Remains 569 /569 variables (removed 0) and now considering 1322/1322 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 569/569 places, 1322/1322 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 1322/1322 transitions.
Applied a total of 0 rules in 17 ms. Remains 569 /569 variables (removed 0) and now considering 1322/1322 (removed 0) transitions.
[2026-05-22 19:35:58] [INFO ] Invariant cache hit.
[2026-05-22 19:35:59] [INFO ] Implicit Places using invariants in 405 ms returned []
[2026-05-22 19:35:59] [INFO ] Invariant cache hit.
[2026-05-22 19:36:00] [INFO ] Implicit Places using invariants and state equation in 1424 ms returned []
Implicit Place search using SMT with State Equation took 1830 ms to find 0 implicit places.
[2026-05-22 19:36:00] [INFO ] Redundant transitions in 110 ms returned []
Running 1291 sub problems to find dead transitions.
[2026-05-22 19:36:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/568 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 1291 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/568 variables, 32/58 constraints. Problems are: Problem set: 0 solved, 1291 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 568/1891 variables, and 58 constraints, problems are : Problem set: 0 solved, 1291 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 26/28 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 0/569 constraints, PredecessorRefiner: 1291/1291 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1291 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/568 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 1291 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/568 variables, 32/58 constraints. Problems are: Problem set: 0 solved, 1291 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/1891 variables, and 58 constraints, problems are : Problem set: 0 solved, 1291 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 26/28 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 0/569 constraints, PredecessorRefiner: 0/1291 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60470ms problems are : Problem set: 0 solved, 1291 unsolved
Search for dead transitions found 0 dead transitions in 60476ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62464 ms. Remains : 569/569 places, 1322/1322 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 19 ms. Remains 569 /569 variables (removed 0) and now considering 1322/1322 (removed 0) transitions.
Running SMT prover for 2 properties.
[2026-05-22 19:37:01] [INFO ] Invariant cache hit.
[2026-05-22 19:37:01] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-22 19:37:01] [INFO ] [Nat]Absence check using 28 positive place invariants in 12 ms returned sat
[2026-05-22 19:37:01] [INFO ] [Nat]Absence check using 28 positive and 32 generalized place invariants in 15 ms returned sat
[2026-05-22 19:37:01] [INFO ] After 514ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-22 19:37:02] [INFO ] After 819ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-22 19:37:02] [INFO ] After 1283ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-22 19:37:02] [INFO ] Flatten gal took : 80 ms
[2026-05-22 19:37:02] [INFO ] Flatten gal took : 40 ms
[2026-05-22 19:37:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3392182465844974886.gal : 15 ms
[2026-05-22 19:37:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18206548550729208856.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/ReachabilityCardinality3392182465844974886.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18206548550729208856.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/ReachabilityCardinality18206548550729208856.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 18
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :18 after 54
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :54 after 270
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :270 after 1872
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1872 after 257040
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :257040 after 6.60563e+07
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :6.60563e+07 after 6.81222e+07
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :6.81222e+07 after 6.81554e+07
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :6.81554e+07 after 9.95079e+08
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :9.95079e+08 after 9.53701e+09
Reachability property ASLink-PT-06a-ReachabilityCardinality-2024-14 is true.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :9.53701e+09 after 2.47113e+11
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.47113e+11 after 1.87176e+12
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.87176e+12 after 1.61104e+13
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1.61104e+13 after 9.47046e+13
Detected timeout of ITS tools.
[2026-05-22 19:37:17] [INFO ] Flatten gal took : 67 ms
[2026-05-22 19:37:17] [INFO ] Applying decomposition
[2026-05-22 19:37:17] [INFO ] Flatten gal took : 35 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/graph7542401669192408074.txt' '-o' '/tmp/graph7542401669192408074.bin' '-w' '/tmp/graph7542401669192408074.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7542401669192408074.bin' '-l' '-1' '-v' '-w' '/tmp/graph7542401669192408074.weights' '-q' '0' '-e' '0.001'
[2026-05-22 19:37:18] [INFO ] Decomposing Gal with order
[2026-05-22 19:37:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 19:37:18] [INFO ] Removed a total of 2530 redundant transitions.
[2026-05-22 19:37:18] [INFO ] Flatten gal took : 202 ms
[2026-05-22 19:37:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 129 labels/synchronizations in 40 ms.
[2026-05-22 19:37:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15145969424748003054.gal : 15 ms
[2026-05-22 19:37:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2393180017623265287.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/ReachabilityCardinality15145969424748003054.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2393180017623265287.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/ReachabilityCardinality2393180017623265287.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 18
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :18 after 216
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :216 after 31824
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :31824 after 4.81075e+06
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :4.81075e+06 after 3.1751e+08
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3.1751e+08 after 3.75239e+08
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3.75239e+08 after 7.31234e+08
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :7.31234e+08 after 1.27966e+09
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.27966e+09 after 1.27966e+09
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.27966e+09 after 2.2378e+09
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.2378e+09 after 5.84186e+09
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 32518 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-22 19:37:33] [INFO ] Flatten gal took : 43 ms
[2026-05-22 19:37:33] [INFO ] Applying decomposition
[2026-05-22 19:37:33] [INFO ] Flatten gal took : 46 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/graph3885319958420002652.txt' '-o' '/tmp/graph3885319958420002652.bin' '-w' '/tmp/graph3885319958420002652.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3885319958420002652.bin' '-l' '-1' '-v' '-w' '/tmp/graph3885319958420002652.weights' '-q' '0' '-e' '0.001'
[2026-05-22 19:37:33] [INFO ] Decomposing Gal with order
[2026-05-22 19:37:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 19:37:34] [INFO ] Removed a total of 2810 redundant transitions.
[2026-05-22 19:37:34] [INFO ] Flatten gal took : 88 ms
[2026-05-22 19:37:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 63 labels/synchronizations in 41 ms.
[2026-05-22 19:37:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10532561160776683948.gal : 15 ms
[2026-05-22 19:37:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15524025658055950070.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/ReachabilityCardinality10532561160776683948.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15524025658055950070.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 ...309
Loading property file /tmp/ReachabilityCardinality15524025658055950070.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :8 after 1.46715e+15
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1.46715e+15 after 2.0088e+18
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :2.0088e+18 after 3.18471e+18
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :3.18471e+18 after 1.06971e+19
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1.06971e+19 after 3.88515e+21
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3.88515e+21 after 1.51388e+22
Detected timeout of ITS tools.
[2026-05-22 20:07:34] [INFO ] Flatten gal took : 47 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4467555067812019148
[2026-05-22 20:07:34] [INFO ] Computing symmetric may disable matrix : 1322 transitions.
[2026-05-22 20:07:34] [INFO ] Applying decomposition
[2026-05-22 20:07:34] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 20:07:34] [INFO ] Computing symmetric may enable matrix : 1322 transitions.
[2026-05-22 20:07:34] [INFO ] Computation of Complete enable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 20:07:34] [INFO ] Flatten gal took : 29 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/graph2289385615698182122.txt' '-o' '/tmp/graph2289385615698182122.bin' '-w' '/tmp/graph2289385615698182122.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2289385615698182122.bin' '-l' '-1' '-v' '-w' '/tmp/graph2289385615698182122.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:07:34] [INFO ] Decomposing Gal with order
[2026-05-22 20:07:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:07:34] [INFO ] Removed a total of 2654 redundant transitions.
[2026-05-22 20:07:34] [INFO ] Flatten gal took : 95 ms
[2026-05-22 20:07:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 90 labels/synchronizations in 9 ms.
[2026-05-22 20:07:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10135632093683179537.gal : 7 ms
[2026-05-22 20:07:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14793237390599440098.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/ReachabilityCardinality10135632093683179537.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14793237390599440098.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 ...309
[2026-05-22 20:07:34] [INFO ] Computing Do-Not-Accords matrix : 1322 transitions.
Loading property file /tmp/ReachabilityCardinality14793237390599440098.prop.
[2026-05-22 20:07:34] [INFO ] Computation of Completed DNA matrix. took 50 ms. Total solver calls (SAT/UNSAT): 0(0/0)
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 18
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :18 after 1296
[2026-05-22 20:07:34] [INFO ] Built C files in 478ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4467555067812019148
Running compilation step : cd /tmp/ltsmin4467555067812019148;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '360' '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'
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1296 after 1.24278e+08
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1.24278e+08 after 1.15121e+10
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1.15121e+10 after 6.26254e+10
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :6.26254e+10 after 3.79031e+11
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3.79031e+11 after 1.68139e+12
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1.68139e+12 after 1.85058e+13
Reachability property ASLink-PT-06a-ReachabilityCardinality-2024-13 is true.
FORMULA ASLink-PT-06a-ReachabilityCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.85058e+13 after 2.78909e+14
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.78909e+14 after 5.02304e+15
Compilation finished in 4728 ms.
Running link step : cd /tmp/ltsmin4467555067812019148;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 83 ms.
Running LTSmin : cd /tmp/ltsmin4467555067812019148;'/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' 'ASLinkPT06aReachabilityCardinality202414==true'
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :5.02304e+15 after 6.77767e+16
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :6.77767e+16 after 3.17265e+17
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :3.17265e+17 after 1.08573e+19
Reachability property ASLink-PT-06a-ReachabilityCardinality-2024-14 is true.
FORMULA ASLink-PT-06a-ReachabilityCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 16385 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.61961e+20,335.206,3921652,8777,7342,5.51159e+06,1.91581e+06,1770,6.64249e+06,464,1.80145e+07,0
Total reachable state count : 161961382868826558960

Verifying 2 reachability properties.
Reachability property ASLink-PT-06a-ReachabilityCardinality-2024-13 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ASLink-PT-06a-ReachabilityCardinality-2024-13,2.5254e+08,394.414,3921652,320,406,5.51159e+06,1.91581e+06,1802,6.64249e+06,465,1.80145e+07,0
Reachability property ASLink-PT-06a-ReachabilityCardinality-2024-14 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ASLink-PT-06a-ReachabilityCardinality-2024-14,356832,394.461,3921652,197,214,5.51159e+06,1.91581e+06,1807,6.64249e+06,465,1.80145e+07,0
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 2366937 ms.

BK_STOP 1779480849908

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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