Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r004-smll-171620117700030.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is ASLink-PT-02a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r004-smll-171620117700030
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 18:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 11 18:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 11 18:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 11 18:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 279K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-00
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-01
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-02
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-03
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-04
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-05
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-06
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-07
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-08
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-09
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-10
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-11
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-12
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-13
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-14
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716220740636

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-02a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-20 15:59:02] [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]
[2024-05-20 15:59:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 15:59:03] [INFO ] Load time of PNML (sax parser for PT used): 208 ms
[2024-05-20 15:59:03] [INFO ] Transformed 626 places.
[2024-05-20 15:59:03] [INFO ] Transformed 1008 transitions.
[2024-05-20 15:59:03] [INFO ] Found NUPN structural information;
[2024-05-20 15:59:03] [INFO ] Parsed PT model containing 626 places and 1008 transitions and 3820 arcs in 395 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 42 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
FORMULA ASLink-PT-02a-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (496 resets) in 1986 ms. (20 steps per ms) remains 6/12 properties
FORMULA ASLink-PT-02a-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (116 resets) in 746 ms. (53 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (111 resets) in 503 ms. (79 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (110 resets) in 828 ms. (48 steps per ms) remains 6/6 properties
[2024-05-20 15:59:04] [INFO ] Flatten gal took : 503 ms
BEST_FIRST walk for 40003 steps (135 resets) in 764 ms. (52 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (98 resets) in 229 ms. (173 steps per ms) remains 6/6 properties
[2024-05-20 15:59:04] [INFO ] Flatten gal took : 286 ms
BEST_FIRST walk for 40004 steps (143 resets) in 376 ms. (106 steps per ms) remains 6/6 properties
[2024-05-20 15:59:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16966568203370599654.gal : 74 ms
[2024-05-20 15:59:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4123980023728356410.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16966568203370599654.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4123980023728356410.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
// Phase 1: matrix 998 rows 626 cols
[2024-05-20 15:59:05] [INFO ] Computed 118 invariants in 73 ms
Loading property file /tmp/ReachabilityCardinality4123980023728356410.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 6
At refinement iteration 2 (OVERLAPS) 97/224 variables, 21/148 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :6 after 10
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :10 after 29
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :29 after 39
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :39 after 64
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 97/245 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 3/248 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :64 after 189
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :189 after 3199
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 11/235 variables, 7/255 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 11/266 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :3199 after 577401
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :577401 after 1.93815e+06
At refinement iteration 9 (OVERLAPS) 386/621 variables, 84/350 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/621 variables, 386/736 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/621 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 5/626 variables, 3/739 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/626 variables, 5/744 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/626 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 998/1624 variables, 626/1370 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1624 variables, 0/1370 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/1624 variables, 0/1370 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1624/1624 variables, and 1370 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2585 ms.
Refiners :[Domain max(s): 626/626 constraints, Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 90/90 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 97/224 variables, 21/148 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 97/245 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 3/248 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 11/235 variables, 7/255 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 11/266 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem ASLink-PT-02a-ReachabilityCardinality-2024-00 is UNSAT
FORMULA ASLink-PT-02a-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-02a-ReachabilityCardinality-2024-14 is UNSAT
FORMULA ASLink-PT-02a-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 386/621 variables, 84/350 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/621 variables, 386/736 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-20 15:59:08] [INFO ] Deduced a trap composed of 30 places in 194 ms of which 28 ms to minimize.
[2024-05-20 15:59:09] [INFO ] Deduced a trap composed of 125 places in 434 ms of which 7 ms to minimize.
[2024-05-20 15:59:09] [INFO ] Deduced a trap composed of 91 places in 351 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/621 variables, 3/739 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/621 variables, 0/739 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 5/626 variables, 3/742 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/626 variables, 5/747 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-20 15:59:10] [INFO ] Deduced a trap composed of 25 places in 210 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/626 variables, 1/748 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/626 variables, 0/748 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 998/1624 variables, 626/1374 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1624 variables, 4/1378 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1624/1624 variables, and 1378 constraints, problems are : Problem set: 2 solved, 4 unsolved in 5009 ms.
Refiners :[Domain max(s): 626/626 constraints, Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 90/90 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 4/4 constraints]
After SMT, in 7918ms problems are : Problem set: 2 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 93 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 998/998 transitions.
Ensure Unique test removed 8 places
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 614 transition count 970
Reduce places removed 28 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 33 rules applied. Total rules applied 73 place count 586 transition count 965
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 78 place count 581 transition count 965
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 78 place count 581 transition count 927
Deduced a syphon composed of 38 places in 4 ms
Ensure Unique test removed 10 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 164 place count 533 transition count 927
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 165 place count 533 transition count 926
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 166 place count 532 transition count 926
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 170 place count 528 transition count 909
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 175 place count 527 transition count 909
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 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 179 place count 526 transition count 906
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 181 place count 525 transition count 905
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 182 place count 524 transition count 905
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 183 place count 523 transition count 897
Iterating global reduction 8 with 1 rules applied. Total rules applied 184 place count 523 transition count 897
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 8 with 20 rules applied. Total rules applied 204 place count 513 transition count 887
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 206 place count 513 transition count 885
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 208 place count 511 transition count 885
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 211 place count 511 transition count 885
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 213 place count 511 transition count 885
Applied a total of 213 rules in 429 ms. Remains 511 /626 variables (removed 115) and now considering 885/998 (removed 113) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 445 ms. Remains : 511/626 places, 885/998 transitions.
RANDOM walk for 40000 steps (566 resets) in 633 ms. (63 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (188 resets) in 183 ms. (217 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (178 resets) in 292 ms. (136 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (185 resets) in 206 ms. (193 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (191 resets) in 225 ms. (177 steps per ms) remains 3/4 properties
FORMULA ASLink-PT-02a-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 885 rows 511 cols
[2024-05-20 15:59:14] [INFO ] Computed 94 invariants in 23 ms
[2024-05-20 15:59:14] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 120/190 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 23/213 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 298/511 variables, 64/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/511 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 885/1396 variables, 511/605 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1396 variables, 9/614 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1396 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1396 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1396/1396 variables, and 614 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1025 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 511/511 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 120/190 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 23/213 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 298/511 variables, 64/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 15:59:15] [INFO ] Deduced a trap composed of 85 places in 251 ms of which 5 ms to minimize.
[2024-05-20 15:59:15] [INFO ] Deduced a trap composed of 114 places in 223 ms of which 3 ms to minimize.
[2024-05-20 15:59:16] [INFO ] Deduced a trap composed of 98 places in 202 ms of which 4 ms to minimize.
[2024-05-20 15:59:16] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/511 variables, 4/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/511 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 885/1396 variables, 511/609 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1396 variables, 9/618 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1396 variables, 3/621 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 15:59:20] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1396 variables, 1/622 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1396 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/1396 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1396/1396 variables, and 622 constraints, problems are : Problem set: 0 solved, 3 unsolved in 11693 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 511/511 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints]
After SMT, in 12802ms problems are : Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :1.93815e+06 after 1.9723e+06
Parikh walk visited 0 properties in 43148 ms.
Support contains 70 out of 511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 511/511 places, 885/885 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 511 transition count 884
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 510 transition count 884
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 510 transition count 880
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 504 transition count 880
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 503 transition count 874
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 503 transition count 874
Applied a total of 14 rules in 63 ms. Remains 503 /511 variables (removed 8) and now considering 874/885 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 503/511 places, 874/885 transitions.
RANDOM walk for 40000 steps (563 resets) in 279 ms. (142 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (188 resets) in 167 ms. (238 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (174 resets) in 275 ms. (144 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (191 resets) in 209 ms. (190 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 220040 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :0 out of 3
Probabilistic random walk after 220040 steps, saw 102237 distinct states, run finished after 3007 ms. (steps per millisecond=73 ) properties seen :0
// Phase 1: matrix 874 rows 503 cols
[2024-05-20 16:00:13] [INFO ] Computed 92 invariants in 10 ms
[2024-05-20 16:00:13] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 101/171 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 21/192 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 309/501 variables, 65/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2/503 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 874/1377 variables, 503/595 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1377 variables, 10/605 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1377 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1377 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1377/1377 variables, and 605 constraints, problems are : Problem set: 0 solved, 3 unsolved in 952 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 68/68 constraints, State Equation: 503/503 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 101/171 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 21/192 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 309/501 variables, 65/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 16:00:14] [INFO ] Deduced a trap composed of 77 places in 236 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/503 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/503 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 874/1377 variables, 503/596 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1377 variables, 10/606 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1377 variables, 3/609 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1377 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/1377 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1377/1377 variables, and 609 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5665 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 68/68 constraints, State Equation: 503/503 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 6679ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 8560 ms.
Support contains 70 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 874/874 transitions.
Applied a total of 0 rules in 37 ms. Remains 503 /503 variables (removed 0) and now considering 874/874 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 503/503 places, 874/874 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 874/874 transitions.
Applied a total of 0 rules in 20 ms. Remains 503 /503 variables (removed 0) and now considering 874/874 (removed 0) transitions.
[2024-05-20 16:00:28] [INFO ] Invariant cache hit.
[2024-05-20 16:00:29] [INFO ] Implicit Places using invariants in 507 ms returned [1, 19, 20, 22, 32, 50, 68, 104, 126, 149, 162, 177, 178, 179, 180, 216, 255, 275, 307, 313, 324, 327, 328, 329, 364, 367, 387, 388, 403, 409, 416, 422, 428, 434, 440, 452, 458, 464]
[2024-05-20 16:00:29] [INFO ] Actually due to overlaps returned [329, 32, 50, 367, 180, 179, 328, 178, 327, 364, 1, 177, 307, 19, 20, 68, 216, 324, 388, 434, 452, 464, 22, 162, 313, 387, 403, 409, 416, 422, 428, 440, 458]
Discarding 33 places :
Implicit Place search using SMT only with invariants took 521 ms to find 33 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 470/503 places, 874/874 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 467 transition count 849
Reduce places removed 25 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 31 rules applied. Total rules applied 59 place count 442 transition count 843
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 65 place count 436 transition count 843
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 65 place count 436 transition count 832
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 87 place count 425 transition count 832
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 91 place count 422 transition count 831
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 92 place count 421 transition count 831
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 92 place count 421 transition count 830
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 94 place count 420 transition count 830
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 100 place count 414 transition count 824
Iterating global reduction 5 with 6 rules applied. Total rules applied 106 place count 414 transition count 824
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 107 place count 413 transition count 823
Iterating global reduction 5 with 1 rules applied. Total rules applied 108 place count 413 transition count 823
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 140 place count 397 transition count 807
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 141 place count 396 transition count 806
Iterating global reduction 5 with 1 rules applied. Total rules applied 142 place count 396 transition count 806
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 143 place count 396 transition count 805
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 145 place count 396 transition count 803
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 147 place count 394 transition count 803
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 6 with 9 rules applied. Total rules applied 156 place count 394 transition count 794
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 165 place count 385 transition count 794
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 170 place count 385 transition count 794
Applied a total of 170 rules in 148 ms. Remains 385 /470 variables (removed 85) and now considering 794/874 (removed 80) transitions.
// Phase 1: matrix 794 rows 385 cols
[2024-05-20 16:00:29] [INFO ] Computed 53 invariants in 6 ms
[2024-05-20 16:00:29] [INFO ] Implicit Places using invariants in 329 ms returned [74, 85, 109, 128, 220, 229, 236, 241, 357, 367, 371, 383]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 330 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 373/503 places, 794/874 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 369 transition count 790
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 369 transition count 790
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 367 transition count 788
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 367 transition count 788
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 365 transition count 786
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 365 transition count 786
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 365 transition count 785
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 363 transition count 783
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 363 transition count 782
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 362 transition count 782
Applied a total of 23 rules in 56 ms. Remains 362 /373 variables (removed 11) and now considering 782/794 (removed 12) transitions.
// Phase 1: matrix 782 rows 362 cols
[2024-05-20 16:00:29] [INFO ] Computed 41 invariants in 7 ms
[2024-05-20 16:00:30] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-05-20 16:00:30] [INFO ] Invariant cache hit.
[2024-05-20 16:00:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-20 16:00:31] [INFO ] Implicit Places using invariants and state equation in 986 ms returned []
Implicit Place search using SMT with State Equation took 1281 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 362/503 places, 782/874 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2356 ms. Remains : 362/503 places, 782/874 transitions.
RANDOM walk for 40000 steps (689 resets) in 208 ms. (191 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (227 resets) in 105 ms. (377 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (220 resets) in 228 ms. (174 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (249 resets) in 197 ms. (202 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 367251 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :0 out of 3
Probabilistic random walk after 367251 steps, saw 115210 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
[2024-05-20 16:00:34] [INFO ] Invariant cache hit.
[2024-05-20 16:00:34] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 143/213 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 149/362 variables, 25/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 782/1144 variables, 362/403 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1144 variables, 1/404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1144 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1144 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1144/1144 variables, and 404 constraints, problems are : Problem set: 0 solved, 3 unsolved in 642 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 362/362 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 143/213 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 16:00:35] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 2 ms to minimize.
[2024-05-20 16:00:35] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 149/362 variables, 25/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 16:00:35] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 16:00:35] [INFO ] Deduced a trap composed of 65 places in 121 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 782/1144 variables, 362/407 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1144 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1144 variables, 3/411 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1144 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1144 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1144/1144 variables, and 411 constraints, problems are : Problem set: 0 solved, 3 unsolved in 11504 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 362/362 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 12176ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 46977 ms.
Support contains 70 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 782/782 transitions.
Applied a total of 0 rules in 18 ms. Remains 362 /362 variables (removed 0) and now considering 782/782 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 362/362 places, 782/782 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 782/782 transitions.
Applied a total of 0 rules in 13 ms. Remains 362 /362 variables (removed 0) and now considering 782/782 (removed 0) transitions.
[2024-05-20 16:01:33] [INFO ] Invariant cache hit.
[2024-05-20 16:01:33] [INFO ] Implicit Places using invariants in 328 ms returned []
[2024-05-20 16:01:33] [INFO ] Invariant cache hit.
[2024-05-20 16:01:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-20 16:01:34] [INFO ] Implicit Places using invariants and state equation in 919 ms returned []
Implicit Place search using SMT with State Equation took 1251 ms to find 0 implicit places.
[2024-05-20 16:01:34] [INFO ] Redundant transitions in 77 ms returned []
Running 781 sub problems to find dead transitions.
[2024-05-20 16:01:34] [INFO ] Invariant cache hit.
[2024-05-20 16:01:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 2 (OVERLAPS) 1/362 variables, 15/37 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 781 unsolved
[2024-05-20 16:01:57] [INFO ] Deduced a trap composed of 47 places in 231 ms of which 3 ms to minimize.
[2024-05-20 16:01:58] [INFO ] Deduced a trap composed of 37 places in 284 ms of which 3 ms to minimize.
[2024-05-20 16:01:59] [INFO ] Deduced a trap composed of 41 places in 298 ms of which 3 ms to minimize.
[2024-05-20 16:01:59] [INFO ] Deduced a trap composed of 59 places in 312 ms of which 4 ms to minimize.
[2024-05-20 16:01:59] [INFO ] Deduced a trap composed of 87 places in 248 ms of which 4 ms to minimize.
[2024-05-20 16:02:00] [INFO ] Deduced a trap composed of 86 places in 238 ms of which 4 ms to minimize.
[2024-05-20 16:02:04] [INFO ] Deduced a trap composed of 64 places in 302 ms of which 4 ms to minimize.
[2024-05-20 16:02:04] [INFO ] Deduced a trap composed of 47 places in 300 ms of which 3 ms to minimize.
[2024-05-20 16:02:04] [INFO ] Deduced a trap composed of 67 places in 284 ms of which 3 ms to minimize.
[2024-05-20 16:02:04] [INFO ] Deduced a trap composed of 46 places in 197 ms of which 3 ms to minimize.
[2024-05-20 16:02:05] [INFO ] Deduced a trap composed of 44 places in 197 ms of which 2 ms to minimize.
[2024-05-20 16:02:05] [INFO ] Deduced a trap composed of 90 places in 227 ms of which 4 ms to minimize.
[2024-05-20 16:02:05] [INFO ] Deduced a trap composed of 85 places in 279 ms of which 3 ms to minimize.
SMT process timed out in 30894ms, After SMT, problems are : Problem set: 0 solved, 781 unsolved
Search for dead transitions found 0 dead transitions in 30911ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32269 ms. Remains : 362/362 places, 782/782 transitions.
Attempting over-approximation, by ignoring read arcs.
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 362 transition count 781
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 361 transition count 781
Applied a total of 2 rules in 16 ms. Remains 361 /362 variables (removed 1) and now considering 781/782 (removed 1) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 781 rows 361 cols
[2024-05-20 16:02:05] [INFO ] Computed 41 invariants in 7 ms
[2024-05-20 16:02:06] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 16:02:06] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-05-20 16:02:06] [INFO ] [Nat]Absence check using 12 positive and 29 generalized place invariants in 17 ms returned sat
[2024-05-20 16:02:08] [INFO ] After 1878ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-20 16:02:11] [INFO ] Deduced a trap composed of 60 places in 205 ms of which 3 ms to minimize.
[2024-05-20 16:02:11] [INFO ] Deduced a trap composed of 58 places in 165 ms of which 3 ms to minimize.
[2024-05-20 16:02:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 458 ms
[2024-05-20 16:02:12] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 2 ms to minimize.
[2024-05-20 16:02:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2024-05-20 16:02:12] [INFO ] Deduced a trap composed of 61 places in 201 ms of which 4 ms to minimize.
[2024-05-20 16:02:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 532 ms
TRAPS : Iteration 1
[2024-05-20 16:02:16] [INFO ] Deduced a trap composed of 61 places in 208 ms of which 3 ms to minimize.
[2024-05-20 16:02:16] [INFO ] Deduced a trap composed of 54 places in 229 ms of which 3 ms to minimize.
[2024-05-20 16:02:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 729 ms
TRAPS : Iteration 2
[2024-05-20 16:02:20] [INFO ] Deduced a trap composed of 37 places in 180 ms of which 8 ms to minimize.
[2024-05-20 16:02:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 255 ms
TRAPS : Iteration 3
[2024-05-20 16:02:27] [INFO ] After 21568ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-20 16:02:30] [INFO ] After 24578ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2024-05-20 16:02:30] [INFO ] Flatten gal took : 79 ms
[2024-05-20 16:02:30] [INFO ] Flatten gal took : 68 ms
[2024-05-20 16:02:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1941052422429954754.gal : 9 ms
[2024-05-20 16:02:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14786780761958916215.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1941052422429954754.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14786780761958916215.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality14786780761958916215.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :7 after 13
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :13 after 79
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :79 after 3511
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :3511 after 17746
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :17746 after 17837
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :17837 after 40701
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :40701 after 77264
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :77264 after 556773
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :556773 after 1.48838e+06
Detected timeout of ITS tools.
[2024-05-20 16:02:45] [INFO ] Flatten gal took : 50 ms
[2024-05-20 16:02:45] [INFO ] Applying decomposition
[2024-05-20 16:02:45] [INFO ] Flatten gal took : 75 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph760639626839968511.txt' '-o' '/tmp/graph760639626839968511.bin' '-w' '/tmp/graph760639626839968511.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph760639626839968511.bin' '-l' '-1' '-v' '-w' '/tmp/graph760639626839968511.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:02:46] [INFO ] Decomposing Gal with order
[2024-05-20 16:02:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:02:46] [INFO ] Removed a total of 1483 redundant transitions.
[2024-05-20 16:02:46] [INFO ] Flatten gal took : 230 ms
[2024-05-20 16:02:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 49 ms.
[2024-05-20 16:02:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11603313088606376545.gal : 30 ms
[2024-05-20 16:02:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13828465450424229238.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11603313088606376545.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13828465450424229238.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality13828465450424229238.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :1 after 23
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :23 after 76
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :76 after 28159
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :28159 after 325354
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :325354 after 1.08051e+06
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :1.08051e+06 after 1.72013e+06
Reachability property ASLink-PT-02a-ReachabilityCardinality-2024-12 is true.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1.72013e+06 after 1.61588e+07
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.61588e+07 after 2.83117e+07
Invariant property ASLink-PT-02a-ReachabilityCardinality-2024-08 does not hold.
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.83117e+07 after 4.89684e+07
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :4.89684e+07 after 5.49733e+07
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 56146 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-20 16:03:02] [INFO ] Flatten gal took : 48 ms
[2024-05-20 16:03:02] [INFO ] Applying decomposition
[2024-05-20 16:03:02] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8553419119844563421.txt' '-o' '/tmp/graph8553419119844563421.bin' '-w' '/tmp/graph8553419119844563421.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8553419119844563421.bin' '-l' '-1' '-v' '-w' '/tmp/graph8553419119844563421.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:03:02] [INFO ] Decomposing Gal with order
[2024-05-20 16:03:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:03:02] [INFO ] Removed a total of 1497 redundant transitions.
[2024-05-20 16:03:02] [INFO ] Flatten gal took : 93 ms
[2024-05-20 16:03:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 31 ms.
[2024-05-20 16:03:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5625462822900423681.gal : 12 ms
[2024-05-20 16:03:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12842866175947627496.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5625462822900423681.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12842866175947627496.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality12842866175947627496.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 10
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :10 after 6.30831e+06
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :6.30831e+06 after 1.26166e+07
Invariant property ASLink-PT-02a-ReachabilityCardinality-2024-06 does not hold.
FORMULA ASLink-PT-02a-ReachabilityCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1.26166e+07 after 3.00763e+08
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :3.00763e+08 after 5.14725e+08
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :5.14725e+08 after 8.80526e+08
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :8.80526e+08 after 7.81328e+09
Invariant property ASLink-PT-02a-ReachabilityCardinality-2024-08 does not hold.
FORMULA ASLink-PT-02a-ReachabilityCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2.79529e+10 after 7.40301e+10
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.32492e+11 after 3.22924e+11
Reachability property ASLink-PT-02a-ReachabilityCardinality-2024-12 is true.
FORMULA ASLink-PT-02a-ReachabilityCardinality-2024-12 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 1025 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,7.26442e+12,90.4801,944424,19269,2375,1.60245e+06,45514,1999,3.63662e+06,396,287805,0
Total reachable state count : 7264418961401

Verifying 3 reachability properties.
Invariant property ASLink-PT-02a-ReachabilityCardinality-2024-06 does not hold.

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-02a-ReachabilityCardinality-2024-06,1.70662e+08,92.4487,944424,1202,437,1.60245e+06,45514,2007,3.63662e+06,401,287805,0
Invariant property ASLink-PT-02a-ReachabilityCardinality-2024-08 does not hold.

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-02a-ReachabilityCardinality-2024-08,1.4483e+06,163.574,944424,1526,778,1.60245e+06,45514,2245,3.63662e+06,440,287805,0
Reachability property ASLink-PT-02a-ReachabilityCardinality-2024-12 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-02a-ReachabilityCardinality-2024-12,27216,180.339,944424,259,160,1.60245e+06,45514,2370,3.63662e+06,454,287805,0
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 420272 ms.

BK_STOP 1716221163171

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-02a"
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-5568"
echo " Executing tool itstools"
echo " Input is ASLink-PT-02a, 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 r004-smll-171620117700030"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-02a.tgz
mv ASLink-PT-02a 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;